From 5748478e1588d1906b823a1ad37bffc0709aee6c Mon Sep 17 00:00:00 2001 From: David A Roberts Date: Mon, 8 Feb 2021 14:15:27 +1000 Subject: [PATCH] v1.0.0 --- docs/doc/Language-Church.html | 2 +- docs/doc/Language-Edward.html | 2 +- docs/doc/Language-Graphviz.html | 1 + docs/doc/Language-PyMC3.html | 2 +- docs/doc/Language-Stan.html | 4 +- docs/doc/Language-Stochaskell-Expression.html | 9 +- docs/doc/Language-Stochaskell-Plot.html | 810 +++--------------- docs/doc/Language-Stochaskell-Prelude.html | 550 +++++++----- docs/doc/Language-Stochaskell.html | 134 ++- docs/doc/doc-index-124.html | 2 +- docs/doc/doc-index-33.html | 2 +- docs/doc/doc-index-35.html | 2 +- docs/doc/doc-index-36.html | 2 +- docs/doc/doc-index-37.html | 2 +- docs/doc/doc-index-38.html | 2 +- docs/doc/doc-index-42.html | 2 +- docs/doc/doc-index-43.html | 2 +- docs/doc/doc-index-45.html | 2 +- docs/doc/doc-index-46.html | 2 +- docs/doc/doc-index-47.html | 2 +- docs/doc/doc-index-58.html | 2 +- docs/doc/doc-index-60.html | 2 +- docs/doc/doc-index-61.html | 2 +- docs/doc/doc-index-62.html | 2 +- docs/doc/doc-index-63.html | 2 +- docs/doc/doc-index-92.html | 2 +- docs/doc/doc-index-94.html | 2 +- docs/doc/doc-index-95.html | 2 +- docs/doc/doc-index-A.html | 2 +- docs/doc/doc-index-All.html | 2 +- docs/doc/doc-index-B.html | 2 +- docs/doc/doc-index-C.html | 2 +- docs/doc/doc-index-D.html | 2 +- docs/doc/doc-index-E.html | 2 +- docs/doc/doc-index-F.html | 2 +- docs/doc/doc-index-G.html | 2 +- docs/doc/doc-index-H.html | 2 +- docs/doc/doc-index-I.html | 2 +- docs/doc/doc-index-J.html | 2 +- docs/doc/doc-index-K.html | 2 +- docs/doc/doc-index-L.html | 2 +- docs/doc/doc-index-M.html | 2 +- docs/doc/doc-index-N.html | 2 +- docs/doc/doc-index-O.html | 2 +- docs/doc/doc-index-P.html | 2 +- docs/doc/doc-index-Q.html | 2 +- docs/doc/doc-index-R.html | 2 +- docs/doc/doc-index-S.html | 2 +- docs/doc/doc-index-T.html | 2 +- docs/doc/doc-index-U.html | 2 +- docs/doc/doc-index-V.html | 2 +- docs/doc/doc-index-W.html | 2 +- docs/doc/doc-index-X.html | 2 +- docs/doc/doc-index-Y.html | 2 +- docs/doc/doc-index-Z.html | 2 +- docs/doc/doc-index.html | 2 +- docs/doc/haddock-bundle.min.js | 2 +- docs/doc/index.html | 2 +- docs/doc/meta.json | 2 +- stack.yaml | 4 +- stack.yaml.lock | 45 +- stochaskell/backward-cpp | 2 +- stochaskell/package.yaml | 2 +- stochaskell/src/Language/Church.hs | 2 +- stochaskell/src/Language/Edward.hs | 2 +- stochaskell/src/Language/PyMC3.hs | 2 +- stochaskell/src/Language/Stan.hs | 2 +- stochaskell/src/Language/Stochaskell.hs | 4 +- .../src/Language/Stochaskell/Expression.hs | 2 +- stochaskell/src/Language/Stochaskell/Plot.hs | 2 +- .../src/Language/Stochaskell/Prelude.hs | 2 +- stochaskell/stack.yaml | 4 +- stochaskell/stack.yaml.lock | 12 +- 73 files changed, 685 insertions(+), 1016 deletions(-) create mode 100644 docs/doc/Language-Graphviz.html diff --git a/docs/doc/Language-Church.html b/docs/doc/Language-Church.html index 5976501..8d2c625 100644 --- a/docs/doc/Language-Church.html +++ b/docs/doc/Language-Church.html @@ -1 +1 @@ -Language.Church

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Church

Description

 
Synopsis

Documentation

mhChurch :: (ExprTuple t, Read t) => P t -> IO [t] #

Metropolis-Hastings inference via the Church code generation backend

simChurchVec :: (Read t, ExprType t) => P (Expression [t]) -> IO [t] #

sample a random vector via Church

\ No newline at end of file +Language.Church

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Church

Description

 
Synopsis

Documentation

mhChurch :: (ExprTuple t, Read t) => P t -> IO [t] #

Metropolis-Hastings inference via the Church code generation backend

simChurchVec :: (Read t, ExprType t) => P (Expression [t]) -> IO [t] #

sample a random vector via Church

\ No newline at end of file diff --git a/docs/doc/Language-Edward.html b/docs/doc/Language-Edward.html index e0c1864..5893b07 100644 --- a/docs/doc/Language-Edward.html +++ b/docs/doc/Language-Edward.html @@ -1 +1 @@ -Language.Edward

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Edward

Description

 
Synopsis

Documentation

hmcEdward :: (ExprTuple t, Read t) => Int -> Int -> Double -> P t -> Maybe t -> IO [t] #

hmcEdward numSamples numSteps stepSize program initialState

perform Hamiltonian Monte Carlo inference via the Edward code generation backend

edProgram :: ExprTuple t => Int -> Int -> Double -> P t -> Maybe t -> String #

generate Edward code, as used by hmcEdward

\ No newline at end of file +Language.Edward

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Edward

Description

 
Synopsis

Documentation

hmcEdward :: (ExprTuple t, Read t) => Int -> Int -> Double -> P t -> Maybe t -> IO [t] #

hmcEdward numSamples numSteps stepSize program initialState

perform Hamiltonian Monte Carlo inference via the Edward code generation backend

edProgram :: ExprTuple t => Int -> Int -> Double -> P t -> Maybe t -> String #

generate Edward code, as used by hmcEdward

\ No newline at end of file diff --git a/docs/doc/Language-Graphviz.html b/docs/doc/Language-Graphviz.html new file mode 100644 index 0000000..d4c986f --- /dev/null +++ b/docs/doc/Language-Graphviz.html @@ -0,0 +1 @@ +Language.Graphviz

stochaskell-1.0.0: A probabilistic programming language

Safe HaskellNone
LanguageHaskell2010

Language.Graphviz

Documentation

dotId :: [Label] -> Id -> String #

dotConst :: [Label] -> ConstVal -> String #

dotConsts :: [Label] -> [NodeRef] -> String #

dotApply :: Label -> String -> [NodeRef] -> String #

dotNodeRef :: [Label] -> Label -> NodeRef -> String #

dotNode :: [Label] -> Label -> Node -> String #

dotDAG :: [Label] -> DAG -> Maybe NodeRef -> String #

dotPNode :: Label -> PNode -> String #

dotPNodes :: Map Id PNode -> String #

dotPBlock :: PBlock -> [NodeRef] -> String #

edgeNodeRefs :: [Label] -> Label -> [NodeRef] -> String #

edgeApply :: [Label] -> Label -> [NodeRef] -> String #

edgeNodeRef :: [Label] -> Label -> NodeRef -> String #

edgeNode :: [Label] -> Label -> Node -> String #

edgeDAG :: [Label] -> DAG -> Maybe NodeRef -> String #

edgePNode :: Label -> PNode -> String #

edgePNodes :: Map Id PNode -> String #

edgePBlock :: PBlock -> String #

graphviz :: ExprTuple t => P t -> String #

vizIR :: ExprTuple t => P t -> IO String #

\ No newline at end of file diff --git a/docs/doc/Language-PyMC3.html b/docs/doc/Language-PyMC3.html index 90c4166..2a26528 100644 --- a/docs/doc/Language-PyMC3.html +++ b/docs/doc/Language-PyMC3.html @@ -1 +1 @@ -Language.PyMC3

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.PyMC3

Description

 

Documentation

data PyMC3Inference #

Constructors

PyMC3Sample 

Fields

Instances
Show PyMC3Inference # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Inference -> ShowS #

show :: PyMC3Inference -> String #

showList :: [PyMC3Inference] -> ShowS #

data PyMC3Step #

Constructors

NUTS 
Metropolis 
Slice 
HamiltonianMC 

Fields

Instances
Show PyMC3Step # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Step -> ShowS #

show :: PyMC3Step -> String #

showList :: [PyMC3Step] -> ShowS #

defaultPyMC3Inference :: PyMC3Inference #

default PyMC3 configuration, see https://docs.pymc.io/api/inference.html

runPyMC3 :: (ExprTuple t, Read t) => PyMC3Inference -> P t -> Maybe t -> IO [t] #

perform inference via the PyMC3 code generation backend

pmProgram :: ExprTuple t => P t -> String #

generate PyMC3 code, as used by runPyMC3

\ No newline at end of file +Language.PyMC3

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.PyMC3

Description

 

Documentation

data PyMC3Inference #

Constructors

PyMC3Sample 

Fields

Instances
Show PyMC3Inference # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Inference -> ShowS #

show :: PyMC3Inference -> String #

showList :: [PyMC3Inference] -> ShowS #

data PyMC3Step #

Constructors

NUTS 
Metropolis 
Slice 
HamiltonianMC 

Fields

Instances
Show PyMC3Step # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Step -> ShowS #

show :: PyMC3Step -> String #

showList :: [PyMC3Step] -> ShowS #

defaultPyMC3Inference :: PyMC3Inference #

default PyMC3 configuration, see https://docs.pymc.io/api/inference.html

runPyMC3 :: (ExprTuple t, Read t) => PyMC3Inference -> P t -> Maybe t -> IO [t] #

perform inference via the PyMC3 code generation backend

pmProgram :: ExprTuple t => P t -> String -> String #

generate PyMC3 code, as used by runPyMC3

pmProgram' :: ExprTuple t => PyMC3Inference -> P t -> Maybe t -> String #

\ No newline at end of file diff --git a/docs/doc/Language-Stan.html b/docs/doc/Language-Stan.html index a04e80a..9957889 100644 --- a/docs/doc/Language-Stan.html +++ b/docs/doc/Language-Stan.html @@ -1,3 +1,3 @@ -Language.Stan

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stan

Description

 

Documentation

data StanMethod #

Constructors

StanSample 

Fields

Instances
Show StanMethod # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanMethod -> ShowS #

show :: StanMethod -> String #

showList :: [StanMethod] -> ShowS #

data StanHMCMetric #

Constructors

StanUnitEMetric 
StanDiagEMetric 
StanDenseEMetric 
Instances
Show StanHMCMetric # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCMetric -> ShowS #

show :: StanHMCMetric -> String #

showList :: [StanHMCMetric] -> ShowS #

data StanHMCEngine #

Constructors

StanStaticHMCEngine 

Fields

StanNUTSEngine 

Fields

Instances
Show StanHMCEngine # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCEngine -> ShowS #

show :: StanHMCEngine -> String #

showList :: [StanHMCEngine] -> ShowS #

defaultStanMethod :: StanMethod #

default Stan configuration, see +Language.Stan

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stan

Description

 

Documentation

data StanMethod #

Constructors

StanSample 

Fields

Instances
Show StanMethod # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanMethod -> ShowS #

show :: StanMethod -> String #

showList :: [StanMethod] -> ShowS #

data StanHMCMetric #

Constructors

StanUnitEMetric 
StanDiagEMetric 
StanDenseEMetric 
Instances
Show StanHMCMetric # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCMetric -> ShowS #

show :: StanHMCMetric -> String #

showList :: [StanHMCMetric] -> ShowS #

data StanHMCEngine #

Constructors

StanStaticHMCEngine 

Fields

StanNUTSEngine 

Fields

Instances
Show StanHMCEngine # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCEngine -> ShowS #

show :: StanHMCEngine -> String #

showList :: [StanHMCEngine] -> ShowS #

defaultStanMethod :: StanMethod #

default Stan configuration, see https://github.com/stan-dev/cmdstan/releases/download/v2.18.0/cmdstan-guide.pdf

hmcStan :: ExprTuple t => Int -> P t -> IO [t] #

perform Hamiltonian Monte Carlo inference on the given posterior program, - via the Stan code generation backend, returning the given number of samples

see runStan for a more advanced interface

hmcStanInit :: ExprTuple t => Int -> P t -> t -> IO [t] #

like hmcStan but specifying the initial MC state

runStan :: ExprTuple t => StanMethod -> P t -> Maybe t -> IO [t] #

perform inference via the Stan code generation backend

\ No newline at end of file + via the Stan code generation backend, returning the given number of samples

see runStan for a more advanced interface

hmcStanInit :: ExprTuple t => Int -> P t -> t -> IO [t] #

like hmcStan but specifying the initial MC state

runStan :: ExprTuple t => StanMethod -> P t -> Maybe t -> IO [t] #

perform inference via the Stan code generation backend

\ No newline at end of file diff --git a/docs/doc/Language-Stochaskell-Expression.html b/docs/doc/Language-Stochaskell-Expression.html index d062023..baf683f 100644 --- a/docs/doc/Language-Stochaskell-Expression.html +++ b/docs/doc/Language-Stochaskell-Expression.html @@ -1 +1,8 @@ -Language.Stochaskell.Expression

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell.Expression

Description

 
Synopsis

Documentation

class ExprType c => Constructor c where #

Stochaskell interface for algebraic data types

Minimal complete definition

tags, construct, deconstruct

Methods

tags :: Tags c #

list of possible tags in tagged union

construct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> c #

construct ADT from tag and arguments

deconstruct :: (forall t. ExprType t => Expression t -> a) -> c -> (Tag, [a]) #

deconstruct ADT to tag and arguments

toConcreteC :: ConstVal -> c #

convert constant to ADT value

fromConcreteC :: c -> Expression c #

convert ADT value to Stochaskell expression

data ConstVal #

constant numeric array (of arbitrary dimension) or tagged union value

Instances
IsList ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Item ConstVal :: * #

Methods

fromList :: [Item ConstVal] -> ConstVal #

fromListN :: Int -> [Item ConstVal] -> ConstVal #

toList :: ConstVal -> [Item ConstVal] #

Enum ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

succ :: ConstVal -> ConstVal #

pred :: ConstVal -> ConstVal #

toEnum :: Int -> ConstVal #

fromEnum :: ConstVal -> Int #

enumFrom :: ConstVal -> [ConstVal] #

enumFromThen :: ConstVal -> ConstVal -> [ConstVal] #

enumFromTo :: ConstVal -> ConstVal -> [ConstVal] #

enumFromThenTo :: ConstVal -> ConstVal -> ConstVal -> [ConstVal] #

Eq ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==) :: ConstVal -> ConstVal -> Bool #

(/=) :: ConstVal -> ConstVal -> Bool #

Floating ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

pi :: ConstVal #

exp :: ConstVal -> ConstVal #

log :: ConstVal -> ConstVal #

sqrt :: ConstVal -> ConstVal #

(**) :: ConstVal -> ConstVal -> ConstVal #

logBase :: ConstVal -> ConstVal -> ConstVal #

sin :: ConstVal -> ConstVal #

cos :: ConstVal -> ConstVal #

tan :: ConstVal -> ConstVal #

asin :: ConstVal -> ConstVal #

acos :: ConstVal -> ConstVal #

atan :: ConstVal -> ConstVal #

sinh :: ConstVal -> ConstVal #

cosh :: ConstVal -> ConstVal #

tanh :: ConstVal -> ConstVal #

asinh :: ConstVal -> ConstVal #

acosh :: ConstVal -> ConstVal #

atanh :: ConstVal -> ConstVal #

log1p :: ConstVal -> ConstVal #

expm1 :: ConstVal -> ConstVal #

log1pexp :: ConstVal -> ConstVal #

log1mexp :: ConstVal -> ConstVal #

Fractional ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(/) :: ConstVal -> ConstVal -> ConstVal #

recip :: ConstVal -> ConstVal #

fromRational :: Rational -> ConstVal #

Integral ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

quot :: ConstVal -> ConstVal -> ConstVal #

rem :: ConstVal -> ConstVal -> ConstVal #

div :: ConstVal -> ConstVal -> ConstVal #

mod :: ConstVal -> ConstVal -> ConstVal #

quotRem :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

divMod :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

toInteger :: ConstVal -> Integer #

Num ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(+) :: ConstVal -> ConstVal -> ConstVal #

(-) :: ConstVal -> ConstVal -> ConstVal #

(*) :: ConstVal -> ConstVal -> ConstVal #

negate :: ConstVal -> ConstVal #

abs :: ConstVal -> ConstVal #

signum :: ConstVal -> ConstVal #

fromInteger :: Integer -> ConstVal #

Ord ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

compare :: ConstVal -> ConstVal -> Ordering #

(<) :: ConstVal -> ConstVal -> Bool #

(<=) :: ConstVal -> ConstVal -> Bool #

(>) :: ConstVal -> ConstVal -> Bool #

(>=) :: ConstVal -> ConstVal -> Bool #

max :: ConstVal -> ConstVal -> ConstVal #

min :: ConstVal -> ConstVal -> ConstVal #

Read ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

readsPrec :: Int -> ReadS ConstVal #

readList :: ReadS [ConstVal] #

readPrec :: ReadPrec ConstVal #

readListPrec :: ReadPrec [ConstVal] #

Real ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

toRational :: ConstVal -> Rational #

Show ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

showsPrec :: Int -> ConstVal -> ShowS #

show :: ConstVal -> String #

showList :: [ConstVal] -> ShowS #

Ix ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

range :: (ConstVal, ConstVal) -> [ConstVal] #

index :: (ConstVal, ConstVal) -> ConstVal -> Int #

unsafeIndex :: (ConstVal, ConstVal) -> ConstVal -> Int

inRange :: (ConstVal, ConstVal) -> ConstVal -> Bool #

rangeSize :: (ConstVal, ConstVal) -> Int #

unsafeRangeSize :: (ConstVal, ConstVal) -> Int

Generic ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Rep ConstVal :: * -> * #

Methods

from :: ConstVal -> Rep ConstVal x #

to :: Rep ConstVal x -> ConstVal #

Semigroup ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<>) :: ConstVal -> ConstVal -> ConstVal #

sconcat :: NonEmpty ConstVal -> ConstVal #

stimes :: Integral b => b -> ConstVal -> ConstVal #

Boolean ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

true :: ConstVal #

false :: ConstVal #

notB :: ConstVal -> ConstVal #

(&&*) :: ConstVal -> ConstVal -> ConstVal #

(||*) :: ConstVal -> ConstVal -> ConstVal #

IfB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

ifB :: bool ~ BooleanOf ConstVal => bool -> ConstVal -> ConstVal -> ConstVal #

EqB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(/=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

OrdB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(<=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

NFData ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

rnf :: ConstVal -> () #

Transfinite ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

infinity :: ConstVal #

negativeInfinity :: ConstVal #

notANumber :: ConstVal #

isInfinite :: ConstVal -> Bool

isNaN :: ConstVal -> Bool

Transposable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

tr :: ConstVal -> ConstVal #

tr' :: ConstVal -> ConstVal #

SquareMatrix ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

chol :: ConstVal -> ConstVal #

inv :: ConstVal -> ConstVal #

det :: ConstVal -> ConstVal #

logDet :: ConstVal -> ConstVal #

LinearOperator ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(#>) :: ConstVal -> ConstVal -> ConstVal #

(<#) :: ConstVal -> ConstVal -> ConstVal #

(<\>) :: ConstVal -> ConstVal -> ConstVal #

diag :: ConstVal -> ConstVal #

asColumn :: ConstVal -> ConstVal #

asRow :: ConstVal -> ConstVal #

outer :: ConstVal -> ConstVal -> ConstVal #

InnerProduct ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<.>) :: ConstVal -> ConstVal -> ConstVal #

Scalable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(*>) :: ConstVal -> ConstVal -> ConstVal #

Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

type Rep ConstVal # 
Instance details

Defined in Data.Expression.Const

type Rep ConstVal = D1 (MetaData "ConstVal" "Data.Expression.Const" "stochaskell-0.1.0-65z7JdggzSJA9zhw9WR8l" False) (C1 (MetaCons "Exact" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (UArray [Integer] Int))) :+: (C1 (MetaCons "Approx" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (UArray [Integer] Double))) :+: C1 (MetaCons "Tagged" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Tag) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [ConstVal]))))
type BooleanOf ConstVal # 
Instance details

Defined in Data.Expression.Const

type BooleanOf ConstVal = ConstVal
type Item ConstVal # 
Instance details

Defined in Data.Expression.Const

type Item ConstVal = ConstVal

data DExpr #

dynamically typed Stochaskell expression

Instances
Eq DExpr # 
Instance details

Defined in Data.Expression

Methods

(==) :: DExpr -> DExpr -> Bool #

(/=) :: DExpr -> DExpr -> Bool #

Floating DExpr # 
Instance details

Defined in Data.Expression

Methods

pi :: DExpr #

exp :: DExpr -> DExpr #

log :: DExpr -> DExpr #

sqrt :: DExpr -> DExpr #

(**) :: DExpr -> DExpr -> DExpr #

logBase :: DExpr -> DExpr -> DExpr #

sin :: DExpr -> DExpr #

cos :: DExpr -> DExpr #

tan :: DExpr -> DExpr #

asin :: DExpr -> DExpr #

acos :: DExpr -> DExpr #

atan :: DExpr -> DExpr #

sinh :: DExpr -> DExpr #

cosh :: DExpr -> DExpr #

tanh :: DExpr -> DExpr #

asinh :: DExpr -> DExpr #

acosh :: DExpr -> DExpr #

atanh :: DExpr -> DExpr #

log1p :: DExpr -> DExpr #

expm1 :: DExpr -> DExpr #

log1pexp :: DExpr -> DExpr #

log1mexp :: DExpr -> DExpr #

Fractional DExpr # 
Instance details

Defined in Data.Expression

Methods

(/) :: DExpr -> DExpr -> DExpr #

recip :: DExpr -> DExpr #

fromRational :: Rational -> DExpr #

Num DExpr # 
Instance details

Defined in Data.Expression

Methods

(+) :: DExpr -> DExpr -> DExpr #

(-) :: DExpr -> DExpr -> DExpr #

(*) :: DExpr -> DExpr -> DExpr #

negate :: DExpr -> DExpr #

abs :: DExpr -> DExpr #

signum :: DExpr -> DExpr #

fromInteger :: Integer -> DExpr #

Ord DExpr # 
Instance details

Defined in Data.Expression

Methods

compare :: DExpr -> DExpr -> Ordering #

(<) :: DExpr -> DExpr -> Bool #

(<=) :: DExpr -> DExpr -> Bool #

(>) :: DExpr -> DExpr -> Bool #

(>=) :: DExpr -> DExpr -> Bool #

max :: DExpr -> DExpr -> DExpr #

min :: DExpr -> DExpr -> DExpr #

Show DExpr # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> DExpr -> ShowS #

show :: DExpr -> String #

showList :: [DExpr] -> ShowS #

Semigroup DExpr # 
Instance details

Defined in Data.Expression

Methods

(<>) :: DExpr -> DExpr -> DExpr #

sconcat :: NonEmpty DExpr -> DExpr #

stimes :: Integral b => b -> DExpr -> DExpr #

Boolean DExpr # 
Instance details

Defined in Data.Expression

Methods

true :: DExpr #

false :: DExpr #

notB :: DExpr -> DExpr #

(&&*) :: DExpr -> DExpr -> DExpr #

(||*) :: DExpr -> DExpr -> DExpr #

IfB DExpr # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf DExpr => bool -> DExpr -> DExpr -> DExpr #

EqB DExpr # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

(/=*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

Transposable DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

tr :: DExpr -> DExpr #

tr' :: DExpr -> DExpr #

SquareMatrix DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

chol :: DExpr -> DExpr #

inv :: DExpr -> DExpr #

det :: DExpr -> DExpr #

logDet :: DExpr -> DExpr #

LinearOperator DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(#>) :: DExpr -> DExpr -> DExpr #

(<#) :: DExpr -> DExpr -> DExpr #

(<\>) :: DExpr -> DExpr -> DExpr #

diag :: DExpr -> DExpr #

asColumn :: DExpr -> DExpr #

asRow :: DExpr -> DExpr #

outer :: DExpr -> DExpr -> DExpr #

Matrix DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray DExpr DExpr -> DExpr #

blockMatrix :: [[DExpr]] -> DExpr #

eye :: DExpr -> DExpr #

zeros :: DExpr -> DExpr -> DExpr #

matrixRows :: DExpr -> DExpr #

matrixCols :: DExpr -> DExpr #

designMatrix :: (Indexable v DExpr DExpr, Num DExpr) => DExpr -> AbstractArray DExpr v -> DExpr #

Vector DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray DExpr DExpr -> DExpr #

blockVector :: [DExpr] -> DExpr #

vectorSize :: DExpr -> DExpr #

Indexable DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(!) :: DExpr -> DExpr -> DExpr #

bounds :: DExpr -> Interval DExpr #

deleteAt :: DExpr -> DExpr -> DExpr #

insertAt :: DExpr -> (DExpr, DExpr) -> DExpr #

replaceAt :: DExpr -> (DExpr, DExpr) -> DExpr #

deleteIndex :: DExpr -> DExpr -> DExpr #

insertIndex :: DExpr -> DExpr -> DExpr -> DExpr #

replaceIndex :: DExpr -> DExpr -> DExpr -> DExpr #

type BooleanOf DExpr # 
Instance details

Defined in Data.Expression

type BooleanOf DExpr = DExpr

type Eval = Either String ConstVal #

either an evaluated constant or error string

newtype Expression t #

Stochaskell expression representation (statically typed)

Constructors

Expression 

Fields

Instances
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: * #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: * #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: * #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: * #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

ExprType r => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

(Show t, ExprType t) => Show (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> Expression t -> ShowS #

show :: Expression t -> String #

showList :: [Expression t] -> ShowS #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool

isNaN :: Expression t -> Bool

ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

(<\>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #

show :: (a -> b -> Expression t) -> String #

showList :: [a -> b -> Expression t] -> ShowS #

(ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> Expression t) -> ShowS #

show :: (a -> Expression t) -> String #

showList :: [a -> Expression t] -> ShowS #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool

data EEnv #

Instances
Show EEnv # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> EEnv -> ShowS #

show :: EEnv -> String #

showList :: [EEnv] -> ShowS #

type Env = Map LVal ConstVal #

type Expr t = Expression t #

class ExprType t => ExprTuple t where #

Stochaskell interface for tuples of expressions

Minimal complete definition

tupleSize, fromExprTuple, toExprTuple, fromConstVals, typesOf

Methods

tupleSize :: TupleSize t #

numer of tuple elements

fromExprTuple :: t -> [DExpr] #

convert to list of expressions

toExprTuple :: [DExpr] -> t #

convert from list of expressions

fromConstVals :: [ConstVal] -> t #

convert from list of constants

typesOf :: TypesOf t #

list of types of elements

Instances
ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

class ExprType t where #

Stochaskell interface for native Haskell types

Minimal complete definition

typeOf, toConcrete, fromConcrete, constVal

Methods

typeOf :: TypeOf t #

corresponding Stochaskell type

toConcrete :: ConstVal -> t #

convert constant to native value

fromConcrete :: t -> Expression t #

convert native value to Stochaskell expression

constVal :: t -> ConstVal #

convert native value to constant

constExpr :: ConstVal -> Expression t #

convert constant to Stochaskell expression

Instances
ExprType Bool # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Bool #

toConcrete :: ConstVal -> Bool #

fromConcrete :: Bool -> Expression Bool #

constVal :: Bool -> ConstVal #

constExpr :: ConstVal -> Expression Bool #

ExprType Double # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Double #

toConcrete :: ConstVal -> Double #

fromConcrete :: Double -> Expression Double #

constVal :: Double -> ConstVal #

constExpr :: ConstVal -> Expression Double #

ExprType Integer # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Integer #

toConcrete :: ConstVal -> Integer #

fromConcrete :: Integer -> Expression Integer #

constVal :: Integer -> ConstVal #

constExpr :: ConstVal -> Expression Integer #

ExprType t => ExprType [t] # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf [t] #

toConcrete :: ConstVal -> [t] #

fromConcrete :: [t] -> Expression [t] #

constVal :: [t] -> ConstVal #

constExpr :: ConstVal -> Expression [t] #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

data Id #

variable identifier

Instances
Eq Id # 
Instance details

Defined in Data.Expression

Methods

(==) :: Id -> Id -> Bool #

(/=) :: Id -> Id -> Bool #

Ord Id # 
Instance details

Defined in Data.Expression

Methods

compare :: Id -> Id -> Ordering #

(<) :: Id -> Id -> Bool #

(<=) :: Id -> Id -> Bool #

(>) :: Id -> Id -> Bool #

(>=) :: Id -> Id -> Bool #

max :: Id -> Id -> Id #

min :: Id -> Id -> Id #

Show Id # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Id -> ShowS #

show :: Id -> String #

showList :: [Id] -> ShowS #

data LVal #

Constructors

LVar Id 
Instances
Eq LVal # 
Instance details

Defined in Data.Expression

Methods

(==) :: LVal -> LVal -> Bool #

(/=) :: LVal -> LVal -> Bool #

Ord LVal # 
Instance details

Defined in Data.Expression

Methods

compare :: LVal -> LVal -> Ordering #

(<) :: LVal -> LVal -> Bool #

(<=) :: LVal -> LVal -> Bool #

(>) :: LVal -> LVal -> Bool #

(>=) :: LVal -> LVal -> Bool #

max :: LVal -> LVal -> LVal #

min :: LVal -> LVal -> LVal #

Show LVal # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> LVal -> ShowS #

show :: LVal -> String #

showList :: [LVal] -> ShowS #

data NodeRef #

reference to a node in the computation graph

Instances
Eq NodeRef # 
Instance details

Defined in Data.Expression

Methods

(==) :: NodeRef -> NodeRef -> Bool #

(/=) :: NodeRef -> NodeRef -> Bool #

Ord NodeRef # 
Instance details

Defined in Data.Expression

Methods

compare :: NodeRef -> NodeRef -> Ordering #

(<) :: NodeRef -> NodeRef -> Bool #

(<=) :: NodeRef -> NodeRef -> Bool #

(>) :: NodeRef -> NodeRef -> Bool #

(>=) :: NodeRef -> NodeRef -> Bool #

max :: NodeRef -> NodeRef -> NodeRef #

min :: NodeRef -> NodeRef -> NodeRef #

Show NodeRef # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> NodeRef -> ShowS #

show :: NodeRef -> String #

showList :: [NodeRef] -> ShowS #

type Tag = Int #

newtype Tags t #

Constructors

Tags [Tag] 

newtype TupleSize t #

Constructors

TupleSize Int 

data Type #

Stochaskell types

Constructors

IntT 
RealT 
SubrangeT Type (Maybe NodeRef) (Maybe NodeRef) 
ArrayT (Maybe String) [Interval NodeRef] Type 
TupleT [Type] 
UnionT [[Type]] 
UnknownType 
Instances
Eq Type # 
Instance details

Defined in Data.Expression

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Ord Type # 
Instance details

Defined in Data.Expression

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Show Type # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Type -> ShowS #

show :: Type -> String #

showList :: [Type] -> ShowS #

newtype TypeOf t #

Constructors

TypeIs Type 
Instances
Show (TypeOf t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> TypeOf t -> ShowS #

show :: TypeOf t -> String #

showList :: [TypeOf t] -> ShowS #

newtype TypesOf t #

Constructors

TypesIs [Type] 

boolT :: Type #

tupleT :: [Type] -> Type #

vecT :: Type -> Type #

matT :: Type -> Type #

eval_ :: Expression t -> Eval #

evaluate Stochaskell expression to constant value

eval' :: ExprType t => Expression t -> Either String t #

evaluate Stochaskell expression to native value

\ No newline at end of file +Language.Stochaskell.Expression

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell.Expression

Description

 
Synopsis

Documentation

class ExprType c => Constructor c where #

Stochaskell interface for algebraic data types

Minimal complete definition

Nothing

Methods

tags :: Tags c #

list of possible tags in tagged union

tags :: (Generic c, GConstructor (Rep c)) => Tags c #

list of possible tags in tagged union

construct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> c #

construct ADT from tag and arguments

construct :: (Generic c, GConstructor (Rep c)) => (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> c #

construct ADT from tag and arguments

deconstruct :: (forall t. ExprType t => Expression t -> a) -> c -> (Tag, [a]) #

deconstruct ADT to tag and arguments

deconstruct :: (Generic c, GConstructor (Rep c)) => (forall t. ExprType t => Expression t -> a) -> c -> (Tag, [a]) #

deconstruct ADT to tag and arguments

toConcreteC :: ConstVal -> c #

convert constant to ADT value

fromConcreteC :: c -> Expression c #

convert ADT value to Stochaskell expression

data ConstVal #

constant numeric array (of arbitrary dimension) or tagged union value

Instances
IsList ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Item ConstVal :: Type #

Methods

fromList :: [Item ConstVal] -> ConstVal #

fromListN :: Int -> [Item ConstVal] -> ConstVal #

toList :: ConstVal -> [Item ConstVal] #

Enum ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

succ :: ConstVal -> ConstVal #

pred :: ConstVal -> ConstVal #

toEnum :: Int -> ConstVal #

fromEnum :: ConstVal -> Int #

enumFrom :: ConstVal -> [ConstVal] #

enumFromThen :: ConstVal -> ConstVal -> [ConstVal] #

enumFromTo :: ConstVal -> ConstVal -> [ConstVal] #

enumFromThenTo :: ConstVal -> ConstVal -> ConstVal -> [ConstVal] #

Eq ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==) :: ConstVal -> ConstVal -> Bool #

(/=) :: ConstVal -> ConstVal -> Bool #

Floating ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

pi :: ConstVal #

exp :: ConstVal -> ConstVal #

log :: ConstVal -> ConstVal #

sqrt :: ConstVal -> ConstVal #

(**) :: ConstVal -> ConstVal -> ConstVal #

logBase :: ConstVal -> ConstVal -> ConstVal #

sin :: ConstVal -> ConstVal #

cos :: ConstVal -> ConstVal #

tan :: ConstVal -> ConstVal #

asin :: ConstVal -> ConstVal #

acos :: ConstVal -> ConstVal #

atan :: ConstVal -> ConstVal #

sinh :: ConstVal -> ConstVal #

cosh :: ConstVal -> ConstVal #

tanh :: ConstVal -> ConstVal #

asinh :: ConstVal -> ConstVal #

acosh :: ConstVal -> ConstVal #

atanh :: ConstVal -> ConstVal #

log1p :: ConstVal -> ConstVal #

expm1 :: ConstVal -> ConstVal #

log1pexp :: ConstVal -> ConstVal #

log1mexp :: ConstVal -> ConstVal #

Fractional ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(/) :: ConstVal -> ConstVal -> ConstVal #

recip :: ConstVal -> ConstVal #

fromRational :: Rational -> ConstVal #

Integral ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

quot :: ConstVal -> ConstVal -> ConstVal #

rem :: ConstVal -> ConstVal -> ConstVal #

div :: ConstVal -> ConstVal -> ConstVal #

mod :: ConstVal -> ConstVal -> ConstVal #

quotRem :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

divMod :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

toInteger :: ConstVal -> Integer #

Num ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(+) :: ConstVal -> ConstVal -> ConstVal #

(-) :: ConstVal -> ConstVal -> ConstVal #

(*) :: ConstVal -> ConstVal -> ConstVal #

negate :: ConstVal -> ConstVal #

abs :: ConstVal -> ConstVal #

signum :: ConstVal -> ConstVal #

fromInteger :: Integer -> ConstVal #

Ord ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

compare :: ConstVal -> ConstVal -> Ordering #

(<) :: ConstVal -> ConstVal -> Bool #

(<=) :: ConstVal -> ConstVal -> Bool #

(>) :: ConstVal -> ConstVal -> Bool #

(>=) :: ConstVal -> ConstVal -> Bool #

max :: ConstVal -> ConstVal -> ConstVal #

min :: ConstVal -> ConstVal -> ConstVal #

Read ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

readsPrec :: Int -> ReadS ConstVal #

readList :: ReadS [ConstVal] #

readPrec :: ReadPrec ConstVal #

readListPrec :: ReadPrec [ConstVal] #

Real ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

toRational :: ConstVal -> Rational #

RealFrac ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

properFraction :: Integral b => ConstVal -> (b, ConstVal) #

truncate :: Integral b => ConstVal -> b #

round :: Integral b => ConstVal -> b #

ceiling :: Integral b => ConstVal -> b #

floor :: Integral b => ConstVal -> b #

Show ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

showsPrec :: Int -> ConstVal -> ShowS #

show :: ConstVal -> String #

showList :: [ConstVal] -> ShowS #

Ix ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

range :: (ConstVal, ConstVal) -> [ConstVal] #

index :: (ConstVal, ConstVal) -> ConstVal -> Int #

unsafeIndex :: (ConstVal, ConstVal) -> ConstVal -> Int

inRange :: (ConstVal, ConstVal) -> ConstVal -> Bool #

rangeSize :: (ConstVal, ConstVal) -> Int #

unsafeRangeSize :: (ConstVal, ConstVal) -> Int

Generic ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Rep ConstVal :: Type -> Type #

Methods

from :: ConstVal -> Rep ConstVal x #

to :: Rep ConstVal x -> ConstVal #

Semigroup ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<>) :: ConstVal -> ConstVal -> ConstVal #

sconcat :: NonEmpty ConstVal -> ConstVal #

stimes :: Integral b => b -> ConstVal -> ConstVal #

Boolean ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

true :: ConstVal #

false :: ConstVal #

notB :: ConstVal -> ConstVal #

(&&*) :: ConstVal -> ConstVal -> ConstVal #

(||*) :: ConstVal -> ConstVal -> ConstVal #

IfB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

ifB :: bool ~ BooleanOf ConstVal => bool -> ConstVal -> ConstVal -> ConstVal #

EqB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(/=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

OrdB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(<=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

NFData ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

rnf :: ConstVal -> () #

Transfinite ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

infinity :: ConstVal #

negativeInfinity :: ConstVal #

notANumber :: ConstVal #

isInfinite :: ConstVal -> Bool #

isNaN :: ConstVal -> Bool #

Transposable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

tr :: ConstVal -> ConstVal #

tr' :: ConstVal -> ConstVal #

SquareMatrix ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

chol :: ConstVal -> ConstVal #

inv :: ConstVal -> ConstVal #

det :: ConstVal -> ConstVal #

logDet :: ConstVal -> ConstVal #

LinearOperator ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(#>) :: ConstVal -> ConstVal -> ConstVal #

(<#) :: ConstVal -> ConstVal -> ConstVal #

diag :: ConstVal -> ConstVal #

asColumn :: ConstVal -> ConstVal #

asRow :: ConstVal -> ConstVal #

outer :: ConstVal -> ConstVal -> ConstVal #

InnerProduct ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<.>) :: ConstVal -> ConstVal -> ConstVal #

Scalable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(*>) :: ConstVal -> ConstVal -> ConstVal #

Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

type Rep ConstVal # 
Instance details

Defined in Data.Expression.Const

type Rep ConstVal = D1 (MetaData "ConstVal" "Data.Expression.Const" "stochaskell-1.0.0-KmSYNexX98WHJc0JnOjUHd" False) (C1 (MetaCons "Exact" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (UArray [Integer] Int))) :+: (C1 (MetaCons "Approx" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (UArray [Integer] Double))) :+: C1 (MetaCons "Tagged" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Tag) :*: S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [ConstVal]))))
type BooleanOf ConstVal # 
Instance details

Defined in Data.Expression.Const

type BooleanOf ConstVal = ConstVal
type Item ConstVal # 
Instance details

Defined in Data.Expression.Const

type Item ConstVal = ConstVal

data DExpr #

dynamically typed Stochaskell expression

Instances
Eq DExpr # 
Instance details

Defined in Data.Expression

Methods

(==) :: DExpr -> DExpr -> Bool #

(/=) :: DExpr -> DExpr -> Bool #

Floating DExpr # 
Instance details

Defined in Data.Expression

Methods

pi :: DExpr #

exp :: DExpr -> DExpr #

log :: DExpr -> DExpr #

sqrt :: DExpr -> DExpr #

(**) :: DExpr -> DExpr -> DExpr #

logBase :: DExpr -> DExpr -> DExpr #

sin :: DExpr -> DExpr #

cos :: DExpr -> DExpr #

tan :: DExpr -> DExpr #

asin :: DExpr -> DExpr #

acos :: DExpr -> DExpr #

atan :: DExpr -> DExpr #

sinh :: DExpr -> DExpr #

cosh :: DExpr -> DExpr #

tanh :: DExpr -> DExpr #

asinh :: DExpr -> DExpr #

acosh :: DExpr -> DExpr #

atanh :: DExpr -> DExpr #

log1p :: DExpr -> DExpr #

expm1 :: DExpr -> DExpr #

log1pexp :: DExpr -> DExpr #

log1mexp :: DExpr -> DExpr #

Fractional DExpr # 
Instance details

Defined in Data.Expression

Methods

(/) :: DExpr -> DExpr -> DExpr #

recip :: DExpr -> DExpr #

fromRational :: Rational -> DExpr #

Num DExpr # 
Instance details

Defined in Data.Expression

Methods

(+) :: DExpr -> DExpr -> DExpr #

(-) :: DExpr -> DExpr -> DExpr #

(*) :: DExpr -> DExpr -> DExpr #

negate :: DExpr -> DExpr #

abs :: DExpr -> DExpr #

signum :: DExpr -> DExpr #

fromInteger :: Integer -> DExpr #

Ord DExpr # 
Instance details

Defined in Data.Expression

Methods

compare :: DExpr -> DExpr -> Ordering #

(<) :: DExpr -> DExpr -> Bool #

(<=) :: DExpr -> DExpr -> Bool #

(>) :: DExpr -> DExpr -> Bool #

(>=) :: DExpr -> DExpr -> Bool #

max :: DExpr -> DExpr -> DExpr #

min :: DExpr -> DExpr -> DExpr #

Show DExpr # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> DExpr -> ShowS #

show :: DExpr -> String #

showList :: [DExpr] -> ShowS #

Semigroup DExpr # 
Instance details

Defined in Data.Expression

Methods

(<>) :: DExpr -> DExpr -> DExpr #

sconcat :: NonEmpty DExpr -> DExpr #

stimes :: Integral b => b -> DExpr -> DExpr #

Boolean DExpr # 
Instance details

Defined in Data.Expression

Methods

true :: DExpr #

false :: DExpr #

notB :: DExpr -> DExpr #

(&&*) :: DExpr -> DExpr -> DExpr #

(||*) :: DExpr -> DExpr -> DExpr #

IfB DExpr # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf DExpr => bool -> DExpr -> DExpr -> DExpr #

EqB DExpr # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

(/=*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

Transposable DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

tr :: DExpr -> DExpr #

tr' :: DExpr -> DExpr #

SquareMatrix DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

chol :: DExpr -> DExpr #

inv :: DExpr -> DExpr #

det :: DExpr -> DExpr #

logDet :: DExpr -> DExpr #

LinearOperator DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(#>) :: DExpr -> DExpr -> DExpr #

(<#) :: DExpr -> DExpr -> DExpr #

diag :: DExpr -> DExpr #

asColumn :: DExpr -> DExpr #

asRow :: DExpr -> DExpr #

outer :: DExpr -> DExpr -> DExpr #

Matrix DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray DExpr DExpr -> DExpr #

blockMatrix :: [[DExpr]] -> DExpr #

eye :: DExpr -> DExpr #

zeros :: DExpr -> DExpr -> DExpr #

matrixRows :: DExpr -> DExpr #

matrixCols :: DExpr -> DExpr #

designMatrix :: (Indexable v DExpr DExpr, Num DExpr) => DExpr -> AbstractArray DExpr v -> DExpr #

Vector DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray DExpr DExpr -> DExpr #

blockVector :: [DExpr] -> DExpr #

vectorSize :: DExpr -> DExpr #

Indexable DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(!) :: DExpr -> DExpr -> DExpr #

bounds :: DExpr -> Interval DExpr #

deleteAt :: DExpr -> DExpr -> DExpr #

insertAt :: DExpr -> (DExpr, DExpr) -> DExpr #

replaceAt :: DExpr -> (DExpr, DExpr) -> DExpr #

deleteIndex :: DExpr -> DExpr -> DExpr #

insertIndex :: DExpr -> DExpr -> DExpr -> DExpr #

replaceIndex :: DExpr -> DExpr -> DExpr -> DExpr #

type BooleanOf DExpr # 
Instance details

Defined in Data.Expression

type BooleanOf DExpr = DExpr

type Eval = Either String ConstVal #

either an evaluated constant or error string

newtype Expression t #

Stochaskell expression representation (statically typed)

Constructors

Expression 

Fields

Instances
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: Type #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: Type #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: Type #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: Type #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

(ExprType r, ExprType f, Show f) => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

(Show t, ExprType t) => Show (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> Expression t -> ShowS #

show :: Expression t -> String #

showList :: [Expression t] -> ShowS #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool #

isNaN :: Expression t -> Bool #

ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #

show :: (a -> b -> Expression t) -> String #

showList :: [a -> b -> Expression t] -> ShowS #

(ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> Expression t) -> ShowS #

show :: (a -> Expression t) -> String #

showList :: [a -> Expression t] -> ShowS #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

ExprType t => GConstructor (K1 i (Expression t) :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (K1 i (Expression t) p) #

gtags :: Tags (K1 i (Expression t) p) #

gconstruct :: (forall t0. ExprType t0 => a -> Expression t0) -> Tag -> [a] -> K1 i (Expression t) p #

gdeconstruct :: (forall t0. ExprType t0 => Expression t0 -> a) -> K1 i (Expression t) p -> (Tag, [a]) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool

data EEnv #

Instances
Show EEnv # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> EEnv -> ShowS #

show :: EEnv -> String #

showList :: [EEnv] -> ShowS #

type Env = Map LVal ConstVal #

type Expr t = Expression t #

class ExprType t => ExprTuple t where #

Stochaskell interface for tuples of expressions

Methods

tupleSize :: TupleSize t #

numer of tuple elements

fromExprTuple :: t -> [DExpr] #

convert to list of expressions

toExprTuple :: [DExpr] -> t #

convert from list of expressions

fromConstVals :: [ConstVal] -> t #

convert from list of constants

typesOf :: TypesOf t #

list of types of elements

Instances
ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

class ExprType t where #

Stochaskell interface for native Haskell types

Minimal complete definition

Nothing

Methods

typeOf :: TypeOf t #

corresponding Stochaskell type

typeOf :: (Generic t, GConstructor (Rep t)) => TypeOf t #

corresponding Stochaskell type

toConcrete :: ConstVal -> t #

convert constant to native value

toConcrete :: Constructor t => ConstVal -> t #

convert constant to native value

fromConcrete :: t -> Expression t #

convert native value to Stochaskell expression

fromConcrete :: Constructor t => t -> Expression t #

convert native value to Stochaskell expression

constVal :: t -> ConstVal #

convert native value to constant

constVal :: ToConstVal t => t -> ConstVal #

convert native value to constant

constExpr :: ConstVal -> Expression t #

convert constant to Stochaskell expression

Instances
ExprType Bool # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Bool #

toConcrete :: ConstVal -> Bool #

fromConcrete :: Bool -> Expression Bool #

constVal :: Bool -> ConstVal #

constExpr :: ConstVal -> Expression Bool #

ExprType Double # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Double #

toConcrete :: ConstVal -> Double #

fromConcrete :: Double -> Expression Double #

constVal :: Double -> ConstVal #

constExpr :: ConstVal -> Expression Double #

ExprType Integer # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Integer #

toConcrete :: ConstVal -> Integer #

fromConcrete :: Integer -> Expression Integer #

constVal :: Integer -> ConstVal #

constExpr :: ConstVal -> Expression Integer #

ExprType t => ExprType [t] # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf [t] #

toConcrete :: ConstVal -> [t] #

fromConcrete :: [t] -> Expression [t] #

constVal :: [t] -> ConstVal #

constExpr :: ConstVal -> Expression [t] #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

newtype FixE f #

Constructors

FixE 

Fields

Instances
(Show1 f, Functor f, Constructor (f (FixE f))) => Show (FixE f) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> FixE f -> ShowS #

show :: FixE f -> String #

showList :: [FixE f] -> ShowS #

ExprType (f (FixE f)) => GConstructor (K1 i (FixE f) :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (K1 i (FixE f) p) #

gtags :: Tags (K1 i (FixE f) p) #

gconstruct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> K1 i (FixE f) p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a) -> K1 i (FixE f) p -> (Tag, [a]) #

type FixE' f = Expression (f (FixE f)) #

class GConstructor f where #

Minimal complete definition

gtypeOf, gconstruct, gdeconstruct

Methods

gtypeOf :: TypeOf (f p) #

gtags :: Tags (f p) #

gconstruct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> f p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a) -> f p -> (Tag, [a]) #

Instances
GConstructor (U1 :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (U1 p) #

gtags :: Tags (U1 p) #

gconstruct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> U1 p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a) -> U1 p -> (Tag, [a]) #

ExprType (f (FixE f)) => GConstructor (K1 i (FixE f) :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (K1 i (FixE f) p) #

gtags :: Tags (K1 i (FixE f) p) #

gconstruct :: (forall t. ExprType t => a -> Expression t) -> Tag -> [a] -> K1 i (FixE f) p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a) -> K1 i (FixE f) p -> (Tag, [a]) #

ExprType t => GConstructor (K1 i (Expression t) :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (K1 i (Expression t) p) #

gtags :: Tags (K1 i (Expression t) p) #

gconstruct :: (forall t0. ExprType t0 => a -> Expression t0) -> Tag -> [a] -> K1 i (Expression t) p #

gdeconstruct :: (forall t0. ExprType t0 => Expression t0 -> a) -> K1 i (Expression t) p -> (Tag, [a]) #

(GConstructor a, GConstructor b) => GConstructor (a :+: b) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf ((a :+: b) p) #

gtags :: Tags ((a :+: b) p) #

gconstruct :: (forall t. ExprType t => a0 -> Expression t) -> Tag -> [a0] -> (a :+: b) p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a0) -> (a :+: b) p -> (Tag, [a0]) #

(GConstructor a, GConstructor b) => GConstructor (a :*: b) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf ((a :*: b) p) #

gtags :: Tags ((a :*: b) p) #

gconstruct :: (forall t. ExprType t => a0 -> Expression t) -> Tag -> [a0] -> (a :*: b) p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a0) -> (a :*: b) p -> (Tag, [a0]) #

GConstructor a => GConstructor (M1 i c a) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (M1 i c a p) #

gtags :: Tags (M1 i c a p) #

gconstruct :: (forall t. ExprType t => a0 -> Expression t) -> Tag -> [a0] -> M1 i c a p #

gdeconstruct :: (forall t. ExprType t => Expression t -> a0) -> M1 i c a p -> (Tag, [a0]) #

data Id #

variable identifier

Instances
Eq Id # 
Instance details

Defined in Data.Expression

Methods

(==) :: Id -> Id -> Bool #

(/=) :: Id -> Id -> Bool #

Ord Id # 
Instance details

Defined in Data.Expression

Methods

compare :: Id -> Id -> Ordering #

(<) :: Id -> Id -> Bool #

(<=) :: Id -> Id -> Bool #

(>) :: Id -> Id -> Bool #

(>=) :: Id -> Id -> Bool #

max :: Id -> Id -> Id #

min :: Id -> Id -> Id #

Show Id # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Id -> ShowS #

show :: Id -> String #

showList :: [Id] -> ShowS #

data LVal #

Constructors

LVar Id 
Instances
Eq LVal # 
Instance details

Defined in Data.Expression

Methods

(==) :: LVal -> LVal -> Bool #

(/=) :: LVal -> LVal -> Bool #

Ord LVal # 
Instance details

Defined in Data.Expression

Methods

compare :: LVal -> LVal -> Ordering #

(<) :: LVal -> LVal -> Bool #

(<=) :: LVal -> LVal -> Bool #

(>) :: LVal -> LVal -> Bool #

(>=) :: LVal -> LVal -> Bool #

max :: LVal -> LVal -> LVal #

min :: LVal -> LVal -> LVal #

Show LVal # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> LVal -> ShowS #

show :: LVal -> String #

showList :: [LVal] -> ShowS #

data NodeRef #

reference to a node in the computation graph

Instances
Eq NodeRef # 
Instance details

Defined in Data.Expression

Methods

(==) :: NodeRef -> NodeRef -> Bool #

(/=) :: NodeRef -> NodeRef -> Bool #

Ord NodeRef # 
Instance details

Defined in Data.Expression

Methods

compare :: NodeRef -> NodeRef -> Ordering #

(<) :: NodeRef -> NodeRef -> Bool #

(<=) :: NodeRef -> NodeRef -> Bool #

(>) :: NodeRef -> NodeRef -> Bool #

(>=) :: NodeRef -> NodeRef -> Bool #

max :: NodeRef -> NodeRef -> NodeRef #

min :: NodeRef -> NodeRef -> NodeRef #

Show NodeRef # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> NodeRef -> ShowS #

show :: NodeRef -> String #

showList :: [NodeRef] -> ShowS #

type Tag = Int #

newtype Tags t #

Constructors

Tags [Tag] 

newtype TupleSize t #

Constructors

TupleSize Int 

data Type #

Stochaskell types

Constructors

IntT 
RealT 
SubrangeT Type (Maybe NodeRef) (Maybe NodeRef) 
ArrayT (Maybe String) [Interval NodeRef] Type 
TupleT [Type] 
UnionT [[Type]] 
RecursiveT 
UnknownType 
Instances
Eq Type # 
Instance details

Defined in Data.Expression

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Ord Type # 
Instance details

Defined in Data.Expression

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Show Type # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Type -> ShowS #

show :: Type -> String #

showList :: [Type] -> ShowS #

newtype TypeOf t #

Constructors

TypeIs Type 
Instances
Show (TypeOf t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> TypeOf t -> ShowS #

show :: TypeOf t -> String #

showList :: [TypeOf t] -> ShowS #

newtype TypesOf t #

Constructors

TypesIs [Type] 

boolT :: Type #

tupleT :: [Type] -> Type #

vecT :: Type -> Type #

matT :: Type -> Type #

eval_ :: Expression t -> Eval #

evaluate Stochaskell expression to constant value

eval' :: ExprType t => Expression t -> Either String t #

evaluate Stochaskell expression to native value

class Show1 (f :: Type -> Type) #

Lifting of the Show class to unary type constructors.

Since: base-4.9.0.0

Minimal complete definition

liftShowsPrec

Instances
Show1 []

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

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

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

Show1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #

Show1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Identity a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Identity a] -> ShowS #

Show1 Down

Since: base-4.12.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Down a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Down a] -> ShowS #

Show1 NonEmpty

Since: base-4.10.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> NonEmpty a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [NonEmpty a] -> ShowS #

Show1 IntMap

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IntMap a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IntMap a] -> ShowS #

Show1 Tree

Since: containers-0.5.9

Instance details

Defined in Data.Tree

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Tree a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Tree a] -> ShowS #

Show1 Seq

Since: containers-0.5.9

Instance details

Defined in Data.Sequence.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Seq a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Seq a] -> ShowS #

Show1 Set

Since: containers-0.5.9

Instance details

Defined in Data.Set.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Set a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Set a] -> ShowS #

Show1 Hashed 
Instance details

Defined in Data.Hashable.Class

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Hashed a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Hashed a] -> ShowS #

Show1 SmallArray

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.SmallArray

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> SmallArray a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [SmallArray a] -> ShowS #

Show1 Array

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.Array

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Array a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Array a] -> ShowS #

Show1 HashSet 
Instance details

Defined in Data.HashSet.Base

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashSet a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashSet a] -> ShowS #

Show1 Vector 
Instance details

Defined in Data.Vector

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Vector a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Vector a] -> ShowS #

Show1 V2 
Instance details

Defined in Linear.V2

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V2 a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V2 a] -> ShowS #

Show1 V3 
Instance details

Defined in Linear.V3

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V3 a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V3 a] -> ShowS #

Show1 V1 
Instance details

Defined in Linear.V1

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V1 a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V1 a] -> ShowS #

Show1 Plucker 
Instance details

Defined in Linear.Plucker

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Plucker a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Plucker a] -> ShowS #

Show1 Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Quaternion a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Quaternion a] -> ShowS #

Show1 V0 
Instance details

Defined in Linear.V0

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V0 a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V0 a] -> ShowS #

Show1 V4 
Instance details

Defined in Linear.V4

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V4 a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V4 a] -> ShowS #

Show a => Show1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

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

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

Show a => Show1 ((,) a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

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

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

Show k => Show1 (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> HashMap k a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [HashMap k a] -> ShowS #

Show k => Show1 (Map k)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Map k a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Map k a] -> ShowS #

Show1 (Proxy :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Proxy a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Proxy a] -> ShowS #

Show1 m => Show1 (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> MaybeT m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [MaybeT m a] -> ShowS #

(Generic1 f, GShow1 (Rep1 f)) => Show1 (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Generically1 f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Generically1 f a] -> ShowS #

Show1 m => Show1 (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ListT m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ListT m a] -> ShowS #

Show a => Show1 (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

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

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

Show1 f => Show1 (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Cofree f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Cofree f a] -> ShowS #

Show1 f => Show1 (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Free f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Free f a] -> ShowS #

Show a => Show1 (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

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

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

Show1 f => Show1 (Point f) 
Instance details

Defined in Linear.Affine

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Point f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Point f a] -> ShowS #

Show1 f => Show1 (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Yoneda f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Yoneda f a] -> ShowS #

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 #

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

Show1 f => Show1 (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IdentityT f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IdentityT f a] -> ShowS #

(Show e, Show1 m) => Show1 (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ExceptT e m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ExceptT e m a] -> ShowS #

(Show w, Show1 m) => Show1 (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> WriterT w m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [WriterT w m a] -> ShowS #

(Show e, Show1 m) => Show1 (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> ErrorT e m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [ErrorT e m a] -> ShowS #

(Show w, Show1 m) => Show1 (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> WriterT w m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [WriterT w m a] -> ShowS #

Show1 (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Tagged s a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Tagged s a] -> ShowS #

Show1 f => Show1 (Backwards f) 
Instance details

Defined in Control.Applicative.Backwards

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Backwards f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Backwards f a] -> ShowS #

(Show1 f, Show1 m) => Show1 (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> FreeT f m a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [FreeT f m a] -> ShowS #

(Show1 f, Show a) => Show1 (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> FreeF f a a0 -> ShowS #

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [FreeF f a a0] -> ShowS #

Show1 (V n) 
Instance details

Defined in Linear.V

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> V n a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [V n a] -> ShowS #

(Show1 f, Show1 g) => Show1 (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Product f g a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Product f g a] -> ShowS #

(Show1 f, Show1 g) => Show1 (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Sum f g a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Sum f g a] -> ShowS #

(Show1 f, Show1 g) => Show1 (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Compose f g a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Compose f g a] -> ShowS #

newtype Generically1 (f :: Type -> Type) a #

Type with instances derived via Generic1.

Constructors

Generically1 

Fields

Instances
(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

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

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

(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

pure :: a -> Generically1 f a #

(<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b #

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

(*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b #

(<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a #

(Generic1 f, Foldable (Rep1 f)) => Foldable (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

fold :: Monoid m => Generically1 f m -> m #

foldMap :: Monoid m => (a -> m) -> Generically1 f a -> m #

foldr :: (a -> b -> b) -> b -> Generically1 f a -> b #

foldr' :: (a -> b -> b) -> b -> Generically1 f a -> b #

foldl :: (b -> a -> b) -> b -> Generically1 f a -> b #

foldl' :: (b -> a -> b) -> b -> Generically1 f a -> b #

foldr1 :: (a -> a -> a) -> Generically1 f a -> a #

foldl1 :: (a -> a -> a) -> Generically1 f a -> a #

toList :: Generically1 f a -> [a] #

null :: Generically1 f a -> Bool #

length :: Generically1 f a -> Int #

elem :: Eq a => a -> Generically1 f a -> Bool #

maximum :: Ord a => Generically1 f a -> a #

minimum :: Ord a => Generically1 f a -> a #

sum :: Num a => Generically1 f a -> a #

product :: Num a => Generically1 f a -> a #

(Generic1 f, Traversable (Rep1 f)) => Traversable (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Generically1 f a -> f0 (Generically1 f b) #

sequenceA :: Applicative f0 => Generically1 f (f0 a) -> f0 (Generically1 f a) #

mapM :: Monad m => (a -> m b) -> Generically1 f a -> m (Generically1 f b) #

sequence :: Monad m => Generically1 f (m a) -> m (Generically1 f a) #

(Generic1 f, Alternative (Rep1 f)) => Alternative (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

empty :: Generically1 f a #

(<|>) :: Generically1 f a -> Generically1 f a -> Generically1 f a #

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

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

(Generic1 f, Eq1 (Rep1 f)) => Eq1 (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

liftEq :: (a -> b -> Bool) -> Generically1 f a -> Generically1 f b -> Bool #

(Generic1 f, Ord1 (Rep1 f)) => Ord1 (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

liftCompare :: (a -> b -> Ordering) -> Generically1 f a -> Generically1 f b -> Ordering #

(Generic1 f, GShow1 (Rep1 f)) => Show1 (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Generically1 f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Generically1 f a] -> ShowS #

Generic1 f => Generic1 (Generically1 f :: Type -> Type) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep1 (Generically1 f) :: k -> Type #

Methods

from1 :: Generically1 f a -> Rep1 (Generically1 f) a #

to1 :: Rep1 (Generically1 f) a -> Generically1 f a #

(Generic1 f, Eq1 (Rep1 f), Eq a) => Eq (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

(==) :: Generically1 f a -> Generically1 f a -> Bool #

(/=) :: Generically1 f a -> Generically1 f a -> Bool #

(Generic1 f, Ord1 (Rep1 f), Ord a) => Ord (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

compare :: Generically1 f a -> Generically1 f a -> Ordering #

(<) :: Generically1 f a -> Generically1 f a -> Bool #

(<=) :: Generically1 f a -> Generically1 f a -> Bool #

(>) :: Generically1 f a -> Generically1 f a -> Bool #

(>=) :: Generically1 f a -> Generically1 f a -> Bool #

max :: Generically1 f a -> Generically1 f a -> Generically1 f a #

min :: Generically1 f a -> Generically1 f a -> Generically1 f a #

(Generic1 f, GShow1 (Rep1 f), Show a) => Show (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

showsPrec :: Int -> Generically1 f a -> ShowS #

show :: Generically1 f a -> String #

showList :: [Generically1 f a] -> ShowS #

Generic (f a) => Generic (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep (Generically1 f a) :: Type -> Type #

Methods

from :: Generically1 f a -> Rep (Generically1 f a) x #

to :: Rep (Generically1 f a) x -> Generically1 f a #

type Rep1 (Generically1 f :: Type -> Type) 
Instance details

Defined in Generic.Data.Internal.Generically

type Rep1 (Generically1 f :: Type -> Type) = Rep1 f
type Rep (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

type Rep (Generically1 f a) = Rep (f a)

class Generic a #

Representable types of kind *. + This class is derivable in GHC with the DeriveGeneric flag on.

A Generic instance must satisfy the following laws:

from . to ≡ id
+to . from ≡ id
+

Minimal complete definition

from, to

Instances
Generic Bool 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Bool :: Type -> Type #

Methods

from :: Bool -> Rep Bool x #

to :: Rep Bool x -> Bool #

Generic Ordering 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Ordering :: Type -> Type #

Methods

from :: Ordering -> Rep Ordering x #

to :: Rep Ordering x -> Ordering #

Generic Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Exp :: Type -> Type #

Methods

from :: Exp -> Rep Exp x #

to :: Rep Exp x -> Exp #

Generic Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Match :: Type -> Type #

Methods

from :: Match -> Rep Match x #

to :: Rep Match x -> Match #

Generic Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Clause :: Type -> Type #

Methods

from :: Clause -> Rep Clause x #

to :: Rep Clause x -> Clause #

Generic Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Pat :: Type -> Type #

Methods

from :: Pat -> Rep Pat x #

to :: Rep Pat x -> Pat #

Generic Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Type :: Type -> Type #

Methods

from :: Type -> Rep Type x #

to :: Rep Type x -> Type #

Generic Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Dec :: Type -> Type #

Methods

from :: Dec -> Rep Dec x #

to :: Rep Dec x -> Dec #

Generic Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Name :: Type -> Type #

Methods

from :: Name -> Rep Name x #

to :: Rep Name x -> Name #

Generic FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep FunDep :: Type -> Type #

Methods

from :: FunDep -> Rep FunDep x #

to :: Rep FunDep x -> FunDep #

Generic InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep InjectivityAnn :: Type -> Type #

Methods

from :: InjectivityAnn -> Rep InjectivityAnn x #

to :: Rep InjectivityAnn x -> InjectivityAnn #

Generic Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Overlap :: Type -> Type #

Methods

from :: Overlap -> Rep Overlap x #

to :: Rep Overlap x -> Overlap #

Generic () 
Instance details

Defined in GHC.Generics

Associated Types

type Rep () :: Type -> Type #

Methods

from :: () -> Rep () x #

to :: Rep () x -> () #

Generic Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Con :: Type -> Type #

Methods

from :: Con -> Rep Con x #

to :: Rep Con x -> Con #

Generic Value 
Instance details

Defined in Data.Aeson.Types.Internal

Associated Types

type Rep Value :: Type -> Type #

Methods

from :: Value -> Rep Value x #

to :: Rep Value x -> Value #

Generic Void 
Instance details

Defined in Data.Void

Associated Types

type Rep Void :: Type -> Type #

Methods

from :: Void -> Rep Void x #

to :: Rep Void x -> Void #

Generic Version 
Instance details

Defined in Data.Version

Associated Types

type Rep Version :: Type -> Type #

Methods

from :: Version -> Rep Version x #

to :: Rep Version x -> Version #

Generic ExitCode 
Instance details

Defined in GHC.IO.Exception

Associated Types

type Rep ExitCode :: Type -> Type #

Methods

from :: ExitCode -> Rep ExitCode x #

to :: Rep ExitCode x -> ExitCode #

Generic All 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep All :: Type -> Type #

Methods

from :: All -> Rep All x #

to :: Rep All x -> All #

Generic Any 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep Any :: Type -> Type #

Methods

from :: Any -> Rep Any x #

to :: Rep Any x -> Any #

Generic Fixity 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Fixity :: Type -> Type #

Methods

from :: Fixity -> Rep Fixity x #

to :: Rep Fixity x -> Fixity #

Generic Associativity 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Associativity :: Type -> Type #

Methods

from :: Associativity -> Rep Associativity x #

to :: Rep Associativity x -> Associativity #

Generic SourceUnpackedness 
Instance details

Defined in GHC.Generics

Associated Types

type Rep SourceUnpackedness :: Type -> Type #

Methods

from :: SourceUnpackedness -> Rep SourceUnpackedness x #

to :: Rep SourceUnpackedness x -> SourceUnpackedness #

Generic SourceStrictness 
Instance details

Defined in GHC.Generics

Associated Types

type Rep SourceStrictness :: Type -> Type #

Methods

from :: SourceStrictness -> Rep SourceStrictness x #

to :: Rep SourceStrictness x -> SourceStrictness #

Generic DecidedStrictness 
Instance details

Defined in GHC.Generics

Associated Types

type Rep DecidedStrictness :: Type -> Type #

Methods

from :: DecidedStrictness -> Rep DecidedStrictness x #

to :: Rep DecidedStrictness x -> DecidedStrictness #

Generic Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Associated Types

type Rep Extension :: Type -> Type #

Methods

from :: Extension -> Rep Extension x #

to :: Rep Extension x -> Extension #

Generic ForeignSrcLang 
Instance details

Defined in GHC.ForeignSrcLang.Type

Associated Types

type Rep ForeignSrcLang :: Type -> Type #

Methods

from :: ForeignSrcLang -> Rep ForeignSrcLang x #

to :: Rep ForeignSrcLang x -> ForeignSrcLang #

Generic Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Associated Types

type Rep Doc :: Type -> Type #

Methods

from :: Doc -> Rep Doc x #

to :: Rep Doc x -> Doc #

Generic TextDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Associated Types

type Rep TextDetails :: Type -> Type #

Methods

from :: TextDetails -> Rep TextDetails x #

to :: Rep TextDetails x -> TextDetails #

Generic Style 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Associated Types

type Rep Style :: Type -> Type #

Methods

from :: Style -> Rep Style x #

to :: Rep Style x -> Style #

Generic Mode 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Associated Types

type Rep Mode :: Type -> Type #

Methods

from :: Mode -> Rep Mode x #

to :: Rep Mode x -> Mode #

Generic ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep ModName :: Type -> Type #

Methods

from :: ModName -> Rep ModName x #

to :: Rep ModName x -> ModName #

Generic PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep PkgName :: Type -> Type #

Methods

from :: PkgName -> Rep PkgName x #

to :: Rep PkgName x -> PkgName #

Generic Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Module :: Type -> Type #

Methods

from :: Module -> Rep Module x #

to :: Rep Module x -> Module #

Generic OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep OccName :: Type -> Type #

Methods

from :: OccName -> Rep OccName x #

to :: Rep OccName x -> OccName #

Generic NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep NameFlavour :: Type -> Type #

Methods

from :: NameFlavour -> Rep NameFlavour x #

to :: Rep NameFlavour x -> NameFlavour #

Generic NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep NameSpace :: Type -> Type #

Methods

from :: NameSpace -> Rep NameSpace x #

to :: Rep NameSpace x -> NameSpace #

Generic Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Loc :: Type -> Type #

Methods

from :: Loc -> Rep Loc x #

to :: Rep Loc x -> Loc #

Generic Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Info :: Type -> Type #

Methods

from :: Info -> Rep Info x #

to :: Rep Info x -> Info #

Generic ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep ModuleInfo :: Type -> Type #

Methods

from :: ModuleInfo -> Rep ModuleInfo x #

to :: Rep ModuleInfo x -> ModuleInfo #

Generic Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Fixity :: Type -> Type #

Methods

from :: Fixity -> Rep Fixity x #

to :: Rep Fixity x -> Fixity #

Generic FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep FixityDirection :: Type -> Type #

Methods

from :: FixityDirection -> Rep FixityDirection x #

to :: Rep FixityDirection x -> FixityDirection #

Generic Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Lit :: Type -> Type #

Methods

from :: Lit -> Rep Lit x #

to :: Rep Lit x -> Lit #

Generic Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Body :: Type -> Type #

Methods

from :: Body -> Rep Body x #

to :: Rep Body x -> Body #

Generic Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Guard :: Type -> Type #

Methods

from :: Guard -> Rep Guard x #

to :: Rep Guard x -> Guard #

Generic Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Stmt :: Type -> Type #

Methods

from :: Stmt -> Rep Stmt x #

to :: Rep Stmt x -> Stmt #

Generic Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Range :: Type -> Type #

Methods

from :: Range -> Rep Range x #

to :: Rep Range x -> Range #

Generic DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep DerivClause :: Type -> Type #

Methods

from :: DerivClause -> Rep DerivClause x #

to :: Rep DerivClause x -> DerivClause #

Generic DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep DerivStrategy :: Type -> Type #

Methods

from :: DerivStrategy -> Rep DerivStrategy x #

to :: Rep DerivStrategy x -> DerivStrategy #

Generic TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep TypeFamilyHead :: Type -> Type #

Methods

from :: TypeFamilyHead -> Rep TypeFamilyHead x #

to :: Rep TypeFamilyHead x -> TypeFamilyHead #

Generic TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep TySynEqn :: Type -> Type #

Methods

from :: TySynEqn -> Rep TySynEqn x #

to :: Rep TySynEqn x -> TySynEqn #

Generic Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Foreign :: Type -> Type #

Methods

from :: Foreign -> Rep Foreign x #

to :: Rep Foreign x -> Foreign #

Generic Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Callconv :: Type -> Type #

Methods

from :: Callconv -> Rep Callconv x #

to :: Rep Callconv x -> Callconv #

Generic Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Safety :: Type -> Type #

Methods

from :: Safety -> Rep Safety x #

to :: Rep Safety x -> Safety #

Generic Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Pragma :: Type -> Type #

Methods

from :: Pragma -> Rep Pragma x #

to :: Rep Pragma x -> Pragma #

Generic Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Inline :: Type -> Type #

Methods

from :: Inline -> Rep Inline x #

to :: Rep Inline x -> Inline #

Generic RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep RuleMatch :: Type -> Type #

Methods

from :: RuleMatch -> Rep RuleMatch x #

to :: Rep RuleMatch x -> RuleMatch #

Generic Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Phases :: Type -> Type #

Methods

from :: Phases -> Rep Phases x #

to :: Rep Phases x -> Phases #

Generic RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep RuleBndr :: Type -> Type #

Methods

from :: RuleBndr -> Rep RuleBndr x #

to :: Rep RuleBndr x -> RuleBndr #

Generic AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep AnnTarget :: Type -> Type #

Methods

from :: AnnTarget -> Rep AnnTarget x #

to :: Rep AnnTarget x -> AnnTarget #

Generic SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep SourceUnpackedness :: Type -> Type #

Methods

from :: SourceUnpackedness -> Rep SourceUnpackedness x #

to :: Rep SourceUnpackedness x -> SourceUnpackedness #

Generic SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep SourceStrictness :: Type -> Type #

Methods

from :: SourceStrictness -> Rep SourceStrictness x #

to :: Rep SourceStrictness x -> SourceStrictness #

Generic DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep DecidedStrictness :: Type -> Type #

Methods

from :: DecidedStrictness -> Rep DecidedStrictness x #

to :: Rep DecidedStrictness x -> DecidedStrictness #

Generic Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Bang :: Type -> Type #

Methods

from :: Bang -> Rep Bang x #

to :: Rep Bang x -> Bang #

Generic PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep PatSynDir :: Type -> Type #

Methods

from :: PatSynDir -> Rep PatSynDir x #

to :: Rep PatSynDir x -> PatSynDir #

Generic PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep PatSynArgs :: Type -> Type #

Methods

from :: PatSynArgs -> Rep PatSynArgs x #

to :: Rep PatSynArgs x -> PatSynArgs #

Generic TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep TyVarBndr :: Type -> Type #

Methods

from :: TyVarBndr -> Rep TyVarBndr x #

to :: Rep TyVarBndr x -> TyVarBndr #

Generic FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep FamilyResultSig :: Type -> Type #

Methods

from :: FamilyResultSig -> Rep FamilyResultSig x #

to :: Rep FamilyResultSig x -> FamilyResultSig #

Generic TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep TyLit :: Type -> Type #

Methods

from :: TyLit -> Rep TyLit x #

to :: Rep TyLit x -> TyLit #

Generic Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep Role :: Type -> Type #

Methods

from :: Role -> Rep Role x #

to :: Rep Role x -> Role #

Generic AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Associated Types

type Rep AnnLookup :: Type -> Type #

Methods

from :: AnnLookup -> Rep AnnLookup x #

to :: Rep AnnLookup x -> AnnLookup #

Generic DatatypeInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep DatatypeInfo :: Type -> Type #

Methods

from :: DatatypeInfo -> Rep DatatypeInfo x #

to :: Rep DatatypeInfo x -> DatatypeInfo #

Generic DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep DatatypeVariant :: Type -> Type #

Methods

from :: DatatypeVariant -> Rep DatatypeVariant x #

to :: Rep DatatypeVariant x -> DatatypeVariant #

Generic ConstructorInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep ConstructorInfo :: Type -> Type #

Methods

from :: ConstructorInfo -> Rep ConstructorInfo x #

to :: Rep ConstructorInfo x -> ConstructorInfo #

Generic ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep ConstructorVariant :: Type -> Type #

Methods

from :: ConstructorVariant -> Rep ConstructorVariant x #

to :: Rep ConstructorVariant x -> ConstructorVariant #

Generic FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep FieldStrictness :: Type -> Type #

Methods

from :: FieldStrictness -> Rep FieldStrictness x #

to :: Rep FieldStrictness x -> FieldStrictness #

Generic Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep Unpackedness :: Type -> Type #

Methods

from :: Unpackedness -> Rep Unpackedness x #

to :: Rep Unpackedness x -> Unpackedness #

Generic Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Associated Types

type Rep Strictness :: Type -> Type #

Methods

from :: Strictness -> Rep Strictness x #

to :: Rep Strictness x -> Strictness #

Generic Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep Format :: Type -> Type #

Methods

from :: Format -> Rep Format x #

to :: Rep Format x -> Format #

Generic Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep Method :: Type -> Type #

Methods

from :: Method -> Rep Method x #

to :: Rep Method x -> Method #

Generic CompressionLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep CompressionLevel :: Type -> Type #

Methods

from :: CompressionLevel -> Rep CompressionLevel x #

to :: Rep CompressionLevel x -> CompressionLevel #

Generic WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep WindowBits :: Type -> Type #

Methods

from :: WindowBits -> Rep WindowBits x #

to :: Rep WindowBits x -> WindowBits #

Generic MemoryLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep MemoryLevel :: Type -> Type #

Methods

from :: MemoryLevel -> Rep MemoryLevel x #

to :: Rep MemoryLevel x -> MemoryLevel #

Generic CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Associated Types

type Rep CompressionStrategy :: Type -> Type #

Methods

from :: CompressionStrategy -> Rep CompressionStrategy x #

to :: Rep CompressionStrategy x -> CompressionStrategy #

Generic NewtonParam 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep NewtonParam :: Type -> Type #

Methods

from :: NewtonParam -> Rep NewtonParam x #

to :: Rep NewtonParam x -> NewtonParam #

Generic NewtonStep 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep NewtonStep :: Type -> Type #

Methods

from :: NewtonStep -> Rep NewtonStep x #

to :: Rep NewtonStep x -> NewtonStep #

Generic RiddersParam 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep RiddersParam :: Type -> Type #

Methods

from :: RiddersParam -> Rep RiddersParam x #

to :: Rep RiddersParam x -> RiddersParam #

Generic RiddersStep 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep RiddersStep :: Type -> Type #

Methods

from :: RiddersStep -> Rep RiddersStep x #

to :: Rep RiddersStep x -> RiddersStep #

Generic Tolerance 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep Tolerance :: Type -> Type #

Methods

from :: Tolerance -> Rep Tolerance x #

to :: Rep Tolerance x -> Tolerance #

Generic ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Rep ConstVal :: Type -> Type #

Methods

from :: ConstVal -> Rep ConstVal x #

to :: Rep ConstVal x -> ConstVal #

Generic OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Associated Types

type Rep OutputType :: Type -> Type #

Methods

from :: OutputType -> Rep OutputType x #

to :: Rep OutputType x -> OutputType #

Generic Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Associated Types

type Rep Points :: Type -> Type #

Methods

from :: Points -> Rep Points x #

to :: Rep Points x -> Points #

Generic LinePass 
Instance details

Defined in Linear.Plucker

Associated Types

type Rep LinePass :: Type -> Type #

Methods

from :: LinePass -> Rep LinePass x #

to :: Rep LinePass x -> LinePass #

Generic [a] 
Instance details

Defined in GHC.Generics

Associated Types

type Rep [a] :: Type -> Type #

Methods

from :: [a] -> Rep [a] x #

to :: Rep [a] x -> [a] #

Generic (Maybe a) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Maybe a) :: Type -> Type #

Methods

from :: Maybe a -> Rep (Maybe a) x #

to :: Rep (Maybe a) x -> Maybe a #

Generic (Par1 p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Par1 p) :: Type -> Type #

Methods

from :: Par1 p -> Rep (Par1 p) x #

to :: Rep (Par1 p) x -> Par1 p #

Generic (Only a) 
Instance details

Defined in Data.Tuple.Only

Associated Types

type Rep (Only a) :: Type -> Type #

Methods

from :: Only a -> Rep (Only a) x #

to :: Rep (Only a) x -> Only a #

Generic (Complex a) 
Instance details

Defined in Data.Complex

Associated Types

type Rep (Complex a) :: Type -> Type #

Methods

from :: Complex a -> Rep (Complex a) x #

to :: Rep (Complex a) x -> Complex a #

Generic (Min a) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (Min a) :: Type -> Type #

Methods

from :: Min a -> Rep (Min a) x #

to :: Rep (Min a) x -> Min a #

Generic (Max a) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (Max a) :: Type -> Type #

Methods

from :: Max a -> Rep (Max a) x #

to :: Rep (Max a) x -> Max a #

Generic (First a) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (First a) :: Type -> Type #

Methods

from :: First a -> Rep (First a) x #

to :: Rep (First a) x -> First a #

Generic (Last a) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (Last a) :: Type -> Type #

Methods

from :: Last a -> Rep (Last a) x #

to :: Rep (Last a) x -> Last a #

Generic (WrappedMonoid m) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (WrappedMonoid m) :: Type -> Type #

Methods

from :: WrappedMonoid m -> Rep (WrappedMonoid m) x #

to :: Rep (WrappedMonoid m) x -> WrappedMonoid m #

Generic (Option a) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (Option a) :: Type -> Type #

Methods

from :: Option a -> Rep (Option a) x #

to :: Rep (Option a) x -> Option a #

Generic (ZipList a) 
Instance details

Defined in Control.Applicative

Associated Types

type Rep (ZipList a) :: Type -> Type #

Methods

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

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

Generic (Identity a) 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep (Identity a) :: Type -> Type #

Methods

from :: Identity a -> Rep (Identity a) x #

to :: Rep (Identity a) x -> Identity a #

Generic (First a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (First a) :: Type -> Type #

Methods

from :: First a -> Rep (First a) x #

to :: Rep (First a) x -> First a #

Generic (Last a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (Last a) :: Type -> Type #

Methods

from :: Last a -> Rep (Last a) x #

to :: Rep (Last a) x -> Last a #

Generic (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Dual a) :: Type -> Type #

Methods

from :: Dual a -> Rep (Dual a) x #

to :: Rep (Dual a) x -> Dual a #

Generic (Endo a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Endo a) :: Type -> Type #

Methods

from :: Endo a -> Rep (Endo a) x #

to :: Rep (Endo a) x -> Endo a #

Generic (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Sum a) :: Type -> Type #

Methods

from :: Sum a -> Rep (Sum a) x #

to :: Rep (Sum a) x -> Sum a #

Generic (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Product a) :: Type -> Type #

Methods

from :: Product a -> Rep (Product a) x #

to :: Rep (Product a) x -> Product a #

Generic (Down a) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Down a) :: Type -> Type #

Methods

from :: Down a -> Rep (Down a) x #

to :: Rep (Down a) x -> Down a #

Generic (NonEmpty a) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (NonEmpty a) :: Type -> Type #

Methods

from :: NonEmpty a -> Rep (NonEmpty a) x #

to :: Rep (NonEmpty a) x -> NonEmpty a #

Generic (Tree a) 
Instance details

Defined in Data.Tree

Associated Types

type Rep (Tree a) :: Type -> Type #

Methods

from :: Tree a -> Rep (Tree a) x #

to :: Rep (Tree a) x -> Tree a #

Generic (FingerTree a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (FingerTree a) :: Type -> Type #

Methods

from :: FingerTree a -> Rep (FingerTree a) x #

to :: Rep (FingerTree a) x -> FingerTree a #

Generic (Digit a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (Digit a) :: Type -> Type #

Methods

from :: Digit a -> Rep (Digit a) x #

to :: Rep (Digit a) x -> Digit a #

Generic (Node a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (Node a) :: Type -> Type #

Methods

from :: Node a -> Rep (Node a) x #

to :: Rep (Node a) x -> Node a #

Generic (Elem a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (Elem a) :: Type -> Type #

Methods

from :: Elem a -> Rep (Elem a) x #

to :: Rep (Elem a) x -> Elem a #

Generic (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (ViewL a) :: Type -> Type #

Methods

from :: ViewL a -> Rep (ViewL a) x #

to :: Rep (ViewL a) x -> ViewL a #

Generic (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep (ViewR a) :: Type -> Type #

Methods

from :: ViewR a -> Rep (ViewR a) x #

to :: Rep (ViewR a) x -> ViewR a #

Generic a => Generic (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep (Generically a) :: Type -> Type #

Methods

from :: Generically a -> Rep (Generically a) x #

to :: Rep (Generically a) x -> Generically a #

Generic a => Generic (FiniteEnumeration a) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep (FiniteEnumeration a) :: Type -> Type #

Methods

from :: FiniteEnumeration a -> Rep (FiniteEnumeration a) x #

to :: Rep (FiniteEnumeration a) x -> FiniteEnumeration a #

Generic (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Associated Types

type Rep (Interval a) :: Type -> Type #

Methods

from :: Interval a -> Rep (Interval a) x #

to :: Rep (Interval a) x -> Interval a #

Generic (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Associated Types

type Rep (Doc a) :: Type -> Type #

Methods

from :: Doc a -> Rep (Doc a) x #

to :: Rep (Doc a) x -> Doc a #

Generic (Root a) 
Instance details

Defined in Numeric.RootFinding

Associated Types

type Rep (Root a) :: Type -> Type #

Methods

from :: Root a -> Rep (Root a) x #

to :: Rep (Root a) x -> Root a #

Generic (Log a) 
Instance details

Defined in Numeric.Log

Associated Types

type Rep (Log a) :: Type -> Type #

Methods

from :: Log a -> Rep (Log a) x #

to :: Rep (Log a) x -> Log a #

Generic (V2 a) 
Instance details

Defined in Linear.V2

Associated Types

type Rep (V2 a) :: Type -> Type #

Methods

from :: V2 a -> Rep (V2 a) x #

to :: Rep (V2 a) x -> V2 a #

Generic (Located a) 
Instance details

Defined in Diagrams.Located

Associated Types

type Rep (Located a) :: Type -> Type #

Methods

from :: Located a -> Rep (Located a) x #

to :: Rep (Located a) x -> Located a #

Generic (V3 a) 
Instance details

Defined in Linear.V3

Associated Types

type Rep (V3 a) :: Type -> Type #

Methods

from :: V3 a -> Rep (V3 a) x #

to :: Rep (V3 a) x -> V3 a #

Generic (V1 a) 
Instance details

Defined in Linear.V1

Associated Types

type Rep (V1 a) :: Type -> Type #

Methods

from :: V1 a -> Rep (V1 a) x #

to :: Rep (V1 a) x -> V1 a #

Generic (Plucker a) 
Instance details

Defined in Linear.Plucker

Associated Types

type Rep (Plucker a) :: Type -> Type #

Methods

from :: Plucker a -> Rep (Plucker a) x #

to :: Rep (Plucker a) x -> Plucker a #

Generic (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Associated Types

type Rep (Quaternion a) :: Type -> Type #

Methods

from :: Quaternion a -> Rep (Quaternion a) x #

to :: Rep (Quaternion a) x -> Quaternion a #

Generic (V0 a) 
Instance details

Defined in Linear.V0

Associated Types

type Rep (V0 a) :: Type -> Type #

Methods

from :: V0 a -> Rep (V0 a) x #

to :: Rep (V0 a) x -> V0 a #

Generic (V4 a) 
Instance details

Defined in Linear.V4

Associated Types

type Rep (V4 a) :: Type -> Type #

Methods

from :: V4 a -> Rep (V4 a) x #

to :: Rep (V4 a) x -> V4 a #

Generic (Digit a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (Digit a) :: Type -> Type #

Methods

from :: Digit a -> Rep (Digit a) x #

to :: Rep (Digit a) x -> Digit a #

Generic (Either a b) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Either a b) :: Type -> Type #

Methods

from :: Either a b -> Rep (Either a b) x #

to :: Rep (Either a b) x -> Either a b #

Generic (V1 p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (V1 p) :: Type -> Type #

Methods

from :: V1 p -> Rep (V1 p) x #

to :: Rep (V1 p) x -> V1 p #

Generic (U1 p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (U1 p) :: Type -> Type #

Methods

from :: U1 p -> Rep (U1 p) x #

to :: Rep (U1 p) x -> U1 p #

Generic (a, b) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b) :: Type -> Type #

Methods

from :: (a, b) -> Rep (a, b) x #

to :: Rep (a, b) x -> (a, b) #

Generic (Arg a b) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep (Arg a b) :: Type -> Type #

Methods

from :: Arg a b -> Rep (Arg a b) x #

to :: Rep (Arg a b) x -> Arg a b #

Generic (WrappedMonad m a) 
Instance details

Defined in Control.Applicative

Associated Types

type Rep (WrappedMonad m a) :: Type -> Type #

Methods

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

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

Generic (Proxy t) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Proxy t) :: Type -> Type #

Methods

from :: Proxy t -> Rep (Proxy t) x #

to :: Rep (Proxy t) x -> Proxy t #

Generic (ViewL s a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (ViewL s a) :: Type -> Type #

Methods

from :: ViewL s a -> Rep (ViewL s a) x #

to :: Rep (ViewL s a) x -> ViewL s a #

Generic (ViewR s a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (ViewR s a) :: Type -> Type #

Methods

from :: ViewR s a -> Rep (ViewR s a) x #

to :: Rep (ViewR s a) x -> ViewR s a #

Generic (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (FingerTree v a) :: Type -> Type #

Methods

from :: FingerTree v a -> Rep (FingerTree v a) x #

to :: Rep (FingerTree v a) x -> FingerTree v a #

Generic (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (SearchResult v a) :: Type -> Type #

Methods

from :: SearchResult v a -> Rep (SearchResult v a) x #

to :: Rep (SearchResult v a) x -> SearchResult v a #

Generic (f a) => Generic (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep (Generically1 f a) :: Type -> Type #

Methods

from :: Generically1 f a -> Rep (Generically1 f a) x #

to :: Rep (Generically1 f a) x -> Generically1 f a #

Generic (ListF a b) 
Instance details

Defined in Data.Functor.Foldable

Associated Types

type Rep (ListF a b) :: Type -> Type #

Methods

from :: ListF a b -> Rep (ListF a b) x #

to :: Rep (ListF a b) x -> ListF a b #

Generic (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Associated Types

type Rep (Cofree f a) :: Type -> Type #

Methods

from :: Cofree f a -> Rep (Cofree f a) x #

to :: Rep (Cofree f a) x -> Cofree f a #

Generic (Free f a) 
Instance details

Defined in Control.Monad.Free

Associated Types

type Rep (Free f a) :: Type -> Type #

Methods

from :: Free f a -> Rep (Free f a) x #

to :: Rep (Free f a) x -> Free f a #

Generic (NonEmptyF a b) 
Instance details

Defined in Data.Functor.Base

Associated Types

type Rep (NonEmptyF a b) :: Type -> Type #

Methods

from :: NonEmptyF a b -> Rep (NonEmptyF a b) x #

to :: Rep (NonEmptyF a b) x -> NonEmptyF a b #

Generic (SizeSpec v n) 
Instance details

Defined in Diagrams.Size

Associated Types

type Rep (SizeSpec v n) :: Type -> Type #

Methods

from :: SizeSpec v n -> Rep (SizeSpec v n) x #

to :: Rep (SizeSpec v n) x -> SizeSpec v n #

Generic (Point f a) 
Instance details

Defined in Linear.Affine

Associated Types

type Rep (Point f a) :: Type -> Type #

Methods

from :: Point f a -> Rep (Point f a) x #

to :: Rep (Point f a) x -> Point f a #

Generic (Path v n) 
Instance details

Defined in Diagrams.Path

Associated Types

type Rep (Path v n) :: Type -> Type #

Methods

from :: Path v n -> Rep (Path v n) x #

to :: Rep (Path v n) x -> Path v n #

Generic (Node v a) 
Instance details

Defined in Data.FingerTree

Associated Types

type Rep (Node v a) :: Type -> Type #

Methods

from :: Node v a -> Rep (Node v a) x #

to :: Rep (Node v a) x -> Node v a #

Generic (Rec1 f p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Rec1 f p) :: Type -> Type #

Methods

from :: Rec1 f p -> Rep (Rec1 f p) x #

to :: Rep (Rec1 f p) x -> Rec1 f p #

Generic (URec (Ptr ()) p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec (Ptr ()) p) :: Type -> Type #

Methods

from :: URec (Ptr ()) p -> Rep (URec (Ptr ()) p) x #

to :: Rep (URec (Ptr ()) p) x -> URec (Ptr ()) p #

Generic (URec Char p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Char p) :: Type -> Type #

Methods

from :: URec Char p -> Rep (URec Char p) x #

to :: Rep (URec Char p) x -> URec Char p #

Generic (URec Double p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Double p) :: Type -> Type #

Methods

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

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

Generic (URec Float p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Float p) :: Type -> Type #

Methods

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

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

Generic (URec Int p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Int p) :: Type -> Type #

Methods

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

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

Generic (URec Word p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Word p) :: Type -> Type #

Methods

from :: URec Word p -> Rep (URec Word p) x #

to :: Rep (URec Word p) x -> URec Word p #

Generic (a, b, c) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b, c) :: Type -> Type #

Methods

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

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

Generic (WrappedArrow a b c) 
Instance details

Defined in Control.Applicative

Associated Types

type Rep (WrappedArrow a b c) :: Type -> Type #

Methods

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

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

Generic (Const a b) 
Instance details

Defined in Data.Functor.Const

Associated Types

type Rep (Const a b) :: Type -> Type #

Methods

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

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

Generic (Ap f a) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep (Ap f a) :: Type -> Type #

Methods

from :: Ap f a -> Rep (Ap f a) x #

to :: Rep (Ap f a) x -> Ap f a #

Generic (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep (Alt f a) :: Type -> Type #

Methods

from :: Alt f a -> Rep (Alt f a) x #

to :: Rep (Alt f a) x -> Alt f a #

Generic (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Associated Types

type Rep (Join p a) :: Type -> Type #

Methods

from :: Join p a -> Rep (Join p a) x #

to :: Rep (Join p a) x -> Join p a #

Generic (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Associated Types

type Rep (Fix p a) :: Type -> Type #

Methods

from :: Fix p a -> Rep (Fix p a) x #

to :: Rep (Fix p a) x -> Fix p a #

Generic (Tagged s b) 
Instance details

Defined in Data.Tagged

Associated Types

type Rep (Tagged s b) :: Type -> Type #

Methods

from :: Tagged s b -> Rep (Tagged s b) x #

to :: Rep (Tagged s b) x -> Tagged s b #

Generic (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Associated Types

type Rep (CofreeF f a b) :: Type -> Type #

Methods

from :: CofreeF f a b -> Rep (CofreeF f a b) x #

to :: Rep (CofreeF f a b) x -> CofreeF f a b #

Generic (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Associated Types

type Rep (FreeF f a b) :: Type -> Type #

Methods

from :: FreeF f a b -> Rep (FreeF f a b) x #

to :: Rep (FreeF f a b) x -> FreeF f a b #

Generic (V n a) 
Instance details

Defined in Linear.V

Associated Types

type Rep (V n a) :: Type -> Type #

Methods

from :: V n a -> Rep (V n a) x #

to :: Rep (V n a) x -> V n a #

Generic (K1 i c p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (K1 i c p) :: Type -> Type #

Methods

from :: K1 i c p -> Rep (K1 i c p) x #

to :: Rep (K1 i c p) x -> K1 i c p #

Generic ((f :+: g) p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep ((f :+: g) p) :: Type -> Type #

Methods

from :: (f :+: g) p -> Rep ((f :+: g) p) x #

to :: Rep ((f :+: g) p) x -> (f :+: g) p #

Generic ((f :*: g) p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep ((f :*: g) p) :: Type -> Type #

Methods

from :: (f :*: g) p -> Rep ((f :*: g) p) x #

to :: Rep ((f :*: g) p) x -> (f :*: g) p #

Generic (a, b, c, d) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d) :: Type -> Type #

Methods

from :: (a, b, c, d) -> Rep (a, b, c, d) x #

to :: Rep (a, b, c, d) x -> (a, b, c, d) #

Generic (Product f g a) 
Instance details

Defined in Data.Functor.Product

Associated Types

type Rep (Product f g a) :: Type -> Type #

Methods

from :: Product f g a -> Rep (Product f g a) x #

to :: Rep (Product f g a) x -> Product f g a #

Generic (Sum f g a) 
Instance details

Defined in Data.Functor.Sum

Associated Types

type Rep (Sum f g a) :: Type -> Type #

Methods

from :: Sum f g a -> Rep (Sum f g a) x #

to :: Rep (Sum f g a) x -> Sum f g a #

Generic (M1 i c f p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (M1 i c f p) :: Type -> Type #

Methods

from :: M1 i c f p -> Rep (M1 i c f p) x #

to :: Rep (M1 i c f p) x -> M1 i c f p #

Generic ((f :.: g) p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep ((f :.: g) p) :: Type -> Type #

Methods

from :: (f :.: g) p -> Rep ((f :.: g) p) x #

to :: Rep ((f :.: g) p) x -> (f :.: g) p #

Generic (a, b, c, d, e) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e) :: Type -> Type #

Methods

from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) x #

to :: Rep (a, b, c, d, e) x -> (a, b, c, d, e) #

Generic (Compose f g a) 
Instance details

Defined in Data.Functor.Compose

Associated Types

type Rep (Compose f g a) :: Type -> Type #

Methods

from :: Compose f g a -> Rep (Compose f g a) x #

to :: Rep (Compose f g a) x -> Compose f g a #

Generic (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Associated Types

type Rep (WrappedBifunctor p a b) :: Type -> Type #

Methods

from :: WrappedBifunctor p a b -> Rep (WrappedBifunctor p a b) x #

to :: Rep (WrappedBifunctor p a b) x -> WrappedBifunctor p a b #

Generic (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Associated Types

type Rep (Joker g a b) :: Type -> Type #

Methods

from :: Joker g a b -> Rep (Joker g a b) x #

to :: Rep (Joker g a b) x -> Joker g a b #

Generic (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Associated Types

type Rep (Flip p a b) :: Type -> Type #

Methods

from :: Flip p a b -> Rep (Flip p a b) x #

to :: Rep (Flip p a b) x -> Flip p a b #

Generic (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Associated Types

type Rep (Clown f a b) :: Type -> Type #

Methods

from :: Clown f a b -> Rep (Clown f a b) x #

to :: Rep (Clown f a b) x -> Clown f a b #

Generic (a, b, c, d, e, f) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e, f) :: Type -> Type #

Methods

from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) x #

to :: Rep (a, b, c, d, e, f) x -> (a, b, c, d, e, f) #

Generic (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Associated Types

type Rep (Sum p q a b) :: Type -> Type #

Methods

from :: Sum p q a b -> Rep (Sum p q a b) x #

to :: Rep (Sum p q a b) x -> Sum p q a b #

Generic (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Associated Types

type Rep (Product f g a b) :: Type -> Type #

Methods

from :: Product f g a b -> Rep (Product f g a b) x #

to :: Rep (Product f g a b) x -> Product f g a b #

Generic (a, b, c, d, e, f, g) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (a, b, c, d, e, f, g) :: Type -> Type #

Methods

from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) x #

to :: Rep (a, b, c, d, e, f, g) x -> (a, b, c, d, e, f, g) #

Generic (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Associated Types

type Rep (Tannen f p a b) :: Type -> Type #

Methods

from :: Tannen f p a b -> Rep (Tannen f p a b) x #

to :: Rep (Tannen f p a b) x -> Tannen f p a b #

Generic (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Associated Types

type Rep (Biff p f g a b) :: Type -> Type #

Methods

from :: Biff p f g a b -> Rep (Biff p f g a b) x #

to :: Rep (Biff p f g a b) x -> Biff p f g a b #

class Generic1 (f :: k -> Type) #

Representable types of kind * -> * (or kind k -> *, when PolyKinds + is enabled). + This class is derivable in GHC with the DeriveGeneric flag on.

A Generic1 instance must satisfy the following laws:

from1 . to1 ≡ id
+to1 . from1 ≡ id
+

Minimal complete definition

from1, to1

Instances
Generic1 (V1 :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 V1 :: k -> Type #

Methods

from1 :: V1 a -> Rep1 V1 a #

to1 :: Rep1 V1 a -> V1 a #

Generic1 (U1 :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 U1 :: k -> Type #

Methods

from1 :: U1 a -> Rep1 U1 a #

to1 :: Rep1 U1 a -> U1 a #

Generic1 (Proxy :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Proxy :: k -> Type #

Methods

from1 :: Proxy a -> Rep1 Proxy a #

to1 :: Rep1 Proxy a -> Proxy a #

Generic1 (Alt f :: k -> Type) 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 (Alt f) :: k -> Type #

Methods

from1 :: Alt f a -> Rep1 (Alt f) a #

to1 :: Rep1 (Alt f) a -> Alt f a #

Generic1 (Ap f :: k -> Type) 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 (Ap f) :: k -> Type #

Methods

from1 :: Ap f a -> Rep1 (Ap f) a #

to1 :: Rep1 (Ap f) a -> Ap f a #

Generic1 (Const a :: k -> Type) 
Instance details

Defined in Data.Functor.Const

Associated Types

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

Methods

from1 :: Const a a0 -> Rep1 (Const a) a0 #

to1 :: Rep1 (Const a) a0 -> Const a a0 #

Generic1 (URec (Ptr ()) :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec (Ptr ())) :: k -> Type #

Methods

from1 :: URec (Ptr ()) a -> Rep1 (URec (Ptr ())) a #

to1 :: Rep1 (URec (Ptr ())) a -> URec (Ptr ()) a #

Generic1 (URec Char :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Char) :: k -> Type #

Methods

from1 :: URec Char a -> Rep1 (URec Char) a #

to1 :: Rep1 (URec Char) a -> URec Char a #

Generic1 (URec Double :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

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

Methods

from1 :: URec Double a -> Rep1 (URec Double) a #

to1 :: Rep1 (URec Double) a -> URec Double a #

Generic1 (URec Float :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

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

Methods

from1 :: URec Float a -> Rep1 (URec Float) a #

to1 :: Rep1 (URec Float) a -> URec Float a #

Generic1 (URec Int :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

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

Methods

from1 :: URec Int a -> Rep1 (URec Int) a #

to1 :: Rep1 (URec Int) a -> URec Int a #

Generic1 (URec Word :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Word) :: k -> Type #

Methods

from1 :: URec Word a -> Rep1 (URec Word) a #

to1 :: Rep1 (URec Word) a -> URec Word a #

Generic1 (Rec1 f :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (Rec1 f) :: k -> Type #

Methods

from1 :: Rec1 f a -> Rep1 (Rec1 f) a #

to1 :: Rep1 (Rec1 f) a -> Rec1 f a #

Generic1 (Sum f g :: k -> Type) 
Instance details

Defined in Data.Functor.Sum

Associated Types

type Rep1 (Sum f g) :: k -> Type #

Methods

from1 :: Sum f g a -> Rep1 (Sum f g) a #

to1 :: Rep1 (Sum f g) a -> Sum f g a #

Generic1 (Product f g :: k -> Type) 
Instance details

Defined in Data.Functor.Product

Associated Types

type Rep1 (Product f g) :: k -> Type #

Methods

from1 :: Product f g a -> Rep1 (Product f g) a #

to1 :: Rep1 (Product f g) a -> Product f g a #

Generic1 (K1 i c :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (K1 i c) :: k -> Type #

Methods

from1 :: K1 i c a -> Rep1 (K1 i c) a #

to1 :: Rep1 (K1 i c) a -> K1 i c a #

Generic1 (f :+: g :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (f :+: g) :: k -> Type #

Methods

from1 :: (f :+: g) a -> Rep1 (f :+: g) a #

to1 :: Rep1 (f :+: g) a -> (f :+: g) a #

Generic1 (f :*: g :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (f :*: g) :: k -> Type #

Methods

from1 :: (f :*: g) a -> Rep1 (f :*: g) a #

to1 :: Rep1 (f :*: g) a -> (f :*: g) a #

Generic1 (WrappedBifunctor p a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Wrapped

Associated Types

type Rep1 (WrappedBifunctor p a) :: k -> Type #

Methods

from1 :: WrappedBifunctor p a a0 -> Rep1 (WrappedBifunctor p a) a0 #

to1 :: Rep1 (WrappedBifunctor p a) a0 -> WrappedBifunctor p a a0 #

Generic1 (Joker g a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Joker

Associated Types

type Rep1 (Joker g a) :: k -> Type #

Methods

from1 :: Joker g a a0 -> Rep1 (Joker g a) a0 #

to1 :: Rep1 (Joker g a) a0 -> Joker g a a0 #

Generic1 (Clown f a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Associated Types

type Rep1 (Clown f a) :: k -> Type #

Methods

from1 :: Clown f a a0 -> Rep1 (Clown f a) a0 #

to1 :: Rep1 (Clown f a) a0 -> Clown f a a0 #

Functor f => Generic1 (Compose f g :: k -> Type) 
Instance details

Defined in Data.Functor.Compose

Associated Types

type Rep1 (Compose f g) :: k -> Type #

Methods

from1 :: Compose f g a -> Rep1 (Compose f g) a #

to1 :: Rep1 (Compose f g) a -> Compose f g a #

Generic1 (M1 i c f :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (M1 i c f) :: k -> Type #

Methods

from1 :: M1 i c f a -> Rep1 (M1 i c f) a #

to1 :: Rep1 (M1 i c f) a -> M1 i c f a #

Functor f => Generic1 (f :.: g :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (f :.: g) :: k -> Type #

Methods

from1 :: (f :.: g) a -> Rep1 (f :.: g) a #

to1 :: Rep1 (f :.: g) a -> (f :.: g) a #

Generic1 (Sum p q a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Sum

Associated Types

type Rep1 (Sum p q a) :: k -> Type #

Methods

from1 :: Sum p q a a0 -> Rep1 (Sum p q a) a0 #

to1 :: Rep1 (Sum p q a) a0 -> Sum p q a a0 #

Generic1 (Product f g a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Product

Associated Types

type Rep1 (Product f g a) :: k -> Type #

Methods

from1 :: Product f g a a0 -> Rep1 (Product f g a) a0 #

to1 :: Rep1 (Product f g a) a0 -> Product f g a a0 #

Functor f => Generic1 (Tannen f p a :: k2 -> Type) 
Instance details

Defined in Data.Bifunctor.Tannen

Associated Types

type Rep1 (Tannen f p a) :: k -> Type #

Methods

from1 :: Tannen f p a a0 -> Rep1 (Tannen f p a) a0 #

to1 :: Rep1 (Tannen f p a) a0 -> Tannen f p a a0 #

Functor (p (f a)) => Generic1 (Biff p f g a :: k1 -> Type) 
Instance details

Defined in Data.Bifunctor.Biff

Associated Types

type Rep1 (Biff p f g a) :: k -> Type #

Methods

from1 :: Biff p f g a a0 -> Rep1 (Biff p f g a) a0 #

to1 :: Rep1 (Biff p f g a) a0 -> Biff p f g a a0 #

Generic1 [] 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 [] :: k -> Type #

Methods

from1 :: [a] -> Rep1 [] a #

to1 :: Rep1 [] a -> [a] #

Generic1 Maybe 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Maybe :: k -> Type #

Methods

from1 :: Maybe a -> Rep1 Maybe a #

to1 :: Rep1 Maybe a -> Maybe a #

Generic1 Par1 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Par1 :: k -> Type #

Methods

from1 :: Par1 a -> Rep1 Par1 a #

to1 :: Rep1 Par1 a -> Par1 a #

Generic1 Complex 
Instance details

Defined in Data.Complex

Associated Types

type Rep1 Complex :: k -> Type #

Methods

from1 :: Complex a -> Rep1 Complex a #

to1 :: Rep1 Complex a -> Complex a #

Generic1 Min 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 Min :: k -> Type #

Methods

from1 :: Min a -> Rep1 Min a #

to1 :: Rep1 Min a -> Min a #

Generic1 Max 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 Max :: k -> Type #

Methods

from1 :: Max a -> Rep1 Max a #

to1 :: Rep1 Max a -> Max a #

Generic1 First 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 First :: k -> Type #

Methods

from1 :: First a -> Rep1 First a #

to1 :: Rep1 First a -> First a #

Generic1 Last 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 Last :: k -> Type #

Methods

from1 :: Last a -> Rep1 Last a #

to1 :: Rep1 Last a -> Last a #

Generic1 WrappedMonoid 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 WrappedMonoid :: k -> Type #

Methods

from1 :: WrappedMonoid a -> Rep1 WrappedMonoid a #

to1 :: Rep1 WrappedMonoid a -> WrappedMonoid a #

Generic1 Option 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 Option :: k -> Type #

Methods

from1 :: Option a -> Rep1 Option a #

to1 :: Rep1 Option a -> Option a #

Generic1 ZipList 
Instance details

Defined in Control.Applicative

Associated Types

type Rep1 ZipList :: k -> Type #

Methods

from1 :: ZipList a -> Rep1 ZipList a #

to1 :: Rep1 ZipList a -> ZipList a #

Generic1 Identity 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep1 Identity :: k -> Type #

Methods

from1 :: Identity a -> Rep1 Identity a #

to1 :: Rep1 Identity a -> Identity a #

Generic1 First 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 First :: k -> Type #

Methods

from1 :: First a -> Rep1 First a #

to1 :: Rep1 First a -> First a #

Generic1 Last 
Instance details

Defined in Data.Monoid

Associated Types

type Rep1 Last :: k -> Type #

Methods

from1 :: Last a -> Rep1 Last a #

to1 :: Rep1 Last a -> Last a #

Generic1 Dual 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Dual :: k -> Type #

Methods

from1 :: Dual a -> Rep1 Dual a #

to1 :: Rep1 Dual a -> Dual a #

Generic1 Sum 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Sum :: k -> Type #

Methods

from1 :: Sum a -> Rep1 Sum a #

to1 :: Rep1 Sum a -> Sum a #

Generic1 Product 
Instance details

Defined in Data.Semigroup.Internal

Associated Types

type Rep1 Product :: k -> Type #

Methods

from1 :: Product a -> Rep1 Product a #

to1 :: Rep1 Product a -> Product a #

Generic1 Down 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Down :: k -> Type #

Methods

from1 :: Down a -> Rep1 Down a #

to1 :: Rep1 Down a -> Down a #

Generic1 NonEmpty 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 NonEmpty :: k -> Type #

Methods

from1 :: NonEmpty a -> Rep1 NonEmpty a #

to1 :: Rep1 NonEmpty a -> NonEmpty a #

Generic1 Tree 
Instance details

Defined in Data.Tree

Associated Types

type Rep1 Tree :: k -> Type #

Methods

from1 :: Tree a -> Rep1 Tree a #

to1 :: Rep1 Tree a -> Tree a #

Generic1 FingerTree 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 FingerTree :: k -> Type #

Methods

from1 :: FingerTree a -> Rep1 FingerTree a #

to1 :: Rep1 FingerTree a -> FingerTree a #

Generic1 Digit 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 Digit :: k -> Type #

Methods

from1 :: Digit a -> Rep1 Digit a #

to1 :: Rep1 Digit a -> Digit a #

Generic1 Node 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 Node :: k -> Type #

Methods

from1 :: Node a -> Rep1 Node a #

to1 :: Rep1 Node a -> Node a #

Generic1 Elem 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 Elem :: k -> Type #

Methods

from1 :: Elem a -> Rep1 Elem a #

to1 :: Rep1 Elem a -> Elem a #

Generic1 ViewL 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 ViewL :: k -> Type #

Methods

from1 :: ViewL a -> Rep1 ViewL a #

to1 :: Rep1 ViewL a -> ViewL a #

Generic1 ViewR 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Rep1 ViewR :: k -> Type #

Methods

from1 :: ViewR a -> Rep1 ViewR a #

to1 :: Rep1 ViewR a -> ViewR a #

Generic1 Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Associated Types

type Rep1 Interval :: k -> Type #

Methods

from1 :: Interval a -> Rep1 Interval a #

to1 :: Rep1 Interval a -> Interval a #

Generic1 V2 
Instance details

Defined in Linear.V2

Associated Types

type Rep1 V2 :: k -> Type #

Methods

from1 :: V2 a -> Rep1 V2 a #

to1 :: Rep1 V2 a -> V2 a #

Generic1 Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Rep1 Polar :: k -> Type #

Methods

from1 :: Polar a -> Rep1 Polar a #

to1 :: Rep1 Polar a -> Polar a #

Generic1 V3 
Instance details

Defined in Linear.V3

Associated Types

type Rep1 V3 :: k -> Type #

Methods

from1 :: V3 a -> Rep1 V3 a #

to1 :: Rep1 V3 a -> V3 a #

Generic1 V1 
Instance details

Defined in Linear.V1

Associated Types

type Rep1 V1 :: k -> Type #

Methods

from1 :: V1 a -> Rep1 V1 a #

to1 :: Rep1 V1 a -> V1 a #

Generic1 Plucker 
Instance details

Defined in Linear.Plucker

Associated Types

type Rep1 Plucker :: k -> Type #

Methods

from1 :: Plucker a -> Rep1 Plucker a #

to1 :: Rep1 Plucker a -> Plucker a #

Generic1 Quaternion 
Instance details

Defined in Linear.Quaternion

Associated Types

type Rep1 Quaternion :: k -> Type #

Methods

from1 :: Quaternion a -> Rep1 Quaternion a #

to1 :: Rep1 Quaternion a -> Quaternion a #

Generic1 V0 
Instance details

Defined in Linear.V0

Associated Types

type Rep1 V0 :: k -> Type #

Methods

from1 :: V0 a -> Rep1 V0 a #

to1 :: Rep1 V0 a -> V0 a #

Generic1 V4 
Instance details

Defined in Linear.V4

Associated Types

type Rep1 V4 :: k -> Type #

Methods

from1 :: V4 a -> Rep1 V4 a #

to1 :: Rep1 V4 a -> V4 a #

Generic1 (Either a :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (Either a) :: k -> Type #

Methods

from1 :: Either a a0 -> Rep1 (Either a) a0 #

to1 :: Rep1 (Either a) a0 -> Either a a0 #

Generic1 ((,) a :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,) a) :: k -> Type #

Methods

from1 :: (a, a0) -> Rep1 ((,) a) a0 #

to1 :: Rep1 ((,) a) a0 -> (a, a0) #

Generic1 (Arg a :: Type -> Type) 
Instance details

Defined in Data.Semigroup

Associated Types

type Rep1 (Arg a) :: k -> Type #

Methods

from1 :: Arg a a0 -> Rep1 (Arg a) a0 #

to1 :: Rep1 (Arg a) a0 -> Arg a a0 #

Generic1 (WrappedMonad m :: Type -> Type) 
Instance details

Defined in Control.Applicative

Associated Types

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

Methods

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

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

Generic1 f => Generic1 (Generically1 f :: Type -> Type) 
Instance details

Defined in Generic.Data.Internal.Generically

Associated Types

type Rep1 (Generically1 f) :: k -> Type #

Methods

from1 :: Generically1 f a -> Rep1 (Generically1 f) a #

to1 :: Rep1 (Generically1 f) a -> Generically1 f a #

Generic1 (ListF a :: Type -> Type) 
Instance details

Defined in Data.Functor.Foldable

Associated Types

type Rep1 (ListF a) :: k -> Type #

Methods

from1 :: ListF a a0 -> Rep1 (ListF a) a0 #

to1 :: Rep1 (ListF a) a0 -> ListF a a0 #

Functor f => Generic1 (Cofree f :: Type -> Type) 
Instance details

Defined in Control.Comonad.Cofree

Associated Types

type Rep1 (Cofree f) :: k -> Type #

Methods

from1 :: Cofree f a -> Rep1 (Cofree f) a #

to1 :: Rep1 (Cofree f) a -> Cofree f a #

Functor f => Generic1 (Free f :: Type -> Type) 
Instance details

Defined in Control.Monad.Free

Associated Types

type Rep1 (Free f) :: k -> Type #

Methods

from1 :: Free f a -> Rep1 (Free f) a #

to1 :: Rep1 (Free f) a -> Free f a #

Generic1 (NonEmptyF a :: Type -> Type) 
Instance details

Defined in Data.Functor.Base

Associated Types

type Rep1 (NonEmptyF a) :: k -> Type #

Methods

from1 :: NonEmptyF a a0 -> Rep1 (NonEmptyF a) a0 #

to1 :: Rep1 (NonEmptyF a) a0 -> NonEmptyF a a0 #

Generic1 (Point f :: Type -> Type) 
Instance details

Defined in Linear.Affine

Associated Types

type Rep1 (Point f) :: k -> Type #

Methods

from1 :: Point f a -> Rep1 (Point f) a #

to1 :: Rep1 (Point f) a -> Point f a #

Generic1 ((,,) a b :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,,) a b) :: k -> Type #

Methods

from1 :: (a, b, a0) -> Rep1 ((,,) a b) a0 #

to1 :: Rep1 ((,,) a b) a0 -> (a, b, a0) #

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

Defined in Control.Applicative

Associated Types

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

Methods

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

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

Generic1 (Tagged s :: Type -> Type) 
Instance details

Defined in Data.Tagged

Associated Types

type Rep1 (Tagged s) :: k -> Type #

Methods

from1 :: Tagged s a -> Rep1 (Tagged s) a #

to1 :: Rep1 (Tagged s) a -> Tagged s a #

Generic1 (CofreeF f a :: Type -> Type) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Associated Types

type Rep1 (CofreeF f a) :: k -> Type #

Methods

from1 :: CofreeF f a a0 -> Rep1 (CofreeF f a) a0 #

to1 :: Rep1 (CofreeF f a) a0 -> CofreeF f a a0 #

Generic1 (FreeF f a :: Type -> Type) 
Instance details

Defined in Control.Monad.Trans.Free

Associated Types

type Rep1 (FreeF f a) :: k -> Type #

Methods

from1 :: FreeF f a a0 -> Rep1 (FreeF f a) a0 #

to1 :: Rep1 (FreeF f a) a0 -> FreeF f a a0 #

Generic1 (V n :: Type -> Type) 
Instance details

Defined in Linear.V

Associated Types

type Rep1 (V n) :: k -> Type #

Methods

from1 :: V n a -> Rep1 (V n) a #

to1 :: Rep1 (V n) a -> V n a #

Generic1 ((,,,) a b c :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,,,) a b c) :: k -> Type #

Methods

from1 :: (a, b, c, a0) -> Rep1 ((,,,) a b c) a0 #

to1 :: Rep1 ((,,,) a b c) a0 -> (a, b, c, a0) #

Generic1 ((,,,,) a b c d :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,,,,) a b c d) :: k -> Type #

Methods

from1 :: (a, b, c, d, a0) -> Rep1 ((,,,,) a b c d) a0 #

to1 :: Rep1 ((,,,,) a b c d) a0 -> (a, b, c, d, a0) #

Generic1 ((,,,,,) a b c d e :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,,,,,) a b c d e) :: k -> Type #

Methods

from1 :: (a, b, c, d, e, a0) -> Rep1 ((,,,,,) a b c d e) a0 #

to1 :: Rep1 ((,,,,,) a b c d e) a0 -> (a, b, c, d, e, a0) #

Generic1 ((,,,,,,) a b c d e f :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 ((,,,,,,) a b c d e f) :: k -> Type #

Methods

from1 :: (a, b, c, d, e, f, a0) -> Rep1 ((,,,,,,) a b c d e f) a0 #

to1 :: Rep1 ((,,,,,,) a b c d e f) a0 -> (a, b, c, d, e, f, a0) #

\ No newline at end of file diff --git a/docs/doc/Language-Stochaskell-Plot.html b/docs/doc/Language-Stochaskell-Plot.html index 39effe8..81e44c5 100644 --- a/docs/doc/Language-Stochaskell-Plot.html +++ b/docs/doc/Language-Stochaskell-Plot.html @@ -1,4 +1,4 @@ -Language.Stochaskell.Plot

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell.Plot

Description

 
Synopsis

Documentation

class ToPNG a where #

Minimal complete definition

toPNG

Methods

toPNG :: String -> a -> IO () #

Instances
ToPNG (Renderable a) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> Renderable a -> IO () #

ToPNG (QDiagram Cairo V2 Double Any) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> QDiagram Cairo V2 Double Any -> IO () #

kde :: Double -> [Double] -> [(Double, Double)] #

kdeplot :: String -> Double -> [Double] -> EC (Layout Double Double) () #

renderAxis2 :: State (Axis Cairo V2 Double) () -> QDiagram Cairo V2 Double Any #

xlabel :: MonadState (Layout x y) m => String -> m () #

xlim :: (MonadState (Layout x y) m, RealFloat x, Show x) => (x, x) -> m () #

ylabel :: MonadState (Layout x y) m => String -> m () #

ylim :: (MonadState (Layout x y) m, RealFloat y, Show y) => (y, y) -> m () #

Re-exports

Graphics.Rendering.Chart.Easy

class (Functor t, Foldable t) => Traversable (t :: * -> *) where #

Functors representing data structures that can be traversed from +Language.Stochaskell.Plot

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell.Plot

Description

 
Synopsis

Documentation

class PlotP t where #

Minimal complete definition

plotP

Methods

plotP :: P (Expression t) -> Int -> String -> IO ChartPlot #

plotP' :: P (Expression t) -> Int -> String -> IO ChartPlot #

restricted to positive domain

Instances
PlotP Double # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

plotP :: P (Expression Double) -> Int -> String -> IO ChartPlot #

plotP' :: P (Expression Double) -> Int -> String -> IO ChartPlot #

PlotP Integer # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

plotP :: P (Expression Integer) -> Int -> String -> IO ChartPlot #

plotP' :: P (Expression Integer) -> Int -> String -> IO ChartPlot #

class ToImage a where #

Methods

toPNG :: String -> a -> IO () #

toSVG :: String -> a -> IO () #

Instances
ToImage (Renderable a) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> Renderable a -> IO () #

toSVG :: String -> Renderable a -> IO () #

ToImage (QDiagram Cairo V2 Double Any) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> QDiagram Cairo V2 Double Any -> IO () #

toSVG :: String -> QDiagram Cairo V2 Double Any -> IO () #

kde :: Double -> [Double] -> [(Double, Double)] #

kde' :: [Double] -> [(Double, Double)] #

kdeplot :: String -> Double -> [Double] -> ChartPlot #

kdeplot' :: String -> [Double] -> ChartPlot #

plotHist :: String -> [Double] -> (Double, Double) -> Double -> ChartPlot #

plotUnder :: String -> [(Double, Double)] -> ChartPlot #

plotpdf :: String -> P R -> (Double, Double) -> ChartPlot #

plotStep :: String -> (Double, Double) -> [Double] -> ChartPlot #

renderAxis2 :: State (Axis Cairo V2 Double) () -> QDiagram Cairo V2 Double Any #

xlabel :: MonadState (Layout x y) m => String -> m () #

xlim :: (MonadState (Layout x y) m, RealFloat x, Show x) => (x, x) -> m () #

ylabel :: MonadState (Layout x y) m => String -> m () #

ylim :: (MonadState (Layout x y) m, RealFloat y, Show y) => (y, y) -> m () #

Re-exports

Graphics.Rendering.Chart.Easy

class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #

Functors representing data structures that can be traversed from left to right.

A definition of traverse must satisfy the following laws:

naturality
t . traverse f = traverse (t . f) for every applicative transformation t
identity
traverse Identity = Identity
composition
traverse (Compose . fmap g . f) = Compose . fmap (traverse g) . traverse f

A definition of sequenceA must satisfy the following laws:

naturality
t . sequenceA = sequenceA . fmap t for every applicative transformation t
identity
sequenceA . fmap Identity = Identity
composition
sequenceA . fmap Compose = Compose . fmap sequenceA . sequenceA

where an applicative transformation is a function

t :: (Applicative f, Applicative g) => f a -> g a

preserving the Applicative operations, i.e.

and the identity functor Identity and composition of functors Compose @@ -23,30 +23,36 @@ traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r

This is suitable even for abstract types, as the laws for <*> imply a form of associativity.

The superclass instances should satisfy the following:

Minimal complete definition

traverse | sequenceA

Methods

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

Map each element of a structure to an action, evaluate these actions + (foldMapDefault).

Minimal complete definition

traverse | sequenceA

Methods

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

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores - the results see traverse_.

Instances
Traversable []

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> [a] -> f [b] #

sequenceA :: Applicative f => [f a] -> f [a] #

mapM :: Monad m => (a -> m b) -> [a] -> m [b] #

sequence :: Monad m => [m a] -> m [a] #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

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

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

Traversable Par1 
Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) #

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

sequence :: Monad m => Par1 (m a) -> m (Par1 a) #

Traversable Identity 
Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

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

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Traversable Complex 
Instance details

Defined in Data.Complex

Methods

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

sequenceA :: Applicative f => Complex (f a) -> f (Complex a) #

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

sequence :: Monad m => Complex (m a) -> m (Complex a) #

Traversable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Min (f a) -> f (Min a) #

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

sequence :: Monad m => Min (m a) -> m (Min a) #

Traversable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Max (f a) -> f (Max a) #

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

sequence :: Monad m => Max (m a) -> m (Max a) #

Traversable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => First (f a) -> f (First a) #

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

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

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

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Option (f a) -> f (Option a) #

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

sequence :: Monad m => Option (m a) -> m (Option a) #

Traversable ZipList

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

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

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

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

Traversable First

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => First (f a) -> f (First a) #

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

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

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

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Dual (f a) -> f (Dual a) #

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

sequence :: Monad m => Dual (m a) -> m (Dual a) #

Traversable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Sum (f a) -> f (Sum a) #

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

sequence :: Monad m => Sum (m a) -> m (Sum a) #

Traversable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Product (f a) -> f (Product a) #

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

sequence :: Monad m => Product (m a) -> m (Product a) #

Traversable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) #

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

sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #

Traversable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

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

sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) #

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

sequence :: Monad m => IntMap (m a) -> m (IntMap a) #

Traversable SCC

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

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

sequenceA :: Applicative f => SCC (f a) -> f (SCC a) #

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

sequence :: Monad m => SCC (m a) -> m (SCC a) #

Traversable Tree 
Instance details

Defined in Data.Tree

Methods

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

sequenceA :: Applicative f => Tree (f a) -> f (Tree a) #

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

sequence :: Monad m => Tree (m a) -> m (Tree a) #

Traversable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Seq (f a) -> f (Seq a) #

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

sequence :: Monad m => Seq (m a) -> m (Seq a) #

Traversable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) #

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

sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #

Traversable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Digit (f a) -> f (Digit a) #

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

sequence :: Monad m => Digit (m a) -> m (Digit a) #

Traversable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Node (f a) -> f (Node a) #

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

sequence :: Monad m => Node (m a) -> m (Node a) #

Traversable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Elem (f a) -> f (Elem a) #

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

sequence :: Monad m => Elem (m a) -> m (Elem a) #

Traversable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) #

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

sequence :: Monad m => ViewL (m a) -> m (ViewL a) #

Traversable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) #

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

sequence :: Monad m => ViewR (m a) -> m (ViewR a) #

Traversable V3 
Instance details

Defined in Linear.V3

Methods

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

sequenceA :: Applicative f => V3 (f a) -> f (V3 a) #

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

sequence :: Monad m => V3 (m a) -> m (V3 a) #

Traversable V2 
Instance details

Defined in Linear.V2

Methods

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

sequenceA :: Applicative f => V2 (f a) -> f (V2 a) #

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

sequence :: Monad m => V2 (m a) -> m (V2 a) #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

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

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

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

sequence :: Monad m => Polar (m a) -> m (Polar a) #

Traversable Array 
Instance details

Defined in Data.Primitive.Array

Methods

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

sequenceA :: Applicative f => Array (f a) -> f (Array a) #

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

sequence :: Monad m => Array (m a) -> m (Array a) #

Traversable Vector 
Instance details

Defined in Data.Vector

Methods

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

sequenceA :: Applicative f => Vector (f a) -> f (Vector a) #

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

sequence :: Monad m => Vector (m a) -> m (Vector a) #

Traversable Log 
Instance details

Defined in Numeric.Log

Methods

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

sequenceA :: Applicative f => Log (f a) -> f (Log a) #

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

sequence :: Monad m => Log (m a) -> m (Log a) #

Traversable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

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

sequenceA :: Applicative f => Interval (f a) -> f (Interval a) #

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

sequence :: Monad m => Interval (m a) -> m (Interval a) #

Traversable V1 
Instance details

Defined in Linear.V1

Methods

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

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

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

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable V4 
Instance details

Defined in Linear.V4

Methods

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

sequenceA :: Applicative f => V4 (f a) -> f (V4 a) #

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

sequence :: Monad m => V4 (m a) -> m (V4 a) #

Traversable Plucker 
Instance details

Defined in Linear.Plucker

Methods

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

sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) #

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

sequence :: Monad m => Plucker (m a) -> m (Plucker a) #

Traversable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

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

sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) #

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

sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) #

Traversable V0 
Instance details

Defined in Linear.V0

Methods

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

sequenceA :: Applicative f => V0 (f a) -> f (V0 a) #

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

sequence :: Monad m => V0 (m a) -> m (V0 a) #

Traversable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

sequenceA :: Applicative f => IResult (f a) -> f (IResult a) #

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

sequence :: Monad m => IResult (m a) -> m (IResult a) #

Traversable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

sequenceA :: Applicative f => Result (f a) -> f (Result a) #

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

sequence :: Monad m => Result (m a) -> m (Result a) #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Traversable (V1 :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

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

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => U1 (f a) -> f (U1 a) #

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

sequence :: Monad m => U1 (m a) -> m (U1 a) #

Traversable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequenceA :: Applicative f => (a, f a0) -> f (a, a0) #

mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) #

sequence :: Monad m => (a, m a0) -> m (a, a0) #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

Traversable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) #

sequenceA :: Applicative f => Map k (f a) -> f (Map k a) #

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) #

sequence :: Monad m => Map k (m a) -> m (Map k a) #

Ix i => Traversable (Array i)

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) #

sequenceA :: Applicative f => Array i (f a) -> f (Array i a) #

mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) #

sequence :: Monad m => Array i (m a) -> m (Array i a) #

Traversable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) #

sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) #

mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) #

sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #

Traversable (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) #

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

sequence :: Monad m => Proxy (m a) -> m (Proxy a) #

Traversable f => Traversable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) #

sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) #

mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) #

sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #

Traversable f => Traversable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) #

sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) #

mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) #

sequence :: Monad m => ListT f (m a) -> m (ListT f a) #

Traversable f => Traversable (Point f) 
Instance details

Defined in Linear.Affine

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) #

sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) #

mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) #

sequence :: Monad m => Point f (m a) -> m (Point f a) #

Traversable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

traverse :: Applicative f => (a -> f b) -> Categorical p a -> f (Categorical p b) #

sequenceA :: Applicative f => Categorical p (f a) -> f (Categorical p a) #

mapM :: Monad m => (a -> m b) -> Categorical p a -> m (Categorical p b) #

sequence :: Monad m => Categorical p (m a) -> m (Categorical p a) #

Traversable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) #

sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) #

mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) #

sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #

Traversable f => Traversable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) #

mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) #

sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #

Traversable f => Traversable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) #

mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) #

sequence :: Monad m => Free f (m a) -> m (Free f a) #

Traversable f => Traversable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) #

mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) #

sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #

Traversable f => Traversable (Rec1 f) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) #

mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) #

sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #

Traversable (URec Char :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Traversable (URec Double :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Traversable (URec Float :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Traversable (URec Int :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Traversable (URec Word :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Traversable (URec (Ptr ()) :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) #

sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) #

mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) #

sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #

Traversable (Const m :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Traversable f => Traversable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) #

mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) #

sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #

Traversable f => Traversable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) #

sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) #

mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) #

sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) #

Traversable f => Traversable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) #

sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) #

mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) #

sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #

Traversable f => Traversable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) #

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) #

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Bitraversable p => Traversable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) #

sequenceA :: Applicative f => Join p (f a) -> f (Join p a) #

mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) #

sequence :: Monad m => Join p (m a) -> m (Join p a) #

Traversable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) #

sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) #

mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) #

sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #

(Traversable f, Traversable w) => Traversable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) #

sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) #

mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) #

sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #

Traversable f => Traversable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) #

sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) #

sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #

Bitraversable p => Traversable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) #

sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) #

mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) #

sequence :: Monad m => Fix p (m a) -> m (Fix p a) #

Traversable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

traverse :: Applicative f => (a0 -> f b) -> Forget r a a0 -> f (Forget r a b) #

sequenceA :: Applicative f => Forget r a (f a0) -> f (Forget r a a0) #

mapM :: Monad m => (a0 -> m b) -> Forget r a a0 -> m (Forget r a b) #

sequence :: Monad m => Forget r a (m a0) -> m (Forget r a a0) #

(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) #

sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) #

mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) #

sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #

Traversable f => Traversable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) #

sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) #

sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #

Traversable (V n) 
Instance details

Defined in Linear.V

Methods

traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) #

sequenceA :: Applicative f => V n (f a) -> f (V n a) #

mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) #

sequence :: Monad m => V n (m a) -> m (V n a) #

Traversable f => Traversable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 (AlongsideLeft f b a) #

mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m (AlongsideLeft f b b0) #

sequence :: Monad m => AlongsideLeft f b (m a) -> m (AlongsideLeft f b a) #

Traversable f => Traversable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 (AlongsideRight f a a0) #

mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m (AlongsideRight f a b) #

sequence :: Monad m => AlongsideRight f a (m a0) -> m (AlongsideRight f a a0) #

Traversable (K1 i c :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) #

sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) #

mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) #

sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #

(Traversable f, Traversable g) => Traversable (f :+: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) #

mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) #

sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #

(Traversable f, Traversable g) => Traversable (f :*: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a) #

mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b) #

sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a) #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

(Traversable f, Traversable g) => Traversable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) #

mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) #

sequence :: Monad m => Product f g (m a) -> m (Product f g a) #

(Traversable f, Traversable g) => Traversable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) #

mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) #

sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) #

Traversable f => Traversable (M1 i c f) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) #

mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) #

sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #

(Traversable f, Traversable g) => Traversable (f :.: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) #

mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) #

sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #

(Traversable f, Traversable g) => Traversable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) #

mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) #

sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #

Traversable (Clown f a :: * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) #

sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) #

mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) #

sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #

Bitraversable p => Traversable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) #

sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) #

mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) #

sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #

Traversable g => Traversable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) #

mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) #

sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #

Bitraversable p => Traversable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) #

sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) #

mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) #

sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #

(Traversable f, Bitraversable p) => Traversable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) #

sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) #

mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) #

sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #

(Bitraversable p, Traversable g) => Traversable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) #

sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) #

mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) #

sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class (Foldable1 t, Traversable t) => Traversable1 (t :: * -> *) where #

Minimal complete definition

traverse1 | sequence1

Methods

traverse1 :: Apply f => (a -> f b) -> t a -> f (t b) #

Instances
Traversable1 Par1 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Par1 a -> f (Par1 b) #

sequence1 :: Apply f => Par1 (f b) -> f (Par1 b)

Traversable1 Identity 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) #

sequence1 :: Apply f => Identity (f b) -> f (Identity b)

Traversable1 Complex 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Complex a -> f (Complex b) #

sequence1 :: Apply f => Complex (f b) -> f (Complex b)

Traversable1 NonEmpty 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) #

sequence1 :: Apply f => NonEmpty (f b) -> f (NonEmpty b)

Traversable1 Tree 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Tree a -> f (Tree b) #

sequence1 :: Apply f => Tree (f b) -> f (Tree b)

Traversable1 V3 
Instance details

Defined in Linear.V3

Methods

traverse1 :: Apply f => (a -> f b) -> V3 a -> f (V3 b) #

sequence1 :: Apply f => V3 (f b) -> f (V3 b)

Traversable1 V2 
Instance details

Defined in Linear.V2

Methods

traverse1 :: Apply f => (a -> f b) -> V2 a -> f (V2 b) #

sequence1 :: Apply f => V2 (f b) -> f (V2 b)

Traversable1 Log 
Instance details

Defined in Numeric.Log

Methods

traverse1 :: Apply f => (a -> f b) -> Log a -> f (Log b) #

sequence1 :: Apply f => Log (f b) -> f (Log b)

Traversable1 V1 
Instance details

Defined in Linear.V1

Methods

traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) #

sequence1 :: Apply f => V1 (f b) -> f (V1 b)

Traversable1 V4 
Instance details

Defined in Linear.V4

Methods

traverse1 :: Apply f => (a -> f b) -> V4 a -> f (V4 b) #

sequence1 :: Apply f => V4 (f b) -> f (V4 b)

Traversable1 Plucker 
Instance details

Defined in Linear.Plucker

Methods

traverse1 :: Apply f => (a -> f b) -> Plucker a -> f (Plucker b) #

sequence1 :: Apply f => Plucker (f b) -> f (Plucker b)

Traversable1 (V1 :: * -> *) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) #

sequence1 :: Apply f => V1 (f b) -> f (V1 b)

Traversable1 ((,) a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequence1 :: Apply f => (a, f b) -> f (a, b)

Traversable1 f => Traversable1 (Lift f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Lift f a -> f0 (Lift f b) #

sequence1 :: Apply f0 => Lift f (f0 b) -> f0 (Lift f b)

Traversable1 f => Traversable1 (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequence1 :: Apply f0 => Cofree f (f0 b) -> f0 (Cofree f b)

Traversable1 f => Traversable1 (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequence1 :: Apply f0 => Free f (f0 b) -> f0 (Free f b)

Traversable1 f => Traversable1 (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequence1 :: Apply f0 => Yoneda f (f0 b) -> f0 (Yoneda f b)

Traversable1 f => Traversable1 (Rec1 f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequence1 :: Apply f0 => Rec1 f (f0 b) -> f0 (Rec1 f b)

Traversable1 f => Traversable1 (IdentityT f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequence1 :: Apply f0 => IdentityT f (f0 b) -> f0 (IdentityT f b)

Traversable1 f => Traversable1 (Backwards f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequence1 :: Apply f0 => Backwards f (f0 b) -> f0 (Backwards f b)

Traversable1 f => Traversable1 (Reverse f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Reverse f a -> f0 (Reverse f b) #

sequence1 :: Apply f0 => Reverse f (f0 b) -> f0 (Reverse f b)

Bitraversable1 p => Traversable1 (Join p) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Join p a -> f (Join p b) #

sequence1 :: Apply f => Join p (f b) -> f (Join p b)

Traversable1 (Tagged a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> Tagged a a0 -> f (Tagged a b) #

sequence1 :: Apply f => Tagged a (f b) -> f (Tagged a b)

Traversable1 f => Traversable1 (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse1 :: Apply f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequence1 :: Apply f0 => AlongsideLeft f b (f0 b0) -> f0 (AlongsideLeft f b b0)

Traversable1 f => Traversable1 (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse1 :: Apply f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequence1 :: Apply f0 => AlongsideRight f a (f0 b) -> f0 (AlongsideRight f a b)

(Traversable1 f, Traversable1 g) => Traversable1 (f :+: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequence1 :: Apply f0 => (f :+: g) (f0 b) -> f0 ((f :+: g) b)

(Traversable1 f, Traversable1 g) => Traversable1 (f :*: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequence1 :: Apply f0 => (f :*: g) (f0 b) -> f0 ((f :*: g) b)

(Traversable1 f, Traversable1 g) => Traversable1 (Product f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequence1 :: Apply f0 => Product f g (f0 b) -> f0 (Product f g b)

(Traversable1 f, Traversable1 g) => Traversable1 (Sum f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequence1 :: Apply f0 => Sum f g (f0 b) -> f0 (Sum f g b)

Traversable1 f => Traversable1 (M1 i c f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequence1 :: Apply f0 => M1 i c f (f0 b) -> f0 (M1 i c f b)

(Traversable1 f, Traversable1 g) => Traversable1 (f :.: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequence1 :: Apply f0 => (f :.: g) (f0 b) -> f0 ((f :.: g) b)

(Traversable1 f, Traversable1 g) => Traversable1 (Compose f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequence1 :: Apply f0 => Compose f g (f0 b) -> f0 (Compose f g b)

Traversable1 g => Traversable1 (Joker g a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequence1 :: Apply f => Joker g a (f b) -> f (Joker g a b)

class Profunctor (p :: * -> * -> *) where #

Minimal complete definition

dimap | lmap, rmap

Methods

dimap :: (a -> b) -> (c -> d) -> p b c -> p a d #

lmap :: (a -> b) -> p b c -> p a c #

rmap :: (b -> c) -> p a b -> p a c #

Instances
Profunctor ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d #

lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c #

rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c

(.#) :: Coercible b a => ReifiedGetter b c -> (a -> b) -> ReifiedGetter a c

Profunctor ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d #

lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c #

rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedFold a b -> ReifiedFold a c

(.#) :: Coercible b a => ReifiedFold b c -> (a -> b) -> ReifiedFold a c

Profunctor Measured 
Instance details

Defined in Diagrams.Core.Measure

Methods

dimap :: (a -> b) -> (c -> d) -> Measured b c -> Measured a d #

lmap :: (a -> b) -> Measured b c -> Measured a c #

rmap :: (b -> c) -> Measured a b -> Measured a c #

(#.) :: Coercible c b => (b -> c) -> Measured a b -> Measured a c

(.#) :: Coercible b a => Measured b c -> (a -> b) -> Measured a c

Profunctor (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d #

lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c #

rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c

(.#) :: Coercible b a => ReifiedIndexedGetter i b c -> (a -> b) -> ReifiedIndexedGetter i a c

Profunctor (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d #

lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c #

rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c

(.#) :: Coercible b a => ReifiedIndexedFold i b c -> (a -> b) -> ReifiedIndexedFold i a c

Profunctor (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d #

lmap :: (a -> b) -> Indexed i b c -> Indexed i a c #

rmap :: (b -> c) -> Indexed i a b -> Indexed i a c #

(#.) :: Coercible c b => (b -> c) -> Indexed i a b -> Indexed i a c

(.#) :: Coercible b a => Indexed i b c -> (a -> b) -> Indexed i a c

Monad m => Profunctor (Kleisli m) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Kleisli m b c -> Kleisli m a d #

lmap :: (a -> b) -> Kleisli m b c -> Kleisli m a c #

rmap :: (b -> c) -> Kleisli m a b -> Kleisli m a c #

(#.) :: Coercible c b => (b -> c) -> Kleisli m a b -> Kleisli m a c

(.#) :: Coercible b a => Kleisli m b c -> (a -> b) -> Kleisli m a c

Profunctor (Tagged :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Tagged b c -> Tagged a d #

lmap :: (a -> b) -> Tagged b c -> Tagged a c #

rmap :: (b -> c) -> Tagged a b -> Tagged a c #

(#.) :: Coercible c b => (b -> c) -> Tagged a b -> Tagged a c

(.#) :: Coercible b a => Tagged b c -> (a -> b) -> Tagged a c

Functor v => Profunctor (Query v) 
Instance details

Defined in Diagrams.Core.Query

Methods

dimap :: (a -> b) -> (c -> d) -> Query v b c -> Query v a d #

lmap :: (a -> b) -> Query v b c -> Query v a c #

rmap :: (b -> c) -> Query v a b -> Query v a c #

(#.) :: Coercible c b => (b -> c) -> Query v a b -> Query v a c

(.#) :: Coercible b a => Query v b c -> (a -> b) -> Query v a c

Functor f => Profunctor (Costar f) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Costar f b c -> Costar f a d #

lmap :: (a -> b) -> Costar f b c -> Costar f a c #

rmap :: (b -> c) -> Costar f a b -> Costar f a c #

(#.) :: Coercible c b => (b -> c) -> Costar f a b -> Costar f a c

(.#) :: Coercible b a => Costar f b c -> (a -> b) -> Costar f a c

Profunctor (Forget r) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Forget r b c -> Forget r a d #

lmap :: (a -> b) -> Forget r b c -> Forget r a c #

rmap :: (b -> c) -> Forget r a b -> Forget r a c #

(#.) :: Coercible c b => (b -> c) -> Forget r a b -> Forget r a c

(.#) :: Coercible b a => Forget r b c -> (a -> b) -> Forget r a c

Functor f => Profunctor (Star f) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Star f b c -> Star f a d #

lmap :: (a -> b) -> Star f b c -> Star f a c #

rmap :: (b -> c) -> Star f a b -> Star f a c #

(#.) :: Coercible c b => (b -> c) -> Star f a b -> Star f a c

(.#) :: Coercible b a => Star f b c -> (a -> b) -> Star f a c

Arrow p => Profunctor (WrappedArrow p) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> WrappedArrow p b c -> WrappedArrow p a d #

lmap :: (a -> b) -> WrappedArrow p b c -> WrappedArrow p a c #

rmap :: (b -> c) -> WrappedArrow p a b -> WrappedArrow p a c #

(#.) :: Coercible c b => (b -> c) -> WrappedArrow p a b -> WrappedArrow p a c

(.#) :: Coercible b a => WrappedArrow p b c -> (a -> b) -> WrappedArrow p a c

Profunctor (CopastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> CopastroSum p b c -> CopastroSum p a d #

lmap :: (a -> b) -> CopastroSum p b c -> CopastroSum p a c #

rmap :: (b -> c) -> CopastroSum p a b -> CopastroSum p a c #

(#.) :: Coercible c b => (b -> c) -> CopastroSum p a b -> CopastroSum p a c

(.#) :: Coercible b a => CopastroSum p b c -> (a -> b) -> CopastroSum p a c

Profunctor (CotambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> CotambaraSum p b c -> CotambaraSum p a d #

lmap :: (a -> b) -> CotambaraSum p b c -> CotambaraSum p a c #

rmap :: (b -> c) -> CotambaraSum p a b -> CotambaraSum p a c #

(#.) :: Coercible c b => (b -> c) -> CotambaraSum p a b -> CotambaraSum p a c

(.#) :: Coercible b a => CotambaraSum p b c -> (a -> b) -> CotambaraSum p a c

Profunctor (PastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> PastroSum p b c -> PastroSum p a d #

lmap :: (a -> b) -> PastroSum p b c -> PastroSum p a c #

rmap :: (b -> c) -> PastroSum p a b -> PastroSum p a c #

(#.) :: Coercible c b => (b -> c) -> PastroSum p a b -> PastroSum p a c

(.#) :: Coercible b a => PastroSum p b c -> (a -> b) -> PastroSum p a c

Profunctor p => Profunctor (TambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> TambaraSum p b c -> TambaraSum p a d #

lmap :: (a -> b) -> TambaraSum p b c -> TambaraSum p a c #

rmap :: (b -> c) -> TambaraSum p a b -> TambaraSum p a c #

(#.) :: Coercible c b => (b -> c) -> TambaraSum p a b -> TambaraSum p a c

(.#) :: Coercible b a => TambaraSum p b c -> (a -> b) -> TambaraSum p a c

Profunctor p => Profunctor (Tambara p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Tambara p b c -> Tambara p a d #

lmap :: (a -> b) -> Tambara p b c -> Tambara p a c #

rmap :: (b -> c) -> Tambara p a b -> Tambara p a c #

(#.) :: Coercible c b => (b -> c) -> Tambara p a b -> Tambara p a c

(.#) :: Coercible b a => Tambara p b c -> (a -> b) -> Tambara p a c

Profunctor (Copastro p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Copastro p b c -> Copastro p a d #

lmap :: (a -> b) -> Copastro p b c -> Copastro p a c #

rmap :: (b -> c) -> Copastro p a b -> Copastro p a c #

(#.) :: Coercible c b => (b -> c) -> Copastro p a b -> Copastro p a c

(.#) :: Coercible b a => Copastro p b c -> (a -> b) -> Copastro p a c

Profunctor (Cotambara p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Cotambara p b c -> Cotambara p a d #

lmap :: (a -> b) -> Cotambara p b c -> Cotambara p a c #

rmap :: (b -> c) -> Cotambara p a b -> Cotambara p a c #

(#.) :: Coercible c b => (b -> c) -> Cotambara p a b -> Cotambara p a c

(.#) :: Coercible b a => Cotambara p b c -> (a -> b) -> Cotambara p a c

Profunctor (Pastro p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Pastro p b c -> Pastro p a d #

lmap :: (a -> b) -> Pastro p b c -> Pastro p a c #

rmap :: (b -> c) -> Pastro p a b -> Pastro p a c #

(#.) :: Coercible c b => (b -> c) -> Pastro p a b -> Pastro p a c

(.#) :: Coercible b a => Pastro p b c -> (a -> b) -> Pastro p a c

Profunctor ((->) :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> (b -> c) -> a -> d #

lmap :: (a -> b) -> (b -> c) -> a -> c #

rmap :: (b -> c) -> (a -> b) -> a -> c #

(#.) :: Coercible c b => (b -> c) -> (a -> b) -> a -> c

(.#) :: Coercible b a => (b -> c) -> (a -> b) -> a -> c

Profunctor (Exchange a b) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

dimap :: (a0 -> b0) -> (c -> d) -> Exchange a b b0 c -> Exchange a b a0 d #

lmap :: (a0 -> b0) -> Exchange a b b0 c -> Exchange a b a0 c #

rmap :: (b0 -> c) -> Exchange a b a0 b0 -> Exchange a b a0 c #

(#.) :: Coercible c b0 => (b0 -> c) -> Exchange a b a0 b0 -> Exchange a b a0 c

(.#) :: Coercible b0 a0 => Exchange a b b0 c -> (a0 -> b0) -> Exchange a b a0 c

(Profunctor p, Profunctor q) => Profunctor (Procompose p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

dimap :: (a -> b) -> (c -> d) -> Procompose p q b c -> Procompose p q a d #

lmap :: (a -> b) -> Procompose p q b c -> Procompose p q a c #

rmap :: (b -> c) -> Procompose p q a b -> Procompose p q a c #

(#.) :: Coercible c b => (b -> c) -> Procompose p q a b -> Procompose p q a c

(.#) :: Coercible b a => Procompose p q b c -> (a -> b) -> Procompose p q a c

(Profunctor p, Profunctor q) => Profunctor (Rift p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

dimap :: (a -> b) -> (c -> d) -> Rift p q b c -> Rift p q a d #

lmap :: (a -> b) -> Rift p q b c -> Rift p q a c #

rmap :: (b -> c) -> Rift p q a b -> Rift p q a c #

(#.) :: Coercible c b => (b -> c) -> Rift p q a b -> Rift p q a c

(.#) :: Coercible b a => Rift p q b c -> (a -> b) -> Rift p q a c

Functor w => Profunctor (Cokleisli w) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Cokleisli w b c -> Cokleisli w a d #

lmap :: (a -> b) -> Cokleisli w b c -> Cokleisli w a c #

rmap :: (b -> c) -> Cokleisli w a b -> Cokleisli w a c #

(#.) :: Coercible c b => (b -> c) -> Cokleisli w a b -> Cokleisli w a c

(.#) :: Coercible b a => Cokleisli w b c -> (a -> b) -> Cokleisli w a c

Contravariant f => Profunctor (Clown f :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Clown f b c -> Clown f a d #

lmap :: (a -> b) -> Clown f b c -> Clown f a c #

rmap :: (b -> c) -> Clown f a b -> Clown f a c #

(#.) :: Coercible c b => (b -> c) -> Clown f a b -> Clown f a c

(.#) :: Coercible b a => Clown f b c -> (a -> b) -> Clown f a c

Functor f => Profunctor (Joker f :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Joker f b c -> Joker f a d #

lmap :: (a -> b) -> Joker f b c -> Joker f a c #

rmap :: (b -> c) -> Joker f a b -> Joker f a c #

(#.) :: Coercible c b => (b -> c) -> Joker f a b -> Joker f a c

(.#) :: Coercible b a => Joker f b c -> (a -> b) -> Joker f a c

(Profunctor p, Profunctor q) => Profunctor (Product p q) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Product p q b c -> Product p q a d #

lmap :: (a -> b) -> Product p q b c -> Product p q a c #

rmap :: (b -> c) -> Product p q a b -> Product p q a c #

(#.) :: Coercible c b => (b -> c) -> Product p q a b -> Product p q a c

(.#) :: Coercible b a => Product p q b c -> (a -> b) -> Product p q a c

(Functor f, Profunctor p) => Profunctor (Tannen f p) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Tannen f p b c -> Tannen f p a d #

lmap :: (a -> b) -> Tannen f p b c -> Tannen f p a c #

rmap :: (b -> c) -> Tannen f p a b -> Tannen f p a c #

(#.) :: Coercible c b => (b -> c) -> Tannen f p a b -> Tannen f p a c

(.#) :: Coercible b a => Tannen f p b c -> (a -> b) -> Tannen f p a c

(Profunctor p, Functor f, Functor g) => Profunctor (Biff p f g) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Biff p f g b c -> Biff p f g a d #

lmap :: (a -> b) -> Biff p f g b c -> Biff p f g a c #

rmap :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

(#.) :: Coercible c b => (b -> c) -> Biff p f g a b -> Biff p f g a c

(.#) :: Coercible b a => Biff p f g b c -> (a -> b) -> Biff p f g a c

class Profunctor p => Choice (p :: * -> * -> *) where #

Minimal complete definition

left' | right'

Methods

left' :: p a b -> p (Either a c) (Either b c) #

right' :: p a b -> p (Either c a) (Either c b) #

Instances
Choice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) #

right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #

Choice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) #

right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #

Choice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) #

right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #

Monad m => Choice (Kleisli m) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Kleisli m a b -> Kleisli m (Either a c) (Either b c) #

right' :: Kleisli m a b -> Kleisli m (Either c a) (Either c b) #

Choice (Tagged :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tagged a b -> Tagged (Either a c) (Either b c) #

right' :: Tagged a b -> Tagged (Either c a) (Either c b) #

Traversable w => Choice (Costar w) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Costar w a b -> Costar w (Either a c) (Either b c) #

right' :: Costar w a b -> Costar w (Either c a) (Either c b) #

Monoid r => Choice (Forget r) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Forget r a b -> Forget r (Either a c) (Either b c) #

right' :: Forget r a b -> Forget r (Either c a) (Either c b) #

Applicative f => Choice (Star f) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Star f a b -> Star f (Either a c) (Either b c) #

right' :: Star f a b -> Star f (Either c a) (Either c b) #

ArrowChoice p => Choice (WrappedArrow p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: WrappedArrow p a b -> WrappedArrow p (Either a c) (Either b c) #

right' :: WrappedArrow p a b -> WrappedArrow p (Either c a) (Either c b) #

Choice (PastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: PastroSum p a b -> PastroSum p (Either a c) (Either b c) #

right' :: PastroSum p a b -> PastroSum p (Either c a) (Either c b) #

Profunctor p => Choice (TambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: TambaraSum p a b -> TambaraSum p (Either a c) (Either b c) #

right' :: TambaraSum p a b -> TambaraSum p (Either c a) (Either c b) #

Choice p => Choice (Tambara p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tambara p a b -> Tambara p (Either a c) (Either b c) #

right' :: Tambara p a b -> Tambara p (Either c a) (Either c b) #

Choice ((->) :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: (a -> b) -> Either a c -> Either b c #

right' :: (a -> b) -> Either c a -> Either c b #

(Choice p, Choice q) => Choice (Procompose p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

left' :: Procompose p q a b -> Procompose p q (Either a c) (Either b c) #

right' :: Procompose p q a b -> Procompose p q (Either c a) (Either c b) #

Comonad w => Choice (Cokleisli w) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Cokleisli w a b -> Cokleisli w (Either a c) (Either b c) #

right' :: Cokleisli w a b -> Cokleisli w (Either c a) (Either c b) #

Functor f => Choice (Joker f :: * -> * -> *) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Joker f a b -> Joker f (Either a c) (Either b c) #

right' :: Joker f a b -> Joker f (Either c a) (Either c b) #

(Choice p, Choice q) => Choice (Product p q) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Product p q a b -> Product p q (Either a c) (Either b c) #

right' :: Product p q a b -> Product p q (Either c a) (Either c b) #

(Functor f, Choice p) => Choice (Tannen f p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tannen f p a b -> Tannen f p (Either a c) (Either b c) #

right' :: Tannen f p a b -> Tannen f p (Either c a) (Either c b) #

type family Zoomed (m :: * -> *) :: * -> * -> * #

Instances
type Zoomed (MaybeT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (MaybeT m) = FocusingMay (Zoomed m)
type Zoomed (ListT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ListT m) = FocusingOn [] (Zoomed m)
type Zoomed (IdentityT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (IdentityT m) = Zoomed m
type Zoomed (ExceptT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ExceptT e m) = FocusingErr e (Zoomed m)
type Zoomed (ErrorT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ErrorT e m) = FocusingErr e (Zoomed m)
type Zoomed (WriterT w m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (StateT s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (StateT s z) = Focusing z
type Zoomed (StateT s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (StateT s z) = Focusing z
type Zoomed (WriterT w m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (FreeT f m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (FreeT f m) = FocusingFree f m (Zoomed m)
type Zoomed (ReaderT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ReaderT e m) = Zoomed m
type Zoomed (RWST r w s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (RWST r w s z) = FocusingWith w z
type Zoomed (RWST r w s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (RWST r w s z) = FocusingWith w z

class (MonadState s m, MonadState t n) => Zoom (m :: * -> *) (n :: * -> *) s t | m -> s, n -> t, m t -> n, n s -> m where #

Minimal complete definition

zoom

Methods

zoom :: LensLike' (Zoomed m c) t s -> m c -> n c #

Instances
Zoom m n s t => Zoom (MaybeT m) (MaybeT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (MaybeT m) c) t s -> MaybeT m c -> MaybeT n c #

Zoom m n s t => Zoom (ListT m) (ListT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ListT m) c) t s -> ListT m c -> ListT n c #

Zoom m n s t => Zoom (IdentityT m) (IdentityT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (IdentityT m) c) t s -> IdentityT m c -> IdentityT n c #

Zoom m n s t => Zoom (ExceptT e m) (ExceptT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ExceptT e m) c) t s -> ExceptT e m c -> ExceptT e n c #

(Error e, Zoom m n s t) => Zoom (ErrorT e m) (ErrorT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ErrorT e m) c) t s -> ErrorT e m c -> ErrorT e n c #

(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #

Monad z => Zoom (StateT s z) (StateT t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #

Monad z => Zoom (StateT s z) (StateT t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #

(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #

(Functor f, Zoom m n s t) => Zoom (FreeT f m) (FreeT f n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (FreeT f m) c) t s -> FreeT f m c -> FreeT f n c #

Zoom m n s t => Zoom (ReaderT e m) (ReaderT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ReaderT e m) c) t s -> ReaderT e m c -> ReaderT e n c #

(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #

(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #

class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: * -> *) (n :: * -> *) b a | m -> b, n -> a, m a -> n, n b -> m where #

Minimal complete definition

magnify

Methods

magnify :: LensLike' (Magnified m c) a b -> m c -> n c #

Instances
Magnify m n b a => Magnify (IdentityT m) (IdentityT n) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (IdentityT m) c) a b -> IdentityT m c -> IdentityT n c #

Magnify ((->) b :: * -> *) ((->) a :: * -> *) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified ((->) b) c) a b -> (b -> c) -> a -> c #

Monad m => Magnify (ReaderT b m) (ReaderT a m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (ReaderT b m) c) a b -> ReaderT b m c -> ReaderT a m c #

(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #

(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #

type family Magnified (m :: * -> *) :: * -> * -> * #

Instances
type Magnified (IdentityT m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (IdentityT m) = Magnified m
type Magnified ((->) b :: * -> *) 
Instance details

Defined in Control.Lens.Zoom

type Magnified ((->) b :: * -> *) = (Const :: * -> * -> *)
type Magnified (ReaderT b m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (ReaderT b m) = Effect m
type Magnified (RWST a w s m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (RWST a w s m) = EffectRWS w s m
type Magnified (RWST a w s m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (RWST a w s m) = EffectRWS w s m

class Wrapped s where #

Associated Types

type Unwrapped s :: * #

Methods

_Wrapped' :: Iso' s (Unwrapped s) #

Instances
Wrapped Fd 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Fd :: * #

Methods

_Wrapped' :: Iso' Fd (Unwrapped Fd) #

Wrapped CTimer 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTimer :: * #

Methods

_Wrapped' :: Iso' CTimer (Unwrapped CTimer) #

Wrapped CKey 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CKey :: * #

Methods

_Wrapped' :: Iso' CKey (Unwrapped CKey) #

Wrapped CId 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CId :: * #

Methods

_Wrapped' :: Iso' CId (Unwrapped CId) #

Wrapped CFsFilCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFsFilCnt :: * #

Methods

_Wrapped' :: Iso' CFsFilCnt (Unwrapped CFsFilCnt) #

Wrapped CFsBlkCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFsBlkCnt :: * #

Methods

_Wrapped' :: Iso' CFsBlkCnt (Unwrapped CFsBlkCnt) #

Wrapped CClockId 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CClockId :: * #

Methods

_Wrapped' :: Iso' CClockId (Unwrapped CClockId) #

Wrapped CBlkCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBlkCnt :: * #

Methods

_Wrapped' :: Iso' CBlkCnt (Unwrapped CBlkCnt) #

Wrapped CBlkSize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBlkSize :: * #

Methods

_Wrapped' :: Iso' CBlkSize (Unwrapped CBlkSize) #

Wrapped CRLim 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CRLim :: * #

Methods

_Wrapped' :: Iso' CRLim (Unwrapped CRLim) #

Wrapped CTcflag 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTcflag :: * #

Methods

_Wrapped' :: Iso' CTcflag (Unwrapped CTcflag) #

Wrapped CSpeed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSpeed :: * #

Methods

_Wrapped' :: Iso' CSpeed (Unwrapped CSpeed) #

Wrapped CCc 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CCc :: * #

Methods

_Wrapped' :: Iso' CCc (Unwrapped CCc) #

Wrapped CUid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUid :: * #

Methods

_Wrapped' :: Iso' CUid (Unwrapped CUid) #

Wrapped CNlink 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CNlink :: * #

Methods

_Wrapped' :: Iso' CNlink (Unwrapped CNlink) #

Wrapped CGid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CGid :: * #

Methods

_Wrapped' :: Iso' CGid (Unwrapped CGid) #

Wrapped CSsize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSsize :: * #

Methods

_Wrapped' :: Iso' CSsize (Unwrapped CSsize) #

Wrapped CPid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CPid :: * #

Methods

_Wrapped' :: Iso' CPid (Unwrapped CPid) #

Wrapped COff 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped COff :: * #

Methods

_Wrapped' :: Iso' COff (Unwrapped COff) #

Wrapped CMode 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CMode :: * #

Methods

_Wrapped' :: Iso' CMode (Unwrapped CMode) #

Wrapped CIno 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIno :: * #

Methods

_Wrapped' :: Iso' CIno (Unwrapped CIno) #

Wrapped CDev 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CDev :: * #

Methods

_Wrapped' :: Iso' CDev (Unwrapped CDev) #

Wrapped PatternMatchFail 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped PatternMatchFail :: * #

Methods

_Wrapped' :: Iso' PatternMatchFail (Unwrapped PatternMatchFail) #

Wrapped RecSelError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecSelError :: * #

Methods

_Wrapped' :: Iso' RecSelError (Unwrapped RecSelError) #

Wrapped RecConError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecConError :: * #

Methods

_Wrapped' :: Iso' RecConError (Unwrapped RecConError) #

Wrapped RecUpdError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecUpdError :: * #

Methods

_Wrapped' :: Iso' RecUpdError (Unwrapped RecUpdError) #

Wrapped NoMethodError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped NoMethodError :: * #

Methods

_Wrapped' :: Iso' NoMethodError (Unwrapped NoMethodError) #

Wrapped TypeError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped TypeError :: * #

Methods

_Wrapped' :: Iso' TypeError (Unwrapped TypeError) #

Wrapped Errno 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Errno :: * #

Methods

_Wrapped' :: Iso' Errno (Unwrapped Errno) #

Wrapped CompactionFailed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CompactionFailed :: * #

Methods

_Wrapped' :: Iso' CompactionFailed (Unwrapped CompactionFailed) #

Wrapped AssertionFailed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped AssertionFailed :: * #

Methods

_Wrapped' :: Iso' AssertionFailed (Unwrapped AssertionFailed) #

Wrapped ErrorCall 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped ErrorCall :: * #

Methods

_Wrapped' :: Iso' ErrorCall (Unwrapped ErrorCall) #

Wrapped All 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped All :: * #

Methods

_Wrapped' :: Iso' All (Unwrapped All) #

Wrapped Any 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Any :: * #

Methods

_Wrapped' :: Iso' Any (Unwrapped Any) #

Wrapped CChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CChar :: * #

Methods

_Wrapped' :: Iso' CChar (Unwrapped CChar) #

Wrapped CSChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSChar :: * #

Methods

_Wrapped' :: Iso' CSChar (Unwrapped CSChar) #

Wrapped CUChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUChar :: * #

Methods

_Wrapped' :: Iso' CUChar (Unwrapped CUChar) #

Wrapped CShort 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CShort :: * #

Methods

_Wrapped' :: Iso' CShort (Unwrapped CShort) #

Wrapped CUShort 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUShort :: * #

Methods

_Wrapped' :: Iso' CUShort (Unwrapped CUShort) #

Wrapped CInt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CInt :: * #

Methods

_Wrapped' :: Iso' CInt (Unwrapped CInt) #

Wrapped CUInt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUInt :: * #

Methods

_Wrapped' :: Iso' CUInt (Unwrapped CUInt) #

Wrapped CLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CLong :: * #

Methods

_Wrapped' :: Iso' CLong (Unwrapped CLong) #

Wrapped CULong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CULong :: * #

Methods

_Wrapped' :: Iso' CULong (Unwrapped CULong) #

Wrapped CLLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CLLong :: * #

Methods

_Wrapped' :: Iso' CLLong (Unwrapped CLLong) #

Wrapped CULLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CULLong :: * #

Methods

_Wrapped' :: Iso' CULLong (Unwrapped CULLong) #

Wrapped CBool 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBool :: * #

Methods

_Wrapped' :: Iso' CBool (Unwrapped CBool) #

Wrapped CFloat 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFloat :: * #

Methods

_Wrapped' :: Iso' CFloat (Unwrapped CFloat) #

Wrapped CDouble 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CDouble :: * #

Methods

_Wrapped' :: Iso' CDouble (Unwrapped CDouble) #

Wrapped CPtrdiff 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CPtrdiff :: * #

Methods

_Wrapped' :: Iso' CPtrdiff (Unwrapped CPtrdiff) #

Wrapped CSize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSize :: * #

Methods

_Wrapped' :: Iso' CSize (Unwrapped CSize) #

Wrapped CWchar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CWchar :: * #

Methods

_Wrapped' :: Iso' CWchar (Unwrapped CWchar) #

Wrapped CSigAtomic 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSigAtomic :: * #

Methods

_Wrapped' :: Iso' CSigAtomic (Unwrapped CSigAtomic) #

Wrapped CClock 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CClock :: * #

Methods

_Wrapped' :: Iso' CClock (Unwrapped CClock) #

Wrapped CTime 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTime :: * #

Methods

_Wrapped' :: Iso' CTime (Unwrapped CTime) #

Wrapped CUSeconds 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUSeconds :: * #

Methods

_Wrapped' :: Iso' CUSeconds (Unwrapped CUSeconds) #

Wrapped CSUSeconds 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSUSeconds :: * #

Methods

_Wrapped' :: Iso' CSUSeconds (Unwrapped CSUSeconds) #

Wrapped CIntPtr 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIntPtr :: * #

Methods

_Wrapped' :: Iso' CIntPtr (Unwrapped CIntPtr) #

Wrapped CUIntPtr 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUIntPtr :: * #

Methods

_Wrapped' :: Iso' CUIntPtr (Unwrapped CUIntPtr) #

Wrapped CIntMax 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIntMax :: * #

Methods

_Wrapped' :: Iso' CIntMax (Unwrapped CIntMax) #

Wrapped CUIntMax 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUIntMax :: * #

Methods

_Wrapped' :: Iso' CUIntMax (Unwrapped CUIntMax) #

Wrapped IntSet 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped IntSet :: * #

Methods

_Wrapped' :: Iso' IntSet (Unwrapped IntSet) #

Wrapped Name 
Instance details

Defined in Diagrams.Core.Names

Associated Types

type Unwrapped Name :: * #

Methods

_Wrapped' :: Iso' Name (Unwrapped Name) #

Wrapped ColourMap 
Instance details

Defined in Plots.Style

Associated Types

type Unwrapped ColourMap :: * #

Methods

_Wrapped' :: Iso' ColourMap (Unwrapped ColourMap) #

Wrapped SegCount 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped SegCount :: * #

Methods

_Wrapped' :: Iso' SegCount (Unwrapped SegCount) #

Wrapped (Par1 p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Par1 p) :: * #

Methods

_Wrapped' :: Iso' (Par1 p) (Unwrapped (Par1 p)) #

Wrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Identity a) :: * #

Methods

_Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #

Wrapped (Min a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Min a) :: * #

Methods

_Wrapped' :: Iso' (Min a) (Unwrapped (Min a)) #

Wrapped (Max a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Max a) :: * #

Methods

_Wrapped' :: Iso' (Max a) (Unwrapped (Max a)) #

Wrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (First a) :: * #

Methods

_Wrapped' :: Iso' (First a) (Unwrapped (First a)) #

Wrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Last a) :: * #

Methods

_Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #

Wrapped (WrappedMonoid a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedMonoid a) :: * #

Methods

_Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) #

Wrapped (Option a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Option a) :: * #

Methods

_Wrapped' :: Iso' (Option a) (Unwrapped (Option a)) #

Wrapped (ZipList a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ZipList a) :: * #

Methods

_Wrapped' :: Iso' (ZipList a) (Unwrapped (ZipList a)) #

Wrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (First a) :: * #

Methods

_Wrapped' :: Iso' (First a) (Unwrapped (First a)) #

Wrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Last a) :: * #

Methods

_Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #

Wrapped (Dual a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Dual a) :: * #

Methods

_Wrapped' :: Iso' (Dual a) (Unwrapped (Dual a)) #

Wrapped (Endo a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Endo a) :: * #

Methods

_Wrapped' :: Iso' (Endo a) (Unwrapped (Endo a)) #

Wrapped (Sum a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Sum a) :: * #

Methods

_Wrapped' :: Iso' (Sum a) (Unwrapped (Sum a)) #

Wrapped (Product a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Product a) :: * #

Methods

_Wrapped' :: Iso' (Product a) (Unwrapped (Product a)) #

Wrapped (Down a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Down a) :: * #

Methods

_Wrapped' :: Iso' (Down a) (Unwrapped (Down a)) #

Wrapped (NonEmpty a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (NonEmpty a) :: * #

Methods

_Wrapped' :: Iso' (NonEmpty a) (Unwrapped (NonEmpty a)) #

Wrapped (IntMap a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IntMap a) :: * #

Methods

_Wrapped' :: Iso' (IntMap a) (Unwrapped (IntMap a)) #

Wrapped (Seq a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Seq a) :: * #

Methods

_Wrapped' :: Iso' (Seq a) (Unwrapped (Seq a)) #

Ord a => Wrapped (Set a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Set a) :: * #

Methods

_Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #

Unbox a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: * #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Wrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Unwrapped (Polar a) :: * #

Methods

_Wrapped' :: Iso' (Polar a) (Unwrapped (Polar a)) #

Storable a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: * #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: * #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Prim a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: * #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

(Hashable a, Eq a) => Wrapped (HashSet a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (HashSet a) :: * #

Methods

_Wrapped' :: Iso' (HashSet a) (Unwrapped (HashSet a)) #

Wrapped (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Associated Types

type Unwrapped (TransInv t) :: * #

Methods

_Wrapped' :: Iso' (TransInv t) (Unwrapped (TransInv t)) #

Wrapped (Active a) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Active a) :: * #

Methods

_Wrapped' :: Iso' (Active a) (Unwrapped (Active a)) #

Wrapped (Time n) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Time n) :: * #

Methods

_Wrapped' :: Iso' (Time n) (Unwrapped (Time n)) #

Wrapped (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Associated Types

type Unwrapped (Clip n) :: * #

Methods

_Wrapped' :: Iso' (Clip n) (Unwrapped (Clip n)) #

Wrapped (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped (ArcLength n) :: * #

Methods

_Wrapped' :: Iso' (ArcLength n) (Unwrapped (ArcLength n)) #

Wrapped (Comparison a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Comparison a) :: * #

Methods

_Wrapped' :: Iso' (Comparison a) (Unwrapped (Comparison a)) #

Wrapped (Equivalence a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Equivalence a) :: * #

Methods

_Wrapped' :: Iso' (Equivalence a) (Unwrapped (Equivalence a)) #

Wrapped (Predicate a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Predicate a) :: * #

Methods

_Wrapped' :: Iso' (Predicate a) (Unwrapped (Predicate a)) #

Wrapped (Duration n) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Duration n) :: * #

Methods

_Wrapped' :: Iso' (Duration n) (Unwrapped (Duration n)) #

Ord k => Wrapped (Map k a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Map k a) :: * #

Methods

_Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #

Wrapped (WrappedMonad m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedMonad m a) :: * #

Methods

_Wrapped' :: Iso' (WrappedMonad m a) (Unwrapped (WrappedMonad m a)) #

Wrapped (ArrowMonad m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ArrowMonad m a) :: * #

Methods

_Wrapped' :: Iso' (ArrowMonad m a) (Unwrapped (ArrowMonad m a)) #

Wrapped (MaybeT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (MaybeT m a) :: * #

Methods

_Wrapped' :: Iso' (MaybeT m a) (Unwrapped (MaybeT m a)) #

Wrapped (ListT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ListT m a) :: * #

Methods

_Wrapped' :: Iso' (ListT m a) (Unwrapped (ListT m a)) #

Wrapped (Trail v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (Trail v n) :: * #

Methods

_Wrapped' :: Iso' (Trail v n) (Unwrapped (Trail v n)) #

Wrapped (Path v n) 
Instance details

Defined in Diagrams.Path

Associated Types

type Unwrapped (Path v n) :: * #

Methods

_Wrapped' :: Iso' (Path v n) (Unwrapped (Path v n)) #

Wrapped (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Associated Types

type Unwrapped (Style v n) :: * #

Methods

_Wrapped' :: Iso' (Style v n) (Unwrapped (Style v n)) #

Wrapped (Point f a) 
Instance details

Defined in Linear.Affine

Associated Types

type Unwrapped (Point f a) :: * #

Methods

_Wrapped' :: Iso' (Point f a) (Unwrapped (Point f a)) #

(Hashable k, Eq k) => Wrapped (HashMap k a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (HashMap k a) :: * #

Methods

_Wrapped' :: Iso' (HashMap k a) (Unwrapped (HashMap k a)) #

Wrapped (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Associated Types

type Unwrapped (Envelope v n) :: * #

Methods

_Wrapped' :: Iso' (Envelope v n) (Unwrapped (Envelope v n)) #

Wrapped (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Associated Types

type Unwrapped (Trace v n) :: * #

Methods

_Wrapped' :: Iso' (Trace v n) (Unwrapped (Trace v n)) #

Wrapped (MaybeApply f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (MaybeApply f a) :: * #

Methods

_Wrapped' :: Iso' (MaybeApply f a) (Unwrapped (MaybeApply f a)) #

Wrapped (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (SegTree v n) :: * #

Methods

_Wrapped' :: Iso' (SegTree v n) (Unwrapped (SegTree v n)) #

Wrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Alt f a) :: * #

Methods

_Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #

Wrapped (CatchT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CatchT m a) :: * #

Methods

_Wrapped' :: Iso' (CatchT m a) (Unwrapped (CatchT m a)) #

Wrapped (CoiterT w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CoiterT w a) :: * #

Methods

_Wrapped' :: Iso' (CoiterT w a) (Unwrapped (CoiterT w a)) #

Wrapped (IterT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IterT m a) :: * #

Methods

_Wrapped' :: Iso' (IterT m a) (Unwrapped (IterT m a)) #

Wrapped (Op a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Op a b) :: * #

Methods

_Wrapped' :: Iso' (Op a b) (Unwrapped (Op a b)) #

Wrapped (WrappedApplicative f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedApplicative f a) :: * #

Methods

_Wrapped' :: Iso' (WrappedApplicative f a) (Unwrapped (WrappedApplicative f a)) #

Wrapped (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped (TotalOffset v n) :: * #

Methods

_Wrapped' :: Iso' (TotalOffset v n) (Unwrapped (TotalOffset v n)) #

Wrapped (Rec1 f p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Rec1 f p) :: * #

Methods

_Wrapped' :: Iso' (Rec1 f p) (Unwrapped (Rec1 f p)) #

Wrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Const a x) :: * #

Methods

_Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #

Wrapped (WrappedArrow a b c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedArrow a b c) :: * #

Methods

_Wrapped' :: Iso' (WrappedArrow a b c) (Unwrapped (WrappedArrow a b c)) #

Wrapped (Kleisli m a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Kleisli m a b) :: * #

Methods

_Wrapped' :: Iso' (Kleisli m a b) (Unwrapped (Kleisli m a b)) #

Wrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Alt f a) :: * #

Methods

_Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #

Wrapped (IdentityT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IdentityT m a) :: * #

Methods

_Wrapped' :: Iso' (IdentityT m a) (Unwrapped (IdentityT m a)) #

Wrapped (ExceptT e m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ExceptT e m a) :: * #

Methods

_Wrapped' :: Iso' (ExceptT e m a) (Unwrapped (ExceptT e m a)) #

Wrapped (ErrorT e m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ErrorT e m a) :: * #

Methods

_Wrapped' :: Iso' (ErrorT e m a) (Unwrapped (ErrorT e m a)) #

Wrapped (Backwards f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Backwards f a) :: * #

Methods

_Wrapped' :: Iso' (Backwards f a) (Unwrapped (Backwards f a)) #

Wrapped (WriterT w m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WriterT w m a) :: * #

Methods

_Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #

Wrapped (StateT s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (StateT s m a) :: * #

Methods

_Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #

Wrapped (StateT s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (StateT s m a) :: * #

Methods

_Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #

Wrapped (WriterT w m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WriterT w m a) :: * #

Methods

_Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #

Wrapped (Reverse f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Reverse f a) :: * #

Methods

_Wrapped' :: Iso' (Reverse f a) (Unwrapped (Reverse f a)) #

Wrapped (Constant a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Constant a b) :: * #

Methods

_Wrapped' :: Iso' (Constant a b) (Unwrapped (Constant a b)) #

Wrapped (Join p a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Join p a) :: * #

Methods

_Wrapped' :: Iso' (Join p a) (Unwrapped (Join p a)) #

Wrapped (Tagged s a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Tagged s a) :: * #

Methods

_Wrapped' :: Iso' (Tagged s a) (Unwrapped (Tagged s a)) #

Wrapped (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Associated Types

type Unwrapped (Query v n m) :: * #

Methods

_Wrapped' :: Iso' (Query v n m) (Unwrapped (Query v n m)) #

Wrapped (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (Trail' Line v n) :: * #

Methods

_Wrapped' :: Iso' (Trail' Line v n) (Unwrapped (Trail' Line v n)) #

Wrapped (TracedT m w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (TracedT m w a) :: * #

Methods

_Wrapped' :: Iso' (TracedT m w a) (Unwrapped (TracedT m w a)) #

Wrapped (ApT f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ApT f g a) :: * #

Methods

_Wrapped' :: Iso' (ApT f g a) (Unwrapped (ApT f g a)) #

Wrapped (CofreeT f w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CofreeT f w a) :: * #

Methods

_Wrapped' :: Iso' (CofreeT f w a) (Unwrapped (CofreeT f w a)) #

Wrapped (ComposeCF f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ComposeCF f g a) :: * #

Methods

_Wrapped' :: Iso' (ComposeCF f g a) (Unwrapped (ComposeCF f g a)) #

Wrapped (ComposeFC f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ComposeFC f g a) :: * #

Methods

_Wrapped' :: Iso' (ComposeFC f g a) (Unwrapped (ComposeFC f g a)) #

Wrapped (Compose f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Compose f g a) :: * #

Methods

_Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #

Wrapped (Costar f d c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Costar f d c) :: * #

Methods

_Wrapped' :: Iso' (Costar f d c) (Unwrapped (Costar f d c)) #

Wrapped (Fix p a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Fix p a) :: * #

Methods

_Wrapped' :: Iso' (Fix p a) (Unwrapped (Fix p a)) #

Wrapped (Forget r a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Forget r a b) :: * #

Methods

_Wrapped' :: Iso' (Forget r a b) (Unwrapped (Forget r a b)) #

Wrapped (FreeT f m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (FreeT f m a) :: * #

Methods

_Wrapped' :: Iso' (FreeT f m a) (Unwrapped (FreeT f m a)) #

Wrapped (Star f d c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Star f d c) :: * #

Methods

_Wrapped' :: Iso' (Star f d c) (Unwrapped (Star f d c)) #

Wrapped (Static f a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Static f a b) :: * #

Methods

_Wrapped' :: Iso' (Static f a b) (Unwrapped (Static f a b)) #

Wrapped (WrappedArrow p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedArrow p a b) :: * #

Methods

_Wrapped' :: Iso' (WrappedArrow p a b) (Unwrapped (WrappedArrow p a b)) #

Wrapped (K1 i c p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (K1 i c p) :: * #

Methods

_Wrapped' :: Iso' (K1 i c p) (Unwrapped (K1 i c p)) #

Wrapped (ReaderT r m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ReaderT r m a) :: * #

Methods

_Wrapped' :: Iso' (ReaderT r m a) (Unwrapped (ReaderT r m a)) #

Wrapped (ContT r m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ContT r m a) :: * #

Methods

_Wrapped' :: Iso' (ContT r m a) (Unwrapped (ContT r m a)) #

Wrapped (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Associated Types

type Unwrapped (QDiagram b v n m) :: * #

Methods

_Wrapped' :: Iso' (QDiagram b v n m) (Unwrapped (QDiagram b v n m)) #

Wrapped (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Associated Types

type Unwrapped (SubMap b v n m) :: * #

Methods

_Wrapped' :: Iso' (SubMap b v n m) (Unwrapped (SubMap b v n m)) #

Wrapped (Cayley f p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Cayley f p a b) :: * #

Methods

_Wrapped' :: Iso' (Cayley f p a b) (Unwrapped (Cayley f p a b)) #

Wrapped (M1 i c f p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (M1 i c f p) :: * #

Methods

_Wrapped' :: Iso' (M1 i c f p) (Unwrapped (M1 i c f p)) #

Wrapped ((f :.: g) p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped ((f :.: g) p) :: * #

Methods

_Wrapped' :: Iso' ((f :.: g) p) (Unwrapped ((f :.: g) p)) #

Wrapped (Compose f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Compose f g a) :: * #

Methods

_Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #

Wrapped (RWST r w s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (RWST r w s m a) :: * #

Methods

_Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #

Wrapped (RWST r w s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (RWST r w s m a) :: * #

Methods

_Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #

Wrapped (Clown f a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Clown f a b) :: * #

Methods

_Wrapped' :: Iso' (Clown f a b) (Unwrapped (Clown f a b)) #

Wrapped (Flip p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Flip p a b) :: * #

Methods

_Wrapped' :: Iso' (Flip p a b) (Unwrapped (Flip p a b)) #

Wrapped (Joker g a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Joker g a b) :: * #

Methods

_Wrapped' :: Iso' (Joker g a b) (Unwrapped (Joker g a b)) #

Wrapped (WrappedBifunctor p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedBifunctor p a b) :: * #

Methods

_Wrapped' :: Iso' (WrappedBifunctor p a b) (Unwrapped (WrappedBifunctor p a b)) #

Wrapped (Dual k3 a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Dual k3 a b) :: * #

Methods

_Wrapped' :: Iso' (Dual k3 a b) (Unwrapped (Dual k3 a b)) #

Wrapped (Semi m a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Semi m a b) :: * #

Methods

_Wrapped' :: Iso' (Semi m a b) (Unwrapped (Semi m a b)) #

Wrapped (WrappedCategory k3 a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedCategory k3 a b) :: * #

Methods

_Wrapped' :: Iso' (WrappedCategory k3 a b) (Unwrapped (WrappedCategory k3 a b)) #

Wrapped (Tannen f p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Tannen f p a b) :: * #

Methods

_Wrapped' :: Iso' (Tannen f p a b) (Unwrapped (Tannen f p a b)) #

Wrapped (Biff p f g a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Biff p f g a b) :: * #

Methods

_Wrapped' :: Iso' (Biff p f g a b) (Unwrapped (Biff p f g a b)) #

class (Rewrapped s t, Rewrapped t s) => Rewrapping s t #

Instances
(Rewrapped s t, Rewrapped t s) => Rewrapping s t 
Instance details

Defined in Control.Lens.Wrapped

class Wrapped s => Rewrapped s t #

Instances
Rewrapped Fd t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTimer t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CKey t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CId t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFsFilCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFsBlkCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CClockId t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBlkCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBlkSize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CRLim t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTcflag t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSpeed t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CCc t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CNlink t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CGid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSsize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CPid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped COff t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CMode t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIno t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CDev t 
Instance details

Defined in Control.Lens.Wrapped

t ~ PatternMatchFail => Rewrapped PatternMatchFail t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecSelError => Rewrapped RecSelError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecConError => Rewrapped RecConError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecUpdError => Rewrapped RecUpdError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ NoMethodError => Rewrapped NoMethodError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ TypeError => Rewrapped TypeError t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped Errno t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CompactionFailed => Rewrapped CompactionFailed t 
Instance details

Defined in Control.Lens.Wrapped

t ~ AssertionFailed => Rewrapped AssertionFailed t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ErrorCall => Rewrapped ErrorCall t 
Instance details

Defined in Control.Lens.Wrapped

t ~ All => Rewrapped All t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Any => Rewrapped Any t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CShort t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUShort t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CInt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUInt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CULong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CLLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CULLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBool t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFloat t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CDouble t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CPtrdiff t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CWchar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSigAtomic t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CClock t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTime t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUSeconds t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSUSeconds t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIntPtr t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUIntPtr t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIntMax t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUIntMax t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IntSet => Rewrapped IntSet t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped Name Name 
Instance details

Defined in Diagrams.Core.Names

Rewrapped ColourMap ColourMap 
Instance details

Defined in Plots.Style

Rewrapped SegCount SegCount 
Instance details

Defined in Diagrams.Segment

t ~ Par1 p' => Rewrapped (Par1 p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Identity b => Rewrapped (Identity a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Min b => Rewrapped (Min a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Max b => Rewrapped (Max a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ First b => Rewrapped (First a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Last b => Rewrapped (Last a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Option b => Rewrapped (Option a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ZipList b => Rewrapped (ZipList a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ First b => Rewrapped (First a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Last b => Rewrapped (Last a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Dual b => Rewrapped (Dual a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Endo b => Rewrapped (Endo a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Sum b => Rewrapped (Sum a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Product b => Rewrapped (Product a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Down b => Rewrapped (Down a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ NonEmpty b => Rewrapped (NonEmpty a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IntMap a' => Rewrapped (IntMap a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Seq a' => Rewrapped (Seq a) t 
Instance details

Defined in Control.Lens.Wrapped

(t ~ Set a', Ord a) => Rewrapped (Set a) t 
Instance details

Defined in Control.Lens.Wrapped

(Unbox a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

Polar a1 ~ t => Rewrapped (Polar a2) t 
Instance details

Defined in Diagrams.Coordinates.Polar

(Storable a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Vector a' => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

(Prim a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

(t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t 
Instance details

Defined in Control.Lens.Wrapped

Active a1 ~ t => Rewrapped (Active a2) t 
Instance details

Defined in Data.Active

Time n1 ~ t => Rewrapped (Time n2) t 
Instance details

Defined in Data.Active

Clip n1 ~ t => Rewrapped (Clip n2) t 
Instance details

Defined in Diagrams.TwoD.Path

t ~ Comparison b => Rewrapped (Comparison a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Equivalence b => Rewrapped (Equivalence a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Predicate b => Rewrapped (Predicate a) t 
Instance details

Defined in Control.Lens.Wrapped

Duration n1 ~ t => Rewrapped (Duration n2) t 
Instance details

Defined in Data.Active

Rewrapped (TransInv t) (TransInv t') 
Instance details

Defined in Diagrams.Core.Transform

Rewrapped (ArcLength n) (ArcLength n') 
Instance details

Defined in Diagrams.Segment

(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedMonad m' a' => Rewrapped (WrappedMonad m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ArrowMonad m' a' => Rewrapped (ArrowMonad m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ MaybeT n b => Rewrapped (MaybeT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ListT n b => Rewrapped (ListT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Point g b => Rewrapped (Point f a) t 
Instance details

Defined in Linear.Affine

(t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ MaybeApply f' a' => Rewrapped (MaybeApply f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Alt f' a' => Rewrapped (Alt f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CatchT m' a' => Rewrapped (CatchT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CoiterT w' a' => Rewrapped (CoiterT w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IterT m' a' => Rewrapped (IterT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Op a' b' => Rewrapped (Op a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedApplicative f' a' => Rewrapped (WrappedApplicative f a) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (Trail v n) (Trail v' n') 
Instance details

Defined in Diagrams.Trail

Rewrapped (Path v n) (Path v' n') 
Instance details

Defined in Diagrams.Path

Rewrapped (Style v n) (Style v' n') 
Instance details

Defined in Diagrams.Core.Style

Rewrapped (Envelope v n) (Envelope v' n') 
Instance details

Defined in Diagrams.Core.Envelope

Rewrapped (Trace v n) (Trace v' n') 
Instance details

Defined in Diagrams.Core.Trace

Rewrapped (SegTree v n) (SegTree v' n') 
Instance details

Defined in Diagrams.Trail

Rewrapped (TotalOffset v n) (TotalOffset v' n') 
Instance details

Defined in Diagrams.Segment

t ~ Rec1 f' p' => Rewrapped (Rec1 f p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Const a' x' => Rewrapped (Const a x) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedArrow a' b' c' => Rewrapped (WrappedArrow a b c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Kleisli m' a' b' => Rewrapped (Kleisli m a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Alt g b => Rewrapped (Alt f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IdentityT n b => Rewrapped (IdentityT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ExceptT e' m' a' => Rewrapped (ExceptT e m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ErrorT e' m' a' => Rewrapped (ErrorT e m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Backwards g b => Rewrapped (Backwards f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ StateT s' m' a' => Rewrapped (StateT s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ StateT s' m' a' => Rewrapped (StateT s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Reverse g b => Rewrapped (Reverse f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Constant a' b' => Rewrapped (Constant a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Join p' a' => Rewrapped (Join p a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Tagged s' a' => Rewrapped (Tagged s a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ TracedT m' w' a' => Rewrapped (TracedT m w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ApT f' g' a' => Rewrapped (ApT f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CofreeT f' w' a' => Rewrapped (CofreeT f w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ComposeCF f' g' a' => Rewrapped (ComposeCF f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ComposeFC f' g' a' => Rewrapped (ComposeFC f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Compose f' g' a' => Rewrapped (Compose f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Costar f' d' c' => Rewrapped (Costar f d c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Fix p' a' => Rewrapped (Fix p a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Forget r' a' b' => Rewrapped (Forget r a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ FreeT f' m' a' => Rewrapped (FreeT f m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Star f' d' c' => Rewrapped (Star f d c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Static f' a' b' => Rewrapped (Static f a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedArrow p' a' b' => Rewrapped (WrappedArrow p a b) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (Query v a m) (Query v' a' m') 
Instance details

Defined in Diagrams.Core.Query

Rewrapped (Trail' Line v n) (Trail' Line v' n') 
Instance details

Defined in Diagrams.Trail

t ~ K1 i' c' p' => Rewrapped (K1 i c p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ReaderT s n b => Rewrapped (ReaderT r m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ContT r' m' a' => Rewrapped (ContT r m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Cayley f' p' a' b' => Rewrapped (Cayley f p a b) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (QDiagram b v n m) (QDiagram b' v' n' m') 
Instance details

Defined in Diagrams.Core.Types

Rewrapped (SubMap b v n m) (SubMap b' v' n' m') 
Instance details

Defined in Diagrams.Core.Types

t ~ M1 i' c' f' p' => Rewrapped (M1 i c f p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ (f' :.: g') p' => Rewrapped ((f :.: g) p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Compose f' g' a' => Rewrapped (Compose f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Clown f' a' b' => Rewrapped (Clown f a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Flip p' a' b' => Rewrapped (Flip p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Joker g' a' b' => Rewrapped (Joker g a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedBifunctor p' a' b' => Rewrapped (WrappedBifunctor p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Dual k' a' b' => Rewrapped (Dual k6 a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Semi m' a' b' => Rewrapped (Semi m a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedCategory k' a' b' => Rewrapped (WrappedCategory k6 a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Tannen f' p' a' b' => Rewrapped (Tannen f p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Biff p' f' g' a' b' => Rewrapped (Biff p f g a b) t 
Instance details

Defined in Control.Lens.Wrapped

type Traversal1' s a = Traversal1 s s a a #

type Traversal1 s t a b = forall (f :: * -> *). Apply f => (a -> f b) -> s -> f t #

type Traversal' s a = Traversal s s a a #

type Traversal s t a b = forall (f :: * -> *). Applicative f => (a -> f b) -> s -> f t #

type Simple (f :: k -> k -> k1 -> k1 -> k2) (s :: k) (a :: k1) = f s s a a #

type Setter' s a = Setter s s a a #

type Setter s t a b = forall (f :: * -> *). Settable f => (a -> f b) -> s -> f t #

type Review t b = forall (p :: * -> * -> *) (f :: * -> *). (Choice p, Bifunctor p, Settable f) => Optic' p f t b #

type Prism' s a = Prism s s a a #

type Prism s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Choice p, Applicative f) => p a (f b) -> p s (f t) #

type Over' (p :: * -> * -> *) (f :: * -> *) s a = Over p f s s a a #

type Over (p :: k -> * -> *) (f :: k1 -> *) s (t :: k1) (a :: k) (b :: k1) = p a (f b) -> s -> f t #

type Optical' (p :: k1 -> k -> *) (q :: k1 -> k -> *) (f :: k1 -> k) (s :: k1) (a :: k1) = Optical p q f s s a a #

type Optical (p :: k2 -> k -> *) (q :: k1 -> k -> *) (f :: k3 -> k) (s :: k1) (t :: k3) (a :: k2) (b :: k3) = p a (f b) -> q s (f t) #

type Optic' (p :: k1 -> k -> *) (f :: k1 -> k) (s :: k1) (a :: k1) = Optic p f s s a a #

type Optic (p :: k1 -> k -> *) (f :: k2 -> k) (s :: k1) (t :: k2) (a :: k1) (b :: k2) = p a (f b) -> p s (f t) #

type LensLike' (f :: * -> *) s a = LensLike f s s a a #

type LensLike (f :: k -> *) s (t :: k) a (b :: k) = (a -> f b) -> s -> f t #

type Lens' s a = Lens s s a a #

type Lens s t a b = forall (f :: * -> *). Functor f => (a -> f b) -> s -> f t #

type Iso' s a = Iso s s a a #

type Iso s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Profunctor p, Functor f) => p a (f b) -> p s (f t) #

type IndexedTraversal1' i s a = IndexedTraversal1 i s s a a #

type IndexedTraversal1 i s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Indexable i p, Apply f) => p a (f b) -> s -> f t #

type IndexedTraversal' i s a = IndexedTraversal i s s a a #

type IndexedTraversal i s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Indexable i p, Applicative f) => p a (f b) -> s -> f t #

type IndexedSetter' i s a = IndexedSetter i s s a a #

type IndexedSetter i s t a b = forall (f :: * -> *) (p :: * -> * -> *). (Indexable i p, Settable f) => p a (f b) -> s -> f t #

type IndexedLensLike' i (f :: * -> *) s a = IndexedLensLike i f s s a a #

type IndexedLensLike i (f :: k -> *) s (t :: k) a (b :: k) = forall (p :: * -> * -> *). Indexable i p => p a (f b) -> s -> f t #

type IndexedLens' i s a = IndexedLens i s s a a #

type IndexedLens i s t a b = forall (f :: * -> *) (p :: * -> * -> *). (Indexable i p, Functor f) => p a (f b) -> s -> f t #

type IndexedGetter i s a = forall (p :: * -> * -> *) (f :: * -> *). (Indexable i p, Contravariant f, Functor f) => p a (f a) -> s -> f s #

type IndexedFold1 i s a = forall (p :: * -> * -> *) (f :: * -> *). (Indexable i p, Contravariant f, Apply f) => p a (f a) -> s -> f s #

type IndexedFold i s a = forall (p :: * -> * -> *) (f :: * -> *). (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> s -> f s #

type IndexPreservingTraversal1' s a = IndexPreservingTraversal1 s s a a #

type IndexPreservingTraversal1 s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Apply f) => p a (f b) -> p s (f t) #

type IndexPreservingTraversal' s a = IndexPreservingTraversal s s a a #

type IndexPreservingTraversal s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Applicative f) => p a (f b) -> p s (f t) #

type IndexPreservingSetter' s a = IndexPreservingSetter s s a a #

type IndexPreservingSetter s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Settable f) => p a (f b) -> p s (f t) #

type IndexPreservingLens' s a = IndexPreservingLens s s a a #

type IndexPreservingLens s t a b = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Functor f) => p a (f b) -> p s (f t) #

type IndexPreservingGetter s a = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Contravariant f, Functor f) => p a (f a) -> p s (f s) #

type IndexPreservingFold1 s a = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Contravariant f, Apply f) => p a (f a) -> p s (f s) #

type IndexPreservingFold s a = forall (p :: * -> * -> *) (f :: * -> *). (Conjoined p, Contravariant f, Applicative f) => p a (f a) -> p s (f s) #

type Getter s a = forall (f :: * -> *). (Contravariant f, Functor f) => (a -> f a) -> s -> f s #

type Fold1 s a = forall (f :: * -> *). (Contravariant f, Apply f) => (a -> f a) -> s -> f s #

type Fold s a = forall (f :: * -> *). (Contravariant f, Applicative f) => (a -> f a) -> s -> f s #

type Equality' (s :: k2) (a :: k2) = Equality s s a a #

type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> *) (f :: k2 -> k3). p a (f b) -> p s (f t) #

type As (a :: k2) = Equality' a a #

type AReview t b = Optic' (Tagged :: * -> * -> *) Identity t b #

class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_9 :: Lens s t a b #

Instances
9 <= n => Field9 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_9 :: Lens (V n a) (V n a) a a #

Field9 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i' #

Field9 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i' #

class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_8 :: Lens s t a b #

Instances
8 <= n => Field8 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_8 :: Lens (V n a) (V n a) a a #

Field8 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h' #

Field8 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h' #

class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_7 :: Lens s t a b #

Instances
7 <= n => Field7 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_7 :: Lens (V n a) (V n a) a a #

Field7 (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g' #

Field7 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g' #

Field7 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g' #

class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_6 :: Lens s t a b #

Instances
Field6 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_6 :: Lens (Plucker a) (Plucker a) a a #

6 <= n => Field6 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_6 :: Lens (V n a) (V n a) a a #

Field6 (a, b, c, d, e, f) (a, b, c, d, e, f') f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f) (a, b, c, d, e, f') f f' #

Field6 (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f' #

Field6 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f' #

Field6 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f' #

class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_5 :: Lens s t a b #

Instances
Field5 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_5 :: Lens (Plucker a) (Plucker a) a a #

5 <= n => Field5 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_5 :: Lens (V n a) (V n a) a a #

Field5 (a, b, c, d, e) (a, b, c, d, e') e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e) (a, b, c, d, e') e e' #

Field5 (a, b, c, d, e, f) (a, b, c, d, e', f) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f) (a, b, c, d, e', f) e e' #

Field5 (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' #

Field5 (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' #

Field5 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e' #

class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_4 :: Lens s t a b #

Instances
Field4 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_4 :: Lens (V4 a) (V4 a) a a #

Field4 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_4 :: Lens (Plucker a) (Plucker a) a a #

Field4 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_4 :: Lens (Quaternion a) (Quaternion a) a a #

4 <= n => Field4 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_4 :: Lens (V n a) (V n a) a a #

Field4 (a, b, c, d) (a, b, c, d') d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d) (a, b, c, d') d d' #

Field4 (a, b, c, d, e) (a, b, c, d', e) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e) (a, b, c, d', e) d d' #

Field4 (a, b, c, d, e, f) (a, b, c, d', e, f) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f) (a, b, c, d', e, f) d d' #

Field4 (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' #

Field4 (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' #

Field4 (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d' #

class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_3 :: Lens s t a b #

Instances
Field3 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_3 :: Lens (V3 a) (V3 a) a a #

Field3 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_3 :: Lens (V4 a) (V4 a) a a #

Field3 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_3 :: Lens (Plucker a) (Plucker a) a a #

Field3 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_3 :: Lens (Quaternion a) (Quaternion a) a a #

Field3 (a, b, c) (a, b, c') c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c) (a, b, c') c c' #

3 <= n => Field3 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_3 :: Lens (V n a) (V n a) a a #

Field3 (a, b, c, d) (a, b, c', d) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d) (a, b, c', d) c c' #

Field3 (a, b, c, d, e) (a, b, c', d, e) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e) (a, b, c', d, e) c c' #

Field3 (a, b, c, d, e, f) (a, b, c', d, e, f) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f) (a, b, c', d, e, f) c c' #

Field3 (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' #

Field3 (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' #

Field3 (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c' #

class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_2 :: Lens s t a b #

Instances
Field2 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_2 :: Lens (V3 a) (V3 a) a a #

Field2 (V2 a) (V2 a) a a 
Instance details

Defined in Linear.V2

Methods

_2 :: Lens (V2 a) (V2 a) a a #

Field2 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_2 :: Lens (V4 a) (V4 a) a a #

Field2 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_2 :: Lens (Plucker a) (Plucker a) a a #

Field2 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_2 :: Lens (Quaternion a) (Quaternion a) a a #

Field2 (a, b) (a, b') b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b) (a, b') b b' #

Field2 (a, b, c) (a, b', c) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c) (a, b', c) b b' #

2 <= n => Field2 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_2 :: Lens (V n a) (V n a) a a #

Field2 (a, b, c, d) (a, b', c, d) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d) (a, b', c, d) b b' #

Field2 ((f :*: g) p) ((f :*: g') p) (g p) (g' p) 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens ((f :*: g) p) ((f :*: g') p) (g p) (g' p) #

Field2 (Product f g a) (Product f g' a) (g a) (g' a) 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (Product f g a) (Product f g' a) (g a) (g' a) #

Field2 (a, b, c, d, e) (a, b', c, d, e) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e) (a, b', c, d, e) b b' #

Field2 (a, b, c, d, e, f) (a, b', c, d, e, f) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f) (a, b', c, d, e, f) b b' #

Field2 (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' #

Field2 (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' #

Field2 (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b' #

class Field19 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_19 :: Lens s t a b #

Instances
19 <= n => Field19 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_19 :: Lens (V n a) (V n a) a a #

Field19 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s' 
Instance details

Defined in Control.Lens.Tuple

Methods

_19 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s' #

class Field18 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_18 :: Lens s t a b #

Instances
18 <= n => Field18 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_18 :: Lens (V n a) (V n a) a a #

Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r' 
Instance details

Defined in Control.Lens.Tuple

Methods

_18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r' #

Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r' 
Instance details

Defined in Control.Lens.Tuple

Methods

_18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r' #

class Field17 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_17 :: Lens s t a b #

Instances
17 <= n => Field17 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_17 :: Lens (V n a) (V n a) a a #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q' #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q' #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q' #

class Field16 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_16 :: Lens s t a b #

Instances
16 <= n => Field16 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_16 :: Lens (V n a) (V n a) a a #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p' #

class Field15 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_15 :: Lens s t a b #

Instances
15 <= n => Field15 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_15 :: Lens (V n a) (V n a) a a #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o' #

class Field14 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_14 :: Lens s t a b #

Instances
14 <= n => Field14 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_14 :: Lens (V n a) (V n a) a a #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n' #

class Field13 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_13 :: Lens s t a b #

Instances
13 <= n => Field13 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_13 :: Lens (V n a) (V n a) a a #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m' #

class Field12 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_12 :: Lens s t a b #

Instances
12 <= n => Field12 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_12 :: Lens (V n a) (V n a) a a #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l' #

class Field11 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_11 :: Lens s t a b #

Instances
11 <= n => Field11 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_11 :: Lens (V n a) (V n a) a a #

Field11 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk' #

class Field10 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_10 :: Lens s t a b #

Instances
10 <= n => Field10 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_10 :: Lens (V n a) (V n a) a a #

Field10 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j' #

class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_1 :: Lens s t a b #

Instances
Field1 (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Identity a) (Identity b) a b #

Field1 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_1 :: Lens (V3 a) (V3 a) a a #

Field1 (V2 a) (V2 a) a a 
Instance details

Defined in Linear.V2

Methods

_1 :: Lens (V2 a) (V2 a) a a #

Field1 (V1 a) (V1 b) a b 
Instance details

Defined in Linear.V1

Methods

_1 :: Lens (V1 a) (V1 b) a b #

Field1 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_1 :: Lens (V4 a) (V4 a) a a #

Field1 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_1 :: Lens (Plucker a) (Plucker a) a a #

Field1 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_1 :: Lens (Quaternion a) (Quaternion a) a a #

Field1 (a, b) (a', b) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b) (a', b) a a' #

Field1 (a, b, c) (a', b, c) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c) (a', b, c) a a' #

1 <= n => Field1 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_1 :: Lens (V n a) (V n a) a a #

Field1 (a, b, c, d) (a', b, c, d) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d) (a', b, c, d) a a' #

Field1 ((f :*: g) p) ((f' :*: g) p) (f p) (f' p) 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens ((f :*: g) p) ((f' :*: g) p) (f p) (f' p) #

Field1 (Product f g a) (Product f' g a) (f a) (f' a) 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Product f g a) (Product f' g a) (f a) (f' a) #

Field1 (a, b, c, d, e) (a', b, c, d, e) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e) (a', b, c, d, e) a a' #

Field1 (a, b, c, d, e, f) (a', b, c, d, e, f) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f) (a', b, c, d, e, f) a a' #

Field1 (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' #

Field1 (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' #

Field1 (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a' #

type Traversing1' (p :: * -> * -> *) (f :: * -> *) s a = Traversing1 p f s s a a #

type Traversing1 (p :: * -> * -> *) (f :: * -> *) s t a b = Over p (BazaarT1 p f a b) s t a b #

type Traversing' (p :: * -> * -> *) (f :: * -> *) s a = Traversing p f s s a a #

type Traversing (p :: * -> * -> *) (f :: * -> *) s t a b = Over p (BazaarT p f a b) s t a b #

class Ord k => TraverseMin k (m :: * -> *) | m -> k where #

Minimal complete definition

traverseMin

Methods

traverseMin :: (Indexable k p, Applicative f) => p v (f v) -> m v -> f (m v) #

Instances
TraverseMin Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: (Indexable Int p, Applicative f) => p v (f v) -> IntMap v -> f (IntMap v) #

Ord k => TraverseMin k (Map k) 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: (Indexable k p, Applicative f) => p v (f v) -> Map k v -> f (Map k v) #

class Ord k => TraverseMax k (m :: * -> *) | m -> k where #

Minimal complete definition

traverseMax

Methods

traverseMax :: (Indexable k p, Applicative f) => p v (f v) -> m v -> f (m v) #

Instances
TraverseMax Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: (Indexable Int p, Applicative f) => p v (f v) -> IntMap v -> f (IntMap v) #

Ord k => TraverseMax k (Map k) 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: (Indexable k p, Applicative f) => p v (f v) -> Map k v -> f (Map k v) #

type AnIndexedTraversal1' i s a = AnIndexedTraversal1 i s s a a #

type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b #

type AnIndexedTraversal' i s a = AnIndexedTraversal i s s a a #

type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b #

type ATraversal1' s a = ATraversal1 s s a a #

type ATraversal1 s t a b = LensLike (Bazaar1 ((->) :: * -> * -> *) a b) s t a b #

type ATraversal' s a = ATraversal s s a a #

type ATraversal s t a b = LensLike (Bazaar ((->) :: * -> * -> *) a b) s t a b #

type Setting' (p :: * -> * -> *) s a = Setting p s s a a #

type Setting (p :: * -> * -> *) s t a b = p a (Identity b) -> s -> Identity t #

type AnIndexedSetter' i s a = AnIndexedSetter i s s a a #

type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t #

type ASetter' s a = ASetter s s a a #

type ASetter s t a b = (a -> Identity b) -> s -> Identity t #

type ReifiedTraversal' s a = ReifiedTraversal s s a a #

newtype ReifiedTraversal s t a b #

Constructors

Traversal 

Fields

type ReifiedSetter' s a = ReifiedSetter s s a a #

newtype ReifiedSetter s t a b #

Constructors

Setter 

Fields

type ReifiedPrism' s a = ReifiedPrism s s a a #

newtype ReifiedPrism s t a b #

Constructors

Prism 

Fields

type ReifiedLens' s a = ReifiedLens s s a a #

newtype ReifiedLens s t a b #

Constructors

Lens 

Fields

type ReifiedIso' s a = ReifiedIso s s a a #

newtype ReifiedIso s t a b #

Constructors

Iso 

Fields

type ReifiedIndexedTraversal' i s a = ReifiedIndexedTraversal i s s a a #

newtype ReifiedIndexedTraversal i s t a b #

Constructors

IndexedTraversal 

Fields

type ReifiedIndexedSetter' i s a = ReifiedIndexedSetter i s s a a #

newtype ReifiedIndexedSetter i s t a b #

Constructors

IndexedSetter 

Fields

type ReifiedIndexedLens' i s a = ReifiedIndexedLens i s s a a #

newtype ReifiedIndexedLens i s t a b #

Constructors

IndexedLens 

Fields

newtype ReifiedIndexedGetter i s a #

Constructors

IndexedGetter 

Fields

Instances
Profunctor (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d #

lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c #

rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c

(.#) :: Coercible b a => ReifiedIndexedGetter i b c -> (a -> b) -> ReifiedIndexedGetter i a c

Representable (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep (ReifiedIndexedGetter i) :: * -> *

Methods

tabulate :: (d -> Rep (ReifiedIndexedGetter i) c) -> ReifiedIndexedGetter i d c

Strong (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (a, c) (b, c)

second' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (c, a) (c, b)

Sieve (ReifiedIndexedGetter i) ((,) i) 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedIndexedGetter i a b -> a -> (i, b)

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Semigroup i => Apply (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedIndexedGetter i s (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b

(.>) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s b

(<.) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a

liftF2 :: (a -> b -> c) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s c

type Rep (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

type Rep (ReifiedIndexedGetter i) = (,) i

newtype ReifiedIndexedFold i s a #

Constructors

IndexedFold 

Fields

Instances
Profunctor (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d #

lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c #

rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c

(.#) :: Coercible b a => ReifiedIndexedFold i b c -> (a -> b) -> ReifiedIndexedFold i a c

Representable (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep (ReifiedIndexedFold i) :: * -> *

Methods

tabulate :: (d -> Rep (ReifiedIndexedFold i) c) -> ReifiedIndexedFold i d c

Strong (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (a, c) (b, c)

second' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (c, a) (c, b)

Sieve (ReifiedIndexedFold i) (Compose [] ((,) i)) 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedIndexedFold i a b -> a -> Compose [] ((,) i) b

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Alt (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<!>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a

some :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a]

many :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a]

Plus (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

zero :: ReifiedIndexedFold i s a

Semigroup (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a #

stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

Monoid (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedIndexedFold i s a #

mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #

type Rep (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

type Rep (ReifiedIndexedFold i) = Compose [] ((,) i)

newtype ReifiedGetter s a #

Constructors

Getter 

Fields

Instances
Profunctor ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d #

lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c #

rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c

(.#) :: Coercible b a => ReifiedGetter b c -> (a -> b) -> ReifiedGetter a c

Choice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) #

right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #

Conjoined ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) #

conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #

Arrow ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

arr :: (b -> c) -> ReifiedGetter b c #

first :: ReifiedGetter b c -> ReifiedGetter (b, d) (c, d) #

second :: ReifiedGetter b c -> ReifiedGetter (d, b) (d, c) #

(***) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (b, b') (c, c') #

(&&&) :: ReifiedGetter b c -> ReifiedGetter b c' -> ReifiedGetter b (c, c') #

ArrowChoice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left :: ReifiedGetter b c -> ReifiedGetter (Either b d) (Either c d) #

right :: ReifiedGetter b c -> ReifiedGetter (Either d b) (Either d c) #

(+++) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (Either b b') (Either c c') #

(|||) :: ReifiedGetter b d -> ReifiedGetter c d -> ReifiedGetter (Either b c) d #

ArrowApply ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

app :: ReifiedGetter (ReifiedGetter b c, b) c #

ArrowLoop ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

loop :: ReifiedGetter (b, d) (c, d) -> ReifiedGetter b c #

Closed ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

closed :: ReifiedGetter a b -> ReifiedGetter (x -> a) (x -> b)

Corepresentable ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Corep ReifiedGetter :: * -> *

Methods

cotabulate :: (Corep ReifiedGetter d -> c) -> ReifiedGetter d c

Costrong ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

unfirst :: ReifiedGetter (a, d) (b, d) -> ReifiedGetter a b

unsecond :: ReifiedGetter (d, a) (d, b) -> ReifiedGetter a b

Representable ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep ReifiedGetter :: * -> *

Methods

tabulate :: (d -> Rep ReifiedGetter c) -> ReifiedGetter d c

Strong ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedGetter a b -> ReifiedGetter (a, c) (b, c)

second' :: ReifiedGetter a b -> ReifiedGetter (c, a) (c, b)

Cosieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

cosieve :: ReifiedGetter a b -> Identity a -> b

Sieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedGetter a b -> a -> Identity b

MonadReader s (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

ask :: ReifiedGetter s s #

local :: (s -> s) -> ReifiedGetter s a -> ReifiedGetter s a #

reader :: (s -> a) -> ReifiedGetter s a #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Applicative (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedGetter s a #

(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c #

(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #

Monoid s => Comonad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

extract :: ReifiedGetter s a -> a

duplicate :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a)

extend :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b

Apply (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b

(.>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b

(<.) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a

liftF2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c

Bind (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>-) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b

join :: ReifiedGetter s (ReifiedGetter s a) -> ReifiedGetter s a

Monoid s => ComonadApply (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<@>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b

(@>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b

(<@) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a

Distributive (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

distribute :: Functor f => f (ReifiedGetter s a) -> ReifiedGetter s (f a)

collect :: Functor f => (a -> ReifiedGetter s b) -> f a -> ReifiedGetter s (f b)

distributeM :: Monad m => m (ReifiedGetter s a) -> ReifiedGetter s (m a)

collectM :: Monad m => (a -> ReifiedGetter s b) -> m a -> ReifiedGetter s (m b)

Semigroup s => Extend (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

duplicated :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a)

extended :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b

Category ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

id :: ReifiedGetter a a #

(.) :: ReifiedGetter b c -> ReifiedGetter a b -> ReifiedGetter a c #

type Corep ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

type Corep ReifiedGetter = Identity
type Rep ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

type Rep ReifiedGetter = Identity

newtype ReifiedFold s a #

Constructors

Fold 

Fields

Instances
Profunctor ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d #

lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c #

rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c #

(#.) :: Coercible c b => (b -> c) -> ReifiedFold a b -> ReifiedFold a c

(.#) :: Coercible b a => ReifiedFold b c -> (a -> b) -> ReifiedFold a c

Choice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) #

right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #

Arrow ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

arr :: (b -> c) -> ReifiedFold b c #

first :: ReifiedFold b c -> ReifiedFold (b, d) (c, d) #

second :: ReifiedFold b c -> ReifiedFold (d, b) (d, c) #

(***) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (b, b') (c, c') #

(&&&) :: ReifiedFold b c -> ReifiedFold b c' -> ReifiedFold b (c, c') #

ArrowChoice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left :: ReifiedFold b c -> ReifiedFold (Either b d) (Either c d) #

right :: ReifiedFold b c -> ReifiedFold (Either d b) (Either d c) #

(+++) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (Either b b') (Either c c') #

(|||) :: ReifiedFold b d -> ReifiedFold c d -> ReifiedFold (Either b c) d #

ArrowApply ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

app :: ReifiedFold (ReifiedFold b c, b) c #

Representable ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep ReifiedFold :: * -> *

Methods

tabulate :: (d -> Rep ReifiedFold c) -> ReifiedFold d c

Strong ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedFold a b -> ReifiedFold (a, c) (b, c)

second' :: ReifiedFold a b -> ReifiedFold (c, a) (c, b)

Sieve ReifiedFold [] 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedFold a b -> a -> [b]

MonadReader s (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

ask :: ReifiedFold s s #

local :: (s -> s) -> ReifiedFold s a -> ReifiedFold s a #

reader :: (s -> a) -> ReifiedFold s a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Applicative (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedFold s a #

(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c #

(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #

MonadPlus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

mzero :: ReifiedFold s a #

mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

Alternative (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

empty :: ReifiedFold s a #

(<|>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

some :: ReifiedFold s a -> ReifiedFold s [a] #

many :: ReifiedFold s a -> ReifiedFold s [a] #

Apply (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b

(.>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b

(<.) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a

liftF2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c

Bind (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>-) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b

join :: ReifiedFold s (ReifiedFold s a) -> ReifiedFold s a

Alt (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<!>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a

some :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a]

many :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a]

Plus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

zero :: ReifiedFold s a

Category ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

id :: ReifiedFold a a #

(.) :: ReifiedFold b c -> ReifiedFold a b -> ReifiedFold a c #

Semigroup (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a #

stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #

Monoid (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedFold s a #

mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

mconcat :: [ReifiedFold s a] -> ReifiedFold s a #

type Rep ReifiedFold 
Instance details

Defined in Control.Lens.Reified

type Rep ReifiedFold = []

type APrism' s a = APrism s s a a #

type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t) #

class Plated a where #

Methods

plate :: Traversal' a a #

Instances
Plated Exp 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Exp Exp #

Plated Pat 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Pat Pat #

Plated Type 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Type Type #

Plated Dec 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Dec Dec #

Plated Con 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Con Con #

Plated Stmt 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Stmt Stmt #

Plated [a] 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' [a] [a] #

Plated (Tree a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Tree a) (Tree a) #

Traversable f => Plated (Cofree f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Cofree f a) (Cofree f a) #

Traversable f => Plated (Free f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Free f a) (Free f a) #

Traversable f => Plated (F f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (F f a) (F f a) #

(Traversable f, Traversable w) => Plated (CofreeT f w a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (CofreeT f w a) (CofreeT f w a) #

(Traversable f, Traversable m) => Plated (FreeT f m a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (FreeT f m a) (FreeT f m a) #

class GPlated a (g :: * -> *) #

Minimal complete definition

gplate'

Instances
GPlated a (V1 :: * -> *) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f => (a -> f a) -> V1 p -> f (V1 p)

GPlated a (U1 :: * -> *) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f => (a -> f a) -> U1 p -> f (U1 p)

GPlated a (K1 i a :: * -> *) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f => (a -> f a) -> K1 i a p -> f (K1 i a p)

GPlated a (K1 i b :: * -> *) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f => (a -> f a) -> K1 i b p -> f (K1 i b p)

(GPlated a f, GPlated a g) => GPlated a (f :+: g) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f0 => (a -> f0 a) -> (f :+: g) p -> f0 ((f :+: g) p)

(GPlated a f, GPlated a g) => GPlated a (f :*: g) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f0 => (a -> f0 a) -> (f :*: g) p -> f0 ((f :*: g) p)

GPlated a f => GPlated a (M1 i c f) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Applicative f0 => (a -> f0 a) -> M1 i c f p -> f0 (M1 i c f p)

type AnIndexedLens' i s a = AnIndexedLens i s s a a #

type AnIndexedLens i s t a b = Optical (Indexed i) ((->) :: * -> * -> *) (Pretext (Indexed i) a b) s t a b #

type ALens' s a = ALens s s a a #

type ALens s t a b = LensLike (Pretext ((->) :: * -> * -> *) a b) s t a b #

class Bifunctor p => Swapped (p :: * -> * -> *) where #

Minimal complete definition

swapped

Methods

swapped :: (Profunctor p, Functor f) => p (p b a) (f (p d c)) -> p (p a b) (f (p c d)) #

Instances
Swapped Either 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: (Profunctor p, Functor f) => p (Either b a) (f (Either d c)) -> p (Either a b) (f (Either c d)) #

Swapped (,) 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: (Profunctor p, Functor f) => p (b, a) (f (d, c)) -> p (a, b) (f (c, d)) #

class Strict lazy strict | lazy -> strict, strict -> lazy where #

Minimal complete definition

strict

Methods

strict :: Iso' lazy strict #

Instances
Strict ByteString ByteString 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' ByteString ByteString0 #

Strict Text Text 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' Text Text0 #

Strict (ST s a) (ST s a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (ST s a) (ST0 s a) #

Strict (WriterT w m a) (WriterT w m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (WriterT0 w m a) (WriterT w m a) #

Strict (StateT s m a) (StateT s m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (StateT0 s m a) (StateT s m a) #

Strict (RWST r w s m a) (RWST r w s m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (RWST0 r w s m a) (RWST r w s m a) #

type AnIso' s a = AnIso s s a a #

type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t) #

class (Applicative f, Distributive f, Traversable f) => Settable (f :: * -> *) #

Minimal complete definition

untainted

Instances
Settable Identity 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Identity a -> a

untaintedDot :: Profunctor p => p a (Identity b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Identity b)

Settable f => Settable (Backwards f) 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Backwards f a -> a

untaintedDot :: Profunctor p => p a (Backwards f b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Backwards f b)

(Settable f, Settable g) => Settable (Compose f g) 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Compose f g a -> a

untaintedDot :: Profunctor p => p a (Compose f g b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Compose f g b)

class (Profunctor p, Bifunctor p) => Reviewable (p :: * -> * -> *) #

Instances
(Profunctor p, Bifunctor p) => Reviewable p 
Instance details

Defined in Control.Lens.Internal.Review

data Magma i t b a #

Instances
TraversableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

itraversed :: (Indexable i p, Applicative f) => p a (f b0) -> Magma i t b a -> f (Magma i t b b0) #

FunctorWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 #

imapped :: (Indexable i p, Settable f) => p a (f b0) -> Magma i t b a -> f (Magma i t b b0) #

FoldableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> Magma i t b a -> f (Magma i t b a) #

ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Foldable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fold :: Monoid m => Magma i t b m -> m #

foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldr1 :: (a -> a -> a) -> Magma i t b a -> a #

foldl1 :: (a -> a -> a) -> Magma i t b a -> a #

toList :: Magma i t b a -> [a] #

null :: Magma i t b a -> Bool #

length :: Magma i t b a -> Int #

elem :: Eq a => a -> Magma i t b a -> Bool #

maximum :: Ord a => Magma i t b a -> a #

minimum :: Ord a => Magma i t b a -> a #

sum :: Num a => Magma i t b a -> a #

product :: Num a => Magma i t b a -> a #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

(Show i, Show a) => Show (Magma i t b a) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

showsPrec :: Int -> Magma i t b a -> ShowS #

show :: Magma i t b a -> String #

showList :: [Magma i t b a] -> ShowS #

data Level i a #

Instances
TraversableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) #

itraversed :: (Indexable i p, Applicative f) => p a (f b) -> Level i a -> f (Level i b) #

FunctorWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Level i a -> Level i b #

imapped :: (Indexable i p, Settable f) => p a (f b) -> Level i a -> f (Level i b) #

FoldableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> Level i a -> f (Level i a) #

ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Foldable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fold :: Monoid m => Level i m -> m #

foldMap :: Monoid m => (a -> m) -> Level i a -> m #

foldr :: (a -> b -> b) -> b -> Level i a -> b #

foldr' :: (a -> b -> b) -> b -> Level i a -> b #

foldl :: (b -> a -> b) -> b -> Level i a -> b #

foldl' :: (b -> a -> b) -> b -> Level i a -> b #

foldr1 :: (a -> a -> a) -> Level i a -> a #

foldl1 :: (a -> a -> a) -> Level i a -> a #

toList :: Level i a -> [a] #

null :: Level i a -> Bool #

length :: Level i a -> Int #

elem :: Eq a => a -> Level i a -> Bool #

maximum :: Ord a => Level i a -> a #

minimum :: Ord a => Level i a -> a #

sum :: Num a => Level i a -> a #

product :: Num a => Level i a -> a #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

(Eq i, Eq a) => Eq (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(==) :: Level i a -> Level i a -> Bool #

(/=) :: Level i a -> Level i a -> Bool #

(Ord i, Ord a) => Ord (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

compare :: Level i a -> Level i a -> Ordering #

(<) :: Level i a -> Level i a -> Bool #

(<=) :: Level i a -> Level i a -> Bool #

(>) :: Level i a -> Level i a -> Bool #

(>=) :: Level i a -> Level i a -> Bool #

max :: Level i a -> Level i a -> Level i a #

min :: Level i a -> Level i a -> Level i a #

(Read i, Read a) => Read (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

readsPrec :: Int -> ReadS (Level i a) #

readList :: ReadS [Level i a] #

readPrec :: ReadPrec (Level i a) #

readListPrec :: ReadPrec [Level i a] #

(Show i, Show a) => Show (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

showsPrec :: Int -> Level i a -> ShowS #

show :: Level i a -> String #

showList :: [Level i a] -> ShowS #

class Reversing t where #

Minimal complete definition

reversing

Methods

reversing :: t -> t #

Instances
Reversing ByteString 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: ByteString -> ByteString #

Reversing ByteString 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: ByteString -> ByteString #

Reversing Text 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Text -> Text #

Reversing Text 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Text -> Text #

Reversing [a] 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: [a] -> [a] #

Reversing (NonEmpty a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: NonEmpty a -> NonEmpty a #

Reversing (Seq a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Seq a -> Seq a #

Unbox a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Storable a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Prim a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

(Metric v, OrderedField n) => Reversing (Located (Trail v n)) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Located (Trail v n) -> Located (Trail v n) #

(Metric v, OrderedField n) => Reversing (Located (Trail' l v n)) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Located (Trail' l v n) -> Located (Trail' l v n) #

(Metric v, OrderedField n) => Reversing (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Trail v n -> Trail v n #

(Metric v, OrderedField n) => Reversing (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

reversing :: Path v n -> Path v n #

Reversing (FixedSegment v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: FixedSegment v n -> FixedSegment v n #

(Additive v, Num n) => Reversing (Segment Closed v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: Segment Closed v n -> Segment Closed v n #

(Metric v, OrderedField n) => Reversing (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Trail' l v n -> Trail' l v n #

(Additive v, Num n) => Reversing (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: Offset c v n -> Offset c v n #

newtype Indexed i a b #

Constructors

Indexed 

Fields

Instances
i ~ j => Indexable i (Indexed j) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: Indexed j a b -> i -> a -> b #

Profunctor (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d #

lmap :: (a -> b) -> Indexed i b c -> Indexed i a c #

rmap :: (b -> c) -> Indexed i a b -> Indexed i a c #

(#.) :: Coercible c b => (b -> c) -> Indexed i a b -> Indexed i a c

(.#) :: Coercible b a => Indexed i b c -> (a -> b) -> Indexed i a c

Choice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) #

right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #

Conjoined (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) #

conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #

Arrow (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

arr :: (b -> c) -> Indexed i b c #

first :: Indexed i b c -> Indexed i (b, d) (c, d) #

second :: Indexed i b c -> Indexed i (d, b) (d, c) #

(***) :: Indexed i b c -> Indexed i b' c' -> Indexed i (b, b') (c, c') #

(&&&) :: Indexed i b c -> Indexed i b c' -> Indexed i b (c, c') #

ArrowChoice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left :: Indexed i b c -> Indexed i (Either b d) (Either c d) #

right :: Indexed i b c -> Indexed i (Either d b) (Either d c) #

(+++) :: Indexed i b c -> Indexed i b' c' -> Indexed i (Either b b') (Either c c') #

(|||) :: Indexed i b d -> Indexed i c d -> Indexed i (Either b c) d #

ArrowApply (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

app :: Indexed i (Indexed i b c, b) c #

ArrowLoop (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

loop :: Indexed i (b, d) (c, d) -> Indexed i b c #

Closed (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

closed :: Indexed i a b -> Indexed i (x -> a) (x -> b)

Corepresentable (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Associated Types

type Corep (Indexed i) :: * -> *

Methods

cotabulate :: (Corep (Indexed i) d -> c) -> Indexed i d c

Costrong (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

unfirst :: Indexed i (a, d) (b, d) -> Indexed i a b

unsecond :: Indexed i (d, a) (d, b) -> Indexed i a b

Representable (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Associated Types

type Rep (Indexed i) :: * -> *

Methods

tabulate :: (d -> Rep (Indexed i) c) -> Indexed i d c

Strong (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

first' :: Indexed i a b -> Indexed i (a, c) (b, c)

second' :: Indexed i a b -> Indexed i (c, a) (c, b)

Bizarre (Indexed Int) Mafic 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed Int a (f b) -> Mafic a b t -> f t

Category (Indexed i :: * -> * -> *) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

id :: Indexed i a a #

(.) :: Indexed i b c -> Indexed i a b -> Indexed i a c #

Cosieve (Indexed i) ((,) i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

cosieve :: Indexed i a b -> (i, a) -> b

Bizarre (Indexed i) (Molten i) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed i a (f b) -> Molten i a b t -> f t

Sellable (Indexed i) (Molten i) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

sell :: Indexed i a (Molten i a b b)

Sieve (Indexed i) ((->) i :: * -> *) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

sieve :: Indexed i a b -> a -> i -> b

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

MonadFix (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

mfix :: (a0 -> Indexed i a a0) -> Indexed i a a0 #

Applicative (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a0 -> Indexed i a a0 #

(<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c #

(*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

(<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #

Apply (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(<.>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b

(.>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b

(<.) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0

liftF2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c

Bind (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>-) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b

join :: Indexed i a (Indexed i a a0) -> Indexed i a a0

type Corep (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

type Corep (Indexed i) = (,) i
type Rep (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

type Rep (Indexed i) = ((->) i :: * -> *)

class Conjoined p => Indexable i (p :: * -> * -> *) where #

Minimal complete definition

indexed

Methods

indexed :: p a b -> i -> a -> b #

Instances
i ~ j => Indexable i (Indexed j) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: Indexed j a b -> i -> a -> b #

Indexable i ((->) :: * -> * -> *) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: (a -> b) -> i -> a -> b #

class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: * -> * -> *) where #

Methods

distrib :: Functor f => p a b -> p (f a) (f b) #

conjoined :: ((p ~ ((->) :: * -> * -> *)) -> q (a -> b) r) -> q (p a b) r -> q (p a b) r #

Instances
Conjoined ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) #

conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #

Conjoined (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) #

conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #

Conjoined ((->) :: * -> * -> *) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => (a -> b) -> f a -> f b #

conjoined :: (((->) ~ (->)) -> q (a -> b) r) -> q (a -> b) r -> q (a -> b) r #

data Traversed a (f :: * -> *) #

Instances
Applicative f => Semigroup (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Traversed a f -> Traversed a f -> Traversed a f #

sconcat :: NonEmpty (Traversed a f) -> Traversed a f #

stimes :: Integral b => b -> Traversed a f -> Traversed a f #

Applicative f => Monoid (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Traversed a f #

mappend :: Traversed a f -> Traversed a f -> Traversed a f #

mconcat :: [Traversed a f] -> Traversed a f #

data Sequenced a (m :: * -> *) #

Instances
Monad m => Semigroup (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m #

sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m #

stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #

Monad m => Monoid (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Sequenced a m #

mappend :: Sequenced a m -> Sequenced a m -> Sequenced a m #

mconcat :: [Sequenced a m] -> Sequenced a m #

data Rightmost a #

Instances
Semigroup (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Rightmost a -> Rightmost a -> Rightmost a #

sconcat :: NonEmpty (Rightmost a) -> Rightmost a #

stimes :: Integral b => b -> Rightmost a -> Rightmost a #

Monoid (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Rightmost a #

mappend :: Rightmost a -> Rightmost a -> Rightmost a #

mconcat :: [Rightmost a] -> Rightmost a #

data Leftmost a #

Instances
Semigroup (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Leftmost a -> Leftmost a -> Leftmost a #

sconcat :: NonEmpty (Leftmost a) -> Leftmost a #

stimes :: Integral b => b -> Leftmost a -> Leftmost a #

Monoid (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Leftmost a #

mappend :: Leftmost a -> Leftmost a -> Leftmost a #

mconcat :: [Leftmost a] -> Leftmost a #

data LensRules #

type FieldNamer = Name -> [Name] -> Name -> [DefName] #

data DefName #

Constructors

TopName Name 
MethodName Name Name 
Instances
Eq DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

(==) :: DefName -> DefName -> Bool #

(/=) :: DefName -> DefName -> Bool #

Ord DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

compare :: DefName -> DefName -> Ordering #

(<) :: DefName -> DefName -> Bool #

(<=) :: DefName -> DefName -> Bool #

(>) :: DefName -> DefName -> Bool #

(>=) :: DefName -> DefName -> Bool #

max :: DefName -> DefName -> DefName #

min :: DefName -> DefName -> DefName #

Show DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

showsPrec :: Int -> DefName -> ShowS #

show :: DefName -> String #

showList :: [DefName] -> ShowS #

type ClassyNamer = Name -> Maybe (Name, Name) #

type Context' a = Context a a #

data Context a b t #

Constructors

Context (b -> t) a 
Instances
IndexedComonadStore Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

ipos :: Context a c t -> a

ipeek :: c -> Context a c t -> t

ipeeks :: (a -> c) -> Context a c t -> t

iseek :: b -> Context a c t -> Context b c t

iseeks :: (a -> b) -> Context a c t -> Context b c t

iexperiment :: Functor f => (b -> f c) -> Context b c t -> f t

context :: Context a b t -> Context a b t

IndexedComonad Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

iextract :: Context a a t -> t

iduplicate :: Context a c t -> Context a b (Context b c t)

iextend :: (Context b c t -> r) -> Context a c t -> Context a b r

IndexedFunctor Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

ifmap :: (s -> t) -> Context a b s -> Context a b t

a ~ b => ComonadStore a (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

pos :: Context a b a0 -> a

peek :: a -> Context a b a0 -> a0

peeks :: (a -> a) -> Context a b a0 -> a0

seek :: a -> Context a b a0 -> Context a b a0

seeks :: (a -> a) -> Context a b a0 -> Context a b a0

experiment :: Functor f => (a -> f a) -> Context a b a0 -> f a0

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

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

a ~ b => Comonad (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

extract :: Context a b a0 -> a0

duplicate :: Context a b a0 -> Context a b (Context a b a0)

extend :: (Context a b a0 -> b0) -> Context a b a0 -> Context a b b0

Sellable ((->) :: * -> * -> *) Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

sell :: a -> Context a b b

type Bazaar1' (p :: * -> * -> *) a = Bazaar1 p a a #

newtype Bazaar1 (p :: * -> * -> *) a b t #

Constructors

Bazaar1 

Fields

  • runBazaar1 :: forall (f :: * -> *). Apply f => p a (f b) -> f t
     
Instances
Corepresentable p => Sellable p (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

sell :: p a (Bazaar1 p a b b)

Profunctor p => Bizarre1 p (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

bazaar1 :: Apply f => p a (f b) -> Bazaar1 p a b t -> f t

Conjoined p => IndexedComonad (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

iextract :: Bazaar1 p a a t -> t

iduplicate :: Bazaar1 p a c t -> Bazaar1 p a b (Bazaar1 p b c t)

iextend :: (Bazaar1 p b c t -> r) -> Bazaar1 p a c t -> Bazaar1 p a b r

IndexedFunctor (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

ifmap :: (s -> t) -> Bazaar1 p a b s -> Bazaar1 p a b t

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

(a ~ b, Conjoined p) => Comonad (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

extract :: Bazaar1 p a b a0 -> a0

duplicate :: Bazaar1 p a b a0 -> Bazaar1 p a b (Bazaar1 p a b a0)

extend :: (Bazaar1 p a b a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0

Apply (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<.>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0

(.>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0

(<.) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0

liftF2 :: (a0 -> b0 -> c) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b c

(a ~ b, Conjoined p) => ComonadApply (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<@>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0

(@>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0

(<@) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0

type Bazaar' (p :: * -> * -> *) a = Bazaar p a a #

newtype Bazaar (p :: * -> * -> *) a b t #

Constructors

Bazaar 

Fields

Instances
Profunctor p => Bizarre p (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

bazaar :: Applicative f => p a (f b) -> Bazaar p a b t -> f t

Corepresentable p => Sellable p (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

sell :: p a (Bazaar p a b b)

Conjoined p => IndexedComonad (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

iextract :: Bazaar p a a t -> t

iduplicate :: Bazaar p a c t -> Bazaar p a b (Bazaar p b c t)

iextend :: (Bazaar p b c t -> r) -> Bazaar p a c t -> Bazaar p a b r

IndexedFunctor (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

ifmap :: (s -> t) -> Bazaar p a b s -> Bazaar p a b t

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Applicative (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> Bazaar p a b a0 #

(<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c #

(*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #

(<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

(a ~ b, Conjoined p) => Comonad (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

extract :: Bazaar p a b a0 -> a0

duplicate :: Bazaar p a b a0 -> Bazaar p a b (Bazaar p a b a0)

extend :: (Bazaar p a b a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0

Apply (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<.>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0

(.>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0

(<.) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0

liftF2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c

(a ~ b, Conjoined p) => ComonadApply (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<@>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0

(@>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0

(<@) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0

class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t) => TraversableWithIndex i (t :: * -> *) | t -> i where #

Methods

itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b) #

itraversed :: (Indexable i p, Applicative f) => p a (f b) -> t a -> f (t b) #

Instances
TraversableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> [a] -> f [b] #

TraversableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> ZipList a -> f (ZipList b) #

TraversableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> NonEmpty a -> f (NonEmpty b) #

TraversableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> IntMap a -> f (IntMap b) #

TraversableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> Seq a -> f (Seq b) #

TraversableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> Vector a -> f (Vector b) #

TraversableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) #

itraversed :: (Indexable () p, Applicative f) => p a (f b) -> Maybe a -> f (Maybe b) #

TraversableWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Par1 a -> f (Par1 b) #

itraversed :: (Indexable () p, Applicative f) => p a (f b) -> Par1 a -> f (Par1 b) #

TraversableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) #

itraversed :: (Indexable () p, Applicative f) => p a (f b) -> Identity a -> f (Identity b) #

TraversableWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> Map k a -> f (Map k b) #

itraversed :: (Indexable k p, Applicative f) => p a (f b) -> Map k a -> f (Map k b) #

TraversableWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> HashMap k a -> f (HashMap k b) #

itraversed :: (Indexable k p, Applicative f) => p a (f b) -> HashMap k a -> f (HashMap k b) #

TraversableWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> (k, a) -> f (k, b) #

itraversed :: (Indexable k p, Applicative f) => p a (f b) -> (k, a) -> f (k, b) #

TraversableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) #

itraversed :: (Indexable i p, Applicative f) => p a (f b) -> Level i a -> f (Level i b) #

Ix i => TraversableWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Array i a -> f (Array i b) #

itraversed :: (Indexable i p, Applicative f) => p a (f b) -> Array i a -> f (Array i b) #

TraversableWithIndex Void (V1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> V1 a -> f (V1 b) #

itraversed :: (Indexable Void p, Applicative f) => p a (f b) -> V1 a -> f (V1 b) #

TraversableWithIndex Void (U1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> U1 a -> f (U1 b) #

itraversed :: (Indexable Void p, Applicative f) => p a (f b) -> U1 a -> f (U1 b) #

TraversableWithIndex Void (Proxy :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> Proxy a -> f (Proxy b) #

itraversed :: (Indexable Void p, Applicative f) => p a (f b) -> Proxy a -> f (Proxy b) #

TraversableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> V n a -> f (V n b) #

TraversableWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a0 -> f b) -> Tagged a a0 -> f (Tagged a b) #

itraversed :: (Indexable () p, Applicative f) => p a0 (f b) -> Tagged a a0 -> f (Tagged a b) #

TraversableWithIndex i f => TraversableWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Reverse f a -> f0 (Reverse f b) #

itraversed :: (Indexable i p, Applicative f0) => p a (f0 b) -> Reverse f a -> f0 (Reverse f b) #

TraversableWithIndex i f => TraversableWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

itraversed :: (Indexable i p, Applicative f0) => p a (f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

TraversableWithIndex i m => TraversableWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> IdentityT m a -> f (IdentityT m b) #

itraversed :: (Indexable i p, Applicative f) => p a (f b) -> IdentityT m a -> f (IdentityT m b) #

TraversableWithIndex i f => TraversableWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

itraversed :: (Indexable i p, Applicative f0) => p a (f0 b) -> Backwards f a -> f0 (Backwards f b) #

TraversableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

itraversed :: (Indexable i p, Applicative f) => p a (f b0) -> Magma i t b a -> f (Magma i t b b0) #

TraversableWithIndex Void (K1 i c :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> K1 i c a -> f (K1 i c b) #

itraversed :: (Indexable Void p, Applicative f) => p a (f b) -> K1 i c a -> f (K1 i c b) #

TraversableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) #

itraversed :: (Indexable [Int] p, Applicative f) => p a (f b) -> Tree a -> f (Tree b) #

TraversableWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

itraverse :: Applicative f => (E V3 -> a -> f b) -> V3 a -> f (V3 b) #

itraversed :: (Indexable (E V3) p, Applicative f) => p a (f b) -> V3 a -> f (V3 b) #

TraversableWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

itraverse :: Applicative f => (E V2 -> a -> f b) -> V2 a -> f (V2 b) #

itraversed :: (Indexable (E V2) p, Applicative f) => p a (f b) -> V2 a -> f (V2 b) #

TraversableWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

itraverse :: Applicative f => (E V1 -> a -> f b) -> V1 a -> f (V1 b) #

itraversed :: (Indexable (E V1) p, Applicative f) => p a (f b) -> V1 a -> f (V1 b) #

TraversableWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

itraverse :: Applicative f => (E V4 -> a -> f b) -> V4 a -> f (V4 b) #

itraversed :: (Indexable (E V4) p, Applicative f) => p a (f b) -> V4 a -> f (V4 b) #

TraversableWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

itraverse :: Applicative f => (E Plucker -> a -> f b) -> Plucker a -> f (Plucker b) #

itraversed :: (Indexable (E Plucker) p, Applicative f) => p a (f b) -> Plucker a -> f (Plucker b) #

TraversableWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

itraverse :: Applicative f => (E Quaternion -> a -> f b) -> Quaternion a -> f (Quaternion b) #

itraversed :: (Indexable (E Quaternion) p, Applicative f) => p a (f b) -> Quaternion a -> f (Quaternion b) #

TraversableWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

itraverse :: Applicative f => (E V0 -> a -> f b) -> V0 a -> f (V0 b) #

itraversed :: (Indexable (E V0) p, Applicative f) => p a (f b) -> V0 a -> f (V0 b) #

TraversableWithIndex i f => TraversableWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Free f a -> f0 (Free f b) #

itraversed :: (Indexable [i] p, Applicative f0) => p a (f0 b) -> Free f a -> f0 (Free f b) #

TraversableWithIndex i f => TraversableWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

itraversed :: (Indexable [i] p, Applicative f0) => p a (f0 b) -> Cofree f a -> f0 (Cofree f b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> Sum f g a -> f0 (Sum f g b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> Product f g a -> f0 (Product f g b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

itraversed :: (Indexable (i, j) p, Applicative f0) => p a (f0 b) -> Compose f g a -> f0 (Compose f g b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

itraversed :: (Indexable (i, j) p, Applicative f0) => p a (f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

class Functor f => FunctorWithIndex i (f :: * -> *) | f -> i where #

Methods

imap :: (i -> a -> b) -> f a -> f b #

imapped :: (Indexable i p, Settable f) => p a (f b) -> f a -> f (f b) #

Instances
FunctorWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> [a] -> [b] #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> [a] -> f [b] #

FunctorWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> ZipList a -> ZipList b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> ZipList a -> f (ZipList b) #

FunctorWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> NonEmpty a -> f (NonEmpty b) #

FunctorWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> IntMap a -> IntMap b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> IntMap a -> f (IntMap b) #

FunctorWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Seq a -> Seq b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> Seq a -> f (Seq b) #

FunctorWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Vector a -> Vector b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> Vector a -> f (Vector b) #

FunctorWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Maybe a -> Maybe b #

imapped :: (Indexable () p, Settable f) => p a (f b) -> Maybe a -> f (Maybe b) #

FunctorWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Par1 a -> Par1 b #

imapped :: (Indexable () p, Settable f) => p a (f b) -> Par1 a -> f (Par1 b) #

FunctorWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Identity a -> Identity b #

imapped :: (Indexable () p, Settable f) => p a (f b) -> Identity a -> f (Identity b) #

FunctorWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> Map k a -> Map k b #

imapped :: (Indexable k p, Settable f) => p a (f b) -> Map k a -> f (Map k b) #

FunctorWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> HashMap k a -> HashMap k b #

imapped :: (Indexable k p, Settable f) => p a (f b) -> HashMap k a -> f (HashMap k b) #

FunctorWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> (k, a) -> (k, b) #

imapped :: (Indexable k p, Settable f) => p a (f b) -> (k, a) -> f (k, b) #

FunctorWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Level i a -> Level i b #

imapped :: (Indexable i p, Settable f) => p a (f b) -> Level i a -> f (Level i b) #

Ix i => FunctorWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Array i a -> Array i b #

imapped :: (Indexable i p, Settable f) => p a (f b) -> Array i a -> f (Array i b) #

FunctorWithIndex Void (V1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> V1 a -> V1 b #

imapped :: (Indexable Void p, Settable f) => p a (f b) -> V1 a -> f (V1 b) #

FunctorWithIndex Void (U1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> U1 a -> U1 b #

imapped :: (Indexable Void p, Settable f) => p a (f b) -> U1 a -> f (U1 b) #

FunctorWithIndex Void (Proxy :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> Proxy a -> Proxy b #

imapped :: (Indexable Void p, Settable f) => p a (f b) -> Proxy a -> f (Proxy b) #

FunctorWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

imap :: (Int -> a -> b) -> V n a -> V n b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> V n a -> f (V n b) #

FunctorWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a0 -> b) -> Tagged a a0 -> Tagged a b #

imapped :: (Indexable () p, Settable f) => p a0 (f b) -> Tagged a a0 -> f (Tagged a b) #

FunctorWithIndex i f => FunctorWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Reverse f a -> Reverse f b #

imapped :: (Indexable i p, Settable f0) => p a (f0 b) -> Reverse f a -> f0 (Reverse f b) #

FunctorWithIndex i f => FunctorWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Rec1 f a -> Rec1 f b #

imapped :: (Indexable i p, Settable f0) => p a (f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

FunctorWithIndex i m => FunctorWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> IdentityT m a -> IdentityT m b #

imapped :: (Indexable i p, Settable f) => p a (f b) -> IdentityT m a -> f (IdentityT m b) #

FunctorWithIndex i f => FunctorWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Backwards f a -> Backwards f b #

imapped :: (Indexable i p, Settable f0) => p a (f0 b) -> Backwards f a -> f0 (Backwards f b) #

FunctorWithIndex r ((->) r :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (r -> a -> b) -> (r -> a) -> r -> b #

imapped :: (Indexable r p, Settable f) => p a (f b) -> (r -> a) -> f (r -> b) #

FunctorWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 #

imapped :: (Indexable i p, Settable f) => p a (f b0) -> Magma i t b a -> f (Magma i t b b0) #

FunctorWithIndex Void (K1 i c :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> K1 i c a -> K1 i c b #

imapped :: (Indexable Void p, Settable f) => p a (f b) -> K1 i c a -> f (K1 i c b) #

FunctorWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([Int] -> a -> b) -> Tree a -> Tree b #

imapped :: (Indexable [Int] p, Settable f) => p a (f b) -> Tree a -> f (Tree b) #

FunctorWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

imap :: (E V3 -> a -> b) -> V3 a -> V3 b #

imapped :: (Indexable (E V3) p, Settable f) => p a (f b) -> V3 a -> f (V3 b) #

FunctorWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

imap :: (E V2 -> a -> b) -> V2 a -> V2 b #

imapped :: (Indexable (E V2) p, Settable f) => p a (f b) -> V2 a -> f (V2 b) #

FunctorWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

imap :: (E V1 -> a -> b) -> V1 a -> V1 b #

imapped :: (Indexable (E V1) p, Settable f) => p a (f b) -> V1 a -> f (V1 b) #

FunctorWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

imap :: (E V4 -> a -> b) -> V4 a -> V4 b #

imapped :: (Indexable (E V4) p, Settable f) => p a (f b) -> V4 a -> f (V4 b) #

FunctorWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

imap :: (E Plucker -> a -> b) -> Plucker a -> Plucker b #

imapped :: (Indexable (E Plucker) p, Settable f) => p a (f b) -> Plucker a -> f (Plucker b) #

FunctorWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

imap :: (E Quaternion -> a -> b) -> Quaternion a -> Quaternion b #

imapped :: (Indexable (E Quaternion) p, Settable f) => p a (f b) -> Quaternion a -> f (Quaternion b) #

FunctorWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

imap :: (E V0 -> a -> b) -> V0 a -> V0 b #

imapped :: (Indexable (E V0) p, Settable f) => p a (f b) -> V0 a -> f (V0 b) #

FunctorWithIndex i f => FunctorWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([i] -> a -> b) -> Free f a -> Free f b #

imapped :: (Indexable [i] p, Settable f0) => p a (f0 b) -> Free f a -> f0 (Free f b) #

FunctorWithIndex i f => FunctorWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([i] -> a -> b) -> Cofree f a -> Cofree f b #

imapped :: (Indexable [i] p, Settable f0) => p a (f0 b) -> Cofree f a -> f0 (Cofree f b) #

FunctorWithIndex i w => FunctorWithIndex (s, i) (TracedT s w) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((s, i) -> a -> b) -> TracedT s w a -> TracedT s w b #

imapped :: (Indexable (s, i) p, Settable f) => p a (f b) -> TracedT s w a -> f (TracedT s w b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> Sum f g a -> f0 (Sum f g b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> Product f g a -> f0 (Product f g b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :*: g) a -> (f :*: g) b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

FunctorWithIndex i m => FunctorWithIndex (e, i) (ReaderT e m) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((e, i) -> a -> b) -> ReaderT e m a -> ReaderT e m b #

imapped :: (Indexable (e, i) p, Settable f) => p a (f b) -> ReaderT e m a -> f (ReaderT e m b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((i, j) -> a -> b) -> Compose f g a -> Compose f g b #

imapped :: (Indexable (i, j) p, Settable f0) => p a (f0 b) -> Compose f g a -> f0 (Compose f g b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((i, j) -> a -> b) -> (f :.: g) a -> (f :.: g) b #

imapped :: (Indexable (i, j) p, Settable f0) => p a (f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

class Foldable f => FoldableWithIndex i (f :: * -> *) | f -> i where #

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> f a -> f (f a) #

ifoldr :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> f a -> b #

Instances
FoldableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> [a] -> f [a] #

ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #

FoldableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> ZipList a -> f (ZipList a) #

ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

FoldableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> NonEmpty a -> f (NonEmpty a) #

ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

FoldableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> IntMap a -> f (IntMap a) #

ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

FoldableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> Seq a -> f (Seq a) #

ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #

FoldableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> Vector a -> f (Vector a) #

ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #

FoldableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a (f a) -> Maybe a -> f (Maybe a) #

ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #

FoldableWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Par1 a -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a (f a) -> Par1 a -> f (Par1 a) #

ifoldr :: (() -> a -> b -> b) -> b -> Par1 a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Par1 a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Par1 a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Par1 a -> b #

FoldableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a (f a) -> Identity a -> f (Identity a) #

ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #

FoldableWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> Map k a -> m #

ifolded :: (Indexable k p, Contravariant f, Applicative f) => p a (f a) -> Map k a -> f (Map k a) #

ifoldr :: (k -> a -> b -> b) -> b -> Map k a -> b #

ifoldl :: (k -> b -> a -> b) -> b -> Map k a -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> Map k a -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> Map k a -> b #

FoldableWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> HashMap k a -> m #

ifolded :: (Indexable k p, Contravariant f, Applicative f) => p a (f a) -> HashMap k a -> f (HashMap k a) #

ifoldr :: (k -> a -> b -> b) -> b -> HashMap k a -> b #

ifoldl :: (k -> b -> a -> b) -> b -> HashMap k a -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> HashMap k a -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> HashMap k a -> b #

FoldableWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> (k, a) -> m #

ifolded :: (Indexable k p, Contravariant f, Applicative f) => p a (f a) -> (k, a) -> f (k, a) #

ifoldr :: (k -> a -> b -> b) -> b -> (k, a) -> b #

ifoldl :: (k -> b -> a -> b) -> b -> (k, a) -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> (k, a) -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> (k, a) -> b #

FoldableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> Level i a -> f (Level i a) #

ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #

Ix i => FoldableWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Array i a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> Array i a -> f (Array i a) #

ifoldr :: (i -> a -> b -> b) -> b -> Array i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Array i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Array i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Array i a -> b #

FoldableWithIndex Void (V1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> V1 a -> m #

ifolded :: (Indexable Void p, Contravariant f, Applicative f) => p a (f a) -> V1 a -> f (V1 a) #

ifoldr :: (Void -> a -> b -> b) -> b -> V1 a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> V1 a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> V1 a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> V1 a -> b #

FoldableWithIndex Void (U1 :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> U1 a -> m #

ifolded :: (Indexable Void p, Contravariant f, Applicative f) => p a (f a) -> U1 a -> f (U1 a) #

ifoldr :: (Void -> a -> b -> b) -> b -> U1 a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> U1 a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> U1 a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> U1 a -> b #

FoldableWithIndex Void (Proxy :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> Proxy a -> m #

ifolded :: (Indexable Void p, Contravariant f, Applicative f) => p a (f a) -> Proxy a -> f (Proxy a) #

ifoldr :: (Void -> a -> b -> b) -> b -> Proxy a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> Proxy a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> Proxy a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> Proxy a -> b #

FoldableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> V n a -> f (V n a) #

ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b #

FoldableWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a0 -> m) -> Tagged a a0 -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a0 (f a0) -> Tagged a a0 -> f (Tagged a a0) #

ifoldr :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b #

ifoldl :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b #

ifoldr' :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b #

ifoldl' :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b #

FoldableWithIndex i f => FoldableWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Reverse f a -> m #

ifolded :: (Indexable i p, Contravariant f0, Applicative f0) => p a (f0 a) -> Reverse f a -> f0 (Reverse f a) #

ifoldr :: (i -> a -> b -> b) -> b -> Reverse f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Reverse f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Reverse f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Reverse f a -> b #

FoldableWithIndex i f => FoldableWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Rec1 f a -> m #

ifolded :: (Indexable i p, Contravariant f0, Applicative f0) => p a (f0 a) -> Rec1 f a -> f0 (Rec1 f a) #

ifoldr :: (i -> a -> b -> b) -> b -> Rec1 f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Rec1 f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Rec1 f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Rec1 f a -> b #

FoldableWithIndex i m => FoldableWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m0 => (i -> a -> m0) -> IdentityT m a -> m0 #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> IdentityT m a -> f (IdentityT m a) #

ifoldr :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

FoldableWithIndex i f => FoldableWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Backwards f a -> m #

ifolded :: (Indexable i p, Contravariant f0, Applicative f0) => p a (f0 a) -> Backwards f a -> f0 (Backwards f a) #

ifoldr :: (i -> a -> b -> b) -> b -> Backwards f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Backwards f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Backwards f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Backwards f a -> b #

FoldableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m #

ifolded :: (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> Magma i t b a -> f (Magma i t b a) #

ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

FoldableWithIndex Void (K1 i c :: * -> *) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> K1 i c a -> m #

ifolded :: (Indexable Void p, Contravariant f, Applicative f) => p a (f a) -> K1 i c a -> f (K1 i c a) #

ifoldr :: (Void -> a -> b -> b) -> b -> K1 i c a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> K1 i c a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> K1 i c a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> K1 i c a -> b #

FoldableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m #

ifolded :: (Indexable [Int] p, Contravariant f, Applicative f) => p a (f a) -> Tree a -> f (Tree a) #

ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

FoldableWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m #

ifolded :: (Indexable (E V3) p, Contravariant f, Applicative f) => p a (f a) -> V3 a -> f (V3 a) #

ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b #

ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #

ifoldr' :: (E V3 -> a -> b -> b) -> b -> V3 a -> b #

ifoldl' :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #

FoldableWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m #

ifolded :: (Indexable (E V2) p, Contravariant f, Applicative f) => p a (f a) -> V2 a -> f (V2 a) #

ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b #

ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #

ifoldr' :: (E V2 -> a -> b -> b) -> b -> V2 a -> b #

ifoldl' :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #

FoldableWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

ifoldMap :: Monoid m => (E V1 -> a -> m) -> V1 a -> m #

ifolded :: (Indexable (E V1) p, Contravariant f, Applicative f) => p a (f a) -> V1 a -> f (V1 a) #

ifoldr :: (E V1 -> a -> b -> b) -> b -> V1 a -> b #

ifoldl :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #

ifoldr' :: (E V1 -> a -> b -> b) -> b -> V1 a -> b #

ifoldl' :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #

FoldableWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

ifoldMap :: Monoid m => (E V4 -> a -> m) -> V4 a -> m #

ifolded :: (Indexable (E V4) p, Contravariant f, Applicative f) => p a (f a) -> V4 a -> f (V4 a) #

ifoldr :: (E V4 -> a -> b -> b) -> b -> V4 a -> b #

ifoldl :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #

ifoldr' :: (E V4 -> a -> b -> b) -> b -> V4 a -> b #

ifoldl' :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #

FoldableWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

ifoldMap :: Monoid m => (E Plucker -> a -> m) -> Plucker a -> m #

ifolded :: (Indexable (E Plucker) p, Contravariant f, Applicative f) => p a (f a) -> Plucker a -> f (Plucker a) #

ifoldr :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b #

ifoldl :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #

ifoldr' :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b #

ifoldl' :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #

FoldableWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

ifoldMap :: Monoid m => (E Quaternion -> a -> m) -> Quaternion a -> m #

ifolded :: (Indexable (E Quaternion) p, Contravariant f, Applicative f) => p a (f a) -> Quaternion a -> f (Quaternion a) #

ifoldr :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b #

ifoldl :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #

ifoldr' :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b #

ifoldl' :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #

FoldableWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

ifoldMap :: Monoid m => (E V0 -> a -> m) -> V0 a -> m #

ifolded :: (Indexable (E V0) p, Contravariant f, Applicative f) => p a (f a) -> V0 a -> f (V0 a) #

ifoldr :: (E V0 -> a -> b -> b) -> b -> V0 a -> b #

ifoldl :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #

ifoldr' :: (E V0 -> a -> b -> b) -> b -> V0 a -> b #

ifoldl' :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #

FoldableWithIndex i f => FoldableWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([i] -> a -> m) -> Free f a -> m #

ifolded :: (Indexable [i] p, Contravariant f0, Applicative f0) => p a (f0 a) -> Free f a -> f0 (Free f a) #

ifoldr :: ([i] -> a -> b -> b) -> b -> Free f a -> b #

ifoldl :: ([i] -> b -> a -> b) -> b -> Free f a -> b #

ifoldr' :: ([i] -> a -> b -> b) -> b -> Free f a -> b #

ifoldl' :: ([i] -> b -> a -> b) -> b -> Free f a -> b #

FoldableWithIndex i f => FoldableWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([i] -> a -> m) -> Cofree f a -> m #

ifolded :: (Indexable [i] p, Contravariant f0, Applicative f0) => p a (f0 a) -> Cofree f a -> f0 (Cofree f a) #

ifoldr :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b #

ifoldl :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b #

ifoldr' :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b #

ifoldl' :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> Sum f g a -> f0 (Sum f g a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> Product f g a -> f0 (Product f g a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> (f :+: g) a -> f0 ((f :+: g) a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> (f :*: g) a -> f0 ((f :*: g) a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ((i, j) -> a -> m) -> Compose f g a -> m #

ifolded :: (Indexable (i, j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> Compose f g a -> f0 (Compose f g a) #

ifoldr :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b #

ifoldl :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b #

ifoldr' :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b #

ifoldl' :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ((i, j) -> a -> m) -> (f :.: g) a -> m #

ifolded :: (Indexable (i, j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> (f :.: g) a -> f0 ((f :.: g) a) #

ifoldr :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b #

ifoldl :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b #

ifoldr' :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b #

ifoldl' :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b #

type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s #

type Getting r s a = (a -> Const r a) -> s -> Const r s #

type Accessing (p :: * -> * -> *) m s a = p a (Const m a) -> s -> Const m s #

data Identical (a :: k) (b :: k1) (s :: k) (t :: k1) :: forall k k1. k -> k1 -> k -> k1 -> * where #

Constructors

Identical :: Identical a b a b 

type AnEquality' (s :: k2) (a :: k2) = AnEquality s s a a #

type AnEquality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t) #

class AsEmpty a where #

Methods

_Empty :: Prism' a () #

Instances
AsEmpty Ordering 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Ordering () #

AsEmpty () 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' () () #

AsEmpty ByteString 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' ByteString () #

AsEmpty ByteString 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' ByteString () #

AsEmpty Text 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Text () #

AsEmpty Text 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Text () #

AsEmpty Event 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Event () #

AsEmpty All 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' All () #

AsEmpty Any 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Any () #

AsEmpty IntSet 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' IntSet () #

AsEmpty ColourMap 
Instance details

Defined in Plots.Style

Methods

_Empty :: Prism' ColourMap () #

AsEmpty [a] 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' [a] () #

AsEmpty (Maybe a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Maybe a) () #

AsEmpty (First a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (First a) () #

AsEmpty (Last a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Last a) () #

AsEmpty a => AsEmpty (Dual a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Dual a) () #

(Eq a, Num a) => AsEmpty (Sum a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Sum a) () #

(Eq a, Num a) => AsEmpty (Product a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Product a) () #

AsEmpty (IntMap a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (IntMap a) () #

AsEmpty (Seq a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Seq a) () #

AsEmpty (Set a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Set a) () #

Unbox a => AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

Storable a => AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

AsEmpty (HashSet a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (HashSet a) () #

AsEmpty (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

_Empty :: Prism' (Clip n) () #

(AsEmpty a, AsEmpty b) => AsEmpty (a, b) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (a, b) () #

AsEmpty (Map k a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Map k a) () #

(Metric v, OrderedField n) => AsEmpty (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

_Empty :: Prism' (Trail v n) () #

AsEmpty (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

_Empty :: Prism' (BoundingBox v n) () #

AsEmpty (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

_Empty :: Prism' (Path v n) () #

AsEmpty (HashMap k a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (HashMap k a) () #

(AsEmpty a, AsEmpty b, AsEmpty c) => AsEmpty (a, b, c) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (a, b, c) () #

(Metric v, OrderedField n) => AsEmpty (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

_Empty :: Prism' (Trail' Line v n) () #

class Each s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

each :: Traversal s t a b #

Instances
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal ByteString ByteString a b #

(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal ByteString ByteString a b #

(a ~ Char, b ~ Char) => Each Text Text a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal Text Text a b #

(a ~ Char, b ~ Char) => Each Text Text a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal Text Text a b #

Each Name Name AName AName 
Instance details

Defined in Diagrams.Core.Names

Methods

each :: Traversal Name Name AName AName #

Each ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) #

Each [a] [b] a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal [a] [b] a b #

Each (Maybe a) (Maybe b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Maybe a) (Maybe b) a b #

Each (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Identity a) (Identity b) a b #

Each (Complex a) (Complex b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Complex a) (Complex b) a b #

Each (NonEmpty a) (NonEmpty b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (NonEmpty a) (NonEmpty b) a b #

Each (IntMap a) (IntMap b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (IntMap a) (IntMap b) a b #

Each (Tree a) (Tree b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Tree a) (Tree b) a b #

Each (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Seq a) (Seq b) a b #

(Unbox a, Unbox b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (V3 a) (V3 b) a b 
Instance details

Defined in Linear.V3

Methods

each :: Traversal (V3 a) (V3 b) a b #

Each (V2 a) (V2 b) a b 
Instance details

Defined in Linear.V2

Methods

each :: Traversal (V2 a) (V2 b) a b #

(Storable a, Storable b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

(Prim a, Prim b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (V1 a) (V1 b) a b 
Instance details

Defined in Linear.V1

Methods

each :: Traversal (V1 a) (V1 b) a b #

Each (V4 a) (V4 b) a b 
Instance details

Defined in Linear.V4

Methods

each :: Traversal (V4 a) (V4 b) a b #

Each (Plucker a) (Plucker b) a b 
Instance details

Defined in Linear.Plucker

Methods

each :: Traversal (Plucker a) (Plucker b) a b #

Each (Quaternion a) (Quaternion b) a b 
Instance details

Defined in Linear.Quaternion

Methods

each :: Traversal (Quaternion a) (Quaternion b) a b #

Each (V0 a) (V0 b) a b 
Instance details

Defined in Linear.V0

Methods

each :: Traversal (V0 a) (V0 b) a b #

(a ~ a', b ~ b') => Each (a, a') (b, b') a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a') (b, b') a b #

c ~ d => Each (Map c a) (Map d b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Map c a) (Map d b) a b #

(Ix i, IArray UArray a, IArray UArray b, i ~ j) => Each (UArray i a) (UArray j b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (UArray i a) (UArray j b) a b #

(Ix i, i ~ j) => Each (Array i a) (Array j b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Array i a) (Array j b) a b #

Traversable f => Each (Point f a) (Point f b) a b 
Instance details

Defined in Linear.Affine

Methods

each :: Traversal (Point f a) (Point f b) a b #

c ~ d => Each (HashMap c a) (HashMap d b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (HashMap c a) (HashMap d b) a b #

Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #

(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') 
Instance details

Defined in Diagrams.BoundingBox

Methods

each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') #

Each (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') 
Instance details

Defined in Diagrams.Core.Style

Methods

each :: Traversal (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') #

Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') #

(a ~ a2, a ~ a3, b ~ b2, b ~ b3) => Each (a, a2, a3) (b, b2, b3) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3) (b, b2, b3) a b #

Each (V n a) (V n b) a b 
Instance details

Defined in Linear.V

Methods

each :: Traversal (V n a) (V n b) a b #

Each (Segment c v n) (Segment c v' n') (v n) (v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (Segment c v n) (Segment c v' n') (v n) (v' n') #

Each (Offset c v n) (Offset c v' n') (v n) (v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (Offset c v n) (Offset c v' n') (v n) (v' n') #

(a ~ a2, a ~ a3, a ~ a4, b ~ b2, b ~ b3, b ~ b4) => Each (a, a2, a3, a4) (b, b2, b3, b4) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4) (b, b2, b3, b4) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, b ~ b2, b ~ b3, b ~ b4, b ~ b5) => Each (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6) => Each (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7) => Each (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8) => Each (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8, b ~ b9) => Each (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b #

class Snoc s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

_Snoc

Methods

_Snoc :: Prism s t (s, a) (t, b) #

Instances
Snoc ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #

Snoc ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc [a] [b] a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism [a] [b] ([a], a) ([b], b) #

Snoc (ZipList a) (ZipList b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (ZipList a) (ZipList b) (ZipList a, a) (ZipList b, b) #

Snoc (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Seq a) (Seq b) (Seq a, a) (Seq b, b) #

(Unbox a, Unbox b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

(Storable a, Storable b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

(Prim a, Prim b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

_Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #

(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #

class Cons s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

_Cons

Methods

_Cons :: Prism s t (a, s) (b, t) #

Instances
Cons ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #

Cons ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons [a] [b] a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism [a] [b] (a, [a]) (b, [b]) #

Cons (ZipList a) (ZipList b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (ZipList a) (ZipList b) (a, ZipList a) (b, ZipList b) #

Cons (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Seq a) (Seq b) (a, Seq a) (b, Seq b) #

(Unbox a, Unbox b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

(Storable a, Storable b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

(Prim a, Prim b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

_Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #

class Ixed m where #

Methods

ix :: Index m -> Traversal' m (IxValue m) #

Instances
Ixed ByteString 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #

Ixed ByteString 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #

Ixed Text 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index Text -> Traversal' Text (IxValue Text) #

Ixed Text 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index Text -> Traversal' Text (IxValue Text) #

Ixed IntSet 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) #

Ixed ColourMap 
Instance details

Defined in Plots.Style

Methods

ix :: Index ColourMap -> Traversal' ColourMap (IxValue ColourMap) #

Ixed [a] 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index [a] -> Traversal' [a] (IxValue [a]) #

Ixed (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #

Ixed (Identity a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #

Ixed (NonEmpty a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (NonEmpty a) -> Traversal' (NonEmpty a) (IxValue (NonEmpty a)) #

Ixed (IntMap a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) #

Ixed (Tree a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) #

Ixed (Seq a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) #

Ord k => Ixed (Set k) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #

Unbox a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Ixed (V3 a) 
Instance details

Defined in Linear.V3

Methods

ix :: Index (V3 a) -> Traversal' (V3 a) (IxValue (V3 a)) #

Ixed (V2 a) 
Instance details

Defined in Linear.V2

Methods

ix :: Index (V2 a) -> Traversal' (V2 a) (IxValue (V2 a)) #

Storable a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Prim a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

(Eq k, Hashable k) => Ixed (HashSet k) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (HashSet k) -> Traversal' (HashSet k) (IxValue (HashSet k)) #

Ixed (V1 a) 
Instance details

Defined in Linear.V1

Methods

ix :: Index (V1 a) -> Traversal' (V1 a) (IxValue (V1 a)) #

Ixed (V4 a) 
Instance details

Defined in Linear.V4

Methods

ix :: Index (V4 a) -> Traversal' (V4 a) (IxValue (V4 a)) #

Ixed (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

ix :: Index (Plucker a) -> Traversal' (Plucker a) (IxValue (Plucker a)) #

Ixed (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

ix :: Index (Quaternion a) -> Traversal' (Quaternion a) (IxValue (Quaternion a)) #

Ixed (V0 a) 
Instance details

Defined in Linear.V0

Methods

ix :: Index (V0 a) -> Traversal' (V0 a) (IxValue (V0 a)) #

Eq e => Ixed (e -> a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (e -> a) -> Traversal' (e -> a) (IxValue (e -> a)) #

a ~ a2 => Ixed (a, a2) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2) -> Traversal' (a, a2) (IxValue (a, a2)) #

Ord k => Ixed (Map k a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #

(IArray UArray e, Ix i) => Ixed (UArray i e) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (UArray i e) -> Traversal' (UArray i e) (IxValue (UArray i e)) #

Ix i => Ixed (Array i e) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Array i e) -> Traversal' (Array i e) (IxValue (Array i e)) #

Ixed (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

ix :: Index (Style v n) -> Traversal' (Style v n) (IxValue (Style v n)) #

Ixed (f a) => Ixed (Point f a) 
Instance details

Defined in Linear.Affine

Methods

ix :: Index (Point f a) -> Traversal' (Point f a) (IxValue (Point f a)) #

(Eq k, Hashable k) => Ixed (HashMap k a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (HashMap k a) -> Traversal' (HashMap k a) (IxValue (HashMap k a)) #

(a ~ a2, a ~ a3) => Ixed (a, a2, a3) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3) -> Traversal' (a, a2, a3) (IxValue (a, a2, a3)) #

Ixed (V n a) 
Instance details

Defined in Linear.V

Methods

ix :: Index (V n a) -> Traversal' (V n a) (IxValue (V n a)) #

(a ~ a2, a ~ a3, a ~ a4) => Ixed (a, a2, a3, a4) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4) -> Traversal' (a, a2, a3, a4) (IxValue (a, a2, a3, a4)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5) => Ixed (a, a2, a3, a4, a5) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5) -> Traversal' (a, a2, a3, a4, a5) (IxValue (a, a2, a3, a4, a5)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6) => Ixed (a, a2, a3, a4, a5, a6) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6) -> Traversal' (a, a2, a3, a4, a5, a6) (IxValue (a, a2, a3, a4, a5, a6)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7) => Ixed (a, a2, a3, a4, a5, a6, a7) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7) -> Traversal' (a, a2, a3, a4, a5, a6, a7) (IxValue (a, a2, a3, a4, a5, a6, a7)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8) => Ixed (a, a2, a3, a4, a5, a6, a7, a8) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7, a8) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8) (IxValue (a, a2, a3, a4, a5, a6, a7, a8)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9) => Ixed (a, a2, a3, a4, a5, a6, a7, a8, a9) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7, a8, a9) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8, a9) (IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9)) #

type family IxValue m :: * #

Instances
type IxValue ByteString 
Instance details

Defined in Control.Lens.At

type IxValue ByteString = Word8
type IxValue ByteString 
Instance details

Defined in Control.Lens.At

type IxValue ByteString = Word8
type IxValue Text 
Instance details

Defined in Control.Lens.At

type IxValue Text = Char
type IxValue Text 
Instance details

Defined in Control.Lens.At

type IxValue Text = Char
type IxValue IntSet 
Instance details

Defined in Control.Lens.At

type IxValue IntSet = ()
type IxValue ColourMap 
Instance details

Defined in Plots.Style

type IxValue ColourMap = AlphaColour Double
type IxValue [a] 
Instance details

Defined in Control.Lens.At

type IxValue [a] = a
type IxValue (Maybe a) 
Instance details

Defined in Control.Lens.At

type IxValue (Maybe a) = a
type IxValue (Identity a) 
Instance details

Defined in Control.Lens.At

type IxValue (Identity a) = a
type IxValue (NonEmpty a) 
Instance details

Defined in Control.Lens.At

type IxValue (NonEmpty a) = a
type IxValue (IntMap a) 
Instance details

Defined in Control.Lens.At

type IxValue (IntMap a) = a
type IxValue (Tree a) 
Instance details

Defined in Control.Lens.At

type IxValue (Tree a) = a
type IxValue (Seq a) 
Instance details

Defined in Control.Lens.At

type IxValue (Seq a) = a
type IxValue (Set k) 
Instance details

Defined in Control.Lens.At

type IxValue (Set k) = ()
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (V3 a) 
Instance details

Defined in Linear.V3

type IxValue (V3 a) = a
type IxValue (V2 a) 
Instance details

Defined in Linear.V2

type IxValue (V2 a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (HashSet k) 
Instance details

Defined in Control.Lens.At

type IxValue (HashSet k) = ()
type IxValue (V1 a) 
Instance details

Defined in Linear.V1

type IxValue (V1 a) = a
type IxValue (V4 a) 
Instance details

Defined in Linear.V4

type IxValue (V4 a) = a
type IxValue (Plucker a) 
Instance details

Defined in Linear.Plucker

type IxValue (Plucker a) = a
type IxValue (Quaternion a) 
Instance details

Defined in Linear.Quaternion

type IxValue (Quaternion a) = a
type IxValue (V0 a) 
Instance details

Defined in Linear.V0

type IxValue (V0 a) = a
type IxValue (e -> a) 
Instance details

Defined in Control.Lens.At

type IxValue (e -> a) = a
type IxValue (a, a2) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2) = a
type IxValue (Map k a) 
Instance details

Defined in Control.Lens.At

type IxValue (Map k a) = a
type IxValue (UArray i e) 
Instance details

Defined in Control.Lens.At

type IxValue (UArray i e) = e
type IxValue (Array i e) 
Instance details

Defined in Control.Lens.At

type IxValue (Array i e) = e
type IxValue (Style v n) 
Instance details

Defined in Diagrams.Core.Style

type IxValue (Style v n) = Attribute v n
type IxValue (Point f a) 
Instance details

Defined in Linear.Affine

type IxValue (Point f a) = IxValue (f a)
type IxValue (HashMap k a) 
Instance details

Defined in Control.Lens.At

type IxValue (HashMap k a) = a
type IxValue (a, a2, a3) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3) = a
type IxValue (V n a) 
Instance details

Defined in Linear.V

type IxValue (V n a) = a
type IxValue (a, a2, a3, a4) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4) = a
type IxValue (a, a2, a3, a4, a5) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5) = a
type IxValue (a, a2, a3, a4, a5, a6) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6) = a
type IxValue (a, a2, a3, a4, a5, a6, a7) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7, a8) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9) = a

type family Index s :: * #

Instances
type Index ByteString 
Instance details

Defined in Control.Lens.At

type Index ByteString = Int
type Index ByteString 
Instance details

Defined in Control.Lens.At

type Index ByteString = Int64
type Index Text 
Instance details

Defined in Control.Lens.At

type Index Text = Int
type Index Text 
Instance details

Defined in Control.Lens.At

type Index Text = Int64
type Index IntSet 
Instance details

Defined in Control.Lens.At

type Index IntSet = Int
type Index ColourMap 
Instance details

Defined in Plots.Style

type Index ColourMap = Rational
type Index [a] 
Instance details

Defined in Control.Lens.At

type Index [a] = Int
type Index (Maybe a) 
Instance details

Defined in Control.Lens.At

type Index (Maybe a) = ()
type Index (Identity a) 
Instance details

Defined in Control.Lens.At

type Index (Identity a) = ()
type Index (Complex a) 
Instance details

Defined in Control.Lens.At

type Index (Complex a) = Int
type Index (NonEmpty a) 
Instance details

Defined in Control.Lens.At

type Index (NonEmpty a) = Int
type Index (IntMap a) 
Instance details

Defined in Control.Lens.At

type Index (IntMap a) = Int
type Index (Tree a) 
Instance details

Defined in Control.Lens.At

type Index (Tree a) = [Int]
type Index (Seq a) 
Instance details

Defined in Control.Lens.At

type Index (Seq a) = Int
type Index (Set a) 
Instance details

Defined in Control.Lens.At

type Index (Set a) = a
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (V3 a) 
Instance details

Defined in Linear.V3

type Index (V3 a) = E V3
type Index (V2 a) 
Instance details

Defined in Linear.V2

type Index (V2 a) = E V2
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (HashSet a) 
Instance details

Defined in Control.Lens.At

type Index (HashSet a) = a
type Index (V1 a) 
Instance details

Defined in Linear.V1

type Index (V1 a) = E V1
type Index (V4 a) 
Instance details

Defined in Linear.V4

type Index (V4 a) = E V4
type Index (Plucker a) 
Instance details

Defined in Linear.Plucker

type Index (Plucker a) = E Plucker
type Index (Quaternion a) 
Instance details

Defined in Linear.Quaternion

type Index (Quaternion a) = E Quaternion
type Index (V0 a) 
Instance details

Defined in Linear.V0

type Index (V0 a) = E V0
type Index (e -> a) 
Instance details

Defined in Control.Lens.At

type Index (e -> a) = e
type Index (a, b) 
Instance details

Defined in Control.Lens.At

type Index (a, b) = Int
type Index (Map k a) 
Instance details

Defined in Control.Lens.At

type Index (Map k a) = k
type Index (UArray i e) 
Instance details

Defined in Control.Lens.At

type Index (UArray i e) = i
type Index (Array i e) 
Instance details

Defined in Control.Lens.At

type Index (Array i e) = i
type Index (Style v n) 
Instance details

Defined in Diagrams.Core.Style

type Index (Style v n) = TypeRep
type Index (Point f a) 
Instance details

Defined in Linear.Affine

type Index (Point f a) = Index (f a)
type Index (HashMap k a) 
Instance details

Defined in Control.Lens.At

type Index (HashMap k a) = k
type Index (a, b, c) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c) = Int
type Index (V n a) 
Instance details

Defined in Linear.V

type Index (V n a) = Int
type Index (a, b, c, d) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d) = Int
type Index (a, b, c, d, e) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e) = Int
type Index (a, b, c, d, e, f) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f) = Int
type Index (a, b, c, d, e, f, g) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g) = Int
type Index (a, b, c, d, e, f, g, h) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g, h) = Int
type Index (a, b, c, d, e, f, g, h, i) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g, h, i) = Int

class Contains m where #

Minimal complete definition

contains

Methods

contains :: Index m -> Lens' m Bool #

Instances
Contains IntSet 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index IntSet -> Lens' IntSet Bool #

Ord a => Contains (Set a) 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index (Set a) -> Lens' (Set a) Bool #

(Eq a, Hashable a) => Contains (HashSet a) 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index (HashSet a) -> Lens' (HashSet a) Bool #

class Ixed m => At m where #

Minimal complete definition

at

Methods

at :: Index m -> Lens' m (Maybe (IxValue m)) #

Instances
At IntSet 
Instance details

Defined in Control.Lens.At

Methods

at :: Index IntSet -> Lens' IntSet (Maybe (IxValue IntSet)) #

At ColourMap

Nothing == transparent

Instance details

Defined in Plots.Style

Methods

at :: Index ColourMap -> Lens' ColourMap (Maybe (IxValue ColourMap)) #

At (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #

At (IntMap a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a))) #

Ord k => At (Set k) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) #

(Eq k, Hashable k) => At (HashSet k) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (HashSet k) -> Lens' (HashSet k) (Maybe (IxValue (HashSet k))) #

Ord k => At (Map k a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) #

At (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

at :: Index (Style v n) -> Lens' (Style v n) (Maybe (IxValue (Style v n))) #

(Eq k, Hashable k) => At (HashMap k a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (HashMap k a) -> Lens' (HashMap k a) (Maybe (IxValue (HashMap k a))) #

class Contravariant (f :: * -> *) where #

Minimal complete definition

contramap

Methods

contramap :: (a -> b) -> f b -> f a #

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

Instances
Contravariant SettableStateVar 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> SettableStateVar b -> SettableStateVar a #

(>$) :: b -> SettableStateVar b -> SettableStateVar a #

Contravariant Comparison 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Comparison b -> Comparison a #

(>$) :: b -> Comparison b -> Comparison a #

Contravariant Equivalence 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Equivalence b -> Equivalence a #

(>$) :: b -> Equivalence b -> Equivalence a #

Contravariant Predicate 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Predicate b -> Predicate a #

(>$) :: b -> Predicate b -> Predicate a #

Contravariant (V1 :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> V1 b -> V1 a #

(>$) :: b -> V1 b -> V1 a #

Contravariant (U1 :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> U1 b -> U1 a #

(>$) :: b -> U1 b -> U1 a #

Contravariant (Proxy :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Proxy b -> Proxy a #

(>$) :: b -> Proxy b -> Proxy a #

Contravariant m => Contravariant (MaybeT m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> MaybeT m b -> MaybeT m a #

(>$) :: b -> MaybeT m b -> MaybeT m a #

Contravariant m => Contravariant (ListT m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> ListT m b -> ListT m a #

(>$) :: b -> ListT m b -> ListT m a #

Contravariant (Op a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Op a b -> Op a a0 #

(>$) :: b -> Op a b -> Op a a0 #

Contravariant f => Contravariant (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

contramap :: (a -> b) -> Indexing f b -> Indexing f a #

(>$) :: b -> Indexing f b -> Indexing f a #

Contravariant f => Contravariant (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

contramap :: (a -> b) -> Indexing64 f b -> Indexing64 f a #

(>$) :: b -> Indexing64 f b -> Indexing64 f a #

Contravariant f => Contravariant (Rec1 f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Rec1 f b -> Rec1 f a #

(>$) :: b -> Rec1 f b -> Rec1 f a #

Contravariant (Const a :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Const a b -> Const a a0 #

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

Contravariant f => Contravariant (Alt f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Alt f b -> Alt f a #

(>$) :: b -> Alt f b -> Alt f a #

Contravariant f => Contravariant (IdentityT f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> IdentityT f b -> IdentityT f a #

(>$) :: b -> IdentityT f b -> IdentityT f a #

Contravariant m => Contravariant (ExceptT e m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> ExceptT e m b -> ExceptT e m a #

(>$) :: b -> ExceptT e m b -> ExceptT e m a #

Contravariant m => Contravariant (ErrorT e m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> ErrorT e m b -> ErrorT e m a #

(>$) :: b -> ErrorT e m b -> ErrorT e m a #

Contravariant f => Contravariant (Backwards f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Backwards f b -> Backwards f a #

(>$) :: b -> Backwards f b -> Backwards f a #

Contravariant m => Contravariant (WriterT w m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> WriterT w m b -> WriterT w m a #

(>$) :: b -> WriterT w m b -> WriterT w m a #

Contravariant m => Contravariant (StateT s m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> StateT s m b -> StateT s m a #

(>$) :: b -> StateT s m b -> StateT s m a #

Contravariant m => Contravariant (StateT s m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> StateT s m b -> StateT s m a #

(>$) :: b -> StateT s m b -> StateT s m a #

Contravariant m => Contravariant (WriterT w m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> WriterT w m b -> WriterT w m a #

(>$) :: b -> WriterT w m b -> WriterT w m a #

Contravariant f => Contravariant (Reverse f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Reverse f b -> Reverse f a #

(>$) :: b -> Reverse f b -> Reverse f a #

Contravariant (Constant a :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Constant a b -> Constant a a0 #

(>$) :: b -> Constant a b -> Constant a a0 #

Contravariant f => Contravariant (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

contramap :: (a -> b0) -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

(>$) :: b0 -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Contravariant f => Contravariant (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

contramap :: (a0 -> b) -> AlongsideRight f a b -> AlongsideRight f a a0 #

(>$) :: b -> AlongsideRight f a b -> AlongsideRight f a a0 #

Contravariant (K1 i c :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> K1 i c b -> K1 i c a #

(>$) :: b -> K1 i c b -> K1 i c a #

(Contravariant f, Contravariant g) => Contravariant (f :+: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :+: g) b -> (f :+: g) a #

(>$) :: b -> (f :+: g) b -> (f :+: g) a #

(Contravariant f, Contravariant g) => Contravariant (f :*: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :*: g) b -> (f :*: g) a #

(>$) :: b -> (f :*: g) b -> (f :*: g) a #

(Contravariant f, Contravariant g) => Contravariant (Product f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Product f g b -> Product f g a #

(>$) :: b -> Product f g b -> Product f g a #

(Contravariant f, Contravariant g) => Contravariant (Sum f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Sum f g b -> Sum f g a #

(>$) :: b -> Sum f g b -> Sum f g a #

Contravariant m => Contravariant (ReaderT r m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> ReaderT r m b -> ReaderT r m a #

(>$) :: b -> ReaderT r m b -> ReaderT r m a #

Contravariant f => Contravariant (M1 i c f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> M1 i c f b -> M1 i c f a #

(>$) :: b -> M1 i c f b -> M1 i c f a #

(Functor f, Contravariant g) => Contravariant (f :.: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :.: g) b -> (f :.: g) a #

(>$) :: b -> (f :.: g) b -> (f :.: g) a #

(Functor f, Contravariant g) => Contravariant (Compose f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Compose f g b -> Compose f g a #

(>$) :: b -> Compose f g b -> Compose f g a #

Contravariant m => Contravariant (RWST r w s m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a #

(>$) :: b -> RWST r w s m b -> RWST r w s m a #

Contravariant m => Contravariant (RWST r w s m) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a #

(>$) :: b -> RWST r w s m b -> RWST r w s m a #

(Profunctor p, Contravariant g) => Contravariant (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

contramap :: (a0 -> b0) -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

(>$) :: b0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

(Profunctor p, Contravariant g) => Contravariant (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

contramap :: (a0 -> b0) -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

(>$) :: b0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

Contravariant f => Contravariant (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

contramap :: (a0 -> b0) -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

(>$) :: b0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

(Profunctor p, Contravariant g) => Contravariant (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

contramap :: (a0 -> b0) -> PretextT p g a b b0 -> PretextT p g a b a0 #

(>$) :: b0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

traverseBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> t a -> f (t b) #

sequenceBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> t (f a) -> f (t a) #

foldMapBy :: Foldable t => (r -> r -> r) -> r -> (a -> r) -> t a -> r #

foldBy :: Foldable t => (a -> a -> a) -> a -> t a -> a #

op :: Wrapped s => (Unwrapped s -> s) -> s -> Unwrapped s #

alaf :: (Functor f, Functor g, Rewrapping s t) => (Unwrapped s -> s) -> (f t -> g s) -> f (Unwrapped t) -> g (Unwrapped s) #

ala :: (Functor f, Rewrapping s t) => (Unwrapped s -> s) -> ((Unwrapped t -> t) -> f s) -> f (Unwrapped s) #

_Wrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' s (Unwrapped s) #

_Wrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso s t (Unwrapped s) (Unwrapped t) #

_Wrapped :: Rewrapping s t => Iso s t (Unwrapped s) (Unwrapped t) #

_Unwrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' (Unwrapped s) s #

_Unwrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso (Unwrapped t) (Unwrapped s) t s #

_Unwrapped' :: Wrapped s => Iso' (Unwrapped s) s #

_Unwrapped :: Rewrapping s t => Iso (Unwrapped t) (Unwrapped s) t s #

_GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s) #

pattern Wrapped :: forall s. Rewrapped s s => Unwrapped s -> s #

pattern Unwrapped :: forall t. Rewrapped t t => t -> Unwrapped t #

_9' :: Field9 s t a b => Lens s t a b #

_8' :: Field8 s t a b => Lens s t a b #

_7' :: Field7 s t a b => Lens s t a b #

_6' :: Field6 s t a b => Lens s t a b #

_5' :: Field5 s t a b => Lens s t a b #

_4' :: Field4 s t a b => Lens s t a b #

_3' :: Field3 s t a b => Lens s t a b #

_2' :: Field2 s t a b => Lens s t a b #

_19' :: Field19 s t a b => Lens s t a b #

_18' :: Field18 s t a b => Lens s t a b #

_17' :: Field17 s t a b => Lens s t a b #

_16' :: Field16 s t a b => Lens s t a b #

_15' :: Field15 s t a b => Lens s t a b #

_14' :: Field14 s t a b => Lens s t a b #

_13' :: Field13 s t a b => Lens s t a b #

_12' :: Field12 s t a b => Lens s t a b #

_11' :: Field11 s t a b => Lens s t a b #

_10' :: Field10 s t a b => Lens s t a b #

_1' :: Field1 s t a b => Lens s t a b #

unsafeSingular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a b -> Over p f s t a b #

unsafePartsOf' :: ATraversal s t a b -> Lens s t [a] [b] #

unsafePartsOf :: Functor f => Traversing ((->) :: * -> * -> *) f s t a b -> LensLike f s t [a] [b] #

traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b #

traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b #

traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b #

traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t #

traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t #

transposeOf :: LensLike ZipList s t [a] a -> s -> [t] #

taking :: (Conjoined p, Applicative f) => Int -> Traversing p f s t a a -> Over p f s t a a #

singular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a a -> Over p f s t a a #

sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t #

sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t #

sequenceAOf :: LensLike f s t (f b) b -> s -> f t #

scanr1Of :: LensLike (Backwards (State (Maybe a))) s t a a -> (a -> a -> a) -> s -> t #

scanl1Of :: LensLike (State (Maybe a)) s t a a -> (a -> a -> a) -> s -> t #

partsOf' :: ATraversal s t a a -> Lens s t [a] [a] #

partsOf :: Functor f => Traversing ((->) :: * -> * -> *) f s t a a -> LensLike f s t [a] [a] #

mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t #

mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

loci :: Applicative f => (a -> f b) -> Bazaar ((->) :: * -> * -> *) a c s -> f (Bazaar ((->) :: * -> * -> *) b c s) #

iunsafePartsOf' :: Over (Indexed i) (Bazaar (Indexed i) a b) s t a b -> IndexedLens [i] s t [a] [b] #

iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b] #

itraverseOf :: (Indexed i a (f b) -> s -> f t) -> (i -> a -> f b) -> s -> f t #

ipartsOf' :: (Indexable [i] p, Functor f) => Over (Indexed i) (Bazaar' (Indexed i) a) s t a a -> Over p f s t [a] [a] #

ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a] #

imapMOf :: Over (Indexed i) (WrappedMonad m) s t a b -> (i -> a -> m b) -> s -> m t #

imapAccumROf :: Over (Indexed i) (Backwards (State acc)) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

imapAccumLOf :: Over (Indexed i) (State acc) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

iloci :: (Indexable i p, Applicative f) => p a (f b) -> Bazaar (Indexed i) a c s -> f (Bazaar (Indexed i) b c s) #

ignored :: Applicative f => pafb -> s -> f s #

iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t #

iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m t #

ifailover :: Alternative m => Over (Indexed i) ((,) Any) s t a b -> (i -> a -> b) -> s -> m t #

holesOf :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t #

forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m t #

failover :: Alternative m => LensLike ((,) Any) s t a b -> (a -> b) -> s -> m t #

failing :: (Conjoined p, Applicative f) => Traversing p f s t a b -> Over p f s t a b -> Over p f s t a b #

elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a #

elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a #

elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a #

element :: Traversable t => Int -> IndexedTraversal' Int (t a) a #

dropping :: (Conjoined p, Applicative f) => Int -> Over p (Indexing f) s t a a -> Over p f s t a a #

deepOf :: (Conjoined p, Applicative f) => LensLike f s t s t -> Traversing p f s t a b -> Over p f s t a b #

confusing :: Applicative f => LensLike (Curried (Yoneda f) (Yoneda f)) s t a b -> LensLike f s t a b #

cloneTraversal1 :: ATraversal1 s t a b -> Traversal1 s t a b #

cloneTraversal :: ATraversal s t a b -> Traversal s t a b #

cloneIndexedTraversal1 :: AnIndexedTraversal1 i s t a b -> IndexedTraversal1 i s t a b #

cloneIndexedTraversal :: AnIndexedTraversal i s t a b -> IndexedTraversal i s t a b #

cloneIndexPreservingTraversal1 :: ATraversal1 s t a b -> IndexPreservingTraversal1 s t a b #

cloneIndexPreservingTraversal :: ATraversal s t a b -> IndexPreservingTraversal s t a b #

both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b #

both :: Bitraversable r => Traversal (r a a) (r b b) a b #

underscoreNoPrefixNamer :: FieldNamer #

underscoreNamer :: FieldNamer #

underscoreFields :: LensRules #

simpleLenses :: Lens' LensRules Bool #

mappingNamer :: (String -> [String]) -> FieldNamer #

makeWrapped :: Name -> DecsQ #

makeLensesWith :: LensRules -> Name -> DecsQ #

makeLensesFor :: [(String, String)] -> Name -> DecsQ #

makeLenses :: Name -> DecsQ #

makeFieldsNoPrefix :: Name -> DecsQ #

makeFields :: Name -> DecsQ #

makeClassy_ :: Name -> DecsQ #

makeClassyFor :: String -> String -> [(String, String)] -> Name -> DecsQ #

makeClassy :: Name -> DecsQ #

lookingupNamer :: [(String, String)] -> FieldNamer #

lensRulesFor :: [(String, String)] -> LensRules #

lensRules :: LensRules #

lensField :: Lens' LensRules FieldNamer #

lensClass :: Lens' LensRules ClassyNamer #

generateUpdateableOptics :: Lens' LensRules Bool #

generateSignatures :: Lens' LensRules Bool #

generateLazyPatterns :: Lens' LensRules Bool #

defaultFieldRules :: LensRules #

declareWrapped :: DecsQ -> DecsQ #

declarePrisms :: DecsQ -> DecsQ #

declareLensesWith :: LensRules -> DecsQ -> DecsQ #

declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ #

declareLenses :: DecsQ -> DecsQ #

declareFields :: DecsQ -> DecsQ #

declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ #

declareClassy :: DecsQ -> DecsQ #

createClass :: Lens' LensRules Bool #

classyRules_ :: LensRules #

classyRules :: LensRules #

classUnderscoreNoPrefixNamer :: FieldNamer #

classUnderscoreNoPrefixFields :: LensRules #

camelCaseNamer :: FieldNamer #

camelCaseFields :: LensRules #

abbreviatedNamer :: FieldNamer #

abbreviatedFields :: LensRules #

(||~) :: ASetter s t Bool Bool -> Bool -> s -> t #

(||=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b #

sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b #

set' :: ASetter' s a -> a -> s -> s #

set :: ASetter s t a b -> b -> s -> t #

scribe :: (MonadWriter t m, Monoid s) => ASetter s t a b -> b -> m () #

passing :: MonadWriter w m => Setter w w u v -> m (a, u -> v) -> m a #

over :: ASetter s t a b -> (a -> b) -> s -> t #

modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

mapped :: Functor f => Setter (f a) (f b) a b #

mapOf :: ASetter s t a b -> (a -> b) -> s -> t #

lifted :: Monad m => Setter (m a) (m b) a b #

isets :: ((i -> a -> b) -> s -> t) -> IndexedSetter i s t a b #

iset :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

ipassing :: MonadWriter w m => IndexedSetter i w w u v -> m (a, i -> u -> v) -> m a #

iover :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

imodifying :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

imapOf :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

icensoring :: MonadWriter w m => IndexedSetter i w w u v -> (i -> u -> v) -> m a -> m a #

contramapped :: Contravariant f => Setter (f b) (f a) a b #

cloneSetter :: ASetter s t a b -> Setter s t a b #

cloneIndexedSetter :: AnIndexedSetter i s t a b -> IndexedSetter i s t a b #

cloneIndexPreservingSetter :: ASetter s t a b -> IndexPreservingSetter s t a b #

censoring :: MonadWriter w m => Setter w w u v -> (u -> v) -> m a -> m a #

assignA :: Arrow p => ASetter s t a b -> p s b -> p s t #

assign :: MonadState s m => ASetter s s a b -> b -> m () #

argument :: Profunctor p => Setter (p b r) (p a r) a b #

(^~) :: (Num a, Integral e) => ASetter s t a a -> e -> s -> t #

(^^~) :: (Fractional a, Integral e) => ASetter s t a a -> e -> s -> t #

(^^=) :: (MonadState s m, Fractional a, Integral e) => ASetter' s a -> e -> m () #

(^=) :: (MonadState s m, Num a, Integral e) => ASetter' s a -> e -> m () #

(?~) :: ASetter s t a (Maybe b) -> b -> s -> t #

(?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m () #

(<~) :: MonadState s m => ASetter s s a b -> m b -> m () #

(<?~) :: ASetter s t a (Maybe b) -> b -> s -> (b, t) #

(<?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m b #

(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t #

(<>=) :: (MonadState s m, Monoid a) => ASetter' s a -> a -> m () #

(<.~) :: ASetter s t a b -> b -> s -> (b, t) #

(<.=) :: MonadState s m => ASetter s s a b -> b -> m b #

(//~) :: Fractional a => ASetter s t a a -> a -> s -> t #

(//=) :: (MonadState s m, Fractional a) => ASetter' s a -> a -> m () #

(.~) :: ASetter s t a b -> b -> s -> t #

(.@~) :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

(.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m () #

(.=) :: MonadState s m => ASetter s s a b -> b -> m () #

(-~) :: Num a => ASetter s t a a -> a -> s -> t #

(-=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(+~) :: Num a => ASetter s t a a -> a -> s -> t #

(+=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(*~) :: Num a => ASetter s t a a -> a -> s -> t #

(*=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(**~) :: Floating a => ASetter s t a a -> a -> s -> t #

(**=) :: (MonadState s m, Floating a) => ASetter' s a -> a -> m () #

(&&~) :: ASetter s t Bool Bool -> Bool -> s -> t #

(&&=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

(%~) :: ASetter s t a b -> (a -> b) -> s -> t #

(%@~) :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

(%@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

(%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

unto :: (Profunctor p, Bifunctor p, Functor f) => (b -> t) -> Optic p f s t a b #

un :: (Profunctor p, Bifunctor p, Functor f) => Getting a s a -> Optic' p f a s #

reviews :: MonadReader b m => AReview t b -> (t -> r) -> m r #

review :: MonadReader b m => AReview t b -> m t #

reuses :: MonadState b m => AReview t b -> (t -> r) -> m r #

reuse :: MonadState b m => AReview t b -> m t #

re :: AReview t b -> Getter b t #

(#) :: AReview t b -> b -> t #

without :: APrism s t a b -> APrism u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d) #

withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r #

prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b #

prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b #

outside :: Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r) #

only :: Eq a => a -> Prism' a () #

nearly :: a -> (a -> Bool) -> Prism' a () #

matching :: APrism s t a b -> s -> Either t a #

isn't :: APrism s t a b -> s -> Bool #

clonePrism :: APrism s t a b -> Prism s t a b #

below :: Traversable f => APrism' s a -> Prism' (f s) (f a) #

aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b) #

_Void :: (Choice p, Applicative f) => p a (f Void) -> p s (f s) #

_Show :: (Read a, Show a) => Prism' String a #

_Right :: (Choice p, Applicative f) => p a (f b) -> p (Either c a) (f (Either c b)) #

_Nothing :: (Choice p, Applicative f) => p () (f ()) -> p (Maybe a) (f (Maybe a)) #

_Left :: (Choice p, Applicative f) => p a (f b) -> p (Either a c) (f (Either b c)) #

_Just :: (Choice p, Applicative f) => p a (f b) -> p (Maybe a) (f (Maybe b)) #

universeOnOf :: Getting [a] s a -> Getting [a] a a -> s -> [a] #

universeOn :: Plated a => Getting [a] s a -> s -> [a] #

universeOf :: Getting [a] a a -> a -> [a] #

universe :: Plated a => a -> [a] #

transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> t #

transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> t #

transformOf :: ASetter a b a b -> (b -> b) -> a -> b #

transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t #

transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m t #

transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b #

transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a #

transform :: Plated a => (a -> a) -> a -> a #

rewriteOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> Maybe a) -> s -> t #

rewriteOn :: Plated a => ASetter s t a a -> (a -> Maybe a) -> s -> t #

rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b #

rewriteMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> s -> m t #

rewriteMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m (Maybe a)) -> s -> m t #

rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b #

rewriteM :: (Monad m, Plated a) => (a -> m (Maybe a)) -> a -> m a #

rewrite :: Plated a => (a -> Maybe a) -> a -> a #

parts :: Plated a => Lens' a [a] #

paraOf :: Getting (Endo [a]) a a -> (a -> [r] -> r) -> a -> r #

para :: Plated a => (a -> [r] -> r) -> a -> r #

holesOnOf :: Conjoined p => LensLike (Bazaar p r r) s t a b -> Over p (Bazaar p r r) a b r r -> s -> [Pretext p r r t] #

holesOn :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

holes :: Plated a => a -> [Pretext ((->) :: * -> * -> *) a a a] #

gplate :: (Generic a, GPlated a (Rep a)) => Traversal' a a #

deep :: (Conjoined p, Applicative f, Plated s) => Traversing p f s s a b -> Over p f s s a b #

cosmosOnOf :: (Applicative f, Contravariant f) => LensLike' f s a -> LensLike' f a a -> LensLike' f s a #

cosmosOn :: (Applicative f, Contravariant f, Plated a) => LensLike' f s a -> LensLike' f s a #

cosmosOf :: (Applicative f, Contravariant f) => LensLike' f a a -> LensLike' f a a #

cosmos :: Plated a => Fold a a #

contextsOnOf :: ATraversal s t a a -> ATraversal' a a -> s -> [Context a a t] #

contextsOn :: Plated a => ATraversal s t a a -> s -> [Context a a t] #

contextsOf :: ATraversal' a a -> a -> [Context a a a] #

contexts :: Plated a => a -> [Context a a a] #

composOpFold :: Plated a => b -> (b -> b -> b) -> (a -> b) -> a -> b #

children :: Plated a => a -> [a] #

levels :: Applicative f => Traversing ((->) :: * -> * -> *) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b) #

ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b) #

united :: Functor f => (() -> f ()) -> a -> f a #

storing :: ALens s t a b -> b -> s -> t #

overA :: Arrow ar => LensLike (Context a b) s t a b -> ar a b -> ar s t #

locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b #

lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b #

iplens :: (s -> a) -> (s -> b -> t) -> IndexPreservingLens s t a b #

inside :: Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b) #

ilens :: (s -> (i, a)) -> (s -> b -> t) -> IndexedLens i s t a b #

fusing :: Functor f => LensLike (Yoneda f) s t a b -> LensLike f s t a b #

devoid :: Over p f Void Void a b #

cloneLens :: ALens s t a b -> Lens s t a b #

cloneIndexedLens :: AnIndexedLens i s t a b -> IndexedLens i s t a b #

cloneIndexPreservingLens :: ALens s t a b -> IndexPreservingLens s t a b #

chosen :: (Conjoined p, Functor f) => p a (f b) -> p (Either a a) (f (Either b b)) #

choosing :: Functor f => LensLike f s t a b -> LensLike f s' t' a b -> LensLike f (Either s s') (Either t t') a b #

alongside :: LensLike (AlongsideLeft f b') s t a b -> LensLike (AlongsideRight f t) s' t' a' b' -> LensLike f (s, s') (t, t') (a, a') (b, b') #

(^#) :: s -> ALens s t a b -> a #

(??) :: Functor f => f (a -> b) -> a -> f b #

(<||~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<^~) :: (Num a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<^^~) :: (Fractional a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<~) :: MonadState s m => ALens s s a b -> m b -> m b #

(<<||~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<^~) :: (Num a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<^^~) :: (Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<?~) :: LensLike ((,) a) s t a (Maybe b) -> b -> s -> (a, t) #

(<<?=) :: MonadState s m => LensLike ((,) a) s s a (Maybe b) -> b -> m a #

(<<>~) :: Monoid m => LensLike ((,) m) s t m m -> m -> s -> (m, t) #

(<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<<>~) :: Monoid r => LensLike' ((,) r) s r -> r -> s -> (r, s) #

(<<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<//~) :: Fractional a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t) #

(<<.=) :: MonadState s m => LensLike ((,) a) s s a b -> b -> m a #

(<<-~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<+~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<*~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<**~) :: Floating a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t) #

(<<%@~) :: Over (Indexed i) ((,) a) s t a b -> (i -> a -> b) -> s -> (a, t) #

(<<%@=) :: MonadState s m => IndexedLensLike i ((,) a) s s a b -> (i -> a -> b) -> m a #

(<<%=) :: (Strong p, MonadState s m) => Over p ((,) a) s s a b -> p a b -> m a #

(<//~) :: Fractional a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<-~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<+~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<*~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<**~) :: Floating a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t) #

(<%@~) :: Over (Indexed i) ((,) b) s t a b -> (i -> a -> b) -> s -> (b, t) #

(<%@=) :: MonadState s m => IndexedLensLike i ((,) b) s s a b -> (i -> a -> b) -> m b #

(<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b #

(<#~) :: ALens s t a b -> b -> s -> (b, t) #

(<#=) :: MonadState s m => ALens s s a b -> b -> m b #

(<#%~) :: ALens s t a b -> (a -> b) -> s -> (b, t) #

(<#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m b #

(&~) :: s -> State s a -> s #

(%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t #

(%%@~) :: IndexedLensLike i f s t a b -> (i -> a -> f b) -> s -> f t #

(%%@=) :: MonadState s m => IndexedLensLike i ((,) r) s s a b -> (i -> a -> (r, b)) -> m r #

(%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r #

(#~) :: ALens s t a b -> b -> s -> t #

(#=) :: MonadState s m => ALens s s a b -> b -> m () #

(#%~) :: ALens s t a b -> (a -> b) -> s -> t #

(#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m () #

(#%%~) :: Functor f => ALens s t a b -> (a -> f b) -> s -> f t #

(#%%=) :: MonadState s m => ALens s s a b -> (a -> (r, b)) -> m r #

withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r #

under :: AnIso s t a b -> (t -> s) -> b -> a #

uncurried :: (Profunctor p, Functor f) => p ((a, b) -> c) (f ((d, e) -> f)) -> p (a -> b -> c) (f (d -> e -> f)) #

seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b) #

rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b) #

reversed :: Reversing a => Iso' a a #

non' :: APrism' a () -> Iso' (Maybe a) a #

non :: Eq a => a -> Iso' (Maybe a) a #

mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b) #

lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y) #

lazy :: Strict lazy strict => Iso' strict lazy #

iso :: (s -> a) -> (b -> t) -> Iso s t a b #

involuted :: (a -> a) -> Iso' a a #

imagma :: Over (Indexed i) (Molten i a b) s t a b -> Iso s t' (Magma i t b a) (Magma j t' c c) #

from :: AnIso s t a b -> Iso b a t s #

flipped :: (Profunctor p, Functor f) => p (b -> a -> c) (f (b' -> a' -> c')) -> p (a -> b -> c) (f (a' -> b' -> c')) #

firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y) #

enum :: Enum a => Iso' Int a #

dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b') #

curried :: (Profunctor p, Functor f) => p (a -> b -> c) (f (d -> e -> f)) -> p ((a, b) -> c) (f ((d, e) -> f)) #

contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t) #

coerced :: (Coercible s a, Coercible t b) => Iso s t a b #

cloneIso :: AnIso s t a b -> Iso s t a b #

bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b') #

auf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t #

au :: Functor f => AnIso s t a b -> ((b -> t) -> f s) -> f a #

anon :: a -> (a -> Bool) -> Iso' (Maybe a) a #

pattern Swapped :: forall (p :: * -> * -> *) c d. Swapped p => p d c -> p c d #

pattern Strict :: forall s t. Strict s t => t -> s #

pattern Reversed :: forall t. Reversing t => t -> t #

pattern List :: forall l. IsList l => [Item l] -> l #

pattern Lazy :: forall t s. Strict t s => t -> s #

retagged :: (Profunctor p, Bifunctor p) => p a b -> p s b #

makePrisms :: Name -> DecsQ #

makeClassyPrisms :: Name -> DecsQ #

withIndex :: (Indexable i p, Functor f) => p (i, s) (f (j, t)) -> Indexed i s (f t) #

indexing64 :: Indexable Int64 p => ((a -> Indexing64 f b) -> s -> Indexing64 f t) -> p a (f b) -> s -> f t #

indexing :: Indexable Int p => ((a -> Indexing f b) -> s -> Indexing f t) -> p a (f b) -> s -> f t #

asIndex :: (Indexable i p, Contravariant f, Functor f) => p i (f i) -> Indexed i s (f s) #

selfIndex :: Indexable a p => p a fb -> a -> fb #

reindexed :: Indexable j p => (i -> j) -> (Indexed i a b -> r) -> p a b -> r #

none :: Foldable f => (a -> Bool) -> f a -> Bool #

itraverse_ :: (FoldableWithIndex i t, Applicative f) => (i -> a -> f b) -> t a -> f () #

itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t #

itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b) #

itoList :: FoldableWithIndex i f => f a -> [(i, a)] #

inone :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

indices :: (Indexable i p, Applicative f) => (i -> Bool) -> Optical' p (Indexed i) f a a #

index :: (Indexable i p, Eq i, Applicative f) => i -> Optical' p (Indexed i) f a a #

imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m () #

imapM :: (TraversableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m (t b) #

imapAccumR :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

imapAccumL :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f () #

iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m () #

iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b) #

ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b) #

ifoldrM :: (FoldableWithIndex i f, Monad m) => (i -> a -> b -> m b) -> b -> f a -> m b #

ifoldlM :: (FoldableWithIndex i f, Monad m) => (i -> b -> a -> m b) -> b -> f a -> m b #

ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> r #

ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> r #

ifind :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Maybe (i, a) #

iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b] #

icompose :: Indexable p c => (i -> j -> p) -> (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> c a b -> r #

iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

iall :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

(<.>) :: Indexable (i, j) p => (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> p a b -> r #

(<.) :: Indexable i p => (Indexed i s t -> r) -> ((a -> b) -> s -> t) -> p a b -> r #

(.>) :: (st -> r) -> (kab -> st) -> kab -> r #

views :: MonadReader s m => LensLike' (Const r :: * -> *) s a -> (a -> r) -> m r #

view :: MonadReader s m => Getting a s a -> m a #

uses :: MonadState s m => LensLike' (Const r :: * -> *) s a -> (a -> r) -> m r #

use :: MonadState s m => Getting a s a -> m a #

to :: (Profunctor p, Contravariant f) => (s -> a) -> Optic' p f s a #

listenings :: MonadWriter w m => Getting v w u -> (u -> v) -> m a -> m (a, v) #

listening :: MonadWriter w m => Getting u w u -> m a -> m (a, u) #

like :: (Profunctor p, Contravariant f, Functor f) => a -> Optic' p f s a #

iviews :: MonadReader s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

iview :: MonadReader s m => IndexedGetting i (i, a) s a -> m (i, a) #

iuses :: MonadState s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

iuse :: MonadState s m => IndexedGetting i (i, a) s a -> m (i, a) #

ito :: (Indexable i p, Contravariant f) => (s -> (i, a)) -> Over' p f s a #

ilistenings :: MonadWriter w m => IndexedGetting i v w u -> (i -> u -> v) -> m a -> m (a, v) #

ilistening :: MonadWriter w m => IndexedGetting i (i, u) w u -> m a -> m (a, (i, u)) #

ilike :: (Indexable i p, Contravariant f, Functor f) => i -> a -> Over' p f s a #

getting :: (Profunctor p, Profunctor q, Functor f, Contravariant f) => Optical p q f s t a b -> Optical' p q f s a #

(^@.) :: s -> IndexedGetting i (i, a) s a -> (i, a) #

(^.) :: s -> Getting a s a -> a #

worded :: Applicative f => IndexedLensLike' Int f String String #

unfolded :: (b -> Maybe (a, b)) -> Fold b a #

traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f () #

traverse1Of_ :: Functor f => Getting (TraversedF r f) s a -> (a -> f r) -> s -> f () #

toNonEmptyOf :: Getting (NonEmptyDList a) s a -> s -> NonEmpty a #

toListOf :: Getting (Endo [a]) s a -> s -> [a] #

takingWhile :: (Conjoined p, Applicative f) => (a -> Bool) -> Over p (TakingWhile p f a a) s t a a -> Over p f s t a a #

sumOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m () #

sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f () #

sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f () #

replicated :: Int -> Fold a a #

repeated :: Apply f => LensLike' f a a #

productOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

previews :: MonadReader s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a) #

preuses :: MonadState s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a) #

pre :: Getting (First a) s a -> IndexPreservingGetter s (Maybe a) #

orOf :: Getting Any s Bool -> s -> Bool #

nullOf :: Getting All s a -> s -> Bool #

notNullOf :: Getting Any s a -> s -> Bool #

notElemOf :: Eq a => Getting All s a -> a -> s -> Bool #

noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a #

minimumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

minimumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

minimum1Of :: Ord a => Getting (Min a) s a -> s -> a #

maximumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

maximumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

maximum1Of :: Ord a => Getting (Max a) s a -> s -> a #

mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m () #

lookupOf :: Eq k => Getting (Endo (Maybe v)) s (k, v) -> k -> s -> Maybe v #

lined :: Applicative f => IndexedLensLike' Int f String String #

lengthOf :: Getting (Endo (Endo Int)) s a -> s -> Int #

lastOf :: Getting (Rightmost a) s a -> s -> Maybe a #

last1Of :: Getting (Last a) s a -> s -> a #

itraverseOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> (i -> a -> f r) -> s -> f () #

itoListOf :: IndexedGetting i (Endo [(i, a)]) s a -> s -> [(i, a)] #

iterated :: Apply f => (a -> a) -> LensLike' f a a #

itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: * -> *) s a -> Optical' p q f s a #

ipreviews :: MonadReader s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

ipreview :: MonadReader s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipreuses :: MonadState s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

ipreuse :: MonadState s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipre :: IndexedGetting i (First (i, a)) s a -> IndexPreservingGetter s (Maybe (i, a)) #

inoneOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

imapMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> (i -> a -> m r) -> s -> m () #

iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f () #

iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m () #

ifoldring :: (Indexable i p, Contravariant f, Applicative f) => ((i -> a -> f a -> f a) -> f a -> s -> f a) -> Over p f s t a b #

ifoldrOf' :: IndexedGetting i (Dual (Endo (r -> r))) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldrOf :: IndexedGetting i (Endo r) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldrMOf :: Monad m => IndexedGetting i (Dual (Endo (r -> m r))) s a -> (i -> a -> r -> m r) -> r -> s -> m r #

ifoldlOf' :: IndexedGetting i (Endo (r -> r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldlOf :: IndexedGetting i (Dual (Endo r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldlMOf :: Monad m => IndexedGetting i (Endo (r -> m r)) s a -> (i -> r -> a -> m r) -> r -> s -> m r #

ifolding :: (Foldable f, Indexable i p, Contravariant g, Applicative g) => (s -> f (i, a)) -> Over p g s t a b #

ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m #

ifindOf :: IndexedGetting i (Endo (Maybe a)) s a -> (i -> a -> Bool) -> s -> Maybe a #

ifindMOf :: Monad m => IndexedGetting i (Endo (m (Maybe a))) s a -> (i -> a -> m Bool) -> s -> m (Maybe a) #

ifiltered :: (Indexable i p, Applicative f) => (i -> a -> Bool) -> Optical' p (Indexed i) f a a #

idroppingWhile :: (Indexable i p, Profunctor q, Applicative f) => (i -> a -> Bool) -> Optical (Indexed i) q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r] #

ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

iallOf :: IndexedGetting i All s a -> (i -> a -> Bool) -> s -> Bool #

hasn't :: Getting All s a -> s -> Bool #

has :: Getting Any s a -> s -> Bool #

forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f () #

forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m () #

for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f () #

foldring :: (Contravariant f, Applicative f) => ((a -> f a -> f a) -> f a -> s -> f a) -> LensLike f s t a b #

foldrOf' :: Getting (Dual (Endo (Endo r))) s a -> (a -> r -> r) -> r -> s -> r #

foldrOf :: Getting (Endo r) s a -> (a -> r -> r) -> r -> s -> r #

foldrMOf :: Monad m => Getting (Dual (Endo (r -> m r))) s a -> (a -> r -> m r) -> r -> s -> m r #

foldr1Of' :: HasCallStack => Getting (Dual (Endo (Endo (Maybe a)))) s a -> (a -> a -> a) -> s -> a #

foldr1Of :: HasCallStack => Getting (Endo (Maybe a)) s a -> (a -> a -> a) -> s -> a #

foldlOf' :: Getting (Endo (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldlOf :: Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldlMOf :: Monad m => Getting (Endo (r -> m r)) s a -> (r -> a -> m r) -> r -> s -> m r #

foldl1Of' :: HasCallStack => Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

foldl1Of :: HasCallStack => Getting (Dual (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

folding :: Foldable f => (s -> f a) -> Fold s a #

folded64 :: Foldable f => IndexedFold Int64 (f a) a #

folded :: Foldable f => IndexedFold Int (f a) a #

foldOf :: Getting a s a -> s -> a #

foldMapOf :: Getting r s a -> (a -> r) -> s -> r #

foldMapByOf :: Fold s a -> (r -> r -> r) -> r -> (a -> r) -> s -> r #

foldByOf :: Fold s a -> (a -> a -> a) -> a -> s -> a #

firstOf :: Getting (Leftmost a) s a -> s -> Maybe a #

first1Of :: Getting (First a) s a -> s -> a #

findOf :: Getting (Endo (Maybe a)) s a -> (a -> Bool) -> s -> Maybe a #

findMOf :: Monad m => Getting (Endo (m (Maybe a))) s a -> (a -> m Bool) -> s -> m (Maybe a) #

findIndicesOf :: IndexedGetting i (Endo [i]) s a -> (a -> Bool) -> s -> [i] #

findIndexOf :: IndexedGetting i (First i) s a -> (a -> Bool) -> s -> Maybe i #

filtered :: (Choice p, Applicative f) => (a -> Bool) -> Optic' p f a a #

elemOf :: Eq a => Getting Any s a -> a -> s -> Bool #

elemIndicesOf :: Eq a => IndexedGetting i (Endo [i]) s a -> a -> s -> [i] #

elemIndexOf :: Eq a => IndexedGetting i (First i) s a -> a -> s -> Maybe i #

droppingWhile :: (Conjoined p, Profunctor q, Applicative f) => (a -> Bool) -> Optical p q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

cycled :: Apply f => LensLike f s t a b -> LensLike f s t a b #

concatOf :: Getting [r] s [r] -> s -> [r] #

concatMapOf :: Getting [r] s a -> (a -> [r]) -> s -> [r] #

backwards :: (Profunctor p, Profunctor q) => Optical p q (Backwards f) s t a b -> Optical p q f s t a b #

asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a #

anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

andOf :: Getting All s Bool -> s -> Bool #

allOf :: Getting All s a -> (a -> Bool) -> s -> Bool #

(^@?!) :: HasCallStack => s -> IndexedGetting i (Endo (i, a)) s a -> (i, a) #

(^@?) :: s -> IndexedGetting i (Endo (Maybe (i, a))) s a -> Maybe (i, a) #

(^@..) :: s -> IndexedGetting i (Endo [(i, a)]) s a -> [(i, a)] #

(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a #

(^?) :: s -> Getting (First a) s a -> Maybe a #

(^..) :: s -> Getting (Endo [a]) s a -> [a] #

substEq :: AnEquality s t a b -> ((s ~ a) -> (t ~ b) -> r) -> r #

simply :: (Optic' p f s a -> r) -> Optic' p f s a -> r #

simple :: p a (f a) -> p a (f a) #

runEq :: AnEquality s t a b -> Identical s t a b #

mapEq :: AnEquality s t a b -> f s -> f a #

fromEq :: AnEquality s t a b -> Equality b a t s #

pattern Empty :: forall s. AsEmpty s => s #

(|>) :: Snoc s s a a => s -> a -> s #

unsnoc :: Snoc s s a a => s -> Maybe (s, a) #

uncons :: Cons s s a a => s -> Maybe (a, s) #

snoc :: Snoc s s a a => s -> a -> s #

cons :: Cons s s a a => a -> s -> s #

_tail :: Cons s s a a => Traversal' s s #

_last :: Snoc s s a a => Traversal' s a #

_init :: Snoc s s a a => Traversal' s s #

_head :: Cons s s a a => Traversal' s a #

(<|) :: Cons s s a a => a -> s -> s #

pattern (:>) :: forall a b. Snoc a a b b => a -> b -> a #

pattern (:<) :: forall b a. Cons b b a a => a -> b -> b #

sans :: At m => Index m -> m -> m #

ixAt :: At m => Index m -> Traversal' m (IxValue m) #

iix :: Ixed m => Index m -> IndexedTraversal' (Index m) m (IxValue m) #

icontains :: Contains m => Index m -> IndexedLens' (Index m) m Bool #

iat :: At m => Index m -> IndexedLens' (Index m) m (Maybe (IxValue m)) #

class Default a where #

A class for types with a default value.

Methods

def :: a #

The default value for this type.

Instances
Default Double 
Instance details

Defined in Data.Default.Class

Methods

def :: Double #

Default Float 
Instance details

Defined in Data.Default.Class

Methods

def :: Float #

Default Int 
Instance details

Defined in Data.Default.Class

Methods

def :: Int #

Default Int8 
Instance details

Defined in Data.Default.Class

Methods

def :: Int8 #

Default Int16 
Instance details

Defined in Data.Default.Class

Methods

def :: Int16 #

Default Int32 
Instance details

Defined in Data.Default.Class

Methods

def :: Int32 #

Default Int64 
Instance details

Defined in Data.Default.Class

Methods

def :: Int64 #

Default Integer 
Instance details

Defined in Data.Default.Class

Methods

def :: Integer #

Default Ordering 
Instance details

Defined in Data.Default.Class

Methods

def :: Ordering #

Default Word 
Instance details

Defined in Data.Default.Class

Methods

def :: Word #

Default Word8 
Instance details

Defined in Data.Default.Class

Methods

def :: Word8 #

Default Word16 
Instance details

Defined in Data.Default.Class

Methods

def :: Word16 #

Default Word32 
Instance details

Defined in Data.Default.Class

Methods

def :: Word32 #

Default Word64 
Instance details

Defined in Data.Default.Class

Methods

def :: Word64 #

Default () 
Instance details

Defined in Data.Default.Class

Methods

def :: () #

Default CState 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

def :: CState #

Default VectorStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: VectorStyle #

Default AxisVisibility

By default all parts of a axis are visible.

Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisVisibility #

Default AxisStyle 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisStyle #

Default LegendStyle 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

def :: LegendStyle #

Default PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieLayout #

Default PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieChart #

Default PieItem 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieItem #

Default Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

def :: Rectangle #

Default PointStyle

Default style to use for points.

Instance details

Defined in Graphics.Rendering.Chart.Drawing

Methods

def :: PointStyle #

Default LineStyle

The default line style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: LineStyle #

Default FontSlant

The default font slant.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontSlant #

Default FontWeight

The default font weight.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontWeight #

Default FontStyle

The default font style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontStyle #

Default FillStyle

The default fill style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FillStyle #

Default FileOptions 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Cairo

Methods

def :: FileOptions #

Default All 
Instance details

Defined in Data.Default.Class

Methods

def :: All #

Default Any 
Instance details

Defined in Data.Default.Class

Methods

def :: Any #

Default CShort 
Instance details

Defined in Data.Default.Class

Methods

def :: CShort #

Default CUShort 
Instance details

Defined in Data.Default.Class

Methods

def :: CUShort #

Default CInt 
Instance details

Defined in Data.Default.Class

Methods

def :: CInt #

Default CUInt 
Instance details

Defined in Data.Default.Class

Methods

def :: CUInt #

Default CLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CLong #

Default CULong 
Instance details

Defined in Data.Default.Class

Methods

def :: CULong #

Default CLLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CLLong #

Default CULLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CULLong #

Default CFloat 
Instance details

Defined in Data.Default.Class

Methods

def :: CFloat #

Default CDouble 
Instance details

Defined in Data.Default.Class

Methods

def :: CDouble #

Default CPtrdiff 
Instance details

Defined in Data.Default.Class

Methods

def :: CPtrdiff #

Default CSize 
Instance details

Defined in Data.Default.Class

Methods

def :: CSize #

Default CSigAtomic 
Instance details

Defined in Data.Default.Class

Methods

def :: CSigAtomic #

Default CClock 
Instance details

Defined in Data.Default.Class

Methods

def :: CClock #

Default CTime 
Instance details

Defined in Data.Default.Class

Methods

def :: CTime #

Default CUSeconds 
Instance details

Defined in Data.Default.Class

Methods

def :: CUSeconds #

Default CSUSeconds 
Instance details

Defined in Data.Default.Class

Methods

def :: CSUSeconds #

Default CIntPtr 
Instance details

Defined in Data.Default.Class

Methods

def :: CIntPtr #

Default CUIntPtr 
Instance details

Defined in Data.Default.Class

Methods

def :: CUIntPtr #

Default CIntMax 
Instance details

Defined in Data.Default.Class

Methods

def :: CIntMax #

Default CUIntMax 
Instance details

Defined in Data.Default.Class

Methods

def :: CUIntMax #

Default NormalisationMethod 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: NormalisationMethod #

Default AxisLineType 
Instance details

Defined in Plots.Axis.Line

Methods

def :: AxisLineType #

Default LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: LogScale #

Default FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

def :: FillRule #

Default CairoState 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

def :: CairoState #

Default FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontSlant #

Default FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontWeight #

Default [a] 
Instance details

Defined in Data.Default.Class

Methods

def :: [a] #

Default (Maybe a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Maybe a #

Integral a => Default (Ratio a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Ratio a #

Default a => Default (IO a) 
Instance details

Defined in Data.Default.Class

Methods

def :: IO a #

PlotValue t => Default (LayoutAxis t) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutAxis t #

Default (StackedLayouts x)

A empty StackedLayout with compressions applied.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: StackedLayouts x #

(Show a, RealFloat a) => Default (LinearAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LinearAxisParams a #

(Show a, RealFloat a) => Default (LogAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LogAxisParams a #

(Default a, RealFloat a) => Default (Complex a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Complex a #

Default (First a) 
Instance details

Defined in Data.Default.Class

Methods

def :: First a #

Default (Last a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Last a #

Default a => Default (Dual a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Dual a #

Default (Endo a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Endo a #

Num a => Default (Sum a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Sum a #

Num a => Default (Product a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Product a #

Fractional n => Default (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

def :: BarLayout n #

Default (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: HistogramOptions n #

Fractional n => Default (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: AxisScaling n #

TypeableFloat n => Default (ArrowOpts n) 
Instance details

Defined in Diagrams.TwoD.Arrow

Methods

def :: ArrowOpts n #

OrderedField n => Default (EnvelopeOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: EnvelopeOpts n #

Fractional n => Default (OriginOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: OriginOpts n #

Floating n => Default (TraceOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: TraceOpts n #

Default (StrokeOpts a) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

def :: StrokeOpts a #

Num n => Default (PolygonOpts n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

def :: PolygonOpts n #

Num d => Default (RoundedRectOpts d) 
Instance details

Defined in Diagrams.TwoD.Shapes

Methods

def :: RoundedRectOpts d #

Default (FillTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

def :: FillTexture n #

Default (LineTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

def :: LineTexture n #

Num n => Default (FontSizeM n) 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontSizeM n #

Default r => Default (e -> r) 
Instance details

Defined in Data.Default.Class

Methods

def :: e -> r #

(Default a, Default b) => Default (a, b) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b) #

(PlotValue x, PlotValue y) => Default (Layout x y)

Empty Layout without title and plots. The background is white and - the grid is drawn beneath all plots. There will be a legend. The top - and right axis will not be visible.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: Layout x y #

Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

BarsPlotValue y => Default (PlotBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

def :: PlotBars x y #

Default (PlotVectors x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: PlotVectors x y #

Default (PlotAnnotation x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

def :: PlotAnnotation x y #

Default (PlotCandle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

def :: PlotCandle x y #

Default (PlotErrBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

def :: PlotErrBars x y #

Default (PlotFillBetween x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

def :: PlotFillBetween x y #

Default (PlotLines x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

def :: PlotLines x y #

Default (PlotPoints x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

def :: PlotPoints x y #

TypeableFloat n => Default (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MajorTicks v n #

TypeableFloat n => Default (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MinorTicks v n #

TypeableFloat n => Default (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: Ticks v n #

(Typeable n, Floating n) => Default (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MajorGridLines v n #

(Typeable n, Floating n) => Default (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MinorGridLines v n #

(Typeable n, Floating n) => Default (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: GridLines v n #

Typeable n => Default (AxisLine v n) 
Instance details

Defined in Plots.Axis.Line

Methods

def :: AxisLine v n #

(TypeableFloat n, Renderable (Text n) b) => Default (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

def :: Legend b n #

(Default a, Default b, Default c) => Default (a, b, c) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c) #

(PlotValue x, PlotValue y1, PlotValue y2) => Default (LayoutLR x y1 y2)

Empty LayoutLR without title and plots. The background is white and - the grid is drawn beneath all plots. There will be a legend. The top - axis will not be visible.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutLR x y1 y2 #

Default (AreaSpots z x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots z x y #

(TypeableFloat n, Renderable (Text n) b) => Default (SingleAxis b V2 n) 
Instance details

Defined in Plots.Axis

Methods

def :: SingleAxis b V2 n #

(TypeableFloat n, Renderable (Text n) b) => Default (AxisLabel b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: AxisLabel b V2 n #

(TypeableFloat n, Renderable (Text n) b) => Default (TickLabels b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: TickLabels b V2 n #

(Renderable (Text n) b, TypeableFloat n) => Default (Title b V2 n) 
Instance details

Defined in Plots.Axis.Title

Methods

def :: Title b V2 n #

(Additive v, Num n) => Default (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotMods b v n #

Default (LegendPic b v n) 
Instance details

Defined in Plots.Types

Methods

def :: LegendPic b v n #

(Additive v, Num n) => Default (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotOptions b v n #

(Default a, Default b, Default c, Default d) => Default (a, b, c, d) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d) #

Default (AreaSpots4D z t x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots4D z t x y #

(Default a, Default b, Default c, Default d, Default e) => Default (a, b, c, d, e) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e) #

(Default a, Default b, Default c, Default d, Default e, Default f) => Default (a, b, c, d, e, f) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e, f) #

(Default a, Default b, Default c, Default d, Default e, Default f, Default g) => Default (a, b, c, d, e, f, g) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e, f, g) #

readColourName :: (Monad m, Ord a, Floating a) => String -> m (Colour a) #

aliceblue :: (Ord a, Floating a) => Colour a #

antiquewhite :: (Ord a, Floating a) => Colour a #

aqua :: (Ord a, Floating a) => Colour a #

aquamarine :: (Ord a, Floating a) => Colour a #

azure :: (Ord a, Floating a) => Colour a #

beige :: (Ord a, Floating a) => Colour a #

bisque :: (Ord a, Floating a) => Colour a #

blanchedalmond :: (Ord a, Floating a) => Colour a #

blue :: (Ord a, Floating a) => Colour a #

blueviolet :: (Ord a, Floating a) => Colour a #

brown :: (Ord a, Floating a) => Colour a #

burlywood :: (Ord a, Floating a) => Colour a #

cadetblue :: (Ord a, Floating a) => Colour a #

chartreuse :: (Ord a, Floating a) => Colour a #

chocolate :: (Ord a, Floating a) => Colour a #

coral :: (Ord a, Floating a) => Colour a #

cornflowerblue :: (Ord a, Floating a) => Colour a #

cornsilk :: (Ord a, Floating a) => Colour a #

crimson :: (Ord a, Floating a) => Colour a #

cyan :: (Ord a, Floating a) => Colour a #

darkblue :: (Ord a, Floating a) => Colour a #

darkcyan :: (Ord a, Floating a) => Colour a #

darkgoldenrod :: (Ord a, Floating a) => Colour a #

darkgray :: (Ord a, Floating a) => Colour a #

darkgreen :: (Ord a, Floating a) => Colour a #

darkgrey :: (Ord a, Floating a) => Colour a #

darkkhaki :: (Ord a, Floating a) => Colour a #

darkmagenta :: (Ord a, Floating a) => Colour a #

darkolivegreen :: (Ord a, Floating a) => Colour a #

darkorange :: (Ord a, Floating a) => Colour a #

darkorchid :: (Ord a, Floating a) => Colour a #

darkred :: (Ord a, Floating a) => Colour a #

darksalmon :: (Ord a, Floating a) => Colour a #

darkseagreen :: (Ord a, Floating a) => Colour a #

darkslateblue :: (Ord a, Floating a) => Colour a #

darkslategray :: (Ord a, Floating a) => Colour a #

darkslategrey :: (Ord a, Floating a) => Colour a #

darkturquoise :: (Ord a, Floating a) => Colour a #

darkviolet :: (Ord a, Floating a) => Colour a #

deeppink :: (Ord a, Floating a) => Colour a #

deepskyblue :: (Ord a, Floating a) => Colour a #

dimgray :: (Ord a, Floating a) => Colour a #

dimgrey :: (Ord a, Floating a) => Colour a #

dodgerblue :: (Ord a, Floating a) => Colour a #

firebrick :: (Ord a, Floating a) => Colour a #

floralwhite :: (Ord a, Floating a) => Colour a #

forestgreen :: (Ord a, Floating a) => Colour a #

fuchsia :: (Ord a, Floating a) => Colour a #

gainsboro :: (Ord a, Floating a) => Colour a #

ghostwhite :: (Ord a, Floating a) => Colour a #

gold :: (Ord a, Floating a) => Colour a #

goldenrod :: (Ord a, Floating a) => Colour a #

gray :: (Ord a, Floating a) => Colour a #

grey :: (Ord a, Floating a) => Colour a #

green :: (Ord a, Floating a) => Colour a #

greenyellow :: (Ord a, Floating a) => Colour a #

honeydew :: (Ord a, Floating a) => Colour a #

hotpink :: (Ord a, Floating a) => Colour a #

indianred :: (Ord a, Floating a) => Colour a #

indigo :: (Ord a, Floating a) => Colour a #

ivory :: (Ord a, Floating a) => Colour a #

khaki :: (Ord a, Floating a) => Colour a #

lavender :: (Ord a, Floating a) => Colour a #

lavenderblush :: (Ord a, Floating a) => Colour a #

lawngreen :: (Ord a, Floating a) => Colour a #

lemonchiffon :: (Ord a, Floating a) => Colour a #

lightblue :: (Ord a, Floating a) => Colour a #

lightcoral :: (Ord a, Floating a) => Colour a #

lightcyan :: (Ord a, Floating a) => Colour a #

lightgoldenrodyellow :: (Ord a, Floating a) => Colour a #

lightgray :: (Ord a, Floating a) => Colour a #

lightgreen :: (Ord a, Floating a) => Colour a #

lightgrey :: (Ord a, Floating a) => Colour a #

lightpink :: (Ord a, Floating a) => Colour a #

lightsalmon :: (Ord a, Floating a) => Colour a #

lightseagreen :: (Ord a, Floating a) => Colour a #

lightskyblue :: (Ord a, Floating a) => Colour a #

lightslategray :: (Ord a, Floating a) => Colour a #

lightslategrey :: (Ord a, Floating a) => Colour a #

lightsteelblue :: (Ord a, Floating a) => Colour a #

lightyellow :: (Ord a, Floating a) => Colour a #

lime :: (Ord a, Floating a) => Colour a #

limegreen :: (Ord a, Floating a) => Colour a #

linen :: (Ord a, Floating a) => Colour a #

magenta :: (Ord a, Floating a) => Colour a #

maroon :: (Ord a, Floating a) => Colour a #

mediumaquamarine :: (Ord a, Floating a) => Colour a #

mediumblue :: (Ord a, Floating a) => Colour a #

mediumorchid :: (Ord a, Floating a) => Colour a #

mediumpurple :: (Ord a, Floating a) => Colour a #

mediumseagreen :: (Ord a, Floating a) => Colour a #

mediumslateblue :: (Ord a, Floating a) => Colour a #

mediumspringgreen :: (Ord a, Floating a) => Colour a #

mediumturquoise :: (Ord a, Floating a) => Colour a #

mediumvioletred :: (Ord a, Floating a) => Colour a #

midnightblue :: (Ord a, Floating a) => Colour a #

mintcream :: (Ord a, Floating a) => Colour a #

mistyrose :: (Ord a, Floating a) => Colour a #

moccasin :: (Ord a, Floating a) => Colour a #

navajowhite :: (Ord a, Floating a) => Colour a #

navy :: (Ord a, Floating a) => Colour a #

oldlace :: (Ord a, Floating a) => Colour a #

olive :: (Ord a, Floating a) => Colour a #

olivedrab :: (Ord a, Floating a) => Colour a #

orange :: (Ord a, Floating a) => Colour a #

orangered :: (Ord a, Floating a) => Colour a #

orchid :: (Ord a, Floating a) => Colour a #

palegoldenrod :: (Ord a, Floating a) => Colour a #

palegreen :: (Ord a, Floating a) => Colour a #

paleturquoise :: (Ord a, Floating a) => Colour a #

palevioletred :: (Ord a, Floating a) => Colour a #

papayawhip :: (Ord a, Floating a) => Colour a #

peachpuff :: (Ord a, Floating a) => Colour a #

peru :: (Ord a, Floating a) => Colour a #

pink :: (Ord a, Floating a) => Colour a #

plum :: (Ord a, Floating a) => Colour a #

powderblue :: (Ord a, Floating a) => Colour a #

purple :: (Ord a, Floating a) => Colour a #

red :: (Ord a, Floating a) => Colour a #

rosybrown :: (Ord a, Floating a) => Colour a #

royalblue :: (Ord a, Floating a) => Colour a #

saddlebrown :: (Ord a, Floating a) => Colour a #

salmon :: (Ord a, Floating a) => Colour a #

sandybrown :: (Ord a, Floating a) => Colour a #

seagreen :: (Ord a, Floating a) => Colour a #

seashell :: (Ord a, Floating a) => Colour a #

sienna :: (Ord a, Floating a) => Colour a #

silver :: (Ord a, Floating a) => Colour a #

skyblue :: (Ord a, Floating a) => Colour a #

slateblue :: (Ord a, Floating a) => Colour a #

slategray :: (Ord a, Floating a) => Colour a #

slategrey :: (Ord a, Floating a) => Colour a #

snow :: (Ord a, Floating a) => Colour a #

springgreen :: (Ord a, Floating a) => Colour a #

steelblue :: (Ord a, Floating a) => Colour a #

tan :: (Ord a, Floating a) => Colour a #

teal :: (Ord a, Floating a) => Colour a #

thistle :: (Ord a, Floating a) => Colour a #

tomato :: (Ord a, Floating a) => Colour a #

turquoise :: (Ord a, Floating a) => Colour a #

violet :: (Ord a, Floating a) => Colour a #

wheat :: (Ord a, Floating a) => Colour a #

white :: (Ord a, Floating a) => Colour a #

whitesmoke :: (Ord a, Floating a) => Colour a #

yellow :: (Ord a, Floating a) => Colour a #

yellowgreen :: (Ord a, Floating a) => Colour a #

(<&>) :: Functor f => f a -> (a -> b) -> f b infixl 1 #

Flipped version of <$>.

(<&>) = flip fmap
-

Examples

Expand

Apply (+1) to a list, a Just and a Right:

>>> Just 2 <&> (+1)
-Just 3
-
>>> [1,2,3] <&> (+1)
-[2,3,4]
-
>>> Right 3 <&> (+1)
-Right 4
-

Since: base-4.11.0.0

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational - convenience. Its precedence is one higher than that of the forward - application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
-"6"
-

Since: base-4.8.0.0

newtype Const a (b :: k) :: forall k. * -> k -> * #

The Const functor.

Constructors

Const 

Fields

Instances
Generic1 (Const a :: k -> *) 
Instance details

Defined in Data.Functor.Const

Associated Types

type Rep1 (Const a) :: k -> * #

Methods

from1 :: Const a a0 -> Rep1 (Const a) a0 #

to1 :: Rep1 (Const a) a0 -> Const a a0 #

Bifunctor (Const :: * -> * -> *)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

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

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

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

Bitraversable (Const :: * -> * -> *)

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) #

Bifoldable (Const :: * -> * -> *)

Since: base-4.10.0.0

Instance details

Defined in Data.Bifoldable

Methods

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

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

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

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

Eq2 (Const :: * -> * -> *)

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 #

Ord2 (Const :: * -> * -> *)

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 #

Read2 (Const :: * -> * -> *)

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) #

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

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

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

Show2 (Const :: * -> * -> *)

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 #

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

NFData2 (Const :: * -> * -> *)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

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

Biapplicative (Const :: * -> * -> *) 
Instance details

Defined in Data.Biapplicative

Methods

bipure :: a -> b -> Const a b

(<<*>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d

biliftA2 :: (a -> b -> c) -> (d -> e -> f) -> Const a d -> Const b e -> Const c f

(*>>) :: Const a b -> Const c d -> Const c d

(<<*) :: Const a b -> Const c d -> Const a b

Hashable2 (Const :: * -> * -> *) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Const a b -> Int

Bitraversable1 (Const :: * -> * -> *) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Const a c -> f (Const b d)

bisequence1 :: Apply f => Const (f a) (f b) -> f (Const a b)

Biapply (Const :: * -> * -> *) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<<.>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d

(.>>) :: Const a b -> Const c d -> Const c d

(<<.) :: Const a b -> Const c d -> Const a b

Functor (Const m :: * -> *)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

Since: base-2.0.1

Instance details

Defined in Data.Functor.Const

Methods

pure :: a -> Const m a #

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

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

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

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

Foldable (Const m :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

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

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

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

null :: Const m a -> Bool #

length :: Const m a -> Int #

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

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

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

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

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

Traversable (Const m :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Contravariant (Const a :: * -> *) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Const a b -> Const a a0 #

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

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

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 #

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

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 #

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

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) #

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

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

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

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

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 #

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

NFData a => NFData1 (Const a :: * -> *)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a0 -> ()) -> Const a a0 -> () #

Hashable a => Hashable1 (Const a :: * -> *) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Const a a0 -> Int

Semigroup m => Apply (Const m :: * -> *) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Const m (a -> b) -> Const m a -> Const m b

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

(<.) :: Const m a -> Const m b -> Const m a

liftF2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c

Bounded a => Bounded (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

minBound :: Const a b #

maxBound :: Const a b #

Enum a => Enum (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

toEnum :: Int -> Const a b #

fromEnum :: Const a b -> Int #

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

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

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

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

Eq a => Eq (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

Floating a => Floating (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

pi :: Const a b #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Fractional a => Fractional (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

fromRational :: Rational -> Const a b #

Integral a => Integral (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

toInteger :: Const a b -> Integer #

Num a => Num (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

fromInteger :: Integer -> Const a b #

Ord a => Ord (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

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

Read a => Read (Const a b)

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

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

readList :: ReadS [Const a b] #

readPrec :: ReadPrec (Const a b) #

readListPrec :: ReadPrec [Const a b] #

Real a => Real (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

toRational :: Const a b -> Rational #

RealFloat a => RealFloat (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer #

floatDigits :: Const a b -> Int #

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

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

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

exponent :: Const a b -> Int #

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

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

isNaN :: Const a b -> Bool #

isInfinite :: Const a b -> Bool #

isDenormalized :: Const a b -> Bool #

isNegativeZero :: Const a b -> Bool #

isIEEE :: Const a b -> Bool #

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

RealFrac a => RealFrac (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

Show a => Show (Const a b)

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

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

show :: Const a b -> String #

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

Ix a => Ix (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

IsString a => IsString (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.String

Methods

fromString :: String -> Const a b #

Generic (Const a b) 
Instance details

Defined in Data.Functor.Const

Associated Types

type Rep (Const a b) :: * -> * #

Methods

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

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

Semigroup a => Semigroup (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

Monoid a => Monoid (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

mempty :: Const a b #

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

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

Wrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Const a x) :: * #

Methods

_Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #

NFData a => NFData (Const a b)

Since: deepseq-1.4.0.0

Instance details

Defined in Control.DeepSeq

Methods

rnf :: Const a b -> () #

Storable a => Storable (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

sizeOf :: Const a b -> Int #

alignment :: Const a b -> Int #

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

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

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

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

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

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

Bits a => Bits (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

zeroBits :: Const a b #

bit :: Int -> Const a b #

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

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

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

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

bitSizeMaybe :: Const a b -> Maybe Int #

bitSize :: Const a b -> Int #

isSigned :: Const a b -> Bool #

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

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

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

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

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

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

popCount :: Const a b -> Int #

FiniteBits a => FiniteBits (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

finiteBitSize :: Const a b -> Int #

countLeadingZeros :: Const a b -> Int #

countTrailingZeros :: Const a b -> Int #

Newtype (Const a x) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Const a x) :: * #

Methods

pack :: O (Const a x) -> Const a x #

unpack :: Const a x -> O (Const a x) #

Hashable a => Hashable (Const a b) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Const a b -> Int

hash :: Const a b -> Int

t ~ Const a' x' => Rewrapped (Const a x) t 
Instance details

Defined in Control.Lens.Wrapped

type Rep1 (Const a :: k -> *) 
Instance details

Defined in Data.Functor.Const

type Rep1 (Const a :: k -> *) = D1 (MetaData "Const" "Data.Functor.Const" "base" True) (C1 (MetaCons "Const" PrefixI True) (S1 (MetaSel (Just "getConst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Rep (Const a b) 
Instance details

Defined in Data.Functor.Const

type Rep (Const a b) = D1 (MetaData "Const" "Data.Functor.Const" "base" True) (C1 (MetaCons "Const" PrefixI True) (S1 (MetaSel (Just "getConst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Const a x) = a
type O (Const a x) 
Instance details

Defined in Control.Newtype.Generics

type O (Const a x) = a

newtype Identity a #

Identity functor and monad. (a non-strict monad)

Since: base-4.8.0.0

Constructors

Identity 

Fields

Instances
Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

MonadFix Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

mfix :: (a -> Identity a) -> Identity a #

Applicative Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

pure :: a -> Identity a #

(<*>) :: Identity (a -> b) -> Identity a -> Identity b #

liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #

(*>) :: Identity a -> Identity b -> Identity b #

(<*) :: Identity a -> Identity b -> Identity a #

Foldable Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m #

foldMap :: Monoid m => (a -> m) -> Identity a -> m #

foldr :: (a -> b -> b) -> b -> Identity a -> b #

foldr' :: (a -> b -> b) -> b -> Identity a -> b #

foldl :: (b -> a -> b) -> b -> Identity a -> b #

foldl' :: (b -> a -> b) -> b -> Identity a -> b #

foldr1 :: (a -> a -> a) -> Identity a -> a #

foldl1 :: (a -> a -> a) -> Identity a -> a #

toList :: Identity a -> [a] #

null :: Identity a -> Bool #

length :: Identity a -> Int #

elem :: Eq a => a -> Identity a -> Bool #

maximum :: Ord a => Identity a -> a #

minimum :: Ord a => Identity a -> a #

sum :: Num a => Identity a -> a #

product :: Num a => Identity a -> a #

Traversable Identity 
Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

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

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Traversable1 Identity 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) #

sequence1 :: Apply f => Identity (f b) -> f (Identity b)

Settable Identity 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Identity a -> a

untaintedDot :: Profunctor p => p a (Identity b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Identity b)

Eq1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a -> b -> Bool) -> Identity a -> Identity b -> Bool #

Ord1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a -> b -> Ordering) -> Identity a -> Identity b -> Ordering #

Read1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Identity a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Identity a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Identity a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Identity a] #

Show1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Identity a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Identity a] -> ShowS #

NFData1 Identity

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a -> ()) -> Identity a -> () #

R1 Identity 
Instance details

Defined in Linear.V1

Methods

_x :: Functor f => (a -> f a) -> Identity a -> f (Identity a)

Hashable1 Identity 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Identity a -> Int

Apply Identity 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Identity (a -> b) -> Identity a -> Identity b

(.>) :: Identity a -> Identity b -> Identity b

(<.) :: Identity a -> Identity b -> Identity a

liftF2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c

Bind Identity 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Identity a -> (a -> Identity b) -> Identity b

join :: Identity (Identity a) -> Identity a

Additive Identity 
Instance details

Defined in Linear.Vector

Methods

zero :: Num a => Identity a

(^+^) :: Num a => Identity a -> Identity a -> Identity a

(^-^) :: Num a => Identity a -> Identity a -> Identity a

lerp :: Num a => a -> Identity a -> Identity a -> Identity a

liftU2 :: (a -> a -> a) -> Identity a -> Identity a -> Identity a

liftI2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c

Representable Identity 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep Identity :: *

Methods

tabulate :: (Rep Identity -> a) -> Identity a

index :: Identity a -> Rep Identity -> a

Metric Identity 
Instance details

Defined in Linear.Metric

Methods

dot :: Num a => Identity a -> Identity a -> a

quadrance :: Num a => Identity a -> a

qd :: Num a => Identity a -> Identity a -> a

distance :: Floating a => Identity a -> Identity a -> a

norm :: Floating a => Identity a -> a

signorm :: Floating a => Identity a -> Identity a

Affine Identity 
Instance details

Defined in Linear.Affine

Associated Types

type Diff Identity :: * -> *

Methods

(.-.) :: Num a => Identity a -> Identity a -> Diff Identity a

(.+^) :: Num a => Identity a -> Diff Identity a -> Identity a

(.-^) :: Num a => Identity a -> Diff Identity a -> Identity a

TraversableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) #

itraversed :: (Indexable () p, Applicative f) => p a (f b) -> Identity a -> f (Identity b) #

FunctorWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Identity a -> Identity b #

imapped :: (Indexable () p, Settable f) => p a (f b) -> Identity a -> f (Identity b) #

FoldableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a (f a) -> Identity a -> f (Identity a) #

ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #

MonadBaseControl Identity Identity 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM Identity a :: *

Methods

liftBaseWith :: (RunInBase Identity Identity -> Identity a) -> Identity a

restoreM :: StM Identity a -> Identity a

Cosieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

cosieve :: ReifiedGetter a b -> Identity a -> b

Sieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedGetter a b -> a -> Identity b

Bounded a => Bounded (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

minBound :: Identity a #

maxBound :: Identity a #

Enum a => Enum (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

succ :: Identity a -> Identity a #

pred :: Identity a -> Identity a #

toEnum :: Int -> Identity a #

fromEnum :: Identity a -> Int #

enumFrom :: Identity a -> [Identity a] #

enumFromThen :: Identity a -> Identity a -> [Identity a] #

enumFromTo :: Identity a -> Identity a -> [Identity a] #

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] #

Eq a => Eq (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

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

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

Floating a => Floating (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

pi :: Identity a #

exp :: Identity a -> Identity a #

log :: Identity a -> Identity a #

sqrt :: Identity a -> Identity a #

(**) :: Identity a -> Identity a -> Identity a #

logBase :: Identity a -> Identity a -> Identity a #

sin :: Identity a -> Identity a #

cos :: Identity a -> Identity a #

tan :: Identity a -> Identity a #

asin :: Identity a -> Identity a #

acos :: Identity a -> Identity a #

atan :: Identity a -> Identity a #

sinh :: Identity a -> Identity a #

cosh :: Identity a -> Identity a #

tanh :: Identity a -> Identity a #

asinh :: Identity a -> Identity a #

acosh :: Identity a -> Identity a #

atanh :: Identity a -> Identity a #

log1p :: Identity a -> Identity a #

expm1 :: Identity a -> Identity a #

log1pexp :: Identity a -> Identity a #

log1mexp :: Identity a -> Identity a #

Fractional a => Fractional (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(/) :: Identity a -> Identity a -> Identity a #

recip :: Identity a -> Identity a #

fromRational :: Rational -> Identity a #

Integral a => Integral (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a #

rem :: Identity a -> Identity a -> Identity a #

div :: Identity a -> Identity a -> Identity a #

mod :: Identity a -> Identity a -> Identity a #

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

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

toInteger :: Identity a -> Integer #

Num a => Num (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a #

(-) :: Identity a -> Identity a -> Identity a #

(*) :: Identity a -> Identity a -> Identity a #

negate :: Identity a -> Identity a #

abs :: Identity a -> Identity a #

signum :: Identity a -> Identity a #

fromInteger :: Integer -> Identity a #

Ord a => Ord (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering #

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

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

(>) :: Identity a -> Identity a -> Bool #

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

max :: Identity a -> Identity a -> Identity a #

min :: Identity a -> Identity a -> Identity a #

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the - Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

readsPrec :: Int -> ReadS (Identity a) #

readList :: ReadS [Identity a] #

readPrec :: ReadPrec (Identity a) #

readListPrec :: ReadPrec [Identity a] #

Real a => Real (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

toRational :: Identity a -> Rational #

RealFloat a => RealFloat (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer #

floatDigits :: Identity a -> Int #

floatRange :: Identity a -> (Int, Int) #

decodeFloat :: Identity a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Identity a #

exponent :: Identity a -> Int #

significand :: Identity a -> Identity a #

scaleFloat :: Int -> Identity a -> Identity a #

isNaN :: Identity a -> Bool #

isInfinite :: Identity a -> Bool #

isDenormalized :: Identity a -> Bool #

isNegativeZero :: Identity a -> Bool #

isIEEE :: Identity a -> Bool #

atan2 :: Identity a -> Identity a -> Identity a #

RealFrac a => RealFrac (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

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

truncate :: Integral b => Identity a -> b #

round :: Integral b => Identity a -> b #

ceiling :: Integral b => Identity a -> b #

floor :: Integral b => Identity a -> b #

Show a => Show (Identity a)

This instance would be equivalent to the derived instances of the - Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

showsPrec :: Int -> Identity a -> ShowS #

show :: Identity a -> String #

showList :: [Identity a] -> ShowS #

Ix a => Ix (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

range :: (Identity a, Identity a) -> [Identity a] #

index :: (Identity a, Identity a) -> Identity a -> Int #

unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int

inRange :: (Identity a, Identity a) -> Identity a -> Bool #

rangeSize :: (Identity a, Identity a) -> Int #

unsafeRangeSize :: (Identity a, Identity a) -> Int

IsString a => IsString (Identity a) 
Instance details

Defined in Data.String

Methods

fromString :: String -> Identity a #

Generic (Identity a) 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep (Identity a) :: * -> * #

Methods

from :: Identity a -> Rep (Identity a) x #

to :: Rep (Identity a) x -> Identity a #

Semigroup a => Semigroup (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a #

sconcat :: NonEmpty (Identity a) -> Identity a #

stimes :: Integral b => b -> Identity a -> Identity a #

Monoid a => Monoid (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

mempty :: Identity a #

mappend :: Identity a -> Identity a -> Identity a #

mconcat :: [Identity a] -> Identity a #

Wrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Identity a) :: * #

Methods

_Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #

Ixed (Identity a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #

NFData a => NFData (Identity a)

Since: deepseq-1.4.0.0

Instance details

Defined in Control.DeepSeq

Methods

rnf :: Identity a -> () #

Storable a => Storable (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

sizeOf :: Identity a -> Int #

alignment :: Identity a -> Int #

peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a) #

pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO () #

peekByteOff :: Ptr b -> Int -> IO (Identity a) #

pokeByteOff :: Ptr b -> Int -> Identity a -> IO () #

peek :: Ptr (Identity a) -> IO (Identity a) #

poke :: Ptr (Identity a) -> Identity a -> IO () #

Bits a => Bits (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(.&.) :: Identity a -> Identity a -> Identity a #

(.|.) :: Identity a -> Identity a -> Identity a #

xor :: Identity a -> Identity a -> Identity a #

complement :: Identity a -> Identity a #

shift :: Identity a -> Int -> Identity a #

rotate :: Identity a -> Int -> Identity a #

zeroBits :: Identity a #

bit :: Int -> Identity a #

setBit :: Identity a -> Int -> Identity a #

clearBit :: Identity a -> Int -> Identity a #

complementBit :: Identity a -> Int -> Identity a #

testBit :: Identity a -> Int -> Bool #

bitSizeMaybe :: Identity a -> Maybe Int #

bitSize :: Identity a -> Int #

isSigned :: Identity a -> Bool #

shiftL :: Identity a -> Int -> Identity a #

unsafeShiftL :: Identity a -> Int -> Identity a #

shiftR :: Identity a -> Int -> Identity a #

unsafeShiftR :: Identity a -> Int -> Identity a #

rotateL :: Identity a -> Int -> Identity a #

rotateR :: Identity a -> Int -> Identity a #

popCount :: Identity a -> Int #

FiniteBits a => FiniteBits (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

finiteBitSize :: Identity a -> Int #

countLeadingZeros :: Identity a -> Int #

countTrailingZeros :: Identity a -> Int #

Newtype (Identity a)

Since: newtype-generics-0.5.1

Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Identity a) :: * #

Methods

pack :: O (Identity a) -> Identity a #

unpack :: Identity a -> O (Identity a) #

Hashable a => Hashable (Identity a) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Identity a -> Int

hash :: Identity a -> Int

Generic1 Identity 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep1 Identity :: k -> * #

Methods

from1 :: Identity a -> Rep1 Identity a #

to1 :: Rep1 Identity a -> Identity a #

t ~ Identity b => Rewrapped (Identity a) t 
Instance details

Defined in Control.Lens.Wrapped

Field1 (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Identity a) (Identity b) a b #

Each (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Identity a) (Identity b) a b #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

type Rep Identity 
Instance details

Defined in Data.Functor.Rep

type Rep Identity = ()
type Diff Identity 
Instance details

Defined in Linear.Affine

type Diff Identity = Identity
type StM Identity a 
Instance details

Defined in Control.Monad.Trans.Control

type StM Identity a = a
type Rep (Identity a) 
Instance details

Defined in Data.Functor.Identity

type Rep (Identity a) = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type Unwrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Identity a) = a
type IxValue (Identity a) 
Instance details

Defined in Control.Lens.At

type IxValue (Identity a) = a
type Index (Identity a) 
Instance details

Defined in Control.Lens.At

type Index (Identity a) = ()
type O (Identity a) 
Instance details

Defined in Control.Newtype.Generics

type O (Identity a) = a
type Rep1 Identity 
Instance details

Defined in Data.Functor.Identity

type Rep1 Identity = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

class Bifunctor (p :: * -> * -> *) where #

A bifunctor is a type constructor that takes + the results see traverse_.

Instances
Traversable []

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> [a] -> f [b] #

sequenceA :: Applicative f => [f a] -> f [a] #

mapM :: Monad m => (a -> m b) -> [a] -> m [b] #

sequence :: Monad m => [m a] -> m [a] #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

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

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

Traversable Par1

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) #

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

sequence :: Monad m => Par1 (m a) -> m (Par1 a) #

Traversable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

sequenceA :: Applicative f => IResult (f a) -> f (IResult a) #

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

sequence :: Monad m => IResult (m a) -> m (IResult a) #

Traversable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

sequenceA :: Applicative f => Result (f a) -> f (Result a) #

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

sequence :: Monad m => Result (m a) -> m (Result a) #

Traversable Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

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

sequenceA :: Applicative f => Complex (f a) -> f (Complex a) #

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

sequence :: Monad m => Complex (m a) -> m (Complex a) #

Traversable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Min (f a) -> f (Min a) #

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

sequence :: Monad m => Min (m a) -> m (Min a) #

Traversable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Max (f a) -> f (Max a) #

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

sequence :: Monad m => Max (m a) -> m (Max a) #

Traversable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => First (f a) -> f (First a) #

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

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

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

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

sequenceA :: Applicative f => Option (f a) -> f (Option a) #

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

sequence :: Monad m => Option (m a) -> m (Option a) #

Traversable ZipList

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

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

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

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

Traversable Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

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

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Traversable First

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => First (f a) -> f (First a) #

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

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

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

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Dual (f a) -> f (Dual a) #

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

sequence :: Monad m => Dual (m a) -> m (Dual a) #

Traversable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Sum (f a) -> f (Sum a) #

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

sequence :: Monad m => Sum (m a) -> m (Sum a) #

Traversable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Product (f a) -> f (Product a) #

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

sequence :: Monad m => Product (m a) -> m (Product a) #

Traversable Down

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Down (f a) -> f (Down a) #

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

sequence :: Monad m => Down (m a) -> m (Down a) #

Traversable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) #

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

sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #

Traversable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

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

sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) #

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

sequence :: Monad m => IntMap (m a) -> m (IntMap a) #

Traversable Tree 
Instance details

Defined in Data.Tree

Methods

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

sequenceA :: Applicative f => Tree (f a) -> f (Tree a) #

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

sequence :: Monad m => Tree (m a) -> m (Tree a) #

Traversable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Seq (f a) -> f (Seq a) #

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

sequence :: Monad m => Seq (m a) -> m (Seq a) #

Traversable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) #

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

sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #

Traversable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Digit (f a) -> f (Digit a) #

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

sequence :: Monad m => Digit (m a) -> m (Digit a) #

Traversable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Node (f a) -> f (Node a) #

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

sequence :: Monad m => Node (m a) -> m (Node a) #

Traversable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => Elem (f a) -> f (Elem a) #

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

sequence :: Monad m => Elem (m a) -> m (Elem a) #

Traversable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) #

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

sequence :: Monad m => ViewL (m a) -> m (ViewL a) #

Traversable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

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

sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) #

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

sequence :: Monad m => ViewR (m a) -> m (ViewR a) #

Traversable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

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

sequenceA :: Applicative f => Interval (f a) -> f (Interval a) #

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

sequence :: Monad m => Interval (m a) -> m (Interval a) #

Traversable SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

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

sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) #

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

sequence :: Monad m => SmallArray (m a) -> m (SmallArray a) #

Traversable Array 
Instance details

Defined in Data.Primitive.Array

Methods

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

sequenceA :: Applicative f => Array (f a) -> f (Array a) #

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

sequence :: Monad m => Array (m a) -> m (Array a) #

Traversable Vector 
Instance details

Defined in Data.Vector

Methods

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

sequenceA :: Applicative f => Vector (f a) -> f (Vector a) #

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

sequence :: Monad m => Vector (m a) -> m (Vector a) #

Traversable Root 
Instance details

Defined in Numeric.RootFinding

Methods

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

sequenceA :: Applicative f => Root (f a) -> f (Root a) #

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

sequence :: Monad m => Root (m a) -> m (Root a) #

Traversable Log 
Instance details

Defined in Numeric.Log

Methods

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

sequenceA :: Applicative f => Log (f a) -> f (Log a) #

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

sequence :: Monad m => Log (m a) -> m (Log a) #

Traversable V2 
Instance details

Defined in Linear.V2

Methods

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

sequenceA :: Applicative f => V2 (f a) -> f (V2 a) #

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

sequence :: Monad m => V2 (m a) -> m (V2 a) #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

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

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

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

sequence :: Monad m => Polar (m a) -> m (Polar a) #

Traversable V3 
Instance details

Defined in Linear.V3

Methods

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

sequenceA :: Applicative f => V3 (f a) -> f (V3 a) #

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

sequence :: Monad m => V3 (m a) -> m (V3 a) #

Traversable V1 
Instance details

Defined in Linear.V1

Methods

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

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

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

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable Plucker 
Instance details

Defined in Linear.Plucker

Methods

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

sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) #

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

sequence :: Monad m => Plucker (m a) -> m (Plucker a) #

Traversable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

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

sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) #

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

sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) #

Traversable V0 
Instance details

Defined in Linear.V0

Methods

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

sequenceA :: Applicative f => V0 (f a) -> f (V0 a) #

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

sequence :: Monad m => V0 (m a) -> m (V0 a) #

Traversable V4 
Instance details

Defined in Linear.V4

Methods

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

sequenceA :: Applicative f => V4 (f a) -> f (V4 a) #

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

sequence :: Monad m => V4 (m a) -> m (V4 a) #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Traversable (V1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

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

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => U1 (f a) -> f (U1 a) #

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

sequence :: Monad m => U1 (m a) -> m (U1 a) #

Traversable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequenceA :: Applicative f => (a, f a0) -> f (a, a0) #

mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) #

sequence :: Monad m => (a, m a0) -> m (a, a0) #

Traversable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) #

sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) #

mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) #

sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #

Traversable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) #

sequenceA :: Applicative f => Map k (f a) -> f (Map k a) #

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) #

sequence :: Monad m => Map k (m a) -> m (Map k a) #

Ix i => Traversable (Array i)

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) #

sequenceA :: Applicative f => Array i (f a) -> f (Array i a) #

mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) #

sequence :: Monad m => Array i (m a) -> m (Array i a) #

Traversable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) #

sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) #

mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) #

sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #

Traversable (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) #

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

sequence :: Monad m => Proxy (m a) -> m (Proxy a) #

Traversable f => Traversable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) #

sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) #

mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) #

sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #

(Generic1 f, Traversable (Rep1 f)) => Traversable (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Generically1 f a -> f0 (Generically1 f b) #

sequenceA :: Applicative f0 => Generically1 f (f0 a) -> f0 (Generically1 f a) #

mapM :: Monad m => (a -> m b) -> Generically1 f a -> m (Generically1 f b) #

sequence :: Monad m => Generically1 f (m a) -> m (Generically1 f a) #

Traversable f => Traversable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) #

sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) #

mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) #

sequence :: Monad m => ListT f (m a) -> m (ListT f a) #

Traversable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

traverse :: Applicative f => (a -> f b) -> Categorical p a -> f (Categorical p b) #

sequenceA :: Applicative f => Categorical p (f a) -> f (Categorical p a) #

mapM :: Monad m => (a -> m b) -> Categorical p a -> m (Categorical p b) #

sequence :: Monad m => Categorical p (m a) -> m (Categorical p a) #

Traversable (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

traverse :: Applicative f => (a0 -> f b) -> ListF a a0 -> f (ListF a b) #

sequenceA :: Applicative f => ListF a (f a0) -> f (ListF a a0) #

mapM :: Monad m => (a0 -> m b) -> ListF a a0 -> m (ListF a b) #

sequence :: Monad m => ListF a (m a0) -> m (ListF a a0) #

Traversable f => Traversable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) #

mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) #

sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #

Traversable f => Traversable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) #

mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) #

sequence :: Monad m => Free f (m a) -> m (Free f a) #

Traversable (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

traverse :: Applicative f => (a0 -> f b) -> NonEmptyF a a0 -> f (NonEmptyF a b) #

sequenceA :: Applicative f => NonEmptyF a (f a0) -> f (NonEmptyF a a0) #

mapM :: Monad m => (a0 -> m b) -> NonEmptyF a a0 -> m (NonEmptyF a b) #

sequence :: Monad m => NonEmptyF a (m a0) -> m (NonEmptyF a a0) #

Traversable f => Traversable (Point f) 
Instance details

Defined in Linear.Affine

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) #

sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) #

mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) #

sequence :: Monad m => Point f (m a) -> m (Point f a) #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

Traversable f => Traversable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) #

mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) #

sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #

Traversable f => Traversable (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) #

mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) #

sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #

Traversable (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Traversable (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Traversable (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Traversable (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Traversable (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Traversable (URec (Ptr ()) :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) #

sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) #

mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) #

sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #

Traversable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Traversable f => Traversable (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) #

sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) #

mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) #

sequence :: Monad m => Ap f (m a) -> m (Ap f a) #

Traversable f => Traversable (Alt f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) #

sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) #

mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) #

sequence :: Monad m => Alt f (m a) -> m (Alt f a) #

Bitraversable p => Traversable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) #

sequenceA :: Applicative f => Join p (f a) -> f (Join p a) #

mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) #

sequence :: Monad m => Join p (m a) -> m (Join p a) #

Bitraversable p => Traversable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) #

sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) #

mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) #

sequence :: Monad m => Fix p (m a) -> m (Fix p a) #

Traversable f => Traversable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) #

mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) #

sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #

Traversable f => Traversable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) #

sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) #

mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) #

sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable f => Traversable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) #

sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) #

mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) #

sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

traverse :: Applicative f => (a0 -> f b) -> Forget r a a0 -> f (Forget r a b) #

sequenceA :: Applicative f => Forget r a (f a0) -> f (Forget r a a0) #

mapM :: Monad m => (a0 -> m b) -> Forget r a a0 -> m (Forget r a b) #

sequence :: Monad m => Forget r a (m a0) -> m (Forget r a a0) #

Traversable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) #

sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) #

mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) #

sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #

Traversable f => Traversable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) #

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) #

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #

(Traversable f, Traversable w) => Traversable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) #

sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) #

mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) #

sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #

Traversable f => Traversable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) #

sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) #

sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #

(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) #

sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) #

mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) #

sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #

Traversable f => Traversable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) #

sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) #

sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #

Traversable (V n) 
Instance details

Defined in Linear.V

Methods

traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) #

sequenceA :: Applicative f => V n (f a) -> f (V n a) #

mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) #

sequence :: Monad m => V n (m a) -> m (V n a) #

Traversable f => Traversable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 (AlongsideLeft f b a) #

mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m (AlongsideLeft f b b0) #

sequence :: Monad m => AlongsideLeft f b (m a) -> m (AlongsideLeft f b a) #

Traversable f => Traversable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 (AlongsideRight f a a0) #

mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m (AlongsideRight f a b) #

sequence :: Monad m => AlongsideRight f a (m a0) -> m (AlongsideRight f a a0) #

Traversable (K1 i c :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) #

sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) #

mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) #

sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #

(Traversable f, Traversable g) => Traversable (f :+: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) #

mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) #

sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #

(Traversable f, Traversable g) => Traversable (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a) #

mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b) #

sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a) #

(Traversable f, Traversable g) => Traversable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) #

mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) #

sequence :: Monad m => Product f g (m a) -> m (Product f g a) #

(Traversable f, Traversable g) => Traversable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) #

mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) #

sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

Traversable f => Traversable (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) #

mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) #

sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #

(Traversable f, Traversable g) => Traversable (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) #

mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) #

sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #

(Traversable f, Traversable g) => Traversable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) #

mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) #

sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #

Bitraversable p => Traversable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) #

sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) #

mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) #

sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #

Traversable g => Traversable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) #

mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) #

sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #

Bitraversable p => Traversable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) #

sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) #

mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) #

sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #

Traversable (Clown f a :: Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) #

sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) #

mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) #

sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #

(Traversable f, Bitraversable p) => Traversable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) #

sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) #

mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) #

sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #

(Bitraversable p, Traversable g) => Traversable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) #

sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) #

mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) #

sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class Contravariant (f :: Type -> Type) where #

The class of contravariant functors.

Whereas in Haskell, one can think of a Functor as containing or producing + values, a contravariant functor is a functor that can be thought of as + consuming values.

As an example, consider the type of predicate functions a -> Bool. One + such predicate might be negative x = x < 0, which + classifies integers as to whether they are negative. However, given this + predicate, we can re-use it in other situations, providing we have a way to + map values to integers. For instance, we can use the negative predicate + on a person's bank balance to work out if they are currently overdrawn:

newtype Predicate a = Predicate { getPredicate :: a -> Bool }
+
+instance Contravariant Predicate where
+  contramap f (Predicate p) = Predicate (p . f)
+                                         |   `- First, map the input...
+                                         `----- then apply the predicate.
+
+overdrawn :: Predicate Person
+overdrawn = contramap personBankBalance negative
+

Any instance should be subject to the following laws:

contramap id = id
+contramap f . contramap g = contramap (g . f)

Note, that the second law follows from the free theorem of the type of + contramap and the first law, so you need only check that the former + condition holds.

Minimal complete definition

contramap

Methods

contramap :: (a -> b) -> f b -> f a #

(>$) :: b -> f b -> f a infixl 4 #

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

Instances
Contravariant Predicate

A Predicate is a Contravariant Functor, because contramap can + apply its function argument to the input of the predicate.

Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Predicate b -> Predicate a #

(>$) :: b -> Predicate b -> Predicate a #

Contravariant Comparison

A Comparison is a Contravariant Functor, because contramap can + apply its function argument to each input of the comparison function.

Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Comparison b -> Comparison a #

(>$) :: b -> Comparison b -> Comparison a #

Contravariant Equivalence

Equivalence relations are Contravariant, because you can + apply the contramapped function to each input to the equivalence + relation.

Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Equivalence b -> Equivalence a #

(>$) :: b -> Equivalence b -> Equivalence a #

Contravariant (V1 :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> V1 b -> V1 a #

(>$) :: b -> V1 b -> V1 a #

Contravariant (U1 :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> U1 b -> U1 a #

(>$) :: b -> U1 b -> U1 a #

Contravariant (Op a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Op a b -> Op a a0 #

(>$) :: b -> Op a b -> Op a a0 #

Contravariant (Proxy :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Proxy b -> Proxy a #

(>$) :: b -> Proxy b -> Proxy a #

Contravariant m => Contravariant (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

contramap :: (a -> b) -> MaybeT m b -> MaybeT m a #

(>$) :: b -> MaybeT m b -> MaybeT m a #

Contravariant m => Contravariant (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

contramap :: (a -> b) -> ListT m b -> ListT m a #

(>$) :: b -> ListT m b -> ListT m a #

Contravariant f => Contravariant (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

contramap :: (a -> b) -> Indexing f b -> Indexing f a #

(>$) :: b -> Indexing f b -> Indexing f a #

Contravariant f => Contravariant (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

contramap :: (a -> b) -> Indexing64 f b -> Indexing64 f a #

(>$) :: b -> Indexing64 f b -> Indexing64 f a #

Contravariant f => Contravariant (Rec1 f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Rec1 f b -> Rec1 f a #

(>$) :: b -> Rec1 f b -> Rec1 f a #

Contravariant (Const a :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Const a b -> Const a a0 #

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

Contravariant f => Contravariant (Alt f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Alt f b -> Alt f a #

(>$) :: b -> Alt f b -> Alt f a #

Contravariant f => Contravariant (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

contramap :: (a -> b) -> IdentityT f b -> IdentityT f a #

(>$) :: b -> IdentityT f b -> IdentityT f a #

Contravariant m => Contravariant (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

contramap :: (a -> b) -> ExceptT e m b -> ExceptT e m a #

(>$) :: b -> ExceptT e m b -> ExceptT e m a #

Contravariant m => Contravariant (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

contramap :: (a -> b) -> WriterT w m b -> WriterT w m a #

(>$) :: b -> WriterT w m b -> WriterT w m a #

Contravariant m => Contravariant (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

contramap :: (a -> b) -> StateT s m b -> StateT s m a #

(>$) :: b -> StateT s m b -> StateT s m a #

Contravariant m => Contravariant (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

contramap :: (a -> b) -> ReaderT r m b -> ReaderT r m a #

(>$) :: b -> ReaderT r m b -> ReaderT r m a #

Contravariant m => Contravariant (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

contramap :: (a -> b) -> ErrorT e m b -> ErrorT e m a #

(>$) :: b -> ErrorT e m b -> ErrorT e m a #

Contravariant m => Contravariant (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

contramap :: (a -> b) -> StateT s m b -> StateT s m a #

(>$) :: b -> StateT s m b -> StateT s m a #

Contravariant m => Contravariant (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

contramap :: (a -> b) -> WriterT w m b -> WriterT w m a #

(>$) :: b -> WriterT w m b -> WriterT w m a #

Contravariant f => Contravariant (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

contramap :: (a -> b) -> Backwards f b -> Backwards f a #

(>$) :: b -> Backwards f b -> Backwards f a #

Contravariant f => Contravariant (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

contramap :: (a -> b0) -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

(>$) :: b0 -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Contravariant f => Contravariant (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

contramap :: (a0 -> b) -> AlongsideRight f a b -> AlongsideRight f a a0 #

(>$) :: b -> AlongsideRight f a b -> AlongsideRight f a a0 #

Contravariant (K1 i c :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> K1 i c b -> K1 i c a #

(>$) :: b -> K1 i c b -> K1 i c a #

(Contravariant f, Contravariant g) => Contravariant (f :+: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :+: g) b -> (f :+: g) a #

(>$) :: b -> (f :+: g) b -> (f :+: g) a #

(Contravariant f, Contravariant g) => Contravariant (f :*: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :*: g) b -> (f :*: g) a #

(>$) :: b -> (f :*: g) b -> (f :*: g) a #

(Contravariant f, Contravariant g) => Contravariant (Product f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Product f g b -> Product f g a #

(>$) :: b -> Product f g b -> Product f g a #

(Contravariant f, Contravariant g) => Contravariant (Sum f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Sum f g b -> Sum f g a #

(>$) :: b -> Sum f g b -> Sum f g a #

Contravariant f => Contravariant (M1 i c f) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> M1 i c f b -> M1 i c f a #

(>$) :: b -> M1 i c f b -> M1 i c f a #

(Functor f, Contravariant g) => Contravariant (f :.: g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> (f :.: g) b -> (f :.: g) a #

(>$) :: b -> (f :.: g) b -> (f :.: g) a #

(Functor f, Contravariant g) => Contravariant (Compose f g) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a -> b) -> Compose f g b -> Compose f g a #

(>$) :: b -> Compose f g b -> Compose f g a #

Contravariant m => Contravariant (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a #

(>$) :: b -> RWST r w s m b -> RWST r w s m a #

Contravariant m => Contravariant (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

contramap :: (a -> b) -> RWST r w s m b -> RWST r w s m a #

(>$) :: b -> RWST r w s m b -> RWST r w s m a #

Contravariant f => Contravariant (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

contramap :: (a0 -> b0) -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

(>$) :: b0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

(Profunctor p, Contravariant g) => Contravariant (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

contramap :: (a0 -> b0) -> PretextT p g a b b0 -> PretextT p g a b a0 #

(>$) :: b0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

(Profunctor p, Contravariant g) => Contravariant (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

contramap :: (a0 -> b0) -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

(>$) :: b0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

(Profunctor p, Contravariant g) => Contravariant (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

contramap :: (a0 -> b0) -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

(>$) :: b0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

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

A bifunctor is a type constructor that takes two type arguments and is a functor in both arguments. That is, unlike with Functor, a type constructor such as Either does not need to be partially applied for a Bifunctor @@ -55,683 +61,97 @@ or both at the same time.

Formally, the class Bifunctor represents a bifunctor from Hask -> Hask.

Intuitively it is a bifunctor where both the first and second arguments are covariant.

You can define a Bifunctor by either defining bimap or by - defining both first and second.

If you supply bimap, you should ensure that:

bimap id id ≡ id

If you supply first and second, ensure:

first id ≡ id
-second id ≡ id
-

If you supply both, you should also ensure:

bimap f g ≡ first f . second g

These ensure by parametricity:

bimap  (f . g) (h . i) ≡ bimap f h . bimap g i
-first  (f . g) ≡ first  f . first  g
-second (f . g) ≡ second f . second g
-

Since: base-4.8.0.0

Minimal complete definition

bimap | first, second

Methods

bimap :: (a -> b) -> (c -> d) -> p a c -> p b d #

Map over both arguments at the same time.

bimap f g ≡ first f . second g

Examples

Expand
>>> bimap toUpper (+1) ('j', 3)
+ defining both first and second.
If you supply bimap, you should ensure that:
bimap id id ≡ id
If you supply first and second, ensure:
first id ≡ id
+second id ≡ id
+
If you supply both, you should also ensure:
bimap f g ≡ first f . second g
These ensure by parametricity:
bimap  (f . g) (h . i) ≡ bimap f h . bimap g i
+first  (f . g) ≡ first  f . first  g
+second (f . g) ≡ second f . second g
+
Since: base-4.8.0.0

Minimal complete definition

bimap | first, second

Methods

bimap :: (a -> b) -> (c -> d) -> p a c -> p b d #

Map over both arguments at the same time.

bimap f g ≡ first f . second g

Examples

Expand
>>> bimap toUpper (+1) ('j', 3)
 ('J',4)
 
>>> bimap toUpper (+1) (Left 'j')
 Left 'J'
 
>>> bimap toUpper (+1) (Right 3)
 Right 4
-
Instances
Bifunctor Either

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d #

first :: (a -> b) -> Either a c -> Either b c #

second :: (b -> c) -> Either a b -> Either a c #

Bifunctor (,)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) #

first :: (a -> b) -> (a, c) -> (b, c) #

second :: (b -> c) -> (a, b) -> (a, c) #

Bifunctor Arg

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

bimap :: (a -> b) -> (c -> d) -> Arg a c -> Arg b d #

first :: (a -> b) -> Arg a c -> Arg b c #

second :: (b -> c) -> Arg a b -> Arg a c #

Bifunctor ((,,) x1)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, a, c) -> (x1, b, d) #

first :: (a -> b) -> (x1, a, c) -> (x1, b, c) #

second :: (b -> c) -> (x1, a, b) -> (x1, a, c) #

Bifunctor (Const :: * -> * -> *)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

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

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

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

Bifunctor (Tagged :: * -> * -> *) 
Instance details

Defined in Data.Tagged

Methods

bimap :: (a -> b) -> (c -> d) -> Tagged a c -> Tagged b d #

first :: (a -> b) -> Tagged a c -> Tagged b c #

second :: (b -> c) -> Tagged a b -> Tagged a c #

Functor f => Bifunctor (CofreeF f) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

bimap :: (a -> b) -> (c -> d) -> CofreeF f a c -> CofreeF f b d #

first :: (a -> b) -> CofreeF f a c -> CofreeF f b c #

second :: (b -> c) -> CofreeF f a b -> CofreeF f a c #

Functor f => Bifunctor (FreeF f) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

bimap :: (a -> b) -> (c -> d) -> FreeF f a c -> FreeF f b d #

first :: (a -> b) -> FreeF f a c -> FreeF f b c #

second :: (b -> c) -> FreeF f a b -> FreeF f a c #

Functor f => Bifunctor (AlongsideLeft f) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

bimap :: (a -> b) -> (c -> d) -> AlongsideLeft f a c -> AlongsideLeft f b d #

first :: (a -> b) -> AlongsideLeft f a c -> AlongsideLeft f b c #

second :: (b -> c) -> AlongsideLeft f a b -> AlongsideLeft f a c #

Functor f => Bifunctor (AlongsideRight f) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

bimap :: (a -> b) -> (c -> d) -> AlongsideRight f a c -> AlongsideRight f b d #

first :: (a -> b) -> AlongsideRight f a c -> AlongsideRight f b c #

second :: (b -> c) -> AlongsideRight f a b -> AlongsideRight f a c #

Bifunctor (K1 i :: * -> * -> *)

Since: base-4.9.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> K1 i a c -> K1 i b d #

first :: (a -> b) -> K1 i a c -> K1 i b c #

second :: (b -> c) -> K1 i a b -> K1 i a c #

Bifunctor ((,,,) x1 x2)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, a, c) -> (x1, x2, b, d) #

first :: (a -> b) -> (x1, x2, a, c) -> (x1, x2, b, c) #

second :: (b -> c) -> (x1, x2, a, b) -> (x1, x2, a, c) #

Bifunctor ((,,,,) x1 x2 x3)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, d) #

first :: (a -> b) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, c) #

second :: (b -> c) -> (x1, x2, x3, a, b) -> (x1, x2, x3, a, c) #

Functor f => Bifunctor (Clown f :: * -> * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

bimap :: (a -> b) -> (c -> d) -> Clown f a c -> Clown f b d #

first :: (a -> b) -> Clown f a c -> Clown f b c #

second :: (b -> c) -> Clown f a b -> Clown f a c #

Bifunctor p => Bifunctor (Flip p) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

bimap :: (a -> b) -> (c -> d) -> Flip p a c -> Flip p b d #

first :: (a -> b) -> Flip p a c -> Flip p b c #

second :: (b -> c) -> Flip p a b -> Flip p a c #

Functor g => Bifunctor (Joker g :: * -> * -> *) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

bimap :: (a -> b) -> (c -> d) -> Joker g a c -> Joker g b d #

first :: (a -> b) -> Joker g a c -> Joker g b c #

second :: (b -> c) -> Joker g a b -> Joker g a c #

Bifunctor p => Bifunctor (WrappedBifunctor p) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d #

first :: (a -> b) -> WrappedBifunctor p a c -> WrappedBifunctor p b c #

second :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c #

Bifunctor ((,,,,,) x1 x2 x3 x4)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, d) #

first :: (a -> b) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, c) #

second :: (b -> c) -> (x1, x2, x3, x4, a, b) -> (x1, x2, x3, x4, a, c) #

(Bifunctor f, Bifunctor g) => Bifunctor (Product f g) 
Instance details

Defined in Data.Bifunctor.Product

Methods

bimap :: (a -> b) -> (c -> d) -> Product f g a c -> Product f g b d #

first :: (a -> b) -> Product f g a c -> Product f g b c #

second :: (b -> c) -> Product f g a b -> Product f g a c #

(Bifunctor p, Bifunctor q) => Bifunctor (Sum p q) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

bimap :: (a -> b) -> (c -> d) -> Sum p q a c -> Sum p q b d #

first :: (a -> b) -> Sum p q a c -> Sum p q b c #

second :: (b -> c) -> Sum p q a b -> Sum p q a c #

Bifunctor ((,,,,,,) x1 x2 x3 x4 x5)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, d) #

first :: (a -> b) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, c) #

second :: (b -> c) -> (x1, x2, x3, x4, x5, a, b) -> (x1, x2, x3, x4, x5, a, c) #

(Functor f, Bifunctor p) => Bifunctor (Tannen f p) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

bimap :: (a -> b) -> (c -> d) -> Tannen f p a c -> Tannen f p b d #

first :: (a -> b) -> Tannen f p a c -> Tannen f p b c #

second :: (b -> c) -> Tannen f p a b -> Tannen f p a c #

(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

bimap :: (a -> b) -> (c -> d) -> Biff p f g a c -> Biff p f g b d #

first :: (a -> b) -> Biff p f g a c -> Biff p f g b c #

second :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

bars :: (PlotValue x, BarsPlotValue y) => [String] -> [(x, [y])] -> EC l (PlotBars x y) #

Construct a bar chart with the given titles and data, using the - next available colors

points :: String -> [(x, y)] -> EC l (PlotPoints x y) #

Construct a scatter plot with the given title and data, using the - next available color and point shape.

line :: String -> [[(x, y)]] -> EC l (PlotLines x y) #

Constuct a line plot with the given title and - data, using the next available color.

setShapes :: [PointShape] -> EC l () #

Set the contents of the shape source, for - subsequent plots

setColors :: [AlphaColour Double] -> EC l () #

Set the contents of the colour source, for - subsequent plots

takeShape :: EC l PointShape #

Pop and return the next shape from the state

takeColor :: EC l (AlphaColour Double) #

Pop and return the next color from the state

plotRight :: ToPlot p => EC (LayoutLR x y1 y2) (p x y2) -> EC (LayoutLR x y1 y2) () #

Add a plot against the right axis tof the LayoutLR being constructed.

plotLeft :: ToPlot p => EC (LayoutLR x y1 y2) (p x y1) -> EC (LayoutLR x y1 y2) () #

Add a plot against the left axis to the LayoutLR being constructed.

plot :: ToPlot p => EC (Layout x y) (p x y) -> EC (Layout x y) () #

Add a plot to the Layout being constructed.

liftCState :: State CState a -> EC l a #

Lift a a computation over CState

liftEC :: Default l1 => EC l1 a -> EC l2 l1 #

Nest the construction of a graphical element within - the construction of another.

execEC :: Default l => EC l a -> l #

Run the monadic EC computation, and return the graphical - element (ie the outer monad' state)

shapes :: Lens' CState [PointShape] #

colors :: Lens' CState [AlphaColour Double] #

type EC l a = StateT l (State CState) a #

We use nested State monads to give nice syntax. The outer state - is the graphical element being constructed (typically a - layout). The inner state contains any additional state - reqired. This approach means that lenses and the state monad lens - operators can be used directly on the value being constructed.

data CState #

The state held when monadically constructing a graphical element

Instances
Default CState 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

def :: CState #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

layoutlr_foreground :: Settable f => (AlphaColour Double -> f (AlphaColour Double)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

Setter to update the foreground color of core chart elements on a LayoutLR

layoutlr_all_font_styles :: Settable f => (FontStyle -> f FontStyle) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

Setter to update all the font styles on a LayoutLR

layoutlr_axes_title_styles :: Settable f => (FontStyle -> f FontStyle) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

Setter to update all the axes title styles on a LayoutLR

layoutlr_axes_styles :: Settable f => (AxisStyle -> f AxisStyle) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

Setter to update all axis styles on a LayoutLR

layout_foreground :: Settable f => (AlphaColour Double -> f (AlphaColour Double)) -> Layout x y -> f (Layout x y) #

Setter to update the foreground color of core chart elements on a Layout

layout_all_font_styles :: Settable f => (FontStyle -> f FontStyle) -> Layout x y -> f (Layout x y) #

Setter to update all the font styles on a Layout

layout_axes_title_styles :: Settable f => (FontStyle -> f FontStyle) -> Layout x y -> f (Layout x y) #

Setter to update all the axes title styles on a Layout

layout_axes_styles :: Settable f => (AxisStyle -> f AxisStyle) -> Layout x y -> f (Layout x y) #

Setter to update all axis styles on a Layout

slayouts_layouts :: Functor f => ([StackedLayout x1] -> f [StackedLayout x2]) -> StackedLayouts x1 -> f (StackedLayouts x2) #

slayouts_compress_legend :: Functor f => (Bool -> f Bool) -> StackedLayouts x -> f (StackedLayouts x) #

laxis_title_style :: Functor f => (FontStyle -> f FontStyle) -> LayoutAxis x -> f (LayoutAxis x) #

laxis_title :: Functor f => (String -> f String) -> LayoutAxis x -> f (LayoutAxis x) #

laxis_style :: Functor f => (AxisStyle -> f AxisStyle) -> LayoutAxis x -> f (LayoutAxis x) #

laxis_reverse :: Functor f => (Bool -> f Bool) -> LayoutAxis x -> f (LayoutAxis x) #

laxis_override :: Functor f => ((AxisData x -> AxisData x) -> f (AxisData x -> AxisData x)) -> LayoutAxis x -> f (LayoutAxis x) #

laxis_generate :: Functor f => (AxisFn x -> f (AxisFn x)) -> LayoutAxis x -> f (LayoutAxis x) #

layoutlr_x_axis :: Functor f => (LayoutAxis x -> f (LayoutAxis x)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_top_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_title_style :: Functor f => (FontStyle -> f FontStyle) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_title :: Functor f => (String -> f String) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_right_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_right_axis :: Functor f => (LayoutAxis y2 -> f (LayoutAxis y2)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_plots :: Functor f => ([Either (Plot x y1) (Plot x y2)] -> f [Either (Plot x y1) (Plot x y2)]) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_plot_background :: Functor f => (Maybe FillStyle -> f (Maybe FillStyle)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_margin :: Functor f => (Double -> f Double) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_legend :: Functor f => (Maybe LegendStyle -> f (Maybe LegendStyle)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_left_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_left_axis :: Functor f => (LayoutAxis y1 -> f (LayoutAxis y1)) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_grid_last :: Functor f => (Bool -> f Bool) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_bottom_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layoutlr_background :: Functor f => (FillStyle -> f FillStyle) -> LayoutLR x y1 y2 -> f (LayoutLR x y1 y2) #

layout_y_axis :: Functor f => (LayoutAxis y -> f (LayoutAxis y)) -> Layout x y -> f (Layout x y) #

layout_x_axis :: Functor f => (LayoutAxis x -> f (LayoutAxis x)) -> Layout x y -> f (Layout x y) #

layout_top_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> Layout x y -> f (Layout x y) #

layout_title_style :: Functor f => (FontStyle -> f FontStyle) -> Layout x y -> f (Layout x y) #

layout_title :: Functor f => (String -> f String) -> Layout x y -> f (Layout x y) #

layout_right_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> Layout x y -> f (Layout x y) #

layout_plots :: Functor f => ([Plot x y] -> f [Plot x y]) -> Layout x y -> f (Layout x y) #

layout_plot_background :: Functor f => (Maybe FillStyle -> f (Maybe FillStyle)) -> Layout x y -> f (Layout x y) #

layout_margin :: Functor f => (Double -> f Double) -> Layout x y -> f (Layout x y) #

layout_legend :: Functor f => (Maybe LegendStyle -> f (Maybe LegendStyle)) -> Layout x y -> f (Layout x y) #

layout_left_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> Layout x y -> f (Layout x y) #

layout_grid_last :: Functor f => (Bool -> f Bool) -> Layout x y -> f (Layout x y) #

layout_bottom_axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> Layout x y -> f (Layout x y) #

layout_background :: Functor f => (FillStyle -> f FillStyle) -> Layout x y -> f (Layout x y) #

renderStackedLayouts :: Ord x => StackedLayouts x -> Renderable () #

Render several layouts with the same x-axis type and range, - vertically stacked so that their origins and x-values are aligned.

The legends from all the charts may be optionally combined, and shown - once on the bottom chart. See StackedLayouts for further information.

layoutLRToGrid :: (Ord x, Ord yl, Ord yr) => LayoutLR x yl yr -> Grid (Renderable (LayoutPick x yl yr)) #

layoutLRToRenderable :: (Ord x, Ord yl, Ord yr) => LayoutLR x yl yr -> Renderable (LayoutPick x yl yr) #

Render the given LayoutLR.

layoutToGrid :: (Ord x, Ord y) => Layout x y -> Grid (Renderable (LayoutPick x y y)) #

layoutToRenderable :: (Ord x, Ord y) => Layout x y -> Renderable (LayoutPick x y y) #

Render the given Layout.

type MAxisFn t = [t] -> Maybe (AxisData t) #

A MAxisFn is a function that generates an (optional) axis - given the points plotted against that axis.

data LayoutAxis x #

Type of axis that is used in Layout and LayoutLR.

To generate the actual axis type (AxisData and AxisT) - the _laxis_generate function is called and custom settings - are applied with _laxis_override. Note that the AxisVisibility - values in Layout and LayoutLR override visibility related - settings of the axis.

Constructors

LayoutAxis 

Fields

Instances
PlotValue t => Default (LayoutAxis t) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutAxis t #

data LayoutPick x y1 y2 #

Information on what is at a specifc location of a Layout or LayoutLR. - This is delivered by the PickFn of a Renderable.

Constructors

LayoutPick_Legend String

A legend entry.

LayoutPick_Title String

The title.

LayoutPick_XTopAxisTitle String

The title of the top x axis.

LayoutPick_XBottomAxisTitle String

The title of the bottom x axis.

LayoutPick_YLeftAxisTitle String

The title of the left y axis.

LayoutPick_YRightAxisTitle String

The title of the right y axis.

LayoutPick_PlotArea x y1 y2

The plot area at the given plot coordinates.

LayoutPick_XTopAxis x

The top x axis at the given plot coordinate.

LayoutPick_XBottomAxis x

The bottom x axis at the given plot coordinate.

LayoutPick_YLeftAxis y1

The left y axis at the given plot coordinate.

LayoutPick_YRightAxis y2

The right y axis at the given plot coordinate.

Instances
(Show x, Show y1, Show y2) => Show (LayoutPick x y1 y2) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

showsPrec :: Int -> LayoutPick x y1 y2 -> ShowS #

show :: LayoutPick x y1 y2 -> String #

showList :: [LayoutPick x y1 y2] -> ShowS #

data Layout x y #

A Layout value is a single plot area, with single x and y - axis. The title is at the top and the legend at the bottom. It's - parametrized by the types of values to be plotted on the x - and y axes.

Constructors

Layout 

Fields

Instances
(PlotValue x, PlotValue y) => Default (Layout x y)

Empty Layout without title and plots. The background is white and - the grid is drawn beneath all plots. There will be a legend. The top - and right axis will not be visible.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: Layout x y #

(Ord x, Ord y) => ToRenderable (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: Layout x y -> Renderable () #

data LayoutLR x y1 y2 #

A LayoutLR value is a single plot area, with an x axis and - independent left and right y axes, with a title at the top; - legend at the bottom. It's parametrized by the types of values - to be plotted on the x and two y axes.

Constructors

LayoutLR 

Fields

Instances
(PlotValue x, PlotValue y1, PlotValue y2) => Default (LayoutLR x y1 y2)

Empty LayoutLR without title and plots. The background is white and - the grid is drawn beneath all plots. There will be a legend. The top - axis will not be visible.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutLR x y1 y2 #

(Ord x, Ord yl, Ord yr) => ToRenderable (LayoutLR x yl yr) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: LayoutLR x yl yr -> Renderable () #

data StackedLayout x where #

A layout with its y type hidden, so that it can be stacked - with other layouts with differing y axis, but the same x axis. - See StackedLayouts.

Constructors

StackedLayout :: StackedLayout x

A Layout to stack.

StackedLayoutLR :: StackedLayout x

A LayoutLR to stack.

data StackedLayouts x #

A container for a set of vertically StackedLayouts. - The x axis of the different layouts will be aligned.

Constructors

StackedLayouts 

Fields

Instances
Default (StackedLayouts x)

A empty StackedLayout with compressions applied.

Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: StackedLayouts x #

Ord x => ToRenderable (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: StackedLayouts x -> Renderable () #

plot_hist_values :: Functor f => ([x] -> f [x]) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_title :: Functor f => (String -> f String) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_range :: Functor f => (Maybe (x, x) -> f (Maybe (x, x))) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_norm_func :: Functor f => ((Double -> Int -> y1) -> f (Double -> Int -> y2)) -> PlotHist x y1 -> f (PlotHist x y2) #

plot_hist_no_zeros :: Functor f => (Bool -> f Bool) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_line_style :: Functor f => (LineStyle -> f LineStyle) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_fill_style :: Functor f => (FillStyle -> f FillStyle) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_drop_lines :: Functor f => (Bool -> f Bool) -> PlotHist x y -> f (PlotHist x y) #

plot_hist_bins :: Functor f => (Int -> f Int) -> PlotHist x y -> f (PlotHist x y) #

histToPlot :: (RealFrac x, Num y, Ord y) => PlotHist x y -> Plot x y #

Convert a PlotHist to a Plot

N.B. In principle this should be Chart's ToPlot class but unfortunately - this does not allow us to set bounds on the x and y axis types, hence - the need for this function.

defaultNormedPlotHist :: PlotHist x Double #

defaultPlotHist but normalized such that the integral of the - histogram is one.

defaultFloatPlotHist :: PlotHist x Double #

defaultPlotHist but with real counts

defaultPlotHist :: PlotHist x Int #

The default style is an unnormalized histogram of 20 bins.

data PlotHist x y #

Constructors

PlotHist 

Fields

Instances
Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

area_spots_4d_values :: Functor f => ([(x1, y1, z1, t1)] -> f [(x2, y2, z2, t2)]) -> AreaSpots4D z1 t1 x1 y1 -> f (AreaSpots4D z2 t2 x2 y2) #

area_spots_4d_title :: Functor f => (String -> f String) -> AreaSpots4D z t x y -> f (AreaSpots4D z t x y) #

area_spots_4d_palette :: Functor f => ([Colour Double] -> f [Colour Double]) -> AreaSpots4D z t x y -> f (AreaSpots4D z t x y) #

area_spots_4d_opacity :: Functor f => (Double -> f Double) -> AreaSpots4D z t x y -> f (AreaSpots4D z t x y) #

area_spots_4d_max_radius :: Functor f => (Double -> f Double) -> AreaSpots4D z t x y -> f (AreaSpots4D z t x y) #

area_spots_4d_linethick :: Functor f => (Double -> f Double) -> AreaSpots4D z t x y -> f (AreaSpots4D z t x y) #

area_spots_values :: Functor f => ([(x1, y1, z1)] -> f [(x2, y2, z2)]) -> AreaSpots z1 x1 y1 -> f (AreaSpots z2 x2 y2) #

area_spots_title :: Functor f => (String -> f String) -> AreaSpots z x y -> f (AreaSpots z x y) #

area_spots_opacity :: Functor f => (Double -> f Double) -> AreaSpots z x y -> f (AreaSpots z x y) #

area_spots_max_radius :: Functor f => (Double -> f Double) -> AreaSpots z x y -> f (AreaSpots z x y) #

area_spots_linethick :: Functor f => (Double -> f Double) -> AreaSpots z x y -> f (AreaSpots z x y) #

area_spots_linecolour :: Functor f => (AlphaColour Double -> f (AlphaColour Double)) -> AreaSpots z x y -> f (AreaSpots z x y) #

area_spots_fillcolour :: Functor f => (Colour Double -> f (Colour Double)) -> AreaSpots z x y -> f (AreaSpots z x y) #

data AreaSpots z x y #

A collection of unconnected spots, with x,y position, and an - independent z value to be represented by the area of the spot.

Constructors

AreaSpots 

Fields

Instances
PlotValue z => ToPlot (AreaSpots z) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots z x y -> Plot x y #

Default (AreaSpots z x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots z x y #

data AreaSpots4D z t x y #

A collection of unconnected spots, with x,y position, an - independent z value to be represented by the area of the spot, - and in addition, a fourth variable t to be represented by a colour - from a given palette. (A linear transfer function from t to palette - is assumed.)

Constructors

AreaSpots4D 

Fields

Instances
(PlotValue z, PlotValue t, Show t) => ToPlot (AreaSpots4D z t) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots4D z t x y -> Plot x y #

Default (AreaSpots4D z t x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots4D z t x y #

plot_bars_values :: Functor f => ([(x1, [y])] -> f [(x2, [y])]) -> PlotBars x1 y -> f (PlotBars x2 y) #

plot_bars_titles :: Functor f => ([String] -> f [String]) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_style :: Functor f => (PlotBarsStyle -> f PlotBarsStyle) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_spacing :: Functor f => (PlotBarsSpacing -> f PlotBarsSpacing) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_singleton_width :: Functor f => (Double -> f Double) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_reference :: Functor f => (y -> f y) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_item_styles :: Functor f => ([(FillStyle, Maybe LineStyle)] -> f [(FillStyle, Maybe LineStyle)]) -> PlotBars x y -> f (PlotBars x y) #

plot_bars_alignment :: Functor f => (PlotBarsAlignment -> f PlotBarsAlignment) -> PlotBars x y -> f (PlotBars x y) #

plotBars :: BarsPlotValue y => PlotBars x y -> Plot x y #

class PlotValue a => BarsPlotValue a where #

Minimal complete definition

barsReference, barsAdd

Methods

barsReference :: a #

barsAdd :: a -> a -> a #

Instances
BarsPlotValue Double 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Double #

barsAdd :: Double -> Double -> Double #

BarsPlotValue Int 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Int #

barsAdd :: Int -> Int -> Int #

data PlotBarsStyle #

Constructors

BarsStacked

Bars for a fixed x are stacked vertically - on top of each other.

BarsClustered

Bars for a fixed x are put horizontally - beside each other.

Instances
Show PlotBarsStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsStyle -> ShowS #

show :: PlotBarsStyle -> String #

showList :: [PlotBarsStyle] -> ShowS #

data PlotBarsSpacing #

Constructors

BarsFixWidth Double

All bars have the same width in pixels.

BarsFixGap Double Double

(BarsFixGap g mw) means make the gaps between - the bars equal to g, but with a minimum bar width - of mw

Instances
Show PlotBarsSpacing 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsSpacing -> ShowS #

show :: PlotBarsSpacing -> String #

showList :: [PlotBarsSpacing] -> ShowS #

data PlotBarsAlignment #

How bars for a given (x,[y]) are aligned with respect to screen - coordinate corresponding to x (deviceX).

Constructors

BarsLeft

The left edge of bars is at deviceX

BarsCentered

Bars are centered around deviceX

BarsRight

The right edge of bars is at deviceX

Instances
Show PlotBarsAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsAlignment -> ShowS #

show :: PlotBarsAlignment -> String #

showList :: [PlotBarsAlignment] -> ShowS #

data PlotBars x y #

Value describing how to plot a set of bars. - Note that the input data is typed [(x,[y])], ie for each x value - we plot several y values. Typically the size of each [y] list would - be the same.

Constructors

PlotBars 

Fields

Instances
BarsPlotValue y => Default (PlotBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

def :: PlotBars x y #

plotVectorField :: (PlotValue x, PlotValue y) => PlotVectors x y -> Plot x y #

plot_vectors_values :: Functor f => ([((x, y), (x, y))] -> f [((x, y), (x, y))]) -> PlotVectors x y -> f (PlotVectors x y) #

plot_vectors_title :: Functor f => (String -> f String) -> PlotVectors x y -> f (PlotVectors x y) #

plot_vectors_style :: Functor f => (VectorStyle -> f VectorStyle) -> PlotVectors x y -> f (PlotVectors x y) #

plot_vectors_scale :: Functor f => (Double -> f Double) -> PlotVectors x y -> f (PlotVectors x y) #

plot_vectors_mapf :: Functor f => (((x, y) -> (x, y)) -> f ((x, y) -> (x, y))) -> PlotVectors x y -> f (PlotVectors x y) #

plot_vectors_grid :: Functor f => ([(x, y)] -> f [(x, y)]) -> PlotVectors x y -> f (PlotVectors x y) #

vector_line_style :: Lens' VectorStyle LineStyle #

vector_head_style :: Lens' VectorStyle PointStyle #

data PlotVectors x y #

Constructors

PlotVectors 

Fields

Instances
Default (PlotVectors x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: PlotVectors x y #

data VectorStyle #

Constructors

VectorStyle 

Fields

Instances
Default VectorStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: VectorStyle #

scaledIntAxis :: (Integral i, PlotValue i) => LinearAxisParams i -> (i, i) -> AxisFn i #

autoScaledIntAxis :: (Integral i, PlotValue i) => LinearAxisParams i -> AxisFn i #

defaultIntAxis :: Show a => LinearAxisParams a #

loga_labelf :: (Profunctor p, Functor f) => p ([a1] -> [String]) (f ([a2] -> [String])) -> p (LogAxisParams a1) (f (LogAxisParams a2)) #

la_nTicks :: Functor f => (Int -> f Int) -> LinearAxisParams a -> f (LinearAxisParams a) #

la_nLabels :: Functor f => (Int -> f Int) -> LinearAxisParams a -> f (LinearAxisParams a) #

la_labelf :: Functor f => (([a1] -> [String]) -> f ([a2] -> [String])) -> LinearAxisParams a1 -> f (LinearAxisParams a2) #

autoScaledLogAxis :: RealFloat a => LogAxisParams a -> AxisFn a #

Generate a log axis automatically, scaled appropriate for the - input data.

autoSteps :: Int -> [Double] -> [Double] #

Given a target number of values, and a list of input points, - find evenly spaced values from the set {1*X, 2*X, 2.5*X, 5*X} (where - X is some power of ten) that evenly cover the input points.

autoScaledAxis :: RealFloat a => LinearAxisParams a -> AxisFn a #

Generate a linear axis automatically, scaled appropriately for the - input data.

scaledAxis :: RealFloat a => LinearAxisParams a -> (a, a) -> AxisFn a #

Generate a linear axis with the specified bounds

newtype Percent #

A wrapper class for doubles used to indicate they are to - be plotted against a percentage axis.

Constructors

Percent 

Fields

Instances
Eq Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: Percent -> Percent -> Bool #

(/=) :: Percent -> Percent -> Bool #

Floating Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: Percent #

exp :: Percent -> Percent #

log :: Percent -> Percent #

sqrt :: Percent -> Percent #

(**) :: Percent -> Percent -> Percent #

logBase :: Percent -> Percent -> Percent #

sin :: Percent -> Percent #

cos :: Percent -> Percent #

tan :: Percent -> Percent #

asin :: Percent -> Percent #

acos :: Percent -> Percent #

atan :: Percent -> Percent #

sinh :: Percent -> Percent #

cosh :: Percent -> Percent #

tanh :: Percent -> Percent #

asinh :: Percent -> Percent #

acosh :: Percent -> Percent #

atanh :: Percent -> Percent #

log1p :: Percent -> Percent #

expm1 :: Percent -> Percent #

log1pexp :: Percent -> Percent #

log1mexp :: Percent -> Percent #

Fractional Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: Percent -> Percent -> Percent #

recip :: Percent -> Percent #

fromRational :: Rational -> Percent #

Num Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: Percent -> Percent -> Percent #

(-) :: Percent -> Percent -> Percent #

(*) :: Percent -> Percent -> Percent #

negate :: Percent -> Percent #

abs :: Percent -> Percent #

signum :: Percent -> Percent #

fromInteger :: Integer -> Percent #

Ord Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: Percent -> Percent -> Ordering #

(<) :: Percent -> Percent -> Bool #

(<=) :: Percent -> Percent -> Bool #

(>) :: Percent -> Percent -> Bool #

(>=) :: Percent -> Percent -> Bool #

max :: Percent -> Percent -> Percent #

min :: Percent -> Percent -> Percent #

Real Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: Percent -> Rational #

RealFloat Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: Percent -> Integer #

floatDigits :: Percent -> Int #

floatRange :: Percent -> (Int, Int) #

decodeFloat :: Percent -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Percent #

exponent :: Percent -> Int #

significand :: Percent -> Percent #

scaleFloat :: Int -> Percent -> Percent #

isNaN :: Percent -> Bool #

isInfinite :: Percent -> Bool #

isDenormalized :: Percent -> Bool #

isNegativeZero :: Percent -> Bool #

isIEEE :: Percent -> Bool #

atan2 :: Percent -> Percent -> Percent #

RealFrac Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => Percent -> (b, Percent) #

truncate :: Integral b => Percent -> b #

round :: Integral b => Percent -> b #

ceiling :: Integral b => Percent -> b #

floor :: Integral b => Percent -> b #

Show Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> Percent -> ShowS #

show :: Percent -> String #

showList :: [Percent] -> ShowS #

PlotValue Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: Percent -> Double #

fromValue :: Double -> Percent #

autoAxis :: AxisFn Percent #

newtype LogValue #

A wrapper class for doubles used to indicate they are to - be plotted against a log axis.

Constructors

LogValue Double 
Instances
Eq LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: LogValue -> LogValue -> Bool #

(/=) :: LogValue -> LogValue -> Bool #

Floating LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: LogValue #

exp :: LogValue -> LogValue #

log :: LogValue -> LogValue #

sqrt :: LogValue -> LogValue #

(**) :: LogValue -> LogValue -> LogValue #

logBase :: LogValue -> LogValue -> LogValue #

sin :: LogValue -> LogValue #

cos :: LogValue -> LogValue #

tan :: LogValue -> LogValue #

asin :: LogValue -> LogValue #

acos :: LogValue -> LogValue #

atan :: LogValue -> LogValue #

sinh :: LogValue -> LogValue #

cosh :: LogValue -> LogValue #

tanh :: LogValue -> LogValue #

asinh :: LogValue -> LogValue #

acosh :: LogValue -> LogValue #

atanh :: LogValue -> LogValue #

log1p :: LogValue -> LogValue #

expm1 :: LogValue -> LogValue #

log1pexp :: LogValue -> LogValue #

log1mexp :: LogValue -> LogValue #

Fractional LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: LogValue -> LogValue -> LogValue #

recip :: LogValue -> LogValue #

fromRational :: Rational -> LogValue #

Num LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: LogValue -> LogValue -> LogValue #

(-) :: LogValue -> LogValue -> LogValue #

(*) :: LogValue -> LogValue -> LogValue #

negate :: LogValue -> LogValue #

abs :: LogValue -> LogValue #

signum :: LogValue -> LogValue #

fromInteger :: Integer -> LogValue #

Ord LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: LogValue -> LogValue -> Ordering #

(<) :: LogValue -> LogValue -> Bool #

(<=) :: LogValue -> LogValue -> Bool #

(>) :: LogValue -> LogValue -> Bool #

(>=) :: LogValue -> LogValue -> Bool #

max :: LogValue -> LogValue -> LogValue #

min :: LogValue -> LogValue -> LogValue #

Real LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: LogValue -> Rational #

RealFloat LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: LogValue -> Integer #

floatDigits :: LogValue -> Int #

floatRange :: LogValue -> (Int, Int) #

decodeFloat :: LogValue -> (Integer, Int) #

encodeFloat :: Integer -> Int -> LogValue #

exponent :: LogValue -> Int #

significand :: LogValue -> LogValue #

scaleFloat :: Int -> LogValue -> LogValue #

isNaN :: LogValue -> Bool #

isInfinite :: LogValue -> Bool #

isDenormalized :: LogValue -> Bool #

isNegativeZero :: LogValue -> Bool #

isIEEE :: LogValue -> Bool #

atan2 :: LogValue -> LogValue -> LogValue #

RealFrac LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => LogValue -> (b, LogValue) #

truncate :: Integral b => LogValue -> b #

round :: Integral b => LogValue -> b #

ceiling :: Integral b => LogValue -> b #

floor :: Integral b => LogValue -> b #

Show LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> LogValue -> ShowS #

show :: LogValue -> String #

showList :: [LogValue] -> ShowS #

PlotValue LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: LogValue -> Double #

fromValue :: Double -> LogValue #

autoAxis :: AxisFn LogValue #

data LinearAxisParams a #

Constructors

LinearAxisParams 

Fields

Instances
(Show a, RealFloat a) => Default (LinearAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LinearAxisParams a #

data LogAxisParams a #

Constructors

LogAxisParams 

Fields

Instances
(Show a, RealFloat a) => Default (LogAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LogAxisParams a #

autoIndexAxis :: Integral i => [String] -> [i] -> AxisData i #

Create an axis for values indexed by position. The - list of strings are the labels to be used.

addIndexes :: [a] -> [(PlotIndex, a)] #

Augment a list of values with index numbers for plotting.

newtype PlotIndex #

Type for capturing values plotted by index number - (ie position in a list) rather than a numerical value.

Constructors

PlotIndex 

Fields

Instances
Enum PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

succ :: PlotIndex -> PlotIndex #

pred :: PlotIndex -> PlotIndex #

toEnum :: Int -> PlotIndex #

fromEnum :: PlotIndex -> Int #

enumFrom :: PlotIndex -> [PlotIndex] #

enumFromThen :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromTo :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromThenTo :: PlotIndex -> PlotIndex -> PlotIndex -> [PlotIndex] #

Eq PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(==) :: PlotIndex -> PlotIndex -> Bool #

(/=) :: PlotIndex -> PlotIndex -> Bool #

Integral PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

quot :: PlotIndex -> PlotIndex -> PlotIndex #

rem :: PlotIndex -> PlotIndex -> PlotIndex #

div :: PlotIndex -> PlotIndex -> PlotIndex #

mod :: PlotIndex -> PlotIndex -> PlotIndex #

quotRem :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

divMod :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

toInteger :: PlotIndex -> Integer #

Num PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(+) :: PlotIndex -> PlotIndex -> PlotIndex #

(-) :: PlotIndex -> PlotIndex -> PlotIndex #

(*) :: PlotIndex -> PlotIndex -> PlotIndex #

negate :: PlotIndex -> PlotIndex #

abs :: PlotIndex -> PlotIndex #

signum :: PlotIndex -> PlotIndex #

fromInteger :: Integer -> PlotIndex #

Ord PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

compare :: PlotIndex -> PlotIndex -> Ordering #

(<) :: PlotIndex -> PlotIndex -> Bool #

(<=) :: PlotIndex -> PlotIndex -> Bool #

(>) :: PlotIndex -> PlotIndex -> Bool #

(>=) :: PlotIndex -> PlotIndex -> Bool #

max :: PlotIndex -> PlotIndex -> PlotIndex #

min :: PlotIndex -> PlotIndex -> PlotIndex #

Real PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toRational :: PlotIndex -> Rational #

Show PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

showsPrec :: Int -> PlotIndex -> ShowS #

show :: PlotIndex -> String #

showList :: [PlotIndex] -> ShowS #

PlotValue PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toValue :: PlotIndex -> Double #

fromValue :: Double -> PlotIndex #

autoAxis :: AxisFn PlotIndex #

autoTimeValueAxis :: TimeValue t => AxisFn t #

Automatically choose a suitable time axis, based upon the time range - of data. The values to be plotted against this axis can be created - with doubleFromTimeValue.

years :: TimeSeq #

A TimeSeq for calendar years.

months :: TimeSeq #

A TimeSeq for calendar months.

days :: TimeSeq #

A TimeSeq for calendar days.

timeValueAxis #

Arguments

:: TimeValue t 
=> TimeSeq

Set the minor ticks, and the final range will be aligned to its - elements.

-> TimeSeq

Set the labels and grid.

-> TimeLabelFn 
-> TimeLabelAlignment 
-> TimeSeq

Set the second line of labels.

-> TimeLabelFn

Format t for labels.

-> TimeLabelAlignment 
-> AxisFn t 

Create an AxisFn to for a time axis.

The values to be plotted against this axis can be created with - doubleFromLocalTime.

Implementation detail: PlotValue constraint is needed to use vmap.

class TimeValue t where #

A typeclass abstracting the functions we need - to be able to plot against an axis of time type d.

Minimal complete definition

utctimeFromTV, tvFromUTCTime

Methods

utctimeFromTV :: t -> UTCTime #

tvFromUTCTime :: UTCTime -> t #

doubleFromTimeValue :: t -> Double #

timeValueFromDouble :: Double -> t #

Instances
TimeValue LocalTime 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: LocalTime -> UTCTime #

tvFromUTCTime :: UTCTime -> LocalTime #

doubleFromTimeValue :: LocalTime -> Double #

timeValueFromDouble :: Double -> LocalTime #

TimeValue UTCTime 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: UTCTime -> UTCTime #

tvFromUTCTime :: UTCTime -> UTCTime #

doubleFromTimeValue :: UTCTime -> Double #

timeValueFromDouble :: Double -> UTCTime #

TimeValue Day 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: Day -> UTCTime #

tvFromUTCTime :: UTCTime -> Day #

doubleFromTimeValue :: Day -> Double #

timeValueFromDouble :: Double -> Day #

type TimeSeq = UTCTime -> ([UTCTime], [UTCTime]) #

TimeSeq is a (potentially infinite) set of times. When passed - a reference time, the function returns a a pair of lists. The first - contains all times in the set less than the reference time in - decreasing order. The second contains all times in the set greater - than or equal to the reference time, in increasing order.

type TimeLabelFn = UTCTime -> String #

How to display a time

data TimeLabelAlignment #

Constructors

UnderTicks 
BetweenTicks 
Instances
Show TimeLabelAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

showsPrec :: Int -> TimeLabelAlignment -> ShowS #

show :: TimeLabelAlignment -> String #

showList :: [TimeLabelAlignment] -> ShowS #

unitAxis :: AxisData () #

axis_line_style :: Lens' AxisStyle LineStyle #

axis_label_style :: Lens' AxisStyle FontStyle #

axis_label_gap :: Lens' AxisStyle Double #

axis_grid_style :: Lens' AxisStyle LineStyle #

axis_visibility :: Functor f => (AxisVisibility -> f AxisVisibility) -> AxisData x -> f (AxisData x) #

axis_viewport :: Functor f => ((Range -> x -> Double) -> f (Range -> x -> Double)) -> AxisData x -> f (AxisData x) #

axis_tropweiv :: Functor f => ((Range -> Double -> x) -> f (Range -> Double -> x)) -> AxisData x -> f (AxisData x) #

axis_ticks :: Functor f => ([(x, Double)] -> f [(x, Double)]) -> AxisData x -> f (AxisData x) #

axis_labels :: Functor f => ([[(x, String)]] -> f [[(x, String)]]) -> AxisData x -> f (AxisData x) #

axis_grid :: Functor f => ([x] -> f [x]) -> AxisData x -> f (AxisData x) #

axis_show_ticks :: Lens' AxisVisibility Bool #

axis_show_line :: Lens' AxisVisibility Bool #

axis_show_labels :: Lens' AxisVisibility Bool #

invLinMap :: (Double -> a) -> (a -> Double) -> (a, a) -> Range -> Double -> a #

An inverse linear mapping of points from one range to another.

linMap :: (a -> Double) -> (a, a) -> Range -> a -> Double #

A linear mapping of points in one range to another.

invmap :: PlotValue x => (x, x) -> Range -> Double -> x #

The inverse mapping from device co-ordinate range back to - interesting values.

vmap :: PlotValue x => (x, x) -> Range -> x -> Double #

A linear mapping of points in one range to another.

defaultGridLineStyle :: LineStyle #

The default LineStyle of a plot area grid.

defaultAxisLineStyle :: LineStyle #

The default LineStyle of an axis.

makeAxis' :: Ord x => (x -> Double) -> (Double -> x) -> ([x] -> [String]) -> ([x], [x], [x]) -> AxisData x #

Construct an axis given the positions for ticks, grid lines, and - labels, and the positioning and labelling functions

makeAxis :: PlotValue x => ([x] -> [String]) -> ([x], [x], [x]) -> AxisData x #

Construct an axis given the positions for ticks, grid lines, and - labels, and the labelling function

renderAxisGrid :: RectSize -> AxisT z -> BackendProgram () #

axisOverhang :: Ord x => AxisT x -> BackendProgram (Double, Double) #

Calculate the amount by which the labels extend beyond - the ends of the axis.

axisLabelsOverride :: [(x, String)] -> AxisData x -> AxisData x #

Modifier to change labels on an axis

axisGridAtLabels :: AxisData x -> AxisData x #

Modifier to position grid lines to line up with the labels

axisGridAtBigTicks :: AxisData x -> AxisData x #

Modifier to position grid lines to line up with only the major ticks

axisGridAtTicks :: AxisData x -> AxisData x #

Modifier to position grid lines to line up with the ticks

axisGridHide :: AxisData x -> AxisData x #

Modifier to remove grid lines from an axis

axisToRenderable :: AxisT x -> Renderable x #

Construct a renderable from an axis, in order that - it can be composed with other renderables and drawn. This - does not include the drawing of the grid, which must be done - separately by the renderAxisGrid function.

class Ord a => PlotValue a where #

A typeclass abstracting the functions we need - to be able to plot against an axis of type a

Minimal complete definition

toValue, fromValue, autoAxis

Methods

toValue :: a -> Double #

fromValue :: Double -> a #

autoAxis :: AxisFn a #

Instances
PlotValue Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: Percent -> Double #

fromValue :: Double -> Percent #

autoAxis :: AxisFn Percent #

PlotValue LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: LogValue -> Double #

fromValue :: Double -> LogValue #

autoAxis :: AxisFn LogValue #

PlotValue PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toValue :: PlotIndex -> Double #

fromValue :: Double -> PlotIndex #

autoAxis :: AxisFn PlotIndex #

data AxisVisibility #

Configures whick visual elements of a axis are shown at the - appropriate edge of a plot area.

Constructors

AxisVisibility 

Fields

Instances
Default AxisVisibility

By default all parts of a axis are visible.

Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisVisibility #

data AxisData x #

The basic data associated with an axis showing values of type x.

Constructors

AxisData 

Fields

  • _axis_visibility :: AxisVisibility

    Which parts of the axis shall be displayed.

  • _axis_viewport :: Range -> x -> Double

    The _axis_viewport function maps values into device coordinates.

  • _axis_tropweiv :: Range -> Double -> x

    The _axis_tropweiv function maps device coordinates back to values.

  • _axis_ticks :: [(x, Double)]

    The tick marks on the axis as pairs. - The first element is the position on the axis - (in viewport units) and the second element is the - length of the tick in output coordinates. - The tick starts on the axis, and positive numbers are drawn - towards the plot area.

  • _axis_labels :: [[(x, String)]]

    The labels on an axis as pairs. The first element of the pair - is the position on the axis (in viewport units) and the - second is the label text string. Note that multiple sets of - labels can be specified, and are shown successively further - away from the axis line.

  • _axis_grid :: [x]

    The positions on the axis (in viewport units) where - we want to show grid lines.

_axis_line_style :: AxisStyle -> LineStyle #

LineStyle to use for axis line and ticks.

_axis_label_style :: AxisStyle -> FontStyle #

FontStyle to use for axis labels.

_axis_grid_style :: AxisStyle -> LineStyle #

LineStyle to use for axis grid.

_axis_label_gap :: AxisStyle -> Double #

How far the labels are to be drawn from the axis.

type AxisFn x = [x] -> AxisData x #

A function to generate the axis data, given the data values - to be plotted against it.

data AxisT x #

Collect the information we need to render an axis. The - bool is true if the axis direction is reversed.

Constructors

AxisT RectEdge AxisStyle Bool (AxisData x) 

legend_position :: Lens' LegendStyle LegendPosition #

legend_plot_size :: Lens' LegendStyle Double #

legend_orientation :: Lens' LegendStyle LegendOrientation #

legend_margin :: Lens' LegendStyle Double #

legend_label_style :: Lens' LegendStyle FontStyle #

legendToRenderable :: Legend x y -> Renderable String #

data LegendStyle #

Constructors

LegendStyle 

Fields

Instances
Default LegendStyle 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

def :: LegendStyle #

data LegendOrientation #

Legends can be constructed in two orientations: in rows - (where we specify the maximum number of columns), and in - columns (where we specify the maximum number of rows)

Constructors

LORows Int 
LOCols Int 

data LegendPosition #

Defines the position of the legend, relative to the plot.

Constructors

LegendAbove 
LegendBelow 
LegendRight 
LegendLeft 

pitem_value :: Lens' PieItem Double #

pitem_offset :: Lens' PieItem Double #

pitem_label :: Lens' PieItem String #

pie_start_angle :: Lens' PieChart Double #

pie_label_style :: Lens' PieChart FontStyle #

pie_label_line_style :: Lens' PieChart LineStyle #

pie_data :: Lens' PieChart [PieItem] #

pie_colors :: Lens' PieChart [AlphaColour Double] #

pie_title_style :: Lens' PieLayout FontStyle #

pie_title :: Lens' PieLayout String #

pie_plot :: Lens' PieLayout PieChart #

pie_margin :: Lens' PieLayout Double #

pie_background :: Lens' PieLayout FillStyle #

pieToRenderable :: PieLayout -> Renderable (PickFn a) #

pieChartToRenderable :: PieChart -> Renderable (PickFn a) #

data PieLayout #

Constructors

PieLayout 

Fields

Instances
Default PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieLayout #

ToRenderable PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieLayout -> Renderable () #

data PieChart #

Constructors

PieChart 

Fields

Instances
Default PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieChart #

ToRenderable PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieChart -> Renderable () #

data PieItem #

Constructors

PieItem 

Fields

Instances
Default PieItem 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieItem #

plot_annotation_vanchor :: Functor f => (VTextAnchor -> f VTextAnchor) -> PlotAnnotation x y -> f (PlotAnnotation x y) #

plot_annotation_values :: Functor f => ([(x1, y1, String)] -> f [(x2, y2, String)]) -> PlotAnnotation x1 y1 -> f (PlotAnnotation x2 y2) #

plot_annotation_style :: Functor f => (FontStyle -> f FontStyle) -> PlotAnnotation x y -> f (PlotAnnotation x y) #

plot_annotation_hanchor :: Functor f => (HTextAnchor -> f HTextAnchor) -> PlotAnnotation x y -> f (PlotAnnotation x y) #

plot_annotation_background :: Functor f => (Rectangle -> f Rectangle) -> PlotAnnotation x y -> f (PlotAnnotation x y) #

plot_annotation_angle :: Functor f => (Double -> f Double) -> PlotAnnotation x y -> f (PlotAnnotation x y) #

data PlotAnnotation x y #

Value for describing a series of text annotations - to be placed at arbitrary points on the graph. Annotations - can be rotated and styled.

Constructors

PlotAnnotation 

Fields

Instances
ToPlot PlotAnnotation 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

toPlot :: PlotAnnotation x y -> Plot x y #

Default (PlotAnnotation x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

def :: PlotAnnotation x y #

rect_minsize :: Lens' Rectangle RectSize #

rect_lineStyle :: Lens' Rectangle (Maybe LineStyle) #

rect_fillStyle :: Lens' Rectangle (Maybe FillStyle) #

rect_cornerStyle :: Lens' Rectangle RectCornerStyle #

drawRectangle :: Point -> Rectangle -> BackendProgram (PickFn a) #

Draw the specified rectangle such that its top-left vertex is placed at - the given position

rectangleToRenderable :: Rectangle -> Renderable a #

rlabel :: FontStyle -> HTextAnchor -> VTextAnchor -> Double -> String -> Renderable String #

Construct a renderable from a text string, rotated wrt to axes. The angle - of rotation is in degrees, measured clockwise from the horizontal.

label :: FontStyle -> HTextAnchor -> VTextAnchor -> String -> Renderable String #

Construct a renderable from a text string, aligned with the axes.

embedRenderable :: BackendProgram (Renderable a) -> Renderable a #

Helper function for using a renderable, when we generate it - in the BackendProgram monad.

fillBackground :: FillStyle -> Renderable a -> Renderable a #

Overlay a renderable over a solid background fill.

addMargins #

Arguments

:: (Double, Double, Double, Double)

The spacing to be added.

-> Renderable a

The source renderable.

-> Renderable a 

Add some spacing at the edges of a renderable.

mapPickFn :: (a -> b) -> Renderable a -> Renderable b #

Map a function over result of a renderable's pickfunction.

mapMaybePickFn :: (a -> Maybe b) -> Renderable a -> Renderable b #

Map a function over the result of a renderable's pickfunction, keeping only Just results.

setPickFn :: PickFn b -> Renderable a -> Renderable b #

Replace the pick function of a renderable with another.

spacer1 :: Renderable a -> Renderable b #

Create a blank renderable with a minimum size the same as - some other renderable.

spacer :: RectSize -> Renderable a #

Create a blank renderable with a specified minimum size.

emptyRenderable :: Renderable a #

nullPickFn :: PickFn a #

type PickFn a = Point -> Maybe a #

A function that maps a point in device coordinates to some value.

Perhaps it might be generalised from Maybe a to - (MonadPlus m ) => m a in the future.

data Renderable a #

A Renderable is a record of functions required to layout a - graphic element.

Constructors

Renderable 

Fields

Instances
Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

ToRenderable (Renderable a) 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Renderable a -> Renderable () #

ToPNG (Renderable a) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> Renderable a -> IO () #

class ToRenderable a where #

A type class abtracting the conversion of a value to a Renderable.

Minimal complete definition

toRenderable

Methods

toRenderable :: a -> Renderable () #

Instances
ToRenderable PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieLayout -> Renderable () #

ToRenderable PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieChart -> Renderable () #

ToRenderable Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Rectangle -> Renderable () #

Ord x => ToRenderable (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: StackedLayouts x -> Renderable () #

ToRenderable a => ToRenderable (Grid a) 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

toRenderable :: Grid a -> Renderable () #

ToRenderable (Renderable a) 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Renderable a -> Renderable () #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

(Ord x, Ord y) => ToRenderable (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: Layout x y -> Renderable () #

ToRenderable (Legend x y) 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

toRenderable :: Legend x y -> Renderable () #

(Ord x, Ord yl, Ord yr) => ToRenderable (LayoutLR x yl yr) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: LayoutLR x yl yr -> Renderable () #

data RectCornerStyle #

Constructors

RCornerSquare 
RCornerBevel Double 
RCornerRounded Double 

data Rectangle #

Constructors

Rectangle 

Fields

Instances
Default Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

def :: Rectangle #

ToRenderable Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Rectangle -> Renderable () #

plot_candle_width :: Functor f => (Double -> f Double) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_values :: Functor f => ([Candle x1 y1] -> f [Candle x2 y2]) -> PlotCandle x1 y1 -> f (PlotCandle x2 y2) #

plot_candle_title :: Functor f => (String -> f String) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_tick_length :: Functor f => (Double -> f Double) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_rise_fill_style :: Functor f => (FillStyle -> f FillStyle) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_line_style :: Functor f => (LineStyle -> f LineStyle) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_fill :: Functor f => (Bool -> f Bool) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_fall_fill_style :: Functor f => (FillStyle -> f FillStyle) -> PlotCandle x y -> f (PlotCandle x y) #

plot_candle_centre :: Functor f => (Double -> f Double) -> PlotCandle x y -> f (PlotCandle x y) #

data PlotCandle x y #

Value defining a financial interval: opening and closing prices, with - maxima and minima; and a style in which to render them. - By convention, there are different fill styles depending on whether - the price rises (open < close) or falls (close < open). - (This plot type can also be re-purposed for statistical intervals, e.g. - minimum, first quartile, median, third quartile, maximum.)

Constructors

PlotCandle 

Fields

Instances
ToPlot PlotCandle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

toPlot :: PlotCandle x y -> Plot x y #

Default (PlotCandle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

def :: PlotCandle x y #

data Candle x y #

A Value holding price intervals for a given x-coord. - An alternative view is that these are statistical intervals: the - 0th, 25th, 50th, 75th, and 100th percentiles.

Constructors

Candle 

Fields

Instances
(Show x, Show y) => Show (Candle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

showsPrec :: Int -> Candle x y -> ShowS #

show :: Candle x y -> String #

showList :: [Candle x y] -> ShowS #

plot_errbars_values :: Functor f => ([ErrPoint x1 y1] -> f [ErrPoint x2 y2]) -> PlotErrBars x1 y1 -> f (PlotErrBars x2 y2) #

plot_errbars_title :: Functor f => (String -> f String) -> PlotErrBars x y -> f (PlotErrBars x y) #

plot_errbars_tick_length :: Functor f => (Double -> f Double) -> PlotErrBars x y -> f (PlotErrBars x y) #

plot_errbars_overhang :: Functor f => (Double -> f Double) -> PlotErrBars x y -> f (PlotErrBars x y) #

plot_errbars_line_style :: Functor f => (LineStyle -> f LineStyle) -> PlotErrBars x y -> f (PlotErrBars x y) #

symErrPoint :: (Num a, Num b) => a -> b -> a -> b -> ErrPoint a b #

When the error is symmetric, we can simply pass in dx for the error.

data ErrValue x #

Value for holding a point with associated error bounds for each axis.

Constructors

ErrValue 

Fields

Instances
Show x => Show (ErrValue x) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrValue x -> ShowS #

show :: ErrValue x -> String #

showList :: [ErrValue x] -> ShowS #

data ErrPoint x y #

Constructors

ErrPoint 

Fields

Instances
(Show x, Show y) => Show (ErrPoint x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrPoint x y -> ShowS #

show :: ErrPoint x y -> String #

showList :: [ErrPoint x y] -> ShowS #

data PlotErrBars x y #

Value defining a series of error intervals, and a style in - which to render them.

Constructors

PlotErrBars 

Fields

Instances
ToPlot PlotErrBars 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

toPlot :: PlotErrBars x y -> Plot x y #

Default (PlotErrBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

def :: PlotErrBars x y #

plot_fillbetween_values :: Functor f => ([(x1, (y1, y1))] -> f [(x2, (y2, y2))]) -> PlotFillBetween x1 y1 -> f (PlotFillBetween x2 y2) #

plot_fillbetween_title :: Functor f => (String -> f String) -> PlotFillBetween x y -> f (PlotFillBetween x y) #

plot_fillbetween_style :: Functor f => (FillStyle -> f FillStyle) -> PlotFillBetween x y -> f (PlotFillBetween x y) #

data PlotFillBetween x y #

Value specifying a plot filling the area between two sets of Y - coordinates, given common X coordinates.

Constructors

PlotFillBetween 

Fields

Instances
ToPlot PlotFillBetween 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

toPlot :: PlotFillBetween x y -> Plot x y #

Default (PlotFillBetween x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

def :: PlotFillBetween x y #

plot_hidden_y_values :: Functor f => ([y1] -> f [y2]) -> PlotHidden x y1 -> f (PlotHidden x y2) #

plot_hidden_x_values :: Functor f => ([x1] -> f [x2]) -> PlotHidden x1 y -> f (PlotHidden x2 y) #

data PlotHidden x y #

Value defining some hidden x and y values. The values are - not displayed, but they still affect axis scaling.

Constructors

PlotHidden 

Fields

Instances
ToPlot PlotHidden 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Hidden

Methods

toPlot :: PlotHidden x y -> Plot x y #

plot_lines_values :: Functor f => ([[(x, y)]] -> f [[(x, y)]]) -> PlotLines x y -> f (PlotLines x y) #

plot_lines_title :: Functor f => (String -> f String) -> PlotLines x y -> f (PlotLines x y) #

plot_lines_style :: Functor f => (LineStyle -> f LineStyle) -> PlotLines x y -> f (PlotLines x y) #

plot_lines_limit_values :: Functor f => ([[(Limit x, Limit y)]] -> f [[(Limit x, Limit y)]]) -> PlotLines x y -> f (PlotLines x y) #

vlinePlot :: String -> LineStyle -> a -> Plot a b #

Helper function to plot a single vertical line.

hlinePlot :: String -> LineStyle -> b -> Plot a b #

Helper function to plot a single horizontal line.

defaultPlotLineStyle :: LineStyle #

data PlotLines x y #

Value defining a series of (possibly disjointed) lines, - and a style in which to render them.

Constructors

PlotLines 

Fields

Instances
ToPlot PlotLines 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

toPlot :: PlotLines x y -> Plot x y #

Default (PlotLines x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

def :: PlotLines x y #

plot_points_values :: Functor f => ([(x1, y1)] -> f [(x2, y2)]) -> PlotPoints x1 y1 -> f (PlotPoints x2 y2) #

plot_points_title :: Functor f => (String -> f String) -> PlotPoints x y -> f (PlotPoints x y) #

plot_points_style :: Functor f => (PointStyle -> f PointStyle) -> PlotPoints x y -> f (PlotPoints x y) #

data PlotPoints x y #

Value defining a series of datapoints, and a style in - which to render them.

Constructors

PlotPoints 

Fields

Instances
ToPlot PlotPoints 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

toPlot :: PlotPoints x y -> Plot x y #

Default (PlotPoints x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

def :: PlotPoints x y #

plot_render :: Functor f => ((PointMapFn x y -> BackendProgram ()) -> f (PointMapFn x y -> BackendProgram ())) -> Plot x y -> f (Plot x y) #

plot_legend :: Functor f => ([(String, Rect -> BackendProgram ())] -> f [(String, Rect -> BackendProgram ())]) -> Plot x y -> f (Plot x y) #

plot_all_points :: Functor f => (([x], [y]) -> f ([x], [y])) -> Plot x y -> f (Plot x y) #

mapXY :: PointMapFn x y -> (x, y) -> Point #

joinPlot :: Plot x y -> Plot x y -> Plot x y #

Join any two plots together (they will share a legend).

_plot_render :: Plot x y -> PointMapFn x y -> BackendProgram () #

Given the mapping between model space coordinates and device - coordinates, render this plot into a chart.

_plot_legend :: Plot x y -> [(String, Rect -> BackendProgram ())] #

Details for how to show this plot in a legend. For each item - the string is the text to show, and the function renders a - graphical sample of the plot.

_plot_all_points :: Plot x y -> ([x], [y]) #

All of the model space coordinates to be plotted. These are - used to autoscale the axes where necessary.

class ToPlot (a :: * -> * -> *) where #

A type class abstracting the conversion of a value to a Plot.

Minimal complete definition

toPlot

Methods

toPlot :: a x y -> Plot x y #

Instances
ToPlot PlotAnnotation 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

toPlot :: PlotAnnotation x y -> Plot x y #

ToPlot PlotCandle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

toPlot :: PlotCandle x y -> Plot x y #

ToPlot PlotErrBars 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

toPlot :: PlotErrBars x y -> Plot x y #

ToPlot PlotFillBetween 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

toPlot :: PlotFillBetween x y -> Plot x y #

ToPlot PlotHidden 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Hidden

Methods

toPlot :: PlotHidden x y -> Plot x y #

ToPlot PlotLines 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

toPlot :: PlotLines x y -> Plot x y #

ToPlot PlotPoints 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

toPlot :: PlotPoints x y -> Plot x y #

ToPlot Plot 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Types

Methods

toPlot :: Plot x y -> Plot x y #

PlotValue z => ToPlot (AreaSpots z) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots z x y -> Plot x y #

(PlotValue z, PlotValue t, Show t) => ToPlot (AreaSpots4D z t) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots4D z t x y -> Plot x y #

point_shape :: Lens' PointStyle PointShape #

point_radius :: Lens' PointStyle Double #

point_color :: Lens' PointStyle (AlphaColour Double) #

point_border_width :: Lens' PointStyle Double #

point_border_color :: Lens' PointStyle (AlphaColour Double) #

solidFillStyle :: AlphaColour Double -> FillStyle #

Fill style that fill everything this the given colour.

arrows #

Arguments

:: Double

Radius of circle.

-> Double

Rotation (Tau)

-> Double

Thickness of line.

-> AlphaColour Double

Color of line.

-> PointStyle 

stars #

Arguments

:: Double

Radius of circle.

-> Double

Thickness of line.

-> AlphaColour Double

Color of line.

-> PointStyle 

Combination of plus and cross point style.

exes #

Arguments

:: Double

Radius of circle.

-> Double

Thickness of line.

-> AlphaColour Double

Color of line.

-> PointStyle 

Cross point style.

plusses #

Arguments

:: Double

Radius of tightest surrounding circle.

-> Double

Thickness of line.

-> AlphaColour Double

Color of line.

-> PointStyle 

Plus sign point style.

filledPolygon #

Arguments

:: Double

Radius of circle.

-> Int

Number of vertices.

-> Bool

Is right-side-up?

-> AlphaColour Double

Fill color.

-> PointStyle 

Style for filled polygon points.

hollowPolygon #

Arguments

:: Double

Radius of circle.

-> Double

Thickness of line.

-> Int

Number of vertices.

-> Bool

Is right-side-up?

-> AlphaColour Double

Colour of line.

-> PointStyle 

Style for stroked polygon points.

hollowCircles #

Arguments

:: Double

Radius of circle.

-> Double

Thickness of line.

-> AlphaColour Double 
-> PointStyle 

Style for stroked circle points.

filledCircles #

Arguments

:: Double

Radius of circle.

-> AlphaColour Double

Fill colour.

-> PointStyle 

Style for filled circle points.

dashedLine #

Arguments

:: Double

Width of line.

-> [Double]

The dash pattern in device coordinates.

-> AlphaColour Double

Colour of line.

-> LineStyle 

Create a dashed line style.

solidLine #

Arguments

:: Double

Width of line.

-> AlphaColour Double

Colour of line.

-> LineStyle 

Create a solid line style (not dashed).

defaultColorSeq :: [AlphaColour Double] #

The default sequence of colours to use when plotings different data sets - in a graph.

drawPoint #

Arguments

:: PointStyle

Style to use when rendering the point.

-> Point

Position of the point to render.

-> BackendProgram () 

Draw a single point at the given location.

textDimension :: String -> BackendProgram RectSize #

Get the width and height of the string when rendered. - See textSize.

textDrawRect :: HTextAnchor -> VTextAnchor -> Point -> String -> BackendProgram Rect #

Return the bounding rectangle for a text string positioned - where it would be drawn by drawText. - See textSize.

drawTextsR :: HTextAnchor -> VTextAnchor -> Double -> Point -> String -> BackendProgram () #

Draw a multi-line textual label anchored by one of its corners - or edges, with rotation. Rotation angle is given in degrees, - rotation is performed around anchor point. - See drawText.

drawTextR :: HTextAnchor -> VTextAnchor -> Double -> Point -> String -> BackendProgram () #

Draw a textual label anchored by one of its corners - or edges, with rotation. Rotation angle is given in degrees, - rotation is performed around anchor point. - See drawText.

drawTextA :: HTextAnchor -> VTextAnchor -> Point -> String -> BackendProgram () #

Draw a line of text that is aligned at a different anchor point. - See drawText.

fillPointPath :: [Point] -> BackendProgram () #

Fill the region with the given corners.

strokePointPath :: [Point] -> BackendProgram () #

Draw lines between the specified points.

alignFillPoint :: Point -> BackendProgram Point #

Align the point using the environment's alignment function for coordinates. - See getCoordAlignFn.

alignStrokePoint :: Point -> BackendProgram Point #

Align the point using the environment's alignment function for points. - See getPointAlignFn.

alignFillPoints :: [Point] -> BackendProgram [Point] #

The points will be aligned by the getCoordAlignFn, so that - when drawing bitmaps, the edges of the region will fall between - pixels.

alignStrokePoints :: [Point] -> BackendProgram [Point] #

The points will be aligned by the getPointAlignFn, so that - when drawing bitmaps, 1 pixel wide lines will be centred on the - pixels.

alignFillPath :: Path -> BackendProgram Path #

Align the path using the environment's alignment function for coordinates. - This is generally useful when filling. - See alignPath and getCoordAlignFn.

alignStrokePath :: Path -> BackendProgram Path #

Align the path using the environment's alignment function for points. - This is generally useful when stroking. - See alignPath and getPointAlignFn.

alignPath :: (Point -> Point) -> Path -> Path #

Align the path by applying the given function on all points.

withDefaultStyle :: BackendProgram a -> BackendProgram a #

withPointStyle :: PointStyle -> BackendProgram a -> BackendProgram a #

Changes the LineStyle and FillStyle to comply with - the given PointStyle.

withScaleY :: Double -> BackendProgram a -> BackendProgram a #

Apply a local scale on the y-axis.

withScaleX :: Double -> BackendProgram a -> BackendProgram a #

Apply a local scale on the x-axis.

withScale :: Vector -> BackendProgram a -> BackendProgram a #

Apply a local scale.

withTranslation :: Point -> BackendProgram a -> BackendProgram a #

Apply a local translation.

withRotation :: Double -> BackendProgram a -> BackendProgram a #

Apply a local rotation. The angle is given in radians.

data PointShape #

The different shapes a point can have.

Constructors

PointShapeCircle

A circle.

PointShapePolygon Int Bool

Number of vertices and is right-side-up?

PointShapePlus

A plus sign.

PointShapeCross

A cross.

PointShapeStar

Combination of a cross and a plus.

PointShapeArrowHead Double 
PointShapeEllipse Double Double

Ratio of minor to major axis and rotation

data PointStyle #

Abstract data type for the style of a plotted point.

Constructors

PointStyle 

Fields

Instances
Default PointStyle

Default style to use for points.

Instance details

Defined in Graphics.Rendering.Chart.Drawing

Methods

def :: PointStyle #

getCoordAlignFn :: BackendProgram (Point -> Point) #

Get the coordinate alignment function

getPointAlignFn :: BackendProgram (Point -> Point) #

Get the point alignment function

withClipRegion :: Rect -> BackendProgram a -> BackendProgram a #

Use the given clipping rectangle when drawing - in this local environment. The new clipping region - is intersected with the given clip region. You cannot - escape the clip!

withLineStyle :: LineStyle -> BackendProgram a -> BackendProgram a #

Use the given line style in this local - environment when stroking paths.

withFillStyle :: FillStyle -> BackendProgram a -> BackendProgram a #

Use the given fill style in this local - environment when filling paths.

withFontStyle :: FontStyle -> BackendProgram a -> BackendProgram a #

Use the given font style in this local - environment when drawing text.

An implementing backend is expected to guarentee - to support the following font families: serif, sans-serif and monospace;

If the backend is not able to find or load a given font - it is required to fall back to a custom fail-safe font - and use it instead.

withTransform :: Matrix -> BackendProgram a -> BackendProgram a #

Apply the given transformation in this local - environment when drawing. The given transformation - is applied after the current transformation. This - means both are combined.

drawText :: Point -> String -> BackendProgram () #

Draw a single-line textual label anchored by the baseline (vertical) - left (horizontal) point. Uses the current FontStyle for drawing.

textSize :: String -> BackendProgram TextSize #

Calculate a TextSize object with rendering information - about the given string without actually rendering it.

fillPath :: Path -> BackendProgram () #

Fill the given path using the current FillStyle. - The given path will be closed prior to filling. - This function does not perform - alignment operations on the path. - See Path for the exact semantic of paths.

strokePath :: Path -> BackendProgram () #

Stroke the outline of the given path using the - current LineStyle. This function does not perform - alignment operations on the path. See Path for the exact semantic - of paths.

type BackendProgram a = Program ChartBackendInstr a #

A BackendProgram provides the capability to render a chart somewhere.

The coordinate system of the backend has its initial origin (0,0) - in the top left corner of the drawing plane. The x-axis points - towards the top right corner and the y-axis points towards - the bottom left corner. The unit used by coordinates, the font size, - and lengths is the always the same, but depends on the backend. - All angles are measured in radians.

The line, fill and font style are set to their default values - initially.

Information about the semantics of the instructions can be - found in the documentation of ChartBackendInstr.

fill_color :: Iso' FillStyle (AlphaColour Double) #

font_weight :: Lens' FontStyle FontWeight #

font_slant :: Lens' FontStyle FontSlant #

font_size :: Lens' FontStyle Double #

font_name :: Lens' FontStyle String #

font_color :: Lens' FontStyle (AlphaColour Double) #

line_width :: Lens' LineStyle Double #

line_join :: Lens' LineStyle LineJoin #

line_dashes :: Lens' LineStyle [Double] #

line_color :: Lens' LineStyle (AlphaColour Double) #

line_cap :: Lens' LineStyle LineCap #

vectorAlignmentFns :: AlignmentFns #

Alignment to render on vector based graphics.

bitmapAlignmentFns :: AlignmentFns #

Alignment to render on raster based graphics.

data LineCap #

The different supported line ends.

Constructors

LineCapButt

Just cut the line straight.

LineCapRound

Make a rounded line end.

LineCapSquare

Make a square that ends the line.

Instances
Eq LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineCap -> LineCap -> Bool #

(/=) :: LineCap -> LineCap -> Bool #

Ord LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineCap -> LineCap -> Ordering #

(<) :: LineCap -> LineCap -> Bool #

(<=) :: LineCap -> LineCap -> Bool #

(>) :: LineCap -> LineCap -> Bool #

(>=) :: LineCap -> LineCap -> Bool #

max :: LineCap -> LineCap -> LineCap #

min :: LineCap -> LineCap -> LineCap #

Show LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineCap -> ShowS #

show :: LineCap -> String #

showList :: [LineCap] -> ShowS #

data LineJoin #

The different supported ways to join line ends.

Constructors

LineJoinMiter

Extends the outline until they meet each other.

LineJoinRound

Draw a circle fragment to connet line end.

LineJoinBevel

Like miter, but cuts it off if a certain - threshold is exceeded.

Instances
Eq LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineJoin -> LineJoin -> Bool #

(/=) :: LineJoin -> LineJoin -> Bool #

Ord LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineJoin -> LineJoin -> Ordering #

(<) :: LineJoin -> LineJoin -> Bool #

(<=) :: LineJoin -> LineJoin -> Bool #

(>) :: LineJoin -> LineJoin -> Bool #

(>=) :: LineJoin -> LineJoin -> Bool #

max :: LineJoin -> LineJoin -> LineJoin #

min :: LineJoin -> LineJoin -> LineJoin #

Show LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineJoin -> ShowS #

show :: LineJoin -> String #

showList :: [LineJoin] -> ShowS #

data LineStyle #

Data type for the style of a line.

Constructors

LineStyle 

Fields

Instances
Eq LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineStyle -> LineStyle -> Bool #

(/=) :: LineStyle -> LineStyle -> Bool #

Show LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineStyle -> ShowS #

show :: LineStyle -> String #

showList :: [LineStyle] -> ShowS #

Default LineStyle

The default line style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: LineStyle #

data FontSlant #

The possible slants of a font.

Constructors

FontSlantNormal

Normal font style without slant.

FontSlantItalic

With a slight slant.

FontSlantOblique

With a greater slant.

Instances
Eq FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Ord FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Show FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontSlant -> ShowS #

show :: FontSlant -> String #

showList :: [FontSlant] -> ShowS #

Default FontSlant

The default font slant.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontSlant #

data FontWeight #

The possible weights of a font.

Constructors

FontWeightNormal

Normal font style without weight.

FontWeightBold

Bold font.

Instances
Eq FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Ord FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Show FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontWeight -> ShowS #

show :: FontWeight -> String #

showList :: [FontWeight] -> ShowS #

Default FontWeight

The default font weight.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontWeight #

data FontStyle #

Data type for a font.

Constructors

FontStyle 

Fields

Instances
Eq FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontStyle -> FontStyle -> Bool #

(/=) :: FontStyle -> FontStyle -> Bool #

Show FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontStyle -> ShowS #

show :: FontStyle -> String #

showList :: [FontStyle] -> ShowS #

Default FontStyle

The default font style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontStyle #

data HTextAnchor #

Possible horizontal anchor points for text.

Constructors

HTA_Left 
HTA_Centre 
HTA_Right 
Instances
Eq HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: HTextAnchor -> HTextAnchor -> Bool #

(/=) :: HTextAnchor -> HTextAnchor -> Bool #

Ord HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: HTextAnchor -> HTextAnchor -> Ordering #

(<) :: HTextAnchor -> HTextAnchor -> Bool #

(<=) :: HTextAnchor -> HTextAnchor -> Bool #

(>) :: HTextAnchor -> HTextAnchor -> Bool #

(>=) :: HTextAnchor -> HTextAnchor -> Bool #

max :: HTextAnchor -> HTextAnchor -> HTextAnchor #

min :: HTextAnchor -> HTextAnchor -> HTextAnchor #

Show HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> HTextAnchor -> ShowS #

show :: HTextAnchor -> String #

showList :: [HTextAnchor] -> ShowS #

data VTextAnchor #

Possible vertical anchor points for text.

Constructors

VTA_Top 
VTA_Centre 
VTA_Bottom 
VTA_BaseLine 
Instances
Eq VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: VTextAnchor -> VTextAnchor -> Bool #

(/=) :: VTextAnchor -> VTextAnchor -> Bool #

Ord VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: VTextAnchor -> VTextAnchor -> Ordering #

(<) :: VTextAnchor -> VTextAnchor -> Bool #

(<=) :: VTextAnchor -> VTextAnchor -> Bool #

(>) :: VTextAnchor -> VTextAnchor -> Bool #

(>=) :: VTextAnchor -> VTextAnchor -> Bool #

max :: VTextAnchor -> VTextAnchor -> VTextAnchor #

min :: VTextAnchor -> VTextAnchor -> VTextAnchor #

Show VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> VTextAnchor -> ShowS #

show :: VTextAnchor -> String #

showList :: [VTextAnchor] -> ShowS #

data TextSize #

Text metrics returned by textSize.

Constructors

TextSize 

Fields

Instances
Eq TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: TextSize -> TextSize -> Bool #

(/=) :: TextSize -> TextSize -> Bool #

Show TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> TextSize -> ShowS #

show :: TextSize -> String #

showList :: [TextSize] -> ShowS #

newtype FillStyle #

Abstract data type for a fill style.

The contained action sets the required fill - style in the rendering state.

Constructors

FillStyleSolid 

Fields

Instances
Eq FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FillStyle -> FillStyle -> Bool #

(/=) :: FillStyle -> FillStyle -> Bool #

Show FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FillStyle -> ShowS #

show :: FillStyle -> String #

showList :: [FillStyle] -> ShowS #

Default FillStyle

The default fill style.

Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FillStyle #

type AlignmentFn = Point -> Point #

A function to align points for a certain rendering device.

data AlignmentFns #

Holds the point and coordinate alignment function.

Constructors

AlignmentFns 

Fields

  • afPointAlignFn :: AlignmentFn

    An adjustment applied immediately prior to points - being displayed in device coordinates.

    When device coordinates correspond to pixels, a cleaner - image is created if this transform rounds to the nearest - pixel. With higher-resolution output, this transform can - just be the identity function.

    This is usually used to align prior to stroking.

  • afCoordAlignFn :: AlignmentFn

    The adjustment applied immediately prior to coordinates - being transformed.

    This is usually used to align prior to filling.

invert :: Matrix -> Matrix #

Copied from Graphics.Rendering.Cairo.Matrix

adjoint :: Matrix -> Matrix #

Copied from Graphics.Rendering.Cairo.Matrix

scalarMultiply :: Double -> Matrix -> Matrix #

Copied from Graphics.Rendering.Cairo.Matrix

rotate :: Double -> Matrix -> Matrix #

Copied from Graphics.Rendering.Cairo.Matrix - Rotations angle is given in radians.

scale :: Vector -> Matrix -> Matrix #

Copied and adopted from Graphics.Rendering.Cairo.Matrix

translate :: Vector -> Matrix -> Matrix #

Copied and adopted from Graphics.Rendering.Cairo.Matrix

identity :: Matrix #

Copied from Graphics.Rendering.Cairo.Matrix

translateP :: Vector -> Point -> Point #

Translate a point.

scaleP :: Vector -> Point -> Point #

Scale a point.

rotateP :: Double -> Point -> Point #

Rotate a point around the origin. - The angle is given in radians.

transformP :: Matrix -> Point -> Point #

Transform a point using the given matrix.

makeLinesExplicit :: Path -> Path #

Enriches the path with explicit instructions to draw lines, - that otherwise would be implicit. See Path for details - about what lines in paths are implicit.

foldPath #

Arguments

:: Monoid m 
=> (Point -> m)

MoveTo

-> (Point -> m)

LineTo

-> (Point -> Double -> Double -> Double -> m)

Arc

-> (Point -> Double -> Double -> Double -> m)

ArcNeg

-> m

Close

-> Path

Path to fold

-> m 

Fold the given path to a monoid structure.

close :: Path #

A closed empty path. Closes a path when appended.

arcNeg' :: Double -> Double -> Double -> Double -> Double -> Path #

Short-cut for arcNeg, if you don't want to create a Point.

arcNeg :: Point -> Double -> Double -> Double -> Path #

Like arc, but draws from the stop angle to the start angle - instead of between them.

arc' :: Double -> Double -> Double -> Double -> Double -> Path #

Short-cut for arc, if you don't want to create a Point.

arc #

Arguments

:: Point

Center point of the circle arc.

-> Double

Radius of the circle.

-> Double

Angle to start drawing at, in radians.

-> Double

Angle to stop drawing at, in radians.

-> Path 

Draw the arc of a circle. A straight line connects - the end of the previous path with the beginning of the arc. - The zero angle points in direction of the positive x-axis. - Angles increase in clock-wise direction. If the stop angle - is smaller then the start angle it is increased by multiples of - 2 * pi until is is greater or equal.

lineTo' :: Double -> Double -> Path #

Short-cut for lineTo, if you don't want to create a Point.

lineTo :: Point -> Path #

Move the paths pointer to the given location and draw a straight - line while doing so.

moveTo' :: Double -> Double -> Path #

Short-cut for moveTo, if you don't want to create a Point.

moveTo :: Point -> Path #

Move the paths pointer to the given location.

rectPath :: Rect -> Path #

Make a path from a rectangle.

intersectRect :: Limit Rect -> Limit Rect -> Limit Rect #

Intersects the rectangles. If they intersect the - intersection rectangle is returned. - LMin is the empty rectangle / intersection and - LMax is the infinite plane.

within :: Point -> Rect -> Bool #

Test if a point is within a rectangle.

mkrect :: Point -> Point -> Point -> Point -> Rect #

Create a rectangle based upon the coordinates of 4 points.

psub :: Point -> Point -> Vector #

Subtract two points.

pvsub :: Point -> Vector -> Point #

Subtract a vector from a point.

pvadd :: Point -> Vector -> Point #

Add a point and a vector.

vscale :: Double -> Vector -> Vector #

Scale a vector by a constant.

vlen :: Vector -> Double #

Length/magnitude of a vector

vangle :: Vector -> Double #

Angle of a vector (counterclockwise from positive x-axis)

pointToVec :: Point -> Vector #

Convert a Point to a Vector.

data Point #

A point in two dimensions.

Constructors

Point 

Fields

Instances
Show Point 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Point -> ShowS #

show :: Point -> String #

showList :: [Point] -> ShowS #

v_x :: Vector -> Double #

v_y :: Vector -> Double #

data Limit a #

Constructors

LMin 
LValue a 
LMax 
Instances
Show a => Show (Limit a) 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Limit a -> ShowS #

show :: Limit a -> String #

showList :: [Limit a] -> ShowS #

type PointMapFn x y = (Limit x, Limit y) -> Point #

A function mapping between points.

data Rect #

A rectangle is defined by two points.

Constructors

Rect Point Point 
Instances
Show Rect 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Rect -> ShowS #

show :: Rect -> String #

showList :: [Rect] -> ShowS #

data RectEdge #

Edge of a rectangle.

Constructors

E_Top 
E_Bottom 
E_Left 
E_Right 

type Range = (Double, Double) #

type RectSize = (Double, Double) #

data Path #

The path type used by Charts.

A path can consist of several subpaths. Each - is started by a MoveTo operation. All subpaths - are open, except the last one, which may be closed - using the Close operation. When filling a path - all subpaths are closed implicitly.

Closing a subpath means that a line is drawn from - the end point to the start point of the subpath.

If a Arc (or ArcNeg) is drawn a implicit line - from the last end point of the subpath is drawn - to the beginning of the arc. Another implicit line - is drawn from the end of an arc to the beginning of - the next path segment.

The beginning of a subpath is either (0,0) or set - by a MoveTo instruction. If the first subpath is started - with an arc the beginning of that subpath is the beginning - of the arc.

Constructors

MoveTo Point Path 
LineTo Point Path 
Arc Point Double Double Double Path 
ArcNeg Point Double Double Double Path 
End 
Close 
Instances
Semigroup Path

Paths are monoids. After a path is closed you can not append - anything to it anymore. The empty path is open. - Use close to close a path.

Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(<>) :: Path -> Path -> Path #

sconcat :: NonEmpty Path -> Path #

stimes :: Integral b => b -> Path -> Path #

Monoid Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

mempty :: Path #

mappend :: Path -> Path -> Path #

mconcat :: [Path] -> Path #

data Matrix #

Copied from Graphics.Rendering.Cairo.Matrix

Constructors

Matrix 

Fields

Instances
Num Matrix

Copied from Graphics.Rendering.Cairo.Matrix

Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(+) :: Matrix -> Matrix -> Matrix #

(-) :: Matrix -> Matrix -> Matrix #

(*) :: Matrix -> Matrix -> Matrix #

negate :: Matrix -> Matrix #

abs :: Matrix -> Matrix #

signum :: Matrix -> Matrix #

fromInteger :: Integer -> Matrix #

Show Matrix 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Matrix -> ShowS #

show :: Matrix -> String #

showList :: [Matrix] -> ShowS #

class ColourOps (f :: * -> *) where #

Minimal complete definition

over, darken

Methods

darken :: Num a => a -> f a -> f a #

darken s c blends a colour with black without changing it's opacity.

For Colour, darken s c = blend s c mempty

Instances
ColourOps AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a #

darken :: Num a => a -> AlphaColour a -> AlphaColour a #

ColourOps Colour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> Colour a -> Colour a #

darken :: Num a => a -> Colour a -> Colour a #

class AffineSpace (f :: * -> *) where #

Minimal complete definition

affineCombo

Methods

affineCombo :: Num a => [(a, f a)] -> f a -> f a #

Compute a affine Combination (weighted-average) of points. - The last parameter will get the remaining weight. - e.g.

affineCombo [(0.2,a), (0.3,b)] c == 0.2*a + 0.3*b + 0.5*c

Weights can be negative, or greater than 1.0; however, be aware - that non-convex combinations may lead to out of gamut colours.

Instances
AffineSpace AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, AlphaColour a)] -> AlphaColour a -> AlphaColour a #

AffineSpace Colour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, Colour a)] -> Colour a -> Colour a #

data AlphaColour a #

This type represents a Colour that may be semi-transparent.

The Monoid instance allows you to composite colours.

x `mappend` y == x `over` y

To get the (pre-multiplied) colour channel of an AlphaColour c, - simply composite c over black.

c `over` black
Instances
ColourOps AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a #

darken :: Num a => a -> AlphaColour a -> AlphaColour a #

AffineSpace AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, AlphaColour a)] -> AlphaColour a -> AlphaColour a #

Each ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) #

Eq a => Eq (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Num a => Semigroup (AlphaColour a)

AlphaColour forms a monoid with over and transparent.

Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a #

sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a #

stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #

Num a => Monoid (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: AlphaColour a #

mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a #

mconcat :: [AlphaColour a] -> AlphaColour a #

Parseable (AlphaColour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (AlphaColour Double)

data Colour a #

This type represents the human preception of colour. - The a parameter is a numeric type used internally for the - representation.

The Monoid instance allows one to add colours, but beware that adding - colours can take you out of gamut. Consider using blend whenever - possible.

Instances
ColourOps Colour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> Colour a -> Colour a #

darken :: Num a => a -> Colour a -> Colour a #

AffineSpace Colour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, Colour a)] -> Colour a -> Colour a #

Eq a => Eq (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Num a => Semigroup (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: Colour a -> Colour a -> Colour a #

sconcat :: NonEmpty (Colour a) -> Colour a #

stimes :: Integral b => b -> Colour a -> Colour a #

Num a => Monoid (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: Colour a #

mappend :: Colour a -> Colour a -> Colour a #

mconcat :: [Colour a] -> Colour a #

Parseable (Colour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (Colour Double)

colourConvert :: (Fractional b, Real a) => Colour a -> Colour b #

Change the type used to represent the colour coordinates.

black :: Num a => Colour a #

transparent :: Num a => AlphaColour a #

This AlphaColour is entirely transparent and has no associated - colour channel.

alphaColourConvert :: (Fractional b, Real a) => AlphaColour a -> AlphaColour b #

Change the type used to represent the colour coordinates.

opaque :: Num a => Colour a -> AlphaColour a #

Creates an opaque AlphaColour from a Colour.

dissolve :: Num a => a -> AlphaColour a -> AlphaColour a #

Returns an AlphaColour more transparent by a factor of o.

withOpacity :: Num a => Colour a -> a -> AlphaColour a #

Creates an AlphaColour from a Colour with a given opacity.

c `withOpacity` o == dissolve o (opaque c)

blend :: (Num a, AffineSpace f) => a -> f a -> f a -> f a #

Compute the weighted average of two points. - e.g.

blend 0.4 a b = 0.4*a + 0.6*b

The weight can be negative, or greater than 1.0; however, be aware - that non-convex combinations may lead to out of gamut colours.

atop :: Fractional a => AlphaColour a -> AlphaColour a -> AlphaColour a #

c1 `atop` c2 returns the AlphaColour produced by covering +

Instances
Bifunctor Either

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d #

first :: (a -> b) -> Either a c -> Either b c #

second :: (b -> c) -> Either a b -> Either a c #

Bifunctor (,)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (a, c) -> (b, d) #

first :: (a -> b) -> (a, c) -> (b, c) #

second :: (b -> c) -> (a, b) -> (a, c) #

Bifunctor Arg

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

bimap :: (a -> b) -> (c -> d) -> Arg a c -> Arg b d #

first :: (a -> b) -> Arg a c -> Arg b c #

second :: (b -> c) -> Arg a b -> Arg a c #

Bifunctor ListF 
Instance details

Defined in Data.Functor.Foldable

Methods

bimap :: (a -> b) -> (c -> d) -> ListF a c -> ListF b d #

first :: (a -> b) -> ListF a c -> ListF b c #

second :: (b -> c) -> ListF a b -> ListF a c #

Bifunctor NonEmptyF 
Instance details

Defined in Data.Functor.Base

Methods

bimap :: (a -> b) -> (c -> d) -> NonEmptyF a c -> NonEmptyF b d #

first :: (a -> b) -> NonEmptyF a c -> NonEmptyF b c #

second :: (b -> c) -> NonEmptyF a b -> NonEmptyF a c #

Bifunctor ((,,) x1)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, a, c) -> (x1, b, d) #

first :: (a -> b) -> (x1, a, c) -> (x1, b, c) #

second :: (b -> c) -> (x1, a, b) -> (x1, a, c) #

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 #

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

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

Bifunctor (Tagged :: Type -> Type -> Type) 
Instance details

Defined in Data.Tagged

Methods

bimap :: (a -> b) -> (c -> d) -> Tagged a c -> Tagged b d #

first :: (a -> b) -> Tagged a c -> Tagged b c #

second :: (b -> c) -> Tagged a b -> Tagged a c #

Functor f => Bifunctor (CofreeF f) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

bimap :: (a -> b) -> (c -> d) -> CofreeF f a c -> CofreeF f b d #

first :: (a -> b) -> CofreeF f a c -> CofreeF f b c #

second :: (b -> c) -> CofreeF f a b -> CofreeF f a c #

Functor f => Bifunctor (FreeF f) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

bimap :: (a -> b) -> (c -> d) -> FreeF f a c -> FreeF f b d #

first :: (a -> b) -> FreeF f a c -> FreeF f b c #

second :: (b -> c) -> FreeF f a b -> FreeF f a c #

Functor f => Bifunctor (AlongsideLeft f) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

bimap :: (a -> b) -> (c -> d) -> AlongsideLeft f a c -> AlongsideLeft f b d #

first :: (a -> b) -> AlongsideLeft f a c -> AlongsideLeft f b c #

second :: (b -> c) -> AlongsideLeft f a b -> AlongsideLeft f a c #

Functor f => Bifunctor (AlongsideRight f) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

bimap :: (a -> b) -> (c -> d) -> AlongsideRight f a c -> AlongsideRight f b d #

first :: (a -> b) -> AlongsideRight f a c -> AlongsideRight f b c #

second :: (b -> c) -> AlongsideRight f a b -> AlongsideRight f a c #

Bifunctor (K1 i :: Type -> Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> K1 i a c -> K1 i b d #

first :: (a -> b) -> K1 i a c -> K1 i b c #

second :: (b -> c) -> K1 i a b -> K1 i a c #

Bifunctor ((,,,) x1 x2)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, a, c) -> (x1, x2, b, d) #

first :: (a -> b) -> (x1, x2, a, c) -> (x1, x2, b, c) #

second :: (b -> c) -> (x1, x2, a, b) -> (x1, x2, a, c) #

Bifunctor ((,,,,) x1 x2 x3)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, d) #

first :: (a -> b) -> (x1, x2, x3, a, c) -> (x1, x2, x3, b, c) #

second :: (b -> c) -> (x1, x2, x3, a, b) -> (x1, x2, x3, a, c) #

Bifunctor p => Bifunctor (WrappedBifunctor p) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

bimap :: (a -> b) -> (c -> d) -> WrappedBifunctor p a c -> WrappedBifunctor p b d #

first :: (a -> b) -> WrappedBifunctor p a c -> WrappedBifunctor p b c #

second :: (b -> c) -> WrappedBifunctor p a b -> WrappedBifunctor p a c #

Functor g => Bifunctor (Joker g :: Type -> Type -> Type) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

bimap :: (a -> b) -> (c -> d) -> Joker g a c -> Joker g b d #

first :: (a -> b) -> Joker g a c -> Joker g b c #

second :: (b -> c) -> Joker g a b -> Joker g a c #

Bifunctor p => Bifunctor (Flip p) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

bimap :: (a -> b) -> (c -> d) -> Flip p a c -> Flip p b d #

first :: (a -> b) -> Flip p a c -> Flip p b c #

second :: (b -> c) -> Flip p a b -> Flip p a c #

Functor f => Bifunctor (Clown f :: Type -> Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

bimap :: (a -> b) -> (c -> d) -> Clown f a c -> Clown f b d #

first :: (a -> b) -> Clown f a c -> Clown f b c #

second :: (b -> c) -> Clown f a b -> Clown f a c #

Bifunctor ((,,,,,) x1 x2 x3 x4)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, d) #

first :: (a -> b) -> (x1, x2, x3, x4, a, c) -> (x1, x2, x3, x4, b, c) #

second :: (b -> c) -> (x1, x2, x3, x4, a, b) -> (x1, x2, x3, x4, a, c) #

(Bifunctor p, Bifunctor q) => Bifunctor (Sum p q) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

bimap :: (a -> b) -> (c -> d) -> Sum p q a c -> Sum p q b d #

first :: (a -> b) -> Sum p q a c -> Sum p q b c #

second :: (b -> c) -> Sum p q a b -> Sum p q a c #

(Bifunctor f, Bifunctor g) => Bifunctor (Product f g) 
Instance details

Defined in Data.Bifunctor.Product

Methods

bimap :: (a -> b) -> (c -> d) -> Product f g a c -> Product f g b d #

first :: (a -> b) -> Product f g a c -> Product f g b c #

second :: (b -> c) -> Product f g a b -> Product f g a c #

Bifunctor ((,,,,,,) x1 x2 x3 x4 x5)

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, d) #

first :: (a -> b) -> (x1, x2, x3, x4, x5, a, c) -> (x1, x2, x3, x4, x5, b, c) #

second :: (b -> c) -> (x1, x2, x3, x4, x5, a, b) -> (x1, x2, x3, x4, x5, a, c) #

(Functor f, Bifunctor p) => Bifunctor (Tannen f p) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

bimap :: (a -> b) -> (c -> d) -> Tannen f p a c -> Tannen f p b d #

first :: (a -> b) -> Tannen f p a c -> Tannen f p b c #

second :: (b -> c) -> Tannen f p a b -> Tannen f p a c #

(Bifunctor p, Functor f, Functor g) => Bifunctor (Biff p f g) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

bimap :: (a -> b) -> (c -> d) -> Biff p f g a c -> Biff p f g b d #

first :: (a -> b) -> Biff p f g a c -> Biff p f g b c #

second :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

newtype Identity a #

Identity functor and monad. (a non-strict monad)

Since: base-4.8.0.0

Constructors

Identity 

Fields

Instances
Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

MonadFix Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

mfix :: (a -> Identity a) -> Identity a #

Applicative Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

pure :: a -> Identity a #

(<*>) :: Identity (a -> b) -> Identity a -> Identity b #

liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #

(*>) :: Identity a -> Identity b -> Identity b #

(<*) :: Identity a -> Identity b -> Identity a #

Foldable Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m #

foldMap :: Monoid m => (a -> m) -> Identity a -> m #

foldr :: (a -> b -> b) -> b -> Identity a -> b #

foldr' :: (a -> b -> b) -> b -> Identity a -> b #

foldl :: (b -> a -> b) -> b -> Identity a -> b #

foldl' :: (b -> a -> b) -> b -> Identity a -> b #

foldr1 :: (a -> a -> a) -> Identity a -> a #

foldl1 :: (a -> a -> a) -> Identity a -> a #

toList :: Identity a -> [a] #

null :: Identity a -> Bool #

length :: Identity a -> Int #

elem :: Eq a => a -> Identity a -> Bool #

maximum :: Ord a => Identity a -> a #

minimum :: Ord a => Identity a -> a #

sum :: Num a => Identity a -> a #

product :: Num a => Identity a -> a #

Traversable Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

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

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

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

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Eq1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a -> b -> Bool) -> Identity a -> Identity b -> Bool #

Ord1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a -> b -> Ordering) -> Identity a -> Identity b -> Ordering #

Read1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Identity a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Identity a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Identity a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Identity a] #

Show1 Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Identity a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Identity a] -> ShowS #

NFData1 Identity

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a -> ()) -> Identity a -> () #

Hashable1 Identity 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Identity a -> Int #

Traversable1 Identity 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) #

sequence1 :: Apply f => Identity (f b) -> f (Identity b) #

Apply Identity 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Identity (a -> b) -> Identity a -> Identity b #

(.>) :: Identity a -> Identity b -> Identity b #

(<.) :: Identity a -> Identity b -> Identity a #

liftF2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #

Bind Identity 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Identity a -> (a -> Identity b) -> Identity b #

join :: Identity (Identity a) -> Identity a #

Metric Identity 
Instance details

Defined in Linear.Metric

Methods

dot :: Num a => Identity a -> Identity a -> a

quadrance :: Num a => Identity a -> a

qd :: Num a => Identity a -> Identity a -> a

distance :: Floating a => Identity a -> Identity a -> a

norm :: Floating a => Identity a -> a

signorm :: Floating a => Identity a -> Identity a

Additive Identity 
Instance details

Defined in Linear.Vector

Methods

zero :: Num a => Identity a

(^+^) :: Num a => Identity a -> Identity a -> Identity a

(^-^) :: Num a => Identity a -> Identity a -> Identity a

lerp :: Num a => a -> Identity a -> Identity a -> Identity a

liftU2 :: (a -> a -> a) -> Identity a -> Identity a -> Identity a

liftI2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c

Representable Identity 
Instance details

Defined in Data.Functor.Rep

Associated Types

type Rep Identity :: Type

Methods

tabulate :: (Rep Identity -> a) -> Identity a

index :: Identity a -> Rep Identity -> a

R1 Identity 
Instance details

Defined in Linear.V1

Methods

_x :: Lens' (Identity a) a

Settable Identity 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Identity a -> a

untaintedDot :: Profunctor p => p a (Identity b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Identity b)

Affine Identity 
Instance details

Defined in Linear.Affine

Associated Types

type Diff Identity :: Type -> Type

Methods

(.-.) :: Num a => Identity a -> Identity a -> Diff Identity a

(.+^) :: Num a => Identity a -> Diff Identity a -> Identity a

(.-^) :: Num a => Identity a -> Diff Identity a -> Identity a

GShowSingle Identity Par1 
Instance details

Defined in Generic.Data.Internal.Show

Methods

gPrecShowsSingle :: Identity (ShowsPrec a) -> Par1 a -> PrecShowS #

MonadBaseControl Identity Identity 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM Identity a :: Type #

Methods

liftBaseWith :: (RunInBase Identity Identity -> Identity a) -> Identity a #

restoreM :: StM Identity a -> Identity a #

Sieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedGetter a b -> a -> Identity b #

Cosieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

cosieve :: ReifiedGetter a b -> Identity a -> b #

FoldableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m #

ifolded :: IndexedFold () (Identity a) a #

ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #

FunctorWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Identity a -> Identity b #

imapped :: IndexedSetter () (Identity a) (Identity b) a b #

TraversableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) #

itraversed :: IndexedTraversal () (Identity a) (Identity b) a b #

Show1 f => GShowSingle Identity (Rec1 f) 
Instance details

Defined in Generic.Data.Internal.Show

Methods

gPrecShowsSingle :: Identity (ShowsPrec a) -> Rec1 f a -> PrecShowS #

Bounded a => Bounded (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

minBound :: Identity a #

maxBound :: Identity a #

Enum a => Enum (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

succ :: Identity a -> Identity a #

pred :: Identity a -> Identity a #

toEnum :: Int -> Identity a #

fromEnum :: Identity a -> Int #

enumFrom :: Identity a -> [Identity a] #

enumFromThen :: Identity a -> Identity a -> [Identity a] #

enumFromTo :: Identity a -> Identity a -> [Identity a] #

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] #

Eq a => Eq (Identity a)

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

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

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

Floating a => Floating (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

pi :: Identity a #

exp :: Identity a -> Identity a #

log :: Identity a -> Identity a #

sqrt :: Identity a -> Identity a #

(**) :: Identity a -> Identity a -> Identity a #

logBase :: Identity a -> Identity a -> Identity a #

sin :: Identity a -> Identity a #

cos :: Identity a -> Identity a #

tan :: Identity a -> Identity a #

asin :: Identity a -> Identity a #

acos :: Identity a -> Identity a #

atan :: Identity a -> Identity a #

sinh :: Identity a -> Identity a #

cosh :: Identity a -> Identity a #

tanh :: Identity a -> Identity a #

asinh :: Identity a -> Identity a #

acosh :: Identity a -> Identity a #

atanh :: Identity a -> Identity a #

log1p :: Identity a -> Identity a #

expm1 :: Identity a -> Identity a #

log1pexp :: Identity a -> Identity a #

log1mexp :: Identity a -> Identity a #

Fractional a => Fractional (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(/) :: Identity a -> Identity a -> Identity a #

recip :: Identity a -> Identity a #

fromRational :: Rational -> Identity a #

Integral a => Integral (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a #

rem :: Identity a -> Identity a -> Identity a #

div :: Identity a -> Identity a -> Identity a #

mod :: Identity a -> Identity a -> Identity a #

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

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

toInteger :: Identity a -> Integer #

Num a => Num (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a #

(-) :: Identity a -> Identity a -> Identity a #

(*) :: Identity a -> Identity a -> Identity a #

negate :: Identity a -> Identity a #

abs :: Identity a -> Identity a #

signum :: Identity a -> Identity a #

fromInteger :: Integer -> Identity a #

Ord a => Ord (Identity a)

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering #

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

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

(>) :: Identity a -> Identity a -> Bool #

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

max :: Identity a -> Identity a -> Identity a #

min :: Identity a -> Identity a -> Identity a #

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the + Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

readsPrec :: Int -> ReadS (Identity a) #

readList :: ReadS [Identity a] #

readPrec :: ReadPrec (Identity a) #

readListPrec :: ReadPrec [Identity a] #

Real a => Real (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

toRational :: Identity a -> Rational #

RealFloat a => RealFloat (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer #

floatDigits :: Identity a -> Int #

floatRange :: Identity a -> (Int, Int) #

decodeFloat :: Identity a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Identity a #

exponent :: Identity a -> Int #

significand :: Identity a -> Identity a #

scaleFloat :: Int -> Identity a -> Identity a #

isNaN :: Identity a -> Bool #

isInfinite :: Identity a -> Bool #

isDenormalized :: Identity a -> Bool #

isNegativeZero :: Identity a -> Bool #

isIEEE :: Identity a -> Bool #

atan2 :: Identity a -> Identity a -> Identity a #

RealFrac a => RealFrac (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

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

truncate :: Integral b => Identity a -> b #

round :: Integral b => Identity a -> b #

ceiling :: Integral b => Identity a -> b #

floor :: Integral b => Identity a -> b #

Show a => Show (Identity a)

This instance would be equivalent to the derived instances of the + Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

showsPrec :: Int -> Identity a -> ShowS #

show :: Identity a -> String #

showList :: [Identity a] -> ShowS #

Ix a => Ix (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

range :: (Identity a, Identity a) -> [Identity a] #

index :: (Identity a, Identity a) -> Identity a -> Int #

unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int

inRange :: (Identity a, Identity a) -> Identity a -> Bool #

rangeSize :: (Identity a, Identity a) -> Int #

unsafeRangeSize :: (Identity a, Identity a) -> Int

IsString a => IsString (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.String

Methods

fromString :: String -> Identity a #

Generic (Identity a) 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep (Identity a) :: Type -> Type #

Methods

from :: Identity a -> Rep (Identity a) x #

to :: Rep (Identity a) x -> Identity a #

Semigroup a => Semigroup (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a #

sconcat :: NonEmpty (Identity a) -> Identity a #

stimes :: Integral b => b -> Identity a -> Identity a #

Monoid a => Monoid (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

mempty :: Identity a #

mappend :: Identity a -> Identity a -> Identity a #

mconcat :: [Identity a] -> Identity a #

NFData a => NFData (Identity a)

Since: deepseq-1.4.0.0

Instance details

Defined in Control.DeepSeq

Methods

rnf :: Identity a -> () #

Hashable a => Hashable (Identity a) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Identity a -> Int #

hash :: Identity a -> Int #

Storable a => Storable (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

sizeOf :: Identity a -> Int #

alignment :: Identity a -> Int #

peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a) #

pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO () #

peekByteOff :: Ptr b -> Int -> IO (Identity a) #

pokeByteOff :: Ptr b -> Int -> Identity a -> IO () #

peek :: Ptr (Identity a) -> IO (Identity a) #

poke :: Ptr (Identity a) -> Identity a -> IO () #

Bits a => Bits (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(.&.) :: Identity a -> Identity a -> Identity a #

(.|.) :: Identity a -> Identity a -> Identity a #

xor :: Identity a -> Identity a -> Identity a #

complement :: Identity a -> Identity a #

shift :: Identity a -> Int -> Identity a #

rotate :: Identity a -> Int -> Identity a #

zeroBits :: Identity a #

bit :: Int -> Identity a #

setBit :: Identity a -> Int -> Identity a #

clearBit :: Identity a -> Int -> Identity a #

complementBit :: Identity a -> Int -> Identity a #

testBit :: Identity a -> Int -> Bool #

bitSizeMaybe :: Identity a -> Maybe Int #

bitSize :: Identity a -> Int #

isSigned :: Identity a -> Bool #

shiftL :: Identity a -> Int -> Identity a #

unsafeShiftL :: Identity a -> Int -> Identity a #

shiftR :: Identity a -> Int -> Identity a #

unsafeShiftR :: Identity a -> Int -> Identity a #

rotateL :: Identity a -> Int -> Identity a #

rotateR :: Identity a -> Int -> Identity a #

popCount :: Identity a -> Int #

FiniteBits a => FiniteBits (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

finiteBitSize :: Identity a -> Int #

countLeadingZeros :: Identity a -> Int #

countTrailingZeros :: Identity a -> Int #

Binary a => Binary (Identity a) 
Instance details

Defined in Data.Binary.Class

Methods

put :: Identity a -> Put #

get :: Get (Identity a) #

putList :: [Identity a] -> Put #

Newtype (Identity a)

Since: newtype-generics-0.5.1

Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Identity a) :: Type #

Methods

pack :: O (Identity a) -> Identity a #

unpack :: Identity a -> O (Identity a) #

Wrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Identity a) :: Type #

Methods

_Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #

Ixed (Identity a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #

Generic1 Identity 
Instance details

Defined in Data.Functor.Identity

Associated Types

type Rep1 Identity :: k -> Type #

Methods

from1 :: Identity a -> Rep1 Identity a #

to1 :: Rep1 Identity a -> Identity a #

t ~ Identity b => Rewrapped (Identity a) t 
Instance details

Defined in Control.Lens.Wrapped

Each (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Identity a) (Identity b) a b #

Field1 (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Identity a) (Identity b) a b #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

type Rep Identity 
Instance details

Defined in Data.Functor.Rep

type Rep Identity = ()
type Diff Identity 
Instance details

Defined in Linear.Affine

type Diff Identity = Identity
type StM Identity a 
Instance details

Defined in Control.Monad.Trans.Control

type StM Identity a = a
type Rep (Identity a)

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

type Rep (Identity a) = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type O (Identity a) 
Instance details

Defined in Control.Newtype.Generics

type O (Identity a) = a
type Unwrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Identity a) = a
type Index (Identity a) 
Instance details

Defined in Control.Lens.At

type Index (Identity a) = ()
type IxValue (Identity a) 
Instance details

Defined in Control.Lens.At

type IxValue (Identity a) = a
type Rep1 Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

type Rep1 Identity = D1 (MetaData "Identity" "Data.Functor.Identity" "base" True) (C1 (MetaCons "Identity" PrefixI True) (S1 (MetaSel (Just "runIdentity") NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

newtype Const a (b :: k) :: forall k. Type -> k -> Type #

The Const functor.

Constructors

Const 

Fields

Instances
Generic1 (Const a :: k -> Type) 
Instance details

Defined in Data.Functor.Const

Associated Types

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

Methods

from1 :: Const a a0 -> Rep1 (Const a) a0 #

to1 :: Rep1 (Const a) a0 -> Const a a0 #

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) #

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 #

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

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

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

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 #

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

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

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 #

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 #

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) #

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

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

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

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 #

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

Biapplicative (Const :: Type -> Type -> Type) 
Instance details

Defined in Data.Biapplicative

Methods

bipure :: a -> b -> Const a b #

(<<*>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d #

biliftA2 :: (a -> b -> c) -> (d -> e -> f) -> Const a d -> Const b e -> Const c f #

(*>>) :: Const a b -> Const c d -> Const c d #

(<<*) :: Const a b -> Const c d -> Const a b #

NFData2 (Const :: Type -> Type -> Type)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

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

Hashable2 (Const :: Type -> Type -> Type) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Const a b -> Int #

Bitraversable1 (Const :: Type -> Type -> Type) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Const a c -> f (Const b d) #

bisequence1 :: Apply f => Const (f a) (f b) -> f (Const a b) #

Biapply (Const :: Type -> Type -> Type) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<<.>>) :: Const (a -> b) (c -> d) -> Const a c -> Const b d #

(.>>) :: Const a b -> Const c d -> Const c d #

(<<.) :: Const a b -> Const c d -> Const a b #

Functor (Const m :: Type -> Type)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

Since: base-2.0.1

Instance details

Defined in Data.Functor.Const

Methods

pure :: a -> Const m a #

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

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

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

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

Foldable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

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

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

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

null :: Const m a -> Bool #

length :: Const m a -> Int #

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

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

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

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

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

Traversable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Contravariant (Const a :: Type -> Type) 
Instance details

Defined in Data.Functor.Contravariant

Methods

contramap :: (a0 -> b) -> Const a b -> Const a a0 #

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

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 #

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 #

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) #

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

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

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

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 #

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

NFData a => NFData1 (Const a :: Type -> Type)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a0 -> ()) -> Const a a0 -> () #

Hashable a => Hashable1 (Const a :: Type -> Type) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Const a a0 -> Int #

Semigroup m => Apply (Const m :: Type -> Type) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Const m (a -> b) -> Const m a -> Const m b #

(.>) :: Const m a -> Const m b -> Const m b #

(<.) :: Const m a -> Const m b -> Const m a #

liftF2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c #

Bounded a => Bounded (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

minBound :: Const a b #

maxBound :: Const a b #

Enum a => Enum (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

toEnum :: Int -> Const a b #

fromEnum :: Const a b -> Int #

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

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

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

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

Eq a => Eq (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

Floating a => Floating (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

pi :: Const a b #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Fractional a => Fractional (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

fromRational :: Rational -> Const a b #

Integral a => Integral (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

toInteger :: Const a b -> Integer #

Num a => Num (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

fromInteger :: Integer -> Const a b #

Ord a => Ord (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

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

Read a => Read (Const a b)

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

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

readList :: ReadS [Const a b] #

readPrec :: ReadPrec (Const a b) #

readListPrec :: ReadPrec [Const a b] #

Real a => Real (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

toRational :: Const a b -> Rational #

RealFloat a => RealFloat (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer #

floatDigits :: Const a b -> Int #

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

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

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

exponent :: Const a b -> Int #

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

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

isNaN :: Const a b -> Bool #

isInfinite :: Const a b -> Bool #

isDenormalized :: Const a b -> Bool #

isNegativeZero :: Const a b -> Bool #

isIEEE :: Const a b -> Bool #

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

RealFrac a => RealFrac (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

Show a => Show (Const a b)

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

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

show :: Const a b -> String #

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

Ix a => Ix (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

IsString a => IsString (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.String

Methods

fromString :: String -> Const a b #

Generic (Const a b) 
Instance details

Defined in Data.Functor.Const

Associated Types

type Rep (Const a b) :: Type -> Type #

Methods

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

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

Semigroup a => Semigroup (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

mempty :: Const a b #

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

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

NFData a => NFData (Const a b)

Since: deepseq-1.4.0.0

Instance details

Defined in Control.DeepSeq

Methods

rnf :: Const a b -> () #

Hashable a => Hashable (Const a b) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Const a b -> Int #

hash :: Const a b -> Int #

Storable a => Storable (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

sizeOf :: Const a b -> Int #

alignment :: Const a b -> Int #

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

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

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

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

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

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

Bits a => Bits (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

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

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

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

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

zeroBits :: Const a b #

bit :: Int -> Const a b #

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

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

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

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

bitSizeMaybe :: Const a b -> Maybe Int #

bitSize :: Const a b -> Int #

isSigned :: Const a b -> Bool #

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

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

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

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

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

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

popCount :: Const a b -> Int #

FiniteBits a => FiniteBits (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

finiteBitSize :: Const a b -> Int #

countLeadingZeros :: Const a b -> Int #

countTrailingZeros :: Const a b -> Int #

Newtype (Const a x) 
Instance details

Defined in Control.Newtype.Generics

Associated Types

type O (Const a x) :: Type #

Methods

pack :: O (Const a x) -> Const a x #

unpack :: Const a x -> O (Const a x) #

Wrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Const a x) :: Type #

Methods

_Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #

t ~ Const a' x' => Rewrapped (Const a x) t 
Instance details

Defined in Control.Lens.Wrapped

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

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

type Rep1 (Const a :: k -> Type) = D1 (MetaData "Const" "Data.Functor.Const" "base" 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 Data.Functor.Const

type Rep (Const a b) = D1 (MetaData "Const" "Data.Functor.Const" "base" True) (C1 (MetaCons "Const" PrefixI True) (S1 (MetaSel (Just "getConst") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type O (Const a x) 
Instance details

Defined in Control.Newtype.Generics

type O (Const a x) = a
type Unwrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

type Unwrapped (Const a x) = a

(&) :: a -> (a -> b) -> b infixl 1 #

& is a reverse application operator. This provides notational + convenience. Its precedence is one higher than that of the forward + application operator $, which allows & to be nested in $.

>>> 5 & (+1) & show
+"6"
+

Since: base-4.8.0.0

(<&>) :: Functor f => f a -> (a -> b) -> f b infixl 1 #

Flipped version of <$>.

(<&>) = flip fmap
+

Examples

Expand

Apply (+1) to a list, a Just and a Right:

>>> Just 2 <&> (+1)
+Just 3
+
>>> [1,2,3] <&> (+1)
+[2,3,4]
+
>>> Right 3 <&> (+1)
+Right 4
+

Since: base-4.11.0.0

yellowgreen :: (Ord a, Floating a) => Colour a #

yellow :: (Ord a, Floating a) => Colour a #

whitesmoke :: (Ord a, Floating a) => Colour a #

white :: (Ord a, Floating a) => Colour a #

wheat :: (Ord a, Floating a) => Colour a #

violet :: (Ord a, Floating a) => Colour a #

turquoise :: (Ord a, Floating a) => Colour a #

tomato :: (Ord a, Floating a) => Colour a #

thistle :: (Ord a, Floating a) => Colour a #

teal :: (Ord a, Floating a) => Colour a #

steelblue :: (Ord a, Floating a) => Colour a #

springgreen :: (Ord a, Floating a) => Colour a #

snow :: (Ord a, Floating a) => Colour a #

slategrey :: (Ord a, Floating a) => Colour a #

slategray :: (Ord a, Floating a) => Colour a #

slateblue :: (Ord a, Floating a) => Colour a #

skyblue :: (Ord a, Floating a) => Colour a #

silver :: (Ord a, Floating a) => Colour a #

sienna :: (Ord a, Floating a) => Colour a #

seashell :: (Ord a, Floating a) => Colour a #

seagreen :: (Ord a, Floating a) => Colour a #

sandybrown :: (Ord a, Floating a) => Colour a #

salmon :: (Ord a, Floating a) => Colour a #

saddlebrown :: (Ord a, Floating a) => Colour a #

royalblue :: (Ord a, Floating a) => Colour a #

rosybrown :: (Ord a, Floating a) => Colour a #

red :: (Ord a, Floating a) => Colour a #

purple :: (Ord a, Floating a) => Colour a #

powderblue :: (Ord a, Floating a) => Colour a #

plum :: (Ord a, Floating a) => Colour a #

pink :: (Ord a, Floating a) => Colour a #

peru :: (Ord a, Floating a) => Colour a #

peachpuff :: (Ord a, Floating a) => Colour a #

papayawhip :: (Ord a, Floating a) => Colour a #

palevioletred :: (Ord a, Floating a) => Colour a #

paleturquoise :: (Ord a, Floating a) => Colour a #

palegreen :: (Ord a, Floating a) => Colour a #

palegoldenrod :: (Ord a, Floating a) => Colour a #

orchid :: (Ord a, Floating a) => Colour a #

orangered :: (Ord a, Floating a) => Colour a #

orange :: (Ord a, Floating a) => Colour a #

olivedrab :: (Ord a, Floating a) => Colour a #

olive :: (Ord a, Floating a) => Colour a #

oldlace :: (Ord a, Floating a) => Colour a #

navy :: (Ord a, Floating a) => Colour a #

navajowhite :: (Ord a, Floating a) => Colour a #

moccasin :: (Ord a, Floating a) => Colour a #

mistyrose :: (Ord a, Floating a) => Colour a #

mintcream :: (Ord a, Floating a) => Colour a #

midnightblue :: (Ord a, Floating a) => Colour a #

mediumvioletred :: (Ord a, Floating a) => Colour a #

mediumturquoise :: (Ord a, Floating a) => Colour a #

mediumspringgreen :: (Ord a, Floating a) => Colour a #

mediumslateblue :: (Ord a, Floating a) => Colour a #

mediumseagreen :: (Ord a, Floating a) => Colour a #

mediumpurple :: (Ord a, Floating a) => Colour a #

mediumorchid :: (Ord a, Floating a) => Colour a #

mediumblue :: (Ord a, Floating a) => Colour a #

mediumaquamarine :: (Ord a, Floating a) => Colour a #

maroon :: (Ord a, Floating a) => Colour a #

magenta :: (Ord a, Floating a) => Colour a #

linen :: (Ord a, Floating a) => Colour a #

limegreen :: (Ord a, Floating a) => Colour a #

lime :: (Ord a, Floating a) => Colour a #

lightyellow :: (Ord a, Floating a) => Colour a #

lightsteelblue :: (Ord a, Floating a) => Colour a #

lightslategrey :: (Ord a, Floating a) => Colour a #

lightslategray :: (Ord a, Floating a) => Colour a #

lightskyblue :: (Ord a, Floating a) => Colour a #

lightseagreen :: (Ord a, Floating a) => Colour a #

lightsalmon :: (Ord a, Floating a) => Colour a #

lightpink :: (Ord a, Floating a) => Colour a #

lightgrey :: (Ord a, Floating a) => Colour a #

lightgreen :: (Ord a, Floating a) => Colour a #

lightgray :: (Ord a, Floating a) => Colour a #

lightgoldenrodyellow :: (Ord a, Floating a) => Colour a #

lightcyan :: (Ord a, Floating a) => Colour a #

lightcoral :: (Ord a, Floating a) => Colour a #

lightblue :: (Ord a, Floating a) => Colour a #

lemonchiffon :: (Ord a, Floating a) => Colour a #

lawngreen :: (Ord a, Floating a) => Colour a #

lavenderblush :: (Ord a, Floating a) => Colour a #

lavender :: (Ord a, Floating a) => Colour a #

khaki :: (Ord a, Floating a) => Colour a #

ivory :: (Ord a, Floating a) => Colour a #

indigo :: (Ord a, Floating a) => Colour a #

indianred :: (Ord a, Floating a) => Colour a #

hotpink :: (Ord a, Floating a) => Colour a #

honeydew :: (Ord a, Floating a) => Colour a #

greenyellow :: (Ord a, Floating a) => Colour a #

green :: (Ord a, Floating a) => Colour a #

grey :: (Ord a, Floating a) => Colour a #

gray :: (Ord a, Floating a) => Colour a #

goldenrod :: (Ord a, Floating a) => Colour a #

gold :: (Ord a, Floating a) => Colour a #

ghostwhite :: (Ord a, Floating a) => Colour a #

gainsboro :: (Ord a, Floating a) => Colour a #

fuchsia :: (Ord a, Floating a) => Colour a #

forestgreen :: (Ord a, Floating a) => Colour a #

floralwhite :: (Ord a, Floating a) => Colour a #

firebrick :: (Ord a, Floating a) => Colour a #

dodgerblue :: (Ord a, Floating a) => Colour a #

dimgrey :: (Ord a, Floating a) => Colour a #

dimgray :: (Ord a, Floating a) => Colour a #

deepskyblue :: (Ord a, Floating a) => Colour a #

deeppink :: (Ord a, Floating a) => Colour a #

darkviolet :: (Ord a, Floating a) => Colour a #

darkturquoise :: (Ord a, Floating a) => Colour a #

darkslategrey :: (Ord a, Floating a) => Colour a #

darkslategray :: (Ord a, Floating a) => Colour a #

darkslateblue :: (Ord a, Floating a) => Colour a #

darkseagreen :: (Ord a, Floating a) => Colour a #

darksalmon :: (Ord a, Floating a) => Colour a #

darkred :: (Ord a, Floating a) => Colour a #

darkorchid :: (Ord a, Floating a) => Colour a #

darkorange :: (Ord a, Floating a) => Colour a #

darkolivegreen :: (Ord a, Floating a) => Colour a #

darkmagenta :: (Ord a, Floating a) => Colour a #

darkkhaki :: (Ord a, Floating a) => Colour a #

darkgrey :: (Ord a, Floating a) => Colour a #

darkgreen :: (Ord a, Floating a) => Colour a #

darkgray :: (Ord a, Floating a) => Colour a #

darkgoldenrod :: (Ord a, Floating a) => Colour a #

darkcyan :: (Ord a, Floating a) => Colour a #

darkblue :: (Ord a, Floating a) => Colour a #

cyan :: (Ord a, Floating a) => Colour a #

crimson :: (Ord a, Floating a) => Colour a #

cornsilk :: (Ord a, Floating a) => Colour a #

cornflowerblue :: (Ord a, Floating a) => Colour a #

coral :: (Ord a, Floating a) => Colour a #

chocolate :: (Ord a, Floating a) => Colour a #

chartreuse :: (Ord a, Floating a) => Colour a #

cadetblue :: (Ord a, Floating a) => Colour a #

burlywood :: (Ord a, Floating a) => Colour a #

brown :: (Ord a, Floating a) => Colour a #

blueviolet :: (Ord a, Floating a) => Colour a #

blue :: (Ord a, Floating a) => Colour a #

blanchedalmond :: (Ord a, Floating a) => Colour a #

bisque :: (Ord a, Floating a) => Colour a #

beige :: (Ord a, Floating a) => Colour a #

azure :: (Ord a, Floating a) => Colour a #

aquamarine :: (Ord a, Floating a) => Colour a #

aqua :: (Ord a, Floating a) => Colour a #

antiquewhite :: (Ord a, Floating a) => Colour a #

aliceblue :: (Ord a, Floating a) => Colour a #

readColourName :: (MonadFail m, Monad m, Ord a, Floating a) => String -> m (Colour a) #

alphaChannel :: AlphaColour a -> a #

Returns the opacity of an AlphaColour.

atop :: Fractional a => AlphaColour a -> AlphaColour a -> AlphaColour a #

c1 `atop` c2 returns the AlphaColour produced by covering the portion of c2 visible by c1. The resulting alpha channel is always the same as the alpha channel of c2.

c1 `atop` (opaque c2) == c1 `over` (opaque c2)
-AlphaChannel (c1 `atop` c2) == AlphaChannel c2

alphaChannel :: AlphaColour a -> a #

Returns the opacity of an AlphaColour.

module Graphics.Rendering.Chart.Grid

module Graphics.Rendering.Chart.Plot.FillBetween

module Graphics.Rendering.Chart.Plot.Histogram

Plots

buildPlots :: BaseSpace c ~ v => Axis b c n -> [StyledPlot b v n] #

Build a list of styled plots from the axis, ready to be rendered. - This takes into account any AxisStyle changes and applies the - finalPlots modifications.

The StyledPlots can be rendered with renderStyledPlot and the - legend entries can be obtained with styledPlotLegends. This is - what renderAxis can uses internally but might be useful for - debugging or generating your own legend.

r2AxisMain :: (Parseable (MainOpts (QDiagram b V2 Double Any)), Mainable (Axis b V2 Double)) => Axis b V2 Double -> IO () #

mainWith specialised to a 2D Axis.

class RenderAxis b (v :: * -> *) n where #

Renderable axes.

Minimal complete definition

renderAxis

Methods

renderAxis :: Axis b v n -> QDiagram b (BaseSpace v) n Any #

Render an axis to a diagram. The size of the diagram is - determined by the axisSize.

Instances
(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b V2 n

The RenderAxis class provides a default way to render an axis for - each space.

Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b V2 n -> QDiagram b (BaseSpace V2) n Any #

(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b Polar n 
Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b Polar n -> QDiagram b (BaseSpace Polar) n Any #

labelBars :: HasLabels a => [String] -> State a () #

Labels to use for each bar (or group of bars) along the axis.

onBars #

Arguments

:: (a -> State (PlotMods b V2 n) ())

Modifier the PlotOptions and PlotStyle for the bars - associated with the data from a.

-> State (MultiBarState b n a) ()

Changes to each data set when executing multiBars.

Given the data for the bar, modify the properties for the bar that - uses that data.

Some common functions to use on the PlotMods:

  • plotColour - change the colour of the bars
  • areaStyle - modify the style of the bars
  • key - add a legend entry for that group of bars

multiBars #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f, Foldable g) 
=> f a

data for multi plot

-> (a -> g n)

extract bar heights from each data set

-> State (MultiBarState b n a) ()

state to make changes to the plot

-> m ()

changes to the Axis

Construct multiple bars, grouped together. See MultiBarState for - details on how to customise how the bars are drawn.

Example

Expand

import Plots
-breakfastData :: [(String, V2 Double)]
-breakfastData = [("eggs", V2 7 5), ("bacon", V2 5 4), ("sausage", V2 2 7), ("beans", V2 2 1)]
sortedData = [ ("girls", breakfastData^..each._2._x)
-             , ("boys",  breakfastData^..each._2._y)
-             ]
multiBarAxis :: Axis B V2 Double
-multiBarAxis = r2Axis &~ do
-  yMin ?= 0
-  hide (xAxis . majorGridLines)
-  hide minorTicks
-  xLabel .= "breakfast item"
-  multiBars sortedData snd $ do
-    vertical .= True
-    barWidth //= 2
-    labelBars (map fst breakfastData)
-    onBars $ \(nm,_) -> key nm
-
-  -- show y values without decimal point
-  yAxis . tickLabelFunction .= atMajorTicks (show . round)
-  -- we should really force all major ticks to like on integers too
multiBarExample = renderAxis multiBarAxis

runningBars :: Num n => State (MultiBarState b n a) () #

Normal bars where each data set follows the last.

Example

Expand

stackedEqualBars :: Fractional n => n -> State (MultiBarState b n a) () #

Bars stacked on top of each other where every bar is the given - height.

Example

Expand

stackedBars :: Num n => State (MultiBarState b n a) () #

Bars stacked on top of each other.

Example

Expand

groupedBars' :: Fractional n => n -> State (MultiBarState b n a) () #

Bars that are grouped together such that each group is a single - barWidth. The parameter is the multiplier for the width of - individual bars, where groupedBars 1 = groupedBars corresponds - to bars in a group touching. reduce the width of individual bars.

Example

Expand

groupedBars :: Fractional n => State (MultiBarState b n a) () #

Bars that are grouped together such that each group is a single - barWidth. The bars in a group are touching, see groupedBars' to - reduce the width of individual bars.

Example

Expand

floatingBarPlot #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) 
=> f (n, n)

bar limits

-> State (Plot (BarPlot n) b) ()

changes to the bars

-> m () 

Same as barPlot but with lower and upper bounds for the bars.

namedBarPlot' #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) 
=> f (String, n)

bar heights with name

-> m ()

add plot to the Axis

Simple version of namedBarPlot without any modification to the Plot.

Example

Expand

import Plots
-namedBarAxis' :: Axis B V2 Double
-namedBarAxis' = r2Axis &~ do
-  xMin ?= 0
-  hide majorGridLines
-  namedBarPlot' [("eggs", 12), ("bacon", 5), ("sausage", 9), ("beans", 3)]
namedBarExample' = renderAxis namedBarAxis'

namedBarPlot #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) 
=> f (String, n)

bar heights with name

-> State (Plot (BarPlot n) b) ()

changes to the bars

-> m ()

changes to the Axis

A add BarPlot to an Axis while naming the bars.

Example

Expand

import Plots
-namedBarAxis :: Axis B V2 Double
-namedBarAxis = r2Axis &~ do
-  yMin ?= 0
-  hide (xAxis . majorGridLines)
-  namedBarPlot [("eggs", 12), ("bacon", 5), ("sausage", 9), ("beans", 3)] $ do
-    vertical .= True
-    barWidth //= 2
-
-namedBarExample = renderAxis namedBarAxis

barPlot' #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) 
=> f n

bar heights

-> m ()

changes to the Axis

Simple version of barPlot without any modification to the Plot.

Example

Expand

import Plots
-barAxis' :: Axis B V2 Double
-barAxis' = r2Axis &~ do
-  xMin ?= 0
-  hide (yAxis . majorGridLines)
-  barPlot' [13.5, 3.0, 6.9, 7.2, 4.6]
barExample' = renderAxis barAxis'

barPlot #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) 
=> f n

bar heights

-> State (Plot (BarPlot n) b) ()

changes to the bars

-> m ()

changes to the Axis

A add BarPlot to an Axis.

Example

Expand

import Plots
-barAxis :: Axis B V2 Double
-barAxis = r2Axis &~ do
-  yMin ?= 0
-  hide majorGridLines
-  barPlot [13.5, 3.0, 6.9, 7.2, 4.6] $ do
-    vertical .= True
-    barWidth //= 2
barExample = renderAxis barAxis

mkGroupedBars #

Arguments

:: Fractional n 
=> n

width factor of individual bars (1 = touching)

-> BarLayout n 
-> [[n]] 
-> [BarPlot n] 

Make bars that are grouped together. Each group of bars is treated - as a single bar when using the BarPlotsOpts. There is an addition - parameter to adjust the width of each individual bar.

mkStackedEqualBars #

Arguments

:: Fractional n 
=> n

value each bar reaches

-> BarLayout n 
-> [[n]]

values

-> [BarPlot n] 

Similar to mkMultiStacked but stack has the same height.

mkStackedBars :: Num n => BarLayout n -> [[n]] -> [BarPlot n] #

Create uniform bars from groups of data, placing one on top of the - other. The first list will be the same as mkUniformBars opts (map - (0,) ys), subsequent lists will be placed on top.

mkRunningBars :: Num n => BarLayout n -> [[(n, n)]] -> [BarPlot n] #

Create uniform bars from groups of data, placing one group after - the other.

mkFloatingBars :: Foldable f => BarLayout n -> f (n, n) -> BarPlot n #

Create equidistant bars with lower and upper bounds for each bar.

mkBars :: (Foldable f, Num n) => BarLayout n -> f n -> BarPlot n #

Create equidistant bars using the values.

data BarLayout n #

The way an individual bar plot or a group of bars plots are laid - out on the axis.

Instances
Fractional n => Default (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

def :: BarLayout n #

HasBarLayout (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarLayout n) (BarLayout (N (BarLayout n))) #

barWidth :: Lens' (BarLayout n) (N (BarLayout n)) #

barSpacing :: Lens' (BarLayout n) (N (BarLayout n)) #

barStart :: Lens' (BarLayout n) (N (BarLayout n)) #

HasOrientation (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarLayout n) Orientation #

type N (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

type N (BarLayout n) = n

class HasOrientation a => HasBarLayout a where #

Class of things that have a modifiable BarLayout.

Minimal complete definition

barLayout

Methods

barLayout :: Lens' a (BarLayout (N a)) #

Lens onto the BarLayout

barWidth :: Lens' a (N a) #

The width bar for single / stacked bars or the width of a group - for grouped bar plot.

Default is 0.8

barSpacing :: Lens' a (N a) #

The spacing between each bar or group of bars.

Default is 1

barStart :: Lens' a (N a) #

The distance from the axis to centre of the first bar.

Default is 1

Instances
HasBarLayout (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarLayout n) (BarLayout (N (BarLayout n))) #

barWidth :: Lens' (BarLayout n) (N (BarLayout n)) #

barSpacing :: Lens' (BarLayout n) (N (BarLayout n)) #

barStart :: Lens' (BarLayout n) (N (BarLayout n)) #

HasBarLayout (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarPlot n) (BarLayout (N (BarPlot n))) #

barWidth :: Lens' (BarPlot n) (N (BarPlot n)) #

barSpacing :: Lens' (BarPlot n) (N (BarPlot n)) #

barStart :: Lens' (BarPlot n) (N (BarPlot n)) #

HasBarLayout a => HasBarLayout (Plot a b) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (Plot a b) (BarLayout (N (Plot a b))) #

barWidth :: Lens' (Plot a b) (N (Plot a b)) #

barSpacing :: Lens' (Plot a b) (N (Plot a b)) #

barStart :: Lens' (Plot a b) (N (Plot a b)) #

HasBarLayout (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (MultiBarState b n a) (BarLayout (N (MultiBarState b n a))) #

barWidth :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barSpacing :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barStart :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

data BarPlot n #

A bar plot for a single set of bars. Multi-bar plots are achieved - by having multiple BarPlots. Each bar plot corresponds to a - single legend entry. To get multiple bar entries/colours, use - multiple BarPlots

Instances
HasBarLayout (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarPlot n) (BarLayout (N (BarPlot n))) #

barWidth :: Lens' (BarPlot n) (N (BarPlot n)) #

barSpacing :: Lens' (BarPlot n) (N (BarPlot n)) #

barStart :: Lens' (BarPlot n) (N (BarPlot n)) #

HasOrientation (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarPlot n) Orientation #

OrderedField n => Enveloped (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

getEnvelope :: BarPlot n -> Envelope (V (BarPlot n)) (N (BarPlot n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (BarPlot n) b 
Instance details

Defined in Plots.Types.Bar

Methods

renderPlotable :: InSpace v n0 (BarPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (BarPlot n) => PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

type N (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

type N (BarPlot n) = n
type V (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

type V (BarPlot n) = V2

data MultiBarState b n a #

The MultiBarState is used to set the various options available - when building multiple bar plots together. The main functions used - to modify this state:

Instances
HasBarLayout (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (MultiBarState b n a) (BarLayout (N (MultiBarState b n a))) #

barWidth :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barSpacing :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barStart :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

HasOrientation (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (MultiBarState b n a) Orientation #

HasLabels (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

labels :: Lens' (MultiBarState b n a) [String]

type N (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

type N (MultiBarState b n a) = n

heatMapIndexed' #

Arguments

:: (VectorLike V2 Int i, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) 
=> i

extent of array

-> (i -> Double)

heat from index

-> m ()

add plot to Axis

Add a HeatMap plot using the extent of the heatmap and a - generating function without changes to the heap map options.

heatMapIndexed :: V2 Int     -> (V2 Int -> Double)     -> State (Axis b V2 n) ()
-heatMapIndexed :: (Int, Int) -> ((Int, Int) -> Double) -> State (Axis b V2 n) ()
-

Example

Expand

import Plots
-heatMapIndexedAxis' :: Axis B V2 Double
-heatMapIndexedAxis' = r2Axis &~ do
-  display colourBar
-  axisExtend .= noExtend
-  axisColourMap .= Plots.magma
-
-  let f (V2 x y) = fromIntegral x + fromIntegral y
-  heatMapIndexed' (V2 3 3) f
heatMapIndexedExample' = renderAxis heatMapIndexedAxis'

heatMapIndexed #

Arguments

:: (VectorLike V2 Int i, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) 
=> i

extent of array

-> (i -> Double)

heat from index

-> State (Plot (HeatMap b n) b) ()

changes to plot options

-> m ()

add plot to Axis

Add a HeatMap plot using the extent of the heatmap and a - generating function.

heatMapIndexed :: V2 Int     -> (V2 Int -> Double)     -> State (Plot (HeatMap b n)) () -> State (Axis b V2 n) ()
-heatMapIndexed :: (Int, Int) -> ((Int, Int) -> Double) -> State (Plot (HeatMap b n)) () -> State (Axis b V2 n) ()
-

Example

Expand

import Plots
-heatMapIndexedAxis :: Axis B V2 Double
-heatMapIndexedAxis = r2Axis &~ do
-  display colourBar
-  axisExtend .= noExtend
-
-  let f (V2 x y) = fromIntegral x + fromIntegral y
-  heatMapIndexed (V2 3 3) f $ heatMapSize .= V2 10 10
heatMapIndexedExample = renderAxis heatMapIndexedAxis

heatMap' #

Arguments

:: (Foldable f, Foldable g, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) 
=> f (g Double) 
-> m ()

add plot to Axis

Add a HeatMap plot using the extent of the heatmap and a - generating function.

heatMap' :: [[Double]] -> State (Axis b V2 n) ()
-

Example

Expand

import Plots
-heatMapAxis' :: Axis B V2 Double
-heatMapAxis' = r2Axis &~ do
-  display colourBar
-  axisExtend .= noExtend
-  axisColourMap .= Plots.magma
-
-  let xs = [[1,2,3],[4,5,6]]
-  heatMap' xs
heatMapExample' = renderAxis heatMapAxis'

heatMap #

Arguments

:: (Foldable f, Foldable g, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) 
=> f (g Double) 
-> State (Plot (HeatMap b n) b) ()

changes to plot options

-> m ()

add plot to Axis

Add a HeatMap plot using the extent of the heatmap and a - generating function.

heatMap :: [[Double]] -> State (Plot (HeatMap b n)) () -> State (Axis b V2 n) ()
-

Example

Expand

import Plots
-heatMapAxis :: Axis B V2 Double
-heatMapAxis = r2Axis &~ do
-  display colourBar
-  axisExtend .= noExtend
-
-  let xs = [[1,2,3],[4,5,6]]
-  heatMap xs $ heatMapSize .= V2 10 10
heatMapExample = renderAxis heatMapAxis

mkHeatMap :: (Renderable (Path V2 n) b, TypeableFloat n) => HeatMatrix -> HeatMap b n #

Construct a Heatmap using the given HeatMatrix.

pathHeatRender :: (Renderable (Path V2 n) b, TypeableFloat n) => HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

Render the heat map as a collection squares made up of Trails. - This method is compatible with all backends and should always look - sharp. However it can become slow and large for large heat maps.

It is recommended to use pathHeatRender for small heat maps and - pixelHeatRender for larger ones.

Example

Expand

import Plots
-
-pathHeatRenderExample =
-  let f (V2 x y) = fromIntegral x + fromIntegral y
-      myHM       = mkHeatMatrix (V2 5 5) f
-  in  pathHeatRender myHM viridis

heatImage :: HeatMatrix -> ColourMap -> Image PixelRGB8 #

Create an image of PixelsRGB8 using the heat matrix.

pixelHeatRender' :: (Renderable (DImage n Embedded) b, TypeableFloat n) => Int -> HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

Render an heatmap as an ImageRGB8 with n pixels per heat matrix - point.

Example

Expand

import Plots
-
-pixelHeatRenderExample' =
-  let f (V2 x y) = fromIntegral x + fromIntegral y
-      myHM       = mkHeatMatrix (V2 5 5) f
-  in  pixelHeatRender' 10 myHM viridis

pixelHeatRender :: (Renderable (DImage n Embedded) b, TypeableFloat n) => HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

Render an heatmap as an ImageRGB8.

Example

Expand

import Plots
-
-pixelHeatRenderExample =
-  let f (V2 x y) = fromIntegral x + fromIntegral y
-      myHM       = mkHeatMatrix (V2 5 5) f
-  in  pixelHeatRender myHM viridis

hmPoints :: IndexedTraversal' (V2 Int) HeatMatrix Double #

Indexed traversal over the values of a HeatMatrix.

mkHeatMatrix' :: (Foldable f, Foldable g) => f (g Double) -> HeatMatrix #

Construct a heat matrix from a foldable of foldables.

mkHeatMatrix' :: [[Double]] -> HeatMatrix
-mkHeatMatrix' :: [Vector Double] -> HeatMatrix
-

mkHeatMatrix :: V2 Int -> (V2 Int -> Double) -> HeatMatrix #

Construct a heat matrix from a size and a generating function.

data HeatMatrix #

2D Array of Doubles.

data HeatMap b n #

A mapping from points in a 2D axis do Doubles. These Doubles - are converted to colours using the axis ColourMap.

Instances
HasHeatMap f (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (HeatMap b n) (HeatMap b (N (HeatMap b n))) #

heatMapGridVisible :: LensLike' f (HeatMap b n) Bool #

heatMapGridStyle :: LensLike' f (HeatMap b n) (Style V2 (N (HeatMap b n))) #

heatMapSize :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapExtent :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapStart :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapCentre :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapLimits :: LensLike' f (HeatMap b n) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (HeatMap b n) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (HeatMap b n)) Any) #

OrderedField n => Enveloped (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

Methods

getEnvelope :: HeatMap b n -> Envelope (V (HeatMap b n)) (N (HeatMap b n))

(Typeable b, TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

renderPlotable :: InSpace v n0 (HeatMap b n) => AxisSpec v n0 -> PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HeatMap b n) => PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

type N (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

type N (HeatMap b n) = n
type V (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

type V (HeatMap b n) = V2

class HasHeatMap (f :: * -> *) a b | a -> b where #

Class of things that let you change the heatmap options.

Minimal complete definition

heatMapOptions

Methods

heatMapOptions :: LensLike' f a (HeatMap b (N a)) #

Lens onto the heatmap options.

heatMapGridVisible :: LensLike' f a Bool #

Whether there should be grid lines draw for the heat map.

Default is False.

heatMapGridStyle :: LensLike' f a (Style V2 (N a)) #

The style applied to the grid lines for the heat map, if they're - visible.

Default is mempty.

heatMapSize :: LensLike' f a (V2 (N a)) #

The size of each individual square in the heat map.

Default is V2 1 1.

heatMapExtent :: LensLike' f a (V2 (N a)) #

The size of the full extend of the heat map.

Default is extent of the heat matrix.

heatMapStart :: LensLike' f a (P2 (N a)) #

The starting point at the bottom left corner of the heat map.

Default is origin

heatMapCentre :: LensLike' f a (P2 (N a)) #

The center point of the heat map.

heatMapLimits :: LensLike' f a (Maybe (Double, Double)) #

Limits (a,b) used on the data such that a is the start of the - ColourMap and b is the end of the ColourMap. Default is (0,1).

heatMapRender :: LensLike' f a (HeatMatrix -> ColourMap -> QDiagram b V2 (N a) Any) #

Funtion used to render the heat map. See pathHeatRender and - pixelHeatRender.

Default is pathHeatRender.

Instances
(Functor f, HasHeatMap f a b) => HasHeatMap f (Plot a b) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (Plot a b) (HeatMap b (N (Plot a b))) #

heatMapGridVisible :: LensLike' f (Plot a b) Bool #

heatMapGridStyle :: LensLike' f (Plot a b) (Style V2 (N (Plot a b))) #

heatMapSize :: LensLike' f (Plot a b) (V2 (N (Plot a b))) #

heatMapExtent :: LensLike' f (Plot a b) (V2 (N (Plot a b))) #

heatMapStart :: LensLike' f (Plot a b) (P2 (N (Plot a b))) #

heatMapCentre :: LensLike' f (Plot a b) (P2 (N (Plot a b))) #

heatMapLimits :: LensLike' f (Plot a b) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (Plot a b) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (Plot a b)) Any) #

HasHeatMap f (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (HeatMap b n) (HeatMap b (N (HeatMap b n))) #

heatMapGridVisible :: LensLike' f (HeatMap b n) Bool #

heatMapGridStyle :: LensLike' f (HeatMap b n) (Style V2 (N (HeatMap b n))) #

heatMapSize :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapExtent :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapStart :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapCentre :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapLimits :: LensLike' f (HeatMap b n) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (HeatMap b n) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (HeatMap b n)) Any) #

histogramPlotOf' :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, RealFrac n) => Fold s n -> s -> m () #

Same as histogramPlotOf without any changes to the plot.

histogramPlotOf #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, RealFrac n) 
=> Fold s n

fold over the data

-> s

data to fold

-> State (Plot (HistogramOptions n) b) ()

change to the plot

-> m ()

add plot to the Axis

Add a HistogramPlot using a fold over the data.

histogramPlot' #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f, RealFrac n) 
=> f n

data

-> m ()

add plot to axis

Make a HistogramPlot without changes to the plot options.

histogramPlot #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f, RealFrac n) 
=> f n

data

-> State (Plot (HistogramOptions n) b) ()

changes to plot options

-> m ()

add plot to axis

Add a HistogramPlot to the AxisState from a data set.

Example

Expand

import Plots
-histogramAxis :: Axis B V2 Double
-histogramAxis = r2Axis &~ do
-  histogramPlot sampleData $ do
-    key "histogram"
-    plotColor .= blue
-    areaStyle . _opacity .= 0.5
histogramExample = renderAxis histogramAxis

mkHistogramPlot :: (Foldable f, RealFrac n) => HistogramOptions n -> f n -> HistogramPlot n #

Create a histogram by binning the data using the - HistogramOptions.

cdf :: NormalisationMethod #

Cumulative density function estimate. The height of each bar is - equal to the cumulative relative number of observations in the bin - and all previous bins. The height of the last bar is 1.

Example

Expand

cumilative :: NormalisationMethod #

The height of each bar is the cumulative number of observations in - each bin and all previous bins. The height of the last bar is the - total number of observations.

Example

Expand

pdf :: NormalisationMethod #

The total area of the bars is 1. This gives a probability density - function estimate.

Example

Expand

countDensity :: NormalisationMethod #

The height of each bar is n / w where n is the number of - observations and w is the total width.

Example

Expand

probability :: NormalisationMethod #

The sum of the heights of the bars is equal to 1.

Example

Expand

count :: NormalisationMethod #

The height of each bar is the number of observations. This is the - Default method.

Example

Expand

mkComputedHistogram #

Arguments

:: Foldable f 
=> n

start of first bin

-> n

width of each bin

-> f n

heights of the bins

-> HistogramPlot n 

Construct a HistogramPlot from raw histogram data.

computedHistogram #

Arguments

:: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f) 
=> n

start of first bin

-> n

width of each bin

-> f n

heights of the bins

-> State (Plot (HistogramPlot n) b) () 
-> m () 

Plot an already computed histogram with equally sized bins.

data HistogramPlot n #

Simple histogram type supporting uniform bins.

Instances
HasOrientation (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramPlot n) Orientation #

OrderedField n => Enveloped (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

getEnvelope :: HistogramPlot n -> Envelope (V (HistogramPlot n)) (N (HistogramPlot n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HistogramPlot n) b 
Instance details

Defined in Plots.Types.Histogram

Methods

renderPlotable :: InSpace v n0 (HistogramPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HistogramPlot n) => PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

type N (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

type N (HistogramPlot n) = n
type V (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

type V (HistogramPlot n) = V2

data NormalisationMethod #

The way to normalise the data from a histogram. The default method - is count.

Instances
Default NormalisationMethod 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: NormalisationMethod #

data HistogramOptions n #

Options for binning histogram data. For now only very basic - histograms building is supported.

Instances
Default (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: HistogramOptions n #

HasHistogramOptions (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (HistogramOptions n) (HistogramOptions (N (HistogramOptions n))) #

numBins :: Lens' (HistogramOptions n) Int #

binRange :: Lens' (HistogramOptions n) (Maybe (N (HistogramOptions n), N (HistogramOptions n))) #

normaliseSample :: Lens' (HistogramOptions n) NormalisationMethod #

HasOrientation (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramOptions n) Orientation #

type N (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

type N (HistogramOptions n) = n
type V (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

type V (HistogramOptions n) = V2

class HasOrientation a => HasHistogramOptions a where #

Minimal complete definition

histogramOptions

Methods

histogramOptions :: Lens' a (HistogramOptions (N a)) #

Options for building the histogram from data.

numBins :: Lens' a Int #

The number of bins (bars) to use for the histogram. Must be - positive.

Default is 10.

binRange :: Lens' a (Maybe (N a, N a)) #

The range of data to consider when building the histogram. Any - data outside the range is ignored.

Default is Nothing.

normaliseSample :: Lens' a NormalisationMethod #

Should the resulting histogram be normalised so the total area is - 1.

Default is False.

Instances
HasHistogramOptions (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (HistogramOptions n) (HistogramOptions (N (HistogramOptions n))) #

numBins :: Lens' (HistogramOptions n) Int #

binRange :: Lens' (HistogramOptions n) (Maybe (N (HistogramOptions n), N (HistogramOptions n))) #

normaliseSample :: Lens' (HistogramOptions n) NormalisationMethod #

HasHistogramOptions a => HasHistogramOptions (Plot a b) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (Plot a b) (HistogramOptions (N (Plot a b))) #

numBins :: Lens' (Plot a b) Int #

binRange :: Lens' (Plot a b) (Maybe (N (Plot a b), N (Plot a b))) #

normaliseSample :: Lens' (Plot a b) NormalisationMethod #

mkPathOf :: (PointLike v n p, OrderedField n) => Fold s t -> Fold t p -> s -> Path v n #

Construct a localed trail from a fold over points.

mkPath :: (PointLike v n p, OrderedField n, Foldable f, Foldable g) => g (f p) -> Path v n #

Construct a localed trail from a fold over points.

mkTrailOf :: (PointLike v n p, OrderedField n) => Fold s p -> s -> Located (Trail v n) #

Construct a localed trail from a fold over points.

mkTrail :: (PointLike v n p, OrderedField n, Foldable f) => f p -> Located (Trail v n) #

Construct a localed trail from a list of folable of points.

smoothLinePlot' #

Arguments

:: (BaseSpace c ~ v, Foldable f, PointLike v n p, Plotable (Path v n) b, Fractional (v n), MonadState (Axis b c n) m) 
=> f p

points to turn into trail

-> m ()

add plot to the Axis

Add a smooth Path plot from a list of points using cubicSpline - without changes to the plot options.

smoothLinePlot #

Arguments

:: (BaseSpace c ~ v, Foldable f, Metric v, PointLike v n p, Plotable (Path v n) b, Fractional (v n), MonadState (Axis b c n) m) 
=> f p

points to turn into trail

-> State (Plot (Path v n) b) ()

changes to plot options

-> m ()

add plot to the Axis

Add a smooth Path plot from a list of points using cubicSpline.

linePlot' #

Arguments

:: (BaseSpace c ~ v, Metric v, Foldable f, PointLike v n p, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> f p

points to turn into trail

-> m ()

add plot to the Axis

Add a Path plot from a list of points.

linePlot #

Arguments

:: (BaseSpace c ~ v, Metric v, Foldable f, PointLike v n p, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> f p

points to turn into trail

-> State (Plot (Path v n) b) ()

changes to plot options

-> m ()

add plot to the Axis

Add a Path plot from a list of points.

pathPlot' #

Arguments

:: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> Path v n

path to plot

-> m ()

add plot to the Axis

Add a Path as a Plot to an Axis without changes to the plot - options.

pathPlot #

Arguments

:: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> Path v n

path to plot

-> State (Plot (Path v n) b) ()

changes to plot options

-> m ()

add plot to the Axis

Add a Path as a Plot to an Axis.

trailPlot' #

Arguments

:: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> Trail v n

trail to plot

-> m ()

add plot to the Axis

Add a Trail as a Plot to an Axis without changes to the plot - options.

trailPlot #

Arguments

:: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) 
=> Trail v n

trail to plot

-> State (Plot (Path v n) b) ()

changes to plot options

-> m ()

add plot to the Axis

Add a Trail as a Plot to an Axis.

wedgePlot :: (v ~ BaseSpace c, v ~ V2, PointLike v n (Polar n), MonadState (Axis b c n) m, Plotable (Wedge n) b) => Direction V2 n -> Angle n -> State (Plot (Wedge n) b) () -> m () #

Add a single PiePlot to the AxisState from a data set.

Example

Expand

import Plots
-
-wedgePlotAxis :: Axis B Polar Double
-wedgePlotAxis = polarAxis &~ do
-  wedgePlot xDir (38@@deg) $ key "wedge"
wedgeExample = renderAxis wedgePlotAxis

piePlot' #

Arguments

:: (MonadState (Axis b Polar n) m, Plotable (Wedge n) b, Foldable f) 
=> f n

weight of each wedge

-> m () 

Make a pie plot from list of values without any changes.

Example

Expand

import Plots
-
-piePlotAxis' :: Axis B Polar Double
-piePlotAxis' = polarAxis &~ do
-  piePlot' [1,3,5,2]
-  wedgeInnerRadius .= 0.5
-  hide (axes . traversed)
pieExample' = renderAxis piePlotAxis'

piePlot #

Arguments

:: (MonadState (Axis b Polar n) m, Plotable (Wedge n) b, Foldable f) 
=> f a

data for each wedge

-> (a -> n)

extract weight of each wedge

-> State (PieState b n a) () 
-> m () 

Make a pie plot from a list of data by making a series of wedge - plots.

Example

Expand

import Plots
-
-pieData = [("red", 3), ("blue", 4), ("green", 2), ("purple", 5)]
-
-piePlotAxis :: Axis B Polar Double
-piePlotAxis = polarAxis &~ do
-  piePlot pieData snd $ wedgeKeys fst
-  hide (axes . traversed)
piePlotExample = renderAxis piePlotAxis

wedgeKeys :: Num n => (a -> String) -> State (PieState b n a) () #

Add a legend entry for each item given a function that extracts the - item's name.

onWedges :: (a -> State (Plot (Wedge n) b) ()) -> State (PieState b n a) () #

Modify the state for each wedge given the data entry.

Some common lenses to use on the Wedge:

  • plotColour - change the colour of the bars
  • areaStyle - modify the style of the bars
  • key - add a legend entry for that group of bars
  • wedgeOffset - the offset of the wedge from the center

mkWedge #

Arguments

:: Num n 
=> Direction V2 n

starting direction

-> Angle n

width of wedge

-> Wedge n

resulting wedge

Create a pie wedge with unit radius, starting at direction d with - width theta.

data Wedge n #

Contains information to draw a single wedge of a pie. It is not - intended to be draw directly. Instead use 'piePlot.

Instances
HasWedge f (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Wedge n) (Wedge (N (Wedge n))) #

wedgeOuterRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeInnerRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeOffset :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeWidth :: LensLike' f (Wedge n) (Angle (N (Wedge n))) #

wedgeDirection :: LensLike' f (Wedge n) (Direction V2 (N (Wedge n))) #

RealFloat n => Enveloped (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

getEnvelope :: Wedge n -> Envelope (V (Wedge n)) (N (Wedge n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Wedge n) b 
Instance details

Defined in Plots.Types.Pie

Methods

renderPlotable :: InSpace v n0 (Wedge n) => AxisSpec v n0 -> PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Wedge n) => PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

type N (Wedge n) 
Instance details

Defined in Plots.Types.Pie

type N (Wedge n) = n
type V (Wedge n) 
Instance details

Defined in Plots.Types.Pie

type V (Wedge n) = V2

class HasWedge (f :: * -> *) a where #

Minimal complete definition

pieWedge

Methods

pieWedge :: LensLike' f a (Wedge (N a)) #

Description on how to draw a wedge.

wedgeOuterRadius :: LensLike' f a (N a) #

The outside radius of the wedge. Default is 1.

wedgeInnerRadius :: LensLike' f a (N a) #

The inside radius of the wedge. Default is $0$.

wedgeOffset :: LensLike' f a (N a) #

The offset of the wedge from the center.

wedgeWidth :: LensLike' f a (Angle (N a)) #

The width of the wedge, starting from the wedgeDirection.

wedgeDirection :: LensLike' f a (Direction V2 (N a)) #

The inititial direction of the wedge.

Instances
HasWedge f (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Wedge n) (Wedge (N (Wedge n))) #

wedgeOuterRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeInnerRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeOffset :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeWidth :: LensLike' f (Wedge n) (Angle (N (Wedge n))) #

wedgeDirection :: LensLike' f (Wedge n) (Direction V2 (N (Wedge n))) #

(Functor f, HasWedge f a) => HasWedge f (Plot a b) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Plot a b) (Wedge (N (Plot a b))) #

wedgeOuterRadius :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeInnerRadius :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeOffset :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeWidth :: LensLike' f (Plot a b) (Angle (N (Plot a b))) #

wedgeDirection :: LensLike' f (Plot a b) (Direction V2 (N (Plot a b))) #

(v ~ V2, Applicative f, Typeable n) => HasWedge f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (StyledPlot b v n) (Wedge (N (StyledPlot b v n))) #

wedgeOuterRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeInnerRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeOffset :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeWidth :: LensLike' f (StyledPlot b v n) (Angle (N (StyledPlot b v n))) #

wedgeDirection :: LensLike' f (StyledPlot b v n) (Direction V2 (N (StyledPlot b v n))) #

Applicative f => HasWedge f (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (PieState b n a) (Wedge (N (PieState b n a))) #

wedgeOuterRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeInnerRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeOffset :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeWidth :: LensLike' f (PieState b n a) (Angle (N (PieState b n a))) #

wedgeDirection :: LensLike' f (PieState b n a) (Direction V2 (N (PieState b n a))) #

(Applicative f, Typeable b, v ~ V2, Typeable n) => HasWedge f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (DynamicPlot b v n) (Wedge (N (DynamicPlot b v n))) #

wedgeOuterRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeInnerRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeOffset :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeWidth :: LensLike' f (DynamicPlot b v n) (Angle (N (DynamicPlot b v n))) #

wedgeDirection :: LensLike' f (DynamicPlot b v n) (Direction V2 (N (DynamicPlot b v n))) #

(BaseSpace c ~ V2, Settable f, Typeable n) => HasWedge f (Axis b c n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Axis b c n) (Wedge (N (Axis b c n))) #

wedgeOuterRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeInnerRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeOffset :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeWidth :: LensLike' f (Axis b c n) (Angle (N (Axis b c n))) #

wedgeDirection :: LensLike' f (Axis b c n) (Direction V2 (N (Axis b c n))) #

data PieState b n a #

The state used to draw a part chart made of multiple pie wedges.

Instances
Applicative f => HasWedge f (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (PieState b n a) (Wedge (N (PieState b n a))) #

wedgeOuterRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeInnerRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeOffset :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeWidth :: LensLike' f (PieState b n a) (Angle (N (PieState b n a))) #

wedgeDirection :: LensLike' f (PieState b n a) (Direction V2 (N (PieState b n a))) #

type N (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

type N (PieState b n a) = n
type V (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

type V (PieState b n a) = V2

gscatterOptionsFor :: (InSpace v n a, HasScatterOptions f a d) => proxy d -> LensLike' f a (ScatterOptions v n d) #

Helper to traverse over a general scatter plot where the type of d - is not infered.

gscatterPlot #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable d, Foldable f) 
=> f d

data

-> (d -> p)

extract point from data

-> State (Plot (ScatterOptions v n d) b) ()

options for plot

-> m ()

add plot to Axis

A general scatter plot allow using any data type d to determine - the scatterTransform and scatterStyle.

bubbleStyle :: (InSpace v n a, Settable f, HasScatterOptions f a (n, Point v n)) => LensLike' f a (n -> Style v n) #

Setter over the style function for a bubblePlot. Default is mempty.

bubbleStyle :: Setter' (Plot (BubbleOptions v n) v) (n -> Style v n)
-

Note that this is the less general version of bubblePlot . - scatterTransform, which would give a LensLike onto (n, - Point v n) -> Style v n.

bubbleTransform :: (InSpace v n a, HasScatterOptions f a (n, Point v n), Settable f) => LensLike' f a (n -> Transformation v n) #

Setter over the transform function for a bubblePlot. Default is scale.

bubbleOptions :: Setter' (Plot (BubbleOptions v n) v) (n -> Transformation v n)
-

Note that this is the less general version of bubblePlot . - scatterTransform, which would give a LensLike onto (n, - Point v n) -> Transformation v n.

bubbleOptions :: (InSpace v n a, HasScatterOptions f a (n, Point v n)) => LensLike' f a (BubbleOptions v n) #

LensLike onto into a ScatterOptions made up of a scaler n, and - a point, Point v n

bubbleOptions :: Lens' (Plot (BubbleOptions v n) v) (BubbleOptions v n)
-

bubblePlotOf' #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n) 
=> Fold s (n, p)

fold over the data

-> s

data

-> State (Plot (BubbleOptions v n) b) ()

changes to the options

-> m ()

add plot to Axis

Version of bubblePlot using a Fold over the data without any - changes to the BubbleOptions.

bubblePlotOf #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n) 
=> Fold s (n, p)

fold over the data

-> s

data

-> State (Plot (BubbleOptions v n) b) ()

changes to the options

-> m ()

add plot to Axis

Version of bubblePlot using a Fold over the data.

bubblePlot' #

Arguments

:: (v ~ BaseSpace c, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) 
=> f (n, p)

fold over points with a size

-> m ()

add plot to Axis

Simple version of bubblePlot without any changes to the Plot.

bubblePlot #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n, Foldable f) 
=> f (n, p)

fold over points with a size

-> State (Plot (BubbleOptions v n) b) ()

changes to the options

-> m ()

add plot to Axis

Scatter plots with extra numeric parameter. By default the extra - parameter is the scale of the marker but this can be changed.

scatterPlotOf' #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b) 
=> Fold s p

fold over points

-> s

data to fold

-> m ()

add plot to axis

Version of scatterPlot that accepts a Fold over the data - without any changes to the ScatterOptions.

scatterPlotOf #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b) 
=> Fold s p

fold over points

-> s

data to fold

-> State (Plot (ScatterOptions v n (Point v n)) b) ()

changes to plot options

-> m ()

add plot to Axis

Version of scatterPlot that accepts a Fold over the data.

scatterPlot' #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) 
=> f p

points to plot

-> m ()

add plot to Axis

Version of scatterPlot without any changes to the - ScatterOptions.

Example

Expand

import Plots
-mydata4 = [(1,3), (2,5.5), (3.2, 6), (3.5, 6.1)]
-mydata5 = mydata1 & each . _1 *~ 0.5
-mydata6 = [V2 1.2 2.7, V2 2 5.1, V2 3.2 2.6, V2 3.5 5]
scatterAxis' :: Axis B V2 Double
-scatterAxis' = r2Axis &~ do
-  scatterPlot' mydata4
-  scatterPlot' mydata5
-  scatterPlot' mydata6
scatterExample' = renderAxis scatterAxis'

scatterPlot #

Arguments

:: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) 
=> f p

points to plot

-> State (Plot (ScatterOptions v n (Point v n)) b) ()

changes to plot options

-> m ()

add plot to Axis

Add a ScatterPlot to the AxisState from a data set.

  myaxis = r2Axis ~&
-    scatterPlot data1
-

Example

Expand

import Plots
-mydata1 = [(1,3), (2,5.5), (3.2, 6), (3.5, 6.1)]
-mydata2 = mydata1 & each . _1 *~ 0.5
-mydata3 = [V2 1.2 2.7, V2 2 5.1, V2 3.2 2.6, V2 3.5 5]
scatterAxis :: Axis B V2 Double
-scatterAxis = r2Axis &~ do
-  scatterPlot mydata1 $ key "data 1"
-  scatterPlot mydata2 $ key "data 2"
-  scatterPlot mydata3 $ key "data 3"
scatterExample = renderAxis scatterAxis

scatterOptions :: (InSpace v n a, HasScatterOptions f a (Point v n)) => LensLike' f a (ScatterOptions v n (Point v n)) #

Lens onto a scatter plot of points.

mkScatterOptions :: (PointLike v n p, Foldable f, Fractional n) => f a -> (a -> p) -> ScatterOptions v n a #

Low level construction of ScatterOptions.

data ScatterPlot (v :: * -> *) n #

A general data type for scatter plots. Allows storing different - types of data as well as allowing transforms depending on the data.

Instances
HasConnectingLine f (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterPlot v n) Bool #

(Applicative f, Typeable v, Typeable n, Typeable d) => HasScatterOptions f (ScatterPlot v n) d 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterPlot v n) (ScatterOptions (V (ScatterPlot v n)) (N (ScatterPlot v n)) d) #

scatterTransform :: LensLike' f (ScatterPlot v n) (d -> Transformation (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterStyle :: LensLike' f (ScatterPlot v n) (d -> Style (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterPosition :: LensLike' f (ScatterPlot v n) (d -> Point (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

(Metric v, OrderedField n) => Enveloped (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

getEnvelope :: ScatterPlot v n -> Envelope (V (ScatterPlot v n)) (N (ScatterPlot v n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (ScatterPlot V2 n) b 
Instance details

Defined in Plots.Types.Scatter

Methods

renderPlotable :: InSpace v n0 (ScatterPlot V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (ScatterPlot V2 n) => PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

type N (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

type N (ScatterPlot v n) = n
type V (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

type V (ScatterPlot v n) = v

data ScatterOptions (v :: * -> *) n a #

A general data type for scatter plots. Allows storing different - types of data as well as allowing transforms depending on the data.

Instances
HasConnectingLine f (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterOptions v n a) Bool #

d ~ d' => HasScatterOptions f (ScatterOptions v n d) d' 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterOptions v n d) (ScatterOptions (V (ScatterOptions v n d)) (N (ScatterOptions v n d)) d') #

scatterTransform :: LensLike' f (ScatterOptions v n d) (d' -> Transformation (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterStyle :: LensLike' f (ScatterOptions v n d) (d' -> Style (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterPosition :: LensLike' f (ScatterOptions v n d) (d' -> Point (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

type N (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

type N (ScatterOptions v n a) = n
type V (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

type V (ScatterOptions v n a) = v

class HasConnectingLine (f :: * -> *) a where #

Class of things that have a LensLike for a ScatterPlot 's - connecting line.

Minimal complete definition

connectingLine

Methods

connectingLine :: LensLike' f a Bool #

LensLike onto whether the scatter plot should have a connecting - line between points. If the line is present, it uses the - lineStyle from the PlotStyle.

Instances
HasConnectingLine f (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterPlot v n) Bool #

HasConnectingLine f p => HasConnectingLine f (Plot p b) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Plot p b) Bool #

(Applicative f, Typeable v, Typeable n) => HasConnectingLine f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (StyledPlot b v n) Bool #

HasConnectingLine f (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterOptions v n a) Bool #

(Applicative f, Typeable b, Typeable v, Typeable n) => HasConnectingLine f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (DynamicPlot b v n) Bool #

(Settable f, Typeable (BaseSpace c), Typeable n) => HasConnectingLine f (Axis b c n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Axis b c n) Bool #

class HasScatterOptions (f :: * -> *) a d where #

Minimal complete definition

gscatterOptions

Methods

gscatterOptions :: LensLike' f a (ScatterOptions (V a) (N a) d) #

Lens onto the ScatterOptions for a general scatter plot.

scatterTransform :: LensLike' f a (d -> Transformation (V a) (N a)) #

Apply a transform to the markers using the associated data.

scatterStyle :: LensLike' f a (d -> Style (V a) (N a)) #

Apply a style to the markers using the associated data.

scatterPosition :: LensLike' f a (d -> Point (V a) (N a)) #

Change the position of the markers depending on the data.

Instances
(Applicative f, Typeable v, Typeable n, Typeable d) => HasScatterOptions f (ScatterPlot v n) d 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterPlot v n) (ScatterOptions (V (ScatterPlot v n)) (N (ScatterPlot v n)) d) #

scatterTransform :: LensLike' f (ScatterPlot v n) (d -> Transformation (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterStyle :: LensLike' f (ScatterPlot v n) (d -> Style (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterPosition :: LensLike' f (ScatterPlot v n) (d -> Point (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

(Functor f, HasScatterOptions f p a) => HasScatterOptions f (Plot p b) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Plot p b) (ScatterOptions (V (Plot p b)) (N (Plot p b)) a) #

scatterTransform :: LensLike' f (Plot p b) (a -> Transformation (V (Plot p b)) (N (Plot p b))) #

scatterStyle :: LensLike' f (Plot p b) (a -> Style (V (Plot p b)) (N (Plot p b))) #

scatterPosition :: LensLike' f (Plot p b) (a -> Point (V (Plot p b)) (N (Plot p b))) #

d ~ d' => HasScatterOptions f (ScatterOptions v n d) d' 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterOptions v n d) (ScatterOptions (V (ScatterOptions v n d)) (N (ScatterOptions v n d)) d') #

scatterTransform :: LensLike' f (ScatterOptions v n d) (d' -> Transformation (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterStyle :: LensLike' f (ScatterOptions v n d) (d' -> Style (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterPosition :: LensLike' f (ScatterOptions v n d) (d' -> Point (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

(Applicative f, Typeable b, Typeable v, Typeable n, Typeable a) => HasScatterOptions f (DynamicPlot b v n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (DynamicPlot b v n) (ScatterOptions (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) a) #

scatterTransform :: LensLike' f (DynamicPlot b v n) (a -> Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterStyle :: LensLike' f (DynamicPlot b v n) (a -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterPosition :: LensLike' f (DynamicPlot b v n) (a -> Point (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

(Applicative f, Typeable b, Typeable (BaseSpace c), Typeable n, Typeable a) => HasScatterOptions f (Axis b c n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Axis b c n) (ScatterOptions (V (Axis b c n)) (N (Axis b c n)) a) #

scatterTransform :: LensLike' f (Axis b c n) (a -> Transformation (V (Axis b c n)) (N (Axis b c n))) #

scatterStyle :: LensLike' f (Axis b c n) (a -> Style (V (Axis b c n)) (N (Axis b c n))) #

scatterPosition :: LensLike' f (Axis b c n) (a -> Point (V (Axis b c n)) (N (Axis b c n))) #

type BubbleOptions (v :: * -> *) n = ScatterOptions v n (n, Point v n) #

A bubble plot is a scatter plot using point together with a scalar.

polarAxis :: (TypeableFloat n, Renderable (Text n) b, Renderable (Path V2 n) b) => Axis b Polar n #

thetaLabel :: Circle c => Lens' (Axis b c n) String #

The label for the radial axis. Shorthand for rAxis . axisLabelText.

thetaAxis :: Circle c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

Lens onto the radial axis of an Axis.

rMax :: Radial c => Lens' (Axis b c n) (Maybe n) #

The minimum z value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis. - rMin :: R3 c => Lens' (Axis b c n) (Maybe n) - rMin = zAxis . boundMin

The minimum radial value for the axis. If the value if Nothing - (the Default), the bounds will be infered by the plots in the - axis.

rLabel :: Radial c => Lens' (Axis b c n) String #

The label for the radial axis. Shorthand for rAxis . axisLabelText.

rAxis :: Radial c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

Lens onto the radial axis of an Axis.

zMax :: R3 c => Lens' (Axis b c n) (Maybe n) #

The minimum z value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

zMin :: R3 c => Lens' (Axis b c n) (Maybe n) #

The minimum z value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

zLabel :: R3 c => Lens' (Axis b c n) String #

The label for the z-axis. Shorthand for zAxis . axisLabelText.

zAxis :: R3 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

Lens onto the z-axis of an Axis.

yMax :: R2 c => Lens' (Axis b c n) (Maybe n) #

The minimum y value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

yMin :: R2 c => Lens' (Axis b c n) (Maybe n) #

The minimum y value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

yLabel :: R2 c => Lens' (Axis b c n) String #

The label for the y-axis. Shorthand for yAxis . axisLabelText.

yAxis :: R2 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

Lens onto the y-axis of an Axis.

xMax :: R1 c => Lens' (Axis b c n) (Maybe n) #

The minimum x value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

xMin :: R1 c => Lens' (Axis b c n) (Maybe n) #

The minimum x value for the axis. If the value if Nothing (the - Default), the bounds will be infered by the plots in the axis.

xLabel :: R1 c => Lens' (Axis b c n) String #

The label for the x-axis. Shorthand for xAxis . axisLabelText.

xAxis :: R1 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

Lens onto the x-axis of an Axis.

r2Axis :: (TypeableFloat n, Renderable (Text n) b, Renderable (Path V2 n) b) => Axis b V2 n #

The default axis for plots in the V2 coordinate system.

addPlotable' #

Arguments

:: (InSpace (BaseSpace v) n p, MonadState (Axis b v n) m, Plotable p b) 
=> p

the raw plot

-> m ()

add plot to the Axis

Simple version of AddPlotable without any changes Plot.

addPlotable #

Arguments

:: (InSpace (BaseSpace c) n p, MonadState (Axis b c n) m, Plotable p b) 
=> p

the raw plot

-> State (Plot p b) ()

changes to the plot

-> m ()

add plot to the Axis

Add something Plotable to the Axis with a statefull modification - of the Plot.

addPlot #

Arguments

:: (InSpace (BaseSpace c) n p, MonadState (Axis b c n) m, Plotable p b) 
=> Plot p b

the plot

-> m ()

add plot to the Axis

Add a Plotable Plot to an Axis.

colourBarRange :: Functor f => ((n, n) -> f (n, n)) -> Axis b v n -> f (Axis b v n) #

The range used for the colour bar limits. This is automaticlaly set - when using heatMap or heatMap'

axisSize :: (HasLinearMap c, Num n, Ord n) => Lens' (Axis b c n) (SizeSpec c n) #

The size used for the rendered axis.

plotModifier :: BaseSpace c ~ v => Lens' (Axis b c n) (Endo (StyledPlot b v n)) #

Lens onto the modifier set by finalPlots. This gets applied to - all plots in the axis, just before they are rendered.

finalPlots :: BaseSpace c ~ v => Setter' (Axis b c n) (StyledPlot b v n) #

Setter over the final plot before the axis is rendered.

For example, to make all ScatterPlots in the axis use a - connectingLine (both currently in the axis and ones added later), - you can add

finalPlots . connectingLine .= True
-

currentPlots :: BaseSpace c ~ v => Traversal' (Axis b c n) (DynamicPlot b v n) #

Traversal over the current plots in the axis.

For example, to make all ScatterPlots currently in the axis use a - connectingLine, you can write

finalPlots . connectingLine .= True
-

axisPlots :: BaseSpace c ~ v => Lens' (Axis b c n) [DynamicPlot b v n] #

The list of plots currently in the axis.

axes :: (v ~ BaseSpace c, v ~ BaseSpace c') => Lens (Axis b c n) (Axis b c' n) (c (SingleAxis b v n)) (c' (SingleAxis b v n)) #

Lens onto the separate axes of an axis. Allows changing the - coordinate system as long as the BaseSpace is the same.

axes :: Lens' (Axis b c n) (c (SingleAxis b v n))
-

data SingleAxis b (v :: * -> *) n #

Render infomation for a single axis line.

Instances
Functor f => HasMajorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (SingleAxis b v n) (MajorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorTicksFunction :: LensLike' f (SingleAxis b v n) ((N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

majorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

majorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

majorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMinorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (SingleAxis b v n) (MinorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorTicksFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

minorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

minorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

minorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (SingleAxis b v n) (Ticks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMajorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (SingleAxis b v n) (MajorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

majorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMinorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (SingleAxis b v n) (MinorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

minorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (SingleAxis b v n) (GridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasAxisLine f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisLine :: LensLike' f (SingleAxis b v n) (AxisLine (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLineType :: LensLike' f (SingleAxis b v n) AxisLineType #

axisLineArrowOpts :: LensLike' f (SingleAxis b v n) (Maybe (ArrowOpts (N (SingleAxis b v n)))) #

axisLineStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasAxisScaling f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (SingleAxis b v n) (AxisScaling (N (SingleAxis b v n))) #

scaleAspectRatio :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

scaleMode :: LensLike' f (SingleAxis b v n) ScaleMode #

logScale :: LensLike' f (SingleAxis b v n) LogScale #

axisExtend :: LensLike' f (SingleAxis b v n) (Extending (N (SingleAxis b v n))) #

boundMin :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

boundMax :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

renderSize :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

Functor f => HasAxisLabel f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (SingleAxis b v n) (AxisLabel b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelText :: LensLike' f (SingleAxis b v n) String #

axisLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

axisLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelPosition :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

Functor f => HasTickLabels f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (SingleAxis b v n) (TickLabels b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [(N (SingleAxis b v n), String)]) #

tickLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

(TypeableFloat n, Renderable (Text n) b) => Default (SingleAxis b V2 n) 
Instance details

Defined in Plots.Axis

Methods

def :: SingleAxis b V2 n #

HasVisibility (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

visible :: Lens' (SingleAxis b v n) Bool #

hidden :: Lens' (SingleAxis b v n) Bool #

type N (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

type N (SingleAxis b v n) = n
type V (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

type V (SingleAxis b v n) = v

type family BaseSpace (c :: * -> *) :: * -> * #

This family is used so that we can say (Axis Polar) but use V2 for the - underlying diagram.

Instances
type BaseSpace Complex 
Instance details

Defined in Plots.Axis

type BaseSpace Complex = V2
type BaseSpace V3 
Instance details

Defined in Plots.Axis

type BaseSpace V3 = V3
type BaseSpace V2 
Instance details

Defined in Plots.Axis

type BaseSpace V2 = V2
type BaseSpace Polar 
Instance details

Defined in Plots.Axis

type BaseSpace Polar = V2

data Axis b (c :: * -> *) n #

Axis is the data type that holds all the nessessary information to render - a plot. Common LensLikes used for the axis (see haddock's - instances for a more comprehensive list):

The following LensLikes can be used on the on all the axes by - applying it the to Axis or can be used on a SingleAxis by using - it in combination with a specific axis (like xAxis).

Plots are usually added to the axis using specific functions for - that plots ('Plots.Types.Line.linePlot, barPlot). - These functions use addPlotable to add the plot to the axis.

Instances
(BaseSpace c ~ V2, Settable f, Typeable n) => HasWedge f (Axis b c n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Axis b c n) (Wedge (N (Axis b c n))) #

wedgeOuterRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeInnerRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeOffset :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeWidth :: LensLike' f (Axis b c n) (Angle (N (Axis b c n))) #

wedgeDirection :: LensLike' f (Axis b c n) (Direction V2 (N (Axis b c n))) #

(Settable f, Typeable (BaseSpace c), Typeable n) => HasConnectingLine f (Axis b c n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Axis b c n) Bool #

(Applicative f, Traversable c) => HasMajorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (Axis b c n) (MajorTicks (V (Axis b c n)) (N (Axis b c n))) #

majorTicksFunction :: LensLike' f (Axis b c n) ((N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

majorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

majorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

majorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMinorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (Axis b c n) (MinorTicks (V (Axis b c n)) (N (Axis b c n))) #

minorTicksFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

minorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

minorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

minorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (Axis b c n) (Ticks (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMajorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (Axis b c n) (MajorGridLines (V (Axis b c n)) (N (Axis b c n))) #

majorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

majorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMinorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (Axis b c n) (MinorGridLines (V (Axis b c n)) (N (Axis b c n))) #

minorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

minorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (Axis b c n) (GridLines (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasAxisScaling f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (Axis b c n) (AxisScaling (N (Axis b c n))) #

scaleAspectRatio :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

scaleMode :: LensLike' f (Axis b c n) ScaleMode #

logScale :: LensLike' f (Axis b c n) LogScale #

axisExtend :: LensLike' f (Axis b c n) (Extending (N (Axis b c n))) #

boundMin :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

boundMax :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

renderSize :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

(Applicative f, Typeable b, Typeable (BaseSpace c), Typeable n, Typeable a) => HasScatterOptions f (Axis b c n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Axis b c n) (ScatterOptions (V (Axis b c n)) (N (Axis b c n)) a) #

scatterTransform :: LensLike' f (Axis b c n) (a -> Transformation (V (Axis b c n)) (N (Axis b c n))) #

scatterStyle :: LensLike' f (Axis b c n) (a -> Style (V (Axis b c n)) (N (Axis b c n))) #

scatterPosition :: LensLike' f (Axis b c n) (a -> Point (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasAxisLabel f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (Axis b c n) (AxisLabel b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelText :: LensLike' f (Axis b c n) String #

axisLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

axisLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

axisLabelPosition :: LensLike' f (Axis b c n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (Axis b c n) AxisLabelPosition #

(Applicative f, Traversable c) => HasTickLabels f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (Axis b c n) (TickLabels b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [(N (Axis b c n), String)]) #

tickLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

tickLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

Settable f => HasPlotOptions f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotOptions :: LensLike' f (Axis b c n) (PlotOptions b (V (Axis b c n)) (N (Axis b c n))) #

plotName :: LensLike' f (Axis b c n) Name #

clipPlot :: LensLike' f (Axis b c n) Bool #

legendEntries :: LensLike' f (Axis b c n) [LegendEntry b (V (Axis b c n)) (N (Axis b c n))] #

plotTransform :: LensLike' f (Axis b c n) (Transformation (V (Axis b c n)) (N (Axis b c n))) #

plotVisible :: LensLike' f (Axis b c n) Bool #

Settable f => HasPlotStyle f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotStyle :: LensLike' f (Axis b c n) (PlotStyle b (V (Axis b c n)) (N (Axis b c n))) #

plotColour :: LensLike' f (Axis b c n) (Colour Double) #

plotColor :: LensLike' f (Axis b c n) (Colour Double) #

lineStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

lineStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

textStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

textStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

plotMarker :: LensLike' f (Axis b c n) (QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

plotStyles :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

plotStyleFunctions :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

HasColourBar (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

colourBar :: Lens' (Axis b v n) (ColourBar b (N (Axis b v n))) #

colourBarDraw :: Lens' (Axis b v n) (ColourMap -> QDiagram b V2 (N (Axis b v n)) Any) #

colourBarWidth :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarLengthFunction :: Lens' (Axis b v n) (N (Axis b v n) -> N (Axis b v n)) #

colourBarGap :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarStyle :: Lens' (Axis b v n) (Style V2 (N (Axis b v n))) #

HasTitle (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

title :: Lens' (Axis b c n) (Title b (V (Axis b c n)) (N (Axis b c n))) #

titleText :: Lens' (Axis b c n) String #

titleStyle :: Lens' (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

titlePlacement :: Lens' (Axis b c n) Placement #

titleGap :: Lens' (Axis b c n) (N (Axis b c n)) #

HasLegend (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

legend :: Lens' (Axis b c n) (Legend b (N (Axis b c n))) #

legendPlacement :: Lens' (Axis b c n) Placement #

legendGap :: Lens' (Axis b c n) (N (Axis b c n)) #

legendStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendSpacing :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextWidth :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextFunction :: Lens' (Axis b c n) (String -> QDiagram b V2 (N (Axis b c n)) Any) #

legendTextStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendOrientation :: Lens' (Axis b c n) Orientation #

HasAxisStyle (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisStyle :: Lens' (Axis b v n) (AxisStyle b (V (Axis b v n)) (N (Axis b v n))) #

axisColourMap :: Lens' (Axis b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (Axis b v n) (PlotStyle b (V (Axis b v n)) (N (Axis b v n))) #

type N (Axis b v n) 
Instance details

Defined in Plots.Axis

type N (Axis b v n) = n
type V (Axis b v n) 
Instance details

Defined in Plots.Axis

type V (Axis b v n) = BaseSpace v
type MainOpts (Axis b V2 n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b V2 n) = MainOpts (QDiagram b V2 n Any)
type MainOpts (Axis b Polar n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b Polar n) = MainOpts (QDiagram b V2 n Any)
type Args (Axis b v n) 
Instance details

Defined in Plots.Axis.Render

type Args (Axis b v n) = ()
type ResultOf (Axis b v n) 
Instance details

Defined in Plots.Axis.Render

type ResultOf (Axis b v n) = Axis b v n

pathColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => Int -> ColourMap -> QDiagram b V2 n Any #

Construct a colour bar made up of n solid square paths. The final - diagram is 1 by 1, with origin at the middle of the left side. This - can be used as the colourBarDraw function.

gradientColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => ColourMap -> QDiagram b V2 n Any #

The colour bar generated by a gradient texture. The final diagram - is 1 by 1, with origin at the middle of the left side. This can be - used as the colourBarDraw function.

This may not be supported by all backends.

renderColourBar #

Arguments

:: (TypeableFloat n, Renderable (Path V2 n) b) 
=> ColourBar b n

options for colour bar

-> ColourMap

map to use

-> (n, n)

bounds of the values on the colour bar

-> n

length of the colour bar

-> QDiagram b V2 n Any 

Render a colour bar by it's self at a given width. Note this - ignores colourBarGap and colourBarLengthFunction.

addColourBar #

Arguments

:: (TypeableFloat n, Renderable (Path V2 n) b) 
=> BoundingBox V2 n

bounding box to place against

-> ColourBar b n 
-> ColourMap 
-> (n, n) 
-> QDiagram b V2 n Any 

Add a colour bar to an object, using the bounding box for the object.

defColourBar :: (Renderable (Text n) b, Renderable (Path V2 n) b, TypeableFloat n) => ColourBar b n #

The default colour bar.

data ColourBar b n #

Options for drawing a colour bar. Note that for an axis, the - ColourMap is stored in the AxisStyle. These options are for - other aspects of the bar, not the colours used.

Instances
Functor f => HasMajorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorTicks :: LensLike' f (ColourBar b n) (MajorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

majorTicksFunction :: LensLike' f (ColourBar b n) ((N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

majorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

majorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

majorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasTickLabels f (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

tickLabel :: LensLike' f (ColourBar b n) (TickLabels b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelTextFunction :: LensLike' f (ColourBar b n) (TextFunction b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [(N (ColourBar b n), String)]) #

tickLabelStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelGap :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

HasVisibility (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

visible :: Lens' (ColourBar b n) Bool #

hidden :: Lens' (ColourBar b n) Bool #

HasOrientation (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

orientation :: Lens' (ColourBar b n) Orientation #

HasGap (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

gap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

HasPlacement (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

placement :: Lens' (ColourBar b n) Placement #

placementAt :: Lens' (ColourBar b n) (V2 Rational) #

placementAnchor :: Lens' (ColourBar b n) (V2 Rational) #

gapDirection :: Lens' (ColourBar b n) (Direction V2 Rational) #

Typeable n => HasStyle (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

applyStyle :: Style (V (ColourBar b n)) (N (ColourBar b n)) -> ColourBar b n -> ColourBar b n

HasColourBar (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

colourBar :: Lens' (ColourBar b n) (ColourBar b (N (ColourBar b n))) #

colourBarDraw :: Lens' (ColourBar b n) (ColourMap -> QDiagram b V2 (N (ColourBar b n)) Any) #

colourBarWidth :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarLengthFunction :: Lens' (ColourBar b n) (N (ColourBar b n) -> N (ColourBar b n)) #

colourBarGap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarStyle :: Lens' (ColourBar b n) (Style V2 (N (ColourBar b n))) #

type N (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

type N (ColourBar b n) = n
type V (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

type V (ColourBar b n) = V2

class HasColourBar a b | a -> b where #

Minimal complete definition

colourBar

Methods

colourBar :: Lens' a (ColourBar b (N a)) #

Lens onto the ColourBar.

colourBarDraw :: Lens' a (ColourMap -> QDiagram b V2 (N a) Any) #

How to draw the colour bar. Expects a 1 by 1 box with the - gradient going from left to right, without an outline with origin - in the middle of the left side. See gradientColourBar and - pathColourBar.

The colour map this function recieves it given by - axisColourMap from Plots.Style

Default is gradientColourBar.

colourBarWidth :: Lens' a (N a) #

The width (orthogonal to the colour bar direction) of the colour - bar.

Default is 20.

colourBarLengthFunction :: Lens' a (N a -> N a) #

Set the length of the colour bar given the length of the axis the - colour bar is aligned to.

Default is id.

colourBarGap :: Lens' a (N a) #

Gap between the axis and the colour bar (if rendered with an axis).

Default is 20.

colourBarStyle :: Lens' a (Style V2 (N a)) #

Style used for the outline of a colour bar.

Instances
HasColourBar (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

colourBar :: Lens' (ColourBar b n) (ColourBar b (N (ColourBar b n))) #

colourBarDraw :: Lens' (ColourBar b n) (ColourMap -> QDiagram b V2 (N (ColourBar b n)) Any) #

colourBarWidth :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarLengthFunction :: Lens' (ColourBar b n) (N (ColourBar b n) -> N (ColourBar b n)) #

colourBarGap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarStyle :: Lens' (ColourBar b n) (Style V2 (N (ColourBar b n))) #

HasColourBar (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

colourBar :: Lens' (Axis b v n) (ColourBar b (N (Axis b v n))) #

colourBarDraw :: Lens' (Axis b v n) (ColourMap -> QDiagram b V2 (N (Axis b v n)) Any) #

colourBarWidth :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarLengthFunction :: Lens' (Axis b v n) (N (Axis b v n) -> N (Axis b v n)) #

colourBarGap :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarStyle :: Lens' (Axis b v n) (Style V2 (N (Axis b v n))) #

majorTicksHelper #

Arguments

:: (RealFrac n, Floating n) 
=> [n]

Allowed numbers (up to powers of 10)

-> n

desired number of ticks

-> (n, n)

bounds

-> [n]

tick positions

Choose ticks whose step size is a multiple of 10 of the allowed - numbers and tries to match the number of desired ticks.

Note that the resulting tick positions may go out of the range of - the bounds. This is so the minor ticks can be chosen correctly if a - tick doesn't end exactly on a bound. When we render, we ignore all - ticks outside the bounds.

minorTicksHelper #

Arguments

:: Fractional n 
=> Int

Number of minor ticks between each major tick

-> [n]

Positions of major ticks

-> (n, n)

Bounds

-> [n]

Minor tick positions

Place n linear spaced ticks between each major tick.

logMajorTicks :: (RealFrac n, Floating n) => n -> (n, n) -> [n] #

Place n ticks at powers of 10 on the axis.

linearMajorTicks :: (RealFrac n, Floating n) => n -> (n, n) -> [n] #

Ticks whose value ends in 1, 0.5, 0.25, 0.2 (*10^n).

minorTickPositions :: (HasMinorTicks f a, Settable f) => LensLike' f a [N a] #

Setter over the final positions the major ticks. This is not as - general as minorTicksFunction because you don't have access to - the bounds but it can be useful when you know exactly what ticks - you want to add or modify existing tick positions.

majorTickPositions :: (HasMajorTicks f a, Settable f) => LensLike' f a [N a] #

Setter over the final positions the major ticks. This is not as - general as majorTicksFunction because you don't have access to - the bounds but it can be useful when you know exactly what ticks - you want to add or modify existing tick positions.

hideTicks :: HasTicks Identity a => a -> a #

Hides the Minor ticks when trying to render something. This can - be used on multiple types:

hideTicks :: Axis b c n       -> Axis b c n
-hideTicks :: SingleAxis b v n -> SingleAxis b v n
-hideTicks :: Ticks v n        -> Ticks v n
-hideTicks :: MinorTicks v n   -> MinorTicks v n
-

ticksVisible :: (HasTicks f a, Applicative f) => LensLike' f a Bool #

Traversal over the visibility of both major and minor ticks.

ticksStyle :: (HasTicks f a, Applicative f) => LensLike' f a (Style (V a) (N a)) #

Traversal over both major and minor tick styles.

ticksAlign :: (HasTicks f a, Applicative f) => LensLike' f a TicksAlignment #

Traversal over both major and minor tick alignment.

outsideTicks :: TicksAlignment #

Align the ticks to be outside a box axis.

insideTicks :: TicksAlignment #

Align the ticks to be inside a box axis.

centerTicks :: TicksAlignment #

Synonym for centreTicks.

centreTicks :: TicksAlignment #

Set the tick to be in the centre of the axis with total length of - the corresponding tick length.

autoTicks :: TicksAlignment #

Set the tick type depending on the axis line position. centreTick - for middleAxis, insideTick for everything else.

data TicksAlignment #

Set the portion of the tick above and below the axis.

Constructors

TickSpec !Rational !Rational 
AutoTick 
Instances
Eq TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

(==) :: TicksAlignment -> TicksAlignment -> Bool #

(/=) :: TicksAlignment -> TicksAlignment -> Bool #

Show TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

showsPrec :: Int -> TicksAlignment -> ShowS #

show :: TicksAlignment -> String #

showList :: [TicksAlignment] -> ShowS #

data MajorTicks (v :: * -> *) n #

The big ticks on the axis line.

Instances
HasMajorTicks f (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (MajorTicks v n) (MajorTicks (V (MajorTicks v n)) (N (MajorTicks v n))) #

majorTicksFunction :: LensLike' f (MajorTicks v n) ((N (MajorTicks v n), N (MajorTicks v n)) -> [N (MajorTicks v n)]) #

majorTicksAlignment :: LensLike' f (MajorTicks v n) TicksAlignment #

majorTicksLength :: LensLike' f (MajorTicks v n) (N (MajorTicks v n)) #

majorTicksStyle :: LensLike' f (MajorTicks v n) (Style (V (MajorTicks v n)) (N (MajorTicks v n))) #

TypeableFloat n => Default (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MajorTicks v n #

HasVisibility (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MajorTicks v n) Bool #

hidden :: Lens' (MajorTicks v n) Bool #

type N (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (MajorTicks v n) = n
type V (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (MajorTicks v n) = v

class HasMajorTicks (f :: * -> *) a where #

Class of things that have a MajorTicks.

Minimal complete definition

majorTicks

Methods

majorTicks :: LensLike' f a (MajorTicks (V a) (N a)) #

Lens onto the MajorTicks of something.

majorTicksFunction :: LensLike' f a ((N a, N a) -> [N a]) #

The function used to place ticks for this axis, given the bounds - of the axis. The result of these major ticks are also used as - guides for MinorTicks, MajorGridLines and MinorGridLines.

Default is linearMinorTicks 5.

majorTicksAlignment :: LensLike' f a TicksAlignment #

Alignment of the major ticks. Choose between autoTicks - (default), centreTicks, insideTicks or outsideTicks.

majorTicksLength :: LensLike' f a (N a) #

The total length the major ticks.

Default is 7.

majorTicksStyle :: LensLike' f a (Style (V a) (N a)) #

The style used to render the major ticks.

Default is lwO 0.6 mempty (subject to change).

Instances
Functor f => HasMajorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (Ticks v n) (MajorTicks (V (Ticks v n)) (N (Ticks v n))) #

majorTicksFunction :: LensLike' f (Ticks v n) ((N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

majorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

majorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

majorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

HasMajorTicks f (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (MajorTicks v n) (MajorTicks (V (MajorTicks v n)) (N (MajorTicks v n))) #

majorTicksFunction :: LensLike' f (MajorTicks v n) ((N (MajorTicks v n), N (MajorTicks v n)) -> [N (MajorTicks v n)]) #

majorTicksAlignment :: LensLike' f (MajorTicks v n) TicksAlignment #

majorTicksLength :: LensLike' f (MajorTicks v n) (N (MajorTicks v n)) #

majorTicksStyle :: LensLike' f (MajorTicks v n) (Style (V (MajorTicks v n)) (N (MajorTicks v n))) #

Functor f => HasMajorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorTicks :: LensLike' f (ColourBar b n) (MajorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

majorTicksFunction :: LensLike' f (ColourBar b n) ((N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

majorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

majorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

majorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMajorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (SingleAxis b v n) (MajorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorTicksFunction :: LensLike' f (SingleAxis b v n) ((N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

majorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

majorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

majorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMajorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (Axis b c n) (MajorTicks (V (Axis b c n)) (N (Axis b c n))) #

majorTicksFunction :: LensLike' f (Axis b c n) ((N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

majorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

majorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

majorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

data MinorTicks (v :: * -> *) n #

The small ticks on the axis line.

Instances
HasMinorTicks f (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (MinorTicks v n) (MinorTicks (V (MinorTicks v n)) (N (MinorTicks v n))) #

minorTicksFunction :: LensLike' f (MinorTicks v n) ([N (MinorTicks v n)] -> (N (MinorTicks v n), N (MinorTicks v n)) -> [N (MinorTicks v n)]) #

minorTicksAlignment :: LensLike' f (MinorTicks v n) TicksAlignment #

minorTicksLength :: LensLike' f (MinorTicks v n) (N (MinorTicks v n)) #

minorTicksStyle :: LensLike' f (MinorTicks v n) (Style (V (MinorTicks v n)) (N (MinorTicks v n))) #

TypeableFloat n => Default (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MinorTicks v n #

HasVisibility (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MinorTicks v n) Bool #

hidden :: Lens' (MinorTicks v n) Bool #

type N (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (MinorTicks v n) = n
type V (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (MinorTicks v n) = v

class HasMinorTicks (f :: * -> *) a where #

Class of things that have a single MinorTicks.

Minimal complete definition

minorTicks

Methods

minorTicks :: LensLike' f a (MinorTicks (V a) (N a)) #

Lens onto the MinorTicks of something.

minorTicksFunction :: LensLike' f a ([N a] -> (N a, N a) -> [N a]) #

The function used to place ticks for this axis, given the result - of majorTicksFunction and the bounds of the axis.

Default is linearMinorTicks 3.

minorTicksAlignment :: LensLike' f a TicksAlignment #

Alignment of the minor ticks. Choose between autoTicks - (default), centreTicks, insideTicks or outsideTicks.

minorTicksLength :: LensLike' f a (N a) #

The total length the minor ticks.

Default is 3.

minorTicksStyle :: LensLike' f a (Style (V a) (N a)) #

The style used to render the minor ticks.

Default is lwO 0.4 mempty (subject to change).

Instances
Functor f => HasMinorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (Ticks v n) (MinorTicks (V (Ticks v n)) (N (Ticks v n))) #

minorTicksFunction :: LensLike' f (Ticks v n) ([N (Ticks v n)] -> (N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

minorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

minorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

minorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

HasMinorTicks f (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (MinorTicks v n) (MinorTicks (V (MinorTicks v n)) (N (MinorTicks v n))) #

minorTicksFunction :: LensLike' f (MinorTicks v n) ([N (MinorTicks v n)] -> (N (MinorTicks v n), N (MinorTicks v n)) -> [N (MinorTicks v n)]) #

minorTicksAlignment :: LensLike' f (MinorTicks v n) TicksAlignment #

minorTicksLength :: LensLike' f (MinorTicks v n) (N (MinorTicks v n)) #

minorTicksStyle :: LensLike' f (MinorTicks v n) (Style (V (MinorTicks v n)) (N (MinorTicks v n))) #

Functor f => HasMinorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (SingleAxis b v n) (MinorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorTicksFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

minorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

minorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

minorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMinorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (Axis b c n) (MinorTicks (V (Axis b c n)) (N (Axis b c n))) #

minorTicksFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

minorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

minorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

minorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

data Ticks (v :: * -> *) n #

Both MajorTicks and MinorTicks together.

Instances
Functor f => HasMajorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (Ticks v n) (MajorTicks (V (Ticks v n)) (N (Ticks v n))) #

majorTicksFunction :: LensLike' f (Ticks v n) ((N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

majorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

majorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

majorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasMinorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (Ticks v n) (MinorTicks (V (Ticks v n)) (N (Ticks v n))) #

minorTicksFunction :: LensLike' f (Ticks v n) ([N (Ticks v n)] -> (N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

minorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

minorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

minorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

bothTicks :: LensLike' f (Ticks v n) (Ticks (V (Ticks v n)) (N (Ticks v n))) #

TypeableFloat n => Default (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: Ticks v n #

Typeable n => HasStyle (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

applyStyle :: Style (V (Ticks v n)) (N (Ticks v n)) -> Ticks v n -> Ticks v n

type N (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (Ticks v n) = n
type V (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (Ticks v n) = v

class (HasMinorTicks f a, HasMajorTicks f a) => HasTicks (f :: * -> *) a where #

Class of things with both MajorTicks and MinorTicks.

Minimal complete definition

bothTicks

Methods

bothTicks :: LensLike' f a (Ticks (V a) (N a)) #

Instances
Functor f => HasTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

bothTicks :: LensLike' f (Ticks v n) (Ticks (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (SingleAxis b v n) (Ticks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (Axis b c n) (Ticks (V (Axis b c n)) (N (Axis b c n))) #

gridLinesStyle :: (HasGridLines f a, Applicative f) => LensLike' f a (Style (V a) (N a)) #

Traversal over both the major and minor grid styles. This can be used at seversal levels in the Axis:

showGridLines :: (HasGridLines Identity a, MonadState a m) => m () #

Show both major and minor grid lines.

showGridLines :: Axis b c n       -> Axis b c n
-showGridLines :: SingleAxis b c n -> SingleAxis b c n
-showGridLines :: GridLines b c n  -> GirdLines b c n
-

hideGridLines :: (HasGridLines Identity a, MonadState a m) => m () #

Hide both major and minor grid lines.

hideGridLines :: Axis b c n       -> Axis b c n
-hideGridLines :: SingleAxis b c n -> SingleAxis b c n
-hideGridLines :: GridLines b c n  -> GirdLines b c n
-

gridLinesVisible :: (HasGridLines f a, Applicative f) => LensLike' f a Bool #

Traversal over both the major and minor grid styles.

gridLinesVisible :: Traversal' (Axis b c n) Bool
-gridLinesVisible :: Traversal' (SingleAxis b v n) Bool
-gridLinesVisible :: Traversal' (GridLines v n) Bool
-

emptyGridLineFunction :: GridLineFunction n #

The GridLineFunction such that no grid lines appear.

See hideGridLines, majorGridLineVisible or - minorGridLineVisible if you just want to hide the grid lines.

onTicksGridLineFunction :: GridLineFunction n #

Place grid lines at the same position as the respective ticks. This - is the Default.

type GridLineFunction n = [n] -> (n, n) -> [n] #

A grid line function takes the positions of the respective ticks - (minor ticks for minor grid lines, major ticks for major grid - lines) and the bounds of the axis and returns the positions of the - grid lines.

These functions are used in conjuction with majorGridLineFunction - and minorGridLineFunction to control how the lines are drawn.

data MajorGridLines (v :: * -> *) n #

Instances
HasMajorGridLines f (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (MajorGridLines v n) (MajorGridLines (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

majorGridLinesFunction :: LensLike' f (MajorGridLines v n) (GridLineFunction (N (MajorGridLines v n))) #

majorGridLinesStyle :: LensLike' f (MajorGridLines v n) (Style (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

(Typeable n, Floating n) => Default (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MajorGridLines v n #

HasVisibility (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MajorGridLines v n) Bool #

hidden :: Lens' (MajorGridLines v n) Bool #

Typeable n => HasStyle (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (MajorGridLines v n)) (N (MajorGridLines v n)) -> MajorGridLines v n -> MajorGridLines v n

type N (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (MajorGridLines v n) = n
type V (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (MajorGridLines v n) = v

class HasMajorGridLines (f :: * -> *) a where #

Minimal complete definition

majorGridLines

Methods

majorGridLines :: LensLike' f a (MajorGridLines (V a) (N a)) #

The options for how to draw the grid lines. This can be used on - various levels of the axis:

majorGridLines :: Traversal' (Axis b c n)       (GridLines (BaseSpace c) n)
-majorGridLines :: Lens'      (SingleAxis b v n) (GridLines v n)
-majorGridLines :: Lens'      (GridLines v n)    (GridLines v n)
-

majorGridLinesFunction :: LensLike' f a (GridLineFunction (N a)) #

The function to calculate location of the major grid lines given - location of the major ticks and bounds.

majorGridLinesStyle :: LensLike' f a (Style (V a) (N a)) #

The style applied to the major grid lines.

Instances
HasMajorGridLines f (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (MajorGridLines v n) (MajorGridLines (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

majorGridLinesFunction :: LensLike' f (MajorGridLines v n) (GridLineFunction (N (MajorGridLines v n))) #

majorGridLinesStyle :: LensLike' f (MajorGridLines v n) (Style (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

Functor f => HasMajorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (GridLines v n) (MajorGridLines (V (GridLines v n)) (N (GridLines v n))) #

majorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

majorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMajorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (SingleAxis b v n) (MajorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

majorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMajorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (Axis b c n) (MajorGridLines (V (Axis b c n)) (N (Axis b c n))) #

majorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

majorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

data MinorGridLines (v :: * -> *) n #

Instances
HasMinorGridLines f (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (MinorGridLines v n) (MinorGridLines (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

minorGridLinesFunction :: LensLike' f (MinorGridLines v n) (GridLineFunction (N (MinorGridLines v n))) #

minorGridLinesStyle :: LensLike' f (MinorGridLines v n) (Style (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

(Typeable n, Floating n) => Default (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MinorGridLines v n #

HasVisibility (MinorGridLines v n)

Hidden by default.

Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MinorGridLines v n) Bool #

hidden :: Lens' (MinorGridLines v n) Bool #

Typeable n => HasStyle (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (MinorGridLines v n)) (N (MinorGridLines v n)) -> MinorGridLines v n -> MinorGridLines v n

type N (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (MinorGridLines v n) = n
type V (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (MinorGridLines v n) = v

class HasMinorGridLines (f :: * -> *) a where #

Minimal complete definition

minorGridLines

Methods

minorGridLines :: LensLike' f a (MinorGridLines (V a) (N a)) #

The options for how to draw the grid lines. This can be used on - various levels of the axis:

minorGridLines :: Traversal' (Axis b c n)       (GridLines (BaseSpace c) n)
-minorGridLines :: Lens'      (SingleAxis b v n) (GridLines v n)
-minorGridLines :: Lens'      (GridLines v n)    (GridLines v n)
-

minorGridLinesFunction :: LensLike' f a (GridLineFunction (N a)) #

The function to calculate location of the minor grid lines given - location of the minor ticks and bounds.

minorGridLinesStyle :: LensLike' f a (Style (V a) (N a)) #

The style applied to the minor grid lines.

Instances
HasMinorGridLines f (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (MinorGridLines v n) (MinorGridLines (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

minorGridLinesFunction :: LensLike' f (MinorGridLines v n) (GridLineFunction (N (MinorGridLines v n))) #

minorGridLinesStyle :: LensLike' f (MinorGridLines v n) (Style (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

Functor f => HasMinorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (GridLines v n) (MinorGridLines (V (GridLines v n)) (N (GridLines v n))) #

minorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

minorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMinorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (SingleAxis b v n) (MinorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

minorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMinorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (Axis b c n) (MinorGridLines (V (Axis b c n)) (N (Axis b c n))) #

minorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

minorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

data GridLines (v :: * -> *) n #

Type holding infomation about both major and minor grid lines.

Instances
Functor f => HasMajorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (GridLines v n) (MajorGridLines (V (GridLines v n)) (N (GridLines v n))) #

majorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

majorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMinorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (GridLines v n) (MinorGridLines (V (GridLines v n)) (N (GridLines v n))) #

minorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

minorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

gridLines :: LensLike' f (GridLines v n) (GridLines (V (GridLines v n)) (N (GridLines v n))) #

(Typeable n, Floating n) => Default (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: GridLines v n #

Typeable n => HasStyle (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (GridLines v n)) (N (GridLines v n)) -> GridLines v n -> GridLines v n

type N (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (GridLines v n) = n
type V (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (GridLines v n) = v

class (HasMinorGridLines f a, HasMajorGridLines f a) => HasGridLines (f :: * -> *) a where #

Minimal complete definition

gridLines

Methods

gridLines :: LensLike' f a (GridLines (V a) (N a)) #

Instances
Functor f => HasGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

gridLines :: LensLike' f (GridLines v n) (GridLines (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (SingleAxis b v n) (GridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (Axis b c n) (GridLines (V (Axis b c n)) (N (Axis b c n))) #

atMajorTicks :: (n -> String) -> [n] -> (n, n) -> [(n, String)] #

Make a TickLabelFunction by specifying how to draw a single label - from a position on the axis.

tickLabelPositions :: (HasTickLabels f a b, Settable f) => LensLike' f a [(N a, String)] #

Setter over the final positions the major ticks. This is not as - general as minorTicksFunction because you don't have access to - the bounds but it can be useful when you know exactly what ticks - you want to add or modify existing tick positions.

type TextFunction b (v :: * -> *) n = TextAlignment n -> String -> QDiagram b v n Any #

Function to render the axis label from a string. This is very basic - now and will be replace by a more sophisticated system.

data AxisLabelPosition #

The position of the AxisLabel along the axis.

Constructors

MiddleAxisLabel 
LowerAxisLabel 
UpperAxisLabel 

data AxisLabelPlacement #

Whether the AxisLabel should be inside or ouside the axis.

Constructors

InsideAxisLabel 
OutsideAxisLabel 

data AxisLabel b (v :: * -> *) n #

Instances
HasAxisLabel f (AxisLabel b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

axisLabel :: LensLike' f (AxisLabel b v n) (AxisLabel b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelText :: LensLike' f (AxisLabel b v n) String #

axisLabelTextFunction :: LensLike' f (AxisLabel b v n) (TextFunction b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelGap :: LensLike' f (AxisLabel b v n) (N (AxisLabel b v n)) #

axisLabelStyle :: LensLike' f (AxisLabel b v n) (Style (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelPosition :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

(TypeableFloat n, Renderable (Text n) b) => Default (AxisLabel b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: AxisLabel b V2 n #

HasVisibility (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (AxisLabel b v n) Bool #

hidden :: Lens' (AxisLabel b v n) Bool #

HasGap (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (AxisLabel b v n) (N (AxisLabel b v n)) #

Typeable n => HasStyle (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

applyStyle :: Style (V (AxisLabel b v n)) (N (AxisLabel b v n)) -> AxisLabel b v n -> AxisLabel b v n

type N (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

type N (AxisLabel b v n) = n
type V (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

type V (AxisLabel b v n) = v

class HasAxisLabel (f :: * -> *) a b | a -> b where #

Minimal complete definition

axisLabel

Methods

axisLabel :: LensLike' f a (AxisLabel b (V a) (N a)) #

The options for the label of the axis. This can be used on - various levels of the axis:

axisLabel :: Traversal' (Axis b c n)       (AxisLabel (BaseSpace c) n)
-axisLabel :: Lens'      (SingleAxis b v n) (AxisLabel v n)
-axisLabel :: Lens'      (AxisLabel v n)    (AxisLabel v n)
-

axisLabelText :: LensLike' f a String #

The text to use when labeling the axis.

axisLabelTextFunction :: LensLike' f a (TextFunction b (V a) (N a)) #

The TextFunction to render the text of the axis label.

axisLabelGap :: LensLike' f a (N a) #

The gap between the axis and the labels, in the direction - corresponding to the axisLabelPosition.

axisLabelStyle :: LensLike' f a (Style (V a) (N a)) #

The Style to use on the rendered text.

axisLabelPosition :: LensLike' f a AxisLabelPosition #

The position the label will be placed parallel the axis.

axisLabelPlacement :: LensLike' f a AxisLabelPosition #

Whether the axis label should be placed inside or outside the - axis.

Instances
HasAxisLabel f (AxisLabel b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

axisLabel :: LensLike' f (AxisLabel b v n) (AxisLabel b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelText :: LensLike' f (AxisLabel b v n) String #

axisLabelTextFunction :: LensLike' f (AxisLabel b v n) (TextFunction b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelGap :: LensLike' f (AxisLabel b v n) (N (AxisLabel b v n)) #

axisLabelStyle :: LensLike' f (AxisLabel b v n) (Style (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelPosition :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

Functor f => HasAxisLabel f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (SingleAxis b v n) (AxisLabel b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelText :: LensLike' f (SingleAxis b v n) String #

axisLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

axisLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelPosition :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

(Applicative f, Traversable c) => HasAxisLabel f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (Axis b c n) (AxisLabel b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelText :: LensLike' f (Axis b c n) String #

axisLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

axisLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

axisLabelPosition :: LensLike' f (Axis b c n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (Axis b c n) AxisLabelPosition #

data TickLabels b (v :: * -> *) n #

Instances
HasTickLabels f (TickLabels b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

tickLabel :: LensLike' f (TickLabels b v n) (TickLabels b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelTextFunction :: LensLike' f (TickLabels b v n) (TextFunction b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelFunction :: LensLike' f (TickLabels b v n) ([N (TickLabels b v n)] -> (N (TickLabels b v n), N (TickLabels b v n)) -> [(N (TickLabels b v n), String)]) #

tickLabelStyle :: LensLike' f (TickLabels b v n) (Style (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelGap :: LensLike' f (TickLabels b v n) (N (TickLabels b v n)) #

(TypeableFloat n, Renderable (Text n) b) => Default (TickLabels b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: TickLabels b V2 n #

HasVisibility (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (TickLabels b v n) Bool #

hidden :: Lens' (TickLabels b v n) Bool #

HasGap (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (TickLabels b v n) (N (TickLabels b v n)) #

type N (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

type N (TickLabels b v n) = n
type V (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

type V (TickLabels b v n) = v

class HasTickLabels (f :: * -> *) a b | a -> b where #

Minimal complete definition

tickLabel

Methods

tickLabel :: LensLike' f a (TickLabels b (V a) (N a)) #

The options for the label of ticks. This can be used on various - levels of the axis:

tickLabel :: Traversal' (Tick b c n)       (TickLabels (BaseSpace c) n)
-tickLabel :: Lens'      (SingleAxis b v n) (TickLabels v n)
-tickLabel :: Lens'      (TickLabel v n)    (TickLabels v n)
-

tickLabelTextFunction :: LensLike' f a (TextFunction b (V a) (N a)) #

The TextFunction to render the text.

Default is mkText.

tickLabelFunction :: LensLike' f a ([N a] -> (N a, N a) -> [(N a, String)]) #

Tick labels functions are used to draw the tick labels. They has - access to the major ticks and the current bounds. Returns the - position of the tick and label to use at that position.

Default is atMajorTicks floatShow

tickLabelStyle :: LensLike' f a (Style (V a) (N a)) #

The Style to use on the rendered text.

Default is fontSize (output 11).

tickLabelGap :: LensLike' f a (N a) #

The gap between the axis and the tick labels.

Default is 12.

Instances
Functor f => HasTickLabels f (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

tickLabel :: LensLike' f (ColourBar b n) (TickLabels b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelTextFunction :: LensLike' f (ColourBar b n) (TextFunction b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [(N (ColourBar b n), String)]) #

tickLabelStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelGap :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

HasTickLabels f (TickLabels b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

tickLabel :: LensLike' f (TickLabels b v n) (TickLabels b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelTextFunction :: LensLike' f (TickLabels b v n) (TextFunction b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelFunction :: LensLike' f (TickLabels b v n) ([N (TickLabels b v n)] -> (N (TickLabels b v n), N (TickLabels b v n)) -> [(N (TickLabels b v n), String)]) #

tickLabelStyle :: LensLike' f (TickLabels b v n) (Style (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelGap :: LensLike' f (TickLabels b v n) (N (TickLabels b v n)) #

Functor f => HasTickLabels f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (SingleAxis b v n) (TickLabels b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [(N (SingleAxis b v n), String)]) #

tickLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

(Applicative f, Traversable c) => HasTickLabels f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (Axis b c n) (TickLabels b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [(N (Axis b c n), String)]) #

tickLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

tickLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

drawTitle :: TypeableFloat n => BoundingBox V2 n -> Title b V2 n -> QDiagram b V2 n Any #

Render the title and place it around the bounding box.

data Title b (v :: * -> *) n #

Instances
(Renderable (Text n) b, TypeableFloat n) => Default (Title b V2 n) 
Instance details

Defined in Plots.Axis.Title

Methods

def :: Title b V2 n #

HasVisibility (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

visible :: Lens' (Title b v n) Bool #

hidden :: Lens' (Title b v n) Bool #

HasGap (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

gap :: Lens' (Title b v n) (N (Title b v n)) #

HasPlacement (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

placement :: Lens' (Title b v n) Placement #

placementAt :: Lens' (Title b v n) (V2 Rational) #

placementAnchor :: Lens' (Title b v n) (V2 Rational) #

gapDirection :: Lens' (Title b v n) (Direction V2 Rational) #

HasTitle (Title b v n) b 
Instance details

Defined in Plots.Axis.Title

Methods

title :: Lens' (Title b v n) (Title b (V (Title b v n)) (N (Title b v n))) #

titleText :: Lens' (Title b v n) String #

titleStyle :: Lens' (Title b v n) (Style (V (Title b v n)) (N (Title b v n))) #

titlePlacement :: Lens' (Title b v n) Placement #

titleGap :: Lens' (Title b v n) (N (Title b v n)) #

type N (Title b v n) 
Instance details

Defined in Plots.Axis.Title

type N (Title b v n) = n
type V (Title b v n) 
Instance details

Defined in Plots.Axis.Title

type V (Title b v n) = v

class HasTitle a b | a -> b where #

Minimal complete definition

title

Methods

title :: Lens' a (Title b (V a) (N a)) #

titleText :: Lens' a String #

The text used for the title. If the string is empty, no title is - drawn.

Default is ""

titleStyle :: Lens' a (Style (V a) (N a)) #

The style applied to the title.

Default is mempty.

titlePlacement :: Lens' a Placement #

The placement of the title against the axis.

Default is mempty.

titleGap :: Lens' a (N a) #

The gap between the axis and the title.

Default is mempty.

Instances
HasTitle (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

title :: Lens' (Axis b c n) (Title b (V (Axis b c n)) (N (Axis b c n))) #

titleText :: Lens' (Axis b c n) String #

titleStyle :: Lens' (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

titlePlacement :: Lens' (Axis b c n) Placement #

titleGap :: Lens' (Axis b c n) (N (Axis b c n)) #

HasTitle (Title b v n) b 
Instance details

Defined in Plots.Axis.Title

Methods

title :: Lens' (Title b v n) (Title b (V (Title b v n)) (N (Title b v n))) #

titleText :: Lens' (Title b v n) String #

titleStyle :: Lens' (Title b v n) (Style (V (Title b v n)) (N (Title b v n))) #

titlePlacement :: Lens' (Title b v n) Placement #

titleGap :: Lens' (Title b v n) (N (Title b v n)) #

drawLegend #

Arguments

:: (TypeableFloat n, Renderable (Path V2 n) b) 
=> BoundingBox V2 n

bounding box to place legend against

-> [(QDiagram b V2 n Any, String)]

diagram pictures along with their key

-> Legend b n

options for drawing the legend

-> QDiagram b V2 n Any

rendered legend

Draw a legend to the bounding box using the legend entries and - legend options.

class HasLegend a b | a -> b where #

Minimal complete definition

legend

Methods

legend :: Lens' a (Legend b (N a)) #

Lens onto the Legend of something.

legendPlacement :: Lens' a Placement #

The Placement of the legend relative to the Axis.

legendGap :: Lens' a (N a) #

The gap between the legend and the axis.

legendStyle :: Lens' a (Style V2 (N a)) #

The style applied to the surronding box of the legend.

legendSpacing :: Lens' a (N a) #

The spacing between entries in the legend.

legendTextWidth :: Lens' a (N a) #

The space given for the text in the legend.

legendTextFunction :: Lens' a (String -> QDiagram b V2 (N a) Any) #

The function to generate the legend text.

legendTextStyle :: Lens' a (Style V2 (N a)) #

The style applied to the legend text.

legendOrientation :: Lens' a Orientation #

The way the legend entries are listed. (This will likely be - replaced by a grid-like system)

Instances
HasLegend (Legend b n) b 
Instance details

Defined in Plots.Legend

Methods

legend :: Lens' (Legend b n) (Legend b (N (Legend b n))) #

legendPlacement :: Lens' (Legend b n) Placement #

legendGap :: Lens' (Legend b n) (N (Legend b n)) #

legendStyle :: Lens' (Legend b n) (Style V2 (N (Legend b n))) #

legendSpacing :: Lens' (Legend b n) (N (Legend b n)) #

legendTextWidth :: Lens' (Legend b n) (N (Legend b n)) #

legendTextFunction :: Lens' (Legend b n) (String -> QDiagram b V2 (N (Legend b n)) Any) #

legendTextStyle :: Lens' (Legend b n) (Style V2 (N (Legend b n))) #

legendOrientation :: Lens' (Legend b n) Orientation #

HasLegend (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

legend :: Lens' (Axis b c n) (Legend b (N (Axis b c n))) #

legendPlacement :: Lens' (Axis b c n) Placement #

legendGap :: Lens' (Axis b c n) (N (Axis b c n)) #

legendStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendSpacing :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextWidth :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextFunction :: Lens' (Axis b c n) (String -> QDiagram b V2 (N (Axis b c n)) Any) #

legendTextStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendOrientation :: Lens' (Axis b c n) Orientation #

styledPlotLegends #

Arguments

:: Ord n 
=> [StyledPlot b v n] 
-> [(QDiagram b v n Any, String)]
[(legend pic, legend text)]

Render a list of legend entries, in order.

singleStyledPlotLegend #

Arguments

:: StyledPlot b v n 
-> [(n, QDiagram b v n Any, String)]
(z-order, legend pic, legend text)

Get the legend rendered entries from a single styled plot. The - resulting entries are in no particular order. See also - styledPlotLegends.

renderStyledPlot :: TypeableFloat n => AxisSpec V2 n -> StyledPlot b V2 n -> QDiagram b V2 n Any #

Render a StyledPlot given an and AxisSpec.

styleDynamic :: PlotStyle b v n -> DynamicPlot b v n -> StyledPlot b v n #

Give a DynamicPlot a concrete PlotStyle.

styledPlot :: Typeable p => Traversal' (StyledPlot b (V p) (N p)) p #

Traversal over a raw plot of a styled plot. The type of the plot - must match for the traversal to be succesful.

dynamicPlotMods :: Functor f => (PlotMods b v n -> f (PlotMods b v n)) -> DynamicPlot b v n -> f (DynamicPlot b v n) #

The modifications to the PlotOptions and PlotStyle in a DynamicPlot.

dynamicPlot :: (Typeable p, Typeable b) => Traversal' (DynamicPlot b (V p) (N p)) (Plot p b) #

Traversal over the dynamic plot without the Plotable constraint - _DynamicPlot has.

_DynamicPlot :: (Plotable p b, Typeable b) => Prism' (DynamicPlot b (V p) (N p)) (Plot p b) #

Prism for a DynamicPlot.

plotMods :: Functor f => (PlotMods b (V p) (N p) -> f (PlotMods b (V p) (N p))) -> Plot p b -> f (Plot p b) #

The modifications to the PlotOptions and PlotStyle in a Plot.

rawPlot :: SameSpace p p' => Lens (Plot p b) (Plot p' b) p p' #

Lens onto the raw Plotable inside a Plot.

mkPlot :: (Additive (V p), Num (N p)) => p -> Plot p b #

Make a Plot with Default PlotOptions.

display :: (MonadState s m, HasVisibility a) => ASetter' s a -> m () #

Set visible to True for the given setter.

display minorGridLines :: State (Axis b v n) ()
-display colourBar      :: State (Axis b v n) ()
-

hide :: (MonadState s m, HasVisibility a) => ASetter' s a -> m () #

Set visible to False for the given setter.

hide minorTicks          :: State (Axis b v n) ()
-hide (xAxis . gridLines) :: State (Axis b v n) ()
-

specPoint :: (Applicative v, Additive v, Floating n) => AxisSpec v n -> Point v n -> Point v n #

Apply log scaling and the transform to a point.

scaleNum :: Floating n => (n, n) -> LogScale -> n -> n #

Scale a number by log10-ing it and linearly scaling it so it's - within the same range.

specTrans :: Functor f => (Transformation v n -> f (Transformation v n)) -> AxisSpec v n -> f (AxisSpec v n) #

specScale :: Functor f => (v LogScale -> f (v LogScale)) -> AxisSpec v n -> f (AxisSpec v n) #

specColourMap :: Functor f => (ColourMap -> f ColourMap) -> AxisSpec v n -> f (AxisSpec v n) #

specBounds :: Functor f => (v (n, n) -> f (v (n, n))) -> AxisSpec v n -> f (AxisSpec v n) #

class (Typeable p, Enveloped p) => Plotable p b where #

Class defining how plots should be rendered.

Minimal complete definition

renderPlotable

Methods

renderPlotable :: InSpace v n p => AxisSpec v n -> PlotStyle b v n -> p -> QDiagram b v n Any #

Render a plot according to the AxisSpec, using the PlotStyle.

defLegendPic :: InSpace v n p => PlotStyle b v n -> p -> QDiagram b v n Any #

The default legend picture when the LegendPic is - DefaultLegendPic.

Instances
(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (BarPlot n) b 
Instance details

Defined in Plots.Types.Bar

Methods

renderPlotable :: InSpace v n0 (BarPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (BarPlot n) => PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HistogramPlot n) b 
Instance details

Defined in Plots.Types.Histogram

Methods

renderPlotable :: InSpace v n0 (HistogramPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HistogramPlot n) => PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Wedge n) b 
Instance details

Defined in Plots.Types.Pie

Methods

renderPlotable :: InSpace v n0 (Wedge n) => AxisSpec v n0 -> PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Wedge n) => PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Path V2 n) b 
Instance details

Defined in Plots.Types

Methods

renderPlotable :: InSpace v n0 (Path V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> Path V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Path V2 n) => PlotStyle b v n0 -> Path V2 n -> QDiagram b v n0 Any #

(Typeable b, TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

renderPlotable :: InSpace v n0 (HeatMap b n) => AxisSpec v n0 -> PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HeatMap b n) => PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (ScatterPlot V2 n) b 
Instance details

Defined in Plots.Types.Scatter

Methods

renderPlotable :: InSpace v n0 (ScatterPlot V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (ScatterPlot V2 n) => PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

(Typeable b, Typeable v, Metric v, Typeable n, OrderedField n) => Plotable (QDiagram b v n Any) b 
Instance details

Defined in Plots.Types

Methods

renderPlotable :: InSpace v0 n0 (QDiagram b v n Any) => AxisSpec v0 n0 -> PlotStyle b v0 n0 -> QDiagram b v n Any -> QDiagram b v0 n0 Any #

defLegendPic :: InSpace v0 n0 (QDiagram b v n Any) => PlotStyle b v0 n0 -> QDiagram b v n Any -> QDiagram b v0 n0 Any #

class HasVisibility a where #

Class of objects that can be hidden.

Minimal complete definition

visible

Methods

visible :: Lens' a Bool #

Lens onto whether an object should be visible when rendered.

hidden :: Lens' a Bool #

The opposite of visible.

Instances
HasVisibility (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

visible :: Lens' (ColourBar b n) Bool #

hidden :: Lens' (ColourBar b n) Bool #

HasVisibility (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MajorTicks v n) Bool #

hidden :: Lens' (MajorTicks v n) Bool #

HasVisibility (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MinorTicks v n) Bool #

hidden :: Lens' (MinorTicks v n) Bool #

HasVisibility (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MajorGridLines v n) Bool #

hidden :: Lens' (MajorGridLines v n) Bool #

HasVisibility (MinorGridLines v n)

Hidden by default.

Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MinorGridLines v n) Bool #

hidden :: Lens' (MinorGridLines v n) Bool #

HasVisibility (AxisLine v n) 
Instance details

Defined in Plots.Axis.Line

Methods

visible :: Lens' (AxisLine v n) Bool #

hidden :: Lens' (AxisLine v n) Bool #

HasVisibility (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

visible :: Lens' (Legend b n) Bool #

hidden :: Lens' (Legend b n) Bool #

HasVisibility (Plot p b) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (Plot p b) Bool #

hidden :: Lens' (Plot p b) Bool #

HasVisibility (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

visible :: Lens' (SingleAxis b v n) Bool #

hidden :: Lens' (SingleAxis b v n) Bool #

HasVisibility (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (AxisLabel b v n) Bool #

hidden :: Lens' (AxisLabel b v n) Bool #

HasVisibility (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (TickLabels b v n) Bool #

hidden :: Lens' (TickLabels b v n) Bool #

HasVisibility (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

visible :: Lens' (Title b v n) Bool #

hidden :: Lens' (Title b v n) Bool #

HasVisibility (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotMods b v n) Bool #

hidden :: Lens' (PlotMods b v n) Bool #

HasVisibility (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (DynamicPlot b v n) Bool #

hidden :: Lens' (DynamicPlot b v n) Bool #

HasVisibility (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (StyledPlot b v n) Bool #

hidden :: Lens' (StyledPlot b v n) Bool #

HasVisibility (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotOptions b v n) Bool #

hidden :: Lens' (PlotOptions b v n) Bool #

data PlotMods b (v :: * -> *) n #

A PlotOptions with modifications to a PlotStyle.

Instances
Functor f => HasPlotOptions f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotMods b v n) (PlotOptions b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotName :: LensLike' f (PlotMods b v n) Name #

clipPlot :: LensLike' f (PlotMods b v n) Bool #

legendEntries :: LensLike' f (PlotMods b v n) [LegendEntry b (V (PlotMods b v n)) (N (PlotMods b v n))] #

plotTransform :: LensLike' f (PlotMods b v n) (Transformation (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotVisible :: LensLike' f (PlotMods b v n) Bool #

Settable f => HasPlotStyle f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (PlotMods b v n) (PlotStyle b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotColour :: LensLike' f (PlotMods b v n) (Colour Double) #

plotColor :: LensLike' f (PlotMods b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

lineStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotMarker :: LensLike' f (PlotMods b v n) (QDiagram b (V (PlotMods b v n)) (N (PlotMods b v n)) Any) #

plotStyles :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotStyleFunctions :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

(Additive v, Num n) => Default (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotMods b v n #

HasVisibility (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotMods b v n) Bool #

hidden :: Lens' (PlotMods b v n) Bool #

type N (PlotMods b v n) 
Instance details

Defined in Plots.Types

type N (PlotMods b v n) = n
type V (PlotMods b v n) 
Instance details

Defined in Plots.Types

type V (PlotMods b v n) = v

data DynamicPlot b (v :: * -> *) n where #

A wrapped up Plot, used to store plots in an Axis.

Constructors

DynamicPlot :: DynamicPlot b v n 
Instances
(Applicative f, Typeable b, v ~ V2, Typeable n) => HasWedge f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (DynamicPlot b v n) (Wedge (N (DynamicPlot b v n))) #

wedgeOuterRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeInnerRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeOffset :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeWidth :: LensLike' f (DynamicPlot b v n) (Angle (N (DynamicPlot b v n))) #

wedgeDirection :: LensLike' f (DynamicPlot b v n) (Direction V2 (N (DynamicPlot b v n))) #

(Applicative f, Typeable b, Typeable v, Typeable n) => HasConnectingLine f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (DynamicPlot b v n) Bool #

(Applicative f, Typeable b, Typeable v, Typeable n, Typeable a) => HasScatterOptions f (DynamicPlot b v n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (DynamicPlot b v n) (ScatterOptions (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) a) #

scatterTransform :: LensLike' f (DynamicPlot b v n) (a -> Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterStyle :: LensLike' f (DynamicPlot b v n) (a -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterPosition :: LensLike' f (DynamicPlot b v n) (a -> Point (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

Functor f => HasPlotOptions f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (DynamicPlot b v n) (PlotOptions b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotName :: LensLike' f (DynamicPlot b v n) Name #

clipPlot :: LensLike' f (DynamicPlot b v n) Bool #

legendEntries :: LensLike' f (DynamicPlot b v n) [LegendEntry b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))] #

plotTransform :: LensLike' f (DynamicPlot b v n) (Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotVisible :: LensLike' f (DynamicPlot b v n) Bool #

Settable f => HasPlotStyle f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (DynamicPlot b v n) (PlotStyle b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotColour :: LensLike' f (DynamicPlot b v n) (Colour Double) #

plotColor :: LensLike' f (DynamicPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

lineStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotMarker :: LensLike' f (DynamicPlot b v n) (QDiagram b (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) Any) #

plotStyles :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotStyleFunctions :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

HasVisibility (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (DynamicPlot b v n) Bool #

hidden :: Lens' (DynamicPlot b v n) Bool #

type N (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

type N (DynamicPlot b v n) = n
type V (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

type V (DynamicPlot b v n) = v

data StyledPlot b (v :: * -> *) n #

A DynamicPlot with a concrete style. This is suitable for being - rendered with renderStyledPlot and get extract the legend entries - with styledPlotLegend.

You can make a StyledPlot with styleDynamic

Instances
(v ~ V2, Applicative f, Typeable n) => HasWedge f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (StyledPlot b v n) (Wedge (N (StyledPlot b v n))) #

wedgeOuterRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeInnerRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeOffset :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeWidth :: LensLike' f (StyledPlot b v n) (Angle (N (StyledPlot b v n))) #

wedgeDirection :: LensLike' f (StyledPlot b v n) (Direction V2 (N (StyledPlot b v n))) #

(Applicative f, Typeable v, Typeable n) => HasConnectingLine f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (StyledPlot b v n) Bool #

Functor f => HasPlotOptions f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (StyledPlot b v n) (PlotOptions b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotName :: LensLike' f (StyledPlot b v n) Name #

clipPlot :: LensLike' f (StyledPlot b v n) Bool #

legendEntries :: LensLike' f (StyledPlot b v n) [LegendEntry b (V (StyledPlot b v n)) (N (StyledPlot b v n))] #

plotTransform :: LensLike' f (StyledPlot b v n) (Transformation (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotVisible :: LensLike' f (StyledPlot b v n) Bool #

Functor f => HasPlotStyle f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (StyledPlot b v n) (PlotStyle b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotColour :: LensLike' f (StyledPlot b v n) (Colour Double) #

plotColor :: LensLike' f (StyledPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

lineStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotMarker :: LensLike' f (StyledPlot b v n) (QDiagram b (V (StyledPlot b v n)) (N (StyledPlot b v n)) Any) #

plotStyles :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotStyleFunctions :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

HasVisibility (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (StyledPlot b v n) Bool #

hidden :: Lens' (StyledPlot b v n) Bool #

(Metric v, OrderedField n) => Enveloped (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

getEnvelope :: StyledPlot b v n -> Envelope (V (StyledPlot b v n)) (N (StyledPlot b v n))

type N (StyledPlot b v n) 
Instance details

Defined in Plots.Types

type N (StyledPlot b v n) = n
type V (StyledPlot b v n) 
Instance details

Defined in Plots.Types

type V (StyledPlot b v n) = v

addLegendEntry :: (HasPlotOptions Identity a b, MonadState a m) => LegendEntry b (V a) (N a) -> m () #

Add a LegendEntry to something with PlotOptions. Here are some - typical examples:

addLegendEntry :: LegendEntry b v n -> State (Plot (ScatterPlot v n) b) ()
-addLegendEntry :: LegendEntry b v n -> State (DynamicPlot b v n) ()
-

If you only care about the name of the legend, use key.

key :: (HasPlotOptions Identity a b, MonadState a m, Num (N a)) => String -> m () #

Add a LegendEntry to something with PlotOptions using the - String as the legendText and a DefaultLegendPic. Here are - some typical examples:

key :: String -> State (Plot (ScatterPlot v n) b) ()
-key :: String -> State (DynamicPlot b v n) ()
-key :: String -> State (PlotMods b v n) ()
-

If you only care about the name of the legend, use key.

mkLegendEntry :: Num n => String -> LegendEntry b v n #

Make a legend entry with a default legendPicture and - legendPrecedence 0 using the string as the legendText.

legendPrecedence :: Functor f => (n -> f n) -> LegendEntry b v n -> f (LegendEntry b v n) #

The order in which the legend entries are rendered. If precedence - are equal, they entries are put in the order they are added to the - axis.

Default is 0.

legendText :: Functor f => (String -> f String) -> LegendEntry b v n -> f (LegendEntry b v n) #

The text used in the legend entry.

legendPicture :: Functor f => (LegendPic b v n -> f (LegendPic b v n)) -> LegendEntry b v n -> f (LegendEntry b v n) #

The picture used in the legend entry.

placeAgainst :: (InSpace V2 n a, SameSpace a b, Enveloped a, HasOrigin b, Alignable b) => a -> Placement -> n -> b -> b #

A tool for aligned one object to another. Positions b around the - bounding box of a by translating b.

rightBelow :: Placement #

rightBottom :: Placement #

rightMid :: Placement #

rightTop :: Placement #

rightAbove :: Placement #

midBelow :: Placement #

midAbove :: Placement #

leftBelow :: Placement #

leftBottom :: Placement #

leftMid :: Placement #

leftTop :: Placement #

leftAbove :: Placement #

bottomRight :: Placement #

bottom :: Placement #

bottomLeft :: Placement #

right :: Placement #

left :: Placement #

topRight :: Placement #

top :: Placement #

topLeft :: Placement #

vertical :: HasOrientation a => Lens' a Bool #

Lens onto whether an object's orientation is vertical.

horizontal :: HasOrientation a => Lens' a Bool #

Lens onto whether an object's orientation is horizontal.

orient :: HasOrientation o => o -> a -> a -> a #

Pick the first a if the object has Horizontal orientation and - the second a if the object has a Vertical orientation.

data Orientation #

Constructors

Horizontal 
Vertical 
Instances
Eq Orientation 
Instance details

Defined in Plots.Types

Methods

(==) :: Orientation -> Orientation -> Bool #

(/=) :: Orientation -> Orientation -> Bool #

Ord Orientation 
Instance details

Defined in Plots.Types

Methods

compare :: Orientation -> Orientation -> Ordering #

(<) :: Orientation -> Orientation -> Bool #

(<=) :: Orientation -> Orientation -> Bool #

(>) :: Orientation -> Orientation -> Bool #

(>=) :: Orientation -> Orientation -> Bool #

max :: Orientation -> Orientation -> Orientation #

min :: Orientation -> Orientation -> Orientation #

Show Orientation 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Orientation -> ShowS #

show :: Orientation -> String #

showList :: [Orientation] -> ShowS #

HasOrientation Orientation 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' Orientation Orientation #

class HasOrientation a where #

Class of things that have an orientation.

Minimal complete definition

orientation

Methods

orientation :: Lens' a Orientation #

Lens onto the orientation of an object.

Instances
HasOrientation Orientation 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' Orientation Orientation #

HasOrientation (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarLayout n) Orientation #

HasOrientation (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarPlot n) Orientation #

HasOrientation (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramPlot n) Orientation #

HasOrientation (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramOptions n) Orientation #

HasOrientation (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

orientation :: Lens' (ColourBar b n) Orientation #

HasOrientation (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

orientation :: Lens' (Legend b n) Orientation #

HasOrientation p => HasOrientation (Plot p b) 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' (Plot p b) Orientation #

HasOrientation (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (MultiBarState b n a) Orientation #

class HasGap a where #

Minimal complete definition

gap

Methods

gap :: Lens' a (N a) #

The value of the gap when rendering.

Instances
HasGap (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

gap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

HasGap (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

gap :: Lens' (Legend b n) (N (Legend b n)) #

HasGap (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (AxisLabel b v n) (N (AxisLabel b v n)) #

HasGap (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (TickLabels b v n) (N (TickLabels b v n)) #

HasGap (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

gap :: Lens' (Title b v n) (N (Title b v n)) #

data Placement #

A Position is a point on an axis together with an anchor and a - direction for the gap.

Constructors

Placement 

Fields

Instances
Eq Placement 
Instance details

Defined in Plots.Types

Methods

(==) :: Placement -> Placement -> Bool #

(/=) :: Placement -> Placement -> Bool #

Ord Placement 
Instance details

Defined in Plots.Types

Methods

compare :: Placement -> Placement -> Ordering #

(<) :: Placement -> Placement -> Bool #

(<=) :: Placement -> Placement -> Bool #

(>) :: Placement -> Placement -> Bool #

(>=) :: Placement -> Placement -> Bool #

max :: Placement -> Placement -> Placement #

min :: Placement -> Placement -> Placement #

Read Placement 
Instance details

Defined in Plots.Types

Methods

readsPrec :: Int -> ReadS Placement #

readList :: ReadS [Placement] #

readPrec :: ReadPrec Placement #

readListPrec :: ReadPrec [Placement] #

Show Placement 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Placement -> ShowS #

show :: Placement -> String #

showList :: [Placement] -> ShowS #

HasPlacement Placement 
Instance details

Defined in Plots.Types

Methods

placement :: Lens' Placement Placement #

placementAt :: Lens' Placement (V2 Rational) #

placementAnchor :: Lens' Placement (V2 Rational) #

gapDirection :: Lens' Placement (Direction V2 Rational) #

class HasPlacement a where #

Minimal complete definition

placement

Methods

placement :: Lens' a Placement #

placementAt :: Lens' a (V2 Rational) #

The position relative to the axis. V2 0 0 corresponds to the - bottom left corner, V2 1 1 is the top right corner.

placementAnchor :: Lens' a (V2 Rational) #

The anchor used for the object being positioned. V2 0 0 - corresponds to the bottom left corner, V2 1 1 is the top right - corner.

gapDirection :: Lens' a (Direction V2 Rational) #

The direction to extend the gap when positioning.

Instances
HasPlacement Placement 
Instance details

Defined in Plots.Types

Methods

placement :: Lens' Placement Placement #

placementAt :: Lens' Placement (V2 Rational) #

placementAnchor :: Lens' Placement (V2 Rational) #

gapDirection :: Lens' Placement (Direction V2 Rational) #

HasPlacement (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

placement :: Lens' (ColourBar b n) Placement #

placementAt :: Lens' (ColourBar b n) (V2 Rational) #

placementAnchor :: Lens' (ColourBar b n) (V2 Rational) #

gapDirection :: Lens' (ColourBar b n) (Direction V2 Rational) #

HasPlacement (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

placement :: Lens' (Legend b n) Placement #

placementAt :: Lens' (Legend b n) (V2 Rational) #

placementAnchor :: Lens' (Legend b n) (V2 Rational) #

gapDirection :: Lens' (Legend b n) (Direction V2 Rational) #

HasPlacement (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

placement :: Lens' (Title b v n) Placement #

placementAt :: Lens' (Title b v n) (V2 Rational) #

placementAnchor :: Lens' (Title b v n) (V2 Rational) #

gapDirection :: Lens' (Title b v n) (Direction V2 Rational) #

data LegendPic b (v :: * -> *) n #

Type allowing use of the default legend picture (depending on the - plot) or a custom legend picture with access to the PlotStyle.

Constructors

DefaultLegendPic 
CustomLegendPic (PlotStyle b v n -> QDiagram b v n Any) 
Instances
Default (LegendPic b v n) 
Instance details

Defined in Plots.Types

Methods

def :: LegendPic b v n #

data LegendEntry b (v :: * -> *) n #

Data type for holding a legend entry.

Instances
type N (LegendEntry b v n) 
Instance details

Defined in Plots.Types

type N (LegendEntry b v n) = n
type V (LegendEntry b v n) 
Instance details

Defined in Plots.Types

type V (LegendEntry b v n) = v

data PlotOptions b (v :: * -> *) n #

Data type for holding information all plots must contain.

Instances
HasPlotOptions f (PlotOptions b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotOptions b v n) (PlotOptions b (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotName :: LensLike' f (PlotOptions b v n) Name #

clipPlot :: LensLike' f (PlotOptions b v n) Bool #

legendEntries :: LensLike' f (PlotOptions b v n) [LegendEntry b (V (PlotOptions b v n)) (N (PlotOptions b v n))] #

plotTransform :: LensLike' f (PlotOptions b v n) (Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotVisible :: LensLike' f (PlotOptions b v n) Bool #

(Additive v, Num n) => Default (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotOptions b v n #

HasVisibility (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotOptions b v n) Bool #

hidden :: Lens' (PlotOptions b v n) Bool #

(Additive v, Num n) => HasOrigin (PlotOptions b v n)

Move origin by applying to plotTransform.

Instance details

Defined in Plots.Types

Methods

moveOriginTo :: Point (V (PlotOptions b v n)) (N (PlotOptions b v n)) -> PlotOptions b v n -> PlotOptions b v n

Qualifiable (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

(.>>) :: IsName a => a -> PlotOptions b v n -> PlotOptions b v n

(HasLinearMap v, Num n) => Transformable (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

transform :: Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n)) -> PlotOptions b v n -> PlotOptions b v n

type N (PlotOptions b v n) 
Instance details

Defined in Plots.Types

type N (PlotOptions b v n) = n
type V (PlotOptions b v n) 
Instance details

Defined in Plots.Types

type V (PlotOptions b v n) = v

class HasPlotOptions (f :: * -> *) a b | a -> b where #

Class of things that have PlotOptions.

Minimal complete definition

plotOptions

Methods

plotOptions :: LensLike' f a (PlotOptions b (V a) (N a)) #

Lens onto the PlotOptions.

plotName :: LensLike' f a Name #

The Name applied to the plot. This gives a way to reference a - specific plot in a rendered axis.

Default is mempty.

clipPlot :: LensLike' f a Bool #

Whether the plot should be clipped to the bounds of the axes.

Default is True.

legendEntries :: LensLike' f a [LegendEntry b (V a) (N a)] #

The legend entries to be used for the current plot.

Default is mempty.

plotTransform :: LensLike' f a (Transformation (V a) (N a)) #

The transform applied to the plot once it's in the axis - coordinates.

Default is mempty.

plotVisible :: LensLike' f a Bool #

Whether or not the plot should be shown. The BoundingBox of the - plot will still affect the inferred axis bounds.

Default is True.

Instances
Functor f => HasPlotOptions f (Plot p b) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (Plot p b) (PlotOptions b (V (Plot p b)) (N (Plot p b))) #

plotName :: LensLike' f (Plot p b) Name #

clipPlot :: LensLike' f (Plot p b) Bool #

legendEntries :: LensLike' f (Plot p b) [LegendEntry b (V (Plot p b)) (N (Plot p b))] #

plotTransform :: LensLike' f (Plot p b) (Transformation (V (Plot p b)) (N (Plot p b))) #

plotVisible :: LensLike' f (Plot p b) Bool #

Functor f => HasPlotOptions f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (StyledPlot b v n) (PlotOptions b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotName :: LensLike' f (StyledPlot b v n) Name #

clipPlot :: LensLike' f (StyledPlot b v n) Bool #

legendEntries :: LensLike' f (StyledPlot b v n) [LegendEntry b (V (StyledPlot b v n)) (N (StyledPlot b v n))] #

plotTransform :: LensLike' f (StyledPlot b v n) (Transformation (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotVisible :: LensLike' f (StyledPlot b v n) Bool #

HasPlotOptions f (PlotOptions b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotOptions b v n) (PlotOptions b (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotName :: LensLike' f (PlotOptions b v n) Name #

clipPlot :: LensLike' f (PlotOptions b v n) Bool #

legendEntries :: LensLike' f (PlotOptions b v n) [LegendEntry b (V (PlotOptions b v n)) (N (PlotOptions b v n))] #

plotTransform :: LensLike' f (PlotOptions b v n) (Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotVisible :: LensLike' f (PlotOptions b v n) Bool #

Functor f => HasPlotOptions f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotMods b v n) (PlotOptions b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotName :: LensLike' f (PlotMods b v n) Name #

clipPlot :: LensLike' f (PlotMods b v n) Bool #

legendEntries :: LensLike' f (PlotMods b v n) [LegendEntry b (V (PlotMods b v n)) (N (PlotMods b v n))] #

plotTransform :: LensLike' f (PlotMods b v n) (Transformation (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotVisible :: LensLike' f (PlotMods b v n) Bool #

Functor f => HasPlotOptions f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (DynamicPlot b v n) (PlotOptions b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotName :: LensLike' f (DynamicPlot b v n) Name #

clipPlot :: LensLike' f (DynamicPlot b v n) Bool #

legendEntries :: LensLike' f (DynamicPlot b v n) [LegendEntry b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))] #

plotTransform :: LensLike' f (DynamicPlot b v n) (Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotVisible :: LensLike' f (DynamicPlot b v n) Bool #

Settable f => HasPlotOptions f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotOptions :: LensLike' f (Axis b c n) (PlotOptions b (V (Axis b c n)) (N (Axis b c n))) #

plotName :: LensLike' f (Axis b c n) Name #

clipPlot :: LensLike' f (Axis b c n) Bool #

legendEntries :: LensLike' f (Axis b c n) [LegendEntry b (V (Axis b c n)) (N (Axis b c n))] #

plotTransform :: LensLike' f (Axis b c n) (Transformation (V (Axis b c n)) (N (Axis b c n))) #

plotVisible :: LensLike' f (Axis b c n) Bool #

data AxisSpec (v :: * -> *) n #

Information from the Axis necessary to render a Plotable.

Constructors

AxisSpec 

Fields

Instances
type N (AxisSpec v n) 
Instance details

Defined in Plots.Types

type N (AxisSpec v n) = n
type V (AxisSpec v n) 
Instance details

Defined in Plots.Types

type V (AxisSpec v n) = v

(&~~) :: Monad m => s -> StateT s m a -> m s infix 1 #

Similar to '(&~)' but works with StateT and returns it in m.

(&=) :: MonadState s m => ASetter' s b -> State b a -> m () infix 3 #

Similar to '(%=)' but takes a state modification instead of a - function.

viridis :: ColourMap #

The viridis colour map taken from https://bids.github.io/colormap/. - This is the default colour map.

plasma :: ColourMap #

The plasma colour map taken from https://bids.github.io/colormap/.

inferno :: ColourMap #

The inferno colour map taken from https://bids.github.io/colormap/.

greys :: ColourMap #

A colour map from black to white.

toStops :: Fractional n => ColourMap -> [GradientStop n] #

alphaColourMap :: [(Rational, AlphaColour Double)] -> ColourMap #

colourMap :: [(Rational, Colour Double)] -> ColourMap #

colourList :: ColourMap -> [(Rational, AlphaColour Double)] #

Return the list of colours in the [0,1] range in order. This always - includes colours 0 and 1.

cmTraverse :: IndexedTraversal' Rational ColourMap (AlphaColour Double) #

Indexed traversal over the colours indexed and ordered by their - position in the map.

ixColour :: Rational -> Lens' ColourMap (AlphaColour Double) #

star' :: (InSpace V2 n t, TrailLike t) => n -> t #

A filled in five sided start of size x.

plus :: (InSpace V2 n t, TrailLike t) => n -> t #

Filled in + symbol.

crossShape :: (InSpace V2 n t, TrailLike t) => n -> t #

A rotated plus.

diamond :: (InSpace V2 n t, TrailLike t) => n -> t #

A rotated square.

asterisk :: OrderedField n => Int -> n -> Path V2 n #

Make an asterisk with n spokes, each of length l.

lineMarkers :: OrderedField n => [Path V2 n] #

asterisk markers with varying numbers of prongs.

colours2 :: OrderedField n => [Colour n] #

Another colour set, used for vividColours.

colours1 :: OrderedField n => [Colour n] #

A colourful colour set used for fadedColours.

blackAndWhite :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

Theme without any colours, useful for black and white documents.

vividColours :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

Theme using funColours with no lines on 'areaStyle.

fadedColours :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

Theme using funColours with faded fills and thick lines.

applyTextStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: * -> *) a b, HasStyle t) => a -> t -> t #

Apply the textStyle from a PlotStyle.

applyTextStyle :: (InSpace v n t, HasStyle t) => PlotStyle b v n -> t -> t
-

applyAreaStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: * -> *) a b, HasStyle t) => a -> t -> t #

Apply the 'areaStyle from a PlotStyle.

applyLineStyle :: (InSpace v n t, HasStyle t) => PlotStyle b v n -> t -> t
-

applyMarkerStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: * -> *) a b, HasStyle t) => a -> t -> t #

Apply the markerStyle from a PlotStyle.

applyMarkerStyle :: (InSpace v n t, HasStyle t) => PlotStyle b v n -> t -> t
-

applyLineStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: * -> *) a b, HasStyle t) => a -> t -> t #

Apply the lineStyle from a PlotStyle.

applyLineStyle :: (InSpace v n t, HasStyle t) => PlotStyle b v n -> t -> t
-

data PlotStyle b (v :: * -> *) n #

Plot styles are used to style each plot in an axis. Every Axis - comes with a list of plots styles (contained in the AxisStyle) - which get applied the plots upon rendering.

You can either change the list of plot styles used with - axisStyle:

stylishAxis = r2Axis &~ do
-  axisStyle .= vividColours
-  linePlot [(1,2) (3,4)] $ key "line 1"
-  linePlot [(1,1) (4,2)] $ key "line 2"
-

change the style for individual plots when changing the plot state.

stylishAxis2 = r2Axis &~ do
-  linePlot [(1,2) (3,4)] $ do
-    key "line 1"
-    plotColour .= green
-  linePlot [(1,1) (4,2)] $ do
-    key "line 2"
-    plotColour .= orange
-

A plot style is made up of separate styles (lineStyle, - markerStyle, areaStyle and textStyle) a plotColour and a - plotMarker. When rendering a plot, the PlotStyles in an - AxisStyle are used to style each plot. The lenses can be used to - customise each style when adding the plot.

  • plotColour - the underlying colour of the plot
  • lineStyle - style used for lines (linePlot, connectingLine - in a scatterPlot)
  • areaStyle - style used for any area (barPlot, piePlot, - histogramPlot)
  • markerStyle - style used for markers in scatterPlot
  • plotMarker - marker used in scatterPlot
Instances
HasPlotStyle f (PlotStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (PlotStyle b v n) (PlotStyle b (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotColour :: LensLike' f (PlotStyle b v n) (Colour Double) #

plotColor :: LensLike' f (PlotStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

lineStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotMarker :: LensLike' f (PlotStyle b v n) (QDiagram b (V (PlotStyle b v n)) (N (PlotStyle b v n)) Any) #

plotStyles :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotStyleFunctions :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

(Metric v, Traversable v, OrderedField n) => Transformable (PlotStyle b v n) 
Instance details

Defined in Plots.Style

Methods

transform :: Transformation (V (PlotStyle b v n)) (N (PlotStyle b v n)) -> PlotStyle b v n -> PlotStyle b v n

type N (PlotStyle b v n) 
Instance details

Defined in Plots.Style

type N (PlotStyle b v n) = n
type V (PlotStyle b v n) 
Instance details

Defined in Plots.Style

type V (PlotStyle b v n) = v

class HasPlotStyle (f :: * -> *) a b | a -> b where #

Class for objects that contain a PlotStyle.

Minimal complete definition

plotStyle

Methods

plotStyle :: LensLike' f a (PlotStyle b (V a) (N a)) #

Lens onto the PlotStyle.

plotColour :: LensLike' f a (Colour Double) #

The plotColour is the overall colour of the plot. This is passed - to the other styles (lineStyle, markerStyle etc.) to give an - overall colour for the plot.

plotColor :: LensLike' f a (Colour Double) #

Alias for plotColour.

lineStyle :: LensLike' f a (Style (V a) (N a)) #

This style is applied to any plots made up of lines only (like - Path plots). This is a less general version of - lineStyleFunction.

lineStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

A version lineStyle with access to the current plotColour - when applyLineStyle is used.

markerStyle :: LensLike' f a (Style (V a) (N a)) #

This style is applied to any markers in the plot (usually the - plotMarker). This is a less general version of - markerStyleFunction.

markerStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

A version lineStyle with access to the current plotColour when - applyMarkerStyle is used.

areaStyle :: LensLike' f a (Style (V a) (N a)) #

This style is applied to any filled areas in a plot (like - Bar or Ribbon). This is a less - general version of areaStyleFunction.

areaStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

A version areaStyle with access to the current plotColour when - applyAreaStyle is used.

textStyle :: LensLike' f a (Style (V a) (N a)) #

This style is applied to text plots. This is a less general - version of textStyleFunction.

textStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

A version textStyle with access to the current plotColour when - applyAreaStyle is used.

plotMarker :: LensLike' f a (QDiagram b (V a) (N a) Any) #

This diagram is used as any markers in a plot (like - Scatter). The markerStyle will be applied to this - marker when the plot gets rendered.

plotStyles :: LensLike' f a (Style (V a) (N a)) #

A traversal over all the styles (lineStyle, markerStyle, - areaStyle and textStyle) of a PlotStyle. This is a less - general version of plotStyleFunctions.

plotStyleFunctions :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

A version of plotStyles with access to the plotColour.

Instances
Settable f => HasPlotStyle f (Plot p b) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (Plot p b) (PlotStyle b (V (Plot p b)) (N (Plot p b))) #

plotColour :: LensLike' f (Plot p b) (Colour Double) #

plotColor :: LensLike' f (Plot p b) (Colour Double) #

lineStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

lineStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

markerStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

markerStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

areaStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

areaStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

textStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

textStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

plotMarker :: LensLike' f (Plot p b) (QDiagram b (V (Plot p b)) (N (Plot p b)) Any) #

plotStyles :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

plotStyleFunctions :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

Functor f => HasPlotStyle f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (StyledPlot b v n) (PlotStyle b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotColour :: LensLike' f (StyledPlot b v n) (Colour Double) #

plotColor :: LensLike' f (StyledPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

lineStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotMarker :: LensLike' f (StyledPlot b v n) (QDiagram b (V (StyledPlot b v n)) (N (StyledPlot b v n)) Any) #

plotStyles :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotStyleFunctions :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

Settable f => HasPlotStyle f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (PlotMods b v n) (PlotStyle b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotColour :: LensLike' f (PlotMods b v n) (Colour Double) #

plotColor :: LensLike' f (PlotMods b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

lineStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotMarker :: LensLike' f (PlotMods b v n) (QDiagram b (V (PlotMods b v n)) (N (PlotMods b v n)) Any) #

plotStyles :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotStyleFunctions :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

Settable f => HasPlotStyle f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (DynamicPlot b v n) (PlotStyle b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotColour :: LensLike' f (DynamicPlot b v n) (Colour Double) #

plotColor :: LensLike' f (DynamicPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

lineStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotMarker :: LensLike' f (DynamicPlot b v n) (QDiagram b (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) Any) #

plotStyles :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotStyleFunctions :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

HasPlotStyle f (PlotStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (PlotStyle b v n) (PlotStyle b (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotColour :: LensLike' f (PlotStyle b v n) (Colour Double) #

plotColor :: LensLike' f (PlotStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

lineStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotMarker :: LensLike' f (PlotStyle b v n) (QDiagram b (V (PlotStyle b v n)) (N (PlotStyle b v n)) Any) #

plotStyles :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotStyleFunctions :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

Applicative f => HasPlotStyle f (AxisStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (AxisStyle b v n) (PlotStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotColour :: LensLike' f (AxisStyle b v n) (Colour Double) #

plotColor :: LensLike' f (AxisStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

lineStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

markerStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

markerStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

areaStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

areaStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

textStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

textStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotMarker :: LensLike' f (AxisStyle b v n) (QDiagram b (V (AxisStyle b v n)) (N (AxisStyle b v n)) Any) #

plotStyles :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotStyleFunctions :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

Settable f => HasPlotStyle f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotStyle :: LensLike' f (Axis b c n) (PlotStyle b (V (Axis b c n)) (N (Axis b c n))) #

plotColour :: LensLike' f (Axis b c n) (Colour Double) #

plotColor :: LensLike' f (Axis b c n) (Colour Double) #

lineStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

lineStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

textStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

textStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

plotMarker :: LensLike' f (Axis b c n) (QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

plotStyles :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

plotStyleFunctions :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

class HasAxisStyle a b | a -> b where #

Class of things that have an AxisStyle.

Minimal complete definition

axisStyle

Methods

axisStyle :: Lens' a (AxisStyle b (V a) (N a)) #

Lens onto the AxisStyle.

axisColourMap :: Lens' a ColourMap #

The ColourMap is used to draw the ColourBar and - render plots like HeatMap.

axisStyles :: IndexedTraversal' Int a (PlotStyle b (V a) (N a)) #

Traversal over the PlotStyles in an AxisStyle. There are always - an infinite number of PlotStyles in an AxisStyle.

Instances
HasAxisStyle (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisStyle :: Lens' (Axis b v n) (AxisStyle b (V (Axis b v n)) (N (Axis b v n))) #

axisColourMap :: Lens' (Axis b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (Axis b v n) (PlotStyle b (V (Axis b v n)) (N (Axis b v n))) #

HasAxisStyle (AxisStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

axisStyle :: Lens' (AxisStyle b v n) (AxisStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

axisColourMap :: Lens' (AxisStyle b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (AxisStyle b v n) (PlotStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

data ColourMap #

A map from a number (usually between 0 and 1) to a colour. Colour - maps are part of the AxisStyle, which is used for plots like - HeatMap.

Instances
Show ColourMap 
Instance details

Defined in Plots.Style

Methods

showsPrec :: Int -> ColourMap -> ShowS #

show :: ColourMap -> String #

showList :: [ColourMap] -> ShowS #

Wrapped ColourMap 
Instance details

Defined in Plots.Style

Associated Types

type Unwrapped ColourMap :: * #

Methods

_Wrapped' :: Iso' ColourMap (Unwrapped ColourMap) #

AsEmpty ColourMap 
Instance details

Defined in Plots.Style

Methods

_Empty :: Prism' ColourMap () #

Ixed ColourMap 
Instance details

Defined in Plots.Style

Methods

ix :: Index ColourMap -> Traversal' ColourMap (IxValue ColourMap) #

At ColourMap

Nothing == transparent

Instance details

Defined in Plots.Style

Methods

at :: Index ColourMap -> Lens' ColourMap (Maybe (IxValue ColourMap)) #

Transformable ColourMap 
Instance details

Defined in Plots.Style

Methods

transform :: Transformation (V ColourMap) (N ColourMap) -> ColourMap -> ColourMap

Rewrapped ColourMap ColourMap 
Instance details

Defined in Plots.Style

Each ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) #

type Unwrapped ColourMap 
Instance details

Defined in Plots.Style

type Unwrapped ColourMap = Map Rational (AlphaColour Double)
type IxValue ColourMap 
Instance details

Defined in Plots.Style

type IxValue ColourMap = AlphaColour Double
type Index ColourMap 
Instance details

Defined in Plots.Style

type Index ColourMap = Rational
type N ColourMap 
Instance details

Defined in Plots.Style

type N ColourMap = Rational
type V ColourMap 
Instance details

Defined in Plots.Style

type V ColourMap = V1

logDeform :: (InSpace v n a, Foldable v, Floating n, Deformable a a) => v LogScale -> a -> a #

Deform an object according to the axis scale. Does nothing for - linear scales.

logPoint :: (Additive v, Floating n) => v LogScale -> Point v n -> Point v n #

Transform a point according to the axis scale. Does nothing for - linear scales.

logNumber :: Floating a => LogScale -> a -> a #

Log the number for LogAxis, do nothing for LinearAxis.

calculateScaling #

Arguments

:: (HasLinearMap v, OrderedField n, Applicative v) 
=> v (AxisScaling n)

axis scaling options

-> BoundingBox v n

bounding box from the axis plots

-> (v (n, n), Transformation v n, Transformation v n) 

Calculate the scaling for the axis.

The result returns:

  • The final bounds for the axis
  • scale to match desired scaleAspectRatio
  • scale to match desired asSizeSpec

calculateBounds #

Arguments

:: OrderedField n 
=> AxisScaling n

Scaling to use for this axis

-> Maybe (n, n)

Inferred bounds (from any plots)

-> (n, n)

Lower and upper bounds to use for this axis

Calculating the bounds for an axis.

noExtend :: Num n => Extending n #

Do not extend the axis beyond the inferred bounds.

data ScaleMode #

How the axis should be scaled when not all dimensions are set.

Constructors

AutoScale 
NoScale 
Stretch 
UniformScale UniformScaleStrategy 
Instances
Read ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS ScaleMode #

readList :: ReadS [ScaleMode] #

readPrec :: ReadPrec ScaleMode #

readListPrec :: ReadPrec [ScaleMode] #

Show ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> ScaleMode -> ShowS #

show :: ScaleMode -> String #

showList :: [ScaleMode] -> ShowS #

data UniformScaleStrategy #

?

Constructors

AutoUniformScale 
UnitOnly 
ChangeVerticalLimits 
ChangeHorizontalLimits 
Instances
Read UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS UniformScaleStrategy #

readList :: ReadS [UniformScaleStrategy] #

readPrec :: ReadPrec UniformScaleStrategy #

readListPrec :: ReadPrec [UniformScaleStrategy] #

Show UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> UniformScaleStrategy -> ShowS #

show :: UniformScaleStrategy -> String #

showList :: [UniformScaleStrategy] -> ShowS #

data AxisScaling n #

Data type used that concerns everything to do with the size or - scale of the axis.

Instances
HasAxisScaling f (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

axisScaling :: LensLike' f (AxisScaling n) (AxisScaling (N (AxisScaling n))) #

scaleAspectRatio :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

scaleMode :: LensLike' f (AxisScaling n) ScaleMode #

logScale :: LensLike' f (AxisScaling n) LogScale #

axisExtend :: LensLike' f (AxisScaling n) (Extending (N (AxisScaling n))) #

boundMin :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

boundMax :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

renderSize :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

Fractional n => Default (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: AxisScaling n #

type N (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

type N (AxisScaling n) = n

data Extending n #

How much to extend the bounds beyond any inferred bounds.

Constructors

AbsoluteExtend n 
RelativeExtend n 
Instances
Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Eq n => Eq (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: Extending n -> Extending n -> Bool #

(/=) :: Extending n -> Extending n -> Bool #

Ord n => Ord (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

compare :: Extending n -> Extending n -> Ordering #

(<) :: Extending n -> Extending n -> Bool #

(<=) :: Extending n -> Extending n -> Bool #

(>) :: Extending n -> Extending n -> Bool #

(>=) :: Extending n -> Extending n -> Bool #

max :: Extending n -> Extending n -> Extending n #

min :: Extending n -> Extending n -> Extending n #

Show n => Show (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> Extending n -> ShowS #

show :: Extending n -> String #

showList :: [Extending n] -> ShowS #

class HasAxisScaling (f :: * -> *) a where #

Class of things that have an AxisScaling.

Minimal complete definition

axisScaling

Methods

axisScaling :: LensLike' f a (AxisScaling (N a)) #

The way to scale in one direction.

scaleAspectRatio :: LensLike' f a (Maybe (N a)) #

The ratio relative to other axis. If no ratios are set, the ratio - is not enforced. If at least one is set, Nothing ratios are - 1.

scaleMode :: LensLike' f a ScaleMode #

The mode to determine how to scale the bounds in a direction. - Choose between AutoScale, NoScale, Stretch or - UniformScale.

Default is AutoScale.

logScale :: LensLike' f a LogScale #

Whether the axis uses LogAxis or LinearAxis.

Default is LinearAxis.

axisExtend :: LensLike' f a (Extending (N a)) #

How much to extend the bounds over infered bounds. This is - ignored if a boundMax or boundMin is set.

boundMin :: LensLike' f a (Maybe (N a)) #

The maximum bound the axis. There are helper functions for - setting a minimum bound for a specific axis.

xMin :: Lens' (Axis b V2 Double) (Maybe Double)
-yMin :: Lens' (Axis b V2 Double) (Maybe Double)
-

Default is Nothing.

boundMax :: LensLike' f a (Maybe (N a)) #

The maximum bound the axis. There are helper functions for - setting a maximum bound specific axis.

xMax :: Lens' (Axis b V2 Double) (Maybe Double)
-yMax :: Lens' (Axis b V2 Double) (Maybe Double)
-rMax :: Lens' (Axis b 'Polar Double) (Maybe Double)
-

Default is Nothing.

renderSize :: LensLike' f a (Maybe (N a)) #

The size of the rendered axis. Default is Just 400.

Instances
HasAxisScaling f (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

axisScaling :: LensLike' f (AxisScaling n) (AxisScaling (N (AxisScaling n))) #

scaleAspectRatio :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

scaleMode :: LensLike' f (AxisScaling n) ScaleMode #

logScale :: LensLike' f (AxisScaling n) LogScale #

axisExtend :: LensLike' f (AxisScaling n) (Extending (N (AxisScaling n))) #

boundMin :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

boundMax :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

renderSize :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

Functor f => HasAxisScaling f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (SingleAxis b v n) (AxisScaling (N (SingleAxis b v n))) #

scaleAspectRatio :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

scaleMode :: LensLike' f (SingleAxis b v n) ScaleMode #

logScale :: LensLike' f (SingleAxis b v n) LogScale #

axisExtend :: LensLike' f (SingleAxis b v n) (Extending (N (SingleAxis b v n))) #

boundMin :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

boundMax :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

renderSize :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasAxisScaling f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (Axis b c n) (AxisScaling (N (Axis b c n))) #

scaleAspectRatio :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

scaleMode :: LensLike' f (Axis b c n) ScaleMode #

logScale :: LensLike' f (Axis b c n) LogScale #

axisExtend :: LensLike' f (Axis b c n) (Extending (N (Axis b c n))) #

boundMin :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

boundMax :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

renderSize :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

data LogScale #

Should the axis be on a logarithmic scale. The Default is - LinearAxis.

Constructors

LinearAxis 
LogAxis 
Instances
Eq LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: LogScale -> LogScale -> Bool #

(/=) :: LogScale -> LogScale -> Bool #

Show LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> LogScale -> ShowS #

show :: LogScale -> String #

showList :: [LogScale] -> ShowS #

Default LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: LogScale #

etheta :: Circle v => E v #

eθ :: Circle v => E v #

er :: Radial v => E v #

interpPolar :: Num n => n -> Polar n -> Polar n -> Polar n #

Polar interpolation between two polar coordinates.

polarV2 :: RealFloat n => Iso' (Polar n) (V2 n) #

Numerical Iso' between Polar and R2.

polarIso :: (Profunctor p, Functor f) => p (n, Angle n) (f (n, Angle n)) -> p (Polar n) (f (Polar n)) #

Iso' between Polar and its tuple form.

unpolar :: Polar n -> (n, Angle n) #

Turn a Polar back into a magnitude and Angle tuple.

polar :: (n, Angle n) -> Polar n #

Construct a Polar from a magnitude and Angle tuple.

mkPolar :: n -> Angle n -> Polar n #

Construct a Polar from a magnitude and an Angle.

class Radial (t :: * -> *) where #

Space which has a radial length basis. For Polar and Cylindrical this is - the radius of the circle in the xy-plane. For Spherical this is the - distance from the origin.

Minimal complete definition

_radial

Methods

_radial :: Functor f => (a -> f a) -> t a -> f (t a) #

Instances
Radial Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_radial :: Functor f => (a -> f a) -> Polar a -> f (Polar a) #

class Radial t => Circle (t :: * -> *) where #

Space which has a radial and angular basis.

Minimal complete definition

_azimuth, _polar

Methods

_azimuth :: Functor f => (Angle a -> f (Angle a)) -> t a -> f (t a) #

_polar :: Functor f => (Polar a -> f (Polar a)) -> t a -> f (t a) #

Instances
Circle Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_azimuth :: Functor f => (Angle a -> f (Angle a)) -> Polar a -> f (Polar a) #

_polar :: Functor f => (Polar a -> f (Polar a)) -> Polar a -> f (Polar a) #

class HasX (t :: * -> *) where #

Coordinate with at least one dimension where the x coordinate can be - retreived numerically. Note this differs slightly from R1 which requires - a lens for all values. This allows instances for different coordinates - such as Polar, where the x coordinate can only be retreived numerically.

Minimal complete definition

x_

Methods

x_ :: RealFloat n => Lens' (t n) n #

Instances
HasX V3 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (V3 n) n #

HasX V2 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (V2 n) n #

HasX Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Polar n) n #

HasX v => HasX (Point v) 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Point v n) n #

class HasX t => HasY (t :: * -> *) where #

Coordinate with at least two dimensions where the x and y coordinates can be - retreived numerically.

Minimal complete definition

xy_

Methods

y_ :: RealFloat n => Lens' (t n) n #

xy_ :: RealFloat n => Lens' (t n) (V2 n) #

Instances
HasY V3 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (V3 n) n #

xy_ :: RealFloat n => Lens' (V3 n) (V2 n) #

HasY V2 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (V2 n) n #

xy_ :: RealFloat n => Lens' (V2 n) (V2 n) #

HasY Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Polar n) n #

xy_ :: RealFloat n => Lens' (Polar n) (V2 n) #

HasY v => HasY (Point v) 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Point v n) n #

xy_ :: RealFloat n => Lens' (Point v n) (V2 n) #

newtype Polar a #

Constructors

Polar (V2 a) 
Instances
Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

MonadFix Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

mfix :: (a -> Polar a) -> Polar a #

Applicative Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

pure :: a -> Polar a #

(<*>) :: Polar (a -> b) -> Polar a -> Polar b #

liftA2 :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #

(*>) :: Polar a -> Polar b -> Polar b #

(<*) :: Polar a -> Polar b -> Polar a #

Foldable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fold :: Monoid m => Polar m -> m #

foldMap :: Monoid m => (a -> m) -> Polar a -> m #

foldr :: (a -> b -> b) -> b -> Polar a -> b #

foldr' :: (a -> b -> b) -> b -> Polar a -> b #

foldl :: (b -> a -> b) -> b -> Polar a -> b #

foldl' :: (b -> a -> b) -> b -> Polar a -> b #

foldr1 :: (a -> a -> a) -> Polar a -> a #

foldl1 :: (a -> a -> a) -> Polar a -> a #

toList :: Polar a -> [a] #

null :: Polar a -> Bool #

length :: Polar a -> Int #

elem :: Eq a => a -> Polar a -> Bool #

maximum :: Ord a => Polar a -> a #

minimum :: Ord a => Polar a -> a #

sum :: Num a => Polar a -> a #

product :: Num a => Polar a -> a #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

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

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

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

sequence :: Monad m => Polar (m a) -> m (Polar a) #

MonadZip Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

mzip :: Polar a -> Polar b -> Polar (a, b) #

mzipWith :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #

munzip :: Polar (a, b) -> (Polar a, Polar b) #

Radial Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_radial :: Functor f => (a -> f a) -> Polar a -> f (Polar a) #

Circle Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_azimuth :: Functor f => (Angle a -> f (Angle a)) -> Polar a -> f (Polar a) #

_polar :: Functor f => (Polar a -> f (Polar a)) -> Polar a -> f (Polar a) #

HasX Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Polar n) n #

HasY Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Polar n) n #

xy_ :: RealFloat n => Lens' (Polar n) (V2 n) #

HasR Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_r :: RealFloat n => Lens' (Polar n) n #

Distributive Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

distribute :: Functor f => f (Polar a) -> Polar (f a)

collect :: Functor f => (a -> Polar b) -> f a -> Polar (f b)

distributeM :: Monad m => m (Polar a) -> Polar (m a)

collectM :: Monad m => (a -> Polar b) -> m a -> Polar (m b)

Representable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Rep Polar :: *

Methods

tabulate :: (Rep Polar -> a) -> Polar a

index :: Polar a -> Rep Polar -> a

(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b Polar n 
Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b Polar n -> QDiagram b (BaseSpace Polar) n Any #

RealFloat n => PointLike V2 n (Polar n)

Does not satify lens laws.

Instance details

Defined in Diagrams.Coordinates.Polar

Methods

pointLike :: Iso' (Point V2 n) (Polar n) #

unpointLike :: Iso' (Polar n) (Point V2 n) #

Wrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Unwrapped (Polar a) :: * #

Methods

_Wrapped' :: Iso' (Polar a) (Unwrapped (Polar a)) #

Generic1 Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Rep1 Polar :: k -> * #

Methods

from1 :: Polar a -> Rep1 Polar a #

to1 :: Rep1 Polar a -> Polar a #

Polar a1 ~ t => Rewrapped (Polar a2) t 
Instance details

Defined in Diagrams.Coordinates.Polar

type BaseSpace Polar 
Instance details

Defined in Plots.Axis

type BaseSpace Polar = V2
type Rep Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

type Rep Polar = E Polar
type Unwrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

type Unwrapped (Polar a) = V2 a
type Rep1 Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

type Rep1 Polar = D1 (MetaData "Polar" "Diagrams.Coordinates.Polar" "plots-0.1.0.2-J97qS1TiFW2BE1BUjrVrVc" True) (C1 (MetaCons "Polar" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 V2)))
type MainOpts (Axis b Polar n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b Polar n) = MainOpts (QDiagram b V2 n Any)

class HasR (t :: * -> *) where #

Minimal complete definition

_r

Methods

_r :: RealFloat n => Lens' (t n) n #

Instances
HasR V2 
Instance details

Defined in Diagrams.TwoD.Types

Methods

_r :: RealFloat n => Lens' (V2 n) n #

HasR Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_r :: RealFloat n => Lens' (Polar n) n #

HasR v => HasR (Point v) 
Instance details

Defined in Diagrams.TwoD.Types

Methods

_r :: RealFloat n => Lens' (Point v n) n #

\ No newline at end of file +AlphaChannel (c1 `atop` c2) == AlphaChannel c2

blend :: (Num a, AffineSpace f) => a -> f a -> f a -> f a #

Compute the weighted average of two points. + e.g.

blend 0.4 a b = 0.4*a + 0.6*b

The weight can be negative, or greater than 1.0; however, be aware + that non-convex combinations may lead to out of gamut colours.

withOpacity :: Num a => Colour a -> a -> AlphaColour a #

Creates an AlphaColour from a Colour with a given opacity.

c `withOpacity` o == dissolve o (opaque c)

dissolve :: Num a => a -> AlphaColour a -> AlphaColour a #

Returns an AlphaColour more transparent by a factor of o.

opaque :: Num a => Colour a -> AlphaColour a #

Creates an opaque AlphaColour from a Colour.

alphaColourConvert :: (Fractional b, Real a) => AlphaColour a -> AlphaColour b #

Change the type used to represent the colour coordinates.

transparent :: Num a => AlphaColour a #

This AlphaColour is entirely transparent and has no associated + colour channel.

black :: Num a => Colour a #

colourConvert :: (Fractional b, Real a) => Colour a -> Colour b #

Change the type used to represent the colour coordinates.

data Colour a #

This type represents the human preception of colour. + The a parameter is a numeric type used internally for the + representation.

The Monoid instance allows one to add colours, but beware that adding + colours can take you out of gamut. Consider using blend whenever + possible.

Instances
AffineSpace Colour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, Colour a)] -> Colour a -> Colour a #

ColourOps Colour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> Colour a -> Colour a #

darken :: Num a => a -> Colour a -> Colour a #

Each ColourMap ColourMap (Colour Double) (Colour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (Colour Double) (Colour Double) #

Eq a => Eq (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Num a => Semigroup (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: Colour a -> Colour a -> Colour a #

sconcat :: NonEmpty (Colour a) -> Colour a #

stimes :: Integral b => b -> Colour a -> Colour a #

Num a => Monoid (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: Colour a #

mappend :: Colour a -> Colour a -> Colour a #

mconcat :: [Colour a] -> Colour a #

Parseable (Colour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (Colour Double)

data AlphaColour a #

This type represents a Colour that may be semi-transparent.

The Monoid instance allows you to composite colours.

x `mappend` y == x `over` y

To get the (pre-multiplied) colour channel of an AlphaColour c, + simply composite c over black.

c `over` black
Instances
AffineSpace AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, AlphaColour a)] -> AlphaColour a -> AlphaColour a #

ColourOps AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a #

darken :: Num a => a -> AlphaColour a -> AlphaColour a #

Eq a => Eq (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Num a => Semigroup (AlphaColour a)

AlphaColour forms a monoid with over and transparent.

Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a #

sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a #

stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #

Num a => Monoid (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: AlphaColour a #

mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a #

mconcat :: [AlphaColour a] -> AlphaColour a #

Parseable (AlphaColour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (AlphaColour Double)

class AffineSpace (f :: Type -> Type) where #

Methods

affineCombo :: Num a => [(a, f a)] -> f a -> f a #

Compute a affine Combination (weighted-average) of points. + The last parameter will get the remaining weight. + e.g.

affineCombo [(0.2,a), (0.3,b)] c == 0.2*a + 0.3*b + 0.5*c

Weights can be negative, or greater than 1.0; however, be aware + that non-convex combinations may lead to out of gamut colours.

Instances
AffineSpace Colour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, Colour a)] -> Colour a -> Colour a #

AffineSpace AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

affineCombo :: Num a => [(a, AlphaColour a)] -> AlphaColour a -> AlphaColour a #

class ColourOps (f :: Type -> Type) where #

Minimal complete definition

over, darken

Methods

darken :: Num a => a -> f a -> f a #

darken s c blends a colour with black without changing it's opacity.

For Colour, darken s c = blend s c mempty

Instances
ColourOps Colour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> Colour a -> Colour a #

darken :: Num a => a -> Colour a -> Colour a #

ColourOps AlphaColour 
Instance details

Defined in Data.Colour.Internal

Methods

over :: Num a => AlphaColour a -> AlphaColour a -> AlphaColour a #

darken :: Num a => a -> AlphaColour a -> AlphaColour a #

class Default a where #

A class for types with a default value.

Minimal complete definition

Nothing

Methods

def :: a #

The default value for this type.

Instances
Default Double 
Instance details

Defined in Data.Default.Class

Methods

def :: Double #

Default Float 
Instance details

Defined in Data.Default.Class

Methods

def :: Float #

Default Int 
Instance details

Defined in Data.Default.Class

Methods

def :: Int #

Default Int8 
Instance details

Defined in Data.Default.Class

Methods

def :: Int8 #

Default Int16 
Instance details

Defined in Data.Default.Class

Methods

def :: Int16 #

Default Int32 
Instance details

Defined in Data.Default.Class

Methods

def :: Int32 #

Default Int64 
Instance details

Defined in Data.Default.Class

Methods

def :: Int64 #

Default Integer 
Instance details

Defined in Data.Default.Class

Methods

def :: Integer #

Default Ordering 
Instance details

Defined in Data.Default.Class

Methods

def :: Ordering #

Default Word 
Instance details

Defined in Data.Default.Class

Methods

def :: Word #

Default Word8 
Instance details

Defined in Data.Default.Class

Methods

def :: Word8 #

Default Word16 
Instance details

Defined in Data.Default.Class

Methods

def :: Word16 #

Default Word32 
Instance details

Defined in Data.Default.Class

Methods

def :: Word32 #

Default Word64 
Instance details

Defined in Data.Default.Class

Methods

def :: Word64 #

Default () 
Instance details

Defined in Data.Default.Class

Methods

def :: () #

Default All 
Instance details

Defined in Data.Default.Class

Methods

def :: All #

Default Any 
Instance details

Defined in Data.Default.Class

Methods

def :: Any #

Default CShort 
Instance details

Defined in Data.Default.Class

Methods

def :: CShort #

Default CUShort 
Instance details

Defined in Data.Default.Class

Methods

def :: CUShort #

Default CInt 
Instance details

Defined in Data.Default.Class

Methods

def :: CInt #

Default CUInt 
Instance details

Defined in Data.Default.Class

Methods

def :: CUInt #

Default CLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CLong #

Default CULong 
Instance details

Defined in Data.Default.Class

Methods

def :: CULong #

Default CLLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CLLong #

Default CULLong 
Instance details

Defined in Data.Default.Class

Methods

def :: CULLong #

Default CFloat 
Instance details

Defined in Data.Default.Class

Methods

def :: CFloat #

Default CDouble 
Instance details

Defined in Data.Default.Class

Methods

def :: CDouble #

Default CPtrdiff 
Instance details

Defined in Data.Default.Class

Methods

def :: CPtrdiff #

Default CSize 
Instance details

Defined in Data.Default.Class

Methods

def :: CSize #

Default CSigAtomic 
Instance details

Defined in Data.Default.Class

Methods

def :: CSigAtomic #

Default CClock 
Instance details

Defined in Data.Default.Class

Methods

def :: CClock #

Default CTime 
Instance details

Defined in Data.Default.Class

Methods

def :: CTime #

Default CUSeconds 
Instance details

Defined in Data.Default.Class

Methods

def :: CUSeconds #

Default CSUSeconds 
Instance details

Defined in Data.Default.Class

Methods

def :: CSUSeconds #

Default CIntPtr 
Instance details

Defined in Data.Default.Class

Methods

def :: CIntPtr #

Default CUIntPtr 
Instance details

Defined in Data.Default.Class

Methods

def :: CUIntPtr #

Default CIntMax 
Instance details

Defined in Data.Default.Class

Methods

def :: CIntMax #

Default CUIntMax 
Instance details

Defined in Data.Default.Class

Methods

def :: CUIntMax #

Default NewtonParam 
Instance details

Defined in Numeric.RootFinding

Methods

def :: NewtonParam #

Default RiddersParam 
Instance details

Defined in Numeric.RootFinding

Methods

def :: RiddersParam #

Default FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

def :: FillRule #

Default FileOptions 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Cairo

Methods

def :: FileOptions #

Default AxisStyle 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisStyle #

Default AxisVisibility 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisVisibility #

Default FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FillStyle #

Default FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontSlant #

Default FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontStyle #

Default FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontWeight #

Default LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: LineStyle #

Default PointStyle 
Instance details

Defined in Graphics.Rendering.Chart.Drawing

Methods

def :: PointStyle #

Default LegendStyle 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

def :: LegendStyle #

Default PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieChart #

Default PieItem 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieItem #

Default PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieLayout #

Default VectorStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: VectorStyle #

Default Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

def :: Rectangle #

Default CState 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

def :: CState #

Default LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: LogScale #

Default NanColours 
Instance details

Defined in Plots.Style

Methods

def :: NanColours #

Default NormalisationMethod 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: NormalisationMethod #

Default CairoState 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

def :: CairoState #

Default FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontSlant #

Default FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontWeight #

Default AxisLineType 
Instance details

Defined in Plots.Axis.Line

Methods

def :: AxisLineType #

Default [a] 
Instance details

Defined in Data.Default.Class

Methods

def :: [a] #

Default (Maybe a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Maybe a #

Integral a => Default (Ratio a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Ratio a #

Default a => Default (IO a) 
Instance details

Defined in Data.Default.Class

Methods

def :: IO a #

(Default a, RealFloat a) => Default (Complex a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Complex a #

Default (First a) 
Instance details

Defined in Data.Default.Class

Methods

def :: First a #

Default (Last a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Last a #

Default a => Default (Dual a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Dual a #

Default (Endo a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Endo a #

Num a => Default (Sum a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Sum a #

Num a => Default (Product a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Product a #

TypeableFloat n => Default (ArrowOpts n) 
Instance details

Defined in Diagrams.TwoD.Arrow

Methods

def :: ArrowOpts n #

OrderedField n => Default (EnvelopeOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: EnvelopeOpts n #

Fractional n => Default (OriginOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: OriginOpts n #

Floating n => Default (TraceOpts n) 
Instance details

Defined in Diagrams.TwoD.Model

Methods

def :: TraceOpts n #

Default (StrokeOpts a) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

def :: StrokeOpts a #

Num n => Default (PolygonOpts n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

def :: PolygonOpts n #

Num d => Default (RoundedRectOpts d) 
Instance details

Defined in Diagrams.TwoD.Shapes

Methods

def :: RoundedRectOpts d #

(Show a, RealFloat a) => Default (LinearAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LinearAxisParams a #

(Show a, RealFloat a) => Default (LogAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LogAxisParams a #

PlotValue t => Default (LayoutAxis t) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutAxis t #

Default (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: StackedLayouts x #

Fractional n => Default (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: AxisScaling n #

Fractional n => Default (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

def :: BarLayout n #

Default (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: HistogramOptions n #

Default (FillTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

def :: FillTexture n #

Default (LineTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

def :: LineTexture n #

Num n => Default (FontSizeM n) 
Instance details

Defined in Diagrams.TwoD.Text

Methods

def :: FontSizeM n #

Default r => Default (e -> r) 
Instance details

Defined in Data.Default.Class

Methods

def :: e -> r #

(Default a, Default b) => Default (a, b) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b) #

(PlotValue x, PlotValue y) => Default (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: Layout x y #

Default (PlotAnnotation x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

def :: PlotAnnotation x y #

BarsPlotValue y => Default (PlotBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

def :: PlotBars x y #

Default (PlotCandle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

def :: PlotCandle x y #

Default (PlotErrBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

def :: PlotErrBars x y #

Default (PlotFillBetween x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

def :: PlotFillBetween x y #

Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

Default (PlotLines x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

def :: PlotLines x y #

Default (PlotPoints x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

def :: PlotPoints x y #

Default (PlotVectors x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: PlotVectors x y #

(Typeable n, Floating n) => Default (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: GridLines v n #

(Typeable n, Floating n) => Default (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MajorGridLines v n #

(Typeable n, Floating n) => Default (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MinorGridLines v n #

TypeableFloat n => Default (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MajorTicks v n #

TypeableFloat n => Default (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MinorTicks v n #

TypeableFloat n => Default (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: Ticks v n #

(TypeableFloat n, Renderable (Text n) b) => Default (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

def :: Legend b n #

Typeable n => Default (AxisLine v n) 
Instance details

Defined in Plots.Axis.Line

Methods

def :: AxisLine v n #

(Default a, Default b, Default c) => Default (a, b, c) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c) #

(PlotValue x, PlotValue y1, PlotValue y2) => Default (LayoutLR x y1 y2) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutLR x y1 y2 #

Default (AreaSpots z x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots z x y #

(TypeableFloat n, Renderable (Text n) b) => Default (SingleAxis b V2 n) 
Instance details

Defined in Plots.Axis

Methods

def :: SingleAxis b V2 n #

(TypeableFloat n, Renderable (Text n) b) => Default (AxisLabel b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: AxisLabel b V2 n #

(TypeableFloat n, Renderable (Text n) b) => Default (TickLabels b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: TickLabels b V2 n #

(Renderable (Text n) b, TypeableFloat n) => Default (Title b V2 n) 
Instance details

Defined in Plots.Axis.Title

Methods

def :: Title b V2 n #

Default (LegendPic b v n) 
Instance details

Defined in Plots.Types

Methods

def :: LegendPic b v n #

(Additive v, Num n) => Default (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotMods b v n #

(Additive v, Num n) => Default (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotOptions b v n #

(Default a, Default b, Default c, Default d) => Default (a, b, c, d) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d) #

Default (AreaSpots4D z t x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots4D z t x y #

(Default a, Default b, Default c, Default d, Default e) => Default (a, b, c, d, e) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e) #

(Default a, Default b, Default c, Default d, Default e, Default f) => Default (a, b, c, d, e, f) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e, f) #

(Default a, Default b, Default c, Default d, Default e, Default f, Default g) => Default (a, b, c, d, e, f, g) 
Instance details

Defined in Data.Default.Class

Methods

def :: (a, b, c, d, e, f, g) #

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

Formally, the class Profunctor represents a profunctor + from Hask -> Hask.

Intuitively it is a bifunctor where the first argument is contravariant + and the second argument is covariant.

You can define a Profunctor by either defining dimap or by defining both + lmap and rmap.

If you supply dimap, you should ensure that:

dimap id id ≡ id

If you supply lmap and rmap, ensure:

lmap id ≡ id
+rmap id ≡ id
+

If you supply both, you should also ensure:

dimap f g ≡ lmap f . rmap g

These ensure by parametricity:

dimap (f . g) (h . i) ≡ dimap g h . dimap f i
+lmap (f . g) ≡ lmap g . lmap f
+rmap (f . g) ≡ rmap f . rmap g
+

Minimal complete definition

dimap | lmap, rmap

Methods

dimap :: (a -> b) -> (c -> d) -> p b c -> p a d #

Map over both arguments at the same time.

dimap f g ≡ lmap f . rmap g

lmap :: (a -> b) -> p b c -> p a c #

Map the first argument contravariantly.

lmap f ≡ dimap f id

rmap :: (b -> c) -> p a b -> p a c #

Map the second argument covariantly.

rmap ≡ dimap id
Instances
Profunctor Measured 
Instance details

Defined in Diagrams.Core.Measure

Methods

dimap :: (a -> b) -> (c -> d) -> Measured b c -> Measured a d #

lmap :: (a -> b) -> Measured b c -> Measured a c #

rmap :: (b -> c) -> Measured a b -> Measured a c #

(#.) :: Coercible c b => q b c -> Measured a b -> Measured a c #

(.#) :: Coercible b a => Measured b c -> q a b -> Measured a c #

Profunctor ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d #

lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c #

rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c #

(#.) :: Coercible c b => q b c -> ReifiedFold a b -> ReifiedFold a c #

(.#) :: Coercible b a => ReifiedFold b c -> q a b -> ReifiedFold a c #

Profunctor ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d #

lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c #

rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c #

(#.) :: Coercible c b => q b c -> ReifiedGetter a b -> ReifiedGetter a c #

(.#) :: Coercible b a => ReifiedGetter b c -> q a b -> ReifiedGetter a c #

Monad m => Profunctor (Kleisli m) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Kleisli m b c -> Kleisli m a d #

lmap :: (a -> b) -> Kleisli m b c -> Kleisli m a c #

rmap :: (b -> c) -> Kleisli m a b -> Kleisli m a c #

(#.) :: Coercible c b => q b c -> Kleisli m a b -> Kleisli m a c #

(.#) :: Coercible b a => Kleisli m b c -> q a b -> Kleisli m a c #

Profunctor p => Profunctor (TambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> TambaraSum p b c -> TambaraSum p a d #

lmap :: (a -> b) -> TambaraSum p b c -> TambaraSum p a c #

rmap :: (b -> c) -> TambaraSum p a b -> TambaraSum p a c #

(#.) :: Coercible c b => q b c -> TambaraSum p a b -> TambaraSum p a c #

(.#) :: Coercible b a => TambaraSum p b c -> q a b -> TambaraSum p a c #

Profunctor (PastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> PastroSum p b c -> PastroSum p a d #

lmap :: (a -> b) -> PastroSum p b c -> PastroSum p a c #

rmap :: (b -> c) -> PastroSum p a b -> PastroSum p a c #

(#.) :: Coercible c b => q b c -> PastroSum p a b -> PastroSum p a c #

(.#) :: Coercible b a => PastroSum p b c -> q a b -> PastroSum p a c #

Profunctor (CotambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> CotambaraSum p b c -> CotambaraSum p a d #

lmap :: (a -> b) -> CotambaraSum p b c -> CotambaraSum p a c #

rmap :: (b -> c) -> CotambaraSum p a b -> CotambaraSum p a c #

(#.) :: Coercible c b => q b c -> CotambaraSum p a b -> CotambaraSum p a c #

(.#) :: Coercible b a => CotambaraSum p b c -> q a b -> CotambaraSum p a c #

Profunctor (CopastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

dimap :: (a -> b) -> (c -> d) -> CopastroSum p b c -> CopastroSum p a d #

lmap :: (a -> b) -> CopastroSum p b c -> CopastroSum p a c #

rmap :: (b -> c) -> CopastroSum p a b -> CopastroSum p a c #

(#.) :: Coercible c b => q b c -> CopastroSum p a b -> CopastroSum p a c #

(.#) :: Coercible b a => CopastroSum p b c -> q a b -> CopastroSum p a c #

Profunctor p => Profunctor (Tambara p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Tambara p b c -> Tambara p a d #

lmap :: (a -> b) -> Tambara p b c -> Tambara p a c #

rmap :: (b -> c) -> Tambara p a b -> Tambara p a c #

(#.) :: Coercible c b => q b c -> Tambara p a b -> Tambara p a c #

(.#) :: Coercible b a => Tambara p b c -> q a b -> Tambara p a c #

Profunctor (Pastro p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Pastro p b c -> Pastro p a d #

lmap :: (a -> b) -> Pastro p b c -> Pastro p a c #

rmap :: (b -> c) -> Pastro p a b -> Pastro p a c #

(#.) :: Coercible c b => q b c -> Pastro p a b -> Pastro p a c #

(.#) :: Coercible b a => Pastro p b c -> q a b -> Pastro p a c #

Profunctor (Cotambara p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Cotambara p b c -> Cotambara p a d #

lmap :: (a -> b) -> Cotambara p b c -> Cotambara p a c #

rmap :: (b -> c) -> Cotambara p a b -> Cotambara p a c #

(#.) :: Coercible c b => q b c -> Cotambara p a b -> Cotambara p a c #

(.#) :: Coercible b a => Cotambara p b c -> q a b -> Cotambara p a c #

Profunctor (Copastro p) 
Instance details

Defined in Data.Profunctor.Strong

Methods

dimap :: (a -> b) -> (c -> d) -> Copastro p b c -> Copastro p a d #

lmap :: (a -> b) -> Copastro p b c -> Copastro p a c #

rmap :: (b -> c) -> Copastro p a b -> Copastro p a c #

(#.) :: Coercible c b => q b c -> Copastro p a b -> Copastro p a c #

(.#) :: Coercible b a => Copastro p b c -> q a b -> Copastro p a c #

Functor f => Profunctor (Star f) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Star f b c -> Star f a d #

lmap :: (a -> b) -> Star f b c -> Star f a c #

rmap :: (b -> c) -> Star f a b -> Star f a c #

(#.) :: Coercible c b => q b c -> Star f a b -> Star f a c #

(.#) :: Coercible b a => Star f b c -> q a b -> Star f a c #

Functor f => Profunctor (Costar f) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Costar f b c -> Costar f a d #

lmap :: (a -> b) -> Costar f b c -> Costar f a c #

rmap :: (b -> c) -> Costar f a b -> Costar f a c #

(#.) :: Coercible c b => q b c -> Costar f a b -> Costar f a c #

(.#) :: Coercible b a => Costar f b c -> q a b -> Costar f a c #

Arrow p => Profunctor (WrappedArrow p) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> WrappedArrow p b c -> WrappedArrow p a d #

lmap :: (a -> b) -> WrappedArrow p b c -> WrappedArrow p a c #

rmap :: (b -> c) -> WrappedArrow p a b -> WrappedArrow p a c #

(#.) :: Coercible c b => q b c -> WrappedArrow p a b -> WrappedArrow p a c #

(.#) :: Coercible b a => WrappedArrow p b c -> q a b -> WrappedArrow p a c #

Profunctor (Forget r) 
Instance details

Defined in Data.Profunctor.Types

Methods

dimap :: (a -> b) -> (c -> d) -> Forget r b c -> Forget r a d #

lmap :: (a -> b) -> Forget r b c -> Forget r a c #

rmap :: (b -> c) -> Forget r a b -> Forget r a c #

(#.) :: Coercible c b => q b c -> Forget r a b -> Forget r a c #

(.#) :: Coercible b a => Forget r b c -> q a b -> Forget r a c #

Profunctor (Tagged :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Tagged b c -> Tagged a d #

lmap :: (a -> b) -> Tagged b c -> Tagged a c #

rmap :: (b -> c) -> Tagged a b -> Tagged a c #

(#.) :: Coercible c b => q b c -> Tagged a b -> Tagged a c #

(.#) :: Coercible b a => Tagged b c -> q a b -> Tagged a c #

Functor v => Profunctor (Query v) 
Instance details

Defined in Diagrams.Core.Query

Methods

dimap :: (a -> b) -> (c -> d) -> Query v b c -> Query v a d #

lmap :: (a -> b) -> Query v b c -> Query v a c #

rmap :: (b -> c) -> Query v a b -> Query v a c #

(#.) :: Coercible c b => q b c -> Query v a b -> Query v a c #

(.#) :: Coercible b a => Query v b c -> q a b -> Query v a c #

Profunctor (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d #

lmap :: (a -> b) -> Indexed i b c -> Indexed i a c #

rmap :: (b -> c) -> Indexed i a b -> Indexed i a c #

(#.) :: Coercible c b => q b c -> Indexed i a b -> Indexed i a c #

(.#) :: Coercible b a => Indexed i b c -> q a b -> Indexed i a c #

Profunctor (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d #

lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c #

rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(#.) :: Coercible c b => q b c -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(.#) :: Coercible b a => ReifiedIndexedFold i b c -> q a b -> ReifiedIndexedFold i a c #

Profunctor (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d #

lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c #

rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(#.) :: Coercible c b => q b c -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(.#) :: Coercible b a => ReifiedIndexedGetter i b c -> q a b -> ReifiedIndexedGetter i a c #

Profunctor ((->) :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> (b -> c) -> a -> d #

lmap :: (a -> b) -> (b -> c) -> a -> c #

rmap :: (b -> c) -> (a -> b) -> a -> c #

(#.) :: Coercible c b => q b c -> (a -> b) -> a -> c #

(.#) :: Coercible b a => (b -> c) -> q a b -> a -> c #

Functor w => Profunctor (Cokleisli w) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Cokleisli w b c -> Cokleisli w a d #

lmap :: (a -> b) -> Cokleisli w b c -> Cokleisli w a c #

rmap :: (b -> c) -> Cokleisli w a b -> Cokleisli w a c #

(#.) :: Coercible c b => q b c -> Cokleisli w a b -> Cokleisli w a c #

(.#) :: Coercible b a => Cokleisli w b c -> q a b -> Cokleisli w a c #

(Profunctor p, Profunctor q) => Profunctor (Procompose p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

dimap :: (a -> b) -> (c -> d) -> Procompose p q b c -> Procompose p q a d #

lmap :: (a -> b) -> Procompose p q b c -> Procompose p q a c #

rmap :: (b -> c) -> Procompose p q a b -> Procompose p q a c #

(#.) :: Coercible c b => q0 b c -> Procompose p q a b -> Procompose p q a c #

(.#) :: Coercible b a => Procompose p q b c -> q0 a b -> Procompose p q a c #

(Profunctor p, Profunctor q) => Profunctor (Rift p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

dimap :: (a -> b) -> (c -> d) -> Rift p q b c -> Rift p q a d #

lmap :: (a -> b) -> Rift p q b c -> Rift p q a c #

rmap :: (b -> c) -> Rift p q a b -> Rift p q a c #

(#.) :: Coercible c b => q0 b c -> Rift p q a b -> Rift p q a c #

(.#) :: Coercible b a => Rift p q b c -> q0 a b -> Rift p q a c #

Profunctor (Exchange a b) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

dimap :: (a0 -> b0) -> (c -> d) -> Exchange a b b0 c -> Exchange a b a0 d #

lmap :: (a0 -> b0) -> Exchange a b b0 c -> Exchange a b a0 c #

rmap :: (b0 -> c) -> Exchange a b a0 b0 -> Exchange a b a0 c #

(#.) :: Coercible c b0 => q b0 c -> Exchange a b a0 b0 -> Exchange a b a0 c #

(.#) :: Coercible b0 a0 => Exchange a b b0 c -> q a0 b0 -> Exchange a b a0 c #

Functor f => Profunctor (Joker f :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Joker f b c -> Joker f a d #

lmap :: (a -> b) -> Joker f b c -> Joker f a c #

rmap :: (b -> c) -> Joker f a b -> Joker f a c #

(#.) :: Coercible c b => q b c -> Joker f a b -> Joker f a c #

(.#) :: Coercible b a => Joker f b c -> q a b -> Joker f a c #

Contravariant f => Profunctor (Clown f :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Clown f b c -> Clown f a d #

lmap :: (a -> b) -> Clown f b c -> Clown f a c #

rmap :: (b -> c) -> Clown f a b -> Clown f a c #

(#.) :: Coercible c b => q b c -> Clown f a b -> Clown f a c #

(.#) :: Coercible b a => Clown f b c -> q a b -> Clown f a c #

(Profunctor p, Profunctor q) => Profunctor (Sum p q) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Sum p q b c -> Sum p q a d #

lmap :: (a -> b) -> Sum p q b c -> Sum p q a c #

rmap :: (b -> c) -> Sum p q a b -> Sum p q a c #

(#.) :: Coercible c b => q0 b c -> Sum p q a b -> Sum p q a c #

(.#) :: Coercible b a => Sum p q b c -> q0 a b -> Sum p q a c #

(Profunctor p, Profunctor q) => Profunctor (Product p q) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Product p q b c -> Product p q a d #

lmap :: (a -> b) -> Product p q b c -> Product p q a c #

rmap :: (b -> c) -> Product p q a b -> Product p q a c #

(#.) :: Coercible c b => q0 b c -> Product p q a b -> Product p q a c #

(.#) :: Coercible b a => Product p q b c -> q0 a b -> Product p q a c #

(Functor f, Profunctor p) => Profunctor (Tannen f p) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Tannen f p b c -> Tannen f p a d #

lmap :: (a -> b) -> Tannen f p b c -> Tannen f p a c #

rmap :: (b -> c) -> Tannen f p a b -> Tannen f p a c #

(#.) :: Coercible c b => q b c -> Tannen f p a b -> Tannen f p a c #

(.#) :: Coercible b a => Tannen f p b c -> q a b -> Tannen f p a c #

(Profunctor p, Functor f, Functor g) => Profunctor (Biff p f g) 
Instance details

Defined in Data.Profunctor.Unsafe

Methods

dimap :: (a -> b) -> (c -> d) -> Biff p f g b c -> Biff p f g a d #

lmap :: (a -> b) -> Biff p f g b c -> Biff p f g a c #

rmap :: (b -> c) -> Biff p f g a b -> Biff p f g a c #

(#.) :: Coercible c b => q b c -> Biff p f g a b -> Biff p f g a c #

(.#) :: Coercible b a => Biff p f g b c -> q a b -> Biff p f g a c #

class Profunctor p => Choice (p :: Type -> Type -> Type) where #

The generalization of Costar of Functor that is strong with respect + to Either.

Note: This is also a notion of strength, except with regards to another monoidal + structure that we can choose to equip Hask with: the cocartesian coproduct.

Minimal complete definition

left' | right'

Methods

left' :: p a b -> p (Either a c) (Either b c) #

Laws:

left' ≡ dimap swapE swapE . right' where
+  swapE :: Either a b -> Either b a
+  swapE = either Right Left
+rmap Left ≡ lmap Left . left'
+lmap (right f) . left' ≡ rmap (right f) . left'
+left' . left' ≡ dimap assocE unassocE . left' where
+  assocE :: Either (Either a b) c -> Either a (Either b c)
+  assocE (Left (Left a)) = Left a
+  assocE (Left (Right b)) = Right (Left b)
+  assocE (Right c) = Right (Right c)
+  unassocE :: Either a (Either b c) -> Either (Either a b) c
+  unassocE (Left a) = Left (Left a)
+  unassocE (Right (Left b) = Left (Right b)
+  unassocE (Right (Right c)) = Right c)
+

right' :: p a b -> p (Either c a) (Either c b) #

Laws:

right' ≡ dimap swapE swapE . left' where
+  swapE :: Either a b -> Either b a
+  swapE = either Right Left
+rmap Right ≡ lmap Right . right'
+lmap (left f) . right' ≡ rmap (left f) . right'
+right' . right' ≡ dimap unassocE assocE . right' where
+  assocE :: Either (Either a b) c -> Either a (Either b c)
+  assocE (Left (Left a)) = Left a
+  assocE (Left (Right b)) = Right (Left b)
+  assocE (Right c) = Right (Right c)
+  unassocE :: Either a (Either b c) -> Either (Either a b) c
+  unassocE (Left a) = Left (Left a)
+  unassocE (Right (Left b) = Left (Right b)
+  unassocE (Right (Right c)) = Right c)
+
Instances
Choice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) #

right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #

Choice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) #

right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #

Monad m => Choice (Kleisli m) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Kleisli m a b -> Kleisli m (Either a c) (Either b c) #

right' :: Kleisli m a b -> Kleisli m (Either c a) (Either c b) #

Profunctor p => Choice (TambaraSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: TambaraSum p a b -> TambaraSum p (Either a c) (Either b c) #

right' :: TambaraSum p a b -> TambaraSum p (Either c a) (Either c b) #

Choice (PastroSum p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: PastroSum p a b -> PastroSum p (Either a c) (Either b c) #

right' :: PastroSum p a b -> PastroSum p (Either c a) (Either c b) #

Choice p => Choice (Tambara p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tambara p a b -> Tambara p (Either a c) (Either b c) #

right' :: Tambara p a b -> Tambara p (Either c a) (Either c b) #

Applicative f => Choice (Star f) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Star f a b -> Star f (Either a c) (Either b c) #

right' :: Star f a b -> Star f (Either c a) (Either c b) #

Traversable w => Choice (Costar w) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Costar w a b -> Costar w (Either a c) (Either b c) #

right' :: Costar w a b -> Costar w (Either c a) (Either c b) #

ArrowChoice p => Choice (WrappedArrow p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: WrappedArrow p a b -> WrappedArrow p (Either a c) (Either b c) #

right' :: WrappedArrow p a b -> WrappedArrow p (Either c a) (Either c b) #

Monoid r => Choice (Forget r) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Forget r a b -> Forget r (Either a c) (Either b c) #

right' :: Forget r a b -> Forget r (Either c a) (Either c b) #

Choice (Tagged :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tagged a b -> Tagged (Either a c) (Either b c) #

right' :: Tagged a b -> Tagged (Either c a) (Either c b) #

Choice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) #

right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #

Choice ((->) :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: (a -> b) -> Either a c -> Either b c #

right' :: (a -> b) -> Either c a -> Either c b #

Comonad w => Choice (Cokleisli w)

extract approximates costrength

Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Cokleisli w a b -> Cokleisli w (Either a c) (Either b c) #

right' :: Cokleisli w a b -> Cokleisli w (Either c a) (Either c b) #

(Choice p, Choice q) => Choice (Procompose p q) 
Instance details

Defined in Data.Profunctor.Composition

Methods

left' :: Procompose p q a b -> Procompose p q (Either a c) (Either b c) #

right' :: Procompose p q a b -> Procompose p q (Either c a) (Either c b) #

Functor f => Choice (Joker f :: Type -> Type -> Type) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Joker f a b -> Joker f (Either a c) (Either b c) #

right' :: Joker f a b -> Joker f (Either c a) (Either c b) #

(Choice p, Choice q) => Choice (Product p q) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Product p q a b -> Product p q (Either a c) (Either b c) #

right' :: Product p q a b -> Product p q (Either c a) (Either c b) #

(Functor f, Choice p) => Choice (Tannen f p) 
Instance details

Defined in Data.Profunctor.Choice

Methods

left' :: Tannen f p a b -> Tannen f p (Either a c) (Either b c) #

right' :: Tannen f p a b -> Tannen f p (Either c a) (Either c b) #

sequenceBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> t (f a) -> f (t a) #

Sequence a container using its Traversable instance using + explicitly provided Applicative operations. This is like sequence + where the Applicative instance can be manually specified.

traverseBy :: Traversable t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> t a -> f (t b) #

Traverse a container using its Traversable instance using + explicitly provided Applicative operations. This is like traverse + where the Applicative instance can be manually specified.

foldMapBy :: Foldable t => (r -> r -> r) -> r -> (a -> r) -> t a -> r #

Fold a value using its Foldable instance using + explicitly provided Monoid operations. This is like foldMap + where the Monoid instance can be manually specified.

foldMapBy mappend mempty ≡ foldMap
+
>>> foldMapBy (+) 0 length ["hello","world"]
+10
+

foldBy :: Foldable t => (a -> a -> a) -> a -> t a -> a #

Fold a value using its Foldable instance using + explicitly provided Monoid operations. This is like fold + where the Monoid instance can be manually specified.

foldBy mappend mempty ≡ fold
+
>>> foldBy (++) [] ["hello","world"]
+"helloworld"
+

class (Foldable1 t, Traversable t) => Traversable1 (t :: Type -> Type) where #

Minimal complete definition

traverse1 | sequence1

Methods

traverse1 :: Apply f => (a -> f b) -> t a -> f (t b) #

Instances
Traversable1 Par1 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Par1 a -> f (Par1 b) #

sequence1 :: Apply f => Par1 (f b) -> f (Par1 b) #

Traversable1 Complex 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Complex a -> f (Complex b) #

sequence1 :: Apply f => Complex (f b) -> f (Complex b) #

Traversable1 Min 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Min a -> f (Min b) #

sequence1 :: Apply f => Min (f b) -> f (Min b) #

Traversable1 Max 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Max a -> f (Max b) #

sequence1 :: Apply f => Max (f b) -> f (Max b) #

Traversable1 First 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> First a -> f (First b) #

sequence1 :: Apply f => First (f b) -> f (First b) #

Traversable1 Last 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Last a -> f (Last b) #

sequence1 :: Apply f => Last (f b) -> f (Last b) #

Traversable1 Identity 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Identity a -> f (Identity b) #

sequence1 :: Apply f => Identity (f b) -> f (Identity b) #

Traversable1 Dual 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Dual a -> f (Dual b) #

sequence1 :: Apply f => Dual (f b) -> f (Dual b) #

Traversable1 Sum 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Sum a -> f (Sum b) #

sequence1 :: Apply f => Sum (f b) -> f (Sum b) #

Traversable1 Product 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Product a -> f (Product b) #

sequence1 :: Apply f => Product (f b) -> f (Product b) #

Traversable1 NonEmpty 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) #

sequence1 :: Apply f => NonEmpty (f b) -> f (NonEmpty b) #

Traversable1 Tree 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Tree a -> f (Tree b) #

sequence1 :: Apply f => Tree (f b) -> f (Tree b) #

Traversable1 Log 
Instance details

Defined in Numeric.Log

Methods

traverse1 :: Apply f => (a -> f b) -> Log a -> f (Log b) #

sequence1 :: Apply f => Log (f b) -> f (Log b) #

Traversable1 V2 
Instance details

Defined in Linear.V2

Methods

traverse1 :: Apply f => (a -> f b) -> V2 a -> f (V2 b) #

sequence1 :: Apply f => V2 (f b) -> f (V2 b) #

Traversable1 V3 
Instance details

Defined in Linear.V3

Methods

traverse1 :: Apply f => (a -> f b) -> V3 a -> f (V3 b) #

sequence1 :: Apply f => V3 (f b) -> f (V3 b) #

Traversable1 V1 
Instance details

Defined in Linear.V1

Methods

traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) #

sequence1 :: Apply f => V1 (f b) -> f (V1 b) #

Traversable1 Plucker 
Instance details

Defined in Linear.Plucker

Methods

traverse1 :: Apply f => (a -> f b) -> Plucker a -> f (Plucker b) #

sequence1 :: Apply f => Plucker (f b) -> f (Plucker b) #

Traversable1 V4 
Instance details

Defined in Linear.V4

Methods

traverse1 :: Apply f => (a -> f b) -> V4 a -> f (V4 b) #

sequence1 :: Apply f => V4 (f b) -> f (V4 b) #

Traversable1 (V1 :: Type -> Type) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> V1 a -> f (V1 b) #

sequence1 :: Apply f => V1 (f b) -> f (V1 b) #

Traversable1 ((,) a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequence1 :: Apply f => (a, f b) -> f (a, b) #

Traversable1 f => Traversable1 (Lift f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Lift f a -> f0 (Lift f b) #

sequence1 :: Apply f0 => Lift f (f0 b) -> f0 (Lift f b) #

Traversable1 f => Traversable1 (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequence1 :: Apply f0 => Cofree f (f0 b) -> f0 (Cofree f b) #

Traversable1 f => Traversable1 (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequence1 :: Apply f0 => Free f (f0 b) -> f0 (Free f b) #

Traversable1 f => Traversable1 (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequence1 :: Apply f0 => Yoneda f (f0 b) -> f0 (Yoneda f b) #

Traversable1 f => Traversable1 (Rec1 f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequence1 :: Apply f0 => Rec1 f (f0 b) -> f0 (Rec1 f b) #

Traversable1 f => Traversable1 (Alt f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) #

sequence1 :: Apply f0 => Alt f (f0 b) -> f0 (Alt f b) #

Bitraversable1 p => Traversable1 (Join p) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a -> f b) -> Join p a -> f (Join p b) #

sequence1 :: Apply f => Join p (f b) -> f (Join p b) #

Traversable1 f => Traversable1 (IdentityT f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequence1 :: Apply f0 => IdentityT f (f0 b) -> f0 (IdentityT f b) #

Traversable1 (Tagged a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> Tagged a a0 -> f (Tagged a b) #

sequence1 :: Apply f => Tagged a (f b) -> f (Tagged a b) #

Traversable1 f => Traversable1 (Reverse f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Reverse f a -> f0 (Reverse f b) #

sequence1 :: Apply f0 => Reverse f (f0 b) -> f0 (Reverse f b) #

Traversable1 f => Traversable1 (Backwards f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequence1 :: Apply f0 => Backwards f (f0 b) -> f0 (Backwards f b) #

Traversable1 f => Traversable1 (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse1 :: Apply f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequence1 :: Apply f0 => AlongsideLeft f b (f0 b0) -> f0 (AlongsideLeft f b b0) #

Traversable1 f => Traversable1 (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse1 :: Apply f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequence1 :: Apply f0 => AlongsideRight f a (f0 b) -> f0 (AlongsideRight f a b) #

(Traversable1 f, Traversable1 g) => Traversable1 (f :+: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequence1 :: Apply f0 => (f :+: g) (f0 b) -> f0 ((f :+: g) b) #

(Traversable1 f, Traversable1 g) => Traversable1 (f :*: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequence1 :: Apply f0 => (f :*: g) (f0 b) -> f0 ((f :*: g) b) #

(Traversable1 f, Traversable1 g) => Traversable1 (Product f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequence1 :: Apply f0 => Product f g (f0 b) -> f0 (Product f g b) #

(Traversable1 f, Traversable1 g) => Traversable1 (Sum f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequence1 :: Apply f0 => Sum f g (f0 b) -> f0 (Sum f g b) #

Traversable1 f => Traversable1 (M1 i c f) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequence1 :: Apply f0 => M1 i c f (f0 b) -> f0 (M1 i c f b) #

(Traversable1 f, Traversable1 g) => Traversable1 (f :.: g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequence1 :: Apply f0 => (f :.: g) (f0 b) -> f0 ((f :.: g) b) #

(Traversable1 f, Traversable1 g) => Traversable1 (Compose f g) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequence1 :: Apply f0 => Compose f g (f0 b) -> f0 (Compose f g b) #

Traversable1 g => Traversable1 (Joker g a) 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

traverse1 :: Apply f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequence1 :: Apply f => Joker g a (f b) -> f (Joker g a b) #

class AsEmpty a where #

Minimal complete definition

Nothing

Methods

_Empty :: Prism' a () #

Instances
AsEmpty Ordering 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Ordering () #

AsEmpty () 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' () () #

AsEmpty ByteString 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' ByteString () #

AsEmpty ByteString 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' ByteString () #

AsEmpty Text 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Text () #

AsEmpty Text 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Text () #

AsEmpty Event 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Event () #

AsEmpty All 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' All () #

AsEmpty Any 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Any () #

AsEmpty IntSet 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' IntSet () #

AsEmpty [a] 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' [a] () #

AsEmpty (Maybe a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Maybe a) () #

Storable a => AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

AsEmpty (ZipList a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (ZipList a) () #

AsEmpty (First a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (First a) () #

AsEmpty (Last a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Last a) () #

AsEmpty a => AsEmpty (Dual a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Dual a) () #

(Eq a, Num a) => AsEmpty (Sum a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Sum a) () #

(Eq a, Num a) => AsEmpty (Product a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Product a) () #

AsEmpty (IntMap a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (IntMap a) () #

AsEmpty (Seq a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Seq a) () #

AsEmpty (Set a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Set a) () #

AsEmpty (HashSet a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (HashSet a) () #

Unbox a => AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

AsEmpty (Vector a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Vector a) () #

AsEmpty (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

_Empty :: Prism' (Clip n) () #

(AsEmpty a, AsEmpty b) => AsEmpty (a, b) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (a, b) () #

AsEmpty (HashMap k a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (HashMap k a) () #

AsEmpty (Map k a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Map k a) () #

AsEmpty (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

_Empty :: Prism' (Path v n) () #

(Metric v, OrderedField n) => AsEmpty (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

_Empty :: Prism' (Trail v n) () #

AsEmpty (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

_Empty :: Prism' (BoundingBox v n) () #

(AsEmpty a, AsEmpty b, AsEmpty c) => AsEmpty (a, b, c) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (a, b, c) () #

(Metric v, OrderedField n) => AsEmpty (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

_Empty :: Prism' (Trail' Line v n) () #

type Prism' s a = Prism s s a a #

class Cons s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_Cons :: Prism s t (a, s) (b, t) #

Instances
Cons ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #

Cons ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism ByteString ByteString (Word8, ByteString) (Word8, ByteString) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons [a] [b] a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism [a] [b] (a, [a]) (b, [b]) #

(Storable a, Storable b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

Cons (ZipList a) (ZipList b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (ZipList a) (ZipList b) (a, ZipList a) (b, ZipList b) #

Cons (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Seq a) (Seq b) (a, Seq a) (b, Seq b) #

(Unbox a, Unbox b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

(Prim a, Prim b) => Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

Cons (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism (Vector a) (Vector b) (a, Vector a) (b, Vector b) #

Cons (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

_Cons :: Prism (Path v n) (Path v' n') (Located (Trail v n), Path v n) (Located (Trail v' n'), Path v' n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Cons :: Prism (SegTree v n) (SegTree u n') (Segment Closed v n, SegTree v n) (Segment Closed u n', SegTree u n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Cons (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Cons :: Prism (Trail' Line v n) (Trail' Line u n') (Segment Closed v n, Trail' Line v n) (Segment Closed u n', Trail' Line u n') #

type Prism s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Applicative f) => p a (f b) -> p s (f t) #

class Each s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

each :: Traversal s t a b #

Instances
(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal ByteString ByteString a b #

(a ~ Word8, b ~ Word8) => Each ByteString ByteString a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal ByteString ByteString a b #

(a ~ Char, b ~ Char) => Each Text Text a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal Text Text a b #

(a ~ Char, b ~ Char) => Each Text Text a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal Text Text a b #

Each Name Name AName AName 
Instance details

Defined in Diagrams.Core.Names

Methods

each :: Traversal Name Name AName AName #

Each ColourMap ColourMap (Colour Double) (Colour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (Colour Double) (Colour Double) #

Each [a] [b] a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal [a] [b] a b #

Each (Maybe a) (Maybe b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Maybe a) (Maybe b) a b #

(Storable a, Storable b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (Complex a) (Complex b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Complex a) (Complex b) a b #

Each (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Identity a) (Identity b) a b #

Each (NonEmpty a) (NonEmpty b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (NonEmpty a) (NonEmpty b) a b #

Each (IntMap a) (IntMap b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (IntMap a) (IntMap b) a b #

Each (Tree a) (Tree b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Tree a) (Tree b) a b #

Each (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Seq a) (Seq b) a b #

(Unbox a, Unbox b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

(Prim a, Prim b) => Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Vector a) (Vector b) a b #

Each (V2 a) (V2 b) a b 
Instance details

Defined in Linear.V2

Methods

each :: Traversal (V2 a) (V2 b) a b #

Each (V3 a) (V3 b) a b 
Instance details

Defined in Linear.V3

Methods

each :: Traversal (V3 a) (V3 b) a b #

Each (V1 a) (V1 b) a b 
Instance details

Defined in Linear.V1

Methods

each :: Traversal (V1 a) (V1 b) a b #

Each (Plucker a) (Plucker b) a b 
Instance details

Defined in Linear.Plucker

Methods

each :: Traversal (Plucker a) (Plucker b) a b #

Each (Quaternion a) (Quaternion b) a b 
Instance details

Defined in Linear.Quaternion

Methods

each :: Traversal (Quaternion a) (Quaternion b) a b #

Each (V0 a) (V0 b) a b 
Instance details

Defined in Linear.V0

Methods

each :: Traversal (V0 a) (V0 b) a b #

Each (V4 a) (V4 b) a b 
Instance details

Defined in Linear.V4

Methods

each :: Traversal (V4 a) (V4 b) a b #

(a ~ a', b ~ b') => Each (a, a') (b, b') a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a') (b, b') a b #

c ~ d => Each (HashMap c a) (HashMap d b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (HashMap c a) (HashMap d b) a b #

c ~ d => Each (Map c a) (Map d b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Map c a) (Map d b) a b #

(Ix i, IArray UArray a, IArray UArray b, i ~ j) => Each (UArray i a) (UArray j b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (UArray i a) (UArray j b) a b #

(Ix i, i ~ j) => Each (Array i a) (Array j b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Array i a) (Array j b) a b #

Traversable f => Each (Point f a) (Point f b) a b 
Instance details

Defined in Linear.Affine

Methods

each :: Traversal (Point f a) (Point f b) a b #

Each (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

each :: Traversal (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) #

Each (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') 
Instance details

Defined in Diagrams.Core.Style

Methods

each :: Traversal (Style v n) (Style v' n') (Attribute v n) (Attribute v' n') #

Each (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (FixedSegment v n) (FixedSegment v' n') (Point v n) (Point v' n') #

(Additive v', Foldable v', Ord n') => Each (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') 
Instance details

Defined in Diagrams.BoundingBox

Methods

each :: Traversal (BoundingBox v n) (BoundingBox v' n') (Point v n) (Point v' n') #

(a ~ a2, a ~ a3, b ~ b2, b ~ b3) => Each (a, a2, a3) (b, b2, b3) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3) (b, b2, b3) a b #

Each (V n a) (V n b) a b 
Instance details

Defined in Linear.V

Methods

each :: Traversal (V n a) (V n b) a b #

Each (Segment c v n) (Segment c v' n') (v n) (v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (Segment c v n) (Segment c v' n') (v n) (v' n') #

Each (Offset c v n) (Offset c v' n') (v n) (v' n') 
Instance details

Defined in Diagrams.Segment

Methods

each :: Traversal (Offset c v n) (Offset c v' n') (v n) (v' n') #

(a ~ a2, a ~ a3, a ~ a4, b ~ b2, b ~ b3, b ~ b4) => Each (a, a2, a3, a4) (b, b2, b3, b4) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4) (b, b2, b3, b4) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, b ~ b2, b ~ b3, b ~ b4, b ~ b5) => Each (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5) (b, b2, b3, b4, b5) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6) => Each (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6) (b, b2, b3, b4, b5, b6) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7) => Each (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7) (b, b2, b3, b4, b5, b6, b7) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8) => Each (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8) (b, b2, b3, b4, b5, b6, b7, b8) a b #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9, b ~ b2, b ~ b3, b ~ b4, b ~ b5, b ~ b6, b ~ b7, b ~ b8, b ~ b9) => Each (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (a, a2, a3, a4, a5, a6, a7, a8, a9) (b, b2, b3, b4, b5, b6, b7, b8, b9) a b #

type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t #

class Reversing t where #

Methods

reversing :: t -> t #

Instances
Reversing ByteString 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: ByteString -> ByteString #

Reversing ByteString 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: ByteString -> ByteString #

Reversing Text 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Text -> Text #

Reversing Text 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Text -> Text #

Reversing [a] 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: [a] -> [a] #

Storable a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Reversing (NonEmpty a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: NonEmpty a -> NonEmpty a #

Reversing (Seq a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Seq a -> Seq a #

Unbox a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Prim a => Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

Reversing (Vector a) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

reversing :: Vector a -> Vector a #

(Metric v, OrderedField n) => Reversing (Located (Trail v n)) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Located (Trail v n) -> Located (Trail v n) #

(Metric v, OrderedField n) => Reversing (Located (Trail' l v n)) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Located (Trail' l v n) -> Located (Trail' l v n) #

(Metric v, OrderedField n) => Reversing (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

reversing :: Path v n -> Path v n #

(Metric v, OrderedField n) => Reversing (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Trail v n -> Trail v n #

Reversing (FixedSegment v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: FixedSegment v n -> FixedSegment v n #

(Additive v, Num n) => Reversing (Segment Closed v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: Segment Closed v n -> Segment Closed v n #

(Metric v, OrderedField n) => Reversing (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

reversing :: Trail' l v n -> Trail' l v n #

(Additive v, Num n) => Reversing (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

reversing :: Offset c v n -> Offset c v n #

class Wrapped s => Rewrapped s t #

Instances
Rewrapped Fd t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTimer t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CKey t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CId t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFsFilCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFsBlkCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CClockId t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBlkCnt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBlkSize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CRLim t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTcflag t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSpeed t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CCc t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CNlink t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CGid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSsize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CPid t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped COff t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CMode t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIno t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CDev t 
Instance details

Defined in Control.Lens.Wrapped

t ~ PatternMatchFail => Rewrapped PatternMatchFail t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecSelError => Rewrapped RecSelError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecConError => Rewrapped RecConError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RecUpdError => Rewrapped RecUpdError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ NoMethodError => Rewrapped NoMethodError t 
Instance details

Defined in Control.Lens.Wrapped

t ~ TypeError => Rewrapped TypeError t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped Errno t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CompactionFailed => Rewrapped CompactionFailed t 
Instance details

Defined in Control.Lens.Wrapped

t ~ AssertionFailed => Rewrapped AssertionFailed t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ErrorCall => Rewrapped ErrorCall t 
Instance details

Defined in Control.Lens.Wrapped

t ~ All => Rewrapped All t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Any => Rewrapped Any t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUChar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CShort t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUShort t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CInt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUInt t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CULong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CLLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CULLong t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CBool t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CFloat t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CDouble t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CPtrdiff t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSize t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CWchar t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSigAtomic t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CClock t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CTime t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUSeconds t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CSUSeconds t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIntPtr t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUIntPtr t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CIntMax t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped CUIntMax t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IntSet => Rewrapped IntSet t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped Name Name 
Instance details

Defined in Diagrams.Core.Names

Rewrapped SegCount SegCount 
Instance details

Defined in Diagrams.Segment

t ~ Par1 p' => Rewrapped (Par1 p) t 
Instance details

Defined in Control.Lens.Wrapped

(Storable a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Predicate b => Rewrapped (Predicate a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Comparison b => Rewrapped (Comparison a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Equivalence b => Rewrapped (Equivalence a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Min b => Rewrapped (Min a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Max b => Rewrapped (Max a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ First b => Rewrapped (First a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Last b => Rewrapped (Last a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Option b => Rewrapped (Option a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ZipList b => Rewrapped (ZipList a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Identity b => Rewrapped (Identity a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ First b => Rewrapped (First a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Last b => Rewrapped (Last a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Dual b => Rewrapped (Dual a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Endo b => Rewrapped (Endo a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Sum b => Rewrapped (Sum a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Product b => Rewrapped (Product a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Down b => Rewrapped (Down a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ NonEmpty b => Rewrapped (NonEmpty a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IntMap a' => Rewrapped (IntMap a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Seq a' => Rewrapped (Seq a) t 
Instance details

Defined in Control.Lens.Wrapped

(t ~ Set a', Ord a) => Rewrapped (Set a) t 
Instance details

Defined in Control.Lens.Wrapped

(t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t 
Instance details

Defined in Control.Lens.Wrapped

(Unbox a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

(Prim a, t ~ Vector a') => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Vector a' => Rewrapped (Vector a) t 
Instance details

Defined in Control.Lens.Wrapped

Polar a1 ~ t => Rewrapped (Polar a2) t 
Instance details

Defined in Diagrams.Coordinates.Polar

Active a1 ~ t => Rewrapped (Active a2) t 
Instance details

Defined in Data.Active

Time n1 ~ t => Rewrapped (Time n2) t 
Instance details

Defined in Data.Active

Clip n1 ~ t => Rewrapped (Clip n2) t 
Instance details

Defined in Diagrams.TwoD.Path

Duration n1 ~ t => Rewrapped (Duration n2) t 
Instance details

Defined in Data.Active

Rewrapped (TransInv t) (TransInv t') 
Instance details

Defined in Diagrams.Core.Transform

Rewrapped (ArcLength n) (ArcLength n') 
Instance details

Defined in Diagrams.Segment

(t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t 
Instance details

Defined in Control.Lens.Wrapped

(t ~ Map k' a', Ord k) => Rewrapped (Map k a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Op a' b' => Rewrapped (Op a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedMonad m' a' => Rewrapped (WrappedMonad m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ArrowMonad m' a' => Rewrapped (ArrowMonad m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ MaybeT n b => Rewrapped (MaybeT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CatchT m' a' => Rewrapped (CatchT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ListT n b => Rewrapped (ListT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedApplicative f' a' => Rewrapped (WrappedApplicative f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ MaybeApply f' a' => Rewrapped (MaybeApply f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Point g b => Rewrapped (Point f a) t 
Instance details

Defined in Linear.Affine

t ~ Alt f' a' => Rewrapped (Alt f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CoiterT w' a' => Rewrapped (CoiterT w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IterT m' a' => Rewrapped (IterT m a) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (Envelope v n) (Envelope v' n') 
Instance details

Defined in Diagrams.Core.Envelope

Rewrapped (Style v n) (Style v' n') 
Instance details

Defined in Diagrams.Core.Style

Rewrapped (Trace v n) (Trace v' n') 
Instance details

Defined in Diagrams.Core.Trace

Rewrapped (Path v n) (Path v' n') 
Instance details

Defined in Diagrams.Path

Rewrapped (Trail v n) (Trail v' n') 
Instance details

Defined in Diagrams.Trail

Rewrapped (SegTree v n) (SegTree v' n') 
Instance details

Defined in Diagrams.Trail

Rewrapped (TotalOffset v n) (TotalOffset v' n') 
Instance details

Defined in Diagrams.Segment

t ~ Rec1 f' p' => Rewrapped (Rec1 f p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedArrow a' b' c' => Rewrapped (WrappedArrow a b c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Kleisli m' a' b' => Rewrapped (Kleisli m a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Const a' x' => Rewrapped (Const a x) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Ap g b => Rewrapped (Ap f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Alt g b => Rewrapped (Alt f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Join p' a' => Rewrapped (Join p a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Fix p' a' => Rewrapped (Fix p a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ TracedT m' w' a' => Rewrapped (TracedT m w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ IdentityT n b => Rewrapped (IdentityT m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Compose f' g' a' => Rewrapped (Compose f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ComposeFC f' g' a' => Rewrapped (ComposeFC f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ComposeCF f' g' a' => Rewrapped (ComposeCF f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ExceptT e' m' a' => Rewrapped (ExceptT e m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ StateT s' m' a' => Rewrapped (StateT s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ReaderT s n b => Rewrapped (ReaderT r m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ErrorT e' m' a' => Rewrapped (ErrorT e m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ StateT s' m' a' => Rewrapped (StateT s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WriterT w' m' a' => Rewrapped (WriterT w m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Star f' d' c' => Rewrapped (Star f d c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Costar f' d' c' => Rewrapped (Costar f d c) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedArrow p' a' b' => Rewrapped (WrappedArrow p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Forget r' a' b' => Rewrapped (Forget r a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Static f' a' b' => Rewrapped (Static f a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Tagged s' a' => Rewrapped (Tagged s a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Reverse g b => Rewrapped (Reverse f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Constant a' b' => Rewrapped (Constant a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Backwards g b => Rewrapped (Backwards f a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ CofreeT f' w' a' => Rewrapped (CofreeT f w a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ FreeT f' m' a' => Rewrapped (FreeT f m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ApT f' g' a' => Rewrapped (ApT f g a) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (Query v a m) (Query v' a' m') 
Instance details

Defined in Diagrams.Core.Query

Rewrapped (Trail' Line v n) (Trail' Line v' n') 
Instance details

Defined in Diagrams.Trail

t ~ K1 i' c' p' => Rewrapped (K1 i c p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ ContT r' m' a' => Rewrapped (ContT r m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Cayley f' p' a' b' => Rewrapped (Cayley f p a b) t 
Instance details

Defined in Control.Lens.Wrapped

Rewrapped (QDiagram b v n m) (QDiagram b' v' n' m') 
Instance details

Defined in Diagrams.Core.Types

Rewrapped (SubMap b v n m) (SubMap b' v' n' m') 
Instance details

Defined in Diagrams.Core.Types

t ~ M1 i' c' f' p' => Rewrapped (M1 i c f p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ (f' :.: g') p' => Rewrapped ((f :.: g) p) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Compose f' g' a' => Rewrapped (Compose f g a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedBifunctor p' a' b' => Rewrapped (WrappedBifunctor p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Joker g' a' b' => Rewrapped (Joker g a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Flip p' a' b' => Rewrapped (Flip p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Clown f' a' b' => Rewrapped (Clown f a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ RWST r' w' s' m' a' => Rewrapped (RWST r w s m a) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Dual k' a' b' => Rewrapped (Dual k6 a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ WrappedCategory k' a' b' => Rewrapped (WrappedCategory k6 a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Semi m' a' b' => Rewrapped (Semi m a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Tannen f' p' a' b' => Rewrapped (Tannen f p a b) t 
Instance details

Defined in Control.Lens.Wrapped

t ~ Biff p' f' g' a' b' => Rewrapped (Biff p f g a b) t 
Instance details

Defined in Control.Lens.Wrapped

class Snoc s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Methods

_Snoc :: Prism s t (s, a) (t, b) #

Instances
Snoc ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #

Snoc ByteString ByteString Word8 Word8 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism ByteString ByteString (ByteString, Word8) (ByteString, Word8) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc [a] [b] a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism [a] [b] ([a], a) ([b], b) #

(Storable a, Storable b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

Snoc (ZipList a) (ZipList b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (ZipList a) (ZipList b) (ZipList a, a) (ZipList b, b) #

Snoc (Seq a) (Seq b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Seq a) (Seq b) (Seq a, a) (Seq b, b) #

(Unbox a, Unbox b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

(Prim a, Prim b) => Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

Snoc (Vector a) (Vector b) a b 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism (Vector a) (Vector b) (Vector a, a) (Vector b, b) #

Snoc (Path v n) (Path v' n') (Located (Trail v n)) (Located (Trail v' n')) 
Instance details

Defined in Diagrams.Path

Methods

_Snoc :: Prism (Path v n) (Path v' n') (Path v n, Located (Trail v n)) (Path v' n', Located (Trail v' n')) #

(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (SegTree v n) (SegTree u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Snoc :: Prism (SegTree v n) (SegTree u n') (SegTree v n, Segment Closed v n) (SegTree u n', Segment Closed u n') #

(Metric v, OrderedField n, Metric u, OrderedField n') => Snoc (Trail' Line v n) (Trail' Line u n') (Segment Closed v n) (Segment Closed u n') 
Instance details

Defined in Diagrams.Trail

Methods

_Snoc :: Prism (Trail' Line v n) (Trail' Line u n') (Trail' Line v n, Segment Closed v n) (Trail' Line u n', Segment Closed u n') #

class Wrapped s where #

Minimal complete definition

Nothing

Associated Types

type Unwrapped s :: Type #

Methods

_Wrapped' :: Iso' s (Unwrapped s) #

Instances
Wrapped Fd 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Fd :: Type #

Methods

_Wrapped' :: Iso' Fd (Unwrapped Fd) #

Wrapped CTimer 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTimer :: Type #

Methods

_Wrapped' :: Iso' CTimer (Unwrapped CTimer) #

Wrapped CKey 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CKey :: Type #

Methods

_Wrapped' :: Iso' CKey (Unwrapped CKey) #

Wrapped CId 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CId :: Type #

Methods

_Wrapped' :: Iso' CId (Unwrapped CId) #

Wrapped CFsFilCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFsFilCnt :: Type #

Methods

_Wrapped' :: Iso' CFsFilCnt (Unwrapped CFsFilCnt) #

Wrapped CFsBlkCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFsBlkCnt :: Type #

Methods

_Wrapped' :: Iso' CFsBlkCnt (Unwrapped CFsBlkCnt) #

Wrapped CClockId 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CClockId :: Type #

Methods

_Wrapped' :: Iso' CClockId (Unwrapped CClockId) #

Wrapped CBlkCnt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBlkCnt :: Type #

Methods

_Wrapped' :: Iso' CBlkCnt (Unwrapped CBlkCnt) #

Wrapped CBlkSize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBlkSize :: Type #

Methods

_Wrapped' :: Iso' CBlkSize (Unwrapped CBlkSize) #

Wrapped CRLim 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CRLim :: Type #

Methods

_Wrapped' :: Iso' CRLim (Unwrapped CRLim) #

Wrapped CTcflag 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTcflag :: Type #

Methods

_Wrapped' :: Iso' CTcflag (Unwrapped CTcflag) #

Wrapped CSpeed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSpeed :: Type #

Methods

_Wrapped' :: Iso' CSpeed (Unwrapped CSpeed) #

Wrapped CCc 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CCc :: Type #

Methods

_Wrapped' :: Iso' CCc (Unwrapped CCc) #

Wrapped CUid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUid :: Type #

Methods

_Wrapped' :: Iso' CUid (Unwrapped CUid) #

Wrapped CNlink 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CNlink :: Type #

Methods

_Wrapped' :: Iso' CNlink (Unwrapped CNlink) #

Wrapped CGid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CGid :: Type #

Methods

_Wrapped' :: Iso' CGid (Unwrapped CGid) #

Wrapped CSsize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSsize :: Type #

Methods

_Wrapped' :: Iso' CSsize (Unwrapped CSsize) #

Wrapped CPid 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CPid :: Type #

Methods

_Wrapped' :: Iso' CPid (Unwrapped CPid) #

Wrapped COff 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped COff :: Type #

Methods

_Wrapped' :: Iso' COff (Unwrapped COff) #

Wrapped CMode 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CMode :: Type #

Methods

_Wrapped' :: Iso' CMode (Unwrapped CMode) #

Wrapped CIno 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIno :: Type #

Methods

_Wrapped' :: Iso' CIno (Unwrapped CIno) #

Wrapped CDev 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CDev :: Type #

Methods

_Wrapped' :: Iso' CDev (Unwrapped CDev) #

Wrapped PatternMatchFail 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped PatternMatchFail :: Type #

Methods

_Wrapped' :: Iso' PatternMatchFail (Unwrapped PatternMatchFail) #

Wrapped RecSelError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecSelError :: Type #

Methods

_Wrapped' :: Iso' RecSelError (Unwrapped RecSelError) #

Wrapped RecConError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecConError :: Type #

Methods

_Wrapped' :: Iso' RecConError (Unwrapped RecConError) #

Wrapped RecUpdError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped RecUpdError :: Type #

Methods

_Wrapped' :: Iso' RecUpdError (Unwrapped RecUpdError) #

Wrapped NoMethodError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped NoMethodError :: Type #

Methods

_Wrapped' :: Iso' NoMethodError (Unwrapped NoMethodError) #

Wrapped TypeError 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped TypeError :: Type #

Methods

_Wrapped' :: Iso' TypeError (Unwrapped TypeError) #

Wrapped Errno 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Errno :: Type #

Methods

_Wrapped' :: Iso' Errno (Unwrapped Errno) #

Wrapped CompactionFailed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CompactionFailed :: Type #

Methods

_Wrapped' :: Iso' CompactionFailed (Unwrapped CompactionFailed) #

Wrapped AssertionFailed 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped AssertionFailed :: Type #

Methods

_Wrapped' :: Iso' AssertionFailed (Unwrapped AssertionFailed) #

Wrapped ErrorCall 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped ErrorCall :: Type #

Methods

_Wrapped' :: Iso' ErrorCall (Unwrapped ErrorCall) #

Wrapped All 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped All :: Type #

Methods

_Wrapped' :: Iso' All (Unwrapped All) #

Wrapped Any 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped Any :: Type #

Methods

_Wrapped' :: Iso' Any (Unwrapped Any) #

Wrapped CChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CChar :: Type #

Methods

_Wrapped' :: Iso' CChar (Unwrapped CChar) #

Wrapped CSChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSChar :: Type #

Methods

_Wrapped' :: Iso' CSChar (Unwrapped CSChar) #

Wrapped CUChar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUChar :: Type #

Methods

_Wrapped' :: Iso' CUChar (Unwrapped CUChar) #

Wrapped CShort 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CShort :: Type #

Methods

_Wrapped' :: Iso' CShort (Unwrapped CShort) #

Wrapped CUShort 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUShort :: Type #

Methods

_Wrapped' :: Iso' CUShort (Unwrapped CUShort) #

Wrapped CInt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CInt :: Type #

Methods

_Wrapped' :: Iso' CInt (Unwrapped CInt) #

Wrapped CUInt 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUInt :: Type #

Methods

_Wrapped' :: Iso' CUInt (Unwrapped CUInt) #

Wrapped CLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CLong :: Type #

Methods

_Wrapped' :: Iso' CLong (Unwrapped CLong) #

Wrapped CULong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CULong :: Type #

Methods

_Wrapped' :: Iso' CULong (Unwrapped CULong) #

Wrapped CLLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CLLong :: Type #

Methods

_Wrapped' :: Iso' CLLong (Unwrapped CLLong) #

Wrapped CULLong 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CULLong :: Type #

Methods

_Wrapped' :: Iso' CULLong (Unwrapped CULLong) #

Wrapped CBool 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CBool :: Type #

Methods

_Wrapped' :: Iso' CBool (Unwrapped CBool) #

Wrapped CFloat 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CFloat :: Type #

Methods

_Wrapped' :: Iso' CFloat (Unwrapped CFloat) #

Wrapped CDouble 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CDouble :: Type #

Methods

_Wrapped' :: Iso' CDouble (Unwrapped CDouble) #

Wrapped CPtrdiff 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CPtrdiff :: Type #

Methods

_Wrapped' :: Iso' CPtrdiff (Unwrapped CPtrdiff) #

Wrapped CSize 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSize :: Type #

Methods

_Wrapped' :: Iso' CSize (Unwrapped CSize) #

Wrapped CWchar 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CWchar :: Type #

Methods

_Wrapped' :: Iso' CWchar (Unwrapped CWchar) #

Wrapped CSigAtomic 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSigAtomic :: Type #

Methods

_Wrapped' :: Iso' CSigAtomic (Unwrapped CSigAtomic) #

Wrapped CClock 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CClock :: Type #

Methods

_Wrapped' :: Iso' CClock (Unwrapped CClock) #

Wrapped CTime 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CTime :: Type #

Methods

_Wrapped' :: Iso' CTime (Unwrapped CTime) #

Wrapped CUSeconds 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUSeconds :: Type #

Methods

_Wrapped' :: Iso' CUSeconds (Unwrapped CUSeconds) #

Wrapped CSUSeconds 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CSUSeconds :: Type #

Methods

_Wrapped' :: Iso' CSUSeconds (Unwrapped CSUSeconds) #

Wrapped CIntPtr 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIntPtr :: Type #

Methods

_Wrapped' :: Iso' CIntPtr (Unwrapped CIntPtr) #

Wrapped CUIntPtr 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUIntPtr :: Type #

Methods

_Wrapped' :: Iso' CUIntPtr (Unwrapped CUIntPtr) #

Wrapped CIntMax 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CIntMax :: Type #

Methods

_Wrapped' :: Iso' CIntMax (Unwrapped CIntMax) #

Wrapped CUIntMax 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped CUIntMax :: Type #

Methods

_Wrapped' :: Iso' CUIntMax (Unwrapped CUIntMax) #

Wrapped IntSet 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped IntSet :: Type #

Methods

_Wrapped' :: Iso' IntSet (Unwrapped IntSet) #

Wrapped Name 
Instance details

Defined in Diagrams.Core.Names

Associated Types

type Unwrapped Name :: Type #

Methods

_Wrapped' :: Iso' Name (Unwrapped Name) #

Wrapped SegCount 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped SegCount :: Type #

Methods

_Wrapped' :: Iso' SegCount (Unwrapped SegCount) #

Wrapped (Par1 p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Par1 p) :: Type #

Methods

_Wrapped' :: Iso' (Par1 p) (Unwrapped (Par1 p)) #

Storable a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: Type #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Wrapped (Predicate a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Predicate a) :: Type #

Methods

_Wrapped' :: Iso' (Predicate a) (Unwrapped (Predicate a)) #

Wrapped (Comparison a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Comparison a) :: Type #

Methods

_Wrapped' :: Iso' (Comparison a) (Unwrapped (Comparison a)) #

Wrapped (Equivalence a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Equivalence a) :: Type #

Methods

_Wrapped' :: Iso' (Equivalence a) (Unwrapped (Equivalence a)) #

Wrapped (Min a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Min a) :: Type #

Methods

_Wrapped' :: Iso' (Min a) (Unwrapped (Min a)) #

Wrapped (Max a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Max a) :: Type #

Methods

_Wrapped' :: Iso' (Max a) (Unwrapped (Max a)) #

Wrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (First a) :: Type #

Methods

_Wrapped' :: Iso' (First a) (Unwrapped (First a)) #

Wrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Last a) :: Type #

Methods

_Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #

Wrapped (WrappedMonoid a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedMonoid a) :: Type #

Methods

_Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) #

Wrapped (Option a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Option a) :: Type #

Methods

_Wrapped' :: Iso' (Option a) (Unwrapped (Option a)) #

Wrapped (ZipList a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ZipList a) :: Type #

Methods

_Wrapped' :: Iso' (ZipList a) (Unwrapped (ZipList a)) #

Wrapped (Identity a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Identity a) :: Type #

Methods

_Wrapped' :: Iso' (Identity a) (Unwrapped (Identity a)) #

Wrapped (First a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (First a) :: Type #

Methods

_Wrapped' :: Iso' (First a) (Unwrapped (First a)) #

Wrapped (Last a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Last a) :: Type #

Methods

_Wrapped' :: Iso' (Last a) (Unwrapped (Last a)) #

Wrapped (Dual a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Dual a) :: Type #

Methods

_Wrapped' :: Iso' (Dual a) (Unwrapped (Dual a)) #

Wrapped (Endo a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Endo a) :: Type #

Methods

_Wrapped' :: Iso' (Endo a) (Unwrapped (Endo a)) #

Wrapped (Sum a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Sum a) :: Type #

Methods

_Wrapped' :: Iso' (Sum a) (Unwrapped (Sum a)) #

Wrapped (Product a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Product a) :: Type #

Methods

_Wrapped' :: Iso' (Product a) (Unwrapped (Product a)) #

Wrapped (Down a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Down a) :: Type #

Methods

_Wrapped' :: Iso' (Down a) (Unwrapped (Down a)) #

Wrapped (NonEmpty a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (NonEmpty a) :: Type #

Methods

_Wrapped' :: Iso' (NonEmpty a) (Unwrapped (NonEmpty a)) #

Wrapped (IntMap a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IntMap a) :: Type #

Methods

_Wrapped' :: Iso' (IntMap a) (Unwrapped (IntMap a)) #

Wrapped (Seq a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Seq a) :: Type #

Methods

_Wrapped' :: Iso' (Seq a) (Unwrapped (Seq a)) #

Ord a => Wrapped (Set a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Set a) :: Type #

Methods

_Wrapped' :: Iso' (Set a) (Unwrapped (Set a)) #

(Hashable a, Eq a) => Wrapped (HashSet a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (HashSet a) :: Type #

Methods

_Wrapped' :: Iso' (HashSet a) (Unwrapped (HashSet a)) #

Unbox a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: Type #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Prim a => Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: Type #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Wrapped (Vector a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Vector a) :: Type #

Methods

_Wrapped' :: Iso' (Vector a) (Unwrapped (Vector a)) #

Wrapped (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Associated Types

type Unwrapped (TransInv t) :: Type #

Methods

_Wrapped' :: Iso' (TransInv t) (Unwrapped (TransInv t)) #

Wrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Unwrapped (Polar a) :: Type #

Methods

_Wrapped' :: Iso' (Polar a) (Unwrapped (Polar a)) #

Wrapped (Active a) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Active a) :: Type #

Methods

_Wrapped' :: Iso' (Active a) (Unwrapped (Active a)) #

Wrapped (Time n) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Time n) :: Type #

Methods

_Wrapped' :: Iso' (Time n) (Unwrapped (Time n)) #

Wrapped (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Associated Types

type Unwrapped (Clip n) :: Type #

Methods

_Wrapped' :: Iso' (Clip n) (Unwrapped (Clip n)) #

Wrapped (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped (ArcLength n) :: Type #

Methods

_Wrapped' :: Iso' (ArcLength n) (Unwrapped (ArcLength n)) #

Wrapped (Duration n) 
Instance details

Defined in Data.Active

Associated Types

type Unwrapped (Duration n) :: Type #

Methods

_Wrapped' :: Iso' (Duration n) (Unwrapped (Duration n)) #

(Hashable k, Eq k) => Wrapped (HashMap k a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (HashMap k a) :: Type #

Methods

_Wrapped' :: Iso' (HashMap k a) (Unwrapped (HashMap k a)) #

Ord k => Wrapped (Map k a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Map k a) :: Type #

Methods

_Wrapped' :: Iso' (Map k a) (Unwrapped (Map k a)) #

Wrapped (Op a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Op a b) :: Type #

Methods

_Wrapped' :: Iso' (Op a b) (Unwrapped (Op a b)) #

Wrapped (WrappedMonad m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedMonad m a) :: Type #

Methods

_Wrapped' :: Iso' (WrappedMonad m a) (Unwrapped (WrappedMonad m a)) #

Wrapped (ArrowMonad m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ArrowMonad m a) :: Type #

Methods

_Wrapped' :: Iso' (ArrowMonad m a) (Unwrapped (ArrowMonad m a)) #

Wrapped (MaybeT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (MaybeT m a) :: Type #

Methods

_Wrapped' :: Iso' (MaybeT m a) (Unwrapped (MaybeT m a)) #

Wrapped (CatchT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CatchT m a) :: Type #

Methods

_Wrapped' :: Iso' (CatchT m a) (Unwrapped (CatchT m a)) #

Wrapped (ListT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ListT m a) :: Type #

Methods

_Wrapped' :: Iso' (ListT m a) (Unwrapped (ListT m a)) #

Wrapped (WrappedApplicative f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedApplicative f a) :: Type #

Methods

_Wrapped' :: Iso' (WrappedApplicative f a) (Unwrapped (WrappedApplicative f a)) #

Wrapped (MaybeApply f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (MaybeApply f a) :: Type #

Methods

_Wrapped' :: Iso' (MaybeApply f a) (Unwrapped (MaybeApply f a)) #

Wrapped (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Associated Types

type Unwrapped (Envelope v n) :: Type #

Methods

_Wrapped' :: Iso' (Envelope v n) (Unwrapped (Envelope v n)) #

Wrapped (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Associated Types

type Unwrapped (Style v n) :: Type #

Methods

_Wrapped' :: Iso' (Style v n) (Unwrapped (Style v n)) #

Wrapped (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Associated Types

type Unwrapped (Trace v n) :: Type #

Methods

_Wrapped' :: Iso' (Trace v n) (Unwrapped (Trace v n)) #

Wrapped (Point f a) 
Instance details

Defined in Linear.Affine

Associated Types

type Unwrapped (Point f a) :: Type #

Methods

_Wrapped' :: Iso' (Point f a) (Unwrapped (Point f a)) #

Wrapped (Path v n) 
Instance details

Defined in Diagrams.Path

Associated Types

type Unwrapped (Path v n) :: Type #

Methods

_Wrapped' :: Iso' (Path v n) (Unwrapped (Path v n)) #

Wrapped (Trail v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (Trail v n) :: Type #

Methods

_Wrapped' :: Iso' (Trail v n) (Unwrapped (Trail v n)) #

Wrapped (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (SegTree v n) :: Type #

Methods

_Wrapped' :: Iso' (SegTree v n) (Unwrapped (SegTree v n)) #

Wrapped (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Associated Types

type Unwrapped (TotalOffset v n) :: Type #

Methods

_Wrapped' :: Iso' (TotalOffset v n) (Unwrapped (TotalOffset v n)) #

Wrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Alt f a) :: Type #

Methods

_Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #

Wrapped (CoiterT w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CoiterT w a) :: Type #

Methods

_Wrapped' :: Iso' (CoiterT w a) (Unwrapped (CoiterT w a)) #

Wrapped (IterT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IterT m a) :: Type #

Methods

_Wrapped' :: Iso' (IterT m a) (Unwrapped (IterT m a)) #

Wrapped (Rec1 f p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Rec1 f p) :: Type #

Methods

_Wrapped' :: Iso' (Rec1 f p) (Unwrapped (Rec1 f p)) #

Wrapped (WrappedArrow a b c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedArrow a b c) :: Type #

Methods

_Wrapped' :: Iso' (WrappedArrow a b c) (Unwrapped (WrappedArrow a b c)) #

Wrapped (Kleisli m a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Kleisli m a b) :: Type #

Methods

_Wrapped' :: Iso' (Kleisli m a b) (Unwrapped (Kleisli m a b)) #

Wrapped (Const a x) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Const a x) :: Type #

Methods

_Wrapped' :: Iso' (Const a x) (Unwrapped (Const a x)) #

Wrapped (Ap f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Ap f a) :: Type #

Methods

_Wrapped' :: Iso' (Ap f a) (Unwrapped (Ap f a)) #

Wrapped (Alt f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Alt f a) :: Type #

Methods

_Wrapped' :: Iso' (Alt f a) (Unwrapped (Alt f a)) #

Wrapped (Join p a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Join p a) :: Type #

Methods

_Wrapped' :: Iso' (Join p a) (Unwrapped (Join p a)) #

Wrapped (Fix p a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Fix p a) :: Type #

Methods

_Wrapped' :: Iso' (Fix p a) (Unwrapped (Fix p a)) #

Wrapped (TracedT m w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (TracedT m w a) :: Type #

Methods

_Wrapped' :: Iso' (TracedT m w a) (Unwrapped (TracedT m w a)) #

Wrapped (IdentityT m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (IdentityT m a) :: Type #

Methods

_Wrapped' :: Iso' (IdentityT m a) (Unwrapped (IdentityT m a)) #

Wrapped (Compose f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Compose f g a) :: Type #

Methods

_Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #

Wrapped (ComposeFC f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ComposeFC f g a) :: Type #

Methods

_Wrapped' :: Iso' (ComposeFC f g a) (Unwrapped (ComposeFC f g a)) #

Wrapped (ComposeCF f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ComposeCF f g a) :: Type #

Methods

_Wrapped' :: Iso' (ComposeCF f g a) (Unwrapped (ComposeCF f g a)) #

Wrapped (ExceptT e m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ExceptT e m a) :: Type #

Methods

_Wrapped' :: Iso' (ExceptT e m a) (Unwrapped (ExceptT e m a)) #

Wrapped (WriterT w m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WriterT w m a) :: Type #

Methods

_Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #

Wrapped (StateT s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (StateT s m a) :: Type #

Methods

_Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #

Wrapped (ReaderT r m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ReaderT r m a) :: Type #

Methods

_Wrapped' :: Iso' (ReaderT r m a) (Unwrapped (ReaderT r m a)) #

Wrapped (ErrorT e m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ErrorT e m a) :: Type #

Methods

_Wrapped' :: Iso' (ErrorT e m a) (Unwrapped (ErrorT e m a)) #

Wrapped (StateT s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (StateT s m a) :: Type #

Methods

_Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a)) #

Wrapped (WriterT w m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WriterT w m a) :: Type #

Methods

_Wrapped' :: Iso' (WriterT w m a) (Unwrapped (WriterT w m a)) #

Wrapped (Star f d c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Star f d c) :: Type #

Methods

_Wrapped' :: Iso' (Star f d c) (Unwrapped (Star f d c)) #

Wrapped (Costar f d c) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Costar f d c) :: Type #

Methods

_Wrapped' :: Iso' (Costar f d c) (Unwrapped (Costar f d c)) #

Wrapped (WrappedArrow p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedArrow p a b) :: Type #

Methods

_Wrapped' :: Iso' (WrappedArrow p a b) (Unwrapped (WrappedArrow p a b)) #

Wrapped (Forget r a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Forget r a b) :: Type #

Methods

_Wrapped' :: Iso' (Forget r a b) (Unwrapped (Forget r a b)) #

Wrapped (Static f a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Static f a b) :: Type #

Methods

_Wrapped' :: Iso' (Static f a b) (Unwrapped (Static f a b)) #

Wrapped (Tagged s a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Tagged s a) :: Type #

Methods

_Wrapped' :: Iso' (Tagged s a) (Unwrapped (Tagged s a)) #

Wrapped (Reverse f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Reverse f a) :: Type #

Methods

_Wrapped' :: Iso' (Reverse f a) (Unwrapped (Reverse f a)) #

Wrapped (Constant a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Constant a b) :: Type #

Methods

_Wrapped' :: Iso' (Constant a b) (Unwrapped (Constant a b)) #

Wrapped (Backwards f a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Backwards f a) :: Type #

Methods

_Wrapped' :: Iso' (Backwards f a) (Unwrapped (Backwards f a)) #

Wrapped (CofreeT f w a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (CofreeT f w a) :: Type #

Methods

_Wrapped' :: Iso' (CofreeT f w a) (Unwrapped (CofreeT f w a)) #

Wrapped (FreeT f m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (FreeT f m a) :: Type #

Methods

_Wrapped' :: Iso' (FreeT f m a) (Unwrapped (FreeT f m a)) #

Wrapped (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Associated Types

type Unwrapped (Query v n m) :: Type #

Methods

_Wrapped' :: Iso' (Query v n m) (Unwrapped (Query v n m)) #

Wrapped (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Associated Types

type Unwrapped (Trail' Line v n) :: Type #

Methods

_Wrapped' :: Iso' (Trail' Line v n) (Unwrapped (Trail' Line v n)) #

Wrapped (ApT f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ApT f g a) :: Type #

Methods

_Wrapped' :: Iso' (ApT f g a) (Unwrapped (ApT f g a)) #

Wrapped (K1 i c p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (K1 i c p) :: Type #

Methods

_Wrapped' :: Iso' (K1 i c p) (Unwrapped (K1 i c p)) #

Wrapped (ContT r m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (ContT r m a) :: Type #

Methods

_Wrapped' :: Iso' (ContT r m a) (Unwrapped (ContT r m a)) #

Wrapped (Cayley f p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Cayley f p a b) :: Type #

Methods

_Wrapped' :: Iso' (Cayley f p a b) (Unwrapped (Cayley f p a b)) #

Wrapped (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Associated Types

type Unwrapped (QDiagram b v n m) :: Type #

Methods

_Wrapped' :: Iso' (QDiagram b v n m) (Unwrapped (QDiagram b v n m)) #

Wrapped (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Associated Types

type Unwrapped (SubMap b v n m) :: Type #

Methods

_Wrapped' :: Iso' (SubMap b v n m) (Unwrapped (SubMap b v n m)) #

Wrapped (M1 i c f p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (M1 i c f p) :: Type #

Methods

_Wrapped' :: Iso' (M1 i c f p) (Unwrapped (M1 i c f p)) #

Wrapped ((f :.: g) p) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped ((f :.: g) p) :: Type #

Methods

_Wrapped' :: Iso' ((f :.: g) p) (Unwrapped ((f :.: g) p)) #

Wrapped (Compose f g a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Compose f g a) :: Type #

Methods

_Wrapped' :: Iso' (Compose f g a) (Unwrapped (Compose f g a)) #

Wrapped (WrappedBifunctor p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedBifunctor p a b) :: Type #

Methods

_Wrapped' :: Iso' (WrappedBifunctor p a b) (Unwrapped (WrappedBifunctor p a b)) #

Wrapped (Joker g a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Joker g a b) :: Type #

Methods

_Wrapped' :: Iso' (Joker g a b) (Unwrapped (Joker g a b)) #

Wrapped (Flip p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Flip p a b) :: Type #

Methods

_Wrapped' :: Iso' (Flip p a b) (Unwrapped (Flip p a b)) #

Wrapped (Clown f a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Clown f a b) :: Type #

Methods

_Wrapped' :: Iso' (Clown f a b) (Unwrapped (Clown f a b)) #

Wrapped (RWST r w s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (RWST r w s m a) :: Type #

Methods

_Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #

Wrapped (RWST r w s m a) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (RWST r w s m a) :: Type #

Methods

_Wrapped' :: Iso' (RWST r w s m a) (Unwrapped (RWST r w s m a)) #

Wrapped (Dual k3 a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Dual k3 a b) :: Type #

Methods

_Wrapped' :: Iso' (Dual k3 a b) (Unwrapped (Dual k3 a b)) #

Wrapped (WrappedCategory k3 a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (WrappedCategory k3 a b) :: Type #

Methods

_Wrapped' :: Iso' (WrappedCategory k3 a b) (Unwrapped (WrappedCategory k3 a b)) #

Wrapped (Semi m a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Semi m a b) :: Type #

Methods

_Wrapped' :: Iso' (Semi m a b) (Unwrapped (Semi m a b)) #

Wrapped (Tannen f p a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Tannen f p a b) :: Type #

Methods

_Wrapped' :: Iso' (Tannen f p a b) (Unwrapped (Tannen f p a b)) #

Wrapped (Biff p f g a b) 
Instance details

Defined in Control.Lens.Wrapped

Associated Types

type Unwrapped (Biff p f g a b) :: Type #

Methods

_Wrapped' :: Iso' (Biff p f g a b) (Unwrapped (Biff p f g a b)) #

type BackendProgram a = Program ChartBackendInstr a #

class ToRenderable a where #

Methods

toRenderable :: a -> Renderable () #

Instances
ToRenderable PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieChart -> Renderable () #

ToRenderable PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieLayout -> Renderable () #

ToRenderable Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Rectangle -> Renderable () #

ToRenderable (Renderable a) 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Renderable a -> Renderable () #

Ord x => ToRenderable (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: StackedLayouts x -> Renderable () #

ToRenderable a => ToRenderable (Grid a) 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

toRenderable :: Grid a -> Renderable () #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

(Ord x, Ord y) => ToRenderable (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: Layout x y -> Renderable () #

ToRenderable (Legend x y) 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

toRenderable :: Legend x y -> Renderable () #

(Ord x, Ord yl, Ord yr) => ToRenderable (LayoutLR x yl yr) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: LayoutLR x yl yr -> Renderable () #

type EC l a = StateT l (State CState) a #

type PickFn a = Point -> Maybe a #

execEC :: Default l => EC l a -> l #

data AlignmentFns #

Constructors

AlignmentFns 

Fields

bitmapAlignmentFns :: AlignmentFns #

vectorAlignmentFns :: AlignmentFns #

type Lens' s a = Lens s s a a #

data Renderable a #

Constructors

Renderable 

Fields

Instances
Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

ToRenderable (Renderable a) 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Renderable a -> Renderable () #

ToImage (Renderable a) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> Renderable a -> IO () #

toSVG :: String -> Renderable a -> IO () #

autoScaledAxis :: RealFloat a => LinearAxisParams a -> AxisFn a #

autoScaledLogAxis :: RealFloat a => LogAxisParams a -> AxisFn a #

autoSteps :: Int -> [Double] -> [Double] #

la_labelf :: Lens (LinearAxisParams a1) (LinearAxisParams a2) ([a1] -> [String]) ([a2] -> [String]) #

la_nLabels :: Lens' (LinearAxisParams a) Int #

la_nTicks :: Lens' (LinearAxisParams a) Int #

loga_labelf :: Iso (LogAxisParams a1) (LogAxisParams a2) ([a1] -> [String]) ([a2] -> [String]) #

scaledAxis :: RealFloat a => LinearAxisParams a -> (a, a) -> AxisFn a #

addIndexes :: [a] -> [(PlotIndex, a)] #

autoIndexAxis :: Integral i => [String] -> [i] -> AxisData i #

autoScaledIntAxis :: (Integral i, PlotValue i) => LinearAxisParams i -> AxisFn i #

defaultIntAxis :: Show a => LinearAxisParams a #

scaledIntAxis :: (Integral i, PlotValue i) => LinearAxisParams i -> (i, i) -> AxisFn i #

autoTimeValueAxis :: TimeValue t => AxisFn t #

days :: TimeSeq #

months :: TimeSeq #

timeValueAxis :: TimeValue t => TimeSeq -> TimeSeq -> TimeLabelFn -> TimeLabelAlignment -> TimeSeq -> TimeLabelFn -> TimeLabelAlignment -> AxisFn t #

years :: TimeSeq #

axisGridAtBigTicks :: AxisData x -> AxisData x #

axisGridAtLabels :: AxisData x -> AxisData x #

axisGridAtTicks :: AxisData x -> AxisData x #

axisGridHide :: AxisData x -> AxisData x #

axisLabelsOverride :: [(x, String)] -> AxisData x -> AxisData x #

axisOverhang :: Ord x => AxisT x -> BackendProgram (Double, Double) #

axisToRenderable :: AxisT x -> Renderable x #

axis_grid :: Lens' (AxisData x) [x] #

axis_grid_style :: Lens' AxisStyle LineStyle #

axis_label_gap :: Lens' AxisStyle Double #

axis_label_style :: Lens' AxisStyle FontStyle #

axis_labels :: Lens' (AxisData x) [[(x, String)]] #

axis_line_style :: Lens' AxisStyle LineStyle #

axis_show_labels :: Lens' AxisVisibility Bool #

axis_show_line :: Lens' AxisVisibility Bool #

axis_show_ticks :: Lens' AxisVisibility Bool #

axis_ticks :: Lens' (AxisData x) [(x, Double)] #

axis_tropweiv :: Lens' (AxisData x) (Range -> Double -> x) #

axis_viewport :: Lens' (AxisData x) (Range -> x -> Double) #

axis_visibility :: Lens' (AxisData x) AxisVisibility #

defaultAxisLineStyle :: LineStyle #

defaultGridLineStyle :: LineStyle #

invLinMap :: (Double -> a) -> (a -> Double) -> (a, a) -> Range -> Double -> a #

invmap :: PlotValue x => (x, x) -> Range -> Double -> x #

linMap :: (a -> Double) -> (a, a) -> Range -> a -> Double #

makeAxis :: PlotValue x => ([x] -> [String]) -> ([x], [x], [x]) -> AxisData x #

makeAxis' :: Ord x => (x -> Double) -> (Double -> x) -> ([x] -> [String]) -> ([x], [x], [x]) -> AxisData x #

renderAxisGrid :: RectSize -> AxisT z -> BackendProgram () #

vmap :: PlotValue x => (x, x) -> Range -> x -> Double #

unitAxis :: AxisData () #

drawText :: Point -> String -> BackendProgram () #

fillPath :: Path -> BackendProgram () #

getCoordAlignFn :: BackendProgram (Point -> Point) #

getPointAlignFn :: BackendProgram (Point -> Point) #

strokePath :: Path -> BackendProgram () #

textSize :: String -> BackendProgram TextSize #

withClipRegion :: Rect -> BackendProgram a -> BackendProgram a #

withFillStyle :: FillStyle -> BackendProgram a -> BackendProgram a #

withFontStyle :: FontStyle -> BackendProgram a -> BackendProgram a #

withLineStyle :: LineStyle -> BackendProgram a -> BackendProgram a #

withTransform :: Matrix -> BackendProgram a -> BackendProgram a #

fill_color :: Iso' FillStyle (AlphaColour Double) #

font_color :: Lens' FontStyle (AlphaColour Double) #

font_name :: Lens' FontStyle String #

font_size :: Lens' FontStyle Double #

font_slant :: Lens' FontStyle FontSlant #

font_weight :: Lens' FontStyle FontWeight #

line_cap :: Lens' LineStyle LineCap #

line_color :: Lens' LineStyle (AlphaColour Double) #

line_dashes :: Lens' LineStyle [Double] #

line_join :: Lens' LineStyle LineJoin #

line_width :: Lens' LineStyle Double #

alignFillPath :: Path -> BackendProgram Path #

alignFillPoint :: Point -> BackendProgram Point #

alignFillPoints :: [Point] -> BackendProgram [Point] #

alignPath :: (Point -> Point) -> Path -> Path #

alignStrokePath :: Path -> BackendProgram Path #

alignStrokePoint :: Point -> BackendProgram Point #

alignStrokePoints :: [Point] -> BackendProgram [Point] #

arrows :: Double -> Double -> Double -> AlphaColour Double -> PointStyle #

dashedLine :: Double -> [Double] -> AlphaColour Double -> LineStyle #

defaultColorSeq :: [AlphaColour Double] #

drawPoint :: PointStyle -> Point -> BackendProgram () #

drawTextA :: HTextAnchor -> VTextAnchor -> Point -> String -> BackendProgram () #

drawTextR :: HTextAnchor -> VTextAnchor -> Double -> Point -> String -> BackendProgram () #

drawTextsR :: HTextAnchor -> VTextAnchor -> Double -> Point -> String -> BackendProgram () #

exes :: Double -> Double -> AlphaColour Double -> PointStyle #

fillPointPath :: [Point] -> BackendProgram () #

filledCircles :: Double -> AlphaColour Double -> PointStyle #

filledPolygon :: Double -> Int -> Bool -> AlphaColour Double -> PointStyle #

hollowCircles :: Double -> Double -> AlphaColour Double -> PointStyle #

hollowPolygon :: Double -> Double -> Int -> Bool -> AlphaColour Double -> PointStyle #

plusses :: Double -> Double -> AlphaColour Double -> PointStyle #

point_border_color :: Lens' PointStyle (AlphaColour Double) #

point_border_width :: Lens' PointStyle Double #

point_color :: Lens' PointStyle (AlphaColour Double) #

point_radius :: Lens' PointStyle Double #

point_shape :: Lens' PointStyle PointShape #

solidFillStyle :: AlphaColour Double -> FillStyle #

solidLine :: Double -> AlphaColour Double -> LineStyle #

stars :: Double -> Double -> AlphaColour Double -> PointStyle #

strokePointPath :: [Point] -> BackendProgram () #

textDimension :: String -> BackendProgram RectSize #

textDrawRect :: HTextAnchor -> VTextAnchor -> Point -> String -> BackendProgram Rect #

withDefaultStyle :: BackendProgram a -> BackendProgram a #

withPointStyle :: PointStyle -> BackendProgram a -> BackendProgram a #

withRotation :: Double -> BackendProgram a -> BackendProgram a #

withScale :: Vector -> BackendProgram a -> BackendProgram a #

withScaleX :: Double -> BackendProgram a -> BackendProgram a #

withScaleY :: Double -> BackendProgram a -> BackendProgram a #

withTranslation :: Point -> BackendProgram a -> BackendProgram a #

bars :: (PlotValue x, BarsPlotValue y) => [String] -> [(x, [y])] -> EC l (PlotBars x y) #

line :: String -> [[(x, y)]] -> EC l (PlotLines x y) #

points :: String -> [(x, y)] -> EC l (PlotPoints x y) #

setColors :: [AlphaColour Double] -> EC l () #

setShapes :: [PointShape] -> EC l () #

adjoint :: Matrix -> Matrix #

arc :: Point -> Double -> Double -> Double -> Path #

arc' :: Double -> Double -> Double -> Double -> Double -> Path #

arcNeg :: Point -> Double -> Double -> Double -> Path #

arcNeg' :: Double -> Double -> Double -> Double -> Double -> Path #

close :: Path #

foldPath :: Monoid m => (Point -> m) -> (Point -> m) -> (Point -> Double -> Double -> Double -> m) -> (Point -> Double -> Double -> Double -> m) -> m -> Path -> m #

identity :: Matrix #

intersectRect :: Limit Rect -> Limit Rect -> Limit Rect #

invert :: Matrix -> Matrix #

lineTo :: Point -> Path #

lineTo' :: Double -> Double -> Path #

makeLinesExplicit :: Path -> Path #

mkrect :: Point -> Point -> Point -> Point -> Rect #

moveTo :: Point -> Path #

moveTo' :: Double -> Double -> Path #

pointToVec :: Point -> Vector #

psub :: Point -> Point -> Vector #

pvadd :: Point -> Vector -> Point #

pvsub :: Point -> Vector -> Point #

rectPath :: Rect -> Path #

rotate :: Double -> Matrix -> Matrix #

rotateP :: Double -> Point -> Point #

scalarMultiply :: Double -> Matrix -> Matrix #

scale :: Vector -> Matrix -> Matrix #

scaleP :: Vector -> Point -> Point #

transformP :: Matrix -> Point -> Point #

translate :: Vector -> Matrix -> Matrix #

translateP :: Vector -> Point -> Point #

vangle :: Vector -> Double #

vlen :: Vector -> Double #

vscale :: Double -> Vector -> Vector #

within :: Point -> Rect -> Bool #

laxis_generate :: Lens' (LayoutAxis x) (AxisFn x) #

laxis_override :: Lens' (LayoutAxis x) (AxisData x -> AxisData x) #

laxis_reverse :: Lens' (LayoutAxis x) Bool #

laxis_style :: Lens' (LayoutAxis x) AxisStyle #

laxis_title :: Lens' (LayoutAxis x) String #

laxis_title_style :: Lens' (LayoutAxis x) FontStyle #

layoutLRToGrid :: (Ord x, Ord yl, Ord yr) => LayoutLR x yl yr -> Grid (Renderable (LayoutPick x yl yr)) #

layoutLRToRenderable :: (Ord x, Ord yl, Ord yr) => LayoutLR x yl yr -> Renderable (LayoutPick x yl yr) #

layoutToGrid :: (Ord x, Ord y) => Layout x y -> Grid (Renderable (LayoutPick x y y)) #

layoutToRenderable :: (Ord x, Ord y) => Layout x y -> Renderable (LayoutPick x y y) #

layout_all_font_styles :: Setter' (Layout x y) FontStyle #

layout_axes_styles :: Setter' (Layout x y) AxisStyle #

layout_axes_title_styles :: Setter' (Layout x y) FontStyle #

layout_background :: Lens' (Layout x y) FillStyle #

layout_bottom_axis_visibility :: Lens' (Layout x y) AxisVisibility #

layout_foreground :: Setter' (Layout x y) (AlphaColour Double) #

layout_grid_last :: Lens' (Layout x y) Bool #

layout_left_axis_visibility :: Lens' (Layout x y) AxisVisibility #

layout_legend :: Lens' (Layout x y) (Maybe LegendStyle) #

layout_margin :: Lens' (Layout x y) Double #

layout_plot_background :: Lens' (Layout x y) (Maybe FillStyle) #

layout_plots :: Lens' (Layout x y) [Plot x y] #

layout_right_axis_visibility :: Lens' (Layout x y) AxisVisibility #

layout_title :: Lens' (Layout x y) String #

layout_title_style :: Lens' (Layout x y) FontStyle #

layout_top_axis_visibility :: Lens' (Layout x y) AxisVisibility #

layout_x_axis :: Lens' (Layout x y) (LayoutAxis x) #

layout_y_axis :: Lens' (Layout x y) (LayoutAxis y) #

layoutlr_all_font_styles :: Setter' (LayoutLR x y1 y2) FontStyle #

layoutlr_axes_styles :: Setter' (LayoutLR x y1 y2) AxisStyle #

layoutlr_axes_title_styles :: Setter' (LayoutLR x y1 y2) FontStyle #

layoutlr_background :: Lens' (LayoutLR x y1 y2) FillStyle #

layoutlr_bottom_axis_visibility :: Lens' (LayoutLR x y1 y2) AxisVisibility #

layoutlr_foreground :: Setter' (LayoutLR x y1 y2) (AlphaColour Double) #

layoutlr_grid_last :: Lens' (LayoutLR x y1 y2) Bool #

layoutlr_left_axis :: Lens' (LayoutLR x y1 y2) (LayoutAxis y1) #

layoutlr_left_axis_visibility :: Lens' (LayoutLR x y1 y2) AxisVisibility #

layoutlr_legend :: Lens' (LayoutLR x y1 y2) (Maybe LegendStyle) #

layoutlr_margin :: Lens' (LayoutLR x y1 y2) Double #

layoutlr_plot_background :: Lens' (LayoutLR x y1 y2) (Maybe FillStyle) #

layoutlr_plots :: Lens' (LayoutLR x y1 y2) [Either (Plot x y1) (Plot x y2)] #

layoutlr_right_axis :: Lens' (LayoutLR x y1 y2) (LayoutAxis y2) #

layoutlr_right_axis_visibility :: Lens' (LayoutLR x y1 y2) AxisVisibility #

layoutlr_title :: Lens' (LayoutLR x y1 y2) String #

layoutlr_title_style :: Lens' (LayoutLR x y1 y2) FontStyle #

layoutlr_top_axis_visibility :: Lens' (LayoutLR x y1 y2) AxisVisibility #

layoutlr_x_axis :: Lens' (LayoutLR x y1 y2) (LayoutAxis x) #

renderStackedLayouts :: Ord x => StackedLayouts x -> Renderable () #

slayouts_compress_legend :: Lens' (StackedLayouts x) Bool #

slayouts_layouts :: Lens (StackedLayouts x1) (StackedLayouts x2) [StackedLayout x1] [StackedLayout x2] #

legendToRenderable :: Legend x y -> Renderable String #

legend_label_style :: Lens' LegendStyle FontStyle #

legend_margin :: Lens' LegendStyle Double #

legend_orientation :: Lens' LegendStyle LegendOrientation #

legend_plot_size :: Lens' LegendStyle Double #

legend_position :: Lens' LegendStyle LegendPosition #

plot_annotation_angle :: Lens' (PlotAnnotation x y) Double #

plot_annotation_background :: Lens' (PlotAnnotation x y) Rectangle #

plot_annotation_hanchor :: Lens' (PlotAnnotation x y) HTextAnchor #

plot_annotation_style :: Lens' (PlotAnnotation x y) FontStyle #

plot_annotation_values :: Lens (PlotAnnotation x1 y1) (PlotAnnotation x2 y2) [(x1, y1, String)] [(x2, y2, String)] #

plot_annotation_vanchor :: Lens' (PlotAnnotation x y) VTextAnchor #

area_spots_4d_linethick :: Lens' (AreaSpots4D z t x y) Double #

area_spots_4d_max_radius :: Lens' (AreaSpots4D z t x y) Double #

area_spots_4d_opacity :: Lens' (AreaSpots4D z t x y) Double #

area_spots_4d_palette :: Lens' (AreaSpots4D z t x y) [Colour Double] #

area_spots_4d_title :: Lens' (AreaSpots4D z t x y) String #

area_spots_4d_values :: Lens (AreaSpots4D z1 t1 x1 y1) (AreaSpots4D z2 t2 x2 y2) [(x1, y1, z1, t1)] [(x2, y2, z2, t2)] #

area_spots_fillcolour :: Lens' (AreaSpots z x y) (Colour Double) #

area_spots_linecolour :: Lens' (AreaSpots z x y) (AlphaColour Double) #

area_spots_linethick :: Lens' (AreaSpots z x y) Double #

area_spots_max_radius :: Lens' (AreaSpots z x y) Double #

area_spots_opacity :: Lens' (AreaSpots z x y) Double #

area_spots_title :: Lens' (AreaSpots z x y) String #

area_spots_values :: Lens (AreaSpots z1 x1 y1) (AreaSpots z2 x2 y2) [(x1, y1, z1)] [(x2, y2, z2)] #

plotBars :: BarsPlotValue y => PlotBars x y -> Plot x y #

plot_bars_alignment :: Lens' (PlotBars x y) PlotBarsAlignment #

plot_bars_item_styles :: Lens' (PlotBars x y) [(FillStyle, Maybe LineStyle)] #

plot_bars_reference :: Lens' (PlotBars x y) y #

plot_bars_singleton_width :: Lens' (PlotBars x y) Double #

plot_bars_spacing :: Lens' (PlotBars x y) PlotBarsSpacing #

plot_bars_style :: Lens' (PlotBars x y) PlotBarsStyle #

plot_bars_titles :: Lens' (PlotBars x y) [String] #

plot_bars_values :: Lens (PlotBars x1 y) (PlotBars x2 y) [(x1, [y])] [(x2, [y])] #

plot_candle_centre :: Lens' (PlotCandle x y) Double #

plot_candle_fall_fill_style :: Lens' (PlotCandle x y) FillStyle #

plot_candle_fill :: Lens' (PlotCandle x y) Bool #

plot_candle_line_style :: Lens' (PlotCandle x y) LineStyle #

plot_candle_rise_fill_style :: Lens' (PlotCandle x y) FillStyle #

plot_candle_tick_length :: Lens' (PlotCandle x y) Double #

plot_candle_title :: Lens' (PlotCandle x y) String #

plot_candle_values :: Lens (PlotCandle x1 y1) (PlotCandle x2 y2) [Candle x1 y1] [Candle x2 y2] #

plot_candle_width :: Lens' (PlotCandle x y) Double #

plot_errbars_line_style :: Lens' (PlotErrBars x y) LineStyle #

plot_errbars_overhang :: Lens' (PlotErrBars x y) Double #

plot_errbars_tick_length :: Lens' (PlotErrBars x y) Double #

plot_errbars_title :: Lens' (PlotErrBars x y) String #

plot_errbars_values :: Lens (PlotErrBars x1 y1) (PlotErrBars x2 y2) [ErrPoint x1 y1] [ErrPoint x2 y2] #

symErrPoint :: (Num a, Num b) => a -> b -> a -> b -> ErrPoint a b #

plot_fillbetween_style :: Lens' (PlotFillBetween x y) FillStyle #

plot_fillbetween_title :: Lens' (PlotFillBetween x y) String #

plot_fillbetween_values :: Lens (PlotFillBetween x1 y1) (PlotFillBetween x2 y2) [(x1, (y1, y1))] [(x2, (y2, y2))] #

plot_hidden_x_values :: Lens (PlotHidden x1 y) (PlotHidden x2 y) [x1] [x2] #

plot_hidden_y_values :: Lens (PlotHidden x y1) (PlotHidden x y2) [y1] [y2] #

defaultFloatPlotHist :: PlotHist x Double #

defaultNormedPlotHist :: PlotHist x Double #

defaultPlotHist :: PlotHist x Int #

histToPlot :: (RealFrac x, Num y, Ord y) => PlotHist x y -> Plot x y #

plot_hist_bins :: Lens' (PlotHist x y) Int #

plot_hist_drop_lines :: Lens' (PlotHist x y) Bool #

plot_hist_fill_style :: Lens' (PlotHist x y) FillStyle #

plot_hist_line_style :: Lens' (PlotHist x y) LineStyle #

plot_hist_no_zeros :: Lens' (PlotHist x y) Bool #

plot_hist_norm_func :: Lens (PlotHist x y1) (PlotHist x y2) (Double -> Int -> y1) (Double -> Int -> y2) #

plot_hist_range :: Lens' (PlotHist x y) (Maybe (x, x)) #

plot_hist_title :: Lens' (PlotHist x y) String #

plot_hist_values :: Lens' (PlotHist x y) [x] #

defaultPlotLineStyle :: LineStyle #

hlinePlot :: String -> LineStyle -> b -> Plot a b #

plot_lines_limit_values :: Lens' (PlotLines x y) [[(Limit x, Limit y)]] #

plot_lines_style :: Lens' (PlotLines x y) LineStyle #

plot_lines_title :: Lens' (PlotLines x y) String #

plot_lines_values :: Lens' (PlotLines x y) [[(x, y)]] #

vlinePlot :: String -> LineStyle -> a -> Plot a b #

pieChartToRenderable :: PieChart -> Renderable (PickFn a) #

pieToRenderable :: PieLayout -> Renderable (PickFn a) #

pie_background :: Lens' PieLayout FillStyle #

pie_colors :: Lens' PieChart [AlphaColour Double] #

pie_data :: Lens' PieChart [PieItem] #

pie_label_line_style :: Lens' PieChart LineStyle #

pie_label_style :: Lens' PieChart FontStyle #

pie_margin :: Lens' PieLayout Double #

pie_plot :: Lens' PieLayout PieChart #

pie_start_angle :: Lens' PieChart Double #

pie_title :: Lens' PieLayout String #

pie_title_style :: Lens' PieLayout FontStyle #

pitem_label :: Lens' PieItem String #

pitem_offset :: Lens' PieItem Double #

pitem_value :: Lens' PieItem Double #

plot_points_style :: Lens' (PlotPoints x y) PointStyle #

plot_points_title :: Lens' (PlotPoints x y) String #

plot_points_values :: Lens (PlotPoints x1 y1) (PlotPoints x2 y2) [(x1, y1)] [(x2, y2)] #

joinPlot :: Plot x y -> Plot x y -> Plot x y #

mapXY :: PointMapFn x y -> (x, y) -> Point #

plot_all_points :: Lens' (Plot x y) ([x], [y]) #

plot_legend :: Lens' (Plot x y) [(String, Rect -> BackendProgram ())] #

plot_render :: Lens' (Plot x y) (PointMapFn x y -> BackendProgram ()) #

plotVectorField :: (PlotValue x, PlotValue y) => PlotVectors x y -> Plot x y #

plot_vectors_grid :: Lens' (PlotVectors x y) [(x, y)] #

plot_vectors_mapf :: Lens' (PlotVectors x y) ((x, y) -> (x, y)) #

plot_vectors_scale :: Lens' (PlotVectors x y) Double #

plot_vectors_style :: Lens' (PlotVectors x y) VectorStyle #

plot_vectors_title :: Lens' (PlotVectors x y) String #

plot_vectors_values :: Lens' (PlotVectors x y) [((x, y), (x, y))] #

vector_head_style :: Lens' VectorStyle PointStyle #

vector_line_style :: Lens' VectorStyle LineStyle #

addMargins :: (Double, Double, Double, Double) -> Renderable a -> Renderable a #

drawRectangle :: Point -> Rectangle -> BackendProgram (PickFn a) #

embedRenderable :: BackendProgram (Renderable a) -> Renderable a #

emptyRenderable :: Renderable a #

fillBackground :: FillStyle -> Renderable a -> Renderable a #

label :: FontStyle -> HTextAnchor -> VTextAnchor -> String -> Renderable String #

mapMaybePickFn :: (a -> Maybe b) -> Renderable a -> Renderable b #

mapPickFn :: (a -> b) -> Renderable a -> Renderable b #

nullPickFn :: PickFn a #

rect_cornerStyle :: Lens' Rectangle RectCornerStyle #

rect_fillStyle :: Lens' Rectangle (Maybe FillStyle) #

rect_lineStyle :: Lens' Rectangle (Maybe LineStyle) #

rect_minsize :: Lens' Rectangle RectSize #

rectangleToRenderable :: Rectangle -> Renderable a #

rlabel :: FontStyle -> HTextAnchor -> VTextAnchor -> Double -> String -> Renderable String #

setPickFn :: PickFn b -> Renderable a -> Renderable b #

spacer :: RectSize -> Renderable a #

spacer1 :: Renderable a -> Renderable b #

colors :: Lens' CState [AlphaColour Double] #

liftCState :: State CState a -> EC l a #

liftEC :: Default l1 => EC l1 a -> EC l2 l1 #

plot :: ToPlot p => EC (Layout x y) (p x y) -> EC (Layout x y) () #

plotLeft :: ToPlot p => EC (LayoutLR x y1 y2) (p x y1) -> EC (LayoutLR x y1 y2) () #

plotRight :: ToPlot p => EC (LayoutLR x y1 y2) (p x y2) -> EC (LayoutLR x y1 y2) () #

shapes :: Lens' CState [PointShape] #

takeColor :: EC l (AlphaColour Double) #

takeShape :: EC l PointShape #

iat :: At m => Index m -> IndexedLens' (Index m) m (Maybe (IxValue m)) #

icontains :: Contains m => Index m -> IndexedLens' (Index m) m Bool #

iix :: Ixed m => Index m -> IndexedTraversal' (Index m) m (IxValue m) #

ixAt :: At m => Index m -> Traversal' m (IxValue m) #

sans :: At m => Index m -> m -> m #

pattern (:<) :: forall b a. Cons b b a a => a -> b -> b #

pattern (:>) :: forall a b. Snoc a a b b => a -> b -> a #

(<|) :: Cons s s a a => a -> s -> s #

_head :: Cons s s a a => Traversal' s a #

_init :: Snoc s s a a => Traversal' s s #

_last :: Snoc s s a a => Traversal' s a #

_tail :: Cons s s a a => Traversal' s s #

cons :: Cons s s a a => a -> s -> s #

snoc :: Snoc s s a a => s -> a -> s #

uncons :: Cons s s a a => s -> Maybe (a, s) #

unsnoc :: Snoc s s a a => s -> Maybe (s, a) #

(|>) :: Snoc s s a a => s -> a -> s #

pattern Empty :: forall s. AsEmpty s => s #

fromEq :: AnEquality s t a b -> Equality b a t s #

mapEq :: AnEquality s t a b -> f s -> f a #

runEq :: AnEquality s t a b -> Identical s t a b #

simple :: Equality' a a #

simply :: (Optic' p f s a -> r) -> Optic' p f s a -> r #

substEq :: AnEquality s t a b -> ((s ~ a) -> (t ~ b) -> r) -> r #

(^..) :: s -> Getting (Endo [a]) s a -> [a] #

(^?) :: s -> Getting (First a) s a -> Maybe a #

(^?!) :: HasCallStack => s -> Getting (Endo a) s a -> a #

(^@..) :: s -> IndexedGetting i (Endo [(i, a)]) s a -> [(i, a)] #

(^@?) :: s -> IndexedGetting i (Endo (Maybe (i, a))) s a -> Maybe (i, a) #

(^@?!) :: HasCallStack => s -> IndexedGetting i (Endo (i, a)) s a -> (i, a) #

allOf :: Getting All s a -> (a -> Bool) -> s -> Bool #

andOf :: Getting All s Bool -> s -> Bool #

anyOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

asumOf :: Alternative f => Getting (Endo (f a)) s (f a) -> s -> f a #

backwards :: (Profunctor p, Profunctor q) => Optical p q (Backwards f) s t a b -> Optical p q f s t a b #

concatMapOf :: Getting [r] s a -> (a -> [r]) -> s -> [r] #

concatOf :: Getting [r] s [r] -> s -> [r] #

cycled :: Apply f => LensLike f s t a b -> LensLike f s t a b #

droppingWhile :: (Conjoined p, Profunctor q, Applicative f) => (a -> Bool) -> Optical p q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

elemIndexOf :: Eq a => IndexedGetting i (First i) s a -> a -> s -> Maybe i #

elemIndicesOf :: Eq a => IndexedGetting i (Endo [i]) s a -> a -> s -> [i] #

elemOf :: Eq a => Getting Any s a -> a -> s -> Bool #

filtered :: (Choice p, Applicative f) => (a -> Bool) -> Optic' p f a a #

findIndexOf :: IndexedGetting i (First i) s a -> (a -> Bool) -> s -> Maybe i #

findIndicesOf :: IndexedGetting i (Endo [i]) s a -> (a -> Bool) -> s -> [i] #

findMOf :: Monad m => Getting (Endo (m (Maybe a))) s a -> (a -> m Bool) -> s -> m (Maybe a) #

findOf :: Getting (Endo (Maybe a)) s a -> (a -> Bool) -> s -> Maybe a #

first1Of :: Getting (First a) s a -> s -> a #

firstOf :: Getting (Leftmost a) s a -> s -> Maybe a #

foldByOf :: Fold s a -> (a -> a -> a) -> a -> s -> a #

foldMapByOf :: Fold s a -> (r -> r -> r) -> r -> (a -> r) -> s -> r #

foldMapOf :: Getting r s a -> (a -> r) -> s -> r #

foldOf :: Getting a s a -> s -> a #

folded :: Foldable f => IndexedFold Int (f a) a #

folded64 :: Foldable f => IndexedFold Int64 (f a) a #

folding :: Foldable f => (s -> f a) -> Fold s a #

foldl1Of :: HasCallStack => Getting (Dual (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

foldl1Of' :: HasCallStack => Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> a) -> s -> a #

foldlMOf :: Monad m => Getting (Endo (r -> m r)) s a -> (r -> a -> m r) -> r -> s -> m r #

foldlOf :: Getting (Dual (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldlOf' :: Getting (Endo (Endo r)) s a -> (r -> a -> r) -> r -> s -> r #

foldr1Of :: HasCallStack => Getting (Endo (Maybe a)) s a -> (a -> a -> a) -> s -> a #

foldr1Of' :: HasCallStack => Getting (Dual (Endo (Endo (Maybe a)))) s a -> (a -> a -> a) -> s -> a #

foldrMOf :: Monad m => Getting (Dual (Endo (r -> m r))) s a -> (a -> r -> m r) -> r -> s -> m r #

foldrOf :: Getting (Endo r) s a -> (a -> r -> r) -> r -> s -> r #

foldrOf' :: Getting (Dual (Endo (Endo r))) s a -> (a -> r -> r) -> r -> s -> r #

foldring :: (Contravariant f, Applicative f) => ((a -> f a -> f a) -> f a -> s -> f a) -> LensLike f s t a b #

for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f () #

forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m () #

forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f () #

has :: Getting Any s a -> s -> Bool #

hasn't :: Getting All s a -> s -> Bool #

iallOf :: IndexedGetting i All s a -> (i -> a -> Bool) -> s -> Bool #

ianyOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

iconcatMapOf :: IndexedGetting i [r] s a -> (i -> a -> [r]) -> s -> [r] #

idroppingWhile :: (Indexable i p, Profunctor q, Applicative f) => (i -> a -> Bool) -> Optical (Indexed i) q (Compose (State Bool) f) s t a a -> Optical p q f s t a a #

ifiltered :: (Indexable i p, Applicative f) => (i -> a -> Bool) -> Optical' p (Indexed i) f a a #

ifindMOf :: Monad m => IndexedGetting i (Endo (m (Maybe a))) s a -> (i -> a -> m Bool) -> s -> m (Maybe a) #

ifindOf :: IndexedGetting i (Endo (Maybe a)) s a -> (i -> a -> Bool) -> s -> Maybe a #

ifoldMapOf :: IndexedGetting i m s a -> (i -> a -> m) -> s -> m #

ifolding :: (Foldable f, Indexable i p, Contravariant g, Applicative g) => (s -> f (i, a)) -> Over p g s t a b #

ifoldlMOf :: Monad m => IndexedGetting i (Endo (r -> m r)) s a -> (i -> r -> a -> m r) -> r -> s -> m r #

ifoldlOf :: IndexedGetting i (Dual (Endo r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldlOf' :: IndexedGetting i (Endo (r -> r)) s a -> (i -> r -> a -> r) -> r -> s -> r #

ifoldrMOf :: Monad m => IndexedGetting i (Dual (Endo (r -> m r))) s a -> (i -> a -> r -> m r) -> r -> s -> m r #

ifoldrOf :: IndexedGetting i (Endo r) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldrOf' :: IndexedGetting i (Dual (Endo (r -> r))) s a -> (i -> a -> r -> r) -> r -> s -> r #

ifoldring :: (Indexable i p, Contravariant f, Applicative f) => ((i -> a -> f a -> f a) -> f a -> s -> f a) -> Over p f s t a b #

iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m () #

iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f () #

imapMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> (i -> a -> m r) -> s -> m () #

inoneOf :: IndexedGetting i Any s a -> (i -> a -> Bool) -> s -> Bool #

ipre :: IndexedGetting i (First (i, a)) s a -> IndexPreservingGetter s (Maybe (i, a)) #

ipreuse :: MonadState s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipreuses :: MonadState s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

ipreview :: MonadReader s m => IndexedGetting i (First (i, a)) s a -> m (Maybe (i, a)) #

ipreviews :: MonadReader s m => IndexedGetting i (First r) s a -> (i -> a -> r) -> m (Maybe r) #

itakingWhile :: (Indexable i p, Profunctor q, Contravariant f, Applicative f) => (i -> a -> Bool) -> Optical' (Indexed i) q (Const (Endo (f s)) :: Type -> Type) s a -> Optical' p q f s a #

iterated :: Apply f => (a -> a) -> LensLike' f a a #

itoListOf :: IndexedGetting i (Endo [(i, a)]) s a -> s -> [(i, a)] #

itraverseOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> (i -> a -> f r) -> s -> f () #

last1Of :: Getting (Last a) s a -> s -> a #

lastOf :: Getting (Rightmost a) s a -> s -> Maybe a #

lengthOf :: Getting (Endo (Endo Int)) s a -> s -> Int #

lined :: Applicative f => IndexedLensLike' Int f String String #

lookupOf :: Eq k => Getting (Endo (Maybe v)) s (k, v) -> k -> s -> Maybe v #

mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m () #

maximum1Of :: Ord a => Getting (Max a) s a -> s -> a #

maximumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

maximumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

minimum1Of :: Ord a => Getting (Min a) s a -> s -> a #

minimumByOf :: Getting (Endo (Endo (Maybe a))) s a -> (a -> a -> Ordering) -> s -> Maybe a #

minimumOf :: Ord a => Getting (Endo (Endo (Maybe a))) s a -> s -> Maybe a #

msumOf :: MonadPlus m => Getting (Endo (m a)) s (m a) -> s -> m a #

noneOf :: Getting Any s a -> (a -> Bool) -> s -> Bool #

notElemOf :: Eq a => Getting All s a -> a -> s -> Bool #

notNullOf :: Getting Any s a -> s -> Bool #

nullOf :: Getting All s a -> s -> Bool #

orOf :: Getting Any s Bool -> s -> Bool #

pre :: Getting (First a) s a -> IndexPreservingGetter s (Maybe a) #

preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a) #

preuses :: MonadState s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a) #

previews :: MonadReader s m => Getting (First r) s a -> (a -> r) -> m (Maybe r) #

productOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

repeated :: Apply f => LensLike' f a a #

replicated :: Int -> Fold a a #

sequence1Of_ :: Functor f => Getting (TraversedF a f) s (f a) -> s -> f () #

sequenceAOf_ :: Functor f => Getting (Traversed a f) s (f a) -> s -> f () #

sequenceOf_ :: Monad m => Getting (Sequenced a m) s (m a) -> s -> m () #

sumOf :: Num a => Getting (Endo (Endo a)) s a -> s -> a #

takingWhile :: (Conjoined p, Applicative f) => (a -> Bool) -> Over p (TakingWhile p f a a) s t a a -> Over p f s t a a #

toListOf :: Getting (Endo [a]) s a -> s -> [a] #

toNonEmptyOf :: Getting (NonEmptyDList a) s a -> s -> NonEmpty a #

traverse1Of_ :: Functor f => Getting (TraversedF r f) s a -> (a -> f r) -> s -> f () #

traverseOf_ :: Functor f => Getting (Traversed r f) s a -> (a -> f r) -> s -> f () #

unfolded :: (b -> Maybe (a, b)) -> Fold b a #

worded :: Applicative f => IndexedLensLike' Int f String String #

(^.) :: s -> Getting a s a -> a #

(^@.) :: s -> IndexedGetting i (i, a) s a -> (i, a) #

getting :: (Profunctor p, Profunctor q, Functor f, Contravariant f) => Optical p q f s t a b -> Optical' p q f s a #

ilike :: (Indexable i p, Contravariant f, Functor f) => i -> a -> Over' p f s a #

ilistening :: MonadWriter w m => IndexedGetting i (i, u) w u -> m a -> m (a, (i, u)) #

ilistenings :: MonadWriter w m => IndexedGetting i v w u -> (i -> u -> v) -> m a -> m (a, v) #

ito :: (Indexable i p, Contravariant f) => (s -> (i, a)) -> Over' p f s a #

iuse :: MonadState s m => IndexedGetting i (i, a) s a -> m (i, a) #

iuses :: MonadState s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

iview :: MonadReader s m => IndexedGetting i (i, a) s a -> m (i, a) #

iviews :: MonadReader s m => IndexedGetting i r s a -> (i -> a -> r) -> m r #

like :: (Profunctor p, Contravariant f, Functor f) => a -> Optic' p f s a #

listening :: MonadWriter w m => Getting u w u -> m a -> m (a, u) #

listenings :: MonadWriter w m => Getting v w u -> (u -> v) -> m a -> m (a, v) #

to :: (Profunctor p, Contravariant f) => (s -> a) -> Optic' p f s a #

use :: MonadState s m => Getting a s a -> m a #

uses :: MonadState s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r #

view :: MonadReader s m => Getting a s a -> m a #

views :: MonadReader s m => LensLike' (Const r :: Type -> Type) s a -> (a -> r) -> m r #

(.>) :: (st -> r) -> (kab -> st) -> kab -> r #

(<.) :: Indexable i p => (Indexed i s t -> r) -> ((a -> b) -> s -> t) -> p a b -> r #

(<.>) :: Indexable (i, j) p => (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> p a b -> r #

iall :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

iany :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

icompose :: Indexable p c => (i -> j -> p) -> (Indexed i s t -> r) -> (Indexed j a b -> s -> t) -> c a b -> r #

iconcatMap :: FoldableWithIndex i f => (i -> a -> [b]) -> f a -> [b] #

ifind :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Maybe (i, a) #

ifoldMapBy :: FoldableWithIndex i t => (r -> r -> r) -> r -> (i -> a -> r) -> t a -> r #

ifoldMapByOf :: IndexedFold i t a -> (r -> r -> r) -> r -> (i -> a -> r) -> t -> r #

ifoldlM :: (FoldableWithIndex i f, Monad m) => (i -> b -> a -> m b) -> b -> f a -> m b #

ifoldrM :: (FoldableWithIndex i f, Monad m) => (i -> a -> b -> m b) -> b -> f a -> m b #

ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b) #

iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b) #

iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m () #

ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f () #

imapAccumL :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

imapAccumR :: TraversableWithIndex i t => (i -> s -> a -> (s, b)) -> s -> t a -> (s, t b) #

imapM :: (TraversableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m (t b) #

imapM_ :: (FoldableWithIndex i t, Monad m) => (i -> a -> m b) -> t a -> m () #

index :: (Indexable i p, Eq i, Applicative f) => i -> Optical' p (Indexed i) f a a #

indices :: (Indexable i p, Applicative f) => (i -> Bool) -> Optical' p (Indexed i) f a a #

inone :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool #

itoList :: FoldableWithIndex i f => f a -> [(i, a)] #

itraverseBy :: TraversableWithIndex i t => (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> t a -> f (t b) #

itraverseByOf :: IndexedTraversal i s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (i -> a -> f b) -> s -> f t #

itraverse_ :: (FoldableWithIndex i t, Applicative f) => (i -> a -> f b) -> t a -> f () #

none :: Foldable f => (a -> Bool) -> f a -> Bool #

reindexed :: Indexable j p => (i -> j) -> (Indexed i a b -> r) -> p a b -> r #

selfIndex :: Indexable a p => p a fb -> a -> fb #

asIndex :: (Indexable i p, Contravariant f, Functor f) => p i (f i) -> Indexed i s (f s) #

indexing :: Indexable Int p => ((a -> Indexing f b) -> s -> Indexing f t) -> p a (f b) -> s -> f t #

indexing64 :: Indexable Int64 p => ((a -> Indexing64 f b) -> s -> Indexing64 f t) -> p a (f b) -> s -> f t #

withIndex :: (Indexable i p, Functor f) => p (i, s) (f (j, t)) -> Indexed i s (f t) #

makeClassyPrisms :: Name -> DecsQ #

makePrisms :: Name -> DecsQ #

retagged :: (Profunctor p, Bifunctor p) => p a b -> p s b #

pattern Lazy :: forall t s. Strict t s => t -> s #

pattern List :: forall l. IsList l => [Item l] -> l #

pattern Reversed :: forall t. Reversing t => t -> t #

pattern Strict :: forall s t. Strict s t => t -> s #

pattern Swapped :: forall (p :: Type -> Type -> Type) c d. Swapped p => p d c -> p c d #

anon :: a -> (a -> Bool) -> Iso' (Maybe a) a #

au :: Functor f => AnIso s t a b -> ((b -> t) -> f s) -> f a #

auf :: Optic (Costar f) g s t a b -> (f a -> g b) -> f s -> g t #

bimapping :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b') #

cloneIso :: AnIso s t a b -> Iso s t a b #

coerced :: (Coercible s a, Coercible t b) => Iso s t a b #

contramapping :: Contravariant f => AnIso s t a b -> Iso (f a) (f b) (f s) (f t) #

curried :: Iso ((a, b) -> c) ((d, e) -> f) (a -> b -> c) (d -> e -> f) #

dimapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (p a s') (q b t') (p s a') (q t b') #

enum :: Enum a => Iso' Int a #

firsting :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f s x) (g t y) (f a x) (g b y) #

flipped :: Iso (a -> b -> c) (a' -> b' -> c') (b -> a -> c) (b' -> a' -> c') #

from :: AnIso s t a b -> Iso b a t s #

imagma :: Over (Indexed i) (Molten i a b) s t a b -> Iso s t' (Magma i t b a) (Magma j t' c c) #

involuted :: (a -> a) -> Iso' a a #

iso :: (s -> a) -> (b -> t) -> Iso s t a b #

lazy :: Strict lazy strict => Iso' strict lazy #

lmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p a x) (q b y) (p s x) (q t y) #

mapping :: (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b) #

non :: Eq a => a -> Iso' (Maybe a) a #

non' :: APrism' a () -> Iso' (Maybe a) a #

reversed :: Reversing a => Iso' a a #

rmapping :: (Profunctor p, Profunctor q) => AnIso s t a b -> Iso (p x s) (q y t) (p x a) (q y b) #

seconding :: (Bifunctor f, Bifunctor g) => AnIso s t a b -> Iso (f x s) (g y t) (f x a) (g y b) #

uncurried :: Iso (a -> b -> c) (d -> e -> f) ((a, b) -> c) ((d, e) -> f) #

under :: AnIso s t a b -> (t -> s) -> b -> a #

withIso :: AnIso s t a b -> ((s -> a) -> (b -> t) -> r) -> r #

(#%%=) :: MonadState s m => ALens s s a b -> (a -> (r, b)) -> m r #

(#%%~) :: Functor f => ALens s t a b -> (a -> f b) -> s -> f t #

(#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m () #

(#%~) :: ALens s t a b -> (a -> b) -> s -> t #

(#=) :: MonadState s m => ALens s s a b -> b -> m () #

(#~) :: ALens s t a b -> b -> s -> t #

(%%=) :: MonadState s m => Over p ((,) r) s s a b -> p a (r, b) -> m r #

(%%@=) :: MonadState s m => Over (Indexed i) ((,) r) s s a b -> (i -> a -> (r, b)) -> m r #

(%%@~) :: Over (Indexed i) f s t a b -> (i -> a -> f b) -> s -> f t #

(%%~) :: LensLike f s t a b -> (a -> f b) -> s -> f t #

(&~) :: s -> State s a -> s #

(<#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m b #

(<#%~) :: ALens s t a b -> (a -> b) -> s -> (b, t) #

(<#=) :: MonadState s m => ALens s s a b -> b -> m b #

(<#~) :: ALens s t a b -> b -> s -> (b, t) #

(<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b #

(<%@=) :: MonadState s m => Over (Indexed i) ((,) b) s s a b -> (i -> a -> b) -> m b #

(<%@~) :: Over (Indexed i) ((,) b) s t a b -> (i -> a -> b) -> s -> (b, t) #

(<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t) #

(<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<&&~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<**~) :: Floating a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<*~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<+~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<-~) :: Num a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<//~) :: Fractional a => LensLike ((,) a) s t a a -> a -> s -> (a, t) #

(<<%=) :: (Strong p, MonadState s m) => Over p ((,) a) s s a b -> p a b -> m a #

(<<%@=) :: MonadState s m => Over (Indexed i) ((,) a) s s a b -> (i -> a -> b) -> m a #

(<<%@~) :: Over (Indexed i) ((,) a) s t a b -> (i -> a -> b) -> s -> (a, t) #

(<<%~) :: LensLike ((,) a) s t a b -> (a -> b) -> s -> (a, t) #

(<<&&=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<&&~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<**=) :: (MonadState s m, Floating a) => LensLike' ((,) a) s a -> a -> m a #

(<<**~) :: Floating a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<*=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<*~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<+=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<+~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<-=) :: (MonadState s m, Num a) => LensLike' ((,) a) s a -> a -> m a #

(<<-~) :: Num a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<.=) :: MonadState s m => LensLike ((,) a) s s a b -> b -> m a #

(<<.~) :: LensLike ((,) a) s t a b -> b -> s -> (a, t) #

(<<//=) :: (MonadState s m, Fractional a) => LensLike' ((,) a) s a -> a -> m a #

(<<//~) :: Fractional a => LensLike' ((,) a) s a -> a -> s -> (a, s) #

(<<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<<>~) :: Monoid r => LensLike' ((,) r) s r -> r -> s -> (r, s) #

(<<>=) :: (MonadState s m, Monoid r) => LensLike' ((,) r) s r -> r -> m r #

(<<>~) :: Monoid m => LensLike ((,) m) s t m m -> m -> s -> (m, t) #

(<<?=) :: MonadState s m => LensLike ((,) a) s s a (Maybe b) -> b -> m a #

(<<?~) :: LensLike ((,) a) s t a (Maybe b) -> b -> s -> (a, t) #

(<<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<<^^~) :: (Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<^~) :: (Num a, Integral e) => LensLike' ((,) a) s a -> e -> s -> (a, s) #

(<<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<<||~) :: LensLike' ((,) Bool) s Bool -> Bool -> s -> (Bool, s) #

(<<~) :: MonadState s m => ALens s s a b -> m b -> m b #

(<^=) :: (MonadState s m, Num a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<^^=) :: (MonadState s m, Fractional a, Integral e) => LensLike' ((,) a) s a -> e -> m a #

(<^^~) :: (Fractional a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<^~) :: (Num a, Integral e) => LensLike ((,) a) s t a a -> e -> s -> (a, t) #

(<||=) :: MonadState s m => LensLike' ((,) Bool) s Bool -> Bool -> m Bool #

(<||~) :: LensLike ((,) Bool) s t Bool Bool -> Bool -> s -> (Bool, t) #

(??) :: Functor f => f (a -> b) -> a -> f b #

(^#) :: s -> ALens s t a b -> a #

alongside :: LensLike (AlongsideLeft f b') s t a b -> LensLike (AlongsideRight f t) s' t' a' b' -> LensLike f (s, s') (t, t') (a, a') (b, b') #

choosing :: Functor f => LensLike f s t a b -> LensLike f s' t' a b -> LensLike f (Either s s') (Either t t') a b #

chosen :: IndexPreservingLens (Either a a) (Either b b) a b #

cloneIndexPreservingLens :: ALens s t a b -> IndexPreservingLens s t a b #

cloneIndexedLens :: AnIndexedLens i s t a b -> IndexedLens i s t a b #

cloneLens :: ALens s t a b -> Lens s t a b #

devoid :: Over p f Void Void a b #

fusing :: Functor f => LensLike (Yoneda f) s t a b -> LensLike f s t a b #

ilens :: (s -> (i, a)) -> (s -> b -> t) -> IndexedLens i s t a b #

inside :: Corepresentable p => ALens s t a b -> Lens (p e s) (p e t) (p e a) (p e b) #

iplens :: (s -> a) -> (s -> b -> t) -> IndexPreservingLens s t a b #

lens :: (s -> a) -> (s -> b -> t) -> Lens s t a b #

locus :: IndexedComonadStore p => Lens (p a c s) (p b c s) a b #

overA :: Arrow ar => LensLike (Context a b) s t a b -> ar a b -> ar s t #

storing :: ALens s t a b -> b -> s -> t #

united :: Lens' a () #

ilevels :: Applicative f => Traversing (Indexed i) f s t a b -> IndexedLensLike Int f s t (Level i a) (Level j b) #

levels :: Applicative f => Traversing ((->) :: Type -> Type -> Type) f s t a b -> IndexedLensLike Int f s t (Level () a) (Level () b) #

children :: Plated a => a -> [a] #

composOpFold :: Plated a => b -> (b -> b -> b) -> (a -> b) -> a -> b #

contexts :: Plated a => a -> [Context a a a] #

contextsOf :: ATraversal' a a -> a -> [Context a a a] #

contextsOn :: Plated a => ATraversal s t a a -> s -> [Context a a t] #

contextsOnOf :: ATraversal s t a a -> ATraversal' a a -> s -> [Context a a t] #

cosmos :: Plated a => Fold a a #

cosmosOf :: (Applicative f, Contravariant f) => LensLike' f a a -> LensLike' f a a #

cosmosOn :: (Applicative f, Contravariant f, Plated a) => LensLike' f s a -> LensLike' f s a #

cosmosOnOf :: (Applicative f, Contravariant f) => LensLike' f s a -> LensLike' f a a -> LensLike' f s a #

deep :: (Conjoined p, Applicative f, Plated s) => Traversing p f s s a b -> Over p f s s a b #

gplate :: (Generic a, GPlated a (Rep a)) => Traversal' a a #

gplate1 :: (Generic1 f, GPlated1 f (Rep1 f)) => Traversal' (f a) (f a) #

holes :: Plated a => a -> [Pretext ((->) :: Type -> Type -> Type) a a a] #

holesOn :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

holesOnOf :: Conjoined p => LensLike (Bazaar p r r) s t a b -> Over p (Bazaar p r r) a b r r -> s -> [Pretext p r r t] #

para :: Plated a => (a -> [r] -> r) -> a -> r #

paraOf :: Getting (Endo [a]) a a -> (a -> [r] -> r) -> a -> r #

parts :: Plated a => Lens' a [a] #

rewrite :: Plated a => (a -> Maybe a) -> a -> a #

rewriteM :: (Monad m, Plated a) => (a -> m (Maybe a)) -> a -> m a #

rewriteMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> a -> m b #

rewriteMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m (Maybe a)) -> s -> m t #

rewriteMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m (Maybe a)) -> s -> m t #

rewriteOf :: ASetter a b a b -> (b -> Maybe a) -> a -> b #

rewriteOn :: Plated a => ASetter s t a a -> (a -> Maybe a) -> s -> t #

rewriteOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> Maybe a) -> s -> t #

transform :: Plated a => (a -> a) -> a -> a #

transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a #

transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b #

transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m t #

transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t #

transformOf :: ASetter a b a b -> (b -> b) -> a -> b #

transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> t #

transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> t #

universe :: Plated a => a -> [a] #

universeOf :: Getting [a] a a -> a -> [a] #

universeOn :: Plated a => Getting [a] s a -> s -> [a] #

universeOnOf :: Getting [a] s a -> Getting [a] a a -> s -> [a] #

_Just :: Prism (Maybe a) (Maybe b) a b #

_Left :: Prism (Either a c) (Either b c) a b #

_Nothing :: Prism' (Maybe a) () #

_Right :: Prism (Either c a) (Either c b) a b #

_Show :: (Read a, Show a) => Prism' String a #

_Void :: Prism s s a Void #

aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b) #

below :: Traversable f => APrism' s a -> Prism' (f s) (f a) #

clonePrism :: APrism s t a b -> Prism s t a b #

isn't :: APrism s t a b -> s -> Bool #

matching :: APrism s t a b -> s -> Either t a #

nearly :: a -> (a -> Bool) -> Prism' a () #

only :: Eq a => a -> Prism' a () #

outside :: Representable p => APrism s t a b -> Lens (p t r) (p s r) (p b r) (p a r) #

prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b #

prism' :: (b -> s) -> (s -> Maybe a) -> Prism s s a b #

withPrism :: APrism s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r #

without :: APrism s t a b -> APrism u v c d -> Prism (Either s u) (Either t v) (Either a c) (Either b d) #

(#) :: AReview t b -> b -> t #

re :: AReview t b -> Getter b t #

reuse :: MonadState b m => AReview t b -> m t #

reuses :: MonadState b m => AReview t b -> (t -> r) -> m r #

review :: MonadReader b m => AReview t b -> m t #

reviews :: MonadReader b m => AReview t b -> (t -> r) -> m r #

un :: (Profunctor p, Bifunctor p, Functor f) => Getting a s a -> Optic' p f a s #

unto :: (Profunctor p, Bifunctor p, Functor f) => (b -> t) -> Optic p f s t a b #

(%=) :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

(%@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

(%@~) :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

(%~) :: ASetter s t a b -> (a -> b) -> s -> t #

(&&=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

(&&~) :: ASetter s t Bool Bool -> Bool -> s -> t #

(**=) :: (MonadState s m, Floating a) => ASetter' s a -> a -> m () #

(**~) :: Floating a => ASetter s t a a -> a -> s -> t #

(*=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(*~) :: Num a => ASetter s t a a -> a -> s -> t #

(+=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(+~) :: Num a => ASetter s t a a -> a -> s -> t #

(-=) :: (MonadState s m, Num a) => ASetter' s a -> a -> m () #

(-~) :: Num a => ASetter s t a a -> a -> s -> t #

(.=) :: MonadState s m => ASetter s s a b -> b -> m () #

(.@=) :: MonadState s m => AnIndexedSetter i s s a b -> (i -> b) -> m () #

(.@~) :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

(.~) :: ASetter s t a b -> b -> s -> t #

(//=) :: (MonadState s m, Fractional a) => ASetter' s a -> a -> m () #

(//~) :: Fractional a => ASetter s t a a -> a -> s -> t #

(<.=) :: MonadState s m => ASetter s s a b -> b -> m b #

(<.~) :: ASetter s t a b -> b -> s -> (b, t) #

(<>=) :: (MonadState s m, Monoid a) => ASetter' s a -> a -> m () #

(<>~) :: Monoid a => ASetter s t a a -> a -> s -> t #

(<?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m b #

(<?~) :: ASetter s t a (Maybe b) -> b -> s -> (b, t) #

(<~) :: MonadState s m => ASetter s s a b -> m b -> m () #

(?=) :: MonadState s m => ASetter s s a (Maybe b) -> b -> m () #

(?~) :: ASetter s t a (Maybe b) -> b -> s -> t #

(^=) :: (MonadState s m, Num a, Integral e) => ASetter' s a -> e -> m () #

(^^=) :: (MonadState s m, Fractional a, Integral e) => ASetter' s a -> e -> m () #

(^^~) :: (Fractional a, Integral e) => ASetter s t a a -> e -> s -> t #

(^~) :: (Num a, Integral e) => ASetter s t a a -> e -> s -> t #

argument :: Profunctor p => Setter (p b r) (p a r) a b #

assign :: MonadState s m => ASetter s s a b -> b -> m () #

assignA :: Arrow p => ASetter s t a b -> p s b -> p s t #

censoring :: MonadWriter w m => Setter w w u v -> (u -> v) -> m a -> m a #

cloneIndexPreservingSetter :: ASetter s t a b -> IndexPreservingSetter s t a b #

cloneIndexedSetter :: AnIndexedSetter i s t a b -> IndexedSetter i s t a b #

cloneSetter :: ASetter s t a b -> Setter s t a b #

contramapped :: Contravariant f => Setter (f b) (f a) a b #

icensoring :: MonadWriter w m => IndexedSetter i w w u v -> (i -> u -> v) -> m a -> m a #

ilocally :: MonadReader s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m r -> m r #

imapOf :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

imodifying :: MonadState s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m () #

iover :: AnIndexedSetter i s t a b -> (i -> a -> b) -> s -> t #

ipassing :: MonadWriter w m => IndexedSetter i w w u v -> m (a, i -> u -> v) -> m a #

iset :: AnIndexedSetter i s t a b -> (i -> b) -> s -> t #

isets :: ((i -> a -> b) -> s -> t) -> IndexedSetter i s t a b #

lifted :: Monad m => Setter (m a) (m b) a b #

locally :: MonadReader s m => ASetter s s a b -> (a -> b) -> m r -> m r #

mapOf :: ASetter s t a b -> (a -> b) -> s -> t #

mapped :: Functor f => Setter (f a) (f b) a b #

modifying :: MonadState s m => ASetter s s a b -> (a -> b) -> m () #

over :: ASetter s t a b -> (a -> b) -> s -> t #

passing :: MonadWriter w m => Setter w w u v -> m (a, u -> v) -> m a #

scribe :: (MonadWriter t m, Monoid s) => ASetter s t a b -> b -> m () #

set :: ASetter s t a b -> b -> s -> t #

set' :: ASetter' s a -> a -> s -> s #

sets :: (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b #

setting :: ((a -> b) -> s -> t) -> IndexPreservingSetter s t a b #

(||=) :: MonadState s m => ASetter' s Bool -> Bool -> m () #

(||~) :: ASetter s t Bool Bool -> Bool -> s -> t #

abbreviatedFields :: LensRules #

abbreviatedNamer :: FieldNamer #

camelCaseFields :: LensRules #

camelCaseNamer :: FieldNamer #

classUnderscoreNoPrefixFields :: LensRules #

classUnderscoreNoPrefixNamer :: FieldNamer #

classyRules :: LensRules #

classyRules_ :: LensRules #

createClass :: Lens' LensRules Bool #

declareClassy :: DecsQ -> DecsQ #

declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQ #

declareFields :: DecsQ -> DecsQ #

declareLenses :: DecsQ -> DecsQ #

declareLensesFor :: [(String, String)] -> DecsQ -> DecsQ #

declareLensesWith :: LensRules -> DecsQ -> DecsQ #

declarePrisms :: DecsQ -> DecsQ #

declareWrapped :: DecsQ -> DecsQ #

defaultFieldRules :: LensRules #

generateLazyPatterns :: Lens' LensRules Bool #

generateSignatures :: Lens' LensRules Bool #

generateUpdateableOptics :: Lens' LensRules Bool #

lensClass :: Lens' LensRules ClassyNamer #

lensField :: Lens' LensRules FieldNamer #

lensRules :: LensRules #

lensRulesFor :: [(String, String)] -> LensRules #

lookingupNamer :: [(String, String)] -> FieldNamer #

makeClassy :: Name -> DecsQ #

makeClassyFor :: String -> String -> [(String, String)] -> Name -> DecsQ #

makeClassy_ :: Name -> DecsQ #

makeFields :: Name -> DecsQ #

makeFieldsNoPrefix :: Name -> DecsQ #

makeLenses :: Name -> DecsQ #

makeLensesFor :: [(String, String)] -> Name -> DecsQ #

makeLensesWith :: LensRules -> Name -> DecsQ #

makeWrapped :: Name -> DecsQ #

mappingNamer :: (String -> [String]) -> FieldNamer #

simpleLenses :: Lens' LensRules Bool #

underscoreFields :: LensRules #

underscoreNamer :: FieldNamer #

underscoreNoPrefixNamer :: FieldNamer #

both :: Bitraversable r => Traversal (r a a) (r b b) a b #

both1 :: Bitraversable1 r => Traversal1 (r a a) (r b b) a b #

cloneIndexPreservingTraversal :: ATraversal s t a b -> IndexPreservingTraversal s t a b #

cloneIndexPreservingTraversal1 :: ATraversal1 s t a b -> IndexPreservingTraversal1 s t a b #

cloneIndexedTraversal :: AnIndexedTraversal i s t a b -> IndexedTraversal i s t a b #

cloneIndexedTraversal1 :: AnIndexedTraversal1 i s t a b -> IndexedTraversal1 i s t a b #

cloneTraversal :: ATraversal s t a b -> Traversal s t a b #

cloneTraversal1 :: ATraversal1 s t a b -> Traversal1 s t a b #

confusing :: Applicative f => LensLike (Curried (Yoneda f) (Yoneda f)) s t a b -> LensLike f s t a b #

deepOf :: (Conjoined p, Applicative f) => LensLike f s t s t -> Traversing p f s t a b -> Over p f s t a b #

dropping :: (Conjoined p, Applicative f) => Int -> Over p (Indexing f) s t a a -> Over p f s t a a #

element :: Traversable t => Int -> IndexedTraversal' Int (t a) a #

elementOf :: Applicative f => LensLike (Indexing f) s t a a -> Int -> IndexedLensLike Int f s t a a #

elements :: Traversable t => (Int -> Bool) -> IndexedTraversal' Int (t a) a #

elementsOf :: Applicative f => LensLike (Indexing f) s t a a -> (Int -> Bool) -> IndexedLensLike Int f s t a a #

failing :: (Conjoined p, Applicative f) => Traversing p f s t a b -> Over p f s t a b -> Over p f s t a b #

failover :: Alternative m => LensLike ((,) Any) s t a b -> (a -> b) -> s -> m t #

forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m t #

forOf :: LensLike f s t a b -> s -> (a -> f b) -> f t #

holes1Of :: Conjoined p => Over p (Bazaar1 p a a) s t a a -> s -> NonEmpty (Pretext p a a t) #

holesOf :: Conjoined p => Over p (Bazaar p a a) s t a a -> s -> [Pretext p a a t] #

ifailover :: Alternative m => Over (Indexed i) ((,) Any) s t a b -> (i -> a -> b) -> s -> m t #

iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m t #

iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t #

ignored :: Applicative f => pafb -> s -> f s #

iloci :: IndexedTraversal i (Bazaar (Indexed i) a c s) (Bazaar (Indexed i) b c s) a b #

imapAccumLOf :: Over (Indexed i) (State acc) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

imapAccumROf :: Over (Indexed i) (Backwards (State acc)) s t a b -> (i -> acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

imapMOf :: Over (Indexed i) (WrappedMonad m) s t a b -> (i -> a -> m b) -> s -> m t #

ipartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a a -> Over p f s t [a] [a] #

ipartsOf' :: (Indexable [i] p, Functor f) => Over (Indexed i) (Bazaar' (Indexed i) a) s t a a -> Over p f s t [a] [a] #

itraverseOf :: (Indexed i a (f b) -> s -> f t) -> (i -> a -> f b) -> s -> f t #

iunsafePartsOf :: (Indexable [i] p, Functor f) => Traversing (Indexed i) f s t a b -> Over p f s t [a] [b] #

iunsafePartsOf' :: Over (Indexed i) (Bazaar (Indexed i) a b) s t a b -> IndexedLens [i] s t [a] [b] #

loci :: Traversal (Bazaar ((->) :: Type -> Type -> Type) a c s) (Bazaar ((->) :: Type -> Type -> Type) b c s) a b #

mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t) #

mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t #

partsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a a -> LensLike f s t [a] [a] #

partsOf' :: ATraversal s t a a -> Lens s t [a] [a] #

scanl1Of :: LensLike (State (Maybe a)) s t a a -> (a -> a -> a) -> s -> t #

scanr1Of :: LensLike (Backwards (State (Maybe a))) s t a a -> (a -> a -> a) -> s -> t #

sequenceAOf :: LensLike f s t (f b) b -> s -> f t #

sequenceByOf :: Traversal s t (f b) b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> s -> f t #

sequenceOf :: LensLike (WrappedMonad m) s t (m b) b -> s -> m t #

singular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a a -> Over p f s t a a #

taking :: (Conjoined p, Applicative f) => Int -> Traversing p f s t a a -> Over p f s t a a #

transposeOf :: LensLike ZipList s t [a] a -> s -> [t] #

traverseByOf :: Traversal s t a b -> (forall x. x -> f x) -> (forall x y. f (x -> y) -> f x -> f y) -> (a -> f b) -> s -> f t #

traverseOf :: LensLike f s t a b -> (a -> f b) -> s -> f t #

traversed :: Traversable f => IndexedTraversal Int (f a) (f b) a b #

traversed1 :: Traversable1 f => IndexedTraversal1 Int (f a) (f b) a b #

traversed64 :: Traversable f => IndexedTraversal Int64 (f a) (f b) a b #

unsafePartsOf :: Functor f => Traversing ((->) :: Type -> Type -> Type) f s t a b -> LensLike f s t [a] [b] #

unsafePartsOf' :: ATraversal s t a b -> Lens s t [a] [b] #

unsafeSingular :: (HasCallStack, Conjoined p, Functor f) => Traversing p f s t a b -> Over p f s t a b #

_1' :: Field1 s t a b => Lens s t a b #

_10' :: Field10 s t a b => Lens s t a b #

_11' :: Field11 s t a b => Lens s t a b #

_12' :: Field12 s t a b => Lens s t a b #

_13' :: Field13 s t a b => Lens s t a b #

_14' :: Field14 s t a b => Lens s t a b #

_15' :: Field15 s t a b => Lens s t a b #

_16' :: Field16 s t a b => Lens s t a b #

_17' :: Field17 s t a b => Lens s t a b #

_18' :: Field18 s t a b => Lens s t a b #

_19' :: Field19 s t a b => Lens s t a b #

_2' :: Field2 s t a b => Lens s t a b #

_3' :: Field3 s t a b => Lens s t a b #

_4' :: Field4 s t a b => Lens s t a b #

_5' :: Field5 s t a b => Lens s t a b #

_6' :: Field6 s t a b => Lens s t a b #

_7' :: Field7 s t a b => Lens s t a b #

_8' :: Field8 s t a b => Lens s t a b #

_9' :: Field9 s t a b => Lens s t a b #

pattern Unwrapped :: forall t. Rewrapped t t => t -> Unwrapped t #

pattern Wrapped :: forall s. Rewrapped s s => Unwrapped s -> s #

_GWrapped' :: (Generic s, D1 d (C1 c (S1 s' (Rec0 a))) ~ Rep s, Unwrapped s ~ GUnwrapped (Rep s)) => Iso' s (Unwrapped s) #

_Unwrapped :: Rewrapping s t => Iso (Unwrapped t) (Unwrapped s) t s #

_Unwrapped' :: Wrapped s => Iso' (Unwrapped s) s #

_Unwrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso (Unwrapped t) (Unwrapped s) t s #

_Unwrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' (Unwrapped s) s #

_Wrapped :: Rewrapping s t => Iso s t (Unwrapped s) (Unwrapped t) #

_Wrapping :: Rewrapping s t => (Unwrapped s -> s) -> Iso s t (Unwrapped s) (Unwrapped t) #

_Wrapping' :: Wrapped s => (Unwrapped s -> s) -> Iso' s (Unwrapped s) #

ala :: (Functor f, Rewrapping s t) => (Unwrapped s -> s) -> ((Unwrapped t -> t) -> f s) -> f (Unwrapped s) #

alaf :: (Functor f, Functor g, Rewrapping s t) => (Unwrapped s -> s) -> (f t -> g s) -> f (Unwrapped t) -> g (Unwrapped s) #

op :: Wrapped s => (Unwrapped s -> s) -> s -> Unwrapped s #

data LinearAxisParams a #

Constructors

LinearAxisParams 

Fields

Instances
(Show a, RealFloat a) => Default (LinearAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LinearAxisParams a #

data LogAxisParams a #

Constructors

LogAxisParams 

Fields

Instances
(Show a, RealFloat a) => Default (LogAxisParams a) 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

def :: LogAxisParams a #

newtype LogValue #

Constructors

LogValue Double 
Instances
Eq LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: LogValue -> LogValue -> Bool #

(/=) :: LogValue -> LogValue -> Bool #

Floating LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: LogValue #

exp :: LogValue -> LogValue #

log :: LogValue -> LogValue #

sqrt :: LogValue -> LogValue #

(**) :: LogValue -> LogValue -> LogValue #

logBase :: LogValue -> LogValue -> LogValue #

sin :: LogValue -> LogValue #

cos :: LogValue -> LogValue #

tan :: LogValue -> LogValue #

asin :: LogValue -> LogValue #

acos :: LogValue -> LogValue #

atan :: LogValue -> LogValue #

sinh :: LogValue -> LogValue #

cosh :: LogValue -> LogValue #

tanh :: LogValue -> LogValue #

asinh :: LogValue -> LogValue #

acosh :: LogValue -> LogValue #

atanh :: LogValue -> LogValue #

log1p :: LogValue -> LogValue #

expm1 :: LogValue -> LogValue #

log1pexp :: LogValue -> LogValue #

log1mexp :: LogValue -> LogValue #

Fractional LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: LogValue -> LogValue -> LogValue #

recip :: LogValue -> LogValue #

fromRational :: Rational -> LogValue #

Num LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: LogValue -> LogValue -> LogValue #

(-) :: LogValue -> LogValue -> LogValue #

(*) :: LogValue -> LogValue -> LogValue #

negate :: LogValue -> LogValue #

abs :: LogValue -> LogValue #

signum :: LogValue -> LogValue #

fromInteger :: Integer -> LogValue #

Ord LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: LogValue -> LogValue -> Ordering #

(<) :: LogValue -> LogValue -> Bool #

(<=) :: LogValue -> LogValue -> Bool #

(>) :: LogValue -> LogValue -> Bool #

(>=) :: LogValue -> LogValue -> Bool #

max :: LogValue -> LogValue -> LogValue #

min :: LogValue -> LogValue -> LogValue #

Real LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: LogValue -> Rational #

RealFloat LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: LogValue -> Integer #

floatDigits :: LogValue -> Int #

floatRange :: LogValue -> (Int, Int) #

decodeFloat :: LogValue -> (Integer, Int) #

encodeFloat :: Integer -> Int -> LogValue #

exponent :: LogValue -> Int #

significand :: LogValue -> LogValue #

scaleFloat :: Int -> LogValue -> LogValue #

isNaN :: LogValue -> Bool #

isInfinite :: LogValue -> Bool #

isDenormalized :: LogValue -> Bool #

isNegativeZero :: LogValue -> Bool #

isIEEE :: LogValue -> Bool #

atan2 :: LogValue -> LogValue -> LogValue #

RealFrac LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => LogValue -> (b, LogValue) #

truncate :: Integral b => LogValue -> b #

round :: Integral b => LogValue -> b #

ceiling :: Integral b => LogValue -> b #

floor :: Integral b => LogValue -> b #

Show LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> LogValue -> ShowS #

show :: LogValue -> String #

showList :: [LogValue] -> ShowS #

PlotValue LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: LogValue -> Double #

fromValue :: Double -> LogValue #

autoAxis :: AxisFn LogValue #

newtype Percent #

Constructors

Percent 

Fields

Instances
Eq Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: Percent -> Percent -> Bool #

(/=) :: Percent -> Percent -> Bool #

Floating Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: Percent #

exp :: Percent -> Percent #

log :: Percent -> Percent #

sqrt :: Percent -> Percent #

(**) :: Percent -> Percent -> Percent #

logBase :: Percent -> Percent -> Percent #

sin :: Percent -> Percent #

cos :: Percent -> Percent #

tan :: Percent -> Percent #

asin :: Percent -> Percent #

acos :: Percent -> Percent #

atan :: Percent -> Percent #

sinh :: Percent -> Percent #

cosh :: Percent -> Percent #

tanh :: Percent -> Percent #

asinh :: Percent -> Percent #

acosh :: Percent -> Percent #

atanh :: Percent -> Percent #

log1p :: Percent -> Percent #

expm1 :: Percent -> Percent #

log1pexp :: Percent -> Percent #

log1mexp :: Percent -> Percent #

Fractional Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: Percent -> Percent -> Percent #

recip :: Percent -> Percent #

fromRational :: Rational -> Percent #

Num Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: Percent -> Percent -> Percent #

(-) :: Percent -> Percent -> Percent #

(*) :: Percent -> Percent -> Percent #

negate :: Percent -> Percent #

abs :: Percent -> Percent #

signum :: Percent -> Percent #

fromInteger :: Integer -> Percent #

Ord Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: Percent -> Percent -> Ordering #

(<) :: Percent -> Percent -> Bool #

(<=) :: Percent -> Percent -> Bool #

(>) :: Percent -> Percent -> Bool #

(>=) :: Percent -> Percent -> Bool #

max :: Percent -> Percent -> Percent #

min :: Percent -> Percent -> Percent #

Real Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: Percent -> Rational #

RealFloat Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: Percent -> Integer #

floatDigits :: Percent -> Int #

floatRange :: Percent -> (Int, Int) #

decodeFloat :: Percent -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Percent #

exponent :: Percent -> Int #

significand :: Percent -> Percent #

scaleFloat :: Int -> Percent -> Percent #

isNaN :: Percent -> Bool #

isInfinite :: Percent -> Bool #

isDenormalized :: Percent -> Bool #

isNegativeZero :: Percent -> Bool #

isIEEE :: Percent -> Bool #

atan2 :: Percent -> Percent -> Percent #

RealFrac Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => Percent -> (b, Percent) #

truncate :: Integral b => Percent -> b #

round :: Integral b => Percent -> b #

ceiling :: Integral b => Percent -> b #

floor :: Integral b => Percent -> b #

Show Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> Percent -> ShowS #

show :: Percent -> String #

showList :: [Percent] -> ShowS #

PlotValue Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: Percent -> Double #

fromValue :: Double -> Percent #

autoAxis :: AxisFn Percent #

newtype PlotIndex #

Constructors

PlotIndex 

Fields

Instances
Enum PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

succ :: PlotIndex -> PlotIndex #

pred :: PlotIndex -> PlotIndex #

toEnum :: Int -> PlotIndex #

fromEnum :: PlotIndex -> Int #

enumFrom :: PlotIndex -> [PlotIndex] #

enumFromThen :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromTo :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromThenTo :: PlotIndex -> PlotIndex -> PlotIndex -> [PlotIndex] #

Eq PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(==) :: PlotIndex -> PlotIndex -> Bool #

(/=) :: PlotIndex -> PlotIndex -> Bool #

Integral PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

quot :: PlotIndex -> PlotIndex -> PlotIndex #

rem :: PlotIndex -> PlotIndex -> PlotIndex #

div :: PlotIndex -> PlotIndex -> PlotIndex #

mod :: PlotIndex -> PlotIndex -> PlotIndex #

quotRem :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

divMod :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

toInteger :: PlotIndex -> Integer #

Num PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(+) :: PlotIndex -> PlotIndex -> PlotIndex #

(-) :: PlotIndex -> PlotIndex -> PlotIndex #

(*) :: PlotIndex -> PlotIndex -> PlotIndex #

negate :: PlotIndex -> PlotIndex #

abs :: PlotIndex -> PlotIndex #

signum :: PlotIndex -> PlotIndex #

fromInteger :: Integer -> PlotIndex #

Ord PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

compare :: PlotIndex -> PlotIndex -> Ordering #

(<) :: PlotIndex -> PlotIndex -> Bool #

(<=) :: PlotIndex -> PlotIndex -> Bool #

(>) :: PlotIndex -> PlotIndex -> Bool #

(>=) :: PlotIndex -> PlotIndex -> Bool #

max :: PlotIndex -> PlotIndex -> PlotIndex #

min :: PlotIndex -> PlotIndex -> PlotIndex #

Real PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toRational :: PlotIndex -> Rational #

Show PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

showsPrec :: Int -> PlotIndex -> ShowS #

show :: PlotIndex -> String #

showList :: [PlotIndex] -> ShowS #

PlotValue PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toValue :: PlotIndex -> Double #

fromValue :: Double -> PlotIndex #

autoAxis :: AxisFn PlotIndex #

data TimeLabelAlignment #

Constructors

UnderTicks 
BetweenTicks 
Instances
Show TimeLabelAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

showsPrec :: Int -> TimeLabelAlignment -> ShowS #

show :: TimeLabelAlignment -> String #

showList :: [TimeLabelAlignment] -> ShowS #

type TimeLabelFn = UTCTime -> String #

type TimeSeq = UTCTime -> ([UTCTime], [UTCTime]) #

class TimeValue t where #

Minimal complete definition

utctimeFromTV, tvFromUTCTime

Methods

utctimeFromTV :: t -> UTCTime #

tvFromUTCTime :: UTCTime -> t #

doubleFromTimeValue :: t -> Double #

timeValueFromDouble :: Double -> t #

Instances
TimeValue UTCTime 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: UTCTime -> UTCTime #

tvFromUTCTime :: UTCTime -> UTCTime #

doubleFromTimeValue :: UTCTime -> Double #

timeValueFromDouble :: Double -> UTCTime #

TimeValue LocalTime 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: LocalTime -> UTCTime #

tvFromUTCTime :: UTCTime -> LocalTime #

doubleFromTimeValue :: LocalTime -> Double #

timeValueFromDouble :: Double -> LocalTime #

TimeValue Day 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

utctimeFromTV :: Day -> UTCTime #

tvFromUTCTime :: UTCTime -> Day #

doubleFromTimeValue :: Day -> Double #

timeValueFromDouble :: Double -> Day #

data AxisData x #

Constructors

AxisData 

Fields

type AxisFn x = [x] -> AxisData x #

_axis_grid_style :: AxisStyle -> LineStyle #

_axis_label_gap :: AxisStyle -> Double #

_axis_label_style :: AxisStyle -> FontStyle #

_axis_line_style :: AxisStyle -> LineStyle #

data AxisT x #

Constructors

AxisT RectEdge AxisStyle Bool (AxisData x) 

data AxisVisibility #

Constructors

AxisVisibility 

Fields

Instances
Default AxisVisibility 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Types

Methods

def :: AxisVisibility #

class Ord a => PlotValue a where #

Methods

toValue :: a -> Double #

fromValue :: Double -> a #

autoAxis :: AxisFn a #

Instances
PlotValue LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: LogValue -> Double #

fromValue :: Double -> LogValue #

autoAxis :: AxisFn LogValue #

PlotValue Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toValue :: Percent -> Double #

fromValue :: Double -> Percent #

autoAxis :: AxisFn Percent #

PlotValue PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toValue :: PlotIndex -> Double #

fromValue :: Double -> PlotIndex #

autoAxis :: AxisFn PlotIndex #

type AlignmentFn = Point -> Point #

newtype FillStyle #

Constructors

FillStyleSolid 

Fields

Instances
Eq FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FillStyle -> FillStyle -> Bool #

(/=) :: FillStyle -> FillStyle -> Bool #

Show FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FillStyle -> ShowS #

show :: FillStyle -> String #

showList :: [FillStyle] -> ShowS #

Default FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FillStyle #

data FontSlant #

Constructors

FontSlantNormal 
FontSlantItalic 
FontSlantOblique 
Instances
Eq FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Ord FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Show FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontSlant -> ShowS #

show :: FontSlant -> String #

showList :: [FontSlant] -> ShowS #

Default FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontSlant #

data FontStyle #

Constructors

FontStyle 

Fields

Instances
Eq FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontStyle -> FontStyle -> Bool #

(/=) :: FontStyle -> FontStyle -> Bool #

Show FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontStyle -> ShowS #

show :: FontStyle -> String #

showList :: [FontStyle] -> ShowS #

Default FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontStyle #

data FontWeight #

Constructors

FontWeightNormal 
FontWeightBold 
Instances
Eq FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Ord FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Show FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontWeight -> ShowS #

show :: FontWeight -> String #

showList :: [FontWeight] -> ShowS #

Default FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: FontWeight #

data HTextAnchor #

Constructors

HTA_Left 
HTA_Centre 
HTA_Right 
Instances
Eq HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: HTextAnchor -> HTextAnchor -> Bool #

(/=) :: HTextAnchor -> HTextAnchor -> Bool #

Ord HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: HTextAnchor -> HTextAnchor -> Ordering #

(<) :: HTextAnchor -> HTextAnchor -> Bool #

(<=) :: HTextAnchor -> HTextAnchor -> Bool #

(>) :: HTextAnchor -> HTextAnchor -> Bool #

(>=) :: HTextAnchor -> HTextAnchor -> Bool #

max :: HTextAnchor -> HTextAnchor -> HTextAnchor #

min :: HTextAnchor -> HTextAnchor -> HTextAnchor #

Show HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> HTextAnchor -> ShowS #

show :: HTextAnchor -> String #

showList :: [HTextAnchor] -> ShowS #

data LineCap #

Constructors

LineCapButt 
LineCapRound 
LineCapSquare 
Instances
Eq LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineCap -> LineCap -> Bool #

(/=) :: LineCap -> LineCap -> Bool #

Ord LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineCap -> LineCap -> Ordering #

(<) :: LineCap -> LineCap -> Bool #

(<=) :: LineCap -> LineCap -> Bool #

(>) :: LineCap -> LineCap -> Bool #

(>=) :: LineCap -> LineCap -> Bool #

max :: LineCap -> LineCap -> LineCap #

min :: LineCap -> LineCap -> LineCap #

Show LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineCap -> ShowS #

show :: LineCap -> String #

showList :: [LineCap] -> ShowS #

data LineJoin #

Constructors

LineJoinMiter 
LineJoinRound 
LineJoinBevel 
Instances
Eq LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineJoin -> LineJoin -> Bool #

(/=) :: LineJoin -> LineJoin -> Bool #

Ord LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineJoin -> LineJoin -> Ordering #

(<) :: LineJoin -> LineJoin -> Bool #

(<=) :: LineJoin -> LineJoin -> Bool #

(>) :: LineJoin -> LineJoin -> Bool #

(>=) :: LineJoin -> LineJoin -> Bool #

max :: LineJoin -> LineJoin -> LineJoin #

min :: LineJoin -> LineJoin -> LineJoin #

Show LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineJoin -> ShowS #

show :: LineJoin -> String #

showList :: [LineJoin] -> ShowS #

data LineStyle #

Constructors

LineStyle 

Fields

Instances
Eq LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineStyle -> LineStyle -> Bool #

(/=) :: LineStyle -> LineStyle -> Bool #

Show LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineStyle -> ShowS #

show :: LineStyle -> String #

showList :: [LineStyle] -> ShowS #

Default LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

def :: LineStyle #

data TextSize #

Constructors

TextSize 

Fields

Instances
Eq TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: TextSize -> TextSize -> Bool #

(/=) :: TextSize -> TextSize -> Bool #

Show TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> TextSize -> ShowS #

show :: TextSize -> String #

showList :: [TextSize] -> ShowS #

data VTextAnchor #

Constructors

VTA_Top 
VTA_Centre 
VTA_Bottom 
VTA_BaseLine 
Instances
Eq VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: VTextAnchor -> VTextAnchor -> Bool #

(/=) :: VTextAnchor -> VTextAnchor -> Bool #

Ord VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: VTextAnchor -> VTextAnchor -> Ordering #

(<) :: VTextAnchor -> VTextAnchor -> Bool #

(<=) :: VTextAnchor -> VTextAnchor -> Bool #

(>) :: VTextAnchor -> VTextAnchor -> Bool #

(>=) :: VTextAnchor -> VTextAnchor -> Bool #

max :: VTextAnchor -> VTextAnchor -> VTextAnchor #

min :: VTextAnchor -> VTextAnchor -> VTextAnchor #

Show VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> VTextAnchor -> ShowS #

show :: VTextAnchor -> String #

showList :: [VTextAnchor] -> ShowS #

data PointShape #

Constructors

PointShapeCircle 
PointShapePolygon Int Bool 
PointShapePlus 
PointShapeCross 
PointShapeStar 
PointShapeArrowHead Double 
PointShapeEllipse Double Double 

data PointStyle #

Constructors

PointStyle 

Fields

Instances
Default PointStyle 
Instance details

Defined in Graphics.Rendering.Chart.Drawing

Methods

def :: PointStyle #

data Limit a #

Constructors

LMin 
LValue a 
LMax 
Instances
Show a => Show (Limit a) 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Limit a -> ShowS #

show :: Limit a -> String #

showList :: [Limit a] -> ShowS #

data Matrix #

Constructors

Matrix 

Fields

Instances
Num Matrix 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(+) :: Matrix -> Matrix -> Matrix #

(-) :: Matrix -> Matrix -> Matrix #

(*) :: Matrix -> Matrix -> Matrix #

negate :: Matrix -> Matrix #

abs :: Matrix -> Matrix #

signum :: Matrix -> Matrix #

fromInteger :: Integer -> Matrix #

Show Matrix 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Matrix -> ShowS #

show :: Matrix -> String #

showList :: [Matrix] -> ShowS #

data Path #

Constructors

MoveTo Point Path 
LineTo Point Path 
Arc Point Double Double Double Path 
ArcNeg Point Double Double Double Path 
End 
Close 
Instances
Semigroup Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(<>) :: Path -> Path -> Path #

sconcat :: NonEmpty Path -> Path #

stimes :: Integral b => b -> Path -> Path #

Monoid Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

mempty :: Path #

mappend :: Path -> Path -> Path #

mconcat :: [Path] -> Path #

data Point #

Constructors

Point 

Fields

Instances
Show Point 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Point -> ShowS #

show :: Point -> String #

showList :: [Point] -> ShowS #

type PointMapFn x y = (Limit x, Limit y) -> Point #

type Range = (Double, Double) #

data Rect #

Constructors

Rect Point Point 
Instances
Show Rect 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Rect -> ShowS #

show :: Rect -> String #

showList :: [Rect] -> ShowS #

data RectEdge #

Constructors

E_Top 
E_Bottom 
E_Left 
E_Right 

type RectSize = (Double, Double) #

v_x :: Vector -> Double #

v_y :: Vector -> Double #

data Layout x y #

Constructors

Layout 

Fields

Instances
(PlotValue x, PlotValue y) => Default (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: Layout x y #

(Ord x, Ord y) => ToRenderable (Layout x y) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: Layout x y -> Renderable () #

data LayoutAxis x #

Constructors

LayoutAxis 

Fields

Instances
PlotValue t => Default (LayoutAxis t) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutAxis t #

data LayoutLR x y1 y2 #

Constructors

LayoutLR 

Fields

Instances
(PlotValue x, PlotValue y1, PlotValue y2) => Default (LayoutLR x y1 y2) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: LayoutLR x y1 y2 #

(Ord x, Ord yl, Ord yr) => ToRenderable (LayoutLR x yl yr) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: LayoutLR x yl yr -> Renderable () #

data LayoutPick x y1 y2 #

Constructors

LayoutPick_Legend String 
LayoutPick_Title String 
LayoutPick_XTopAxisTitle String 
LayoutPick_XBottomAxisTitle String 
LayoutPick_YLeftAxisTitle String 
LayoutPick_YRightAxisTitle String 
LayoutPick_PlotArea x y1 y2 
LayoutPick_XTopAxis x 
LayoutPick_XBottomAxis x 
LayoutPick_YLeftAxis y1 
LayoutPick_YRightAxis y2 
Instances
(Show x, Show y1, Show y2) => Show (LayoutPick x y1 y2) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

showsPrec :: Int -> LayoutPick x y1 y2 -> ShowS #

show :: LayoutPick x y1 y2 -> String #

showList :: [LayoutPick x y1 y2] -> ShowS #

type MAxisFn t = [t] -> Maybe (AxisData t) #

data StackedLayout x where #

Constructors

StackedLayout :: forall x y. Ord y => Layout x y -> StackedLayout x 
StackedLayoutLR :: forall x yl yr. (Ord yl, Ord yr) => LayoutLR x yl yr -> StackedLayout x 

data StackedLayouts x #

Constructors

StackedLayouts 

Fields

Instances
Default (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

def :: StackedLayouts x #

Ord x => ToRenderable (StackedLayouts x) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

toRenderable :: StackedLayouts x -> Renderable () #

data LegendOrientation #

Constructors

LORows Int 
LOCols Int 

data LegendPosition #

Constructors

LegendAbove 
LegendBelow 
LegendRight 
LegendLeft 

data LegendStyle #

Constructors

LegendStyle 

Fields

Instances
Default LegendStyle 
Instance details

Defined in Graphics.Rendering.Chart.Legend

Methods

def :: LegendStyle #

data PlotAnnotation x y #

Constructors

PlotAnnotation 

Fields

Instances
ToPlot PlotAnnotation 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

toPlot :: PlotAnnotation x y -> Plot x y #

Default (PlotAnnotation x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

def :: PlotAnnotation x y #

data AreaSpots z x y #

Constructors

AreaSpots 

Fields

Instances
PlotValue z => ToPlot (AreaSpots z) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots z x y -> Plot x y #

Default (AreaSpots z x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots z x y #

data AreaSpots4D z t x y #

Constructors

AreaSpots4D 

Fields

Instances
(PlotValue z, PlotValue t, Show t) => ToPlot (AreaSpots4D z t) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots4D z t x y -> Plot x y #

Default (AreaSpots4D z t x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

def :: AreaSpots4D z t x y #

class PlotValue a => BarsPlotValue a where #

Methods

barsReference :: a #

barsAdd :: a -> a -> a #

Instances
BarsPlotValue Double 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Double #

barsAdd :: Double -> Double -> Double #

BarsPlotValue Int 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Int #

barsAdd :: Int -> Int -> Int #

data PlotBars x y #

Constructors

PlotBars 

Fields

Instances
BarsPlotValue y => Default (PlotBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

def :: PlotBars x y #

data PlotBarsAlignment #

Constructors

BarsLeft 
BarsCentered 
BarsRight 
Instances
Show PlotBarsAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsAlignment -> ShowS #

show :: PlotBarsAlignment -> String #

showList :: [PlotBarsAlignment] -> ShowS #

data PlotBarsSpacing #

Constructors

BarsFixWidth Double 
BarsFixGap Double Double 
Instances
Show PlotBarsSpacing 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsSpacing -> ShowS #

show :: PlotBarsSpacing -> String #

showList :: [PlotBarsSpacing] -> ShowS #

data PlotBarsStyle #

Constructors

BarsStacked 
BarsClustered 
Instances
Show PlotBarsStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsStyle -> ShowS #

show :: PlotBarsStyle -> String #

showList :: [PlotBarsStyle] -> ShowS #

data Candle x y #

Constructors

Candle 

Fields

Instances
(Show x, Show y) => Show (Candle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

showsPrec :: Int -> Candle x y -> ShowS #

show :: Candle x y -> String #

showList :: [Candle x y] -> ShowS #

data PlotCandle x y #

Constructors

PlotCandle 

Fields

Instances
ToPlot PlotCandle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

toPlot :: PlotCandle x y -> Plot x y #

Default (PlotCandle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

def :: PlotCandle x y #

data ErrPoint x y #

Constructors

ErrPoint 

Fields

Instances
(Show x, Show y) => Show (ErrPoint x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrPoint x y -> ShowS #

show :: ErrPoint x y -> String #

showList :: [ErrPoint x y] -> ShowS #

data ErrValue x #

Constructors

ErrValue 

Fields

Instances
Show x => Show (ErrValue x) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrValue x -> ShowS #

show :: ErrValue x -> String #

showList :: [ErrValue x] -> ShowS #

data PlotErrBars x y #

Constructors

PlotErrBars 

Fields

Instances
ToPlot PlotErrBars 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

toPlot :: PlotErrBars x y -> Plot x y #

Default (PlotErrBars x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

def :: PlotErrBars x y #

data PlotFillBetween x y #

Constructors

PlotFillBetween 

Fields

Instances
ToPlot PlotFillBetween 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

toPlot :: PlotFillBetween x y -> Plot x y #

Default (PlotFillBetween x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

def :: PlotFillBetween x y #

data PlotHidden x y #

Constructors

PlotHidden 

Fields

Instances
ToPlot PlotHidden 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Hidden

Methods

toPlot :: PlotHidden x y -> Plot x y #

data PlotHist x y #

Constructors

PlotHist 

Fields

Instances
Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

data PlotLines x y #

Constructors

PlotLines 

Fields

Instances
ToPlot PlotLines 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

toPlot :: PlotLines x y -> Plot x y #

Default (PlotLines x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

def :: PlotLines x y #

data PieChart #

Constructors

PieChart 

Fields

Instances
Default PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieChart #

ToRenderable PieChart 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieChart -> Renderable () #

data PieItem #

Constructors

PieItem 

Fields

Instances
Default PieItem 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieItem #

data PieLayout #

Constructors

PieLayout 

Fields

Instances
Default PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

def :: PieLayout #

ToRenderable PieLayout 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Pie

Methods

toRenderable :: PieLayout -> Renderable () #

data PlotPoints x y #

Constructors

PlotPoints 

Fields

Instances
ToPlot PlotPoints 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

toPlot :: PlotPoints x y -> Plot x y #

Default (PlotPoints x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

def :: PlotPoints x y #

_plot_all_points :: Plot x y -> ([x], [y]) #

_plot_legend :: Plot x y -> [(String, Rect -> BackendProgram ())] #

_plot_render :: Plot x y -> PointMapFn x y -> BackendProgram () #

class ToPlot (a :: Type -> Type -> Type) where #

Methods

toPlot :: a x y -> Plot x y #

Instances
ToPlot PlotAnnotation 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Annotation

Methods

toPlot :: PlotAnnotation x y -> Plot x y #

ToPlot PlotCandle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

toPlot :: PlotCandle x y -> Plot x y #

ToPlot PlotErrBars 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

toPlot :: PlotErrBars x y -> Plot x y #

ToPlot PlotFillBetween 
Instance details

Defined in Graphics.Rendering.Chart.Plot.FillBetween

Methods

toPlot :: PlotFillBetween x y -> Plot x y #

ToPlot PlotHidden 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Hidden

Methods

toPlot :: PlotHidden x y -> Plot x y #

ToPlot PlotLines 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Lines

Methods

toPlot :: PlotLines x y -> Plot x y #

ToPlot PlotPoints 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Points

Methods

toPlot :: PlotPoints x y -> Plot x y #

ToPlot Plot 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Types

Methods

toPlot :: Plot x y -> Plot x y #

PlotValue z => ToPlot (AreaSpots z) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots z x y -> Plot x y #

(PlotValue z, PlotValue t, Show t) => ToPlot (AreaSpots4D z t) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.AreaSpots

Methods

toPlot :: AreaSpots4D z t x y -> Plot x y #

data PlotVectors x y #

Constructors

PlotVectors 

Fields

Instances
Default (PlotVectors x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: PlotVectors x y #

data VectorStyle #

Constructors

VectorStyle 

Fields

Instances
Default VectorStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Vectors

Methods

def :: VectorStyle #

data RectCornerStyle #

Constructors

RCornerSquare 
RCornerBevel Double 
RCornerRounded Double 

data Rectangle #

Constructors

Rectangle 

Fields

Instances
Default Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

def :: Rectangle #

ToRenderable Rectangle 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

toRenderable :: Rectangle -> Renderable () #

data CState #

Instances
Default CState 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

def :: CState #

(Default a, ToRenderable a) => ToRenderable (EC a b) 
Instance details

Defined in Graphics.Rendering.Chart.State

Methods

toRenderable :: EC a b -> Renderable () #

class Ixed m => At m where #

Methods

at :: Index m -> Lens' m (Maybe (IxValue m)) #

Instances
At IntSet 
Instance details

Defined in Control.Lens.At

Methods

at :: Index IntSet -> Lens' IntSet (Maybe (IxValue IntSet)) #

At ColourMap 
Instance details

Defined in Plots.Style

Methods

at :: Index ColourMap -> Lens' ColourMap (Maybe (IxValue ColourMap)) #

At (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #

At (IntMap a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (IntMap a) -> Lens' (IntMap a) (Maybe (IxValue (IntMap a))) #

Ord k => At (Set k) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Set k) -> Lens' (Set k) (Maybe (IxValue (Set k))) #

(Eq k, Hashable k) => At (HashSet k) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (HashSet k) -> Lens' (HashSet k) (Maybe (IxValue (HashSet k))) #

(Eq k, Hashable k) => At (HashMap k a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (HashMap k a) -> Lens' (HashMap k a) (Maybe (IxValue (HashMap k a))) #

Ord k => At (Map k a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Map k a) -> Lens' (Map k a) (Maybe (IxValue (Map k a))) #

At (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

at :: Index (Style v n) -> Lens' (Style v n) (Maybe (IxValue (Style v n))) #

class Contains m where #

Methods

contains :: Index m -> Lens' m Bool #

Instances
Contains IntSet 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index IntSet -> Lens' IntSet Bool #

Ord a => Contains (Set a) 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index (Set a) -> Lens' (Set a) Bool #

(Eq a, Hashable a) => Contains (HashSet a) 
Instance details

Defined in Control.Lens.At

Methods

contains :: Index (HashSet a) -> Lens' (HashSet a) Bool #

type family Index s :: Type #

Instances
type Index ByteString 
Instance details

Defined in Control.Lens.At

type Index ByteString = Int
type Index ByteString 
Instance details

Defined in Control.Lens.At

type Index ByteString = Int64
type Index Text 
Instance details

Defined in Control.Lens.At

type Index Text = Int
type Index Text 
Instance details

Defined in Control.Lens.At

type Index Text = Int64
type Index IntSet 
Instance details

Defined in Control.Lens.At

type Index IntSet = Int
type Index ColourMap 
Instance details

Defined in Plots.Style

type Index ColourMap = Rational
type Index [a] 
Instance details

Defined in Control.Lens.At

type Index [a] = Int
type Index (Maybe a) 
Instance details

Defined in Control.Lens.At

type Index (Maybe a) = ()
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (Complex a) 
Instance details

Defined in Control.Lens.At

type Index (Complex a) = Int
type Index (Identity a) 
Instance details

Defined in Control.Lens.At

type Index (Identity a) = ()
type Index (NonEmpty a) 
Instance details

Defined in Control.Lens.At

type Index (NonEmpty a) = Int
type Index (IntMap a) 
Instance details

Defined in Control.Lens.At

type Index (IntMap a) = Int
type Index (Tree a) 
Instance details

Defined in Control.Lens.At

type Index (Tree a) = [Int]
type Index (Seq a) 
Instance details

Defined in Control.Lens.At

type Index (Seq a) = Int
type Index (Set a) 
Instance details

Defined in Control.Lens.At

type Index (Set a) = a
type Index (HashSet a) 
Instance details

Defined in Control.Lens.At

type Index (HashSet a) = a
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (Vector a) 
Instance details

Defined in Control.Lens.At

type Index (Vector a) = Int
type Index (V2 a) 
Instance details

Defined in Linear.V2

type Index (V2 a) = E V2
type Index (V3 a) 
Instance details

Defined in Linear.V3

type Index (V3 a) = E V3
type Index (V1 a) 
Instance details

Defined in Linear.V1

type Index (V1 a) = E V1
type Index (Plucker a) 
Instance details

Defined in Linear.Plucker

type Index (Plucker a) = E Plucker
type Index (Quaternion a) 
Instance details

Defined in Linear.Quaternion

type Index (Quaternion a) = E Quaternion
type Index (V0 a) 
Instance details

Defined in Linear.V0

type Index (V0 a) = E V0
type Index (V4 a) 
Instance details

Defined in Linear.V4

type Index (V4 a) = E V4
type Index (e -> a) 
Instance details

Defined in Control.Lens.At

type Index (e -> a) = e
type Index (a, b) 
Instance details

Defined in Control.Lens.At

type Index (a, b) = Int
type Index (HashMap k a) 
Instance details

Defined in Control.Lens.At

type Index (HashMap k a) = k
type Index (Map k a) 
Instance details

Defined in Control.Lens.At

type Index (Map k a) = k
type Index (UArray i e) 
Instance details

Defined in Control.Lens.At

type Index (UArray i e) = i
type Index (Array i e) 
Instance details

Defined in Control.Lens.At

type Index (Array i e) = i
type Index (Style v n) 
Instance details

Defined in Diagrams.Core.Style

type Index (Style v n) = TypeRep
type Index (Point f a) 
Instance details

Defined in Linear.Affine

type Index (Point f a) = Index (f a)
type Index (a, b, c) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c) = Int
type Index (V n a) 
Instance details

Defined in Linear.V

type Index (V n a) = Int
type Index (a, b, c, d) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d) = Int
type Index (a, b, c, d, e) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e) = Int
type Index (a, b, c, d, e, f) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f) = Int
type Index (a, b, c, d, e, f, g) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g) = Int
type Index (a, b, c, d, e, f, g, h) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g, h) = Int
type Index (a, b, c, d, e, f, g, h, i) 
Instance details

Defined in Control.Lens.At

type Index (a, b, c, d, e, f, g, h, i) = Int

type family IxValue m :: Type #

Instances
type IxValue ByteString 
Instance details

Defined in Control.Lens.At

type IxValue ByteString = Word8
type IxValue ByteString 
Instance details

Defined in Control.Lens.At

type IxValue ByteString = Word8
type IxValue Text 
Instance details

Defined in Control.Lens.At

type IxValue Text = Char
type IxValue Text 
Instance details

Defined in Control.Lens.At

type IxValue Text = Char
type IxValue IntSet 
Instance details

Defined in Control.Lens.At

type IxValue IntSet = ()
type IxValue ColourMap 
Instance details

Defined in Plots.Style

type IxValue ColourMap = Colour Double
type IxValue [a] 
Instance details

Defined in Control.Lens.At

type IxValue [a] = a
type IxValue (Maybe a) 
Instance details

Defined in Control.Lens.At

type IxValue (Maybe a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (Identity a) 
Instance details

Defined in Control.Lens.At

type IxValue (Identity a) = a
type IxValue (NonEmpty a) 
Instance details

Defined in Control.Lens.At

type IxValue (NonEmpty a) = a
type IxValue (IntMap a) 
Instance details

Defined in Control.Lens.At

type IxValue (IntMap a) = a
type IxValue (Tree a) 
Instance details

Defined in Control.Lens.At

type IxValue (Tree a) = a
type IxValue (Seq a) 
Instance details

Defined in Control.Lens.At

type IxValue (Seq a) = a
type IxValue (Set k) 
Instance details

Defined in Control.Lens.At

type IxValue (Set k) = ()
type IxValue (HashSet k) 
Instance details

Defined in Control.Lens.At

type IxValue (HashSet k) = ()
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (Vector a) 
Instance details

Defined in Control.Lens.At

type IxValue (Vector a) = a
type IxValue (V2 a) 
Instance details

Defined in Linear.V2

type IxValue (V2 a) = a
type IxValue (V3 a) 
Instance details

Defined in Linear.V3

type IxValue (V3 a) = a
type IxValue (V1 a) 
Instance details

Defined in Linear.V1

type IxValue (V1 a) = a
type IxValue (Plucker a) 
Instance details

Defined in Linear.Plucker

type IxValue (Plucker a) = a
type IxValue (Quaternion a) 
Instance details

Defined in Linear.Quaternion

type IxValue (Quaternion a) = a
type IxValue (V0 a) 
Instance details

Defined in Linear.V0

type IxValue (V0 a) = a
type IxValue (V4 a) 
Instance details

Defined in Linear.V4

type IxValue (V4 a) = a
type IxValue (e -> a) 
Instance details

Defined in Control.Lens.At

type IxValue (e -> a) = a
type IxValue (a, a2) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2) = a
type IxValue (HashMap k a) 
Instance details

Defined in Control.Lens.At

type IxValue (HashMap k a) = a
type IxValue (Map k a) 
Instance details

Defined in Control.Lens.At

type IxValue (Map k a) = a
type IxValue (UArray i e) 
Instance details

Defined in Control.Lens.At

type IxValue (UArray i e) = e
type IxValue (Array i e) 
Instance details

Defined in Control.Lens.At

type IxValue (Array i e) = e
type IxValue (Style v n) 
Instance details

Defined in Diagrams.Core.Style

type IxValue (Style v n) = Attribute v n
type IxValue (Point f a) 
Instance details

Defined in Linear.Affine

type IxValue (Point f a) = IxValue (f a)
type IxValue (a, a2, a3) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3) = a
type IxValue (V n a) 
Instance details

Defined in Linear.V

type IxValue (V n a) = a
type IxValue (a, a2, a3, a4) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4) = a
type IxValue (a, a2, a3, a4, a5) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5) = a
type IxValue (a, a2, a3, a4, a5, a6) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6) = a
type IxValue (a, a2, a3, a4, a5, a6, a7) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7, a8) = a
type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9) 
Instance details

Defined in Control.Lens.At

type IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9) = a

class Ixed m where #

Minimal complete definition

Nothing

Methods

ix :: Index m -> Traversal' m (IxValue m) #

Instances
Ixed ByteString 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #

Ixed ByteString 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index ByteString -> Traversal' ByteString (IxValue ByteString) #

Ixed Text 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index Text -> Traversal' Text (IxValue Text) #

Ixed Text 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index Text -> Traversal' Text (IxValue Text) #

Ixed IntSet 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index IntSet -> Traversal' IntSet (IxValue IntSet) #

Ixed ColourMap 
Instance details

Defined in Plots.Style

Methods

ix :: Index ColourMap -> Traversal' ColourMap (IxValue ColourMap) #

Ixed [a] 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index [a] -> Traversal' [a] (IxValue [a]) #

Ixed (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #

Storable a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Ixed (Identity a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Identity a) -> Traversal' (Identity a) (IxValue (Identity a)) #

Ixed (NonEmpty a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (NonEmpty a) -> Traversal' (NonEmpty a) (IxValue (NonEmpty a)) #

Ixed (IntMap a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (IntMap a) -> Traversal' (IntMap a) (IxValue (IntMap a)) #

Ixed (Tree a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Tree a) -> Traversal' (Tree a) (IxValue (Tree a)) #

Ixed (Seq a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Seq a) -> Traversal' (Seq a) (IxValue (Seq a)) #

Ord k => Ixed (Set k) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Set k) -> Traversal' (Set k) (IxValue (Set k)) #

(Eq k, Hashable k) => Ixed (HashSet k) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (HashSet k) -> Traversal' (HashSet k) (IxValue (HashSet k)) #

Unbox a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Prim a => Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Ixed (Vector a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Vector a) -> Traversal' (Vector a) (IxValue (Vector a)) #

Ixed (V2 a) 
Instance details

Defined in Linear.V2

Methods

ix :: Index (V2 a) -> Traversal' (V2 a) (IxValue (V2 a)) #

Ixed (V3 a) 
Instance details

Defined in Linear.V3

Methods

ix :: Index (V3 a) -> Traversal' (V3 a) (IxValue (V3 a)) #

Ixed (V1 a) 
Instance details

Defined in Linear.V1

Methods

ix :: Index (V1 a) -> Traversal' (V1 a) (IxValue (V1 a)) #

Ixed (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

ix :: Index (Plucker a) -> Traversal' (Plucker a) (IxValue (Plucker a)) #

Ixed (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

ix :: Index (Quaternion a) -> Traversal' (Quaternion a) (IxValue (Quaternion a)) #

Ixed (V0 a) 
Instance details

Defined in Linear.V0

Methods

ix :: Index (V0 a) -> Traversal' (V0 a) (IxValue (V0 a)) #

Ixed (V4 a) 
Instance details

Defined in Linear.V4

Methods

ix :: Index (V4 a) -> Traversal' (V4 a) (IxValue (V4 a)) #

Eq e => Ixed (e -> a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (e -> a) -> Traversal' (e -> a) (IxValue (e -> a)) #

a ~ a2 => Ixed (a, a2) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2) -> Traversal' (a, a2) (IxValue (a, a2)) #

(Eq k, Hashable k) => Ixed (HashMap k a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (HashMap k a) -> Traversal' (HashMap k a) (IxValue (HashMap k a)) #

Ord k => Ixed (Map k a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Map k a) -> Traversal' (Map k a) (IxValue (Map k a)) #

(IArray UArray e, Ix i) => Ixed (UArray i e) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (UArray i e) -> Traversal' (UArray i e) (IxValue (UArray i e)) #

Ix i => Ixed (Array i e) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Array i e) -> Traversal' (Array i e) (IxValue (Array i e)) #

Ixed (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

ix :: Index (Style v n) -> Traversal' (Style v n) (IxValue (Style v n)) #

Ixed (f a) => Ixed (Point f a) 
Instance details

Defined in Linear.Affine

Methods

ix :: Index (Point f a) -> Traversal' (Point f a) (IxValue (Point f a)) #

(a ~ a2, a ~ a3) => Ixed (a, a2, a3) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3) -> Traversal' (a, a2, a3) (IxValue (a, a2, a3)) #

Ixed (V n a) 
Instance details

Defined in Linear.V

Methods

ix :: Index (V n a) -> Traversal' (V n a) (IxValue (V n a)) #

(a ~ a2, a ~ a3, a ~ a4) => Ixed (a, a2, a3, a4) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4) -> Traversal' (a, a2, a3, a4) (IxValue (a, a2, a3, a4)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5) => Ixed (a, a2, a3, a4, a5) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5) -> Traversal' (a, a2, a3, a4, a5) (IxValue (a, a2, a3, a4, a5)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6) => Ixed (a, a2, a3, a4, a5, a6) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6) -> Traversal' (a, a2, a3, a4, a5, a6) (IxValue (a, a2, a3, a4, a5, a6)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7) => Ixed (a, a2, a3, a4, a5, a6, a7) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7) -> Traversal' (a, a2, a3, a4, a5, a6, a7) (IxValue (a, a2, a3, a4, a5, a6, a7)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8) => Ixed (a, a2, a3, a4, a5, a6, a7, a8) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7, a8) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8) (IxValue (a, a2, a3, a4, a5, a6, a7, a8)) #

(a ~ a2, a ~ a3, a ~ a4, a ~ a5, a ~ a6, a ~ a7, a ~ a8, a ~ a9) => Ixed (a, a2, a3, a4, a5, a6, a7, a8, a9) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (a, a2, a3, a4, a5, a6, a7, a8, a9) -> Traversal' (a, a2, a3, a4, a5, a6, a7, a8, a9) (IxValue (a, a2, a3, a4, a5, a6, a7, a8, a9)) #

type AnEquality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = Identical a (Proxy b) a (Proxy b) -> Identical a (Proxy b) s (Proxy t) #

type AnEquality' (s :: k2) (a :: k2) = AnEquality s s a a #

data Identical (a :: k) (b :: k1) (s :: k) (t :: k1) :: forall k k1. k -> k1 -> k -> k1 -> Type where #

Constructors

Identical :: forall k k1 (a :: k) (b :: k1) (s :: k) (t :: k1). Identical a b a b 

type Accessing (p :: Type -> Type -> Type) m s a = p a (Const m a) -> s -> Const m s #

type Getting r s a = (a -> Const r a) -> s -> Const r s #

type IndexedGetting i m s a = Indexed i a (Const m a) -> s -> Const m s #

class Foldable f => FoldableWithIndex i (f :: Type -> Type) | f -> i where #

Minimal complete definition

Nothing

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> f a -> m #

ifolded :: IndexedFold i (f a) a #

ifoldr :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> f a -> b #

Instances
FoldableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m #

ifolded :: IndexedFold Int [a] a #

ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #

FoldableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m #

ifolded :: IndexedFold Int (ZipList a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

FoldableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m #

ifolded :: IndexedFold Int (NonEmpty a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

FoldableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m #

ifolded :: IndexedFold Int (IntMap a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

FoldableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m #

ifolded :: IndexedFold Int (Seq a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #

FoldableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m #

ifolded :: IndexedFold Int (Vector a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #

FoldableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m #

ifolded :: IndexedFold () (Maybe a) a #

ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #

FoldableWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Par1 a -> m #

ifolded :: IndexedFold () (Par1 a) a #

ifoldr :: (() -> a -> b -> b) -> b -> Par1 a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Par1 a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Par1 a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Par1 a -> b #

FoldableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Identity a -> m #

ifolded :: IndexedFold () (Identity a) a #

ifoldr :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Identity a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Identity a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Identity a -> b #

FoldableWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> Map k a -> m #

ifolded :: IndexedFold k (Map k a) a #

ifoldr :: (k -> a -> b -> b) -> b -> Map k a -> b #

ifoldl :: (k -> b -> a -> b) -> b -> Map k a -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> Map k a -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> Map k a -> b #

FoldableWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> HashMap k a -> m #

ifolded :: IndexedFold k (HashMap k a) a #

ifoldr :: (k -> a -> b -> b) -> b -> HashMap k a -> b #

ifoldl :: (k -> b -> a -> b) -> b -> HashMap k a -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> HashMap k a -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> HashMap k a -> b #

FoldableWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (k -> a -> m) -> (k, a) -> m #

ifolded :: IndexedFold k (k, a) a #

ifoldr :: (k -> a -> b -> b) -> b -> (k, a) -> b #

ifoldl :: (k -> b -> a -> b) -> b -> (k, a) -> b #

ifoldr' :: (k -> a -> b -> b) -> b -> (k, a) -> b #

ifoldl' :: (k -> b -> a -> b) -> b -> (k, a) -> b #

FoldableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m #

ifolded :: IndexedFold i (Level i a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #

Ix i => FoldableWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Array i a -> m #

ifolded :: IndexedFold i (Array i a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Array i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Array i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Array i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Array i a -> b #

FoldableWithIndex Void (V1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> V1 a -> m #

ifolded :: IndexedFold Void (V1 a) a #

ifoldr :: (Void -> a -> b -> b) -> b -> V1 a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> V1 a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> V1 a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> V1 a -> b #

FoldableWithIndex Void (U1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> U1 a -> m #

ifolded :: IndexedFold Void (U1 a) a #

ifoldr :: (Void -> a -> b -> b) -> b -> U1 a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> U1 a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> U1 a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> U1 a -> b #

FoldableWithIndex Void (Proxy :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> Proxy a -> m #

ifolded :: IndexedFold Void (Proxy a) a #

ifoldr :: (Void -> a -> b -> b) -> b -> Proxy a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> Proxy a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> Proxy a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> Proxy a -> b #

FoldableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m #

ifolded :: IndexedFold Int (V n a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b #

FoldableWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a0 -> m) -> Tagged a a0 -> m #

ifolded :: IndexedFold () (Tagged a a0) a0 #

ifoldr :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b #

ifoldl :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b #

ifoldr' :: (() -> a0 -> b -> b) -> b -> Tagged a a0 -> b #

ifoldl' :: (() -> b -> a0 -> b) -> b -> Tagged a a0 -> b #

FoldableWithIndex i f => FoldableWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Reverse f a -> m #

ifolded :: IndexedFold i (Reverse f a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Reverse f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Reverse f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Reverse f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Reverse f a -> b #

FoldableWithIndex i f => FoldableWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Rec1 f a -> m #

ifolded :: IndexedFold i (Rec1 f a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Rec1 f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Rec1 f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Rec1 f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Rec1 f a -> b #

FoldableWithIndex i m => FoldableWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m0 => (i -> a -> m0) -> IdentityT m a -> m0 #

ifolded :: IndexedFold i (IdentityT m a) a #

ifoldr :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

FoldableWithIndex i f => FoldableWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Backwards f a -> m #

ifolded :: IndexedFold i (Backwards f a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Backwards f a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Backwards f a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Backwards f a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Backwards f a -> b #

FoldableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m #

ifolded :: IndexedFold i (Magma i t b a) a #

ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

FoldableWithIndex Void (K1 i c :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Void -> a -> m) -> K1 i c a -> m #

ifolded :: IndexedFold Void (K1 i c a) a #

ifoldr :: (Void -> a -> b -> b) -> b -> K1 i c a -> b #

ifoldl :: (Void -> b -> a -> b) -> b -> K1 i c a -> b #

ifoldr' :: (Void -> a -> b -> b) -> b -> K1 i c a -> b #

ifoldl' :: (Void -> b -> a -> b) -> b -> K1 i c a -> b #

FoldableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m #

ifolded :: IndexedFold [Int] (Tree a) a #

ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

FoldableWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

ifoldMap :: Monoid m => (E V2 -> a -> m) -> V2 a -> m #

ifolded :: IndexedFold (E V2) (V2 a) a #

ifoldr :: (E V2 -> a -> b -> b) -> b -> V2 a -> b #

ifoldl :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #

ifoldr' :: (E V2 -> a -> b -> b) -> b -> V2 a -> b #

ifoldl' :: (E V2 -> b -> a -> b) -> b -> V2 a -> b #

FoldableWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

ifoldMap :: Monoid m => (E V3 -> a -> m) -> V3 a -> m #

ifolded :: IndexedFold (E V3) (V3 a) a #

ifoldr :: (E V3 -> a -> b -> b) -> b -> V3 a -> b #

ifoldl :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #

ifoldr' :: (E V3 -> a -> b -> b) -> b -> V3 a -> b #

ifoldl' :: (E V3 -> b -> a -> b) -> b -> V3 a -> b #

FoldableWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

ifoldMap :: Monoid m => (E V1 -> a -> m) -> V1 a -> m #

ifolded :: IndexedFold (E V1) (V1 a) a #

ifoldr :: (E V1 -> a -> b -> b) -> b -> V1 a -> b #

ifoldl :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #

ifoldr' :: (E V1 -> a -> b -> b) -> b -> V1 a -> b #

ifoldl' :: (E V1 -> b -> a -> b) -> b -> V1 a -> b #

FoldableWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

ifoldMap :: Monoid m => (E Plucker -> a -> m) -> Plucker a -> m #

ifolded :: IndexedFold (E Plucker) (Plucker a) a #

ifoldr :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b #

ifoldl :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #

ifoldr' :: (E Plucker -> a -> b -> b) -> b -> Plucker a -> b #

ifoldl' :: (E Plucker -> b -> a -> b) -> b -> Plucker a -> b #

FoldableWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

ifoldMap :: Monoid m => (E Quaternion -> a -> m) -> Quaternion a -> m #

ifolded :: IndexedFold (E Quaternion) (Quaternion a) a #

ifoldr :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b #

ifoldl :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #

ifoldr' :: (E Quaternion -> a -> b -> b) -> b -> Quaternion a -> b #

ifoldl' :: (E Quaternion -> b -> a -> b) -> b -> Quaternion a -> b #

FoldableWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

ifoldMap :: Monoid m => (E V0 -> a -> m) -> V0 a -> m #

ifolded :: IndexedFold (E V0) (V0 a) a #

ifoldr :: (E V0 -> a -> b -> b) -> b -> V0 a -> b #

ifoldl :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #

ifoldr' :: (E V0 -> a -> b -> b) -> b -> V0 a -> b #

ifoldl' :: (E V0 -> b -> a -> b) -> b -> V0 a -> b #

FoldableWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

ifoldMap :: Monoid m => (E V4 -> a -> m) -> V4 a -> m #

ifolded :: IndexedFold (E V4) (V4 a) a #

ifoldr :: (E V4 -> a -> b -> b) -> b -> V4 a -> b #

ifoldl :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #

ifoldr' :: (E V4 -> a -> b -> b) -> b -> V4 a -> b #

ifoldl' :: (E V4 -> b -> a -> b) -> b -> V4 a -> b #

FoldableWithIndex i f => FoldableWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([i] -> a -> m) -> Free f a -> m #

ifolded :: IndexedFold [i] (Free f a) a #

ifoldr :: ([i] -> a -> b -> b) -> b -> Free f a -> b #

ifoldl :: ([i] -> b -> a -> b) -> b -> Free f a -> b #

ifoldr' :: ([i] -> a -> b -> b) -> b -> Free f a -> b #

ifoldl' :: ([i] -> b -> a -> b) -> b -> Free f a -> b #

FoldableWithIndex i f => FoldableWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([i] -> a -> m) -> Cofree f a -> m #

ifolded :: IndexedFold [i] (Cofree f a) a #

ifoldr :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b #

ifoldl :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b #

ifoldr' :: ([i] -> a -> b -> b) -> b -> Cofree f a -> b #

ifoldl' :: ([i] -> b -> a -> b) -> b -> Cofree f a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m #

ifolded :: IndexedFold (Either i j) (Sum f g a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m #

ifolded :: IndexedFold (Either i j) (Product f g a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m #

ifolded :: IndexedFold (Either i j) ((f :+: g) a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m #

ifolded :: IndexedFold (Either i j) ((f :*: g) a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ((i, j) -> a -> m) -> Compose f g a -> m #

ifolded :: IndexedFold (i, j) (Compose f g a) a #

ifoldr :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b #

ifoldl :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b #

ifoldr' :: ((i, j) -> a -> b -> b) -> b -> Compose f g a -> b #

ifoldl' :: ((i, j) -> b -> a -> b) -> b -> Compose f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ((i, j) -> a -> m) -> (f :.: g) a -> m #

ifolded :: IndexedFold (i, j) ((f :.: g) a) a #

ifoldr :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b #

ifoldl :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b #

ifoldr' :: ((i, j) -> a -> b -> b) -> b -> (f :.: g) a -> b #

ifoldl' :: ((i, j) -> b -> a -> b) -> b -> (f :.: g) a -> b #

class Functor f => FunctorWithIndex i (f :: Type -> Type) | f -> i where #

Minimal complete definition

Nothing

Methods

imap :: (i -> a -> b) -> f a -> f b #

imapped :: IndexedSetter i (f a) (f b) a b #

Instances
FunctorWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> [a] -> [b] #

imapped :: IndexedSetter Int [a] [b] a b #

FunctorWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> ZipList a -> ZipList b #

imapped :: IndexedSetter Int (ZipList a) (ZipList b) a b #

FunctorWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b #

imapped :: IndexedSetter Int (NonEmpty a) (NonEmpty b) a b #

FunctorWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> IntMap a -> IntMap b #

imapped :: IndexedSetter Int (IntMap a) (IntMap b) a b #

FunctorWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Seq a -> Seq b #

imapped :: IndexedSetter Int (Seq a) (Seq b) a b #

FunctorWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Vector a -> Vector b #

imapped :: IndexedSetter Int (Vector a) (Vector b) a b #

FunctorWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Maybe a -> Maybe b #

imapped :: IndexedSetter () (Maybe a) (Maybe b) a b #

FunctorWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Par1 a -> Par1 b #

imapped :: IndexedSetter () (Par1 a) (Par1 b) a b #

FunctorWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Identity a -> Identity b #

imapped :: IndexedSetter () (Identity a) (Identity b) a b #

FunctorWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> Map k a -> Map k b #

imapped :: IndexedSetter k (Map k a) (Map k b) a b #

FunctorWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> HashMap k a -> HashMap k b #

imapped :: IndexedSetter k (HashMap k a) (HashMap k b) a b #

FunctorWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (k -> a -> b) -> (k, a) -> (k, b) #

imapped :: IndexedSetter k (k, a) (k, b) a b #

FunctorWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Level i a -> Level i b #

imapped :: IndexedSetter i (Level i a) (Level i b) a b #

Ix i => FunctorWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Array i a -> Array i b #

imapped :: IndexedSetter i (Array i a) (Array i b) a b #

FunctorWithIndex Void (V1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> V1 a -> V1 b #

imapped :: IndexedSetter Void (V1 a) (V1 b) a b #

FunctorWithIndex Void (U1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> U1 a -> U1 b #

imapped :: IndexedSetter Void (U1 a) (U1 b) a b #

FunctorWithIndex Void (Proxy :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> Proxy a -> Proxy b #

imapped :: IndexedSetter Void (Proxy a) (Proxy b) a b #

FunctorWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

imap :: (Int -> a -> b) -> V n a -> V n b #

imapped :: IndexedSetter Int (V n a) (V n b) a b #

FunctorWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a0 -> b) -> Tagged a a0 -> Tagged a b #

imapped :: IndexedSetter () (Tagged a a0) (Tagged a b) a0 b #

FunctorWithIndex i f => FunctorWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Reverse f a -> Reverse f b #

imapped :: IndexedSetter i (Reverse f a) (Reverse f b) a b #

FunctorWithIndex i f => FunctorWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Rec1 f a -> Rec1 f b #

imapped :: IndexedSetter i (Rec1 f a) (Rec1 f b) a b #

FunctorWithIndex i m => FunctorWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> IdentityT m a -> IdentityT m b #

imapped :: IndexedSetter i (IdentityT m a) (IdentityT m b) a b #

FunctorWithIndex i f => FunctorWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Backwards f a -> Backwards f b #

imapped :: IndexedSetter i (Backwards f a) (Backwards f b) a b #

FunctorWithIndex r ((->) r :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (r -> a -> b) -> (r -> a) -> r -> b #

imapped :: IndexedSetter r (r -> a) (r -> b) a b #

FunctorWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 #

imapped :: IndexedSetter i (Magma i t b a) (Magma i t b b0) a b0 #

FunctorWithIndex Void (K1 i c :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Void -> a -> b) -> K1 i c a -> K1 i c b #

imapped :: IndexedSetter Void (K1 i c a) (K1 i c b) a b #

FunctorWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([Int] -> a -> b) -> Tree a -> Tree b #

imapped :: IndexedSetter [Int] (Tree a) (Tree b) a b #

FunctorWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

imap :: (E V2 -> a -> b) -> V2 a -> V2 b #

imapped :: IndexedSetter (E V2) (V2 a) (V2 b) a b #

FunctorWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

imap :: (E V3 -> a -> b) -> V3 a -> V3 b #

imapped :: IndexedSetter (E V3) (V3 a) (V3 b) a b #

FunctorWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

imap :: (E V1 -> a -> b) -> V1 a -> V1 b #

imapped :: IndexedSetter (E V1) (V1 a) (V1 b) a b #

FunctorWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

imap :: (E Plucker -> a -> b) -> Plucker a -> Plucker b #

imapped :: IndexedSetter (E Plucker) (Plucker a) (Plucker b) a b #

FunctorWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

imap :: (E Quaternion -> a -> b) -> Quaternion a -> Quaternion b #

imapped :: IndexedSetter (E Quaternion) (Quaternion a) (Quaternion b) a b #

FunctorWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

imap :: (E V0 -> a -> b) -> V0 a -> V0 b #

imapped :: IndexedSetter (E V0) (V0 a) (V0 b) a b #

FunctorWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

imap :: (E V4 -> a -> b) -> V4 a -> V4 b #

imapped :: IndexedSetter (E V4) (V4 a) (V4 b) a b #

FunctorWithIndex i f => FunctorWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([i] -> a -> b) -> Free f a -> Free f b #

imapped :: IndexedSetter [i] (Free f a) (Free f b) a b #

FunctorWithIndex i f => FunctorWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([i] -> a -> b) -> Cofree f a -> Cofree f b #

imapped :: IndexedSetter [i] (Cofree f a) (Cofree f b) a b #

FunctorWithIndex i w => FunctorWithIndex (s, i) (TracedT s w) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((s, i) -> a -> b) -> TracedT s w a -> TracedT s w b #

imapped :: IndexedSetter (s, i) (TracedT s w a) (TracedT s w b) a b #

FunctorWithIndex i m => FunctorWithIndex (e, i) (ReaderT e m) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((e, i) -> a -> b) -> ReaderT e m a -> ReaderT e m b #

imapped :: IndexedSetter (e, i) (ReaderT e m a) (ReaderT e m b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b #

imapped :: IndexedSetter (Either i j) (Sum f g a) (Sum f g b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b #

imapped :: IndexedSetter (Either i j) (Product f g a) (Product f g b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b #

imapped :: IndexedSetter (Either i j) ((f :+: g) a) ((f :+: g) b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :*: g) a -> (f :*: g) b #

imapped :: IndexedSetter (Either i j) ((f :*: g) a) ((f :*: g) b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((i, j) -> a -> b) -> Compose f g a -> Compose f g b #

imapped :: IndexedSetter (i, j) (Compose f g a) (Compose f g b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ((i, j) -> a -> b) -> (f :.: g) a -> (f :.: g) b #

imapped :: IndexedSetter (i, j) ((f :.: g) a) ((f :.: g) b) a b #

class (FunctorWithIndex i t, FoldableWithIndex i t, Traversable t) => TraversableWithIndex i (t :: Type -> Type) | t -> i where #

Minimal complete definition

Nothing

Methods

itraverse :: Applicative f => (i -> a -> f b) -> t a -> f (t b) #

itraversed :: IndexedTraversal i (t a) (t b) a b #

Instances
TraversableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] #

itraversed :: IndexedTraversal Int [a] [b] a b #

TraversableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) #

itraversed :: IndexedTraversal Int (ZipList a) (ZipList b) a b #

TraversableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) #

itraversed :: IndexedTraversal Int (NonEmpty a) (NonEmpty b) a b #

TraversableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) #

itraversed :: IndexedTraversal Int (IntMap a) (IntMap b) a b #

TraversableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) #

itraversed :: IndexedTraversal Int (Seq a) (Seq b) a b #

TraversableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) #

itraversed :: IndexedTraversal Int (Vector a) (Vector b) a b #

TraversableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) #

itraversed :: IndexedTraversal () (Maybe a) (Maybe b) a b #

TraversableWithIndex () Par1 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Par1 a -> f (Par1 b) #

itraversed :: IndexedTraversal () (Par1 a) (Par1 b) a b #

TraversableWithIndex () Identity 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Identity a -> f (Identity b) #

itraversed :: IndexedTraversal () (Identity a) (Identity b) a b #

TraversableWithIndex k (Map k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> Map k a -> f (Map k b) #

itraversed :: IndexedTraversal k (Map k a) (Map k b) a b #

TraversableWithIndex k (HashMap k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> HashMap k a -> f (HashMap k b) #

itraversed :: IndexedTraversal k (HashMap k a) (HashMap k b) a b #

TraversableWithIndex k ((,) k) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (k -> a -> f b) -> (k, a) -> f (k, b) #

itraversed :: IndexedTraversal k (k, a) (k, b) a b #

TraversableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) #

itraversed :: IndexedTraversal i (Level i a) (Level i b) a b #

Ix i => TraversableWithIndex i (Array i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Array i a -> f (Array i b) #

itraversed :: IndexedTraversal i (Array i a) (Array i b) a b #

TraversableWithIndex Void (V1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> V1 a -> f (V1 b) #

itraversed :: IndexedTraversal Void (V1 a) (V1 b) a b #

TraversableWithIndex Void (U1 :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> U1 a -> f (U1 b) #

itraversed :: IndexedTraversal Void (U1 a) (U1 b) a b #

TraversableWithIndex Void (Proxy :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> Proxy a -> f (Proxy b) #

itraversed :: IndexedTraversal Void (Proxy a) (Proxy b) a b #

TraversableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b) #

itraversed :: IndexedTraversal Int (V n a) (V n b) a b #

TraversableWithIndex () (Tagged a) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a0 -> f b) -> Tagged a a0 -> f (Tagged a b) #

itraversed :: IndexedTraversal () (Tagged a a0) (Tagged a b) a0 b #

TraversableWithIndex i f => TraversableWithIndex i (Reverse f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Reverse f a -> f0 (Reverse f b) #

itraversed :: IndexedTraversal i (Reverse f a) (Reverse f b) a b #

TraversableWithIndex i f => TraversableWithIndex i (Rec1 f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

itraversed :: IndexedTraversal i (Rec1 f a) (Rec1 f b) a b #

TraversableWithIndex i m => TraversableWithIndex i (IdentityT m) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> IdentityT m a -> f (IdentityT m b) #

itraversed :: IndexedTraversal i (IdentityT m a) (IdentityT m b) a b #

TraversableWithIndex i f => TraversableWithIndex i (Backwards f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (i -> a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

itraversed :: IndexedTraversal i (Backwards f a) (Backwards f b) a b #

TraversableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

itraversed :: IndexedTraversal i (Magma i t b a) (Magma i t b b0) a b0 #

TraversableWithIndex Void (K1 i c :: Type -> Type) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Void -> a -> f b) -> K1 i c a -> f (K1 i c b) #

itraversed :: IndexedTraversal Void (K1 i c a) (K1 i c b) a b #

TraversableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) #

itraversed :: IndexedTraversal [Int] (Tree a) (Tree b) a b #

TraversableWithIndex (E V2) V2 
Instance details

Defined in Linear.V2

Methods

itraverse :: Applicative f => (E V2 -> a -> f b) -> V2 a -> f (V2 b) #

itraversed :: IndexedTraversal (E V2) (V2 a) (V2 b) a b #

TraversableWithIndex (E V3) V3 
Instance details

Defined in Linear.V3

Methods

itraverse :: Applicative f => (E V3 -> a -> f b) -> V3 a -> f (V3 b) #

itraversed :: IndexedTraversal (E V3) (V3 a) (V3 b) a b #

TraversableWithIndex (E V1) V1 
Instance details

Defined in Linear.V1

Methods

itraverse :: Applicative f => (E V1 -> a -> f b) -> V1 a -> f (V1 b) #

itraversed :: IndexedTraversal (E V1) (V1 a) (V1 b) a b #

TraversableWithIndex (E Plucker) Plucker 
Instance details

Defined in Linear.Plucker

Methods

itraverse :: Applicative f => (E Plucker -> a -> f b) -> Plucker a -> f (Plucker b) #

itraversed :: IndexedTraversal (E Plucker) (Plucker a) (Plucker b) a b #

TraversableWithIndex (E Quaternion) Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

itraverse :: Applicative f => (E Quaternion -> a -> f b) -> Quaternion a -> f (Quaternion b) #

itraversed :: IndexedTraversal (E Quaternion) (Quaternion a) (Quaternion b) a b #

TraversableWithIndex (E V0) V0 
Instance details

Defined in Linear.V0

Methods

itraverse :: Applicative f => (E V0 -> a -> f b) -> V0 a -> f (V0 b) #

itraversed :: IndexedTraversal (E V0) (V0 a) (V0 b) a b #

TraversableWithIndex (E V4) V4 
Instance details

Defined in Linear.V4

Methods

itraverse :: Applicative f => (E V4 -> a -> f b) -> V4 a -> f (V4 b) #

itraversed :: IndexedTraversal (E V4) (V4 a) (V4 b) a b #

TraversableWithIndex i f => TraversableWithIndex [i] (Free f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Free f a -> f0 (Free f b) #

itraversed :: IndexedTraversal [i] (Free f a) (Free f b) a b #

TraversableWithIndex i f => TraversableWithIndex [i] (Cofree f) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ([i] -> a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

itraversed :: IndexedTraversal [i] (Cofree f a) (Cofree f b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

itraversed :: IndexedTraversal (Either i j) (Sum f g a) (Sum f g b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) #

itraversed :: IndexedTraversal (Either i j) (Product f g a) (Product f g b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

itraversed :: IndexedTraversal (Either i j) ((f :+: g) a) ((f :+: g) b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

itraversed :: IndexedTraversal (Either i j) ((f :*: g) a) ((f :*: g) b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (Compose f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

itraversed :: IndexedTraversal (i, j) (Compose f g a) (Compose f g b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (i, j) (f :.: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => ((i, j) -> a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

itraversed :: IndexedTraversal (i, j) ((f :.: g) a) ((f :.: g) b) a b #

newtype Bazaar (p :: Type -> Type -> Type) a b t #

Constructors

Bazaar 

Fields

Instances
Profunctor p => Bizarre p (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

bazaar :: Applicative f => p a (f b) -> Bazaar p a b t -> f t

Corepresentable p => Sellable p (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

sell :: p a (Bazaar p a b b)

Conjoined p => IndexedComonad (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

iextract :: Bazaar p a a t -> t

iduplicate :: Bazaar p a c t -> Bazaar p a b (Bazaar p b c t)

iextend :: (Bazaar p b c t -> r) -> Bazaar p a c t -> Bazaar p a b r

IndexedFunctor (Bazaar p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

ifmap :: (s -> t) -> Bazaar p a b s -> Bazaar p a b t

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Applicative (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> Bazaar p a b a0 #

(<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c #

(*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #

(<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

(a ~ b, Conjoined p) => Comonad (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

extract :: Bazaar p a b a0 -> a0 #

duplicate :: Bazaar p a b a0 -> Bazaar p a b (Bazaar p a b a0) #

extend :: (Bazaar p a b a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(a ~ b, Conjoined p) => ComonadApply (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<@>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(@>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #

(<@) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Apply (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<.>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(.>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #

(<.) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

liftF2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c #

type Bazaar' (p :: Type -> Type -> Type) a = Bazaar p a a #

newtype Bazaar1 (p :: Type -> Type -> Type) a b t #

Constructors

Bazaar1 

Fields

Instances
Corepresentable p => Sellable p (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

sell :: p a (Bazaar1 p a b b)

Profunctor p => Bizarre1 p (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

bazaar1 :: Apply f => p a (f b) -> Bazaar1 p a b t -> f t

Conjoined p => IndexedComonad (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

iextract :: Bazaar1 p a a t -> t

iduplicate :: Bazaar1 p a c t -> Bazaar1 p a b (Bazaar1 p b c t)

iextend :: (Bazaar1 p b c t -> r) -> Bazaar1 p a c t -> Bazaar1 p a b r

IndexedFunctor (Bazaar1 p) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

ifmap :: (s -> t) -> Bazaar1 p a b s -> Bazaar1 p a b t

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

(a ~ b, Conjoined p) => Comonad (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

extract :: Bazaar1 p a b a0 -> a0 #

duplicate :: Bazaar1 p a b a0 -> Bazaar1 p a b (Bazaar1 p a b a0) #

extend :: (Bazaar1 p a b a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(a ~ b, Conjoined p) => ComonadApply (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<@>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(@>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0 #

(<@) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

Apply (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<.>) :: Bazaar1 p a b (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(.>) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b b0 #

(<.) :: Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

liftF2 :: (a0 -> b0 -> c) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b c #

type Bazaar1' (p :: Type -> Type -> Type) a = Bazaar1 p a a #

data Context a b t #

Constructors

Context (b -> t) a 
Instances
IndexedComonad Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

iextract :: Context a a t -> t

iduplicate :: Context a c t -> Context a b (Context b c t)

iextend :: (Context b c t -> r) -> Context a c t -> Context a b r

IndexedFunctor Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

ifmap :: (s -> t) -> Context a b s -> Context a b t

IndexedComonadStore Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

ipos :: Context a c t -> a

ipeek :: c -> Context a c t -> t

ipeeks :: (a -> c) -> Context a c t -> t

iseek :: b -> Context a c t -> Context b c t

iseeks :: (a -> b) -> Context a c t -> Context b c t

iexperiment :: Functor f => (b -> f c) -> Context b c t -> f t

context :: Context a b t -> Context a b t

a ~ b => ComonadStore a (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

pos :: Context a b a0 -> a #

peek :: a -> Context a b a0 -> a0 #

peeks :: (a -> a) -> Context a b a0 -> a0 #

seek :: a -> Context a b a0 -> Context a b a0 #

seeks :: (a -> a) -> Context a b a0 -> Context a b a0 #

experiment :: Functor f => (a -> f a) -> Context a b a0 -> f a0 #

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

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

a ~ b => Comonad (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

extract :: Context a b a0 -> a0 #

duplicate :: Context a b a0 -> Context a b (Context a b a0) #

extend :: (Context a b a0 -> b0) -> Context a b a0 -> Context a b b0 #

Sellable ((->) :: Type -> Type -> Type) Context 
Instance details

Defined in Control.Lens.Internal.Context

Methods

sell :: a -> Context a b b

type Context' a = Context a a #

type ClassyNamer = Name -> Maybe (Name, Name) #

data DefName #

Constructors

TopName Name 
MethodName Name Name 
Instances
Eq DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

(==) :: DefName -> DefName -> Bool #

(/=) :: DefName -> DefName -> Bool #

Ord DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

compare :: DefName -> DefName -> Ordering #

(<) :: DefName -> DefName -> Bool #

(<=) :: DefName -> DefName -> Bool #

(>) :: DefName -> DefName -> Bool #

(>=) :: DefName -> DefName -> Bool #

max :: DefName -> DefName -> DefName #

min :: DefName -> DefName -> DefName #

Show DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

showsPrec :: Int -> DefName -> ShowS #

show :: DefName -> String #

showList :: [DefName] -> ShowS #

type FieldNamer = Name -> [Name] -> Name -> [DefName] #

data LensRules #

data Leftmost a #

Instances
Semigroup (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Leftmost a -> Leftmost a -> Leftmost a #

sconcat :: NonEmpty (Leftmost a) -> Leftmost a #

stimes :: Integral b => b -> Leftmost a -> Leftmost a #

Monoid (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Leftmost a #

mappend :: Leftmost a -> Leftmost a -> Leftmost a #

mconcat :: [Leftmost a] -> Leftmost a #

data Rightmost a #

Instances
Semigroup (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Rightmost a -> Rightmost a -> Rightmost a #

sconcat :: NonEmpty (Rightmost a) -> Rightmost a #

stimes :: Integral b => b -> Rightmost a -> Rightmost a #

Monoid (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Rightmost a #

mappend :: Rightmost a -> Rightmost a -> Rightmost a #

mconcat :: [Rightmost a] -> Rightmost a #

data Sequenced a (m :: Type -> Type) #

Instances
Monad m => Semigroup (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m #

sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m #

stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #

Monad m => Monoid (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Sequenced a m #

mappend :: Sequenced a m -> Sequenced a m -> Sequenced a m #

mconcat :: [Sequenced a m] -> Sequenced a m #

data Traversed a (f :: Type -> Type) #

Instances
Applicative f => Semigroup (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Traversed a f -> Traversed a f -> Traversed a f #

sconcat :: NonEmpty (Traversed a f) -> Traversed a f #

stimes :: Integral b => b -> Traversed a f -> Traversed a f #

Applicative f => Monoid (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Traversed a f #

mappend :: Traversed a f -> Traversed a f -> Traversed a f #

mconcat :: [Traversed a f] -> Traversed a f #

class (Choice p, Corepresentable p, Comonad (Corep p), Traversable (Corep p), Strong p, Representable p, Monad (Rep p), MonadFix (Rep p), Distributive (Rep p), Costrong p, ArrowLoop p, ArrowApply p, ArrowChoice p, Closed p) => Conjoined (p :: Type -> Type -> Type) where #

Minimal complete definition

Nothing

Methods

distrib :: Functor f => p a b -> p (f a) (f b) #

conjoined :: ((p ~ ((->) :: Type -> Type -> Type)) -> q (a -> b) r) -> q (p a b) r -> q (p a b) r #

Instances
Conjoined ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) #

conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #

Conjoined (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) #

conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #

Conjoined ((->) :: Type -> Type -> Type) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => (a -> b) -> f a -> f b #

conjoined :: (((->) ~ (->)) -> q (a -> b) r) -> q (a -> b) r -> q (a -> b) r #

class Conjoined p => Indexable i (p :: Type -> Type -> Type) where #

Methods

indexed :: p a b -> i -> a -> b #

Instances
i ~ j => Indexable i (Indexed j) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: Indexed j a b -> i -> a -> b #

Indexable i ((->) :: Type -> Type -> Type) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: (a -> b) -> i -> a -> b #

newtype Indexed i a b #

Constructors

Indexed 

Fields

Instances
i ~ j => Indexable i (Indexed j) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

indexed :: Indexed j a b -> i -> a -> b #

Arrow (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

arr :: (b -> c) -> Indexed i b c #

first :: Indexed i b c -> Indexed i (b, d) (c, d) #

second :: Indexed i b c -> Indexed i (d, b) (d, c) #

(***) :: Indexed i b c -> Indexed i b' c' -> Indexed i (b, b') (c, c') #

(&&&) :: Indexed i b c -> Indexed i b c' -> Indexed i b (c, c') #

ArrowChoice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left :: Indexed i b c -> Indexed i (Either b d) (Either c d) #

right :: Indexed i b c -> Indexed i (Either d b) (Either d c) #

(+++) :: Indexed i b c -> Indexed i b' c' -> Indexed i (Either b b') (Either c c') #

(|||) :: Indexed i b d -> Indexed i c d -> Indexed i (Either b c) d #

ArrowApply (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

app :: Indexed i (Indexed i b c, b) c #

ArrowLoop (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

loop :: Indexed i (b, d) (c, d) -> Indexed i b c #

Profunctor (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

dimap :: (a -> b) -> (c -> d) -> Indexed i b c -> Indexed i a d #

lmap :: (a -> b) -> Indexed i b c -> Indexed i a c #

rmap :: (b -> c) -> Indexed i a b -> Indexed i a c #

(#.) :: Coercible c b => q b c -> Indexed i a b -> Indexed i a c #

(.#) :: Coercible b a => Indexed i b c -> q a b -> Indexed i a c #

Representable (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Associated Types

type Rep (Indexed i) :: Type -> Type #

Methods

tabulate :: (d -> Rep (Indexed i) c) -> Indexed i d c #

Corepresentable (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Associated Types

type Corep (Indexed i) :: Type -> Type #

Methods

cotabulate :: (Corep (Indexed i) d -> c) -> Indexed i d c #

Choice (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

left' :: Indexed i a b -> Indexed i (Either a c) (Either b c) #

right' :: Indexed i a b -> Indexed i (Either c a) (Either c b) #

Closed (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

closed :: Indexed i a b -> Indexed i (x -> a) (x -> b) #

Strong (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

first' :: Indexed i a b -> Indexed i (a, c) (b, c) #

second' :: Indexed i a b -> Indexed i (c, a) (c, b) #

Costrong (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

unfirst :: Indexed i (a, d) (b, d) -> Indexed i a b #

unsecond :: Indexed i (d, a) (d, b) -> Indexed i a b #

Conjoined (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

distrib :: Functor f => Indexed i a b -> Indexed i (f a) (f b) #

conjoined :: ((Indexed i ~ (->)) -> q (a -> b) r) -> q (Indexed i a b) r -> q (Indexed i a b) r #

Bizarre (Indexed Int) Mafic 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed Int a (f b) -> Mafic a b t -> f t

Category (Indexed i :: Type -> Type -> Type) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

id :: Indexed i a a #

(.) :: Indexed i b c -> Indexed i a b -> Indexed i a c #

Cosieve (Indexed i) ((,) i) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

cosieve :: Indexed i a b -> (i, a) -> b #

Bizarre (Indexed i) (Molten i) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed i a (f b) -> Molten i a b t -> f t

Sellable (Indexed i) (Molten i) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

sell :: Indexed i a (Molten i a b b)

Sieve (Indexed i) ((->) i :: Type -> Type) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

sieve :: Indexed i a b -> a -> i -> b #

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

MonadFix (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

mfix :: (a0 -> Indexed i a a0) -> Indexed i a a0 #

Applicative (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a0 -> Indexed i a a0 #

(<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c #

(*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

(<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #

Apply (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(<.>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(.>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

(<.) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #

liftF2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c #

Bind (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>-) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

join :: Indexed i a (Indexed i a a0) -> Indexed i a a0 #

type Rep (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

type Rep (Indexed i) = ((->) i :: Type -> Type)
type Corep (Indexed i) 
Instance details

Defined in Control.Lens.Internal.Indexed

type Corep (Indexed i) = (,) i

data Level i a #

Instances
FoldableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Level i a -> m #

ifolded :: IndexedFold i (Level i a) a #

ifoldr :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> Level i a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> Level i a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> Level i a -> b #

FunctorWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b) -> Level i a -> Level i b #

imapped :: IndexedSetter i (Level i a) (Level i b) a b #

TraversableWithIndex i (Level i) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b) -> Level i a -> f (Level i b) #

itraversed :: IndexedTraversal i (Level i a) (Level i b) a b #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Foldable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fold :: Monoid m => Level i m -> m #

foldMap :: Monoid m => (a -> m) -> Level i a -> m #

foldr :: (a -> b -> b) -> b -> Level i a -> b #

foldr' :: (a -> b -> b) -> b -> Level i a -> b #

foldl :: (b -> a -> b) -> b -> Level i a -> b #

foldl' :: (b -> a -> b) -> b -> Level i a -> b #

foldr1 :: (a -> a -> a) -> Level i a -> a #

foldl1 :: (a -> a -> a) -> Level i a -> a #

toList :: Level i a -> [a] #

null :: Level i a -> Bool #

length :: Level i a -> Int #

elem :: Eq a => a -> Level i a -> Bool #

maximum :: Ord a => Level i a -> a #

minimum :: Ord a => Level i a -> a #

sum :: Num a => Level i a -> a #

product :: Num a => Level i a -> a #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

(Eq i, Eq a) => Eq (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(==) :: Level i a -> Level i a -> Bool #

(/=) :: Level i a -> Level i a -> Bool #

(Ord i, Ord a) => Ord (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

compare :: Level i a -> Level i a -> Ordering #

(<) :: Level i a -> Level i a -> Bool #

(<=) :: Level i a -> Level i a -> Bool #

(>) :: Level i a -> Level i a -> Bool #

(>=) :: Level i a -> Level i a -> Bool #

max :: Level i a -> Level i a -> Level i a #

min :: Level i a -> Level i a -> Level i a #

(Read i, Read a) => Read (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

readsPrec :: Int -> ReadS (Level i a) #

readList :: ReadS [Level i a] #

readPrec :: ReadPrec (Level i a) #

readListPrec :: ReadPrec [Level i a] #

(Show i, Show a) => Show (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

showsPrec :: Int -> Level i a -> ShowS #

show :: Level i a -> String #

showList :: [Level i a] -> ShowS #

data Magma i t b a #

Instances
FoldableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (i -> a -> m) -> Magma i t b a -> m #

ifolded :: IndexedFold i (Magma i t b a) a #

ifoldr :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldr' :: (i -> a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

ifoldl' :: (i -> b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

FunctorWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (i -> a -> b0) -> Magma i t b a -> Magma i t b b0 #

imapped :: IndexedSetter i (Magma i t b a) (Magma i t b b0) a b0 #

TraversableWithIndex i (Magma i t b) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (i -> a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

itraversed :: IndexedTraversal i (Magma i t b a) (Magma i t b b0) a b0 #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Foldable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fold :: Monoid m => Magma i t b m -> m #

foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldr1 :: (a -> a -> a) -> Magma i t b a -> a #

foldl1 :: (a -> a -> a) -> Magma i t b a -> a #

toList :: Magma i t b a -> [a] #

null :: Magma i t b a -> Bool #

length :: Magma i t b a -> Int #

elem :: Eq a => a -> Magma i t b a -> Bool #

maximum :: Ord a => Magma i t b a -> a #

minimum :: Ord a => Magma i t b a -> a #

sum :: Num a => Magma i t b a -> a #

product :: Num a => Magma i t b a -> a #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

(Show i, Show a) => Show (Magma i t b a) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

showsPrec :: Int -> Magma i t b a -> ShowS #

show :: Magma i t b a -> String #

showList :: [Magma i t b a] -> ShowS #

class (Profunctor p, Bifunctor p) => Reviewable (p :: Type -> Type -> Type) #

Instances
(Profunctor p, Bifunctor p) => Reviewable p 
Instance details

Defined in Control.Lens.Internal.Review

class (Applicative f, Distributive f, Traversable f) => Settable (f :: Type -> Type) #

Minimal complete definition

untainted

Instances
Settable Identity 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Identity a -> a

untaintedDot :: Profunctor p => p a (Identity b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Identity b)

Settable f => Settable (Backwards f) 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Backwards f a -> a

untaintedDot :: Profunctor p => p a (Backwards f b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Backwards f b)

(Settable f, Settable g) => Settable (Compose f g) 
Instance details

Defined in Control.Lens.Internal.Setter

Methods

untainted :: Compose f g a -> a

untaintedDot :: Profunctor p => p a (Compose f g b) -> p a b

taintedDot :: Profunctor p => p a b -> p a (Compose f g b)

type AnIso s t a b = Exchange a b a (Identity b) -> Exchange a b s (Identity t) #

type AnIso' s a = AnIso s s a a #

class Strict lazy strict | lazy -> strict, strict -> lazy where #

Methods

strict :: Iso' lazy strict #

Instances
Strict ByteString ByteString 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' ByteString ByteString0 #

Strict Text Text 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' Text Text0 #

Strict (ST s a) (ST s a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (ST s a) (ST0 s a) #

Strict (WriterT w m a) (WriterT w m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (WriterT0 w m a) (WriterT w m a) #

Strict (StateT s m a) (StateT s m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (StateT0 s m a) (StateT s m a) #

Strict (RWST r w s m a) (RWST r w s m a) 
Instance details

Defined in Control.Lens.Iso

Methods

strict :: Iso' (RWST0 r w s m a) (RWST r w s m a) #

class Bifunctor p => Swapped (p :: Type -> Type -> Type) where #

Methods

swapped :: Iso (p a b) (p c d) (p b a) (p d c) #

Instances
Swapped Either 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: Iso (Either a b) (Either c d) (Either b a) (Either d c) #

Swapped (,) 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: Iso (a, b) (c, d) (b, a) (d, c) #

type ALens s t a b = LensLike (Pretext ((->) :: Type -> Type -> Type) a b) s t a b #

type ALens' s a = ALens s s a a #

type AnIndexedLens i s t a b = Optical (Indexed i) ((->) :: Type -> Type -> Type) (Pretext (Indexed i) a b) s t a b #

type AnIndexedLens' i s a = AnIndexedLens i s s a a #

class GPlated a (g :: k -> Type) #

Minimal complete definition

gplate'

Instances
GPlated a (V1 :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (V1 p) a

GPlated a (U1 :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (U1 p) a

GPlated a (URec b :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (URec b p) a

GPlated a (K1 i a :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (K1 i a p) a

GPlated a (K1 i b :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (K1 i b p) a

(GPlated a f, GPlated a g) => GPlated a (f :+: g :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' ((f :+: g) p) a

(GPlated a f, GPlated a g) => GPlated a (f :*: g :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' ((f :*: g) p) a

GPlated a f => GPlated a (M1 i c f :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate' :: Traversal' (M1 i c f p) a

class GPlated1 (f :: k -> Type) (g :: k -> Type) #

Minimal complete definition

gplate1'

Instances
GPlated1 (f :: k -> Type) (V1 :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (V1 a) (f a)

GPlated1 (f :: k -> Type) (U1 :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (U1 a) (f a)

GPlated1 (f :: k -> Type) (URec a :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (URec a a0) (f a0)

GPlated1 (f :: k -> Type) (Rec1 f :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (Rec1 f a) (f a)

GPlated1 (f :: k -> Type) (Rec1 g :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (Rec1 g a) (f a)

GPlated1 (f :: k -> Type) (K1 i a :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (K1 i a a0) (f a0)

(GPlated1 f g, GPlated1 f h) => GPlated1 (f :: k -> Type) (g :+: h :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' ((g :+: h) a) (f a)

(GPlated1 f g, GPlated1 f h) => GPlated1 (f :: k -> Type) (g :*: h :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' ((g :*: h) a) (f a)

GPlated1 f g => GPlated1 (f :: k -> Type) (M1 i c g :: k -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (M1 i c g a) (f a)

(Traversable t, GPlated1 f g) => GPlated1 (f :: k1 -> Type) (t :.: g :: k1 -> Type) 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' ((t :.: g) a) (f a)

GPlated1 (f :: Type -> Type) Par1 
Instance details

Defined in Control.Lens.Plated

Methods

gplate1' :: Traversal' (Par1 a) (f a)

class Plated a where #

Minimal complete definition

Nothing

Methods

plate :: Traversal' a a #

Instances
Plated Exp 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Exp Exp #

Plated Pat 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Pat Pat #

Plated Type 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Type Type #

Plated Dec 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Dec Dec #

Plated Con 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Con Con #

Plated Stmt 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' Stmt Stmt #

Plated [a] 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' [a] [a] #

Plated (Tree a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Tree a) (Tree a) #

Traversable f => Plated (Cofree f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Cofree f a) (Cofree f a) #

Traversable f => Plated (F f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (F f a) (F f a) #

Traversable f => Plated (Free f a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (Free f a) (Free f a) #

(Traversable f, Traversable w) => Plated (CofreeT f w a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (CofreeT f w a) (CofreeT f w a) #

(Traversable f, Traversable m) => Plated (FreeT f m a) 
Instance details

Defined in Control.Lens.Plated

Methods

plate :: Traversal' (FreeT f m a) (FreeT f m a) #

type APrism s t a b = Market a b a (Identity b) -> Market a b s (Identity t) #

type APrism' s a = APrism s s a a #

newtype ReifiedFold s a #

Constructors

Fold 

Fields

Instances
Arrow ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

arr :: (b -> c) -> ReifiedFold b c #

first :: ReifiedFold b c -> ReifiedFold (b, d) (c, d) #

second :: ReifiedFold b c -> ReifiedFold (d, b) (d, c) #

(***) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (b, b') (c, c') #

(&&&) :: ReifiedFold b c -> ReifiedFold b c' -> ReifiedFold b (c, c') #

ArrowChoice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left :: ReifiedFold b c -> ReifiedFold (Either b d) (Either c d) #

right :: ReifiedFold b c -> ReifiedFold (Either d b) (Either d c) #

(+++) :: ReifiedFold b c -> ReifiedFold b' c' -> ReifiedFold (Either b b') (Either c c') #

(|||) :: ReifiedFold b d -> ReifiedFold c d -> ReifiedFold (Either b c) d #

ArrowApply ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

app :: ReifiedFold (ReifiedFold b c, b) c #

Profunctor ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedFold b c -> ReifiedFold a d #

lmap :: (a -> b) -> ReifiedFold b c -> ReifiedFold a c #

rmap :: (b -> c) -> ReifiedFold a b -> ReifiedFold a c #

(#.) :: Coercible c b => q b c -> ReifiedFold a b -> ReifiedFold a c #

(.#) :: Coercible b a => ReifiedFold b c -> q a b -> ReifiedFold a c #

Representable ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep ReifiedFold :: Type -> Type #

Methods

tabulate :: (d -> Rep ReifiedFold c) -> ReifiedFold d c #

Choice ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedFold a b -> ReifiedFold (Either a c) (Either b c) #

right' :: ReifiedFold a b -> ReifiedFold (Either c a) (Either c b) #

Strong ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedFold a b -> ReifiedFold (a, c) (b, c) #

second' :: ReifiedFold a b -> ReifiedFold (c, a) (c, b) #

Sieve ReifiedFold [] 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedFold a b -> a -> [b] #

MonadReader s (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

ask :: ReifiedFold s s #

local :: (s -> s) -> ReifiedFold s a -> ReifiedFold s a #

reader :: (s -> a) -> ReifiedFold s a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Applicative (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedFold s a #

(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c #

(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #

MonadPlus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

mzero :: ReifiedFold s a #

mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

Alternative (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

empty :: ReifiedFold s a #

(<|>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

some :: ReifiedFold s a -> ReifiedFold s [a] #

many :: ReifiedFold s a -> ReifiedFold s [a] #

Plus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

zero :: ReifiedFold s a #

Alt (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<!>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

some :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a] #

many :: Applicative (ReifiedFold s) => ReifiedFold s a -> ReifiedFold s [a] #

Apply (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(.>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

(<.) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #

liftF2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c #

Bind (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>-) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

join :: ReifiedFold s (ReifiedFold s a) -> ReifiedFold s a #

Category ReifiedFold 
Instance details

Defined in Control.Lens.Reified

Methods

id :: ReifiedFold a a #

(.) :: ReifiedFold b c -> ReifiedFold a b -> ReifiedFold a c #

Semigroup (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a #

stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #

Monoid (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedFold s a #

mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

mconcat :: [ReifiedFold s a] -> ReifiedFold s a #

type Rep ReifiedFold 
Instance details

Defined in Control.Lens.Reified

type Rep ReifiedFold = []

newtype ReifiedGetter s a #

Constructors

Getter 

Fields

Instances
Arrow ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

arr :: (b -> c) -> ReifiedGetter b c #

first :: ReifiedGetter b c -> ReifiedGetter (b, d) (c, d) #

second :: ReifiedGetter b c -> ReifiedGetter (d, b) (d, c) #

(***) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (b, b') (c, c') #

(&&&) :: ReifiedGetter b c -> ReifiedGetter b c' -> ReifiedGetter b (c, c') #

ArrowChoice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left :: ReifiedGetter b c -> ReifiedGetter (Either b d) (Either c d) #

right :: ReifiedGetter b c -> ReifiedGetter (Either d b) (Either d c) #

(+++) :: ReifiedGetter b c -> ReifiedGetter b' c' -> ReifiedGetter (Either b b') (Either c c') #

(|||) :: ReifiedGetter b d -> ReifiedGetter c d -> ReifiedGetter (Either b c) d #

ArrowApply ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

app :: ReifiedGetter (ReifiedGetter b c, b) c #

ArrowLoop ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

loop :: ReifiedGetter (b, d) (c, d) -> ReifiedGetter b c #

Profunctor ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedGetter b c -> ReifiedGetter a d #

lmap :: (a -> b) -> ReifiedGetter b c -> ReifiedGetter a c #

rmap :: (b -> c) -> ReifiedGetter a b -> ReifiedGetter a c #

(#.) :: Coercible c b => q b c -> ReifiedGetter a b -> ReifiedGetter a c #

(.#) :: Coercible b a => ReifiedGetter b c -> q a b -> ReifiedGetter a c #

Representable ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep ReifiedGetter :: Type -> Type #

Methods

tabulate :: (d -> Rep ReifiedGetter c) -> ReifiedGetter d c #

Corepresentable ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Corep ReifiedGetter :: Type -> Type #

Methods

cotabulate :: (Corep ReifiedGetter d -> c) -> ReifiedGetter d c #

Choice ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

left' :: ReifiedGetter a b -> ReifiedGetter (Either a c) (Either b c) #

right' :: ReifiedGetter a b -> ReifiedGetter (Either c a) (Either c b) #

Closed ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

closed :: ReifiedGetter a b -> ReifiedGetter (x -> a) (x -> b) #

Strong ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedGetter a b -> ReifiedGetter (a, c) (b, c) #

second' :: ReifiedGetter a b -> ReifiedGetter (c, a) (c, b) #

Costrong ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

unfirst :: ReifiedGetter (a, d) (b, d) -> ReifiedGetter a b #

unsecond :: ReifiedGetter (d, a) (d, b) -> ReifiedGetter a b #

Conjoined ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

distrib :: Functor f => ReifiedGetter a b -> ReifiedGetter (f a) (f b) #

conjoined :: ((ReifiedGetter ~ (->)) -> q (a -> b) r) -> q (ReifiedGetter a b) r -> q (ReifiedGetter a b) r #

Sieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedGetter a b -> a -> Identity b #

Cosieve ReifiedGetter Identity 
Instance details

Defined in Control.Lens.Reified

Methods

cosieve :: ReifiedGetter a b -> Identity a -> b #

MonadReader s (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

ask :: ReifiedGetter s s #

local :: (s -> s) -> ReifiedGetter s a -> ReifiedGetter s a #

reader :: (s -> a) -> ReifiedGetter s a #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Applicative (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedGetter s a #

(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c #

(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #

Monoid s => Comonad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

extract :: ReifiedGetter s a -> a #

duplicate :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a) #

extend :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

Monoid s => ComonadApply (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<@>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(@>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

(<@) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #

Distributive (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

distribute :: Functor f => f (ReifiedGetter s a) -> ReifiedGetter s (f a) #

collect :: Functor f => (a -> ReifiedGetter s b) -> f a -> ReifiedGetter s (f b) #

distributeM :: Monad m => m (ReifiedGetter s a) -> ReifiedGetter s (m a) #

collectM :: Monad m => (a -> ReifiedGetter s b) -> m a -> ReifiedGetter s (m b) #

Apply (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(.>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

(<.) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #

liftF2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c #

Bind (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>-) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

join :: ReifiedGetter s (ReifiedGetter s a) -> ReifiedGetter s a #

Semigroup s => Extend (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

duplicated :: ReifiedGetter s a -> ReifiedGetter s (ReifiedGetter s a) #

extended :: (ReifiedGetter s a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

Category ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

Methods

id :: ReifiedGetter a a #

(.) :: ReifiedGetter b c -> ReifiedGetter a b -> ReifiedGetter a c #

type Rep ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

type Rep ReifiedGetter = Identity
type Corep ReifiedGetter 
Instance details

Defined in Control.Lens.Reified

type Corep ReifiedGetter = Identity

newtype ReifiedIndexedFold i s a #

Constructors

IndexedFold 

Fields

Instances
Profunctor (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a d #

lmap :: (a -> b) -> ReifiedIndexedFold i b c -> ReifiedIndexedFold i a c #

rmap :: (b -> c) -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(#.) :: Coercible c b => q b c -> ReifiedIndexedFold i a b -> ReifiedIndexedFold i a c #

(.#) :: Coercible b a => ReifiedIndexedFold i b c -> q a b -> ReifiedIndexedFold i a c #

Representable (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep (ReifiedIndexedFold i) :: Type -> Type #

Methods

tabulate :: (d -> Rep (ReifiedIndexedFold i) c) -> ReifiedIndexedFold i d c #

Strong (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (a, c) (b, c) #

second' :: ReifiedIndexedFold i a b -> ReifiedIndexedFold i (c, a) (c, b) #

Sieve (ReifiedIndexedFold i) (Compose [] ((,) i)) 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedIndexedFold i a b -> a -> Compose [] ((,) i) b #

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Plus (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

zero :: ReifiedIndexedFold i s a #

Alt (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<!>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

some :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a] #

many :: Applicative (ReifiedIndexedFold i s) => ReifiedIndexedFold i s a -> ReifiedIndexedFold i s [a] #

Semigroup (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a #

stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

Monoid (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedIndexedFold i s a #

mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #

type Rep (ReifiedIndexedFold i) 
Instance details

Defined in Control.Lens.Reified

type Rep (ReifiedIndexedFold i) = Compose [] ((,) i)

newtype ReifiedIndexedGetter i s a #

Constructors

IndexedGetter 

Fields

Instances
Profunctor (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

dimap :: (a -> b) -> (c -> d) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a d #

lmap :: (a -> b) -> ReifiedIndexedGetter i b c -> ReifiedIndexedGetter i a c #

rmap :: (b -> c) -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(#.) :: Coercible c b => q b c -> ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i a c #

(.#) :: Coercible b a => ReifiedIndexedGetter i b c -> q a b -> ReifiedIndexedGetter i a c #

Representable (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Associated Types

type Rep (ReifiedIndexedGetter i) :: Type -> Type #

Methods

tabulate :: (d -> Rep (ReifiedIndexedGetter i) c) -> ReifiedIndexedGetter i d c #

Strong (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

Methods

first' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (a, c) (b, c) #

second' :: ReifiedIndexedGetter i a b -> ReifiedIndexedGetter i (c, a) (c, b) #

Sieve (ReifiedIndexedGetter i) ((,) i) 
Instance details

Defined in Control.Lens.Reified

Methods

sieve :: ReifiedIndexedGetter i a b -> a -> (i, b) #

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Semigroup i => Apply (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

(<.>) :: ReifiedIndexedGetter i s (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(.>) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s b #

(<.) :: ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

liftF2 :: (a -> b -> c) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s c #

type Rep (ReifiedIndexedGetter i) 
Instance details

Defined in Control.Lens.Reified

type Rep (ReifiedIndexedGetter i) = (,) i

newtype ReifiedIndexedLens i s t a b #

Constructors

IndexedLens 

Fields

type ReifiedIndexedLens' i s a = ReifiedIndexedLens i s s a a #

newtype ReifiedIndexedSetter i s t a b #

Constructors

IndexedSetter 

Fields

type ReifiedIndexedSetter' i s a = ReifiedIndexedSetter i s s a a #

newtype ReifiedIndexedTraversal i s t a b #

Constructors

IndexedTraversal 

Fields

type ReifiedIndexedTraversal' i s a = ReifiedIndexedTraversal i s s a a #

newtype ReifiedIso s t a b #

Constructors

Iso 

Fields

type ReifiedIso' s a = ReifiedIso s s a a #

newtype ReifiedLens s t a b #

Constructors

Lens 

Fields

type ReifiedLens' s a = ReifiedLens s s a a #

newtype ReifiedPrism s t a b #

Constructors

Prism 

Fields

type ReifiedPrism' s a = ReifiedPrism s s a a #

newtype ReifiedSetter s t a b #

Constructors

Setter 

Fields

type ReifiedSetter' s a = ReifiedSetter s s a a #

newtype ReifiedTraversal s t a b #

Constructors

Traversal 

Fields

type ReifiedTraversal' s a = ReifiedTraversal s s a a #

type ASetter s t a b = (a -> Identity b) -> s -> Identity t #

type ASetter' s a = ASetter s s a a #

type AnIndexedSetter i s t a b = Indexed i a (Identity b) -> s -> Identity t #

type AnIndexedSetter' i s a = AnIndexedSetter i s s a a #

type Setting (p :: Type -> Type -> Type) s t a b = p a (Identity b) -> s -> Identity t #

type Setting' (p :: Type -> Type -> Type) s a = Setting p s s a a #

type ATraversal s t a b = LensLike (Bazaar ((->) :: Type -> Type -> Type) a b) s t a b #

type ATraversal' s a = ATraversal s s a a #

type ATraversal1 s t a b = LensLike (Bazaar1 ((->) :: Type -> Type -> Type) a b) s t a b #

type ATraversal1' s a = ATraversal1 s s a a #

type AnIndexedTraversal i s t a b = Over (Indexed i) (Bazaar (Indexed i) a b) s t a b #

type AnIndexedTraversal' i s a = AnIndexedTraversal i s s a a #

type AnIndexedTraversal1 i s t a b = Over (Indexed i) (Bazaar1 (Indexed i) a b) s t a b #

type AnIndexedTraversal1' i s a = AnIndexedTraversal1 i s s a a #

class Ord k => TraverseMax k (m :: Type -> Type) | m -> k where #

Methods

traverseMax :: IndexedTraversal' k (m v) v #

Instances
TraverseMax Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: IndexedTraversal' Int (IntMap v) v #

Ord k => TraverseMax k (Map k) 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: IndexedTraversal' k (Map k v) v #

class Ord k => TraverseMin k (m :: Type -> Type) | m -> k where #

Methods

traverseMin :: IndexedTraversal' k (m v) v #

Instances
TraverseMin Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: IndexedTraversal' Int (IntMap v) v #

Ord k => TraverseMin k (Map k) 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: IndexedTraversal' k (Map k v) v #

type Traversing (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT p f a b) s t a b #

type Traversing' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing p f s s a a #

type Traversing1 (p :: Type -> Type -> Type) (f :: Type -> Type) s t a b = Over p (BazaarT1 p f a b) s t a b #

type Traversing1' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Traversing1 p f s s a a #

class Field1 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_1 :: Lens s t a b #

Instances
Field1 (Identity a) (Identity b) a b 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Identity a) (Identity b) a b #

Field1 (V2 a) (V2 a) a a 
Instance details

Defined in Linear.V2

Methods

_1 :: Lens (V2 a) (V2 a) a a #

Field1 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_1 :: Lens (V3 a) (V3 a) a a #

Field1 (V1 a) (V1 b) a b 
Instance details

Defined in Linear.V1

Methods

_1 :: Lens (V1 a) (V1 b) a b #

Field1 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_1 :: Lens (Plucker a) (Plucker a) a a #

Field1 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_1 :: Lens (Quaternion a) (Quaternion a) a a #

Field1 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_1 :: Lens (V4 a) (V4 a) a a #

Field1 (a, b) (a', b) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b) (a', b) a a' #

Field1 (a, b, c) (a', b, c) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c) (a', b, c) a a' #

1 <= n => Field1 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_1 :: Lens (V n a) (V n a) a a #

Field1 (a, b, c, d) (a', b, c, d) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d) (a', b, c, d) a a' #

Field1 ((f :*: g) p) ((f' :*: g) p) (f p) (f' p) 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens ((f :*: g) p) ((f' :*: g) p) (f p) (f' p) #

Field1 (Product f g a) (Product f' g a) (f a) (f' a) 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (Product f g a) (Product f' g a) (f a) (f' a) #

Field1 (a, b, c, d, e) (a', b, c, d, e) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e) (a', b, c, d, e) a a' #

Field1 (a, b, c, d, e, f) (a', b, c, d, e, f) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f) (a', b, c, d, e, f) a a' #

Field1 (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g) (a', b, c, d, e, f, g) a a' #

Field1 (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h) (a', b, c, d, e, f, g, h) a a' #

Field1 (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i) (a', b, c, d, e, f, g, h, i) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j) (a', b, c, d, e, f, g, h, i, j) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a', b, c, d, e, f, g, h, i, j, kk) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a', b, c, d, e, f, g, h, i, j, kk, l) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a', b, c, d, e, f, g, h, i, j, kk, l, m) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) a a' #

Field1 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a' 
Instance details

Defined in Control.Lens.Tuple

Methods

_1 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a', b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) a a' #

class Field10 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_10 :: Lens s t a b #

Instances
10 <= n => Field10 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_10 :: Lens (V n a) (V n a) a a #

Field10 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i, j') j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j', kk) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j', kk, l) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j', kk, l, m) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r) j j' #

Field10 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j' 
Instance details

Defined in Control.Lens.Tuple

Methods

_10 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j', kk, l, m, n, o, p, q, r, s) j j' #

class Field11 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_11 :: Lens s t a b #

Instances
11 <= n => Field11 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_11 :: Lens (V n a) (V n a) a a #

Field11 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i, j, kk') kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk', l) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk', l, m) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r) kk kk' #

Field11 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk' 
Instance details

Defined in Control.Lens.Tuple

Methods

_11 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk', l, m, n, o, p, q, r, s) kk kk' #

class Field12 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_12 :: Lens s t a b #

Instances
12 <= n => Field12 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_12 :: Lens (V n a) (V n a) a a #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i, j, kk, l') l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l', m) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r) l l' #

Field12 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l' 
Instance details

Defined in Control.Lens.Tuple

Methods

_12 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l', m, n, o, p, q, r, s) l l' #

class Field13 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_13 :: Lens s t a b #

Instances
13 <= n => Field13 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_13 :: Lens (V n a) (V n a) a a #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i, j, kk, l, m') m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r) m m' #

Field13 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m' 
Instance details

Defined in Control.Lens.Tuple

Methods

_13 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m', n, o, p, q, r, s) m m' #

class Field14 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_14 :: Lens s t a b #

Instances
14 <= n => Field14 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_14 :: Lens (V n a) (V n a) a a #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n') n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r) n n' #

Field14 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n' 
Instance details

Defined in Control.Lens.Tuple

Methods

_14 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n', o, p, q, r, s) n n' #

class Field15 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_15 :: Lens s t a b #

Instances
15 <= n => Field15 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_15 :: Lens (V n a) (V n a) a a #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o') o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r) o o' #

Field15 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o' 
Instance details

Defined in Control.Lens.Tuple

Methods

_15 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o', p, q, r, s) o o' #

class Field16 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_16 :: Lens s t a b #

Instances
16 <= n => Field16 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_16 :: Lens (V n a) (V n a) a a #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p') p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q) p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r) p p' #

Field16 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p' 
Instance details

Defined in Control.Lens.Tuple

Methods

_16 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p', q, r, s) p p' #

class Field17 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_17 :: Lens s t a b #

Instances
17 <= n => Field17 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_17 :: Lens (V n a) (V n a) a a #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q') q q' #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r) q q' #

Field17 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q' 
Instance details

Defined in Control.Lens.Tuple

Methods

_17 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q', r, s) q q' #

class Field18 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_18 :: Lens s t a b #

Instances
18 <= n => Field18 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_18 :: Lens (V n a) (V n a) a a #

Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r' 
Instance details

Defined in Control.Lens.Tuple

Methods

_18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r') r r' #

Field18 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r' 
Instance details

Defined in Control.Lens.Tuple

Methods

_18 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r', s) r r' #

class Field19 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_19 :: Lens s t a b #

Instances
19 <= n => Field19 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_19 :: Lens (V n a) (V n a) a a #

Field19 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s' 
Instance details

Defined in Control.Lens.Tuple

Methods

_19 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s') s s' #

class Field2 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_2 :: Lens s t a b #

Instances
Field2 (V2 a) (V2 a) a a 
Instance details

Defined in Linear.V2

Methods

_2 :: Lens (V2 a) (V2 a) a a #

Field2 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_2 :: Lens (V3 a) (V3 a) a a #

Field2 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_2 :: Lens (Plucker a) (Plucker a) a a #

Field2 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_2 :: Lens (Quaternion a) (Quaternion a) a a #

Field2 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_2 :: Lens (V4 a) (V4 a) a a #

Field2 (a, b) (a, b') b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b) (a, b') b b' #

Field2 (a, b, c) (a, b', c) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c) (a, b', c) b b' #

2 <= n => Field2 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_2 :: Lens (V n a) (V n a) a a #

Field2 (a, b, c, d) (a, b', c, d) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d) (a, b', c, d) b b' #

Field2 ((f :*: g) p) ((f :*: g') p) (g p) (g' p) 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens ((f :*: g) p) ((f :*: g') p) (g p) (g' p) #

Field2 (Product f g a) (Product f g' a) (g a) (g' a) 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (Product f g a) (Product f g' a) (g a) (g' a) #

Field2 (a, b, c, d, e) (a, b', c, d, e) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e) (a, b', c, d, e) b b' #

Field2 (a, b, c, d, e, f) (a, b', c, d, e, f) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f) (a, b', c, d, e, f) b b' #

Field2 (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g) (a, b', c, d, e, f, g) b b' #

Field2 (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h) (a, b', c, d, e, f, g, h) b b' #

Field2 (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i) (a, b', c, d, e, f, g, h, i) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b', c, d, e, f, g, h, i, j) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b', c, d, e, f, g, h, i, j, kk) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b', c, d, e, f, g, h, i, j, kk, l) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b', c, d, e, f, g, h, i, j, kk, l, m) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) b b' #

Field2 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b' 
Instance details

Defined in Control.Lens.Tuple

Methods

_2 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b', c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) b b' #

class Field3 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_3 :: Lens s t a b #

Instances
Field3 (V3 a) (V3 a) a a 
Instance details

Defined in Linear.V3

Methods

_3 :: Lens (V3 a) (V3 a) a a #

Field3 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_3 :: Lens (Plucker a) (Plucker a) a a #

Field3 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_3 :: Lens (Quaternion a) (Quaternion a) a a #

Field3 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_3 :: Lens (V4 a) (V4 a) a a #

Field3 (a, b, c) (a, b, c') c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c) (a, b, c') c c' #

3 <= n => Field3 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_3 :: Lens (V n a) (V n a) a a #

Field3 (a, b, c, d) (a, b, c', d) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d) (a, b, c', d) c c' #

Field3 (a, b, c, d, e) (a, b, c', d, e) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e) (a, b, c', d, e) c c' #

Field3 (a, b, c, d, e, f) (a, b, c', d, e, f) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f) (a, b, c', d, e, f) c c' #

Field3 (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g) (a, b, c', d, e, f, g) c c' #

Field3 (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h) (a, b, c', d, e, f, g, h) c c' #

Field3 (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c', d, e, f, g, h, i) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c', d, e, f, g, h, i, j) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c', d, e, f, g, h, i, j, kk) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c', d, e, f, g, h, i, j, kk, l) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c', d, e, f, g, h, i, j, kk, l, m) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) c c' #

Field3 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c' 
Instance details

Defined in Control.Lens.Tuple

Methods

_3 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c', d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) c c' #

class Field4 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_4 :: Lens s t a b #

Instances
Field4 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_4 :: Lens (Plucker a) (Plucker a) a a #

Field4 (Quaternion a) (Quaternion a) a a 
Instance details

Defined in Linear.Quaternion

Methods

_4 :: Lens (Quaternion a) (Quaternion a) a a #

Field4 (V4 a) (V4 a) a a 
Instance details

Defined in Linear.V4

Methods

_4 :: Lens (V4 a) (V4 a) a a #

4 <= n => Field4 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_4 :: Lens (V n a) (V n a) a a #

Field4 (a, b, c, d) (a, b, c, d') d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d) (a, b, c, d') d d' #

Field4 (a, b, c, d, e) (a, b, c, d', e) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e) (a, b, c, d', e) d d' #

Field4 (a, b, c, d, e, f) (a, b, c, d', e, f) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f) (a, b, c, d', e, f) d d' #

Field4 (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g) (a, b, c, d', e, f, g) d d' #

Field4 (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d', e, f, g, h) d d' #

Field4 (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d', e, f, g, h, i) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d', e, f, g, h, i, j) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d', e, f, g, h, i, j, kk) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d', e, f, g, h, i, j, kk, l) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d', e, f, g, h, i, j, kk, l, m) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r) d d' #

Field4 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d' 
Instance details

Defined in Control.Lens.Tuple

Methods

_4 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d', e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) d d' #

class Field5 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_5 :: Lens s t a b #

Instances
Field5 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_5 :: Lens (Plucker a) (Plucker a) a a #

5 <= n => Field5 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_5 :: Lens (V n a) (V n a) a a #

Field5 (a, b, c, d, e) (a, b, c, d, e') e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e) (a, b, c, d, e') e e' #

Field5 (a, b, c, d, e, f) (a, b, c, d, e', f) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f) (a, b, c, d, e', f) e e' #

Field5 (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e', f, g) e e' #

Field5 (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e', f, g, h) e e' #

Field5 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e', f, g, h, i) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e', f, g, h, i, j) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e', f, g, h, i, j, kk) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e', f, g, h, i, j, kk, l) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e', f, g, h, i, j, kk, l, m) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r) e e' #

Field5 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e' 
Instance details

Defined in Control.Lens.Tuple

Methods

_5 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e', f, g, h, i, j, kk, l, m, n, o, p, q, r, s) e e' #

class Field6 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_6 :: Lens s t a b #

Instances
Field6 (Plucker a) (Plucker a) a a 
Instance details

Defined in Linear.Plucker

Methods

_6 :: Lens (Plucker a) (Plucker a) a a #

6 <= n => Field6 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_6 :: Lens (V n a) (V n a) a a #

Field6 (a, b, c, d, e, f) (a, b, c, d, e, f') f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f) (a, b, c, d, e, f') f f' #

Field6 (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f', g) f f' #

Field6 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f', g, h) f f' #

Field6 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f', g, h, i) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f', g, h, i, j) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f', g, h, i, j, kk) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f', g, h, i, j, kk, l) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f', g, h, i, j, kk, l, m) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r) f f' #

Field6 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f' 
Instance details

Defined in Control.Lens.Tuple

Methods

_6 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f', g, h, i, j, kk, l, m, n, o, p, q, r, s) f f' #

class Field7 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_7 :: Lens s t a b #

Instances
7 <= n => Field7 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_7 :: Lens (V n a) (V n a) a a #

Field7 (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g) (a, b, c, d, e, f, g') g g' #

Field7 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g', h) g g' #

Field7 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g', h, i) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g', h, i, j) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g', h, i, j, kk) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g', h, i, j, kk, l) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g', h, i, j, kk, l, m) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r) g g' #

Field7 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g' 
Instance details

Defined in Control.Lens.Tuple

Methods

_7 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g', h, i, j, kk, l, m, n, o, p, q, r, s) g g' #

class Field8 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_8 :: Lens s t a b #

Instances
8 <= n => Field8 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_8 :: Lens (V n a) (V n a) a a #

Field8 (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h) (a, b, c, d, e, f, g, h') h h' #

Field8 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h', i) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h', i, j) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h', i, j, kk) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h', i, j, kk, l) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h', i, j, kk, l, m) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r) h h' #

Field8 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h' 
Instance details

Defined in Control.Lens.Tuple

Methods

_8 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h', i, j, kk, l, m, n, o, p, q, r, s) h h' #

class Field9 s t a b | s -> a, t -> b, s b -> t, t a -> s where #

Minimal complete definition

Nothing

Methods

_9 :: Lens s t a b #

Instances
9 <= n => Field9 (V n a) (V n a) a a 
Instance details

Defined in Linear.V

Methods

_9 :: Lens (V n a) (V n a) a a #

Field9 (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i) (a, b, c, d, e, f, g, h, i') i i' #

Field9 (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j) (a, b, c, d, e, f, g, h, i', j) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk) (a, b, c, d, e, f, g, h, i', j, kk) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l) (a, b, c, d, e, f, g, h, i', j, kk, l) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m) (a, b, c, d, e, f, g, h, i', j, kk, l, m) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r) i i' #

Field9 (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i' 
Instance details

Defined in Control.Lens.Tuple

Methods

_9 :: Lens (a, b, c, d, e, f, g, h, i, j, kk, l, m, n, o, p, q, r, s) (a, b, c, d, e, f, g, h, i', j, kk, l, m, n, o, p, q, r, s) i i' #

type AReview t b = Optic' (Tagged :: Type -> Type -> Type) Identity t b #

type As (a :: k2) = Equality' a a #

type Equality (s :: k1) (t :: k2) (a :: k1) (b :: k2) = forall k3 (p :: k1 -> k3 -> Type) (f :: k2 -> k3). p a (f b) -> p s (f t) #

type Equality' (s :: k2) (a :: k2) = Equality s s a a #

type Fold s a = forall (f :: Type -> Type). (Contravariant f, Applicative f) => (a -> f a) -> s -> f s #

type Fold1 s a = forall (f :: Type -> Type). (Contravariant f, Apply f) => (a -> f a) -> s -> f s #

type Getter s a = forall (f :: Type -> Type). (Contravariant f, Functor f) => (a -> f a) -> s -> f s #

type IndexPreservingFold s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Applicative f) => p a (f a) -> p s (f s) #

type IndexPreservingFold1 s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Apply f) => p a (f a) -> p s (f s) #

type IndexPreservingGetter s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Contravariant f, Functor f) => p a (f a) -> p s (f s) #

type IndexPreservingLens s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Functor f) => p a (f b) -> p s (f t) #

type IndexPreservingLens' s a = IndexPreservingLens s s a a #

type IndexPreservingSetter s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Settable f) => p a (f b) -> p s (f t) #

type IndexPreservingSetter' s a = IndexPreservingSetter s s a a #

type IndexPreservingTraversal s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Applicative f) => p a (f b) -> p s (f t) #

type IndexPreservingTraversal' s a = IndexPreservingTraversal s s a a #

type IndexPreservingTraversal1 s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Conjoined p, Apply f) => p a (f b) -> p s (f t) #

type IndexPreservingTraversal1' s a = IndexPreservingTraversal1 s s a a #

type IndexedFold i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Applicative f) => p a (f a) -> s -> f s #

type IndexedFold1 i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Apply f) => p a (f a) -> s -> f s #

type IndexedGetter i s a = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Contravariant f, Functor f) => p a (f a) -> s -> f s #

type IndexedLens i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Functor f) => p a (f b) -> s -> f t #

type IndexedLens' i s a = IndexedLens i s s a a #

type IndexedLensLike i (f :: k -> Type) s (t :: k) a (b :: k) = forall (p :: Type -> Type -> Type). Indexable i p => p a (f b) -> s -> f t #

type IndexedLensLike' i (f :: Type -> Type) s a = IndexedLensLike i f s s a a #

type IndexedSetter i s t a b = forall (f :: Type -> Type) (p :: Type -> Type -> Type). (Indexable i p, Settable f) => p a (f b) -> s -> f t #

type IndexedSetter' i s a = IndexedSetter i s s a a #

type IndexedTraversal i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Applicative f) => p a (f b) -> s -> f t #

type IndexedTraversal' i s a = IndexedTraversal i s s a a #

type IndexedTraversal1 i s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Indexable i p, Apply f) => p a (f b) -> s -> f t #

type IndexedTraversal1' i s a = IndexedTraversal1 i s s a a #

type Iso s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Profunctor p, Functor f) => p a (f b) -> p s (f t) #

type Iso' s a = Iso s s a a #

type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t #

type LensLike (f :: k -> Type) s (t :: k) a (b :: k) = (a -> f b) -> s -> f t #

type LensLike' (f :: Type -> Type) s a = LensLike f s s a a #

type Optic (p :: k1 -> k -> Type) (f :: k2 -> k) (s :: k1) (t :: k2) (a :: k1) (b :: k2) = p a (f b) -> p s (f t) #

type Optic' (p :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optic p f s s a a #

type Optical (p :: k2 -> k -> Type) (q :: k1 -> k -> Type) (f :: k3 -> k) (s :: k1) (t :: k3) (a :: k2) (b :: k3) = p a (f b) -> q s (f t) #

type Optical' (p :: k1 -> k -> Type) (q :: k1 -> k -> Type) (f :: k1 -> k) (s :: k1) (a :: k1) = Optical p q f s s a a #

type Over (p :: k -> Type -> Type) (f :: k1 -> Type) s (t :: k1) (a :: k) (b :: k1) = p a (f b) -> s -> f t #

type Over' (p :: Type -> Type -> Type) (f :: Type -> Type) s a = Over p f s s a a #

type Review t b = forall (p :: Type -> Type -> Type) (f :: Type -> Type). (Choice p, Bifunctor p, Settable f) => Optic' p f t b #

type Setter s t a b = forall (f :: Type -> Type). Settable f => (a -> f b) -> s -> f t #

type Setter' s a = Setter s s a a #

type Simple (f :: k -> k -> k1 -> k1 -> k2) (s :: k) (a :: k1) = f s s a a #

type Traversal' s a = Traversal s s a a #

type Traversal1 s t a b = forall (f :: Type -> Type). Apply f => (a -> f b) -> s -> f t #

type Traversal1' s a = Traversal1 s s a a #

class (Rewrapped s t, Rewrapped t s) => Rewrapping s t #

Instances
(Rewrapped s t, Rewrapped t s) => Rewrapping s t 
Instance details

Defined in Control.Lens.Wrapped

type family Magnified (m :: Type -> Type) :: Type -> Type -> Type #

Instances
type Magnified (IdentityT m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (IdentityT m) = Magnified m
type Magnified (ReaderT b m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (ReaderT b m) = Effect m
type Magnified ((->) b :: Type -> Type) 
Instance details

Defined in Control.Lens.Zoom

type Magnified ((->) b :: Type -> Type) = (Const :: Type -> Type -> Type)
type Magnified (RWST a w s m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (RWST a w s m) = EffectRWS w s m
type Magnified (RWST a w s m) 
Instance details

Defined in Control.Lens.Zoom

type Magnified (RWST a w s m) = EffectRWS w s m

class (Magnified m ~ Magnified n, MonadReader b m, MonadReader a n) => Magnify (m :: Type -> Type) (n :: Type -> Type) b a | m -> b, n -> a, m a -> n, n b -> m where #

Methods

magnify :: LensLike' (Magnified m c) a b -> m c -> n c #

Instances
Magnify m n b a => Magnify (IdentityT m) (IdentityT n) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (IdentityT m) c) a b -> IdentityT m c -> IdentityT n c #

Monad m => Magnify (ReaderT b m) (ReaderT a m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (ReaderT b m) c) a b -> ReaderT b m c -> ReaderT a m c #

Magnify ((->) b :: Type -> Type) ((->) a :: Type -> Type) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified ((->) b) c) a b -> (b -> c) -> a -> c #

(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #

(Monad m, Monoid w) => Magnify (RWST b w s m) (RWST a w s m) b a 
Instance details

Defined in Control.Lens.Zoom

Methods

magnify :: LensLike' (Magnified (RWST b w s m) c) a b -> RWST b w s m c -> RWST a w s m c #

class (MonadState s m, MonadState t n) => Zoom (m :: Type -> Type) (n :: Type -> Type) s t | m -> s, n -> t, m t -> n, n s -> m where #

Methods

zoom :: LensLike' (Zoomed m c) t s -> m c -> n c #

Instances
Zoom m n s t => Zoom (MaybeT m) (MaybeT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (MaybeT m) c) t s -> MaybeT m c -> MaybeT n c #

Zoom m n s t => Zoom (ListT m) (ListT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ListT m) c) t s -> ListT m c -> ListT n c #

Zoom m n s t => Zoom (IdentityT m) (IdentityT n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (IdentityT m) c) t s -> IdentityT m c -> IdentityT n c #

Zoom m n s t => Zoom (ExceptT e m) (ExceptT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ExceptT e m) c) t s -> ExceptT e m c -> ExceptT e n c #

(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #

Monad z => Zoom (StateT s z) (StateT t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #

Zoom m n s t => Zoom (ReaderT e m) (ReaderT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ReaderT e m) c) t s -> ReaderT e m c -> ReaderT e n c #

(Error e, Zoom m n s t) => Zoom (ErrorT e m) (ErrorT e n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (ErrorT e m) c) t s -> ErrorT e m c -> ErrorT e n c #

Monad z => Zoom (StateT s z) (StateT t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (StateT s z) c) t s -> StateT s z c -> StateT t z c #

(Monoid w, Zoom m n s t) => Zoom (WriterT w m) (WriterT w n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (WriterT w m) c) t s -> WriterT w m c -> WriterT w n c #

(Functor f, Zoom m n s t) => Zoom (FreeT f m) (FreeT f n) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (FreeT f m) c) t s -> FreeT f m c -> FreeT f n c #

(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #

(Monoid w, Monad z) => Zoom (RWST r w s z) (RWST r w t z) s t 
Instance details

Defined in Control.Lens.Zoom

Methods

zoom :: LensLike' (Zoomed (RWST r w s z) c) t s -> RWST r w s z c -> RWST r w t z c #

type family Zoomed (m :: Type -> Type) :: Type -> Type -> Type #

Instances
type Zoomed (MaybeT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (MaybeT m) = FocusingMay (Zoomed m)
type Zoomed (ListT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ListT m) = FocusingOn [] (Zoomed m)
type Zoomed (IdentityT m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (IdentityT m) = Zoomed m
type Zoomed (ExceptT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ExceptT e m) = FocusingErr e (Zoomed m)
type Zoomed (WriterT w m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (StateT s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (StateT s z) = Focusing z
type Zoomed (ReaderT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ReaderT e m) = Zoomed m
type Zoomed (ErrorT e m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (ErrorT e m) = FocusingErr e (Zoomed m)
type Zoomed (StateT s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (StateT s z) = Focusing z
type Zoomed (WriterT w m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (WriterT w m) = FocusingPlus w (Zoomed m)
type Zoomed (FreeT f m) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (FreeT f m) = FocusingFree f m (Zoomed m)
type Zoomed (RWST r w s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (RWST r w s z) = FocusingWith w z
type Zoomed (RWST r w s z) 
Instance details

Defined in Control.Lens.Zoom

type Zoomed (RWST r w s z) = FocusingWith w z

Plots

class HasR (t :: Type -> Type) where #

Methods

_r :: RealFloat n => Lens' (t n) n #

Instances
HasR V2 
Instance details

Defined in Diagrams.TwoD.Types

Methods

_r :: RealFloat n => Lens' (V2 n) n #

HasR Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_r :: RealFloat n => Lens' (Polar n) n #

HasR v => HasR (Point v) 
Instance details

Defined in Diagrams.TwoD.Types

Methods

_r :: RealFloat n => Lens' (Point v n) n #

er :: Radial v => E v #

etheta :: Circle v => E v #

eθ :: Circle v => E v #

interpPolar :: Num n => n -> Polar n -> Polar n -> Polar n #

mkPolar :: n -> Angle n -> Polar n #

polar :: (n, Angle n) -> Polar n #

polarIso :: Iso' (Polar n) (n, Angle n) #

polarV2 :: RealFloat n => Iso' (Polar n) (V2 n) #

unpolar :: Polar n -> (n, Angle n) #

addPlot :: (InSpace (BaseSpace c) n p, MonadState (Axis b c n) m, Plotable p b) => Plot p b -> m () #

addPlotable :: (InSpace (BaseSpace c) n p, MonadState (Axis b c n) m, Plotable p b) => p -> State (Plot p b) () -> m () #

addPlotable' :: (InSpace (BaseSpace v) n p, MonadState (Axis b v n) m, Plotable p b) => p -> m () #

axes :: (v ~ BaseSpace c, v ~ BaseSpace c') => Lens (Axis b c n) (Axis b c' n) (c (SingleAxis b v n)) (c' (SingleAxis b v n)) #

axisPlots :: BaseSpace c ~ v => Lens' (Axis b c n) [DynamicPlot b v n] #

axisSize :: (HasLinearMap c, Num n, Ord n) => Lens' (Axis b c n) (SizeSpec c n) #

colourBarRange :: Lens' (Axis b v n) (n, n) #

currentPlots :: BaseSpace c ~ v => Traversal' (Axis b c n) (DynamicPlot b v n) #

finalPlots :: BaseSpace c ~ v => Setter' (Axis b c n) (StyledPlot b v n) #

plotModifier :: BaseSpace c ~ v => Lens' (Axis b c n) (Endo (StyledPlot b v n)) #

polarAxis :: (TypeableFloat n, Renderable (Text n) b, Renderable (Path V2 n) b) => Axis b Polar n #

r2Axis :: (TypeableFloat n, Renderable (Text n) b, Renderable (Path V2 n) b) => Axis b V2 n #

rAxis :: Radial c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

rLabel :: Radial c => Lens' (Axis b c n) String #

rMax :: Radial c => Lens' (Axis b c n) (Maybe n) #

thetaAxis :: Circle c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

thetaLabel :: Circle c => Lens' (Axis b c n) String #

xAxis :: R1 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

xLabel :: R1 c => Lens' (Axis b c n) String #

xMax :: R1 c => Lens' (Axis b c n) (Maybe n) #

xMin :: R1 c => Lens' (Axis b c n) (Maybe n) #

yAxis :: R2 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

yLabel :: R2 c => Lens' (Axis b c n) String #

yMax :: R2 c => Lens' (Axis b c n) (Maybe n) #

yMin :: R2 c => Lens' (Axis b c n) (Maybe n) #

zAxis :: R3 c => Lens' (Axis b c n) (SingleAxis b (BaseSpace c) n) #

zLabel :: R3 c => Lens' (Axis b c n) String #

zMax :: R3 c => Lens' (Axis b c n) (Maybe n) #

zMin :: R3 c => Lens' (Axis b c n) (Maybe n) #

addColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => BoundingBox V2 n -> ColourBar b n -> ColourMap -> (n, n) -> QDiagram b V2 n Any #

defColourBar :: (Renderable (Text n) b, Renderable (Path V2 n) b, TypeableFloat n) => ColourBar b n #

gradientColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => ColourMap -> QDiagram b V2 n Any #

pathColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => Int -> ColourMap -> QDiagram b V2 n Any #

renderColourBar :: (TypeableFloat n, Renderable (Path V2 n) b) => ColourBar b n -> ColourMap -> (n, n) -> n -> QDiagram b V2 n Any #

emptyGridLineFunction :: GridLineFunction n #

gridLinesStyle :: (HasGridLines f a, Applicative f) => LensLike' f a (Style (V a) (N a)) #

gridLinesVisible :: (HasGridLines f a, Applicative f) => LensLike' f a Bool #

hideGridLines :: (HasGridLines Identity a, MonadState a m) => m () #

onTicksGridLineFunction :: GridLineFunction n #

showGridLines :: (HasGridLines Identity a, MonadState a m) => m () #

atMajorTicks :: (n -> String) -> [n] -> (n, n) -> [(n, String)] #

tickLabelPositions :: (HasTickLabels f a b, Settable f) => LensLike' f a [(N a, String)] #

buildPlots :: BaseSpace c ~ v => Axis b c n -> [StyledPlot b v n] #

r2AxisMain :: (Parseable (MainOpts (QDiagram b V2 Double Any)), Mainable (Axis b V2 Double)) => Axis b V2 Double -> IO () #

calculateBounds :: OrderedField n => AxisScaling n -> Maybe (n, n) -> (n, n) #

calculateScaling :: (HasLinearMap v, OrderedField n, Applicative v) => v (AxisScaling n) -> BoundingBox v n -> (v (n, n), Transformation v n, Transformation v n) #

logDeform :: (InSpace v n a, Foldable v, Floating n, Deformable a a) => v LogScale -> a -> a #

logNumber :: Floating a => LogScale -> a -> a #

logPoint :: (Additive v, Floating n) => v LogScale -> Point v n -> Point v n #

noExtend :: Num n => Extending n #

autoTicks :: TicksAlignment #

centerTicks :: TicksAlignment #

centreTicks :: TicksAlignment #

hideTicks :: HasTicks Identity a => a -> a #

insideTicks :: TicksAlignment #

linearMajorTicks :: (RealFrac n, Floating n) => n -> (n, n) -> [n] #

logMajorTicks :: (RealFrac n, Floating n) => n -> (n, n) -> [n] #

majorTickPositions :: (HasMajorTicks f a, Settable f) => LensLike' f a [N a] #

majorTicksHelper :: (RealFrac n, Floating n) => [n] -> n -> (n, n) -> [n] #

minorTickPositions :: (HasMinorTicks f a, Settable f) => LensLike' f a [N a] #

minorTicksHelper :: Fractional n => Int -> [n] -> (n, n) -> [n] #

outsideTicks :: TicksAlignment #

ticksAlign :: (HasTicks f a, Applicative f) => LensLike' f a TicksAlignment #

ticksStyle :: (HasTicks f a, Applicative f) => LensLike' f a (Style (V a) (N a)) #

ticksVisible :: (HasTicks f a, Applicative f) => LensLike' f a Bool #

drawTitle :: TypeableFloat n => BoundingBox V2 n -> Title b V2 n -> QDiagram b V2 n Any #

drawLegend :: (TypeableFloat n, Renderable (Path V2 n) b) => BoundingBox V2 n -> [(QDiagram b V2 n Any, String)] -> Legend b n -> QDiagram b V2 n Any #

applyAreaStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: Type -> Type) a b, HasStyle t) => a -> t -> t #

applyLineStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: Type -> Type) a b, HasStyle t) => a -> t -> t #

applyMarkerStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: Type -> Type) a b, HasStyle t) => a -> t -> t #

applyTextStyle :: (SameSpace a t, HasPlotStyle (Const (PlotStyle b (V a) (N a)) :: Type -> Type) a b, HasStyle t) => a -> t -> t #

asterisk :: OrderedField n => Int -> n -> Path V2 n #

blackAndWhite :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

cmTraverse :: IndexedTraversal' Rational ColourMap (Colour Double) #

colourList :: ColourMap -> [(Rational, Colour Double)] #

colourMap :: [(Rational, Colour Double)] -> ColourMap #

colours1 :: OrderedField n => [Colour n] #

colours2 :: OrderedField n => [Colour n] #

crossShape :: (InSpace V2 n t, TrailLike t) => n -> t #

diamond :: (InSpace V2 n t, TrailLike t) => n -> t #

fadedColours :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

greys :: ColourMap #

inferno :: ColourMap #

ixColour :: Double -> Lens' ColourMap (Colour Double) #

ixColourR :: Rational -> Lens' ColourMap (Colour Double) #

lineMarkers :: OrderedField n => [Path V2 n] #

plasma :: ColourMap #

plus :: (InSpace V2 n t, TrailLike t) => n -> t #

star' :: (InSpace V2 n t, TrailLike t) => n -> t #

toStops :: Fractional n => ColourMap -> [GradientStop n] #

viridis :: ColourMap #

vividColours :: (TypeableFloat n, Renderable (Path V2 n) b) => AxisStyle b V2 n #

_DynamicPlot :: (Plotable p b, Typeable b) => Prism' (DynamicPlot b (V p) (N p)) (Plot p b) #

addLegendEntry :: (HasPlotOptions Identity a b, MonadState a m) => LegendEntry b (V a) (N a) -> m () #

bottom :: Placement #

bottomLeft :: Placement #

bottomRight :: Placement #

display :: (MonadState s m, HasVisibility a) => ASetter' s a -> m () #

dynamicPlot :: (Typeable p, Typeable b) => Traversal' (DynamicPlot b (V p) (N p)) (Plot p b) #

dynamicPlotMods :: Lens' (DynamicPlot b v n) (PlotMods b v n) #

hide :: (MonadState s m, HasVisibility a) => ASetter' s a -> m () #

horizontal :: HasOrientation a => Lens' a Bool #

key :: (HasPlotOptions Identity a b, MonadState a m, Num (N a)) => String -> m () #

left :: Placement #

leftAbove :: Placement #

leftBelow :: Placement #

leftBottom :: Placement #

leftMid :: Placement #

leftTop :: Placement #

legendPicture :: Lens' (LegendEntry b v n) (LegendPic b v n) #

legendPrecedence :: Lens' (LegendEntry b v n) n #

legendText :: Lens' (LegendEntry b v n) String #

midAbove :: Placement #

midBelow :: Placement #

mkLegendEntry :: Num n => String -> LegendEntry b v n #

mkPlot :: (Additive (V p), Num (N p)) => p -> Plot p b #

orient :: HasOrientation o => o -> a -> a -> a #

placeAgainst :: (InSpace V2 n a, SameSpace a b, Enveloped a, HasOrigin b, Alignable b) => a -> Placement -> n -> b -> b #

plotMods :: Lens' (Plot p b) (PlotMods b (V p) (N p)) #

rawPlot :: SameSpace p p' => Lens (Plot p b) (Plot p' b) p p' #

renderStyledPlot :: TypeableFloat n => AxisSpec V2 n -> StyledPlot b V2 n -> QDiagram b V2 n Any #

right :: Placement #

rightAbove :: Placement #

rightBelow :: Placement #

rightBottom :: Placement #

rightMid :: Placement #

rightTop :: Placement #

scaleNum :: Floating n => (n, n) -> LogScale -> n -> n #

singleStyledPlotLegend :: StyledPlot b v n -> [(n, QDiagram b v n Any, String)] #

specBounds :: Lens' (AxisSpec v n) (v (n, n)) #

specColourMap :: Lens' (AxisSpec v n) ColourMap #

specPoint :: (Applicative v, Additive v, Floating n) => AxisSpec v n -> Point v n -> Point v n #

specScale :: Lens' (AxisSpec v n) (v LogScale) #

specTrans :: Lens' (AxisSpec v n) (Transformation v n) #

styleDynamic :: PlotStyle b v n -> DynamicPlot b v n -> StyledPlot b v n #

styledPlot :: Typeable p => Traversal' (StyledPlot b (V p) (N p)) p #

styledPlotLegends :: Ord n => [StyledPlot b v n] -> [(QDiagram b v n Any, String)] #

top :: Placement #

topLeft :: Placement #

topRight :: Placement #

vertical :: HasOrientation a => Lens' a Bool #

barPlot :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) => f n -> State (Plot (BarPlot n) b) () -> m () #

barPlot' :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) => f n -> m () #

floatingBarPlot :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) => f (n, n) -> State (Plot (BarPlot n) b) () -> m () #

groupedBars :: Fractional n => State (MultiBarState b n a) () #

groupedBars' :: Fractional n => n -> State (MultiBarState b n a) () #

labelBars :: HasLabels a => [String] -> State a () #

mkBars :: (Foldable f, Num n) => BarLayout n -> f n -> BarPlot n #

mkFloatingBars :: Foldable f => BarLayout n -> f (n, n) -> BarPlot n #

mkGroupedBars :: Fractional n => n -> BarLayout n -> [[n]] -> [BarPlot n] #

mkRunningBars :: Num n => BarLayout n -> [[(n, n)]] -> [BarPlot n] #

mkStackedBars :: Num n => BarLayout n -> [[n]] -> [BarPlot n] #

mkStackedEqualBars :: Fractional n => n -> BarLayout n -> [[n]] -> [BarPlot n] #

multiBars :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f, Foldable g) => f a -> (a -> g n) -> State (MultiBarState b n a) () -> m () #

namedBarPlot :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) => f (String, n) -> State (Plot (BarPlot n) b) () -> m () #

namedBarPlot' :: (MonadState (Axis b V2 n) m, Plotable (BarPlot n) b, Foldable f) => f (String, n) -> m () #

onBars :: (a -> State (PlotMods b V2 n) ()) -> State (MultiBarState b n a) () #

runningBars :: Num n => State (MultiBarState b n a) () #

stackedBars :: Num n => State (MultiBarState b n a) () #

stackedEqualBars :: Fractional n => n -> State (MultiBarState b n a) () #

heatImage :: HeatMatrix -> ColourMap -> Image PixelRGB8 #

heatMap :: (Foldable f, Foldable g, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) => f (g Double) -> State (Plot (HeatMap b n) b) () -> m () #

heatMap' :: (Foldable f, Foldable g, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) => f (g Double) -> m () #

heatMapIndexed :: (VectorLike V2 Int i, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) => i -> (i -> Double) -> State (Plot (HeatMap b n) b) () -> m () #

heatMapIndexed' :: (VectorLike V2 Int i, TypeableFloat n, Typeable b, MonadState (Axis b V2 n) m, Renderable (Path V2 n) b) => i -> (i -> Double) -> m () #

hmPoints :: IndexedTraversal' (V2 Int) HeatMatrix Double #

mkHeatMap :: (Renderable (Path V2 n) b, TypeableFloat n) => HeatMatrix -> HeatMap b n #

mkHeatMatrix :: V2 Int -> (V2 Int -> Double) -> HeatMatrix #

mkHeatMatrix' :: (Foldable f, Foldable g) => f (g Double) -> HeatMatrix #

pathHeatRender :: (Renderable (Path V2 n) b, TypeableFloat n) => HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

pixelHeatRender :: (Renderable (DImage n Embedded) b, TypeableFloat n) => HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

pixelHeatRender' :: (Renderable (DImage n Embedded) b, TypeableFloat n) => Int -> HeatMatrix -> ColourMap -> QDiagram b V2 n Any #

cdf :: NormalisationMethod #

computedHistogram :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f) => n -> n -> f n -> State (Plot (HistogramPlot n) b) () -> m () #

count :: NormalisationMethod #

countDensity :: NormalisationMethod #

cumilative :: NormalisationMethod #

histogramPlot :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f, RealFrac n) => f n -> State (Plot (HistogramOptions n) b) () -> m () #

histogramPlot' :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, Foldable f, RealFrac n) => f n -> m () #

histogramPlotOf :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, RealFrac n) => Fold s n -> s -> State (Plot (HistogramOptions n) b) () -> m () #

histogramPlotOf' :: (MonadState (Axis b V2 n) m, Plotable (HistogramPlot n) b, RealFrac n) => Fold s n -> s -> m () #

mkComputedHistogram :: Foldable f => n -> n -> f n -> HistogramPlot n #

mkHistogramPlot :: (Foldable f, RealFrac n) => HistogramOptions n -> f n -> HistogramPlot n #

probability :: NormalisationMethod #

linePlot :: (BaseSpace c ~ v, Metric v, Foldable f, PointLike v n p, Plotable (Path v n) b, MonadState (Axis b c n) m) => f p -> State (Plot (Path v n) b) () -> m () #

linePlot' :: (BaseSpace c ~ v, Metric v, Foldable f, PointLike v n p, Plotable (Path v n) b, MonadState (Axis b c n) m) => f p -> m () #

mkPath :: (PointLike v n p, OrderedField n, Foldable f, Foldable g) => g (f p) -> Path v n #

mkPathOf :: (PointLike v n p, OrderedField n) => Fold s t -> Fold t p -> s -> Path v n #

mkTrail :: (PointLike v n p, OrderedField n, Foldable f) => f p -> Located (Trail v n) #

mkTrailOf :: (PointLike v n p, OrderedField n) => Fold s p -> s -> Located (Trail v n) #

pathPlot :: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) => Path v n -> State (Plot (Path v n) b) () -> m () #

pathPlot' :: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) => Path v n -> m () #

smoothLinePlot :: (BaseSpace c ~ v, Foldable f, Metric v, PointLike v n p, Plotable (Path v n) b, Fractional (v n), MonadState (Axis b c n) m) => f p -> State (Plot (Path v n) b) () -> m () #

smoothLinePlot' :: (BaseSpace c ~ v, Foldable f, PointLike v n p, Plotable (Path v n) b, Fractional (v n), MonadState (Axis b c n) m) => f p -> m () #

trailPlot :: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) => Trail v n -> State (Plot (Path v n) b) () -> m () #

trailPlot' :: (BaseSpace c ~ v, Plotable (Path v n) b, MonadState (Axis b c n) m) => Trail v n -> m () #

mkWedge :: Num n => Direction V2 n -> Angle n -> Wedge n #

onWedges :: (a -> State (Plot (Wedge n) b) ()) -> State (PieState b n a) () #

piePlot :: (MonadState (Axis b Polar n) m, Plotable (Wedge n) b, Foldable f) => f a -> (a -> n) -> State (PieState b n a) () -> m () #

piePlot' :: (MonadState (Axis b Polar n) m, Plotable (Wedge n) b, Foldable f) => f n -> m () #

wedgeKeys :: Num n => (a -> String) -> State (PieState b n a) () #

wedgePlot :: (v ~ BaseSpace c, v ~ V2, PointLike v n (Polar n), MonadState (Axis b c n) m, Plotable (Wedge n) b) => Direction V2 n -> Angle n -> State (Plot (Wedge n) b) () -> m () #

bubbleOptions :: (InSpace v n a, HasScatterOptions f a (n, Point v n)) => LensLike' f a (BubbleOptions v n) #

bubblePlot :: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n, Foldable f) => f (n, p) -> State (Plot (BubbleOptions v n) b) () -> m () #

bubblePlot' :: (v ~ BaseSpace c, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) => f (n, p) -> m () #

bubblePlotOf :: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n) => Fold s (n, p) -> s -> State (Plot (BubbleOptions v n) b) () -> m () #

bubblePlotOf' :: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable n) => Fold s (n, p) -> s -> State (Plot (BubbleOptions v n) b) () -> m () #

bubbleStyle :: (InSpace v n a, Settable f, HasScatterOptions f a (n, Point v n)) => LensLike' f a (n -> Style v n) #

bubbleTransform :: (InSpace v n a, HasScatterOptions f a (n, Point v n), Settable f) => LensLike' f a (n -> Transformation v n) #

gscatterOptionsFor :: (InSpace v n a, HasScatterOptions f a d) => proxy d -> LensLike' f a (ScatterOptions v n d) #

gscatterPlot :: (BaseSpace c ~ v, PointLike v n p, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Typeable d, Foldable f) => f d -> (d -> p) -> State (Plot (ScatterOptions v n d) b) () -> m () #

mkScatterOptions :: (PointLike v n p, Foldable f, Fractional n) => f a -> (a -> p) -> ScatterOptions v n a #

scatterOptions :: (InSpace v n a, HasScatterOptions f a (Point v n)) => LensLike' f a (ScatterOptions v n (Point v n)) #

scatterPlot :: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) => f p -> State (Plot (ScatterOptions v n (Point v n)) b) () -> m () #

scatterPlot' :: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b, Foldable f) => f p -> m () #

scatterPlotOf :: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b) => Fold s p -> s -> State (Plot (ScatterOptions v n (Point v n)) b) () -> m () #

scatterPlotOf' :: (BaseSpace c ~ v, PointLike v n p, Typeable n, MonadState (Axis b c n) m, Plotable (ScatterPlot v n) b) => Fold s p -> s -> m () #

(&=) :: MonadState s m => ASetter' s b -> State b a -> m () #

(&~~) :: Monad m => s -> StateT s m a -> m s #

class Radial t => Circle (t :: Type -> Type) where #

Methods

_azimuth :: Lens' (t a) (Angle a) #

_polar :: Lens' (t a) (Polar a) #

Instances
Circle Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_azimuth :: Lens' (Polar a) (Angle a) #

_polar :: Lens' (Polar a) (Polar a) #

class HasX (t :: Type -> Type) where #

Methods

x_ :: RealFloat n => Lens' (t n) n #

Instances
HasX V2 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (V2 n) n #

HasX Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Polar n) n #

HasX V3 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (V3 n) n #

HasX v => HasX (Point v) 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Point v n) n #

class HasX t => HasY (t :: Type -> Type) where #

Minimal complete definition

xy_

Methods

y_ :: RealFloat n => Lens' (t n) n #

xy_ :: RealFloat n => Lens' (t n) (V2 n) #

Instances
HasY V2 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (V2 n) n #

xy_ :: RealFloat n => Lens' (V2 n) (V2 n) #

HasY Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Polar n) n #

xy_ :: RealFloat n => Lens' (Polar n) (V2 n) #

HasY V3 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (V3 n) n #

xy_ :: RealFloat n => Lens' (V3 n) (V2 n) #

HasY v => HasY (Point v) 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Point v n) n #

xy_ :: RealFloat n => Lens' (Point v n) (V2 n) #

newtype Polar a #

Constructors

Polar (V2 a) 
Instances
Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

MonadFix Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

mfix :: (a -> Polar a) -> Polar a #

Applicative Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

pure :: a -> Polar a #

(<*>) :: Polar (a -> b) -> Polar a -> Polar b #

liftA2 :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #

(*>) :: Polar a -> Polar b -> Polar b #

(<*) :: Polar a -> Polar b -> Polar a #

Foldable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fold :: Monoid m => Polar m -> m #

foldMap :: Monoid m => (a -> m) -> Polar a -> m #

foldr :: (a -> b -> b) -> b -> Polar a -> b #

foldr' :: (a -> b -> b) -> b -> Polar a -> b #

foldl :: (b -> a -> b) -> b -> Polar a -> b #

foldl' :: (b -> a -> b) -> b -> Polar a -> b #

foldr1 :: (a -> a -> a) -> Polar a -> a #

foldl1 :: (a -> a -> a) -> Polar a -> a #

toList :: Polar a -> [a] #

null :: Polar a -> Bool #

length :: Polar a -> Int #

elem :: Eq a => a -> Polar a -> Bool #

maximum :: Ord a => Polar a -> a #

minimum :: Ord a => Polar a -> a #

sum :: Num a => Polar a -> a #

product :: Num a => Polar a -> a #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

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

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

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

sequence :: Monad m => Polar (m a) -> m (Polar a) #

MonadZip Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

mzip :: Polar a -> Polar b -> Polar (a, b) #

mzipWith :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #

munzip :: Polar (a, b) -> (Polar a, Polar b) #

Distributive Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

distribute :: Functor f => f (Polar a) -> Polar (f a) #

collect :: Functor f => (a -> Polar b) -> f a -> Polar (f b) #

distributeM :: Monad m => m (Polar a) -> Polar (m a) #

collectM :: Monad m => (a -> Polar b) -> m a -> Polar (m b) #

Representable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Rep Polar :: Type

Methods

tabulate :: (Rep Polar -> a) -> Polar a

index :: Polar a -> Rep Polar -> a

HasR Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_r :: RealFloat n => Lens' (Polar n) n #

Circle Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_azimuth :: Lens' (Polar a) (Angle a) #

_polar :: Lens' (Polar a) (Polar a) #

HasX Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

x_ :: RealFloat n => Lens' (Polar n) n #

HasY Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

y_ :: RealFloat n => Lens' (Polar n) n #

xy_ :: RealFloat n => Lens' (Polar n) (V2 n) #

Radial Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_radial :: Lens' (Polar a) a #

(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b Polar n 
Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b Polar n -> QDiagram b (BaseSpace Polar) n Any #

RealFloat n => PointLike V2 n (Polar n) 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

pointLike :: Iso' (Point V2 n) (Polar n)

unpointLike :: Iso' (Polar n) (Point V2 n)

Wrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Unwrapped (Polar a) :: Type #

Methods

_Wrapped' :: Iso' (Polar a) (Unwrapped (Polar a)) #

Generic1 Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Associated Types

type Rep1 Polar :: k -> Type #

Methods

from1 :: Polar a -> Rep1 Polar a #

to1 :: Rep1 Polar a -> Polar a #

Polar a1 ~ t => Rewrapped (Polar a2) t 
Instance details

Defined in Diagrams.Coordinates.Polar

type Rep Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

type Rep Polar = E Polar
type BaseSpace Polar 
Instance details

Defined in Plots.Axis

type BaseSpace Polar = V2
type Unwrapped (Polar a) 
Instance details

Defined in Diagrams.Coordinates.Polar

type Unwrapped (Polar a) = V2 a
type Rep1 Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

type Rep1 Polar = D1 (MetaData "Polar" "Diagrams.Coordinates.Polar" "plots-0.1.1.2-DPOSHgcPwPk1g20TDFjDd7" True) (C1 (MetaCons "Polar" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec1 V2)))
type MainOpts (Axis b Polar n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b Polar n) = MainOpts (QDiagram b V2 n Any)

class Radial (t :: Type -> Type) where #

Methods

_radial :: Lens' (t a) a #

Instances
Radial Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

_radial :: Lens' (Polar a) a #

data Axis b (c :: Type -> Type) n #

Instances
(Applicative f, Traversable c) => HasGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (Axis b c n) (GridLines (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMajorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (Axis b c n) (MajorGridLines (V (Axis b c n)) (N (Axis b c n))) #

majorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

majorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMinorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (Axis b c n) (MinorGridLines (V (Axis b c n)) (N (Axis b c n))) #

minorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

minorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasAxisScaling f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (Axis b c n) (AxisScaling (N (Axis b c n))) #

scaleAspectRatio :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

scaleMode :: LensLike' f (Axis b c n) ScaleMode #

logScale :: LensLike' f (Axis b c n) LogScale #

axisExtend :: LensLike' f (Axis b c n) (Extending (N (Axis b c n))) #

boundMin :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

boundMax :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

renderSize :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMajorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (Axis b c n) (MajorTicks (V (Axis b c n)) (N (Axis b c n))) #

majorTicksFunction :: LensLike' f (Axis b c n) ((N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

majorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

majorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

majorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasMinorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (Axis b c n) (MinorTicks (V (Axis b c n)) (N (Axis b c n))) #

minorTicksFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

minorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

minorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

minorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

(Applicative f, Traversable c) => HasTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (Axis b c n) (Ticks (V (Axis b c n)) (N (Axis b c n))) #

(BaseSpace c ~ V2, Settable f, Typeable n) => HasWedge f (Axis b c n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Axis b c n) (Wedge (N (Axis b c n))) #

wedgeOuterRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeInnerRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeOffset :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeWidth :: LensLike' f (Axis b c n) (Angle (N (Axis b c n))) #

wedgeDirection :: LensLike' f (Axis b c n) (Direction V2 (N (Axis b c n))) #

(Settable f, Typeable (BaseSpace c), Typeable n) => HasConnectingLine f (Axis b c n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Axis b c n) Bool #

(Applicative f, Traversable c) => HasAxisLabel f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (Axis b c n) (AxisLabel b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelText :: LensLike' f (Axis b c n) String #

axisLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

axisLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

axisLabelPosition :: LensLike' f (Axis b c n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (Axis b c n) AxisLabelPosition #

(Applicative f, Traversable c) => HasTickLabels f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (Axis b c n) (TickLabels b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [(N (Axis b c n), String)]) #

tickLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

tickLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

Settable f => HasPlotStyle f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotStyle :: LensLike' f (Axis b c n) (PlotStyle b (V (Axis b c n)) (N (Axis b c n))) #

plotColour :: LensLike' f (Axis b c n) (Colour Double) #

plotColor :: LensLike' f (Axis b c n) (Colour Double) #

lineStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

lineStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

textStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

textStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

plotMarker :: LensLike' f (Axis b c n) (QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

plotStyles :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

plotStyleFunctions :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

Settable f => HasPlotOptions f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotOptions :: LensLike' f (Axis b c n) (PlotOptions b (V (Axis b c n)) (N (Axis b c n))) #

plotName :: LensLike' f (Axis b c n) Name #

clipPlot :: LensLike' f (Axis b c n) Bool #

legendEntries :: LensLike' f (Axis b c n) [LegendEntry b (V (Axis b c n)) (N (Axis b c n))] #

plotTransform :: LensLike' f (Axis b c n) (Transformation (V (Axis b c n)) (N (Axis b c n))) #

plotVisible :: LensLike' f (Axis b c n) Bool #

(Applicative f, Typeable b, Typeable (BaseSpace c), Typeable n, Typeable a) => HasScatterOptions f (Axis b c n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Axis b c n) (ScatterOptions (V (Axis b c n)) (N (Axis b c n)) a) #

scatterTransform :: LensLike' f (Axis b c n) (a -> Transformation (V (Axis b c n)) (N (Axis b c n))) #

scatterStyle :: LensLike' f (Axis b c n) (a -> Style (V (Axis b c n)) (N (Axis b c n))) #

scatterPosition :: LensLike' f (Axis b c n) (a -> Point (V (Axis b c n)) (N (Axis b c n))) #

HasColourBar (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

colourBar :: Lens' (Axis b v n) (ColourBar b (N (Axis b v n))) #

colourBarDraw :: Lens' (Axis b v n) (ColourMap -> QDiagram b V2 (N (Axis b v n)) Any) #

colourBarWidth :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarLengthFunction :: Lens' (Axis b v n) (N (Axis b v n) -> N (Axis b v n)) #

colourBarGap :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarStyle :: Lens' (Axis b v n) (Style V2 (N (Axis b v n))) #

HasTitle (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

title :: Lens' (Axis b c n) (Title b (V (Axis b c n)) (N (Axis b c n))) #

titleText :: Lens' (Axis b c n) String #

titleStyle :: Lens' (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

titlePlacement :: Lens' (Axis b c n) Placement #

titleTextFunction :: Lens' (Axis b c n) (TextAlignment (N (Axis b c n)) -> String -> QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

titleAlignment :: Lens' (Axis b c n) (TextAlignment (N (Axis b c n))) #

titleGap :: Lens' (Axis b c n) (N (Axis b c n)) #

HasLegend (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

legend :: Lens' (Axis b c n) (Legend b (N (Axis b c n))) #

legendPlacement :: Lens' (Axis b c n) Placement #

legendGap :: Lens' (Axis b c n) (N (Axis b c n)) #

legendStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendSpacing :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextWidth :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextFunction :: Lens' (Axis b c n) (String -> QDiagram b V2 (N (Axis b c n)) Any) #

legendTextStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendOrientation :: Lens' (Axis b c n) Orientation #

HasAxisStyle (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisStyle :: Lens' (Axis b v n) (AxisStyle b (V (Axis b v n)) (N (Axis b v n))) #

axisColourMap :: Lens' (Axis b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (Axis b v n) (PlotStyle b (V (Axis b v n)) (N (Axis b v n))) #

type N (Axis b v n) 
Instance details

Defined in Plots.Axis

type N (Axis b v n) = n
type V (Axis b v n) 
Instance details

Defined in Plots.Axis

type V (Axis b v n) = BaseSpace v
type MainOpts (Axis b V2 n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b V2 n) = MainOpts (QDiagram b V2 n Any)
type MainOpts (Axis b Polar n) 
Instance details

Defined in Plots.Axis.Render

type MainOpts (Axis b Polar n) = MainOpts (QDiagram b V2 n Any)
type Args (Axis b v n) 
Instance details

Defined in Plots.Axis.Render

type Args (Axis b v n) = ()
type ResultOf (Axis b v n) 
Instance details

Defined in Plots.Axis.Render

type ResultOf (Axis b v n) = Axis b v n

type family BaseSpace (c :: Type -> Type) :: Type -> Type #

Instances
type BaseSpace Complex 
Instance details

Defined in Plots.Axis

type BaseSpace Complex = V2
type BaseSpace V2 
Instance details

Defined in Plots.Axis

type BaseSpace V2 = V2
type BaseSpace Polar 
Instance details

Defined in Plots.Axis

type BaseSpace Polar = V2
type BaseSpace V3 
Instance details

Defined in Plots.Axis

type BaseSpace V3 = V3

data SingleAxis b (v :: Type -> Type) n #

Instances
Functor f => HasGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (SingleAxis b v n) (GridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMajorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (SingleAxis b v n) (MajorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

majorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMinorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (SingleAxis b v n) (MinorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

minorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasAxisScaling f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (SingleAxis b v n) (AxisScaling (N (SingleAxis b v n))) #

scaleAspectRatio :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

scaleMode :: LensLike' f (SingleAxis b v n) ScaleMode #

logScale :: LensLike' f (SingleAxis b v n) LogScale #

axisExtend :: LensLike' f (SingleAxis b v n) (Extending (N (SingleAxis b v n))) #

boundMin :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

boundMax :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

renderSize :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

Functor f => HasMajorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (SingleAxis b v n) (MajorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorTicksFunction :: LensLike' f (SingleAxis b v n) ((N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

majorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

majorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

majorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasMinorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (SingleAxis b v n) (MinorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorTicksFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

minorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

minorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

minorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (SingleAxis b v n) (Ticks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

Functor f => HasAxisLine f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisLine :: LensLike' f (SingleAxis b v n) (AxisLine (V (SingleAxis b v n)) (N (SingleAxis b v n)))

axisLineType :: LensLike' f (SingleAxis b v n) AxisLineType

axisLineArrowOpts :: LensLike' f (SingleAxis b v n) (Maybe (ArrowOpts (N (SingleAxis b v n))))

axisLineStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n)))

Functor f => HasAxisLabel f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (SingleAxis b v n) (AxisLabel b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelText :: LensLike' f (SingleAxis b v n) String #

axisLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

axisLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelPosition :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

Functor f => HasTickLabels f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (SingleAxis b v n) (TickLabels b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [(N (SingleAxis b v n), String)]) #

tickLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

(TypeableFloat n, Renderable (Text n) b) => Default (SingleAxis b V2 n) 
Instance details

Defined in Plots.Axis

Methods

def :: SingleAxis b V2 n #

HasVisibility (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

visible :: Lens' (SingleAxis b v n) Bool #

hidden :: Lens' (SingleAxis b v n) Bool #

type N (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

type N (SingleAxis b v n) = n
type V (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

type V (SingleAxis b v n) = v

data ColourBar b n #

Instances
Functor f => HasMajorGridLines f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorGridLines :: LensLike' f (ColourBar b n) (MajorGridLines (V (ColourBar b n)) (N (ColourBar b n))) #

majorGridLinesFunction :: LensLike' f (ColourBar b n) (GridLineFunction (N (ColourBar b n))) #

majorGridLinesStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMajorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorTicks :: LensLike' f (ColourBar b n) (MajorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

majorTicksFunction :: LensLike' f (ColourBar b n) ((N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

majorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

majorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

majorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMinorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

minorTicks :: LensLike' f (ColourBar b n) (MinorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

minorTicksFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

minorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

minorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

minorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasTickLabels f (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

tickLabel :: LensLike' f (ColourBar b n) (TickLabels b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelTextFunction :: LensLike' f (ColourBar b n) (TextFunction b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [(N (ColourBar b n), String)]) #

tickLabelStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelGap :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

Typeable n => HasStyle (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

applyStyle :: Style (V (ColourBar b n)) (N (ColourBar b n)) -> ColourBar b n -> ColourBar b n

HasGap (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

gap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

HasOrientation (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

orientation :: Lens' (ColourBar b n) Orientation #

HasPlacement (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

placement :: Lens' (ColourBar b n) Placement #

placementAt :: Lens' (ColourBar b n) (V2 Rational) #

placementAnchor :: Lens' (ColourBar b n) (V2 Rational) #

gapDirection :: Lens' (ColourBar b n) (Direction V2 Rational) #

HasVisibility (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

visible :: Lens' (ColourBar b n) Bool #

hidden :: Lens' (ColourBar b n) Bool #

HasColourBar (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

colourBar :: Lens' (ColourBar b n) (ColourBar b (N (ColourBar b n))) #

colourBarDraw :: Lens' (ColourBar b n) (ColourMap -> QDiagram b V2 (N (ColourBar b n)) Any) #

colourBarWidth :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarLengthFunction :: Lens' (ColourBar b n) (N (ColourBar b n) -> N (ColourBar b n)) #

colourBarGap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarStyle :: Lens' (ColourBar b n) (Style V2 (N (ColourBar b n))) #

type N (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

type N (ColourBar b n) = n
type V (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

type V (ColourBar b n) = V2

class HasColourBar a b | a -> b where #

Minimal complete definition

colourBar

Methods

colourBar :: Lens' a (ColourBar b (N a)) #

colourBarDraw :: Lens' a (ColourMap -> QDiagram b V2 (N a) Any) #

colourBarWidth :: Lens' a (N a) #

colourBarLengthFunction :: Lens' a (N a -> N a) #

colourBarGap :: Lens' a (N a) #

colourBarStyle :: Lens' a (Style V2 (N a)) #

Instances
HasColourBar (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

colourBar :: Lens' (ColourBar b n) (ColourBar b (N (ColourBar b n))) #

colourBarDraw :: Lens' (ColourBar b n) (ColourMap -> QDiagram b V2 (N (ColourBar b n)) Any) #

colourBarWidth :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarLengthFunction :: Lens' (ColourBar b n) (N (ColourBar b n) -> N (ColourBar b n)) #

colourBarGap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

colourBarStyle :: Lens' (ColourBar b n) (Style V2 (N (ColourBar b n))) #

HasColourBar (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

colourBar :: Lens' (Axis b v n) (ColourBar b (N (Axis b v n))) #

colourBarDraw :: Lens' (Axis b v n) (ColourMap -> QDiagram b V2 (N (Axis b v n)) Any) #

colourBarWidth :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarLengthFunction :: Lens' (Axis b v n) (N (Axis b v n) -> N (Axis b v n)) #

colourBarGap :: Lens' (Axis b v n) (N (Axis b v n)) #

colourBarStyle :: Lens' (Axis b v n) (Style V2 (N (Axis b v n))) #

type GridLineFunction n = [n] -> (n, n) -> [n] #

data GridLines (v :: Type -> Type) n #

Instances
Functor f => HasGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

gridLines :: LensLike' f (GridLines v n) (GridLines (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMajorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (GridLines v n) (MajorGridLines (V (GridLines v n)) (N (GridLines v n))) #

majorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

majorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMinorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (GridLines v n) (MinorGridLines (V (GridLines v n)) (N (GridLines v n))) #

minorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

minorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

(Typeable n, Floating n) => Default (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: GridLines v n #

Typeable n => HasStyle (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (GridLines v n)) (N (GridLines v n)) -> GridLines v n -> GridLines v n

type N (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (GridLines v n) = n
type V (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (GridLines v n) = v

class (HasMinorGridLines f a, HasMajorGridLines f a) => HasGridLines (f :: Type -> Type) a where #

Methods

gridLines :: LensLike' f a (GridLines (V a) (N a)) #

Instances
Functor f => HasGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

gridLines :: LensLike' f (GridLines v n) (GridLines (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (SingleAxis b v n) (GridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

gridLines :: LensLike' f (Axis b c n) (GridLines (V (Axis b c n)) (N (Axis b c n))) #

class HasMajorGridLines (f :: Type -> Type) a where #

Minimal complete definition

majorGridLines

Methods

majorGridLines :: LensLike' f a (MajorGridLines (V a) (N a)) #

majorGridLinesFunction :: LensLike' f a (GridLineFunction (N a)) #

majorGridLinesStyle :: LensLike' f a (Style (V a) (N a)) #

Instances
HasMajorGridLines f (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (MajorGridLines v n) (MajorGridLines (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

majorGridLinesFunction :: LensLike' f (MajorGridLines v n) (GridLineFunction (N (MajorGridLines v n))) #

majorGridLinesStyle :: LensLike' f (MajorGridLines v n) (Style (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

Functor f => HasMajorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (GridLines v n) (MajorGridLines (V (GridLines v n)) (N (GridLines v n))) #

majorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

majorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMajorGridLines f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorGridLines :: LensLike' f (ColourBar b n) (MajorGridLines (V (ColourBar b n)) (N (ColourBar b n))) #

majorGridLinesFunction :: LensLike' f (ColourBar b n) (GridLineFunction (N (ColourBar b n))) #

majorGridLinesStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMajorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (SingleAxis b v n) (MajorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

majorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMajorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorGridLines :: LensLike' f (Axis b c n) (MajorGridLines (V (Axis b c n)) (N (Axis b c n))) #

majorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

majorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

class HasMinorGridLines (f :: Type -> Type) a where #

Minimal complete definition

minorGridLines

Methods

minorGridLines :: LensLike' f a (MinorGridLines (V a) (N a)) #

minorGridLinesFunction :: LensLike' f a (GridLineFunction (N a)) #

minorGridLinesStyle :: LensLike' f a (Style (V a) (N a)) #

Instances
HasMinorGridLines f (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (MinorGridLines v n) (MinorGridLines (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

minorGridLinesFunction :: LensLike' f (MinorGridLines v n) (GridLineFunction (N (MinorGridLines v n))) #

minorGridLinesStyle :: LensLike' f (MinorGridLines v n) (Style (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

Functor f => HasMinorGridLines f (GridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (GridLines v n) (MinorGridLines (V (GridLines v n)) (N (GridLines v n))) #

minorGridLinesFunction :: LensLike' f (GridLines v n) (GridLineFunction (N (GridLines v n))) #

minorGridLinesStyle :: LensLike' f (GridLines v n) (Style (V (GridLines v n)) (N (GridLines v n))) #

Functor f => HasMinorGridLines f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (SingleAxis b v n) (MinorGridLines (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorGridLinesFunction :: LensLike' f (SingleAxis b v n) (GridLineFunction (N (SingleAxis b v n))) #

minorGridLinesStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMinorGridLines f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorGridLines :: LensLike' f (Axis b c n) (MinorGridLines (V (Axis b c n)) (N (Axis b c n))) #

minorGridLinesFunction :: LensLike' f (Axis b c n) (GridLineFunction (N (Axis b c n))) #

minorGridLinesStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

data MajorGridLines (v :: Type -> Type) n #

Instances
HasMajorGridLines f (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

majorGridLines :: LensLike' f (MajorGridLines v n) (MajorGridLines (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

majorGridLinesFunction :: LensLike' f (MajorGridLines v n) (GridLineFunction (N (MajorGridLines v n))) #

majorGridLinesStyle :: LensLike' f (MajorGridLines v n) (Style (V (MajorGridLines v n)) (N (MajorGridLines v n))) #

(Typeable n, Floating n) => Default (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MajorGridLines v n #

Typeable n => HasStyle (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (MajorGridLines v n)) (N (MajorGridLines v n)) -> MajorGridLines v n -> MajorGridLines v n

HasVisibility (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MajorGridLines v n) Bool #

hidden :: Lens' (MajorGridLines v n) Bool #

type N (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (MajorGridLines v n) = n
type V (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (MajorGridLines v n) = v

data MinorGridLines (v :: Type -> Type) n #

Instances
HasMinorGridLines f (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

minorGridLines :: LensLike' f (MinorGridLines v n) (MinorGridLines (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

minorGridLinesFunction :: LensLike' f (MinorGridLines v n) (GridLineFunction (N (MinorGridLines v n))) #

minorGridLinesStyle :: LensLike' f (MinorGridLines v n) (Style (V (MinorGridLines v n)) (N (MinorGridLines v n))) #

(Typeable n, Floating n) => Default (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

def :: MinorGridLines v n #

Typeable n => HasStyle (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

applyStyle :: Style (V (MinorGridLines v n)) (N (MinorGridLines v n)) -> MinorGridLines v n -> MinorGridLines v n

HasVisibility (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MinorGridLines v n) Bool #

hidden :: Lens' (MinorGridLines v n) Bool #

type N (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type N (MinorGridLines v n) = n
type V (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

type V (MinorGridLines v n) = v

data AxisLabel b (v :: Type -> Type) n #

Instances
HasAxisLabel f (AxisLabel b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

axisLabel :: LensLike' f (AxisLabel b v n) (AxisLabel b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelText :: LensLike' f (AxisLabel b v n) String #

axisLabelTextFunction :: LensLike' f (AxisLabel b v n) (TextFunction b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelGap :: LensLike' f (AxisLabel b v n) (N (AxisLabel b v n)) #

axisLabelStyle :: LensLike' f (AxisLabel b v n) (Style (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelPosition :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

(TypeableFloat n, Renderable (Text n) b) => Default (AxisLabel b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: AxisLabel b V2 n #

Typeable n => HasStyle (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

applyStyle :: Style (V (AxisLabel b v n)) (N (AxisLabel b v n)) -> AxisLabel b v n -> AxisLabel b v n

HasGap (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (AxisLabel b v n) (N (AxisLabel b v n)) #

HasVisibility (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (AxisLabel b v n) Bool #

hidden :: Lens' (AxisLabel b v n) Bool #

type N (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

type N (AxisLabel b v n) = n
type V (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

type V (AxisLabel b v n) = v

data AxisLabelPlacement #

Constructors

InsideAxisLabel 
OutsideAxisLabel 

data AxisLabelPosition #

Constructors

MiddleAxisLabel 
LowerAxisLabel 
UpperAxisLabel 

class HasAxisLabel (f :: Type -> Type) a b | a -> b where #

Minimal complete definition

axisLabel

Methods

axisLabel :: LensLike' f a (AxisLabel b (V a) (N a)) #

axisLabelText :: LensLike' f a String #

axisLabelTextFunction :: LensLike' f a (TextFunction b (V a) (N a)) #

axisLabelGap :: LensLike' f a (N a) #

axisLabelStyle :: LensLike' f a (Style (V a) (N a)) #

axisLabelPosition :: LensLike' f a AxisLabelPosition #

axisLabelPlacement :: LensLike' f a AxisLabelPosition #

Instances
HasAxisLabel f (AxisLabel b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

axisLabel :: LensLike' f (AxisLabel b v n) (AxisLabel b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelText :: LensLike' f (AxisLabel b v n) String #

axisLabelTextFunction :: LensLike' f (AxisLabel b v n) (TextFunction b (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelGap :: LensLike' f (AxisLabel b v n) (N (AxisLabel b v n)) #

axisLabelStyle :: LensLike' f (AxisLabel b v n) (Style (V (AxisLabel b v n)) (N (AxisLabel b v n))) #

axisLabelPosition :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (AxisLabel b v n) AxisLabelPosition #

Functor f => HasAxisLabel f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (SingleAxis b v n) (AxisLabel b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelText :: LensLike' f (SingleAxis b v n) String #

axisLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

axisLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

axisLabelPosition :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (SingleAxis b v n) AxisLabelPosition #

(Applicative f, Traversable c) => HasAxisLabel f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

axisLabel :: LensLike' f (Axis b c n) (AxisLabel b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelText :: LensLike' f (Axis b c n) String #

axisLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

axisLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

axisLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

axisLabelPosition :: LensLike' f (Axis b c n) AxisLabelPosition #

axisLabelPlacement :: LensLike' f (Axis b c n) AxisLabelPosition #

class HasTickLabels (f :: Type -> Type) a b | a -> b where #

Minimal complete definition

tickLabel

Methods

tickLabel :: LensLike' f a (TickLabels b (V a) (N a)) #

tickLabelTextFunction :: LensLike' f a (TextFunction b (V a) (N a)) #

tickLabelFunction :: LensLike' f a ([N a] -> (N a, N a) -> [(N a, String)]) #

tickLabelStyle :: LensLike' f a (Style (V a) (N a)) #

tickLabelGap :: LensLike' f a (N a) #

Instances
Functor f => HasTickLabels f (ColourBar b n) b 
Instance details

Defined in Plots.Axis.ColourBar

Methods

tickLabel :: LensLike' f (ColourBar b n) (TickLabels b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelTextFunction :: LensLike' f (ColourBar b n) (TextFunction b (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [(N (ColourBar b n), String)]) #

tickLabelStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

tickLabelGap :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

HasTickLabels f (TickLabels b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

tickLabel :: LensLike' f (TickLabels b v n) (TickLabels b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelTextFunction :: LensLike' f (TickLabels b v n) (TextFunction b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelFunction :: LensLike' f (TickLabels b v n) ([N (TickLabels b v n)] -> (N (TickLabels b v n), N (TickLabels b v n)) -> [(N (TickLabels b v n), String)]) #

tickLabelStyle :: LensLike' f (TickLabels b v n) (Style (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelGap :: LensLike' f (TickLabels b v n) (N (TickLabels b v n)) #

Functor f => HasTickLabels f (SingleAxis b v n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (SingleAxis b v n) (TickLabels b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelTextFunction :: LensLike' f (SingleAxis b v n) (TextFunction b (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [(N (SingleAxis b v n), String)]) #

tickLabelStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

tickLabelGap :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

(Applicative f, Traversable c) => HasTickLabels f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

tickLabel :: LensLike' f (Axis b c n) (TickLabels b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelTextFunction :: LensLike' f (Axis b c n) (TextFunction b (V (Axis b c n)) (N (Axis b c n))) #

tickLabelFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [(N (Axis b c n), String)]) #

tickLabelStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

tickLabelGap :: LensLike' f (Axis b c n) (N (Axis b c n)) #

type TextFunction b (v :: Type -> Type) n = TextAlignment n -> String -> QDiagram b v n Any #

data TickLabels b (v :: Type -> Type) n #

Instances
HasTickLabels f (TickLabels b v n) b 
Instance details

Defined in Plots.Axis.Labels

Methods

tickLabel :: LensLike' f (TickLabels b v n) (TickLabels b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelTextFunction :: LensLike' f (TickLabels b v n) (TextFunction b (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelFunction :: LensLike' f (TickLabels b v n) ([N (TickLabels b v n)] -> (N (TickLabels b v n), N (TickLabels b v n)) -> [(N (TickLabels b v n), String)]) #

tickLabelStyle :: LensLike' f (TickLabels b v n) (Style (V (TickLabels b v n)) (N (TickLabels b v n))) #

tickLabelGap :: LensLike' f (TickLabels b v n) (N (TickLabels b v n)) #

(TypeableFloat n, Renderable (Text n) b) => Default (TickLabels b V2 n) 
Instance details

Defined in Plots.Axis.Labels

Methods

def :: TickLabels b V2 n #

HasGap (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (TickLabels b v n) (N (TickLabels b v n)) #

HasVisibility (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (TickLabels b v n) Bool #

hidden :: Lens' (TickLabels b v n) Bool #

type N (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

type N (TickLabels b v n) = n
type V (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

type V (TickLabels b v n) = v

class RenderAxis b (v :: Type -> Type) n where #

Methods

renderAxis :: Axis b v n -> QDiagram b (BaseSpace v) n Any #

Instances
(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b V2 n 
Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b V2 n -> QDiagram b (BaseSpace V2) n Any #

(TypeableFloat n, Renderable (Path V2 n) b) => RenderAxis b Polar n 
Instance details

Defined in Plots.Axis.Render

Methods

renderAxis :: Axis b Polar n -> QDiagram b (BaseSpace Polar) n Any #

data AxisScaling n #

Instances
HasAxisScaling f (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

axisScaling :: LensLike' f (AxisScaling n) (AxisScaling (N (AxisScaling n))) #

scaleAspectRatio :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

scaleMode :: LensLike' f (AxisScaling n) ScaleMode #

logScale :: LensLike' f (AxisScaling n) LogScale #

axisExtend :: LensLike' f (AxisScaling n) (Extending (N (AxisScaling n))) #

boundMin :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

boundMax :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

renderSize :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

Fractional n => Default (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: AxisScaling n #

type N (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

type N (AxisScaling n) = n

data Extending n #

Constructors

AbsoluteExtend n 
RelativeExtend n 
Instances
Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Eq n => Eq (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: Extending n -> Extending n -> Bool #

(/=) :: Extending n -> Extending n -> Bool #

Ord n => Ord (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

compare :: Extending n -> Extending n -> Ordering #

(<) :: Extending n -> Extending n -> Bool #

(<=) :: Extending n -> Extending n -> Bool #

(>) :: Extending n -> Extending n -> Bool #

(>=) :: Extending n -> Extending n -> Bool #

max :: Extending n -> Extending n -> Extending n #

min :: Extending n -> Extending n -> Extending n #

Show n => Show (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> Extending n -> ShowS #

show :: Extending n -> String #

showList :: [Extending n] -> ShowS #

class HasAxisScaling (f :: Type -> Type) a where #

Minimal complete definition

axisScaling

Methods

axisScaling :: LensLike' f a (AxisScaling (N a)) #

scaleAspectRatio :: LensLike' f a (Maybe (N a)) #

scaleMode :: LensLike' f a ScaleMode #

logScale :: LensLike' f a LogScale #

axisExtend :: LensLike' f a (Extending (N a)) #

boundMin :: LensLike' f a (Maybe (N a)) #

boundMax :: LensLike' f a (Maybe (N a)) #

renderSize :: LensLike' f a (Maybe (N a)) #

Instances
HasAxisScaling f (AxisScaling n) 
Instance details

Defined in Plots.Axis.Scale

Methods

axisScaling :: LensLike' f (AxisScaling n) (AxisScaling (N (AxisScaling n))) #

scaleAspectRatio :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

scaleMode :: LensLike' f (AxisScaling n) ScaleMode #

logScale :: LensLike' f (AxisScaling n) LogScale #

axisExtend :: LensLike' f (AxisScaling n) (Extending (N (AxisScaling n))) #

boundMin :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

boundMax :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

renderSize :: LensLike' f (AxisScaling n) (Maybe (N (AxisScaling n))) #

Functor f => HasAxisScaling f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (SingleAxis b v n) (AxisScaling (N (SingleAxis b v n))) #

scaleAspectRatio :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

scaleMode :: LensLike' f (SingleAxis b v n) ScaleMode #

logScale :: LensLike' f (SingleAxis b v n) LogScale #

axisExtend :: LensLike' f (SingleAxis b v n) (Extending (N (SingleAxis b v n))) #

boundMin :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

boundMax :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

renderSize :: LensLike' f (SingleAxis b v n) (Maybe (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasAxisScaling f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

axisScaling :: LensLike' f (Axis b c n) (AxisScaling (N (Axis b c n))) #

scaleAspectRatio :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

scaleMode :: LensLike' f (Axis b c n) ScaleMode #

logScale :: LensLike' f (Axis b c n) LogScale #

axisExtend :: LensLike' f (Axis b c n) (Extending (N (Axis b c n))) #

boundMin :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

boundMax :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

renderSize :: LensLike' f (Axis b c n) (Maybe (N (Axis b c n))) #

data LogScale #

Constructors

LinearAxis 
LogAxis 
Instances
Eq LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: LogScale -> LogScale -> Bool #

(/=) :: LogScale -> LogScale -> Bool #

Show LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> LogScale -> ShowS #

show :: LogScale -> String #

showList :: [LogScale] -> ShowS #

Default LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

def :: LogScale #

data ScaleMode #

Constructors

AutoScale 
NoScale 
Stretch 
UniformScale UniformScaleStrategy 
Instances
Read ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS ScaleMode #

readList :: ReadS [ScaleMode] #

readPrec :: ReadPrec ScaleMode #

readListPrec :: ReadPrec [ScaleMode] #

Show ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> ScaleMode -> ShowS #

show :: ScaleMode -> String #

showList :: [ScaleMode] -> ShowS #

data UniformScaleStrategy #

Constructors

AutoUniformScale 
UnitOnly 
ChangeVerticalLimits 
ChangeHorizontalLimits 
Instances
Read UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS UniformScaleStrategy #

readList :: ReadS [UniformScaleStrategy] #

readPrec :: ReadPrec UniformScaleStrategy #

readListPrec :: ReadPrec [UniformScaleStrategy] #

Show UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> UniformScaleStrategy -> ShowS #

show :: UniformScaleStrategy -> String #

showList :: [UniformScaleStrategy] -> ShowS #

class HasMajorTicks (f :: Type -> Type) a where #

Minimal complete definition

majorTicks

Methods

majorTicks :: LensLike' f a (MajorTicks (V a) (N a)) #

majorTicksFunction :: LensLike' f a ((N a, N a) -> [N a]) #

majorTicksAlignment :: LensLike' f a TicksAlignment #

majorTicksLength :: LensLike' f a (N a) #

majorTicksStyle :: LensLike' f a (Style (V a) (N a)) #

Instances
Functor f => HasMajorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (Ticks v n) (MajorTicks (V (Ticks v n)) (N (Ticks v n))) #

majorTicksFunction :: LensLike' f (Ticks v n) ((N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

majorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

majorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

majorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

HasMajorTicks f (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (MajorTicks v n) (MajorTicks (V (MajorTicks v n)) (N (MajorTicks v n))) #

majorTicksFunction :: LensLike' f (MajorTicks v n) ((N (MajorTicks v n), N (MajorTicks v n)) -> [N (MajorTicks v n)]) #

majorTicksAlignment :: LensLike' f (MajorTicks v n) TicksAlignment #

majorTicksLength :: LensLike' f (MajorTicks v n) (N (MajorTicks v n)) #

majorTicksStyle :: LensLike' f (MajorTicks v n) (Style (V (MajorTicks v n)) (N (MajorTicks v n))) #

Functor f => HasMajorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

majorTicks :: LensLike' f (ColourBar b n) (MajorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

majorTicksFunction :: LensLike' f (ColourBar b n) ((N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

majorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

majorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

majorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMajorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (SingleAxis b v n) (MajorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

majorTicksFunction :: LensLike' f (SingleAxis b v n) ((N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

majorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

majorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

majorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMajorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

majorTicks :: LensLike' f (Axis b c n) (MajorTicks (V (Axis b c n)) (N (Axis b c n))) #

majorTicksFunction :: LensLike' f (Axis b c n) ((N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

majorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

majorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

majorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

class HasMinorTicks (f :: Type -> Type) a where #

Minimal complete definition

minorTicks

Methods

minorTicks :: LensLike' f a (MinorTicks (V a) (N a)) #

minorTicksFunction :: LensLike' f a ([N a] -> (N a, N a) -> [N a]) #

minorTicksAlignment :: LensLike' f a TicksAlignment #

minorTicksLength :: LensLike' f a (N a) #

minorTicksStyle :: LensLike' f a (Style (V a) (N a)) #

Instances
Functor f => HasMinorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (Ticks v n) (MinorTicks (V (Ticks v n)) (N (Ticks v n))) #

minorTicksFunction :: LensLike' f (Ticks v n) ([N (Ticks v n)] -> (N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

minorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

minorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

minorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

HasMinorTicks f (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (MinorTicks v n) (MinorTicks (V (MinorTicks v n)) (N (MinorTicks v n))) #

minorTicksFunction :: LensLike' f (MinorTicks v n) ([N (MinorTicks v n)] -> (N (MinorTicks v n), N (MinorTicks v n)) -> [N (MinorTicks v n)]) #

minorTicksAlignment :: LensLike' f (MinorTicks v n) TicksAlignment #

minorTicksLength :: LensLike' f (MinorTicks v n) (N (MinorTicks v n)) #

minorTicksStyle :: LensLike' f (MinorTicks v n) (Style (V (MinorTicks v n)) (N (MinorTicks v n))) #

Functor f => HasMinorTicks f (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

minorTicks :: LensLike' f (ColourBar b n) (MinorTicks (V (ColourBar b n)) (N (ColourBar b n))) #

minorTicksFunction :: LensLike' f (ColourBar b n) ([N (ColourBar b n)] -> (N (ColourBar b n), N (ColourBar b n)) -> [N (ColourBar b n)]) #

minorTicksAlignment :: LensLike' f (ColourBar b n) TicksAlignment #

minorTicksLength :: LensLike' f (ColourBar b n) (N (ColourBar b n)) #

minorTicksStyle :: LensLike' f (ColourBar b n) (Style (V (ColourBar b n)) (N (ColourBar b n))) #

Functor f => HasMinorTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (SingleAxis b v n) (MinorTicks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

minorTicksFunction :: LensLike' f (SingleAxis b v n) ([N (SingleAxis b v n)] -> (N (SingleAxis b v n), N (SingleAxis b v n)) -> [N (SingleAxis b v n)]) #

minorTicksAlignment :: LensLike' f (SingleAxis b v n) TicksAlignment #

minorTicksLength :: LensLike' f (SingleAxis b v n) (N (SingleAxis b v n)) #

minorTicksStyle :: LensLike' f (SingleAxis b v n) (Style (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasMinorTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

minorTicks :: LensLike' f (Axis b c n) (MinorTicks (V (Axis b c n)) (N (Axis b c n))) #

minorTicksFunction :: LensLike' f (Axis b c n) ([N (Axis b c n)] -> (N (Axis b c n), N (Axis b c n)) -> [N (Axis b c n)]) #

minorTicksAlignment :: LensLike' f (Axis b c n) TicksAlignment #

minorTicksLength :: LensLike' f (Axis b c n) (N (Axis b c n)) #

minorTicksStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

class (HasMinorTicks f a, HasMajorTicks f a) => HasTicks (f :: Type -> Type) a where #

Methods

bothTicks :: LensLike' f a (Ticks (V a) (N a)) #

Instances
Functor f => HasTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

bothTicks :: LensLike' f (Ticks v n) (Ticks (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasTicks f (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (SingleAxis b v n) (Ticks (V (SingleAxis b v n)) (N (SingleAxis b v n))) #

(Applicative f, Traversable c) => HasTicks f (Axis b c n) 
Instance details

Defined in Plots.Axis

Methods

bothTicks :: LensLike' f (Axis b c n) (Ticks (V (Axis b c n)) (N (Axis b c n))) #

data MajorTicks (v :: Type -> Type) n #

Instances
HasMajorTicks f (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (MajorTicks v n) (MajorTicks (V (MajorTicks v n)) (N (MajorTicks v n))) #

majorTicksFunction :: LensLike' f (MajorTicks v n) ((N (MajorTicks v n), N (MajorTicks v n)) -> [N (MajorTicks v n)]) #

majorTicksAlignment :: LensLike' f (MajorTicks v n) TicksAlignment #

majorTicksLength :: LensLike' f (MajorTicks v n) (N (MajorTicks v n)) #

majorTicksStyle :: LensLike' f (MajorTicks v n) (Style (V (MajorTicks v n)) (N (MajorTicks v n))) #

TypeableFloat n => Default (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MajorTicks v n #

HasVisibility (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MajorTicks v n) Bool #

hidden :: Lens' (MajorTicks v n) Bool #

type N (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (MajorTicks v n) = n
type V (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (MajorTicks v n) = v

data MinorTicks (v :: Type -> Type) n #

Instances
HasMinorTicks f (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (MinorTicks v n) (MinorTicks (V (MinorTicks v n)) (N (MinorTicks v n))) #

minorTicksFunction :: LensLike' f (MinorTicks v n) ([N (MinorTicks v n)] -> (N (MinorTicks v n), N (MinorTicks v n)) -> [N (MinorTicks v n)]) #

minorTicksAlignment :: LensLike' f (MinorTicks v n) TicksAlignment #

minorTicksLength :: LensLike' f (MinorTicks v n) (N (MinorTicks v n)) #

minorTicksStyle :: LensLike' f (MinorTicks v n) (Style (V (MinorTicks v n)) (N (MinorTicks v n))) #

TypeableFloat n => Default (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: MinorTicks v n #

HasVisibility (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MinorTicks v n) Bool #

hidden :: Lens' (MinorTicks v n) Bool #

type N (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (MinorTicks v n) = n
type V (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (MinorTicks v n) = v

data Ticks (v :: Type -> Type) n #

Instances
Functor f => HasMajorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

majorTicks :: LensLike' f (Ticks v n) (MajorTicks (V (Ticks v n)) (N (Ticks v n))) #

majorTicksFunction :: LensLike' f (Ticks v n) ((N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

majorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

majorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

majorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasMinorTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

minorTicks :: LensLike' f (Ticks v n) (MinorTicks (V (Ticks v n)) (N (Ticks v n))) #

minorTicksFunction :: LensLike' f (Ticks v n) ([N (Ticks v n)] -> (N (Ticks v n), N (Ticks v n)) -> [N (Ticks v n)]) #

minorTicksAlignment :: LensLike' f (Ticks v n) TicksAlignment #

minorTicksLength :: LensLike' f (Ticks v n) (N (Ticks v n)) #

minorTicksStyle :: LensLike' f (Ticks v n) (Style (V (Ticks v n)) (N (Ticks v n))) #

Functor f => HasTicks f (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

bothTicks :: LensLike' f (Ticks v n) (Ticks (V (Ticks v n)) (N (Ticks v n))) #

TypeableFloat n => Default (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

def :: Ticks v n #

Typeable n => HasStyle (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

applyStyle :: Style (V (Ticks v n)) (N (Ticks v n)) -> Ticks v n -> Ticks v n

type N (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

type N (Ticks v n) = n
type V (Ticks v n) 
Instance details

Defined in Plots.Axis.Ticks

type V (Ticks v n) = v

data TicksAlignment #

Constructors

TickSpec !Rational !Rational 
AutoTick 
Instances
Eq TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

(==) :: TicksAlignment -> TicksAlignment -> Bool #

(/=) :: TicksAlignment -> TicksAlignment -> Bool #

Show TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

showsPrec :: Int -> TicksAlignment -> ShowS #

show :: TicksAlignment -> String #

showList :: [TicksAlignment] -> ShowS #

class HasTitle a b | a -> b where #

Minimal complete definition

title

Methods

title :: Lens' a (Title b (V a) (N a)) #

titleText :: Lens' a String #

titleStyle :: Lens' a (Style (V a) (N a)) #

titlePlacement :: Lens' a Placement #

titleTextFunction :: Lens' a (TextAlignment (N a) -> String -> QDiagram b (V a) (N a) Any) #

titleAlignment :: Lens' a (TextAlignment (N a)) #

titleGap :: Lens' a (N a) #

Instances
HasTitle (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

title :: Lens' (Axis b c n) (Title b (V (Axis b c n)) (N (Axis b c n))) #

titleText :: Lens' (Axis b c n) String #

titleStyle :: Lens' (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

titlePlacement :: Lens' (Axis b c n) Placement #

titleTextFunction :: Lens' (Axis b c n) (TextAlignment (N (Axis b c n)) -> String -> QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

titleAlignment :: Lens' (Axis b c n) (TextAlignment (N (Axis b c n))) #

titleGap :: Lens' (Axis b c n) (N (Axis b c n)) #

HasTitle (Title b v n) b 
Instance details

Defined in Plots.Axis.Title

Methods

title :: Lens' (Title b v n) (Title b (V (Title b v n)) (N (Title b v n))) #

titleText :: Lens' (Title b v n) String #

titleStyle :: Lens' (Title b v n) (Style (V (Title b v n)) (N (Title b v n))) #

titlePlacement :: Lens' (Title b v n) Placement #

titleTextFunction :: Lens' (Title b v n) (TextAlignment (N (Title b v n)) -> String -> QDiagram b (V (Title b v n)) (N (Title b v n)) Any) #

titleAlignment :: Lens' (Title b v n) (TextAlignment (N (Title b v n))) #

titleGap :: Lens' (Title b v n) (N (Title b v n)) #

data Title b (v :: Type -> Type) n #

Instances
(Renderable (Text n) b, TypeableFloat n) => Default (Title b V2 n) 
Instance details

Defined in Plots.Axis.Title

Methods

def :: Title b V2 n #

HasGap (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

gap :: Lens' (Title b v n) (N (Title b v n)) #

HasPlacement (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

placement :: Lens' (Title b v n) Placement #

placementAt :: Lens' (Title b v n) (V2 Rational) #

placementAnchor :: Lens' (Title b v n) (V2 Rational) #

gapDirection :: Lens' (Title b v n) (Direction V2 Rational) #

HasVisibility (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

visible :: Lens' (Title b v n) Bool #

hidden :: Lens' (Title b v n) Bool #

HasTitle (Title b v n) b 
Instance details

Defined in Plots.Axis.Title

Methods

title :: Lens' (Title b v n) (Title b (V (Title b v n)) (N (Title b v n))) #

titleText :: Lens' (Title b v n) String #

titleStyle :: Lens' (Title b v n) (Style (V (Title b v n)) (N (Title b v n))) #

titlePlacement :: Lens' (Title b v n) Placement #

titleTextFunction :: Lens' (Title b v n) (TextAlignment (N (Title b v n)) -> String -> QDiagram b (V (Title b v n)) (N (Title b v n)) Any) #

titleAlignment :: Lens' (Title b v n) (TextAlignment (N (Title b v n))) #

titleGap :: Lens' (Title b v n) (N (Title b v n)) #

type N (Title b v n) 
Instance details

Defined in Plots.Axis.Title

type N (Title b v n) = n
type V (Title b v n) 
Instance details

Defined in Plots.Axis.Title

type V (Title b v n) = v

class HasLegend a b | a -> b where #

Minimal complete definition

legend

Methods

legend :: Lens' a (Legend b (N a)) #

legendPlacement :: Lens' a Placement #

legendGap :: Lens' a (N a) #

legendStyle :: Lens' a (Style V2 (N a)) #

legendSpacing :: Lens' a (N a) #

legendTextWidth :: Lens' a (N a) #

legendTextFunction :: Lens' a (String -> QDiagram b V2 (N a) Any) #

legendTextStyle :: Lens' a (Style V2 (N a)) #

legendOrientation :: Lens' a Orientation #

Instances
HasLegend (Legend b n) b 
Instance details

Defined in Plots.Legend

Methods

legend :: Lens' (Legend b n) (Legend b (N (Legend b n))) #

legendPlacement :: Lens' (Legend b n) Placement #

legendGap :: Lens' (Legend b n) (N (Legend b n)) #

legendStyle :: Lens' (Legend b n) (Style V2 (N (Legend b n))) #

legendSpacing :: Lens' (Legend b n) (N (Legend b n)) #

legendTextWidth :: Lens' (Legend b n) (N (Legend b n)) #

legendTextFunction :: Lens' (Legend b n) (String -> QDiagram b V2 (N (Legend b n)) Any) #

legendTextStyle :: Lens' (Legend b n) (Style V2 (N (Legend b n))) #

legendOrientation :: Lens' (Legend b n) Orientation #

HasLegend (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

legend :: Lens' (Axis b c n) (Legend b (N (Axis b c n))) #

legendPlacement :: Lens' (Axis b c n) Placement #

legendGap :: Lens' (Axis b c n) (N (Axis b c n)) #

legendStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendSpacing :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextWidth :: Lens' (Axis b c n) (N (Axis b c n)) #

legendTextFunction :: Lens' (Axis b c n) (String -> QDiagram b V2 (N (Axis b c n)) Any) #

legendTextStyle :: Lens' (Axis b c n) (Style V2 (N (Axis b c n))) #

legendOrientation :: Lens' (Axis b c n) Orientation #

data ColourMap #

Instances
Show ColourMap 
Instance details

Defined in Plots.Style

Methods

showsPrec :: Int -> ColourMap -> ShowS #

show :: ColourMap -> String #

showList :: [ColourMap] -> ShowS #

Transformable ColourMap 
Instance details

Defined in Plots.Style

Methods

transform :: Transformation (V ColourMap) (N ColourMap) -> ColourMap -> ColourMap

At ColourMap 
Instance details

Defined in Plots.Style

Methods

at :: Index ColourMap -> Lens' ColourMap (Maybe (IxValue ColourMap)) #

Ixed ColourMap 
Instance details

Defined in Plots.Style

Methods

ix :: Index ColourMap -> Traversal' ColourMap (IxValue ColourMap) #

HasNanColours ColourMap 
Instance details

Defined in Plots.Style

Methods

nanColours :: Lens' ColourMap NanColours #

nanColour :: Lens' ColourMap (Colour Double) #

infColour :: Lens' ColourMap (Colour Double) #

negInfColour :: Lens' ColourMap (Colour Double) #

Each ColourMap ColourMap (Colour Double) (Colour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (Colour Double) (Colour Double) #

type N ColourMap 
Instance details

Defined in Plots.Style

type N ColourMap = Rational
type V ColourMap 
Instance details

Defined in Plots.Style

type V ColourMap = V1
type Index ColourMap 
Instance details

Defined in Plots.Style

type Index ColourMap = Rational
type IxValue ColourMap 
Instance details

Defined in Plots.Style

type IxValue ColourMap = Colour Double

class HasAxisStyle a b | a -> b where #

Minimal complete definition

axisStyle

Methods

axisStyle :: Lens' a (AxisStyle b (V a) (N a)) #

axisColourMap :: Lens' a ColourMap #

axisStyles :: IndexedTraversal' Int a (PlotStyle b (V a) (N a)) #

Instances
HasAxisStyle (Axis b v n) b 
Instance details

Defined in Plots.Axis

Methods

axisStyle :: Lens' (Axis b v n) (AxisStyle b (V (Axis b v n)) (N (Axis b v n))) #

axisColourMap :: Lens' (Axis b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (Axis b v n) (PlotStyle b (V (Axis b v n)) (N (Axis b v n))) #

HasAxisStyle (AxisStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

axisStyle :: Lens' (AxisStyle b v n) (AxisStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

axisColourMap :: Lens' (AxisStyle b v n) ColourMap #

axisStyles :: IndexedTraversal' Int (AxisStyle b v n) (PlotStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

class HasNanColours a where #

Minimal complete definition

nanColours

Methods

nanColours :: Lens' a NanColours #

nanColour :: Lens' a (Colour Double) #

infColour :: Lens' a (Colour Double) #

negInfColour :: Lens' a (Colour Double) #

Instances
HasNanColours ColourMap 
Instance details

Defined in Plots.Style

Methods

nanColours :: Lens' ColourMap NanColours #

nanColour :: Lens' ColourMap (Colour Double) #

infColour :: Lens' ColourMap (Colour Double) #

negInfColour :: Lens' ColourMap (Colour Double) #

HasNanColours NanColours 
Instance details

Defined in Plots.Style

Methods

nanColours :: Lens' NanColours NanColours #

nanColour :: Lens' NanColours (Colour Double) #

infColour :: Lens' NanColours (Colour Double) #

negInfColour :: Lens' NanColours (Colour Double) #

class HasPlotStyle (f :: Type -> Type) a b | a -> b where #

Minimal complete definition

plotStyle

Methods

plotStyle :: LensLike' f a (PlotStyle b (V a) (N a)) #

plotColour :: LensLike' f a (Colour Double) #

plotColor :: LensLike' f a (Colour Double) #

lineStyle :: LensLike' f a (Style (V a) (N a)) #

lineStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

markerStyle :: LensLike' f a (Style (V a) (N a)) #

markerStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

areaStyle :: LensLike' f a (Style (V a) (N a)) #

areaStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

textStyle :: LensLike' f a (Style (V a) (N a)) #

textStyleFunction :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

plotMarker :: LensLike' f a (QDiagram b (V a) (N a) Any) #

plotStyles :: LensLike' f a (Style (V a) (N a)) #

plotStyleFunctions :: LensLike' f a (Colour Double -> Style (V a) (N a)) #

Instances
Settable f => HasPlotStyle f (Plot p b) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (Plot p b) (PlotStyle b (V (Plot p b)) (N (Plot p b))) #

plotColour :: LensLike' f (Plot p b) (Colour Double) #

plotColor :: LensLike' f (Plot p b) (Colour Double) #

lineStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

lineStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

markerStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

markerStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

areaStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

areaStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

textStyle :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

textStyleFunction :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

plotMarker :: LensLike' f (Plot p b) (QDiagram b (V (Plot p b)) (N (Plot p b)) Any) #

plotStyles :: LensLike' f (Plot p b) (Style (V (Plot p b)) (N (Plot p b))) #

plotStyleFunctions :: LensLike' f (Plot p b) (Colour Double -> Style (V (Plot p b)) (N (Plot p b))) #

Functor f => HasPlotStyle f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (StyledPlot b v n) (PlotStyle b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotColour :: LensLike' f (StyledPlot b v n) (Colour Double) #

plotColor :: LensLike' f (StyledPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

lineStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotMarker :: LensLike' f (StyledPlot b v n) (QDiagram b (V (StyledPlot b v n)) (N (StyledPlot b v n)) Any) #

plotStyles :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotStyleFunctions :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

Settable f => HasPlotStyle f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (PlotMods b v n) (PlotStyle b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotColour :: LensLike' f (PlotMods b v n) (Colour Double) #

plotColor :: LensLike' f (PlotMods b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

lineStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotMarker :: LensLike' f (PlotMods b v n) (QDiagram b (V (PlotMods b v n)) (N (PlotMods b v n)) Any) #

plotStyles :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotStyleFunctions :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

Settable f => HasPlotStyle f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (DynamicPlot b v n) (PlotStyle b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotColour :: LensLike' f (DynamicPlot b v n) (Colour Double) #

plotColor :: LensLike' f (DynamicPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

lineStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotMarker :: LensLike' f (DynamicPlot b v n) (QDiagram b (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) Any) #

plotStyles :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotStyleFunctions :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

HasPlotStyle f (PlotStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (PlotStyle b v n) (PlotStyle b (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotColour :: LensLike' f (PlotStyle b v n) (Colour Double) #

plotColor :: LensLike' f (PlotStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

lineStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotMarker :: LensLike' f (PlotStyle b v n) (QDiagram b (V (PlotStyle b v n)) (N (PlotStyle b v n)) Any) #

plotStyles :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotStyleFunctions :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

Applicative f => HasPlotStyle f (AxisStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (AxisStyle b v n) (PlotStyle b (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotColour :: LensLike' f (AxisStyle b v n) (Colour Double) #

plotColor :: LensLike' f (AxisStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

lineStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

markerStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

markerStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

areaStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

areaStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

textStyle :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

textStyleFunction :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotMarker :: LensLike' f (AxisStyle b v n) (QDiagram b (V (AxisStyle b v n)) (N (AxisStyle b v n)) Any) #

plotStyles :: LensLike' f (AxisStyle b v n) (Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

plotStyleFunctions :: LensLike' f (AxisStyle b v n) (Colour Double -> Style (V (AxisStyle b v n)) (N (AxisStyle b v n))) #

Settable f => HasPlotStyle f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotStyle :: LensLike' f (Axis b c n) (PlotStyle b (V (Axis b c n)) (N (Axis b c n))) #

plotColour :: LensLike' f (Axis b c n) (Colour Double) #

plotColor :: LensLike' f (Axis b c n) (Colour Double) #

lineStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

lineStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

markerStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

areaStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

textStyle :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

textStyleFunction :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

plotMarker :: LensLike' f (Axis b c n) (QDiagram b (V (Axis b c n)) (N (Axis b c n)) Any) #

plotStyles :: LensLike' f (Axis b c n) (Style (V (Axis b c n)) (N (Axis b c n))) #

plotStyleFunctions :: LensLike' f (Axis b c n) (Colour Double -> Style (V (Axis b c n)) (N (Axis b c n))) #

data NanColours #

Instances
Show NanColours 
Instance details

Defined in Plots.Style

Methods

showsPrec :: Int -> NanColours -> ShowS #

show :: NanColours -> String #

showList :: [NanColours] -> ShowS #

Default NanColours 
Instance details

Defined in Plots.Style

Methods

def :: NanColours #

HasNanColours NanColours 
Instance details

Defined in Plots.Style

Methods

nanColours :: Lens' NanColours NanColours #

nanColour :: Lens' NanColours (Colour Double) #

infColour :: Lens' NanColours (Colour Double) #

negInfColour :: Lens' NanColours (Colour Double) #

data PlotStyle b (v :: Type -> Type) n #

Instances
HasPlotStyle f (PlotStyle b v n) b 
Instance details

Defined in Plots.Style

Methods

plotStyle :: LensLike' f (PlotStyle b v n) (PlotStyle b (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotColour :: LensLike' f (PlotStyle b v n) (Colour Double) #

plotColor :: LensLike' f (PlotStyle b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

lineStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

markerStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

areaStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyle :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

textStyleFunction :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotMarker :: LensLike' f (PlotStyle b v n) (QDiagram b (V (PlotStyle b v n)) (N (PlotStyle b v n)) Any) #

plotStyles :: LensLike' f (PlotStyle b v n) (Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

plotStyleFunctions :: LensLike' f (PlotStyle b v n) (Colour Double -> Style (V (PlotStyle b v n)) (N (PlotStyle b v n))) #

(Metric v, Traversable v, OrderedField n) => Transformable (PlotStyle b v n) 
Instance details

Defined in Plots.Style

Methods

transform :: Transformation (V (PlotStyle b v n)) (N (PlotStyle b v n)) -> PlotStyle b v n -> PlotStyle b v n

type N (PlotStyle b v n) 
Instance details

Defined in Plots.Style

type N (PlotStyle b v n) = n
type V (PlotStyle b v n) 
Instance details

Defined in Plots.Style

type V (PlotStyle b v n) = v

data AxisSpec (v :: Type -> Type) n #

Constructors

AxisSpec 

Fields

Instances
type N (AxisSpec v n) 
Instance details

Defined in Plots.Types

type N (AxisSpec v n) = n
type V (AxisSpec v n) 
Instance details

Defined in Plots.Types

type V (AxisSpec v n) = v

data DynamicPlot b (v :: Type -> Type) n where #

Constructors

DynamicPlot :: forall b (v :: Type -> Type) n p. (InSpace v n p, Plotable p b) => Plot p b -> DynamicPlot b v n 
Instances
(Applicative f, Typeable b, v ~ V2, Typeable n) => HasWedge f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (DynamicPlot b v n) (Wedge (N (DynamicPlot b v n))) #

wedgeOuterRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeInnerRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeOffset :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeWidth :: LensLike' f (DynamicPlot b v n) (Angle (N (DynamicPlot b v n))) #

wedgeDirection :: LensLike' f (DynamicPlot b v n) (Direction V2 (N (DynamicPlot b v n))) #

(Applicative f, Typeable b, Typeable v, Typeable n) => HasConnectingLine f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (DynamicPlot b v n) Bool #

Settable f => HasPlotStyle f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (DynamicPlot b v n) (PlotStyle b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotColour :: LensLike' f (DynamicPlot b v n) (Colour Double) #

plotColor :: LensLike' f (DynamicPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

lineStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

markerStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

areaStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyle :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

textStyleFunction :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotMarker :: LensLike' f (DynamicPlot b v n) (QDiagram b (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) Any) #

plotStyles :: LensLike' f (DynamicPlot b v n) (Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotStyleFunctions :: LensLike' f (DynamicPlot b v n) (Colour Double -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

Functor f => HasPlotOptions f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (DynamicPlot b v n) (PlotOptions b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotName :: LensLike' f (DynamicPlot b v n) Name #

clipPlot :: LensLike' f (DynamicPlot b v n) Bool #

legendEntries :: LensLike' f (DynamicPlot b v n) [LegendEntry b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))] #

plotTransform :: LensLike' f (DynamicPlot b v n) (Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotVisible :: LensLike' f (DynamicPlot b v n) Bool #

(Applicative f, Typeable b, Typeable v, Typeable n, Typeable a) => HasScatterOptions f (DynamicPlot b v n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (DynamicPlot b v n) (ScatterOptions (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) a) #

scatterTransform :: LensLike' f (DynamicPlot b v n) (a -> Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterStyle :: LensLike' f (DynamicPlot b v n) (a -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterPosition :: LensLike' f (DynamicPlot b v n) (a -> Point (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

HasVisibility (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (DynamicPlot b v n) Bool #

hidden :: Lens' (DynamicPlot b v n) Bool #

type N (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

type N (DynamicPlot b v n) = n
type V (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

type V (DynamicPlot b v n) = v

class HasGap a where #

Methods

gap :: Lens' a (N a) #

Instances
HasGap (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

gap :: Lens' (ColourBar b n) (N (ColourBar b n)) #

HasGap (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

gap :: Lens' (Legend b n) (N (Legend b n)) #

HasGap (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (AxisLabel b v n) (N (AxisLabel b v n)) #

HasGap (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

gap :: Lens' (TickLabels b v n) (N (TickLabels b v n)) #

HasGap (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

gap :: Lens' (Title b v n) (N (Title b v n)) #

class HasOrientation a where #

Methods

orientation :: Lens' a Orientation #

Instances
HasOrientation Orientation 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' Orientation Orientation #

HasOrientation (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarLayout n) Orientation #

HasOrientation (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarPlot n) Orientation #

HasOrientation (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramOptions n) Orientation #

HasOrientation (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramPlot n) Orientation #

HasOrientation (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

orientation :: Lens' (ColourBar b n) Orientation #

HasOrientation (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

orientation :: Lens' (Legend b n) Orientation #

HasOrientation p => HasOrientation (Plot p b) 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' (Plot p b) Orientation #

HasOrientation (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (MultiBarState b n a) Orientation #

class HasPlacement a where #

Minimal complete definition

placement

Methods

placement :: Lens' a Placement #

placementAt :: Lens' a (V2 Rational) #

placementAnchor :: Lens' a (V2 Rational) #

gapDirection :: Lens' a (Direction V2 Rational) #

Instances
HasPlacement Placement 
Instance details

Defined in Plots.Types

Methods

placement :: Lens' Placement Placement #

placementAt :: Lens' Placement (V2 Rational) #

placementAnchor :: Lens' Placement (V2 Rational) #

gapDirection :: Lens' Placement (Direction V2 Rational) #

HasPlacement (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

placement :: Lens' (ColourBar b n) Placement #

placementAt :: Lens' (ColourBar b n) (V2 Rational) #

placementAnchor :: Lens' (ColourBar b n) (V2 Rational) #

gapDirection :: Lens' (ColourBar b n) (Direction V2 Rational) #

HasPlacement (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

placement :: Lens' (Legend b n) Placement #

placementAt :: Lens' (Legend b n) (V2 Rational) #

placementAnchor :: Lens' (Legend b n) (V2 Rational) #

gapDirection :: Lens' (Legend b n) (Direction V2 Rational) #

HasPlacement (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

placement :: Lens' (Title b v n) Placement #

placementAt :: Lens' (Title b v n) (V2 Rational) #

placementAnchor :: Lens' (Title b v n) (V2 Rational) #

gapDirection :: Lens' (Title b v n) (Direction V2 Rational) #

class HasPlotOptions (f :: Type -> Type) a b | a -> b where #

Minimal complete definition

plotOptions

Methods

plotOptions :: LensLike' f a (PlotOptions b (V a) (N a)) #

plotName :: LensLike' f a Name #

clipPlot :: LensLike' f a Bool #

legendEntries :: LensLike' f a [LegendEntry b (V a) (N a)] #

plotTransform :: LensLike' f a (Transformation (V a) (N a)) #

plotVisible :: LensLike' f a Bool #

Instances
Functor f => HasPlotOptions f (Plot p b) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (Plot p b) (PlotOptions b (V (Plot p b)) (N (Plot p b))) #

plotName :: LensLike' f (Plot p b) Name #

clipPlot :: LensLike' f (Plot p b) Bool #

legendEntries :: LensLike' f (Plot p b) [LegendEntry b (V (Plot p b)) (N (Plot p b))] #

plotTransform :: LensLike' f (Plot p b) (Transformation (V (Plot p b)) (N (Plot p b))) #

plotVisible :: LensLike' f (Plot p b) Bool #

Functor f => HasPlotOptions f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (StyledPlot b v n) (PlotOptions b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotName :: LensLike' f (StyledPlot b v n) Name #

clipPlot :: LensLike' f (StyledPlot b v n) Bool #

legendEntries :: LensLike' f (StyledPlot b v n) [LegendEntry b (V (StyledPlot b v n)) (N (StyledPlot b v n))] #

plotTransform :: LensLike' f (StyledPlot b v n) (Transformation (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotVisible :: LensLike' f (StyledPlot b v n) Bool #

HasPlotOptions f (PlotOptions b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotOptions b v n) (PlotOptions b (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotName :: LensLike' f (PlotOptions b v n) Name #

clipPlot :: LensLike' f (PlotOptions b v n) Bool #

legendEntries :: LensLike' f (PlotOptions b v n) [LegendEntry b (V (PlotOptions b v n)) (N (PlotOptions b v n))] #

plotTransform :: LensLike' f (PlotOptions b v n) (Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotVisible :: LensLike' f (PlotOptions b v n) Bool #

Functor f => HasPlotOptions f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotMods b v n) (PlotOptions b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotName :: LensLike' f (PlotMods b v n) Name #

clipPlot :: LensLike' f (PlotMods b v n) Bool #

legendEntries :: LensLike' f (PlotMods b v n) [LegendEntry b (V (PlotMods b v n)) (N (PlotMods b v n))] #

plotTransform :: LensLike' f (PlotMods b v n) (Transformation (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotVisible :: LensLike' f (PlotMods b v n) Bool #

Functor f => HasPlotOptions f (DynamicPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (DynamicPlot b v n) (PlotOptions b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotName :: LensLike' f (DynamicPlot b v n) Name #

clipPlot :: LensLike' f (DynamicPlot b v n) Bool #

legendEntries :: LensLike' f (DynamicPlot b v n) [LegendEntry b (V (DynamicPlot b v n)) (N (DynamicPlot b v n))] #

plotTransform :: LensLike' f (DynamicPlot b v n) (Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

plotVisible :: LensLike' f (DynamicPlot b v n) Bool #

Settable f => HasPlotOptions f (Axis b c n) b 
Instance details

Defined in Plots.Axis

Methods

plotOptions :: LensLike' f (Axis b c n) (PlotOptions b (V (Axis b c n)) (N (Axis b c n))) #

plotName :: LensLike' f (Axis b c n) Name #

clipPlot :: LensLike' f (Axis b c n) Bool #

legendEntries :: LensLike' f (Axis b c n) [LegendEntry b (V (Axis b c n)) (N (Axis b c n))] #

plotTransform :: LensLike' f (Axis b c n) (Transformation (V (Axis b c n)) (N (Axis b c n))) #

plotVisible :: LensLike' f (Axis b c n) Bool #

class HasVisibility a where #

Minimal complete definition

visible

Methods

visible :: Lens' a Bool #

hidden :: Lens' a Bool #

Instances
HasVisibility (ColourBar b n) 
Instance details

Defined in Plots.Axis.ColourBar

Methods

visible :: Lens' (ColourBar b n) Bool #

hidden :: Lens' (ColourBar b n) Bool #

HasVisibility (MajorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MajorGridLines v n) Bool #

hidden :: Lens' (MajorGridLines v n) Bool #

HasVisibility (MinorGridLines v n) 
Instance details

Defined in Plots.Axis.Grid

Methods

visible :: Lens' (MinorGridLines v n) Bool #

hidden :: Lens' (MinorGridLines v n) Bool #

HasVisibility (MajorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MajorTicks v n) Bool #

hidden :: Lens' (MajorTicks v n) Bool #

HasVisibility (MinorTicks v n) 
Instance details

Defined in Plots.Axis.Ticks

Methods

visible :: Lens' (MinorTicks v n) Bool #

hidden :: Lens' (MinorTicks v n) Bool #

HasVisibility (Legend b n) 
Instance details

Defined in Plots.Legend

Methods

visible :: Lens' (Legend b n) Bool #

hidden :: Lens' (Legend b n) Bool #

HasVisibility (Plot p b) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (Plot p b) Bool #

hidden :: Lens' (Plot p b) Bool #

HasVisibility (AxisLine v n) 
Instance details

Defined in Plots.Axis.Line

Methods

visible :: Lens' (AxisLine v n) Bool #

hidden :: Lens' (AxisLine v n) Bool #

HasVisibility (SingleAxis b v n) 
Instance details

Defined in Plots.Axis

Methods

visible :: Lens' (SingleAxis b v n) Bool #

hidden :: Lens' (SingleAxis b v n) Bool #

HasVisibility (AxisLabel b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (AxisLabel b v n) Bool #

hidden :: Lens' (AxisLabel b v n) Bool #

HasVisibility (TickLabels b v n) 
Instance details

Defined in Plots.Axis.Labels

Methods

visible :: Lens' (TickLabels b v n) Bool #

hidden :: Lens' (TickLabels b v n) Bool #

HasVisibility (Title b v n) 
Instance details

Defined in Plots.Axis.Title

Methods

visible :: Lens' (Title b v n) Bool #

hidden :: Lens' (Title b v n) Bool #

HasVisibility (DynamicPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (DynamicPlot b v n) Bool #

hidden :: Lens' (DynamicPlot b v n) Bool #

HasVisibility (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotMods b v n) Bool #

hidden :: Lens' (PlotMods b v n) Bool #

HasVisibility (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotOptions b v n) Bool #

hidden :: Lens' (PlotOptions b v n) Bool #

HasVisibility (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (StyledPlot b v n) Bool #

hidden :: Lens' (StyledPlot b v n) Bool #

data LegendEntry b (v :: Type -> Type) n #

Instances
type N (LegendEntry b v n) 
Instance details

Defined in Plots.Types

type N (LegendEntry b v n) = n
type V (LegendEntry b v n) 
Instance details

Defined in Plots.Types

type V (LegendEntry b v n) = v

data LegendPic b (v :: Type -> Type) n #

Constructors

DefaultLegendPic 
CustomLegendPic (PlotStyle b v n -> QDiagram b v n Any) 
Instances
Default (LegendPic b v n) 
Instance details

Defined in Plots.Types

Methods

def :: LegendPic b v n #

data Orientation #

Constructors

Horizontal 
Vertical 
Instances
Eq Orientation 
Instance details

Defined in Plots.Types

Methods

(==) :: Orientation -> Orientation -> Bool #

(/=) :: Orientation -> Orientation -> Bool #

Ord Orientation 
Instance details

Defined in Plots.Types

Methods

compare :: Orientation -> Orientation -> Ordering #

(<) :: Orientation -> Orientation -> Bool #

(<=) :: Orientation -> Orientation -> Bool #

(>) :: Orientation -> Orientation -> Bool #

(>=) :: Orientation -> Orientation -> Bool #

max :: Orientation -> Orientation -> Orientation #

min :: Orientation -> Orientation -> Orientation #

Show Orientation 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Orientation -> ShowS #

show :: Orientation -> String #

showList :: [Orientation] -> ShowS #

HasOrientation Orientation 
Instance details

Defined in Plots.Types

Methods

orientation :: Lens' Orientation Orientation #

data Placement #

Constructors

Placement 

Fields

Instances
Eq Placement 
Instance details

Defined in Plots.Types

Methods

(==) :: Placement -> Placement -> Bool #

(/=) :: Placement -> Placement -> Bool #

Ord Placement 
Instance details

Defined in Plots.Types

Methods

compare :: Placement -> Placement -> Ordering #

(<) :: Placement -> Placement -> Bool #

(<=) :: Placement -> Placement -> Bool #

(>) :: Placement -> Placement -> Bool #

(>=) :: Placement -> Placement -> Bool #

max :: Placement -> Placement -> Placement #

min :: Placement -> Placement -> Placement #

Read Placement 
Instance details

Defined in Plots.Types

Methods

readsPrec :: Int -> ReadS Placement #

readList :: ReadS [Placement] #

readPrec :: ReadPrec Placement #

readListPrec :: ReadPrec [Placement] #

Show Placement 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Placement -> ShowS #

show :: Placement -> String #

showList :: [Placement] -> ShowS #

HasPlacement Placement 
Instance details

Defined in Plots.Types

Methods

placement :: Lens' Placement Placement #

placementAt :: Lens' Placement (V2 Rational) #

placementAnchor :: Lens' Placement (V2 Rational) #

gapDirection :: Lens' Placement (Direction V2 Rational) #

data PlotMods b (v :: Type -> Type) n #

Instances
Settable f => HasPlotStyle f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (PlotMods b v n) (PlotStyle b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotColour :: LensLike' f (PlotMods b v n) (Colour Double) #

plotColor :: LensLike' f (PlotMods b v n) (Colour Double) #

lineStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

lineStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

markerStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

areaStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyle :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

textStyleFunction :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotMarker :: LensLike' f (PlotMods b v n) (QDiagram b (V (PlotMods b v n)) (N (PlotMods b v n)) Any) #

plotStyles :: LensLike' f (PlotMods b v n) (Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotStyleFunctions :: LensLike' f (PlotMods b v n) (Colour Double -> Style (V (PlotMods b v n)) (N (PlotMods b v n))) #

Functor f => HasPlotOptions f (PlotMods b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotMods b v n) (PlotOptions b (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotName :: LensLike' f (PlotMods b v n) Name #

clipPlot :: LensLike' f (PlotMods b v n) Bool #

legendEntries :: LensLike' f (PlotMods b v n) [LegendEntry b (V (PlotMods b v n)) (N (PlotMods b v n))] #

plotTransform :: LensLike' f (PlotMods b v n) (Transformation (V (PlotMods b v n)) (N (PlotMods b v n))) #

plotVisible :: LensLike' f (PlotMods b v n) Bool #

(Additive v, Num n) => Default (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotMods b v n #

HasVisibility (PlotMods b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotMods b v n) Bool #

hidden :: Lens' (PlotMods b v n) Bool #

type N (PlotMods b v n) 
Instance details

Defined in Plots.Types

type N (PlotMods b v n) = n
type V (PlotMods b v n) 
Instance details

Defined in Plots.Types

type V (PlotMods b v n) = v

data PlotOptions b (v :: Type -> Type) n #

Instances
HasPlotOptions f (PlotOptions b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (PlotOptions b v n) (PlotOptions b (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotName :: LensLike' f (PlotOptions b v n) Name #

clipPlot :: LensLike' f (PlotOptions b v n) Bool #

legendEntries :: LensLike' f (PlotOptions b v n) [LegendEntry b (V (PlotOptions b v n)) (N (PlotOptions b v n))] #

plotTransform :: LensLike' f (PlotOptions b v n) (Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n))) #

plotVisible :: LensLike' f (PlotOptions b v n) Bool #

(Additive v, Num n) => Default (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

def :: PlotOptions b v n #

(Additive v, Num n) => HasOrigin (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

moveOriginTo :: Point (V (PlotOptions b v n)) (N (PlotOptions b v n)) -> PlotOptions b v n -> PlotOptions b v n

Qualifiable (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

(.>>) :: IsName a => a -> PlotOptions b v n -> PlotOptions b v n

(HasLinearMap v, Num n) => Transformable (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

transform :: Transformation (V (PlotOptions b v n)) (N (PlotOptions b v n)) -> PlotOptions b v n -> PlotOptions b v n

HasVisibility (PlotOptions b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (PlotOptions b v n) Bool #

hidden :: Lens' (PlotOptions b v n) Bool #

type N (PlotOptions b v n) 
Instance details

Defined in Plots.Types

type N (PlotOptions b v n) = n
type V (PlotOptions b v n) 
Instance details

Defined in Plots.Types

type V (PlotOptions b v n) = v

class (Typeable p, Enveloped p) => Plotable p b where #

Minimal complete definition

renderPlotable

Methods

renderPlotable :: InSpace v n p => AxisSpec v n -> PlotStyle b v n -> p -> QDiagram b v n Any #

defLegendPic :: InSpace v n p => PlotStyle b v n -> p -> QDiagram b v n Any #

Instances
(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (BarPlot n) b 
Instance details

Defined in Plots.Types.Bar

Methods

renderPlotable :: InSpace v n0 (BarPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (BarPlot n) => PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HistogramPlot n) b 
Instance details

Defined in Plots.Types.Histogram

Methods

renderPlotable :: InSpace v n0 (HistogramPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HistogramPlot n) => PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Wedge n) b 
Instance details

Defined in Plots.Types.Pie

Methods

renderPlotable :: InSpace v n0 (Wedge n) => AxisSpec v n0 -> PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Wedge n) => PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Path V2 n) b 
Instance details

Defined in Plots.Types

Methods

renderPlotable :: InSpace v n0 (Path V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> Path V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Path V2 n) => PlotStyle b v n0 -> Path V2 n -> QDiagram b v n0 Any #

(Typeable b, TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

renderPlotable :: InSpace v n0 (HeatMap b n) => AxisSpec v n0 -> PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HeatMap b n) => PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (ScatterPlot V2 n) b 
Instance details

Defined in Plots.Types.Scatter

Methods

renderPlotable :: InSpace v n0 (ScatterPlot V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (ScatterPlot V2 n) => PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

(Typeable b, Typeable v, Metric v, Typeable n, OrderedField n) => Plotable (QDiagram b v n Any) b 
Instance details

Defined in Plots.Types

Methods

renderPlotable :: InSpace v0 n0 (QDiagram b v n Any) => AxisSpec v0 n0 -> PlotStyle b v0 n0 -> QDiagram b v n Any -> QDiagram b v0 n0 Any #

defLegendPic :: InSpace v0 n0 (QDiagram b v n Any) => PlotStyle b v0 n0 -> QDiagram b v n Any -> QDiagram b v0 n0 Any #

data StyledPlot b (v :: Type -> Type) n #

Instances
(v ~ V2, Applicative f, Typeable n) => HasWedge f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (StyledPlot b v n) (Wedge (N (StyledPlot b v n))) #

wedgeOuterRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeInnerRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeOffset :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeWidth :: LensLike' f (StyledPlot b v n) (Angle (N (StyledPlot b v n))) #

wedgeDirection :: LensLike' f (StyledPlot b v n) (Direction V2 (N (StyledPlot b v n))) #

(Applicative f, Typeable v, Typeable n) => HasConnectingLine f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (StyledPlot b v n) Bool #

Functor f => HasPlotStyle f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotStyle :: LensLike' f (StyledPlot b v n) (PlotStyle b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotColour :: LensLike' f (StyledPlot b v n) (Colour Double) #

plotColor :: LensLike' f (StyledPlot b v n) (Colour Double) #

lineStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

lineStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

markerStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

areaStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyle :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

textStyleFunction :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotMarker :: LensLike' f (StyledPlot b v n) (QDiagram b (V (StyledPlot b v n)) (N (StyledPlot b v n)) Any) #

plotStyles :: LensLike' f (StyledPlot b v n) (Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotStyleFunctions :: LensLike' f (StyledPlot b v n) (Colour Double -> Style (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

Functor f => HasPlotOptions f (StyledPlot b v n) b 
Instance details

Defined in Plots.Types

Methods

plotOptions :: LensLike' f (StyledPlot b v n) (PlotOptions b (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotName :: LensLike' f (StyledPlot b v n) Name #

clipPlot :: LensLike' f (StyledPlot b v n) Bool #

legendEntries :: LensLike' f (StyledPlot b v n) [LegendEntry b (V (StyledPlot b v n)) (N (StyledPlot b v n))] #

plotTransform :: LensLike' f (StyledPlot b v n) (Transformation (V (StyledPlot b v n)) (N (StyledPlot b v n))) #

plotVisible :: LensLike' f (StyledPlot b v n) Bool #

(Metric v, OrderedField n) => Enveloped (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

getEnvelope :: StyledPlot b v n -> Envelope (V (StyledPlot b v n)) (N (StyledPlot b v n))

HasVisibility (StyledPlot b v n) 
Instance details

Defined in Plots.Types

Methods

visible :: Lens' (StyledPlot b v n) Bool #

hidden :: Lens' (StyledPlot b v n) Bool #

type N (StyledPlot b v n) 
Instance details

Defined in Plots.Types

type N (StyledPlot b v n) = n
type V (StyledPlot b v n) 
Instance details

Defined in Plots.Types

type V (StyledPlot b v n) = v

data BarLayout n #

Instances
Fractional n => Default (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

def :: BarLayout n #

HasOrientation (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarLayout n) Orientation #

HasBarLayout (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarLayout n) (BarLayout (N (BarLayout n))) #

barWidth :: Lens' (BarLayout n) (N (BarLayout n)) #

barSpacing :: Lens' (BarLayout n) (N (BarLayout n)) #

barStart :: Lens' (BarLayout n) (N (BarLayout n)) #

type N (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

type N (BarLayout n) = n

data BarPlot n #

Instances
OrderedField n => Enveloped (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

getEnvelope :: BarPlot n -> Envelope (V (BarPlot n)) (N (BarPlot n))

HasOrientation (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (BarPlot n) Orientation #

HasBarLayout (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarPlot n) (BarLayout (N (BarPlot n))) #

barWidth :: Lens' (BarPlot n) (N (BarPlot n)) #

barSpacing :: Lens' (BarPlot n) (N (BarPlot n)) #

barStart :: Lens' (BarPlot n) (N (BarPlot n)) #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (BarPlot n) b 
Instance details

Defined in Plots.Types.Bar

Methods

renderPlotable :: InSpace v n0 (BarPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (BarPlot n) => PlotStyle b v n0 -> BarPlot n -> QDiagram b v n0 Any #

type N (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

type N (BarPlot n) = n
type V (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

type V (BarPlot n) = V2

class HasOrientation a => HasBarLayout a where #

Minimal complete definition

barLayout

Methods

barLayout :: Lens' a (BarLayout (N a)) #

barWidth :: Lens' a (N a) #

barSpacing :: Lens' a (N a) #

barStart :: Lens' a (N a) #

Instances
HasBarLayout (BarLayout n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarLayout n) (BarLayout (N (BarLayout n))) #

barWidth :: Lens' (BarLayout n) (N (BarLayout n)) #

barSpacing :: Lens' (BarLayout n) (N (BarLayout n)) #

barStart :: Lens' (BarLayout n) (N (BarLayout n)) #

HasBarLayout (BarPlot n) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (BarPlot n) (BarLayout (N (BarPlot n))) #

barWidth :: Lens' (BarPlot n) (N (BarPlot n)) #

barSpacing :: Lens' (BarPlot n) (N (BarPlot n)) #

barStart :: Lens' (BarPlot n) (N (BarPlot n)) #

HasBarLayout a => HasBarLayout (Plot a b) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (Plot a b) (BarLayout (N (Plot a b))) #

barWidth :: Lens' (Plot a b) (N (Plot a b)) #

barSpacing :: Lens' (Plot a b) (N (Plot a b)) #

barStart :: Lens' (Plot a b) (N (Plot a b)) #

HasBarLayout (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (MultiBarState b n a) (BarLayout (N (MultiBarState b n a))) #

barWidth :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barSpacing :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barStart :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

data MultiBarState b n a #

Instances
HasOrientation (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

orientation :: Lens' (MultiBarState b n a) Orientation #

HasBarLayout (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

barLayout :: Lens' (MultiBarState b n a) (BarLayout (N (MultiBarState b n a))) #

barWidth :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barSpacing :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

barStart :: Lens' (MultiBarState b n a) (N (MultiBarState b n a)) #

HasLabels (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

Methods

labels :: Lens' (MultiBarState b n a) [String]

type N (MultiBarState b n a) 
Instance details

Defined in Plots.Types.Bar

type N (MultiBarState b n a) = n

class HasHeatMap (f :: Type -> Type) a b | a -> b where #

Minimal complete definition

heatMapOptions

Methods

heatMapOptions :: LensLike' f a (HeatMap b (N a)) #

heatMapGridVisible :: LensLike' f a Bool #

heatMapGridStyle :: LensLike' f a (Style V2 (N a)) #

heatMapSize :: LensLike' f a (V2 (N a)) #

heatMapExtent :: LensLike' f a (V2 (N a)) #

heatMapStart :: LensLike' f a (P2 (N a)) #

heatMapCentre :: LensLike' f a (P2 (N a)) #

heatMapLimits :: LensLike' f a (Maybe (Double, Double)) #

heatMapRender :: LensLike' f a (HeatMatrix -> ColourMap -> QDiagram b V2 (N a) Any) #

Instances
(Functor f, HasHeatMap f a b) => HasHeatMap f (Plot a b) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (Plot a b) (HeatMap b (N (Plot a b))) #

heatMapGridVisible :: LensLike' f (Plot a b) Bool #

heatMapGridStyle :: LensLike' f (Plot a b) (Style V2 (N (Plot a b))) #

heatMapSize :: LensLike' f (Plot a b) (V2 (N (Plot a b))) #

heatMapExtent :: LensLike' f (Plot a b) (V2 (N (Plot a b))) #

heatMapStart :: LensLike' f (Plot a b) (P2 (N (Plot a b))) #

heatMapCentre :: LensLike' f (Plot a b) (P2 (N (Plot a b))) #

heatMapLimits :: LensLike' f (Plot a b) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (Plot a b) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (Plot a b)) Any) #

HasHeatMap f (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (HeatMap b n) (HeatMap b (N (HeatMap b n))) #

heatMapGridVisible :: LensLike' f (HeatMap b n) Bool #

heatMapGridStyle :: LensLike' f (HeatMap b n) (Style V2 (N (HeatMap b n))) #

heatMapSize :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapExtent :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapStart :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapCentre :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapLimits :: LensLike' f (HeatMap b n) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (HeatMap b n) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (HeatMap b n)) Any) #

data HeatMap b n #

Instances
HasHeatMap f (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

heatMapOptions :: LensLike' f (HeatMap b n) (HeatMap b (N (HeatMap b n))) #

heatMapGridVisible :: LensLike' f (HeatMap b n) Bool #

heatMapGridStyle :: LensLike' f (HeatMap b n) (Style V2 (N (HeatMap b n))) #

heatMapSize :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapExtent :: LensLike' f (HeatMap b n) (V2 (N (HeatMap b n))) #

heatMapStart :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapCentre :: LensLike' f (HeatMap b n) (P2 (N (HeatMap b n))) #

heatMapLimits :: LensLike' f (HeatMap b n) (Maybe (Double, Double)) #

heatMapRender :: LensLike' f (HeatMap b n) (HeatMatrix -> ColourMap -> QDiagram b V2 (N (HeatMap b n)) Any) #

OrderedField n => Enveloped (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

Methods

getEnvelope :: HeatMap b n -> Envelope (V (HeatMap b n)) (N (HeatMap b n))

(Typeable b, TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HeatMap b n) b 
Instance details

Defined in Plots.Types.HeatMap

Methods

renderPlotable :: InSpace v n0 (HeatMap b n) => AxisSpec v n0 -> PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HeatMap b n) => PlotStyle b v n0 -> HeatMap b n -> QDiagram b v n0 Any #

type N (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

type N (HeatMap b n) = n
type V (HeatMap b n) 
Instance details

Defined in Plots.Types.HeatMap

type V (HeatMap b n) = V2

data HeatMatrix #

class HasOrientation a => HasHistogramOptions a where #

Minimal complete definition

histogramOptions

Methods

histogramOptions :: Lens' a (HistogramOptions (N a)) #

numBins :: Lens' a Int #

binRange :: Lens' a (Maybe (N a, N a)) #

normaliseSample :: Lens' a NormalisationMethod #

Instances
HasHistogramOptions (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (HistogramOptions n) (HistogramOptions (N (HistogramOptions n))) #

numBins :: Lens' (HistogramOptions n) Int #

binRange :: Lens' (HistogramOptions n) (Maybe (N (HistogramOptions n), N (HistogramOptions n))) #

normaliseSample :: Lens' (HistogramOptions n) NormalisationMethod #

HasHistogramOptions a => HasHistogramOptions (Plot a b) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (Plot a b) (HistogramOptions (N (Plot a b))) #

numBins :: Lens' (Plot a b) Int #

binRange :: Lens' (Plot a b) (Maybe (N (Plot a b), N (Plot a b))) #

normaliseSample :: Lens' (Plot a b) NormalisationMethod #

data HistogramOptions n #

Instances
Default (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: HistogramOptions n #

HasOrientation (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramOptions n) Orientation #

HasHistogramOptions (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

Methods

histogramOptions :: Lens' (HistogramOptions n) (HistogramOptions (N (HistogramOptions n))) #

numBins :: Lens' (HistogramOptions n) Int #

binRange :: Lens' (HistogramOptions n) (Maybe (N (HistogramOptions n), N (HistogramOptions n))) #

normaliseSample :: Lens' (HistogramOptions n) NormalisationMethod #

type N (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

type N (HistogramOptions n) = n
type V (HistogramOptions n) 
Instance details

Defined in Plots.Types.Histogram

type V (HistogramOptions n) = V2

data HistogramPlot n #

Instances
OrderedField n => Enveloped (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

getEnvelope :: HistogramPlot n -> Envelope (V (HistogramPlot n)) (N (HistogramPlot n))

HasOrientation (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

Methods

orientation :: Lens' (HistogramPlot n) Orientation #

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (HistogramPlot n) b 
Instance details

Defined in Plots.Types.Histogram

Methods

renderPlotable :: InSpace v n0 (HistogramPlot n) => AxisSpec v n0 -> PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (HistogramPlot n) => PlotStyle b v n0 -> HistogramPlot n -> QDiagram b v n0 Any #

type N (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

type N (HistogramPlot n) = n
type V (HistogramPlot n) 
Instance details

Defined in Plots.Types.Histogram

type V (HistogramPlot n) = V2

data NormalisationMethod #

Instances
Default NormalisationMethod 
Instance details

Defined in Plots.Types.Histogram

Methods

def :: NormalisationMethod #

class HasWedge (f :: Type -> Type) a where #

Minimal complete definition

pieWedge

Methods

pieWedge :: LensLike' f a (Wedge (N a)) #

wedgeOuterRadius :: LensLike' f a (N a) #

wedgeInnerRadius :: LensLike' f a (N a) #

wedgeOffset :: LensLike' f a (N a) #

wedgeWidth :: LensLike' f a (Angle (N a)) #

wedgeDirection :: LensLike' f a (Direction V2 (N a)) #

Instances
HasWedge f (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Wedge n) (Wedge (N (Wedge n))) #

wedgeOuterRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeInnerRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeOffset :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeWidth :: LensLike' f (Wedge n) (Angle (N (Wedge n))) #

wedgeDirection :: LensLike' f (Wedge n) (Direction V2 (N (Wedge n))) #

(Functor f, HasWedge f a) => HasWedge f (Plot a b) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Plot a b) (Wedge (N (Plot a b))) #

wedgeOuterRadius :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeInnerRadius :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeOffset :: LensLike' f (Plot a b) (N (Plot a b)) #

wedgeWidth :: LensLike' f (Plot a b) (Angle (N (Plot a b))) #

wedgeDirection :: LensLike' f (Plot a b) (Direction V2 (N (Plot a b))) #

(v ~ V2, Applicative f, Typeable n) => HasWedge f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (StyledPlot b v n) (Wedge (N (StyledPlot b v n))) #

wedgeOuterRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeInnerRadius :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeOffset :: LensLike' f (StyledPlot b v n) (N (StyledPlot b v n)) #

wedgeWidth :: LensLike' f (StyledPlot b v n) (Angle (N (StyledPlot b v n))) #

wedgeDirection :: LensLike' f (StyledPlot b v n) (Direction V2 (N (StyledPlot b v n))) #

Applicative f => HasWedge f (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (PieState b n a) (Wedge (N (PieState b n a))) #

wedgeOuterRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeInnerRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeOffset :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeWidth :: LensLike' f (PieState b n a) (Angle (N (PieState b n a))) #

wedgeDirection :: LensLike' f (PieState b n a) (Direction V2 (N (PieState b n a))) #

(Applicative f, Typeable b, v ~ V2, Typeable n) => HasWedge f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (DynamicPlot b v n) (Wedge (N (DynamicPlot b v n))) #

wedgeOuterRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeInnerRadius :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeOffset :: LensLike' f (DynamicPlot b v n) (N (DynamicPlot b v n)) #

wedgeWidth :: LensLike' f (DynamicPlot b v n) (Angle (N (DynamicPlot b v n))) #

wedgeDirection :: LensLike' f (DynamicPlot b v n) (Direction V2 (N (DynamicPlot b v n))) #

(BaseSpace c ~ V2, Settable f, Typeable n) => HasWedge f (Axis b c n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Axis b c n) (Wedge (N (Axis b c n))) #

wedgeOuterRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeInnerRadius :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeOffset :: LensLike' f (Axis b c n) (N (Axis b c n)) #

wedgeWidth :: LensLike' f (Axis b c n) (Angle (N (Axis b c n))) #

wedgeDirection :: LensLike' f (Axis b c n) (Direction V2 (N (Axis b c n))) #

data PieState b n a #

Instances
Applicative f => HasWedge f (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (PieState b n a) (Wedge (N (PieState b n a))) #

wedgeOuterRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeInnerRadius :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeOffset :: LensLike' f (PieState b n a) (N (PieState b n a)) #

wedgeWidth :: LensLike' f (PieState b n a) (Angle (N (PieState b n a))) #

wedgeDirection :: LensLike' f (PieState b n a) (Direction V2 (N (PieState b n a))) #

type N (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

type N (PieState b n a) = n
type V (PieState b n a) 
Instance details

Defined in Plots.Types.Pie

type V (PieState b n a) = V2

data Wedge n #

Instances
HasWedge f (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

pieWedge :: LensLike' f (Wedge n) (Wedge (N (Wedge n))) #

wedgeOuterRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeInnerRadius :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeOffset :: LensLike' f (Wedge n) (N (Wedge n)) #

wedgeWidth :: LensLike' f (Wedge n) (Angle (N (Wedge n))) #

wedgeDirection :: LensLike' f (Wedge n) (Direction V2 (N (Wedge n))) #

RealFloat n => Enveloped (Wedge n) 
Instance details

Defined in Plots.Types.Pie

Methods

getEnvelope :: Wedge n -> Envelope (V (Wedge n)) (N (Wedge n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (Wedge n) b 
Instance details

Defined in Plots.Types.Pie

Methods

renderPlotable :: InSpace v n0 (Wedge n) => AxisSpec v n0 -> PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (Wedge n) => PlotStyle b v n0 -> Wedge n -> QDiagram b v n0 Any #

type N (Wedge n) 
Instance details

Defined in Plots.Types.Pie

type N (Wedge n) = n
type V (Wedge n) 
Instance details

Defined in Plots.Types.Pie

type V (Wedge n) = V2

type BubbleOptions (v :: Type -> Type) n = ScatterOptions v n (n, Point v n) #

class HasConnectingLine (f :: Type -> Type) a where #

Methods

connectingLine :: LensLike' f a Bool #

Instances
HasConnectingLine f (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterPlot v n) Bool #

HasConnectingLine f p => HasConnectingLine f (Plot p b) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Plot p b) Bool #

(Applicative f, Typeable v, Typeable n) => HasConnectingLine f (StyledPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (StyledPlot b v n) Bool #

HasConnectingLine f (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterOptions v n a) Bool #

(Applicative f, Typeable b, Typeable v, Typeable n) => HasConnectingLine f (DynamicPlot b v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (DynamicPlot b v n) Bool #

(Settable f, Typeable (BaseSpace c), Typeable n) => HasConnectingLine f (Axis b c n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (Axis b c n) Bool #

class HasScatterOptions (f :: Type -> Type) a d where #

Minimal complete definition

gscatterOptions

Methods

gscatterOptions :: LensLike' f a (ScatterOptions (V a) (N a) d) #

scatterTransform :: LensLike' f a (d -> Transformation (V a) (N a)) #

scatterStyle :: LensLike' f a (d -> Style (V a) (N a)) #

scatterPosition :: LensLike' f a (d -> Point (V a) (N a)) #

Instances
(Applicative f, Typeable v, Typeable n, Typeable d) => HasScatterOptions f (ScatterPlot v n) d 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterPlot v n) (ScatterOptions (V (ScatterPlot v n)) (N (ScatterPlot v n)) d) #

scatterTransform :: LensLike' f (ScatterPlot v n) (d -> Transformation (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterStyle :: LensLike' f (ScatterPlot v n) (d -> Style (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterPosition :: LensLike' f (ScatterPlot v n) (d -> Point (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

(Functor f, HasScatterOptions f p a) => HasScatterOptions f (Plot p b) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Plot p b) (ScatterOptions (V (Plot p b)) (N (Plot p b)) a) #

scatterTransform :: LensLike' f (Plot p b) (a -> Transformation (V (Plot p b)) (N (Plot p b))) #

scatterStyle :: LensLike' f (Plot p b) (a -> Style (V (Plot p b)) (N (Plot p b))) #

scatterPosition :: LensLike' f (Plot p b) (a -> Point (V (Plot p b)) (N (Plot p b))) #

d ~ d' => HasScatterOptions f (ScatterOptions v n d) d' 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterOptions v n d) (ScatterOptions (V (ScatterOptions v n d)) (N (ScatterOptions v n d)) d') #

scatterTransform :: LensLike' f (ScatterOptions v n d) (d' -> Transformation (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterStyle :: LensLike' f (ScatterOptions v n d) (d' -> Style (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterPosition :: LensLike' f (ScatterOptions v n d) (d' -> Point (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

(Applicative f, Typeable b, Typeable v, Typeable n, Typeable a) => HasScatterOptions f (DynamicPlot b v n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (DynamicPlot b v n) (ScatterOptions (V (DynamicPlot b v n)) (N (DynamicPlot b v n)) a) #

scatterTransform :: LensLike' f (DynamicPlot b v n) (a -> Transformation (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterStyle :: LensLike' f (DynamicPlot b v n) (a -> Style (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

scatterPosition :: LensLike' f (DynamicPlot b v n) (a -> Point (V (DynamicPlot b v n)) (N (DynamicPlot b v n))) #

(Applicative f, Typeable b, Typeable (BaseSpace c), Typeable n, Typeable a) => HasScatterOptions f (Axis b c n) a 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (Axis b c n) (ScatterOptions (V (Axis b c n)) (N (Axis b c n)) a) #

scatterTransform :: LensLike' f (Axis b c n) (a -> Transformation (V (Axis b c n)) (N (Axis b c n))) #

scatterStyle :: LensLike' f (Axis b c n) (a -> Style (V (Axis b c n)) (N (Axis b c n))) #

scatterPosition :: LensLike' f (Axis b c n) (a -> Point (V (Axis b c n)) (N (Axis b c n))) #

data ScatterOptions (v :: Type -> Type) n a #

Instances
HasConnectingLine f (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterOptions v n a) Bool #

d ~ d' => HasScatterOptions f (ScatterOptions v n d) d' 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterOptions v n d) (ScatterOptions (V (ScatterOptions v n d)) (N (ScatterOptions v n d)) d') #

scatterTransform :: LensLike' f (ScatterOptions v n d) (d' -> Transformation (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterStyle :: LensLike' f (ScatterOptions v n d) (d' -> Style (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

scatterPosition :: LensLike' f (ScatterOptions v n d) (d' -> Point (V (ScatterOptions v n d)) (N (ScatterOptions v n d))) #

type N (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

type N (ScatterOptions v n a) = n
type V (ScatterOptions v n a) 
Instance details

Defined in Plots.Types.Scatter

type V (ScatterOptions v n a) = v

data ScatterPlot (v :: Type -> Type) n #

Instances
HasConnectingLine f (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

connectingLine :: LensLike' f (ScatterPlot v n) Bool #

(Applicative f, Typeable v, Typeable n, Typeable d) => HasScatterOptions f (ScatterPlot v n) d 
Instance details

Defined in Plots.Types.Scatter

Methods

gscatterOptions :: LensLike' f (ScatterPlot v n) (ScatterOptions (V (ScatterPlot v n)) (N (ScatterPlot v n)) d) #

scatterTransform :: LensLike' f (ScatterPlot v n) (d -> Transformation (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterStyle :: LensLike' f (ScatterPlot v n) (d -> Style (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

scatterPosition :: LensLike' f (ScatterPlot v n) (d -> Point (V (ScatterPlot v n)) (N (ScatterPlot v n))) #

(Metric v, OrderedField n) => Enveloped (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

Methods

getEnvelope :: ScatterPlot v n -> Envelope (V (ScatterPlot v n)) (N (ScatterPlot v n))

(TypeableFloat n, Renderable (Path V2 n) b) => Plotable (ScatterPlot V2 n) b 
Instance details

Defined in Plots.Types.Scatter

Methods

renderPlotable :: InSpace v n0 (ScatterPlot V2 n) => AxisSpec v n0 -> PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

defLegendPic :: InSpace v n0 (ScatterPlot V2 n) => PlotStyle b v n0 -> ScatterPlot V2 n -> QDiagram b v n0 Any #

type N (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

type N (ScatterPlot v n) = n
type V (ScatterPlot v n) 
Instance details

Defined in Plots.Types.Scatter

type V (ScatterPlot v n) = v
\ No newline at end of file diff --git a/docs/doc/Language-Stochaskell-Prelude.html b/docs/doc/Language-Stochaskell-Prelude.html index 8f3c99e..a223189 100644 --- a/docs/doc/Language-Stochaskell-Prelude.html +++ b/docs/doc/Language-Stochaskell-Prelude.html @@ -1,4 +1,4 @@ -Language.Stochaskell.Prelude

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellSafe
LanguageHaskell2010

Language.Stochaskell.Prelude

Description

 
Synopsis

Documentation

(++) :: [a] -> [a] -> [a] infixr 5 #

Append two lists, i.e.,

[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
+Language.Stochaskell.Prelude
stochaskell-1.0.0: A probabilistic programming language
Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellSafe
LanguageHaskell2010
Language.Stochaskell.Prelude
Description
 
Synopsis
Documentation
(++) :: [a] -> [a] -> [a] infixr 5 #
Append two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
 [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
seq :: a -> b -> b #
The value of seq a b is bottom if a is bottom, and
       otherwise equal to b. In other words, it evaluates the first 
       argument a to weak head normal form (WHNF). seq is usually 
@@ -9,9 +9,10 @@
       In particular, this means that b may be evaluated before
       a. If you need to guarantee a specific order of evaluation,
       you must use the function pseq from the "parallel" package. 
filter :: (a -> Bool) -> [a] -> [a] #
filter, applied to a predicate and a list, returns the list of
- those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
zip :: [a] -> [b] -> [(a, b)] #
zip takes two lists and returns a list of corresponding pairs.
- If one input list is short, excess elements of the longer list are
- discarded.
zip is right-lazy:
zip [] _|_ = []
print :: Show a => a -> IO () #
The print function outputs a value of any printable type to the
+ those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
zip :: [a] -> [b] -> [(a, b)] #
zip takes two lists and returns a list of corresponding pairs.
zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]
If one input list is short, excess elements of the longer list are
+ discarded:
zip [1] ['a', 'b'] = [(1, 'a')]
+zip [1, 2] ['a'] = [(1, 'a')]
zip is right-lazy:
zip [] _|_ = []
+zip _|_ [] = _|_
print :: Show a => a -> IO () #
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
@@ -24,13 +25,15 @@
  application (f x) means the same as (f $ x). However, $ has
  low, right-associative binding precedence, so it sometimes allows
  parentheses to be omitted; for example:
f $ g $ h x  =  f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xs,
- or zipWith ($) fs xs.
fromIntegral :: (Integral a, Num b) => a -> b #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b #
general coercion to fractional types
class Bounded a where #
The Bounded class is used to name the upper and lower limits of a
+ or zipWith ($) fs xs.
Note that ($) is levity-polymorphic in its result type, so that
+     foo $ True    where  foo :: Bool -> Int#
+ is well-typed
fromIntegral :: (Integral a, Num b) => a -> b #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b #
general coercion to fractional types
class Bounded a where #
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.
Minimal complete definition
minBound, maxBound
Methods
minBound :: a #
maxBound :: a #
Instances
 Bounded Bool
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Bool #
maxBound :: Bool #
 Bounded Char
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Char #
maxBound :: Char #
 Bounded Int
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Int #
maxBound :: Int #
 Bounded Int8
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int8 #
maxBound :: Int8 #
 Bounded Int16
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int16 #
maxBound :: Int16 #
 Bounded Int32
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int32 #
maxBound :: Int32 #
 Bounded Int64
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int64 #
maxBound :: Int64 #
 Bounded Ordering
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Ordering #
maxBound :: Ordering #
 Bounded Word
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Word #
maxBound :: Word #
 Bounded Word8
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word8 #
maxBound :: Word8 #
 Bounded Word16
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word16 #
maxBound :: Word16 #
 Bounded Word32
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word32 #
maxBound :: Word32 #
 Bounded Word64
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word64 #
maxBound :: Word64 #
 Bounded VecCount
Since: base-4.10.0.0
Instance details
Defined in GHC.Enum
 
Methods
minBound :: VecCount #
maxBound :: VecCount #
 Bounded VecElem
Since: base-4.10.0.0
Instance details
Defined in GHC.Enum
 
Methods
minBound :: VecElem #
maxBound :: VecElem #
 Bounded ()
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: () #
maxBound :: () #
 Bounded All 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: All #
maxBound :: All #
 Bounded Any 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Any #
maxBound :: Any #
 Bounded Associativity 
Instance details
Defined in GHC.Generics
 
Methods
minBound :: Associativity #
maxBound :: Associativity #
 Bounded SourceUnpackedness 
Instance details
Defined in GHC.Generics
 
Methods
minBound :: SourceUnpackedness #
maxBound :: SourceUnpackedness #
 Bounded SourceStrictness 
Instance details
Defined in GHC.Generics
 
Methods
minBound :: SourceStrictness #
maxBound :: SourceStrictness #
 Bounded DecidedStrictness 
Instance details
Defined in GHC.Generics
 
Methods
minBound :: DecidedStrictness #
maxBound :: DecidedStrictness #
 Bounded CChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CChar #
maxBound :: CChar #
 Bounded CSChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSChar #
maxBound :: CSChar #
 Bounded CUChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUChar #
maxBound :: CUChar #
 Bounded CShort 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CShort #
maxBound :: CShort #
 Bounded CUShort 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUShort #
maxBound :: CUShort #
 Bounded CInt 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CInt #
maxBound :: CInt #
 Bounded CUInt 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUInt #
maxBound :: CUInt #
 Bounded CLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CLong #
maxBound :: CLong #
 Bounded CULong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CULong #
maxBound :: CULong #
 Bounded CLLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CLLong #
maxBound :: CLLong #
 Bounded CULLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CULLong #
maxBound :: CULLong #
 Bounded CBool 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CBool #
maxBound :: CBool #
 Bounded CPtrdiff 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CPtrdiff #
maxBound :: CPtrdiff #
 Bounded CSize 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSize #
maxBound :: CSize #
 Bounded CWchar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CWchar #
maxBound :: CWchar #
 Bounded CSigAtomic 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSigAtomic #
maxBound :: CSigAtomic #
 Bounded CIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CIntPtr #
maxBound :: CIntPtr #
 Bounded CUIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUIntPtr #
maxBound :: CUIntPtr #
 Bounded CIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CIntMax #
maxBound :: CIntMax #
 Bounded CUIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUIntMax #
maxBound :: CUIntMax #
 Bounded GeneralCategory 
Instance details
Defined in GHC.Unicode
 
Methods
minBound :: GeneralCategory #
maxBound :: GeneralCategory #
 Bounded UTF32_Invalid 
Instance details
Defined in Basement.String.Encoding.UTF32
 
Methods
minBound :: UTF32_Invalid #
maxBound :: UTF32_Invalid #
 Bounded Encoding 
Instance details
Defined in Basement.String
 
Methods
minBound :: Encoding #
maxBound :: Encoding #
 Bounded XdgDirectory 
Instance details
Defined in System.Directory
 
Methods
minBound :: XdgDirectory #
maxBound :: XdgDirectory #
 Bounded FileType 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
minBound :: FileType #
maxBound :: FileType #
 Bounded OutputType 
Instance details
Defined in Diagrams.Backend.Cairo.Internal
 
Methods
minBound :: OutputType #
maxBound :: OutputType #
 Bounded CompressionStrategy 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: CompressionStrategy #
maxBound :: CompressionStrategy #
 Bounded Format 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: Format #
maxBound :: Format #
 Bounded Method 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: Method #
maxBound :: Method #
 Bounded a => Bounded (Identity a) 
Instance details
Defined in Data.Functor.Identity
 
Methods
minBound :: Identity a #
maxBound :: Identity a #
 Bounded a => Bounded (Min a) 
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Min a #
maxBound :: Min a #
 Bounded a => Bounded (Max a) 
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Max a #
maxBound :: Max a #
 Bounded a => Bounded (First a) 
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: First a #
maxBound :: First a #
 Bounded a => Bounded (Last a) 
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Last a #
maxBound :: Last a #
 Bounded m => Bounded (WrappedMonoid m) 
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: WrappedMonoid m #
maxBound :: WrappedMonoid m #
 Bounded a => Bounded (Dual a) 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Dual a #
maxBound :: Dual a #
 Bounded a => Bounded (Sum a) 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Sum a #
maxBound :: Sum a #
 Bounded a => Bounded (Product a) 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Product a #
maxBound :: Product a #
 Bounded a => Bounded (V3 a) 
Instance details
Defined in Linear.V3
 
Methods
minBound :: V3 a #
maxBound :: V3 a #
 Bounded a => Bounded (V2 a) 
Instance details
Defined in Linear.V2
 
Methods
minBound :: V2 a #
maxBound :: V2 a #
 Bounded n => Bounded (VarInt n) 
Instance details
Defined in Data.Bytes.VarInt
 
Methods
minBound :: VarInt n #
maxBound :: VarInt n #
 Bounded a => Bounded (V1 a) 
Instance details
Defined in Linear.V1
 
Methods
minBound :: V1 a #
maxBound :: V1 a #
 Bounded a => Bounded (V4 a) 
Instance details
Defined in Linear.V4
 
Methods
minBound :: V4 a #
maxBound :: V4 a #
 Bounded (V0 a) 
Instance details
Defined in Linear.V0
 
Methods
minBound :: V0 a #
maxBound :: V0 a #
 (Bounded a, Bounded b) => Bounded (a, b)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b) #
maxBound :: (a, b) #
 Bounded (Proxy t) 
Instance details
Defined in Data.Proxy
 
Methods
minBound :: Proxy t #
maxBound :: Proxy t #
 (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c) #
maxBound :: (a, b, c) #
 Bounded a => Bounded (Const a b) 
Instance details
Defined in Data.Functor.Const
 
Methods
minBound :: Const a b #
maxBound :: Const a b #
 a ~ b => Bounded (a :~: b)
Since: base-4.7.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
minBound :: a :~: b #
maxBound :: a :~: b #
 Bounded b => Bounded (Tagged s b) 
Instance details
Defined in Data.Tagged
 
Methods
minBound :: Tagged s b #
maxBound :: Tagged s b #
 (Bounded a, Dim n) => Bounded (V n a) 
Instance details
Defined in Linear.V
 
Methods
minBound :: V n a #
maxBound :: V n a #
 (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d) #
maxBound :: (a, b, c, d) #
 a ~~ b => Bounded (a :~~: b)
Since: base-4.10.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
minBound :: a :~~: b #
maxBound :: a :~~: b #
 (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e) #
maxBound :: (a, b, c, d, e) #
 (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #
maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #
class Enum a where #
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
+ constituent types are in Bounded.
Methods
minBound :: a #
maxBound :: a #
Instances
 Bounded Bool
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Bool #
maxBound :: Bool #
 Bounded Char
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Char #
maxBound :: Char #
 Bounded Int
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Int #
maxBound :: Int #
 Bounded Int8
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int8 #
maxBound :: Int8 #
 Bounded Int16
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int16 #
maxBound :: Int16 #
 Bounded Int32
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int32 #
maxBound :: Int32 #
 Bounded Int64
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
minBound :: Int64 #
maxBound :: Int64 #
 Bounded Ordering
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Ordering #
maxBound :: Ordering #
 Bounded Word
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: Word #
maxBound :: Word #
 Bounded Word8
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word8 #
maxBound :: Word8 #
 Bounded Word16
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word16 #
maxBound :: Word16 #
 Bounded Word32
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word32 #
maxBound :: Word32 #
 Bounded Word64
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
minBound :: Word64 #
maxBound :: Word64 #
 Bounded VecCount
Since: base-4.10.0.0
Instance details
Defined in GHC.Enum
 
Methods
minBound :: VecCount #
maxBound :: VecCount #
 Bounded VecElem
Since: base-4.10.0.0
Instance details
Defined in GHC.Enum
 
Methods
minBound :: VecElem #
maxBound :: VecElem #
 Bounded ()
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: () #
maxBound :: () #
 Bounded Fd 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: Fd #
maxBound :: Fd #
 Bounded CKey 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CKey #
maxBound :: CKey #
 Bounded CId 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CId #
maxBound :: CId #
 Bounded CFsFilCnt 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CFsFilCnt #
maxBound :: CFsFilCnt #
 Bounded CFsBlkCnt 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CFsBlkCnt #
maxBound :: CFsBlkCnt #
 Bounded CClockId 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CClockId #
maxBound :: CClockId #
 Bounded CBlkCnt 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CBlkCnt #
maxBound :: CBlkCnt #
 Bounded CBlkSize 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CBlkSize #
maxBound :: CBlkSize #
 Bounded CRLim 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CRLim #
maxBound :: CRLim #
 Bounded CTcflag 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CTcflag #
maxBound :: CTcflag #
 Bounded CUid 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CUid #
maxBound :: CUid #
 Bounded CNlink 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CNlink #
maxBound :: CNlink #
 Bounded CGid 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CGid #
maxBound :: CGid #
 Bounded CSsize 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CSsize #
maxBound :: CSsize #
 Bounded CPid 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CPid #
maxBound :: CPid #
 Bounded COff 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: COff #
maxBound :: COff #
 Bounded CMode 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CMode #
maxBound :: CMode #
 Bounded CIno 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CIno #
maxBound :: CIno #
 Bounded CDev 
Instance details
Defined in System.Posix.Types
 
Methods
minBound :: CDev #
maxBound :: CDev #
 Bounded All
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: All #
maxBound :: All #
 Bounded Any
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Any #
maxBound :: Any #
 Bounded Associativity
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
minBound :: Associativity #
maxBound :: Associativity #
 Bounded SourceUnpackedness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
minBound :: SourceUnpackedness #
maxBound :: SourceUnpackedness #
 Bounded SourceStrictness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
minBound :: SourceStrictness #
maxBound :: SourceStrictness #
 Bounded DecidedStrictness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
minBound :: DecidedStrictness #
maxBound :: DecidedStrictness #
 Bounded CChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CChar #
maxBound :: CChar #
 Bounded CSChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSChar #
maxBound :: CSChar #
 Bounded CUChar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUChar #
maxBound :: CUChar #
 Bounded CShort 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CShort #
maxBound :: CShort #
 Bounded CUShort 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUShort #
maxBound :: CUShort #
 Bounded CInt 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CInt #
maxBound :: CInt #
 Bounded CUInt 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUInt #
maxBound :: CUInt #
 Bounded CLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CLong #
maxBound :: CLong #
 Bounded CULong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CULong #
maxBound :: CULong #
 Bounded CLLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CLLong #
maxBound :: CLLong #
 Bounded CULLong 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CULLong #
maxBound :: CULLong #
 Bounded CBool 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CBool #
maxBound :: CBool #
 Bounded CPtrdiff 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CPtrdiff #
maxBound :: CPtrdiff #
 Bounded CSize 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSize #
maxBound :: CSize #
 Bounded CWchar 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CWchar #
maxBound :: CWchar #
 Bounded CSigAtomic 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CSigAtomic #
maxBound :: CSigAtomic #
 Bounded CIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CIntPtr #
maxBound :: CIntPtr #
 Bounded CUIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUIntPtr #
maxBound :: CUIntPtr #
 Bounded CIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CIntMax #
maxBound :: CIntMax #
 Bounded CUIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
minBound :: CUIntMax #
maxBound :: CUIntMax #
 Bounded GeneralCategory
Since: base-2.1
Instance details
Defined in GHC.Unicode
 
Methods
minBound :: GeneralCategory #
maxBound :: GeneralCategory #
 Bounded UTF32_Invalid 
Instance details
Defined in Basement.String.Encoding.UTF32
 
Methods
minBound :: UTF32_Invalid #
maxBound :: UTF32_Invalid #
 Bounded Encoding 
Instance details
Defined in Basement.String
 
Methods
minBound :: Encoding #
maxBound :: Encoding #
 Bounded FileType 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
minBound :: FileType #
maxBound :: FileType #
 Bounded XdgDirectory 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
minBound :: XdgDirectory #
maxBound :: XdgDirectory #
 Bounded XdgDirectoryList 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
minBound :: XdgDirectoryList #
maxBound :: XdgDirectoryList #
 Bounded Format 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: Format #
maxBound :: Format #
 Bounded Method 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: Method #
maxBound :: Method #
 Bounded CompressionStrategy 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
minBound :: CompressionStrategy #
maxBound :: CompressionStrategy #
 Bounded OutputType 
Instance details
Defined in Diagrams.Backend.Cairo.Internal
 
Methods
minBound :: OutputType #
maxBound :: OutputType #
 Bounded a => Bounded (Min a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Min a #
maxBound :: Min a #
 Bounded a => Bounded (Max a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Max a #
maxBound :: Max a #
 Bounded a => Bounded (First a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: First a #
maxBound :: First a #
 Bounded a => Bounded (Last a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: Last a #
maxBound :: Last a #
 Bounded m => Bounded (WrappedMonoid m)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
minBound :: WrappedMonoid m #
maxBound :: WrappedMonoid m #
 Bounded a => Bounded (Identity a)
Since: base-4.9.0.0
Instance details
Defined in Data.Functor.Identity
 
Methods
minBound :: Identity a #
maxBound :: Identity a #
 Bounded a => Bounded (Dual a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Dual a #
maxBound :: Dual a #
 Bounded a => Bounded (Sum a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Sum a #
maxBound :: Sum a #
 Bounded a => Bounded (Product a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
minBound :: Product a #
maxBound :: Product a #
 Bounded n => Bounded (VarInt n) 
Instance details
Defined in Data.Bytes.VarInt
 
Methods
minBound :: VarInt n #
maxBound :: VarInt n #
 (Generic a, GBounded (Rep a)) => Bounded (Generically a) 
Instance details
Defined in Generic.Data.Internal.Generically
 
Methods
minBound :: Generically a #
maxBound :: Generically a #
 Bounded a => Bounded (V2 a) 
Instance details
Defined in Linear.V2
 
Methods
minBound :: V2 a #
maxBound :: V2 a #
 Bounded a => Bounded (V3 a) 
Instance details
Defined in Linear.V3
 
Methods
minBound :: V3 a #
maxBound :: V3 a #
 Bounded a => Bounded (V1 a) 
Instance details
Defined in Linear.V1
 
Methods
minBound :: V1 a #
maxBound :: V1 a #
 Bounded (V0 a) 
Instance details
Defined in Linear.V0
 
Methods
minBound :: V0 a #
maxBound :: V0 a #
 Bounded a => Bounded (V4 a) 
Instance details
Defined in Linear.V4
 
Methods
minBound :: V4 a #
maxBound :: V4 a #
 (Bounded a, Bounded b) => Bounded (a, b)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b) #
maxBound :: (a, b) #
 Bounded (Proxy t)
Since: base-4.7.0.0
Instance details
Defined in Data.Proxy
 
Methods
minBound :: Proxy t #
maxBound :: Proxy t #
 (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c) #
maxBound :: (a, b, c) #
 Bounded a => Bounded (Const a b)
Since: base-4.9.0.0
Instance details
Defined in Data.Functor.Const
 
Methods
minBound :: Const a b #
maxBound :: Const a b #
 (Applicative f, Bounded a) => Bounded (Ap f a)
Since: base-4.12.0.0
Instance details
Defined in Data.Monoid
 
Methods
minBound :: Ap f a #
maxBound :: Ap f a #
 a ~ b => Bounded (a :~: b)
Since: base-4.7.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
minBound :: a :~: b #
maxBound :: a :~: b #
 Bounded b => Bounded (Tagged s b) 
Instance details
Defined in Data.Tagged
 
Methods
minBound :: Tagged s b #
maxBound :: Tagged s b #
 (Bounded a, Dim n) => Bounded (V n a) 
Instance details
Defined in Linear.V
 
Methods
minBound :: V n a #
maxBound :: V n a #
 (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d) #
maxBound :: (a, b, c, d) #
 a ~~ b => Bounded (a :~~: b)
Since: base-4.10.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
minBound :: a :~~: b #
maxBound :: a :~~: b #
 (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e) #
maxBound :: (a, b, c, d, e) #
 (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #
maxBound :: (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)
Since: base-2.1
Instance details
Defined in GHC.Enum
 
Methods
minBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #
maxBound :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #
class Enum a where #
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.
@@ -45,43 +48,138 @@
        bound | fromEnum y >= fromEnum x = maxBound
              | otherwise                = minBound

Minimal complete definition

toEnum, fromEnum

Methods

succ :: a -> a #

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

pred :: a -> a #

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

toEnum :: Int -> a #

Convert from an Int.

fromEnum :: a -> Int #

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] #

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

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

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

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

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

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

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

Instances
Enum Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Bool -> Bool #

pred :: Bool -> Bool #

toEnum :: Int -> Bool #

fromEnum :: Bool -> Int #

enumFrom :: Bool -> [Bool] #

enumFromThen :: Bool -> Bool -> [Bool] #

enumFromTo :: Bool -> Bool -> [Bool] #

enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #

Enum Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Char -> Char #

pred :: Char -> Char #

toEnum :: Int -> Char #

fromEnum :: Char -> Int #

enumFrom :: Char -> [Char] #

enumFromThen :: Char -> Char -> [Char] #

enumFromTo :: Char -> Char -> [Char] #

enumFromThenTo :: Char -> Char -> Char -> [Char] #

Enum Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Int -> Int #

pred :: Int -> Int #

toEnum :: Int -> Int #

fromEnum :: Int -> Int #

enumFrom :: Int -> [Int] #

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

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

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

Enum Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int8 -> Int8 #

pred :: Int8 -> Int8 #

toEnum :: Int -> Int8 #

fromEnum :: Int8 -> Int #

enumFrom :: Int8 -> [Int8] #

enumFromThen :: Int8 -> Int8 -> [Int8] #

enumFromTo :: Int8 -> Int8 -> [Int8] #

enumFromThenTo :: Int8 -> Int8 -> Int8 -> [Int8] #

Enum Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int16 -> Int16 #

pred :: Int16 -> Int16 #

toEnum :: Int -> Int16 #

fromEnum :: Int16 -> Int #

enumFrom :: Int16 -> [Int16] #

enumFromThen :: Int16 -> Int16 -> [Int16] #

enumFromTo :: Int16 -> Int16 -> [Int16] #

enumFromThenTo :: Int16 -> Int16 -> Int16 -> [Int16] #

Enum Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int32 -> Int32 #

pred :: Int32 -> Int32 #

toEnum :: Int -> Int32 #

fromEnum :: Int32 -> Int #

enumFrom :: Int32 -> [Int32] #

enumFromThen :: Int32 -> Int32 -> [Int32] #

enumFromTo :: Int32 -> Int32 -> [Int32] #

enumFromThenTo :: Int32 -> Int32 -> Int32 -> [Int32] #

Enum Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int64 -> Int64 #

pred :: Int64 -> Int64 #

toEnum :: Int -> Int64 #

fromEnum :: Int64 -> Int #

enumFrom :: Int64 -> [Int64] #

enumFromThen :: Int64 -> Int64 -> [Int64] #

enumFromTo :: Int64 -> Int64 -> [Int64] #

enumFromThenTo :: Int64 -> Int64 -> Int64 -> [Int64] #

Enum Integer

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Integer -> Integer #

pred :: Integer -> Integer #

toEnum :: Int -> Integer #

fromEnum :: Integer -> Int #

enumFrom :: Integer -> [Integer] #

enumFromThen :: Integer -> Integer -> [Integer] #

enumFromTo :: Integer -> Integer -> [Integer] #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #

Enum Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Ordering -> Ordering #

pred :: Ordering -> Ordering #

toEnum :: Int -> Ordering #

fromEnum :: Ordering -> Int #

enumFrom :: Ordering -> [Ordering] #

enumFromThen :: Ordering -> Ordering -> [Ordering] #

enumFromTo :: Ordering -> Ordering -> [Ordering] #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #

Enum Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Word -> Word #

pred :: Word -> Word #

toEnum :: Int -> Word #

fromEnum :: Word -> Int #

enumFrom :: Word -> [Word] #

enumFromThen :: Word -> Word -> [Word] #

enumFromTo :: Word -> Word -> [Word] #

enumFromThenTo :: Word -> Word -> Word -> [Word] #

Enum Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word8 -> Word8 #

pred :: Word8 -> Word8 #

toEnum :: Int -> Word8 #

fromEnum :: Word8 -> Int #

enumFrom :: Word8 -> [Word8] #

enumFromThen :: Word8 -> Word8 -> [Word8] #

enumFromTo :: Word8 -> Word8 -> [Word8] #

enumFromThenTo :: Word8 -> Word8 -> Word8 -> [Word8] #

Enum Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word16 -> Word16 #

pred :: Word16 -> Word16 #

toEnum :: Int -> Word16 #

fromEnum :: Word16 -> Int #

enumFrom :: Word16 -> [Word16] #

enumFromThen :: Word16 -> Word16 -> [Word16] #

enumFromTo :: Word16 -> Word16 -> [Word16] #

enumFromThenTo :: Word16 -> Word16 -> Word16 -> [Word16] #

Enum Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word32 -> Word32 #

pred :: Word32 -> Word32 #

toEnum :: Int -> Word32 #

fromEnum :: Word32 -> Int #

enumFrom :: Word32 -> [Word32] #

enumFromThen :: Word32 -> Word32 -> [Word32] #

enumFromTo :: Word32 -> Word32 -> [Word32] #

enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] #

Enum Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word64 -> Word64 #

pred :: Word64 -> Word64 #

toEnum :: Int -> Word64 #

fromEnum :: Word64 -> Int #

enumFrom :: Word64 -> [Word64] #

enumFromThen :: Word64 -> Word64 -> [Word64] #

enumFromTo :: Word64 -> Word64 -> [Word64] #

enumFromThenTo :: Word64 -> Word64 -> Word64 -> [Word64] #

Enum VecCount

Since: base-4.10.0.0

Instance details

Defined in GHC.Enum

Methods

succ :: VecCount -> VecCount #

pred :: VecCount -> VecCount #

toEnum :: Int -> VecCount #

fromEnum :: VecCount -> Int #

enumFrom :: VecCount -> [VecCount] #

enumFromThen :: VecCount -> VecCount -> [VecCount] #

enumFromTo :: VecCount -> VecCount -> [VecCount] #

enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] #

Enum VecElem

Since: base-4.10.0.0

Instance details

Defined in GHC.Enum

Methods

succ :: VecElem -> VecElem #

pred :: VecElem -> VecElem #

toEnum :: Int -> VecElem #

fromEnum :: VecElem -> Int #

enumFrom :: VecElem -> [VecElem] #

enumFromThen :: VecElem -> VecElem -> [VecElem] #

enumFromTo :: VecElem -> VecElem -> [VecElem] #

enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] #

Enum ()

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: () -> () #

pred :: () -> () #

toEnum :: Int -> () #

fromEnum :: () -> Int #

enumFrom :: () -> [()] #

enumFromThen :: () -> () -> [()] #

enumFromTo :: () -> () -> [()] #

enumFromThenTo :: () -> () -> () -> [()] #

Enum PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

succ :: PlotIndex -> PlotIndex #

pred :: PlotIndex -> PlotIndex #

toEnum :: Int -> PlotIndex #

fromEnum :: PlotIndex -> Int #

enumFrom :: PlotIndex -> [PlotIndex] #

enumFromThen :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromTo :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromThenTo :: PlotIndex -> PlotIndex -> PlotIndex -> [PlotIndex] #

Enum IOMode 
Instance details

Defined in GHC.IO.IOMode

Methods

succ :: IOMode -> IOMode #

pred :: IOMode -> IOMode #

toEnum :: Int -> IOMode #

fromEnum :: IOMode -> Int #

enumFrom :: IOMode -> [IOMode] #

enumFromThen :: IOMode -> IOMode -> [IOMode] #

enumFromTo :: IOMode -> IOMode -> [IOMode] #

enumFromThenTo :: IOMode -> IOMode -> IOMode -> [IOMode] #

Enum SeekMode 
Instance details

Defined in GHC.IO.Device

Methods

succ :: SeekMode -> SeekMode #

pred :: SeekMode -> SeekMode #

toEnum :: Int -> SeekMode #

fromEnum :: SeekMode -> Int #

enumFrom :: SeekMode -> [SeekMode] #

enumFromThen :: SeekMode -> SeekMode -> [SeekMode] #

enumFromTo :: SeekMode -> SeekMode -> [SeekMode] #

enumFromThenTo :: SeekMode -> SeekMode -> SeekMode -> [SeekMode] #

Enum Associativity 
Instance details

Defined in GHC.Generics

Methods

succ :: Associativity -> Associativity #

pred :: Associativity -> Associativity #

toEnum :: Int -> Associativity #

fromEnum :: Associativity -> Int #

enumFrom :: Associativity -> [Associativity] #

enumFromThen :: Associativity -> Associativity -> [Associativity] #

enumFromTo :: Associativity -> Associativity -> [Associativity] #

enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] #

Enum SourceUnpackedness 
Instance details

Defined in GHC.Generics

Methods

succ :: SourceUnpackedness -> SourceUnpackedness #

pred :: SourceUnpackedness -> SourceUnpackedness #

toEnum :: Int -> SourceUnpackedness #

fromEnum :: SourceUnpackedness -> Int #

enumFrom :: SourceUnpackedness -> [SourceUnpackedness] #

enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

Enum SourceStrictness 
Instance details

Defined in GHC.Generics

Methods

succ :: SourceStrictness -> SourceStrictness #

pred :: SourceStrictness -> SourceStrictness #

toEnum :: Int -> SourceStrictness #

fromEnum :: SourceStrictness -> Int #

enumFrom :: SourceStrictness -> [SourceStrictness] #

enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] #

enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] #

enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] #

Enum DecidedStrictness 
Instance details

Defined in GHC.Generics

Methods

succ :: DecidedStrictness -> DecidedStrictness #

pred :: DecidedStrictness -> DecidedStrictness #

toEnum :: Int -> DecidedStrictness #

fromEnum :: DecidedStrictness -> Int #

enumFrom :: DecidedStrictness -> [DecidedStrictness] #

enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

Enum CChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CChar -> CChar #

pred :: CChar -> CChar #

toEnum :: Int -> CChar #

fromEnum :: CChar -> Int #

enumFrom :: CChar -> [CChar] #

enumFromThen :: CChar -> CChar -> [CChar] #

enumFromTo :: CChar -> CChar -> [CChar] #

enumFromThenTo :: CChar -> CChar -> CChar -> [CChar] #

Enum CSChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSChar -> CSChar #

pred :: CSChar -> CSChar #

toEnum :: Int -> CSChar #

fromEnum :: CSChar -> Int #

enumFrom :: CSChar -> [CSChar] #

enumFromThen :: CSChar -> CSChar -> [CSChar] #

enumFromTo :: CSChar -> CSChar -> [CSChar] #

enumFromThenTo :: CSChar -> CSChar -> CSChar -> [CSChar] #

Enum CUChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUChar -> CUChar #

pred :: CUChar -> CUChar #

toEnum :: Int -> CUChar #

fromEnum :: CUChar -> Int #

enumFrom :: CUChar -> [CUChar] #

enumFromThen :: CUChar -> CUChar -> [CUChar] #

enumFromTo :: CUChar -> CUChar -> [CUChar] #

enumFromThenTo :: CUChar -> CUChar -> CUChar -> [CUChar] #

Enum CShort 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CShort -> CShort #

pred :: CShort -> CShort #

toEnum :: Int -> CShort #

fromEnum :: CShort -> Int #

enumFrom :: CShort -> [CShort] #

enumFromThen :: CShort -> CShort -> [CShort] #

enumFromTo :: CShort -> CShort -> [CShort] #

enumFromThenTo :: CShort -> CShort -> CShort -> [CShort] #

Enum CUShort 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUShort -> CUShort #

pred :: CUShort -> CUShort #

toEnum :: Int -> CUShort #

fromEnum :: CUShort -> Int #

enumFrom :: CUShort -> [CUShort] #

enumFromThen :: CUShort -> CUShort -> [CUShort] #

enumFromTo :: CUShort -> CUShort -> [CUShort] #

enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] #

Enum CInt 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CInt -> CInt #

pred :: CInt -> CInt #

toEnum :: Int -> CInt #

fromEnum :: CInt -> Int #

enumFrom :: CInt -> [CInt] #

enumFromThen :: CInt -> CInt -> [CInt] #

enumFromTo :: CInt -> CInt -> [CInt] #

enumFromThenTo :: CInt -> CInt -> CInt -> [CInt] #

Enum CUInt 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUInt -> CUInt #

pred :: CUInt -> CUInt #

toEnum :: Int -> CUInt #

fromEnum :: CUInt -> Int #

enumFrom :: CUInt -> [CUInt] #

enumFromThen :: CUInt -> CUInt -> [CUInt] #

enumFromTo :: CUInt -> CUInt -> [CUInt] #

enumFromThenTo :: CUInt -> CUInt -> CUInt -> [CUInt] #

Enum CLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CLong -> CLong #

pred :: CLong -> CLong #

toEnum :: Int -> CLong #

fromEnum :: CLong -> Int #

enumFrom :: CLong -> [CLong] #

enumFromThen :: CLong -> CLong -> [CLong] #

enumFromTo :: CLong -> CLong -> [CLong] #

enumFromThenTo :: CLong -> CLong -> CLong -> [CLong] #

Enum CULong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CULong -> CULong #

pred :: CULong -> CULong #

toEnum :: Int -> CULong #

fromEnum :: CULong -> Int #

enumFrom :: CULong -> [CULong] #

enumFromThen :: CULong -> CULong -> [CULong] #

enumFromTo :: CULong -> CULong -> [CULong] #

enumFromThenTo :: CULong -> CULong -> CULong -> [CULong] #

Enum CLLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CLLong -> CLLong #

pred :: CLLong -> CLLong #

toEnum :: Int -> CLLong #

fromEnum :: CLLong -> Int #

enumFrom :: CLLong -> [CLLong] #

enumFromThen :: CLLong -> CLLong -> [CLLong] #

enumFromTo :: CLLong -> CLLong -> [CLLong] #

enumFromThenTo :: CLLong -> CLLong -> CLLong -> [CLLong] #

Enum CULLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CULLong -> CULLong #

pred :: CULLong -> CULLong #

toEnum :: Int -> CULLong #

fromEnum :: CULLong -> Int #

enumFrom :: CULLong -> [CULLong] #

enumFromThen :: CULLong -> CULLong -> [CULLong] #

enumFromTo :: CULLong -> CULLong -> [CULLong] #

enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] #

Enum CBool 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CBool -> CBool #

pred :: CBool -> CBool #

toEnum :: Int -> CBool #

fromEnum :: CBool -> Int #

enumFrom :: CBool -> [CBool] #

enumFromThen :: CBool -> CBool -> [CBool] #

enumFromTo :: CBool -> CBool -> [CBool] #

enumFromThenTo :: CBool -> CBool -> CBool -> [CBool] #

Enum CFloat 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CFloat -> CFloat #

pred :: CFloat -> CFloat #

toEnum :: Int -> CFloat #

fromEnum :: CFloat -> Int #

enumFrom :: CFloat -> [CFloat] #

enumFromThen :: CFloat -> CFloat -> [CFloat] #

enumFromTo :: CFloat -> CFloat -> [CFloat] #

enumFromThenTo :: CFloat -> CFloat -> CFloat -> [CFloat] #

Enum CDouble 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CDouble -> CDouble #

pred :: CDouble -> CDouble #

toEnum :: Int -> CDouble #

fromEnum :: CDouble -> Int #

enumFrom :: CDouble -> [CDouble] #

enumFromThen :: CDouble -> CDouble -> [CDouble] #

enumFromTo :: CDouble -> CDouble -> [CDouble] #

enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] #

Enum CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CPtrdiff -> CPtrdiff #

pred :: CPtrdiff -> CPtrdiff #

toEnum :: Int -> CPtrdiff #

fromEnum :: CPtrdiff -> Int #

enumFrom :: CPtrdiff -> [CPtrdiff] #

enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] #

enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] #

enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] #

Enum CSize 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSize -> CSize #

pred :: CSize -> CSize #

toEnum :: Int -> CSize #

fromEnum :: CSize -> Int #

enumFrom :: CSize -> [CSize] #

enumFromThen :: CSize -> CSize -> [CSize] #

enumFromTo :: CSize -> CSize -> [CSize] #

enumFromThenTo :: CSize -> CSize -> CSize -> [CSize] #

Enum CWchar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CWchar -> CWchar #

pred :: CWchar -> CWchar #

toEnum :: Int -> CWchar #

fromEnum :: CWchar -> Int #

enumFrom :: CWchar -> [CWchar] #

enumFromThen :: CWchar -> CWchar -> [CWchar] #

enumFromTo :: CWchar -> CWchar -> [CWchar] #

enumFromThenTo :: CWchar -> CWchar -> CWchar -> [CWchar] #

Enum CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSigAtomic -> CSigAtomic #

pred :: CSigAtomic -> CSigAtomic #

toEnum :: Int -> CSigAtomic #

fromEnum :: CSigAtomic -> Int #

enumFrom :: CSigAtomic -> [CSigAtomic] #

enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] #

enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] #

enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] #

Enum CClock 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CClock -> CClock #

pred :: CClock -> CClock #

toEnum :: Int -> CClock #

fromEnum :: CClock -> Int #

enumFrom :: CClock -> [CClock] #

enumFromThen :: CClock -> CClock -> [CClock] #

enumFromTo :: CClock -> CClock -> [CClock] #

enumFromThenTo :: CClock -> CClock -> CClock -> [CClock] #

Enum CTime 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CTime -> CTime #

pred :: CTime -> CTime #

toEnum :: Int -> CTime #

fromEnum :: CTime -> Int #

enumFrom :: CTime -> [CTime] #

enumFromThen :: CTime -> CTime -> [CTime] #

enumFromTo :: CTime -> CTime -> [CTime] #

enumFromThenTo :: CTime -> CTime -> CTime -> [CTime] #

Enum CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUSeconds -> CUSeconds #

pred :: CUSeconds -> CUSeconds #

toEnum :: Int -> CUSeconds #

fromEnum :: CUSeconds -> Int #

enumFrom :: CUSeconds -> [CUSeconds] #

enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] #

enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] #

enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] #

Enum CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSUSeconds -> CSUSeconds #

pred :: CSUSeconds -> CSUSeconds #

toEnum :: Int -> CSUSeconds #

fromEnum :: CSUSeconds -> Int #

enumFrom :: CSUSeconds -> [CSUSeconds] #

enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] #

enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] #

enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] #

Enum CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CIntPtr -> CIntPtr #

pred :: CIntPtr -> CIntPtr #

toEnum :: Int -> CIntPtr #

fromEnum :: CIntPtr -> Int #

enumFrom :: CIntPtr -> [CIntPtr] #

enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] #

enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] #

enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] #

Enum CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUIntPtr -> CUIntPtr #

pred :: CUIntPtr -> CUIntPtr #

toEnum :: Int -> CUIntPtr #

fromEnum :: CUIntPtr -> Int #

enumFrom :: CUIntPtr -> [CUIntPtr] #

enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] #

enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] #

enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] #

Enum CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CIntMax -> CIntMax #

pred :: CIntMax -> CIntMax #

toEnum :: Int -> CIntMax #

fromEnum :: CIntMax -> Int #

enumFrom :: CIntMax -> [CIntMax] #

enumFromThen :: CIntMax -> CIntMax -> [CIntMax] #

enumFromTo :: CIntMax -> CIntMax -> [CIntMax] #

enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] #

Enum CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUIntMax -> CUIntMax #

pred :: CUIntMax -> CUIntMax #

toEnum :: Int -> CUIntMax #

fromEnum :: CUIntMax -> Int #

enumFrom :: CUIntMax -> [CUIntMax] #

enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] #

enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] #

enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] #

Enum GeneralCategory 
Instance details

Defined in GHC.Unicode

Methods

succ :: GeneralCategory -> GeneralCategory #

pred :: GeneralCategory -> GeneralCategory #

toEnum :: Int -> GeneralCategory #

fromEnum :: GeneralCategory -> Int #

enumFrom :: GeneralCategory -> [GeneralCategory] #

enumFromThen :: GeneralCategory -> GeneralCategory -> [GeneralCategory] #

enumFromTo :: GeneralCategory -> GeneralCategory -> [GeneralCategory] #

enumFromThenTo :: GeneralCategory -> GeneralCategory -> GeneralCategory -> [GeneralCategory] #

Enum UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

succ :: UTF32_Invalid -> UTF32_Invalid #

pred :: UTF32_Invalid -> UTF32_Invalid #

toEnum :: Int -> UTF32_Invalid #

fromEnum :: UTF32_Invalid -> Int #

enumFrom :: UTF32_Invalid -> [UTF32_Invalid] #

enumFromThen :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

enumFromTo :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

enumFromThenTo :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

Enum Encoding 
Instance details

Defined in Basement.String

Methods

succ :: Encoding -> Encoding #

pred :: Encoding -> Encoding #

toEnum :: Int -> Encoding #

fromEnum :: Encoding -> Int #

enumFrom :: Encoding -> [Encoding] #

enumFromThen :: Encoding -> Encoding -> [Encoding] #

enumFromTo :: Encoding -> Encoding -> [Encoding] #

enumFromThenTo :: Encoding -> Encoding -> Encoding -> [Encoding] #

Enum XdgDirectory 
Instance details

Defined in System.Directory

Methods

succ :: XdgDirectory -> XdgDirectory #

pred :: XdgDirectory -> XdgDirectory #

toEnum :: Int -> XdgDirectory #

fromEnum :: XdgDirectory -> Int #

enumFrom :: XdgDirectory -> [XdgDirectory] #

enumFromThen :: XdgDirectory -> XdgDirectory -> [XdgDirectory] #

enumFromTo :: XdgDirectory -> XdgDirectory -> [XdgDirectory] #

enumFromThenTo :: XdgDirectory -> XdgDirectory -> XdgDirectory -> [XdgDirectory] #

Enum FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

succ :: FileType -> FileType #

pred :: FileType -> FileType #

toEnum :: Int -> FileType #

fromEnum :: FileType -> Int #

enumFrom :: FileType -> [FileType] #

enumFromThen :: FileType -> FileType -> [FileType] #

enumFromTo :: FileType -> FileType -> [FileType] #

enumFromThenTo :: FileType -> FileType -> FileType -> [FileType] #

Enum Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Methods

succ :: Extension -> Extension #

pred :: Extension -> Extension #

toEnum :: Int -> Extension #

fromEnum :: Extension -> Int #

enumFrom :: Extension -> [Extension] #

enumFromThen :: Extension -> Extension -> [Extension] #

enumFromTo :: Extension -> Extension -> [Extension] #

enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #

Enum NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

succ :: NominalDiffTime -> NominalDiffTime #

pred :: NominalDiffTime -> NominalDiffTime #

toEnum :: Int -> NominalDiffTime #

fromEnum :: NominalDiffTime -> Int #

enumFrom :: NominalDiffTime -> [NominalDiffTime] #

enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

Enum DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

succ :: DiffTime -> DiffTime #

pred :: DiffTime -> DiffTime #

toEnum :: Int -> DiffTime #

fromEnum :: DiffTime -> Int #

enumFrom :: DiffTime -> [DiffTime] #

enumFromThen :: DiffTime -> DiffTime -> [DiffTime] #

enumFromTo :: DiffTime -> DiffTime -> [DiffTime] #

enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] #

Enum Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

succ :: Day -> Day #

pred :: Day -> Day #

toEnum :: Int -> Day #

fromEnum :: Day -> Int #

enumFrom :: Day -> [Day] #

enumFromThen :: Day -> Day -> [Day] #

enumFromTo :: Day -> Day -> [Day] #

enumFromThenTo :: Day -> Day -> Day -> [Day] #

Enum OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

succ :: OutputType -> OutputType #

pred :: OutputType -> OutputType #

toEnum :: Int -> OutputType #

fromEnum :: OutputType -> Int #

enumFrom :: OutputType -> [OutputType] #

enumFromThen :: OutputType -> OutputType -> [OutputType] #

enumFromTo :: OutputType -> OutputType -> [OutputType] #

enumFromThenTo :: OutputType -> OutputType -> OutputType -> [OutputType] #

Enum Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

succ :: Crossings -> Crossings #

pred :: Crossings -> Crossings #

toEnum :: Int -> Crossings #

fromEnum :: Crossings -> Int #

enumFrom :: Crossings -> [Crossings] #

enumFromThen :: Crossings -> Crossings -> [Crossings] #

enumFromTo :: Crossings -> Crossings -> [Crossings] #

enumFromThenTo :: Crossings -> Crossings -> Crossings -> [Crossings] #

Enum CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: CompressionStrategy -> CompressionStrategy #

pred :: CompressionStrategy -> CompressionStrategy #

toEnum :: Int -> CompressionStrategy #

fromEnum :: CompressionStrategy -> Int #

enumFrom :: CompressionStrategy -> [CompressionStrategy] #

enumFromThen :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

enumFromTo :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

enumFromThenTo :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

Enum Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Format -> Format #

pred :: Format -> Format #

toEnum :: Int -> Format #

fromEnum :: Format -> Int #

enumFrom :: Format -> [Format] #

enumFromThen :: Format -> Format -> [Format] #

enumFromTo :: Format -> Format -> [Format] #

enumFromThenTo :: Format -> Format -> Format -> [Format] #

Enum Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Method -> Method #

pred :: Method -> Method #

toEnum :: Int -> Method #

fromEnum :: Method -> Int #

enumFrom :: Method -> [Method] #

enumFromThen :: Method -> Method -> [Method] #

enumFromTo :: Method -> Method -> [Method] #

enumFromThenTo :: Method -> Method -> Method -> [Method] #

Enum ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

succ :: ConstVal -> ConstVal #

pred :: ConstVal -> ConstVal #

toEnum :: Int -> ConstVal #

fromEnum :: ConstVal -> Int #

enumFrom :: ConstVal -> [ConstVal] #

enumFromThen :: ConstVal -> ConstVal -> [ConstVal] #

enumFromTo :: ConstVal -> ConstVal -> [ConstVal] #

enumFromThenTo :: ConstVal -> ConstVal -> ConstVal -> [ConstVal] #

Integral a => Enum (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

succ :: Ratio a -> Ratio a #

pred :: Ratio a -> Ratio a #

toEnum :: Int -> Ratio a #

fromEnum :: Ratio a -> Int #

enumFrom :: Ratio a -> [Ratio a] #

enumFromThen :: Ratio a -> Ratio a -> [Ratio a] #

enumFromTo :: Ratio a -> Ratio a -> [Ratio a] #

enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] #

Enum a => Enum (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

succ :: Identity a -> Identity a #

pred :: Identity a -> Identity a #

toEnum :: Int -> Identity a #

fromEnum :: Identity a -> Int #

enumFrom :: Identity a -> [Identity a] #

enumFromThen :: Identity a -> Identity a -> [Identity a] #

enumFromTo :: Identity a -> Identity a -> [Identity a] #

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] #

Enum a => Enum (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Min a -> Min a #

pred :: Min a -> Min a #

toEnum :: Int -> Min a #

fromEnum :: Min a -> Int #

enumFrom :: Min a -> [Min a] #

enumFromThen :: Min a -> Min a -> [Min a] #

enumFromTo :: Min a -> Min a -> [Min a] #

enumFromThenTo :: Min a -> Min a -> Min a -> [Min a] #

Enum a => Enum (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Max a -> Max a #

pred :: Max a -> Max a #

toEnum :: Int -> Max a #

fromEnum :: Max a -> Int #

enumFrom :: Max a -> [Max a] #

enumFromThen :: Max a -> Max a -> [Max a] #

enumFromTo :: Max a -> Max a -> [Max a] #

enumFromThenTo :: Max a -> Max a -> Max a -> [Max a] #

Enum a => Enum (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: First a -> First a #

pred :: First a -> First a #

toEnum :: Int -> First a #

fromEnum :: First a -> Int #

enumFrom :: First a -> [First a] #

enumFromThen :: First a -> First a -> [First a] #

enumFromTo :: First a -> First a -> [First a] #

enumFromThenTo :: First a -> First a -> First a -> [First a] #

Enum a => Enum (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Last a -> Last a #

pred :: Last a -> Last a #

toEnum :: Int -> Last a #

fromEnum :: Last a -> Int #

enumFrom :: Last a -> [Last a] #

enumFromThen :: Last a -> Last a -> [Last a] #

enumFromTo :: Last a -> Last a -> [Last a] #

enumFromThenTo :: Last a -> Last a -> Last a -> [Last a] #

Enum a => Enum (WrappedMonoid a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: WrappedMonoid a -> WrappedMonoid a #

pred :: WrappedMonoid a -> WrappedMonoid a #

toEnum :: Int -> WrappedMonoid a #

fromEnum :: WrappedMonoid a -> Int #

enumFrom :: WrappedMonoid a -> [WrappedMonoid a] #

enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

Enum (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

succ :: Offset ty -> Offset ty #

pred :: Offset ty -> Offset ty #

toEnum :: Int -> Offset ty #

fromEnum :: Offset ty -> Int #

enumFrom :: Offset ty -> [Offset ty] #

enumFromThen :: Offset ty -> Offset ty -> [Offset ty] #

enumFromTo :: Offset ty -> Offset ty -> [Offset ty] #

enumFromThenTo :: Offset ty -> Offset ty -> Offset ty -> [Offset ty] #

Enum (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

succ :: CountOf ty -> CountOf ty #

pred :: CountOf ty -> CountOf ty #

toEnum :: Int -> CountOf ty #

fromEnum :: CountOf ty -> Int #

enumFrom :: CountOf ty -> [CountOf ty] #

enumFromThen :: CountOf ty -> CountOf ty -> [CountOf ty] #

enumFromTo :: CountOf ty -> CountOf ty -> [CountOf ty] #

enumFromThenTo :: CountOf ty -> CountOf ty -> CountOf ty -> [CountOf ty] #

Enum n => Enum (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

succ :: Angle n -> Angle n #

pred :: Angle n -> Angle n #

toEnum :: Int -> Angle n #

fromEnum :: Angle n -> Int #

enumFrom :: Angle n -> [Angle n] #

enumFromThen :: Angle n -> Angle n -> [Angle n] #

enumFromTo :: Angle n -> Angle n -> [Angle n] #

enumFromThenTo :: Angle n -> Angle n -> Angle n -> [Angle n] #

Enum n => Enum (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

succ :: VarInt n -> VarInt n #

pred :: VarInt n -> VarInt n #

toEnum :: Int -> VarInt n #

fromEnum :: VarInt n -> Int #

enumFrom :: VarInt n -> [VarInt n] #

enumFromThen :: VarInt n -> VarInt n -> [VarInt n] #

enumFromTo :: VarInt n -> VarInt n -> [VarInt n] #

enumFromThenTo :: VarInt n -> VarInt n -> VarInt n -> [VarInt n] #

(RealFloat a, Precise a, Enum a) => Enum (Log a) 
Instance details

Defined in Numeric.Log

Methods

succ :: Log a -> Log a #

pred :: Log a -> Log a #

toEnum :: Int -> Log a #

fromEnum :: Log a -> Int #

enumFrom :: Log a -> [Log a] #

enumFromThen :: Log a -> Log a -> [Log a] #

enumFromTo :: Log a -> Log a -> [Log a] #

enumFromThenTo :: Log a -> Log a -> Log a -> [Log a] #

Enum n => Enum (Time n) 
Instance details

Defined in Data.Active

Methods

succ :: Time n -> Time n #

pred :: Time n -> Time n #

toEnum :: Int -> Time n #

fromEnum :: Time n -> Int #

enumFrom :: Time n -> [Time n] #

enumFromThen :: Time n -> Time n -> [Time n] #

enumFromTo :: Time n -> Time n -> [Time n] #

enumFromThenTo :: Time n -> Time n -> Time n -> [Time n] #

Enum n => Enum (Duration n) 
Instance details

Defined in Data.Active

Methods

succ :: Duration n -> Duration n #

pred :: Duration n -> Duration n #

toEnum :: Int -> Duration n #

fromEnum :: Duration n -> Int #

enumFrom :: Duration n -> [Duration n] #

enumFromThen :: Duration n -> Duration n -> [Duration n] #

enumFromTo :: Duration n -> Duration n -> [Duration n] #

enumFromThenTo :: Duration n -> Duration n -> Duration n -> [Duration n] #

Enum (V0 a) 
Instance details

Defined in Linear.V0

Methods

succ :: V0 a -> V0 a #

pred :: V0 a -> V0 a #

toEnum :: Int -> V0 a #

fromEnum :: V0 a -> Int #

enumFrom :: V0 a -> [V0 a] #

enumFromThen :: V0 a -> V0 a -> [V0 a] #

enumFromTo :: V0 a -> V0 a -> [V0 a] #

enumFromThenTo :: V0 a -> V0 a -> V0 a -> [V0 a] #

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Enum (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

succ :: Proxy s -> Proxy s #

pred :: Proxy s -> Proxy s #

toEnum :: Int -> Proxy s #

fromEnum :: Proxy s -> Int #

enumFrom :: Proxy s -> [Proxy s] #

enumFromThen :: Proxy s -> Proxy s -> [Proxy s] #

enumFromTo :: Proxy s -> Proxy s -> [Proxy s] #

enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #

(Integral t, Enum t, KnownNat m) => Enum (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

succ :: Mod m t -> Mod m t #

pred :: Mod m t -> Mod m t #

toEnum :: Int -> Mod m t #

fromEnum :: Mod m t -> Int #

enumFrom :: Mod m t -> [Mod m t] #

enumFromThen :: Mod m t -> Mod m t -> [Mod m t] #

enumFromTo :: Mod m t -> Mod m t -> [Mod m t] #

enumFromThenTo :: Mod m t -> Mod m t -> Mod m t -> [Mod m t] #

Enum a => Enum (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

toEnum :: Int -> Const a b #

fromEnum :: Const a b -> Int #

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

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

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

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

Enum (f a) => Enum (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

succ :: Alt f a -> Alt f a #

pred :: Alt f a -> Alt f a #

toEnum :: Int -> Alt f a #

fromEnum :: Alt f a -> Int #

enumFrom :: Alt f a -> [Alt f a] #

enumFromThen :: Alt f a -> Alt f a -> [Alt f a] #

enumFromTo :: Alt f a -> Alt f a -> [Alt f a] #

enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] #

a ~ b => Enum (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

succ :: (a :~: b) -> a :~: b #

pred :: (a :~: b) -> a :~: b #

toEnum :: Int -> a :~: b #

fromEnum :: (a :~: b) -> Int #

enumFrom :: (a :~: b) -> [a :~: b] #

enumFromThen :: (a :~: b) -> (a :~: b) -> [a :~: b] #

enumFromTo :: (a :~: b) -> (a :~: b) -> [a :~: b] #

enumFromThenTo :: (a :~: b) -> (a :~: b) -> (a :~: b) -> [a :~: b] #

Enum a => Enum (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

succ :: Tagged s a -> Tagged s a #

pred :: Tagged s a -> Tagged s a #

toEnum :: Int -> Tagged s a #

fromEnum :: Tagged s a -> Int #

enumFrom :: Tagged s a -> [Tagged s a] #

enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] #

enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] #

enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] #

a ~~ b => Enum (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

succ :: (a :~~: b) -> a :~~: b #

pred :: (a :~~: b) -> a :~~: b #

toEnum :: Int -> a :~~: b #

fromEnum :: (a :~~: b) -> Int #

enumFrom :: (a :~~: b) -> [a :~~: b] #

enumFromThen :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

enumFromTo :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

enumFromThenTo :: (a :~~: b) -> (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

class Eq a #

The Eq class defines equality (==) and inequality (/=). - All the basic datatypes exported by the Prelude are instances of Eq, + applied to a value that is too large to fit in an Int.

enumFrom :: a -> [a] #

Used in Haskell's translation of [n..] with [n..] = enumFrom n, + a possible implementation being enumFrom n = n : enumFrom (succ n). + For example:

  • enumFrom 4 :: [Integer] = [4,5,6,7,...]
  • enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]

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

Used in Haskell's translation of [n,n'..] + with [n,n'..] = enumFromThen n n', a possible implementation being + enumFromThen n n' = n : n' : worker (f x) (f x n'), + worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and + f n y + | n > 0 = f (n - 1) (succ y) + | n < 0 = f (n + 1) (pred y) + | otherwise = y + For example:

  • enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
  • enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]

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

Used in Haskell's translation of [n..m] with + [n..m] = enumFromTo n m, a possible implementation being + enumFromTo n m + | n <= m = n : enumFromTo (succ n) m + | otherwise = []. + For example:

  • enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
  • enumFromTo 42 1 :: [Integer] = []

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

Used in Haskell's translation of [n,n'..m] with + [n,n'..m] = enumFromThenTo n n' m, a possible implementation + being enumFromThenTo n n' m = worker (f x) (c x) n m, + x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0) + f n y + | n > 0 = f (n - 1) (succ y) + | n < 0 = f (n + 1) (pred y) + | otherwise = y and + worker s c v m + | c v m = v : worker s c (s v) m + | otherwise = [] + For example:

  • enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
  • enumFromThenTo 6 8 2 :: [Int] = []
Instances
Enum Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Bool -> Bool #

pred :: Bool -> Bool #

toEnum :: Int -> Bool #

fromEnum :: Bool -> Int #

enumFrom :: Bool -> [Bool] #

enumFromThen :: Bool -> Bool -> [Bool] #

enumFromTo :: Bool -> Bool -> [Bool] #

enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #

Enum Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Char -> Char #

pred :: Char -> Char #

toEnum :: Int -> Char #

fromEnum :: Char -> Int #

enumFrom :: Char -> [Char] #

enumFromThen :: Char -> Char -> [Char] #

enumFromTo :: Char -> Char -> [Char] #

enumFromThenTo :: Char -> Char -> Char -> [Char] #

Enum Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Int -> Int #

pred :: Int -> Int #

toEnum :: Int -> Int #

fromEnum :: Int -> Int #

enumFrom :: Int -> [Int] #

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

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

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

Enum Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int8 -> Int8 #

pred :: Int8 -> Int8 #

toEnum :: Int -> Int8 #

fromEnum :: Int8 -> Int #

enumFrom :: Int8 -> [Int8] #

enumFromThen :: Int8 -> Int8 -> [Int8] #

enumFromTo :: Int8 -> Int8 -> [Int8] #

enumFromThenTo :: Int8 -> Int8 -> Int8 -> [Int8] #

Enum Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int16 -> Int16 #

pred :: Int16 -> Int16 #

toEnum :: Int -> Int16 #

fromEnum :: Int16 -> Int #

enumFrom :: Int16 -> [Int16] #

enumFromThen :: Int16 -> Int16 -> [Int16] #

enumFromTo :: Int16 -> Int16 -> [Int16] #

enumFromThenTo :: Int16 -> Int16 -> Int16 -> [Int16] #

Enum Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int32 -> Int32 #

pred :: Int32 -> Int32 #

toEnum :: Int -> Int32 #

fromEnum :: Int32 -> Int #

enumFrom :: Int32 -> [Int32] #

enumFromThen :: Int32 -> Int32 -> [Int32] #

enumFromTo :: Int32 -> Int32 -> [Int32] #

enumFromThenTo :: Int32 -> Int32 -> Int32 -> [Int32] #

Enum Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

succ :: Int64 -> Int64 #

pred :: Int64 -> Int64 #

toEnum :: Int -> Int64 #

fromEnum :: Int64 -> Int #

enumFrom :: Int64 -> [Int64] #

enumFromThen :: Int64 -> Int64 -> [Int64] #

enumFromTo :: Int64 -> Int64 -> [Int64] #

enumFromThenTo :: Int64 -> Int64 -> Int64 -> [Int64] #

Enum Integer

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Integer -> Integer #

pred :: Integer -> Integer #

toEnum :: Int -> Integer #

fromEnum :: Integer -> Int #

enumFrom :: Integer -> [Integer] #

enumFromThen :: Integer -> Integer -> [Integer] #

enumFromTo :: Integer -> Integer -> [Integer] #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #

Enum Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Enum

Methods

succ :: Natural -> Natural #

pred :: Natural -> Natural #

toEnum :: Int -> Natural #

fromEnum :: Natural -> Int #

enumFrom :: Natural -> [Natural] #

enumFromThen :: Natural -> Natural -> [Natural] #

enumFromTo :: Natural -> Natural -> [Natural] #

enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] #

Enum Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Ordering -> Ordering #

pred :: Ordering -> Ordering #

toEnum :: Int -> Ordering #

fromEnum :: Ordering -> Int #

enumFrom :: Ordering -> [Ordering] #

enumFromThen :: Ordering -> Ordering -> [Ordering] #

enumFromTo :: Ordering -> Ordering -> [Ordering] #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #

Enum Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Word -> Word #

pred :: Word -> Word #

toEnum :: Int -> Word #

fromEnum :: Word -> Int #

enumFrom :: Word -> [Word] #

enumFromThen :: Word -> Word -> [Word] #

enumFromTo :: Word -> Word -> [Word] #

enumFromThenTo :: Word -> Word -> Word -> [Word] #

Enum Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word8 -> Word8 #

pred :: Word8 -> Word8 #

toEnum :: Int -> Word8 #

fromEnum :: Word8 -> Int #

enumFrom :: Word8 -> [Word8] #

enumFromThen :: Word8 -> Word8 -> [Word8] #

enumFromTo :: Word8 -> Word8 -> [Word8] #

enumFromThenTo :: Word8 -> Word8 -> Word8 -> [Word8] #

Enum Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word16 -> Word16 #

pred :: Word16 -> Word16 #

toEnum :: Int -> Word16 #

fromEnum :: Word16 -> Int #

enumFrom :: Word16 -> [Word16] #

enumFromThen :: Word16 -> Word16 -> [Word16] #

enumFromTo :: Word16 -> Word16 -> [Word16] #

enumFromThenTo :: Word16 -> Word16 -> Word16 -> [Word16] #

Enum Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word32 -> Word32 #

pred :: Word32 -> Word32 #

toEnum :: Int -> Word32 #

fromEnum :: Word32 -> Int #

enumFrom :: Word32 -> [Word32] #

enumFromThen :: Word32 -> Word32 -> [Word32] #

enumFromTo :: Word32 -> Word32 -> [Word32] #

enumFromThenTo :: Word32 -> Word32 -> Word32 -> [Word32] #

Enum Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

succ :: Word64 -> Word64 #

pred :: Word64 -> Word64 #

toEnum :: Int -> Word64 #

fromEnum :: Word64 -> Int #

enumFrom :: Word64 -> [Word64] #

enumFromThen :: Word64 -> Word64 -> [Word64] #

enumFromTo :: Word64 -> Word64 -> [Word64] #

enumFromThenTo :: Word64 -> Word64 -> Word64 -> [Word64] #

Enum VecCount

Since: base-4.10.0.0

Instance details

Defined in GHC.Enum

Methods

succ :: VecCount -> VecCount #

pred :: VecCount -> VecCount #

toEnum :: Int -> VecCount #

fromEnum :: VecCount -> Int #

enumFrom :: VecCount -> [VecCount] #

enumFromThen :: VecCount -> VecCount -> [VecCount] #

enumFromTo :: VecCount -> VecCount -> [VecCount] #

enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] #

Enum VecElem

Since: base-4.10.0.0

Instance details

Defined in GHC.Enum

Methods

succ :: VecElem -> VecElem #

pred :: VecElem -> VecElem #

toEnum :: Int -> VecElem #

fromEnum :: VecElem -> Int #

enumFrom :: VecElem -> [VecElem] #

enumFromThen :: VecElem -> VecElem -> [VecElem] #

enumFromTo :: VecElem -> VecElem -> [VecElem] #

enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] #

Enum ()

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: () -> () #

pred :: () -> () #

toEnum :: Int -> () #

fromEnum :: () -> Int #

enumFrom :: () -> [()] #

enumFromThen :: () -> () -> [()] #

enumFromTo :: () -> () -> [()] #

enumFromThenTo :: () -> () -> () -> [()] #

Enum Fd 
Instance details

Defined in System.Posix.Types

Methods

succ :: Fd -> Fd #

pred :: Fd -> Fd #

toEnum :: Int -> Fd #

fromEnum :: Fd -> Int #

enumFrom :: Fd -> [Fd] #

enumFromThen :: Fd -> Fd -> [Fd] #

enumFromTo :: Fd -> Fd -> [Fd] #

enumFromThenTo :: Fd -> Fd -> Fd -> [Fd] #

Enum CKey 
Instance details

Defined in System.Posix.Types

Methods

succ :: CKey -> CKey #

pred :: CKey -> CKey #

toEnum :: Int -> CKey #

fromEnum :: CKey -> Int #

enumFrom :: CKey -> [CKey] #

enumFromThen :: CKey -> CKey -> [CKey] #

enumFromTo :: CKey -> CKey -> [CKey] #

enumFromThenTo :: CKey -> CKey -> CKey -> [CKey] #

Enum CId 
Instance details

Defined in System.Posix.Types

Methods

succ :: CId -> CId #

pred :: CId -> CId #

toEnum :: Int -> CId #

fromEnum :: CId -> Int #

enumFrom :: CId -> [CId] #

enumFromThen :: CId -> CId -> [CId] #

enumFromTo :: CId -> CId -> [CId] #

enumFromThenTo :: CId -> CId -> CId -> [CId] #

Enum CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

succ :: CFsFilCnt -> CFsFilCnt #

pred :: CFsFilCnt -> CFsFilCnt #

toEnum :: Int -> CFsFilCnt #

fromEnum :: CFsFilCnt -> Int #

enumFrom :: CFsFilCnt -> [CFsFilCnt] #

enumFromThen :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] #

enumFromTo :: CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] #

enumFromThenTo :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt -> [CFsFilCnt] #

Enum CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

succ :: CFsBlkCnt -> CFsBlkCnt #

pred :: CFsBlkCnt -> CFsBlkCnt #

toEnum :: Int -> CFsBlkCnt #

fromEnum :: CFsBlkCnt -> Int #

enumFrom :: CFsBlkCnt -> [CFsBlkCnt] #

enumFromThen :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] #

enumFromTo :: CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] #

enumFromThenTo :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt -> [CFsBlkCnt] #

Enum CClockId 
Instance details

Defined in System.Posix.Types

Methods

succ :: CClockId -> CClockId #

pred :: CClockId -> CClockId #

toEnum :: Int -> CClockId #

fromEnum :: CClockId -> Int #

enumFrom :: CClockId -> [CClockId] #

enumFromThen :: CClockId -> CClockId -> [CClockId] #

enumFromTo :: CClockId -> CClockId -> [CClockId] #

enumFromThenTo :: CClockId -> CClockId -> CClockId -> [CClockId] #

Enum CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

succ :: CBlkCnt -> CBlkCnt #

pred :: CBlkCnt -> CBlkCnt #

toEnum :: Int -> CBlkCnt #

fromEnum :: CBlkCnt -> Int #

enumFrom :: CBlkCnt -> [CBlkCnt] #

enumFromThen :: CBlkCnt -> CBlkCnt -> [CBlkCnt] #

enumFromTo :: CBlkCnt -> CBlkCnt -> [CBlkCnt] #

enumFromThenTo :: CBlkCnt -> CBlkCnt -> CBlkCnt -> [CBlkCnt] #

Enum CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

succ :: CBlkSize -> CBlkSize #

pred :: CBlkSize -> CBlkSize #

toEnum :: Int -> CBlkSize #

fromEnum :: CBlkSize -> Int #

enumFrom :: CBlkSize -> [CBlkSize] #

enumFromThen :: CBlkSize -> CBlkSize -> [CBlkSize] #

enumFromTo :: CBlkSize -> CBlkSize -> [CBlkSize] #

enumFromThenTo :: CBlkSize -> CBlkSize -> CBlkSize -> [CBlkSize] #

Enum CRLim 
Instance details

Defined in System.Posix.Types

Methods

succ :: CRLim -> CRLim #

pred :: CRLim -> CRLim #

toEnum :: Int -> CRLim #

fromEnum :: CRLim -> Int #

enumFrom :: CRLim -> [CRLim] #

enumFromThen :: CRLim -> CRLim -> [CRLim] #

enumFromTo :: CRLim -> CRLim -> [CRLim] #

enumFromThenTo :: CRLim -> CRLim -> CRLim -> [CRLim] #

Enum CTcflag 
Instance details

Defined in System.Posix.Types

Methods

succ :: CTcflag -> CTcflag #

pred :: CTcflag -> CTcflag #

toEnum :: Int -> CTcflag #

fromEnum :: CTcflag -> Int #

enumFrom :: CTcflag -> [CTcflag] #

enumFromThen :: CTcflag -> CTcflag -> [CTcflag] #

enumFromTo :: CTcflag -> CTcflag -> [CTcflag] #

enumFromThenTo :: CTcflag -> CTcflag -> CTcflag -> [CTcflag] #

Enum CSpeed 
Instance details

Defined in System.Posix.Types

Methods

succ :: CSpeed -> CSpeed #

pred :: CSpeed -> CSpeed #

toEnum :: Int -> CSpeed #

fromEnum :: CSpeed -> Int #

enumFrom :: CSpeed -> [CSpeed] #

enumFromThen :: CSpeed -> CSpeed -> [CSpeed] #

enumFromTo :: CSpeed -> CSpeed -> [CSpeed] #

enumFromThenTo :: CSpeed -> CSpeed -> CSpeed -> [CSpeed] #

Enum CCc 
Instance details

Defined in System.Posix.Types

Methods

succ :: CCc -> CCc #

pred :: CCc -> CCc #

toEnum :: Int -> CCc #

fromEnum :: CCc -> Int #

enumFrom :: CCc -> [CCc] #

enumFromThen :: CCc -> CCc -> [CCc] #

enumFromTo :: CCc -> CCc -> [CCc] #

enumFromThenTo :: CCc -> CCc -> CCc -> [CCc] #

Enum CUid 
Instance details

Defined in System.Posix.Types

Methods

succ :: CUid -> CUid #

pred :: CUid -> CUid #

toEnum :: Int -> CUid #

fromEnum :: CUid -> Int #

enumFrom :: CUid -> [CUid] #

enumFromThen :: CUid -> CUid -> [CUid] #

enumFromTo :: CUid -> CUid -> [CUid] #

enumFromThenTo :: CUid -> CUid -> CUid -> [CUid] #

Enum CNlink 
Instance details

Defined in System.Posix.Types

Methods

succ :: CNlink -> CNlink #

pred :: CNlink -> CNlink #

toEnum :: Int -> CNlink #

fromEnum :: CNlink -> Int #

enumFrom :: CNlink -> [CNlink] #

enumFromThen :: CNlink -> CNlink -> [CNlink] #

enumFromTo :: CNlink -> CNlink -> [CNlink] #

enumFromThenTo :: CNlink -> CNlink -> CNlink -> [CNlink] #

Enum CGid 
Instance details

Defined in System.Posix.Types

Methods

succ :: CGid -> CGid #

pred :: CGid -> CGid #

toEnum :: Int -> CGid #

fromEnum :: CGid -> Int #

enumFrom :: CGid -> [CGid] #

enumFromThen :: CGid -> CGid -> [CGid] #

enumFromTo :: CGid -> CGid -> [CGid] #

enumFromThenTo :: CGid -> CGid -> CGid -> [CGid] #

Enum CSsize 
Instance details

Defined in System.Posix.Types

Methods

succ :: CSsize -> CSsize #

pred :: CSsize -> CSsize #

toEnum :: Int -> CSsize #

fromEnum :: CSsize -> Int #

enumFrom :: CSsize -> [CSsize] #

enumFromThen :: CSsize -> CSsize -> [CSsize] #

enumFromTo :: CSsize -> CSsize -> [CSsize] #

enumFromThenTo :: CSsize -> CSsize -> CSsize -> [CSsize] #

Enum CPid 
Instance details

Defined in System.Posix.Types

Methods

succ :: CPid -> CPid #

pred :: CPid -> CPid #

toEnum :: Int -> CPid #

fromEnum :: CPid -> Int #

enumFrom :: CPid -> [CPid] #

enumFromThen :: CPid -> CPid -> [CPid] #

enumFromTo :: CPid -> CPid -> [CPid] #

enumFromThenTo :: CPid -> CPid -> CPid -> [CPid] #

Enum COff 
Instance details

Defined in System.Posix.Types

Methods

succ :: COff -> COff #

pred :: COff -> COff #

toEnum :: Int -> COff #

fromEnum :: COff -> Int #

enumFrom :: COff -> [COff] #

enumFromThen :: COff -> COff -> [COff] #

enumFromTo :: COff -> COff -> [COff] #

enumFromThenTo :: COff -> COff -> COff -> [COff] #

Enum CMode 
Instance details

Defined in System.Posix.Types

Methods

succ :: CMode -> CMode #

pred :: CMode -> CMode #

toEnum :: Int -> CMode #

fromEnum :: CMode -> Int #

enumFrom :: CMode -> [CMode] #

enumFromThen :: CMode -> CMode -> [CMode] #

enumFromTo :: CMode -> CMode -> [CMode] #

enumFromThenTo :: CMode -> CMode -> CMode -> [CMode] #

Enum CIno 
Instance details

Defined in System.Posix.Types

Methods

succ :: CIno -> CIno #

pred :: CIno -> CIno #

toEnum :: Int -> CIno #

fromEnum :: CIno -> Int #

enumFrom :: CIno -> [CIno] #

enumFromThen :: CIno -> CIno -> [CIno] #

enumFromTo :: CIno -> CIno -> [CIno] #

enumFromThenTo :: CIno -> CIno -> CIno -> [CIno] #

Enum CDev 
Instance details

Defined in System.Posix.Types

Methods

succ :: CDev -> CDev #

pred :: CDev -> CDev #

toEnum :: Int -> CDev #

fromEnum :: CDev -> Int #

enumFrom :: CDev -> [CDev] #

enumFromThen :: CDev -> CDev -> [CDev] #

enumFromTo :: CDev -> CDev -> [CDev] #

enumFromThenTo :: CDev -> CDev -> CDev -> [CDev] #

Enum IOMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.IOMode

Methods

succ :: IOMode -> IOMode #

pred :: IOMode -> IOMode #

toEnum :: Int -> IOMode #

fromEnum :: IOMode -> Int #

enumFrom :: IOMode -> [IOMode] #

enumFromThen :: IOMode -> IOMode -> [IOMode] #

enumFromTo :: IOMode -> IOMode -> [IOMode] #

enumFromThenTo :: IOMode -> IOMode -> IOMode -> [IOMode] #

Enum SeekMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Device

Methods

succ :: SeekMode -> SeekMode #

pred :: SeekMode -> SeekMode #

toEnum :: Int -> SeekMode #

fromEnum :: SeekMode -> Int #

enumFrom :: SeekMode -> [SeekMode] #

enumFromThen :: SeekMode -> SeekMode -> [SeekMode] #

enumFromTo :: SeekMode -> SeekMode -> [SeekMode] #

enumFromThenTo :: SeekMode -> SeekMode -> SeekMode -> [SeekMode] #

Enum Associativity

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

succ :: Associativity -> Associativity #

pred :: Associativity -> Associativity #

toEnum :: Int -> Associativity #

fromEnum :: Associativity -> Int #

enumFrom :: Associativity -> [Associativity] #

enumFromThen :: Associativity -> Associativity -> [Associativity] #

enumFromTo :: Associativity -> Associativity -> [Associativity] #

enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] #

Enum SourceUnpackedness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

succ :: SourceUnpackedness -> SourceUnpackedness #

pred :: SourceUnpackedness -> SourceUnpackedness #

toEnum :: Int -> SourceUnpackedness #

fromEnum :: SourceUnpackedness -> Int #

enumFrom :: SourceUnpackedness -> [SourceUnpackedness] #

enumFromThen :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

enumFromTo :: SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

enumFromThenTo :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness -> [SourceUnpackedness] #

Enum SourceStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

succ :: SourceStrictness -> SourceStrictness #

pred :: SourceStrictness -> SourceStrictness #

toEnum :: Int -> SourceStrictness #

fromEnum :: SourceStrictness -> Int #

enumFrom :: SourceStrictness -> [SourceStrictness] #

enumFromThen :: SourceStrictness -> SourceStrictness -> [SourceStrictness] #

enumFromTo :: SourceStrictness -> SourceStrictness -> [SourceStrictness] #

enumFromThenTo :: SourceStrictness -> SourceStrictness -> SourceStrictness -> [SourceStrictness] #

Enum DecidedStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

succ :: DecidedStrictness -> DecidedStrictness #

pred :: DecidedStrictness -> DecidedStrictness #

toEnum :: Int -> DecidedStrictness #

fromEnum :: DecidedStrictness -> Int #

enumFrom :: DecidedStrictness -> [DecidedStrictness] #

enumFromThen :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

enumFromTo :: DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

enumFromThenTo :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness -> [DecidedStrictness] #

Enum CChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CChar -> CChar #

pred :: CChar -> CChar #

toEnum :: Int -> CChar #

fromEnum :: CChar -> Int #

enumFrom :: CChar -> [CChar] #

enumFromThen :: CChar -> CChar -> [CChar] #

enumFromTo :: CChar -> CChar -> [CChar] #

enumFromThenTo :: CChar -> CChar -> CChar -> [CChar] #

Enum CSChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSChar -> CSChar #

pred :: CSChar -> CSChar #

toEnum :: Int -> CSChar #

fromEnum :: CSChar -> Int #

enumFrom :: CSChar -> [CSChar] #

enumFromThen :: CSChar -> CSChar -> [CSChar] #

enumFromTo :: CSChar -> CSChar -> [CSChar] #

enumFromThenTo :: CSChar -> CSChar -> CSChar -> [CSChar] #

Enum CUChar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUChar -> CUChar #

pred :: CUChar -> CUChar #

toEnum :: Int -> CUChar #

fromEnum :: CUChar -> Int #

enumFrom :: CUChar -> [CUChar] #

enumFromThen :: CUChar -> CUChar -> [CUChar] #

enumFromTo :: CUChar -> CUChar -> [CUChar] #

enumFromThenTo :: CUChar -> CUChar -> CUChar -> [CUChar] #

Enum CShort 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CShort -> CShort #

pred :: CShort -> CShort #

toEnum :: Int -> CShort #

fromEnum :: CShort -> Int #

enumFrom :: CShort -> [CShort] #

enumFromThen :: CShort -> CShort -> [CShort] #

enumFromTo :: CShort -> CShort -> [CShort] #

enumFromThenTo :: CShort -> CShort -> CShort -> [CShort] #

Enum CUShort 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUShort -> CUShort #

pred :: CUShort -> CUShort #

toEnum :: Int -> CUShort #

fromEnum :: CUShort -> Int #

enumFrom :: CUShort -> [CUShort] #

enumFromThen :: CUShort -> CUShort -> [CUShort] #

enumFromTo :: CUShort -> CUShort -> [CUShort] #

enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] #

Enum CInt 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CInt -> CInt #

pred :: CInt -> CInt #

toEnum :: Int -> CInt #

fromEnum :: CInt -> Int #

enumFrom :: CInt -> [CInt] #

enumFromThen :: CInt -> CInt -> [CInt] #

enumFromTo :: CInt -> CInt -> [CInt] #

enumFromThenTo :: CInt -> CInt -> CInt -> [CInt] #

Enum CUInt 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUInt -> CUInt #

pred :: CUInt -> CUInt #

toEnum :: Int -> CUInt #

fromEnum :: CUInt -> Int #

enumFrom :: CUInt -> [CUInt] #

enumFromThen :: CUInt -> CUInt -> [CUInt] #

enumFromTo :: CUInt -> CUInt -> [CUInt] #

enumFromThenTo :: CUInt -> CUInt -> CUInt -> [CUInt] #

Enum CLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CLong -> CLong #

pred :: CLong -> CLong #

toEnum :: Int -> CLong #

fromEnum :: CLong -> Int #

enumFrom :: CLong -> [CLong] #

enumFromThen :: CLong -> CLong -> [CLong] #

enumFromTo :: CLong -> CLong -> [CLong] #

enumFromThenTo :: CLong -> CLong -> CLong -> [CLong] #

Enum CULong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CULong -> CULong #

pred :: CULong -> CULong #

toEnum :: Int -> CULong #

fromEnum :: CULong -> Int #

enumFrom :: CULong -> [CULong] #

enumFromThen :: CULong -> CULong -> [CULong] #

enumFromTo :: CULong -> CULong -> [CULong] #

enumFromThenTo :: CULong -> CULong -> CULong -> [CULong] #

Enum CLLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CLLong -> CLLong #

pred :: CLLong -> CLLong #

toEnum :: Int -> CLLong #

fromEnum :: CLLong -> Int #

enumFrom :: CLLong -> [CLLong] #

enumFromThen :: CLLong -> CLLong -> [CLLong] #

enumFromTo :: CLLong -> CLLong -> [CLLong] #

enumFromThenTo :: CLLong -> CLLong -> CLLong -> [CLLong] #

Enum CULLong 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CULLong -> CULLong #

pred :: CULLong -> CULLong #

toEnum :: Int -> CULLong #

fromEnum :: CULLong -> Int #

enumFrom :: CULLong -> [CULLong] #

enumFromThen :: CULLong -> CULLong -> [CULLong] #

enumFromTo :: CULLong -> CULLong -> [CULLong] #

enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] #

Enum CBool 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CBool -> CBool #

pred :: CBool -> CBool #

toEnum :: Int -> CBool #

fromEnum :: CBool -> Int #

enumFrom :: CBool -> [CBool] #

enumFromThen :: CBool -> CBool -> [CBool] #

enumFromTo :: CBool -> CBool -> [CBool] #

enumFromThenTo :: CBool -> CBool -> CBool -> [CBool] #

Enum CFloat 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CFloat -> CFloat #

pred :: CFloat -> CFloat #

toEnum :: Int -> CFloat #

fromEnum :: CFloat -> Int #

enumFrom :: CFloat -> [CFloat] #

enumFromThen :: CFloat -> CFloat -> [CFloat] #

enumFromTo :: CFloat -> CFloat -> [CFloat] #

enumFromThenTo :: CFloat -> CFloat -> CFloat -> [CFloat] #

Enum CDouble 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CDouble -> CDouble #

pred :: CDouble -> CDouble #

toEnum :: Int -> CDouble #

fromEnum :: CDouble -> Int #

enumFrom :: CDouble -> [CDouble] #

enumFromThen :: CDouble -> CDouble -> [CDouble] #

enumFromTo :: CDouble -> CDouble -> [CDouble] #

enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] #

Enum CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CPtrdiff -> CPtrdiff #

pred :: CPtrdiff -> CPtrdiff #

toEnum :: Int -> CPtrdiff #

fromEnum :: CPtrdiff -> Int #

enumFrom :: CPtrdiff -> [CPtrdiff] #

enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] #

enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] #

enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] #

Enum CSize 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSize -> CSize #

pred :: CSize -> CSize #

toEnum :: Int -> CSize #

fromEnum :: CSize -> Int #

enumFrom :: CSize -> [CSize] #

enumFromThen :: CSize -> CSize -> [CSize] #

enumFromTo :: CSize -> CSize -> [CSize] #

enumFromThenTo :: CSize -> CSize -> CSize -> [CSize] #

Enum CWchar 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CWchar -> CWchar #

pred :: CWchar -> CWchar #

toEnum :: Int -> CWchar #

fromEnum :: CWchar -> Int #

enumFrom :: CWchar -> [CWchar] #

enumFromThen :: CWchar -> CWchar -> [CWchar] #

enumFromTo :: CWchar -> CWchar -> [CWchar] #

enumFromThenTo :: CWchar -> CWchar -> CWchar -> [CWchar] #

Enum CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSigAtomic -> CSigAtomic #

pred :: CSigAtomic -> CSigAtomic #

toEnum :: Int -> CSigAtomic #

fromEnum :: CSigAtomic -> Int #

enumFrom :: CSigAtomic -> [CSigAtomic] #

enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] #

enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] #

enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] #

Enum CClock 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CClock -> CClock #

pred :: CClock -> CClock #

toEnum :: Int -> CClock #

fromEnum :: CClock -> Int #

enumFrom :: CClock -> [CClock] #

enumFromThen :: CClock -> CClock -> [CClock] #

enumFromTo :: CClock -> CClock -> [CClock] #

enumFromThenTo :: CClock -> CClock -> CClock -> [CClock] #

Enum CTime 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CTime -> CTime #

pred :: CTime -> CTime #

toEnum :: Int -> CTime #

fromEnum :: CTime -> Int #

enumFrom :: CTime -> [CTime] #

enumFromThen :: CTime -> CTime -> [CTime] #

enumFromTo :: CTime -> CTime -> [CTime] #

enumFromThenTo :: CTime -> CTime -> CTime -> [CTime] #

Enum CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUSeconds -> CUSeconds #

pred :: CUSeconds -> CUSeconds #

toEnum :: Int -> CUSeconds #

fromEnum :: CUSeconds -> Int #

enumFrom :: CUSeconds -> [CUSeconds] #

enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] #

enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] #

enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] #

Enum CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CSUSeconds -> CSUSeconds #

pred :: CSUSeconds -> CSUSeconds #

toEnum :: Int -> CSUSeconds #

fromEnum :: CSUSeconds -> Int #

enumFrom :: CSUSeconds -> [CSUSeconds] #

enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] #

enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] #

enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] #

Enum CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CIntPtr -> CIntPtr #

pred :: CIntPtr -> CIntPtr #

toEnum :: Int -> CIntPtr #

fromEnum :: CIntPtr -> Int #

enumFrom :: CIntPtr -> [CIntPtr] #

enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] #

enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] #

enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] #

Enum CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUIntPtr -> CUIntPtr #

pred :: CUIntPtr -> CUIntPtr #

toEnum :: Int -> CUIntPtr #

fromEnum :: CUIntPtr -> Int #

enumFrom :: CUIntPtr -> [CUIntPtr] #

enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] #

enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] #

enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] #

Enum CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CIntMax -> CIntMax #

pred :: CIntMax -> CIntMax #

toEnum :: Int -> CIntMax #

fromEnum :: CIntMax -> Int #

enumFrom :: CIntMax -> [CIntMax] #

enumFromThen :: CIntMax -> CIntMax -> [CIntMax] #

enumFromTo :: CIntMax -> CIntMax -> [CIntMax] #

enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] #

Enum CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

succ :: CUIntMax -> CUIntMax #

pred :: CUIntMax -> CUIntMax #

toEnum :: Int -> CUIntMax #

fromEnum :: CUIntMax -> Int #

enumFrom :: CUIntMax -> [CUIntMax] #

enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] #

enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] #

enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] #

Enum GeneralCategory

Since: base-2.1

Instance details

Defined in GHC.Unicode

Methods

succ :: GeneralCategory -> GeneralCategory #

pred :: GeneralCategory -> GeneralCategory #

toEnum :: Int -> GeneralCategory #

fromEnum :: GeneralCategory -> Int #

enumFrom :: GeneralCategory -> [GeneralCategory] #

enumFromThen :: GeneralCategory -> GeneralCategory -> [GeneralCategory] #

enumFromTo :: GeneralCategory -> GeneralCategory -> [GeneralCategory] #

enumFromThenTo :: GeneralCategory -> GeneralCategory -> GeneralCategory -> [GeneralCategory] #

Enum UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

succ :: UTF32_Invalid -> UTF32_Invalid #

pred :: UTF32_Invalid -> UTF32_Invalid #

toEnum :: Int -> UTF32_Invalid #

fromEnum :: UTF32_Invalid -> Int #

enumFrom :: UTF32_Invalid -> [UTF32_Invalid] #

enumFromThen :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

enumFromTo :: UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

enumFromThenTo :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid -> [UTF32_Invalid] #

Enum Encoding 
Instance details

Defined in Basement.String

Methods

succ :: Encoding -> Encoding #

pred :: Encoding -> Encoding #

toEnum :: Int -> Encoding #

fromEnum :: Encoding -> Int #

enumFrom :: Encoding -> [Encoding] #

enumFromThen :: Encoding -> Encoding -> [Encoding] #

enumFromTo :: Encoding -> Encoding -> [Encoding] #

enumFromThenTo :: Encoding -> Encoding -> Encoding -> [Encoding] #

Enum FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

succ :: FileType -> FileType #

pred :: FileType -> FileType #

toEnum :: Int -> FileType #

fromEnum :: FileType -> Int #

enumFrom :: FileType -> [FileType] #

enumFromThen :: FileType -> FileType -> [FileType] #

enumFromTo :: FileType -> FileType -> [FileType] #

enumFromThenTo :: FileType -> FileType -> FileType -> [FileType] #

Enum XdgDirectory 
Instance details

Defined in System.Directory.Internal.Common

Methods

succ :: XdgDirectory -> XdgDirectory #

pred :: XdgDirectory -> XdgDirectory #

toEnum :: Int -> XdgDirectory #

fromEnum :: XdgDirectory -> Int #

enumFrom :: XdgDirectory -> [XdgDirectory] #

enumFromThen :: XdgDirectory -> XdgDirectory -> [XdgDirectory] #

enumFromTo :: XdgDirectory -> XdgDirectory -> [XdgDirectory] #

enumFromThenTo :: XdgDirectory -> XdgDirectory -> XdgDirectory -> [XdgDirectory] #

Enum XdgDirectoryList 
Instance details

Defined in System.Directory.Internal.Common

Methods

succ :: XdgDirectoryList -> XdgDirectoryList #

pred :: XdgDirectoryList -> XdgDirectoryList #

toEnum :: Int -> XdgDirectoryList #

fromEnum :: XdgDirectoryList -> Int #

enumFrom :: XdgDirectoryList -> [XdgDirectoryList] #

enumFromThen :: XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] #

enumFromTo :: XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] #

enumFromThenTo :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList -> [XdgDirectoryList] #

Enum Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Methods

succ :: Extension -> Extension #

pred :: Extension -> Extension #

toEnum :: Int -> Extension #

fromEnum :: Extension -> Int #

enumFrom :: Extension -> [Extension] #

enumFromThen :: Extension -> Extension -> [Extension] #

enumFromTo :: Extension -> Extension -> [Extension] #

enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] #

Enum NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

succ :: NominalDiffTime -> NominalDiffTime #

pred :: NominalDiffTime -> NominalDiffTime #

toEnum :: Int -> NominalDiffTime #

fromEnum :: NominalDiffTime -> Int #

enumFrom :: NominalDiffTime -> [NominalDiffTime] #

enumFromThen :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

enumFromTo :: NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

enumFromThenTo :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime -> [NominalDiffTime] #

Enum DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

succ :: DiffTime -> DiffTime #

pred :: DiffTime -> DiffTime #

toEnum :: Int -> DiffTime #

fromEnum :: DiffTime -> Int #

enumFrom :: DiffTime -> [DiffTime] #

enumFromThen :: DiffTime -> DiffTime -> [DiffTime] #

enumFromTo :: DiffTime -> DiffTime -> [DiffTime] #

enumFromThenTo :: DiffTime -> DiffTime -> DiffTime -> [DiffTime] #

Enum Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

succ :: Day -> Day #

pred :: Day -> Day #

toEnum :: Int -> Day #

fromEnum :: Day -> Int #

enumFrom :: Day -> [Day] #

enumFromThen :: Day -> Day -> [Day] #

enumFromTo :: Day -> Day -> [Day] #

enumFromThenTo :: Day -> Day -> Day -> [Day] #

Enum Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Format -> Format #

pred :: Format -> Format #

toEnum :: Int -> Format #

fromEnum :: Format -> Int #

enumFrom :: Format -> [Format] #

enumFromThen :: Format -> Format -> [Format] #

enumFromTo :: Format -> Format -> [Format] #

enumFromThenTo :: Format -> Format -> Format -> [Format] #

Enum Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: Method -> Method #

pred :: Method -> Method #

toEnum :: Int -> Method #

fromEnum :: Method -> Int #

enumFrom :: Method -> [Method] #

enumFromThen :: Method -> Method -> [Method] #

enumFromTo :: Method -> Method -> [Method] #

enumFromThenTo :: Method -> Method -> Method -> [Method] #

Enum CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

succ :: CompressionStrategy -> CompressionStrategy #

pred :: CompressionStrategy -> CompressionStrategy #

toEnum :: Int -> CompressionStrategy #

fromEnum :: CompressionStrategy -> Int #

enumFrom :: CompressionStrategy -> [CompressionStrategy] #

enumFromThen :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

enumFromTo :: CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

enumFromThenTo :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy -> [CompressionStrategy] #

Enum ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

succ :: ConstVal -> ConstVal #

pred :: ConstVal -> ConstVal #

toEnum :: Int -> ConstVal #

fromEnum :: ConstVal -> Int #

enumFrom :: ConstVal -> [ConstVal] #

enumFromThen :: ConstVal -> ConstVal -> [ConstVal] #

enumFromTo :: ConstVal -> ConstVal -> [ConstVal] #

enumFromThenTo :: ConstVal -> ConstVal -> ConstVal -> [ConstVal] #

Enum OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

succ :: OutputType -> OutputType #

pred :: OutputType -> OutputType #

toEnum :: Int -> OutputType #

fromEnum :: OutputType -> Int #

enumFrom :: OutputType -> [OutputType] #

enumFromThen :: OutputType -> OutputType -> [OutputType] #

enumFromTo :: OutputType -> OutputType -> [OutputType] #

enumFromThenTo :: OutputType -> OutputType -> OutputType -> [OutputType] #

Enum PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

succ :: PlotIndex -> PlotIndex #

pred :: PlotIndex -> PlotIndex #

toEnum :: Int -> PlotIndex #

fromEnum :: PlotIndex -> Int #

enumFrom :: PlotIndex -> [PlotIndex] #

enumFromThen :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromTo :: PlotIndex -> PlotIndex -> [PlotIndex] #

enumFromThenTo :: PlotIndex -> PlotIndex -> PlotIndex -> [PlotIndex] #

Enum Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

succ :: Crossings -> Crossings #

pred :: Crossings -> Crossings #

toEnum :: Int -> Crossings #

fromEnum :: Crossings -> Int #

enumFrom :: Crossings -> [Crossings] #

enumFromThen :: Crossings -> Crossings -> [Crossings] #

enumFromTo :: Crossings -> Crossings -> [Crossings] #

enumFromThenTo :: Crossings -> Crossings -> Crossings -> [Crossings] #

Integral a => Enum (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

succ :: Ratio a -> Ratio a #

pred :: Ratio a -> Ratio a #

toEnum :: Int -> Ratio a #

fromEnum :: Ratio a -> Int #

enumFrom :: Ratio a -> [Ratio a] #

enumFromThen :: Ratio a -> Ratio a -> [Ratio a] #

enumFromTo :: Ratio a -> Ratio a -> [Ratio a] #

enumFromThenTo :: Ratio a -> Ratio a -> Ratio a -> [Ratio a] #

Enum a => Enum (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Min a -> Min a #

pred :: Min a -> Min a #

toEnum :: Int -> Min a #

fromEnum :: Min a -> Int #

enumFrom :: Min a -> [Min a] #

enumFromThen :: Min a -> Min a -> [Min a] #

enumFromTo :: Min a -> Min a -> [Min a] #

enumFromThenTo :: Min a -> Min a -> Min a -> [Min a] #

Enum a => Enum (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Max a -> Max a #

pred :: Max a -> Max a #

toEnum :: Int -> Max a #

fromEnum :: Max a -> Int #

enumFrom :: Max a -> [Max a] #

enumFromThen :: Max a -> Max a -> [Max a] #

enumFromTo :: Max a -> Max a -> [Max a] #

enumFromThenTo :: Max a -> Max a -> Max a -> [Max a] #

Enum a => Enum (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: First a -> First a #

pred :: First a -> First a #

toEnum :: Int -> First a #

fromEnum :: First a -> Int #

enumFrom :: First a -> [First a] #

enumFromThen :: First a -> First a -> [First a] #

enumFromTo :: First a -> First a -> [First a] #

enumFromThenTo :: First a -> First a -> First a -> [First a] #

Enum a => Enum (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: Last a -> Last a #

pred :: Last a -> Last a #

toEnum :: Int -> Last a #

fromEnum :: Last a -> Int #

enumFrom :: Last a -> [Last a] #

enumFromThen :: Last a -> Last a -> [Last a] #

enumFromTo :: Last a -> Last a -> [Last a] #

enumFromThenTo :: Last a -> Last a -> Last a -> [Last a] #

Enum a => Enum (WrappedMonoid a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

succ :: WrappedMonoid a -> WrappedMonoid a #

pred :: WrappedMonoid a -> WrappedMonoid a #

toEnum :: Int -> WrappedMonoid a #

fromEnum :: WrappedMonoid a -> Int #

enumFrom :: WrappedMonoid a -> [WrappedMonoid a] #

enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] #

Enum a => Enum (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

succ :: Identity a -> Identity a #

pred :: Identity a -> Identity a #

toEnum :: Int -> Identity a #

fromEnum :: Identity a -> Int #

enumFrom :: Identity a -> [Identity a] #

enumFromThen :: Identity a -> Identity a -> [Identity a] #

enumFromTo :: Identity a -> Identity a -> [Identity a] #

enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] #

Enum (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

succ :: Offset ty -> Offset ty #

pred :: Offset ty -> Offset ty #

toEnum :: Int -> Offset ty #

fromEnum :: Offset ty -> Int #

enumFrom :: Offset ty -> [Offset ty] #

enumFromThen :: Offset ty -> Offset ty -> [Offset ty] #

enumFromTo :: Offset ty -> Offset ty -> [Offset ty] #

enumFromThenTo :: Offset ty -> Offset ty -> Offset ty -> [Offset ty] #

Enum (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

succ :: CountOf ty -> CountOf ty #

pred :: CountOf ty -> CountOf ty #

toEnum :: Int -> CountOf ty #

fromEnum :: CountOf ty -> Int #

enumFrom :: CountOf ty -> [CountOf ty] #

enumFromThen :: CountOf ty -> CountOf ty -> [CountOf ty] #

enumFromTo :: CountOf ty -> CountOf ty -> [CountOf ty] #

enumFromThenTo :: CountOf ty -> CountOf ty -> CountOf ty -> [CountOf ty] #

Enum n => Enum (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

succ :: VarInt n -> VarInt n #

pred :: VarInt n -> VarInt n #

toEnum :: Int -> VarInt n #

fromEnum :: VarInt n -> Int #

enumFrom :: VarInt n -> [VarInt n] #

enumFromThen :: VarInt n -> VarInt n -> [VarInt n] #

enumFromTo :: VarInt n -> VarInt n -> [VarInt n] #

enumFromThenTo :: VarInt n -> VarInt n -> VarInt n -> [VarInt n] #

(Generic a, GEnum StandardEnum (Rep a)) => Enum (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

succ :: Generically a -> Generically a #

pred :: Generically a -> Generically a #

toEnum :: Int -> Generically a #

fromEnum :: Generically a -> Int #

enumFrom :: Generically a -> [Generically a] #

enumFromThen :: Generically a -> Generically a -> [Generically a] #

enumFromTo :: Generically a -> Generically a -> [Generically a] #

enumFromThenTo :: Generically a -> Generically a -> Generically a -> [Generically a] #

(Generic a, GEnum FiniteEnum (Rep a)) => Enum (FiniteEnumeration a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

succ :: FiniteEnumeration a -> FiniteEnumeration a #

pred :: FiniteEnumeration a -> FiniteEnumeration a #

toEnum :: Int -> FiniteEnumeration a #

fromEnum :: FiniteEnumeration a -> Int #

enumFrom :: FiniteEnumeration a -> [FiniteEnumeration a] #

enumFromThen :: FiniteEnumeration a -> FiniteEnumeration a -> [FiniteEnumeration a] #

enumFromTo :: FiniteEnumeration a -> FiniteEnumeration a -> [FiniteEnumeration a] #

enumFromThenTo :: FiniteEnumeration a -> FiniteEnumeration a -> FiniteEnumeration a -> [FiniteEnumeration a] #

(RealFloat a, Precise a, Enum a) => Enum (Log a) 
Instance details

Defined in Numeric.Log

Methods

succ :: Log a -> Log a #

pred :: Log a -> Log a #

toEnum :: Int -> Log a #

fromEnum :: Log a -> Int #

enumFrom :: Log a -> [Log a] #

enumFromThen :: Log a -> Log a -> [Log a] #

enumFromTo :: Log a -> Log a -> [Log a] #

enumFromThenTo :: Log a -> Log a -> Log a -> [Log a] #

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Enum n => Enum (Time n) 
Instance details

Defined in Data.Active

Methods

succ :: Time n -> Time n #

pred :: Time n -> Time n #

toEnum :: Int -> Time n #

fromEnum :: Time n -> Int #

enumFrom :: Time n -> [Time n] #

enumFromThen :: Time n -> Time n -> [Time n] #

enumFromTo :: Time n -> Time n -> [Time n] #

enumFromThenTo :: Time n -> Time n -> Time n -> [Time n] #

Enum n => Enum (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

succ :: Angle n -> Angle n #

pred :: Angle n -> Angle n #

toEnum :: Int -> Angle n #

fromEnum :: Angle n -> Int #

enumFrom :: Angle n -> [Angle n] #

enumFromThen :: Angle n -> Angle n -> [Angle n] #

enumFromTo :: Angle n -> Angle n -> [Angle n] #

enumFromThenTo :: Angle n -> Angle n -> Angle n -> [Angle n] #

Enum n => Enum (Duration n) 
Instance details

Defined in Data.Active

Methods

succ :: Duration n -> Duration n #

pred :: Duration n -> Duration n #

toEnum :: Int -> Duration n #

fromEnum :: Duration n -> Int #

enumFrom :: Duration n -> [Duration n] #

enumFromThen :: Duration n -> Duration n -> [Duration n] #

enumFromTo :: Duration n -> Duration n -> [Duration n] #

enumFromThenTo :: Duration n -> Duration n -> Duration n -> [Duration n] #

Enum (V0 a) 
Instance details

Defined in Linear.V0

Methods

succ :: V0 a -> V0 a #

pred :: V0 a -> V0 a #

toEnum :: Int -> V0 a #

fromEnum :: V0 a -> Int #

enumFrom :: V0 a -> [V0 a] #

enumFromThen :: V0 a -> V0 a -> [V0 a] #

enumFromTo :: V0 a -> V0 a -> [V0 a] #

enumFromThenTo :: V0 a -> V0 a -> V0 a -> [V0 a] #

Enum (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

succ :: Proxy s -> Proxy s #

pred :: Proxy s -> Proxy s #

toEnum :: Int -> Proxy s #

fromEnum :: Proxy s -> Int #

enumFrom :: Proxy s -> [Proxy s] #

enumFromThen :: Proxy s -> Proxy s -> [Proxy s] #

enumFromTo :: Proxy s -> Proxy s -> [Proxy s] #

enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #

(Integral t, Enum t, KnownNat m) => Enum (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

succ :: Mod m t -> Mod m t #

pred :: Mod m t -> Mod m t #

toEnum :: Int -> Mod m t #

fromEnum :: Mod m t -> Int #

enumFrom :: Mod m t -> [Mod m t] #

enumFromThen :: Mod m t -> Mod m t -> [Mod m t] #

enumFromTo :: Mod m t -> Mod m t -> [Mod m t] #

enumFromThenTo :: Mod m t -> Mod m t -> Mod m t -> [Mod m t] #

Enum a => Enum (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

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

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

toEnum :: Int -> Const a b #

fromEnum :: Const a b -> Int #

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

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

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

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

Enum (f a) => Enum (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

succ :: Ap f a -> Ap f a #

pred :: Ap f a -> Ap f a #

toEnum :: Int -> Ap f a #

fromEnum :: Ap f a -> Int #

enumFrom :: Ap f a -> [Ap f a] #

enumFromThen :: Ap f a -> Ap f a -> [Ap f a] #

enumFromTo :: Ap f a -> Ap f a -> [Ap f a] #

enumFromThenTo :: Ap f a -> Ap f a -> Ap f a -> [Ap f a] #

Enum (f a) => Enum (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

succ :: Alt f a -> Alt f a #

pred :: Alt f a -> Alt f a #

toEnum :: Int -> Alt f a #

fromEnum :: Alt f a -> Int #

enumFrom :: Alt f a -> [Alt f a] #

enumFromThen :: Alt f a -> Alt f a -> [Alt f a] #

enumFromTo :: Alt f a -> Alt f a -> [Alt f a] #

enumFromThenTo :: Alt f a -> Alt f a -> Alt f a -> [Alt f a] #

a ~ b => Enum (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

succ :: (a :~: b) -> a :~: b #

pred :: (a :~: b) -> a :~: b #

toEnum :: Int -> a :~: b #

fromEnum :: (a :~: b) -> Int #

enumFrom :: (a :~: b) -> [a :~: b] #

enumFromThen :: (a :~: b) -> (a :~: b) -> [a :~: b] #

enumFromTo :: (a :~: b) -> (a :~: b) -> [a :~: b] #

enumFromThenTo :: (a :~: b) -> (a :~: b) -> (a :~: b) -> [a :~: b] #

Enum a => Enum (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

succ :: Tagged s a -> Tagged s a #

pred :: Tagged s a -> Tagged s a #

toEnum :: Int -> Tagged s a #

fromEnum :: Tagged s a -> Int #

enumFrom :: Tagged s a -> [Tagged s a] #

enumFromThen :: Tagged s a -> Tagged s a -> [Tagged s a] #

enumFromTo :: Tagged s a -> Tagged s a -> [Tagged s a] #

enumFromThenTo :: Tagged s a -> Tagged s a -> Tagged s a -> [Tagged s a] #

a ~~ b => Enum (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

succ :: (a :~~: b) -> a :~~: b #

pred :: (a :~~: b) -> a :~~: b #

toEnum :: Int -> a :~~: b #

fromEnum :: (a :~~: b) -> Int #

enumFrom :: (a :~~: b) -> [a :~~: b] #

enumFromThen :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

enumFromTo :: (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

enumFromThenTo :: (a :~~: b) -> (a :~~: b) -> (a :~~: b) -> [a :~~: b] #

class Eq a #

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 /=.

Minimal complete definition

(==) | (/=)

Instances
Eq Bool 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Char 
Instance details

Defined in GHC.Classes

Methods

(==) :: Char -> Char -> Bool #

(/=) :: Char -> Char -> Bool #

Eq Double 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Float 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Int 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int8 -> Int8 -> Bool #

(/=) :: Int8 -> Int8 -> Bool #

Eq Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int16 -> Int16 -> Bool #

(/=) :: Int16 -> Int16 -> Bool #

Eq Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int32 -> Int32 -> Bool #

(/=) :: Int32 -> Int32 -> Bool #

Eq Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int64 -> Int64 -> Bool #

(/=) :: Int64 -> Int64 -> Bool #

Eq Integer 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: Integer -> Integer -> Bool #

(/=) :: Integer -> Integer -> Bool #

Eq Ordering 
Instance details

Defined in GHC.Classes

Methods

(==) :: Ordering -> Ordering -> Bool #

(/=) :: Ordering -> Ordering -> Bool #

Eq Word 
Instance details

Defined in GHC.Classes

Methods

(==) :: Word -> Word -> Bool #

(/=) :: Word -> Word -> Bool #

Eq Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word8 -> Word8 -> Bool #

(/=) :: Word8 -> Word8 -> Bool #

Eq Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word16 -> Word16 -> Bool #

(/=) :: Word16 -> Word16 -> Bool #

Eq Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word32 -> Word32 -> Bool #

(/=) :: Word32 -> Word32 -> Bool #

Eq Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word64 -> Word64 -> Bool #

(/=) :: Word64 -> Word64 -> Bool #

Eq SomeTypeRep 
Instance details

Defined in Data.Typeable.Internal

Methods

(==) :: SomeTypeRep -> SomeTypeRep -> Bool #

(/=) :: SomeTypeRep -> SomeTypeRep -> Bool #

Eq Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Exp -> Exp -> Bool #

(/=) :: Exp -> Exp -> Bool #

Eq Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Match -> Match -> Bool #

(/=) :: Match -> Match -> Bool #

Eq Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Clause -> Clause -> Bool #

(/=) :: Clause -> Clause -> Bool #

Eq Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Pat -> Pat -> Bool #

(/=) :: Pat -> Pat -> Bool #

Eq Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Eq Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Dec -> Dec -> Bool #

(/=) :: Dec -> Dec -> Bool #

Eq Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Name -> Name -> Bool #

(/=) :: Name -> Name -> Bool #

Eq FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FunDep -> FunDep -> Bool #

(/=) :: FunDep -> FunDep -> Bool #

Eq InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: InjectivityAnn -> InjectivityAnn -> Bool #

(/=) :: InjectivityAnn -> InjectivityAnn -> Bool #

Eq Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Overlap -> Overlap -> Bool #

(/=) :: Overlap -> Overlap -> Bool #

Eq DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DerivStrategy -> DerivStrategy -> Bool #

(/=) :: DerivStrategy -> DerivStrategy -> Bool #

Eq () 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq TyCon 
Instance details

Defined in GHC.Classes

Methods

(==) :: TyCon -> TyCon -> Bool #

(/=) :: TyCon -> TyCon -> Bool #

Eq Module 
Instance details

Defined in GHC.Classes

Methods

(==) :: Module -> Module -> Bool #

(/=) :: Module -> Module -> Bool #

Eq TrName 
Instance details

Defined in GHC.Classes

Methods

(==) :: TrName -> TrName -> Bool #

(/=) :: TrName -> TrName -> Bool #

Eq DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

(==) :: DefName -> DefName -> Bool #

(/=) :: DefName -> DefName -> Bool #

Eq LocalTime 
Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

(==) :: LocalTime -> LocalTime -> Bool #

(/=) :: LocalTime -> LocalTime -> Bool #

Eq Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: Percent -> Percent -> Bool #

(/=) :: Percent -> Percent -> Bool #

Eq LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: LogValue -> LogValue -> Bool #

(/=) :: LogValue -> LogValue -> Bool #

Eq PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(==) :: PlotIndex -> PlotIndex -> Bool #

(/=) :: PlotIndex -> PlotIndex -> Bool #

Eq LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineCap -> LineCap -> Bool #

(/=) :: LineCap -> LineCap -> Bool #

Eq LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineJoin -> LineJoin -> Bool #

(/=) :: LineJoin -> LineJoin -> Bool #

Eq LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineStyle -> LineStyle -> Bool #

(/=) :: LineStyle -> LineStyle -> Bool #

Eq FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Eq FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Eq FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontStyle -> FontStyle -> Bool #

(/=) :: FontStyle -> FontStyle -> Bool #

Eq HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: HTextAnchor -> HTextAnchor -> Bool #

(/=) :: HTextAnchor -> HTextAnchor -> Bool #

Eq VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: VTextAnchor -> VTextAnchor -> Bool #

(/=) :: VTextAnchor -> VTextAnchor -> Bool #

Eq TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: TextSize -> TextSize -> Bool #

(/=) :: TextSize -> TextSize -> Bool #

Eq FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FillStyle -> FillStyle -> Bool #

(/=) :: FillStyle -> FillStyle -> Bool #

Eq IOMode 
Instance details

Defined in GHC.IO.IOMode

Methods

(==) :: IOMode -> IOMode -> Bool #

(/=) :: IOMode -> IOMode -> Bool #

Eq Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Con -> Con -> Bool #

(/=) :: Con -> Con -> Bool #

Eq ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

(==) :: ByteString -> ByteString -> Bool #

(/=) :: ByteString -> ByteString -> Bool #

Eq ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

(==) :: ByteString -> ByteString -> Bool #

(/=) :: ByteString -> ByteString -> Bool #

Eq UTCTime 
Instance details

Defined in Data.Time.Clock.Internal.UTCTime

Methods

(==) :: UTCTime -> UTCTime -> Bool #

(/=) :: UTCTime -> UTCTime -> Bool #

Eq Handle

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: Handle -> Handle -> Bool #

(/=) :: Handle -> Handle -> Bool #

Eq BigNat 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: BigNat -> BigNat -> Bool #

(/=) :: BigNat -> BigNat -> Bool #

Eq Void

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

(==) :: Void -> Void -> Bool #

(/=) :: Void -> Void -> Bool #

Eq SpecConstrAnnotation 
Instance details

Defined in GHC.Exts

Methods

(==) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #

(/=) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #

Eq Version

Since: base-2.1

Instance details

Defined in Data.Version

Methods

(==) :: Version -> Version -> Bool #

(/=) :: Version -> Version -> Bool #

Eq HandlePosn

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle

Methods

(==) :: HandlePosn -> HandlePosn -> Bool #

(/=) :: HandlePosn -> HandlePosn -> Bool #

Eq AsyncException 
Instance details

Defined in GHC.IO.Exception

Methods

(==) :: AsyncException -> AsyncException -> Bool #

(/=) :: AsyncException -> AsyncException -> Bool #

Eq ArrayException 
Instance details

Defined in GHC.IO.Exception

Methods

(==) :: ArrayException -> ArrayException -> Bool #

(/=) :: ArrayException -> ArrayException -> Bool #

Eq ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

(==) :: ExitCode -> ExitCode -> Bool #

(/=) :: ExitCode -> ExitCode -> Bool #

Eq IOErrorType

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: IOErrorType -> IOErrorType -> Bool #

(/=) :: IOErrorType -> IOErrorType -> Bool #

Eq BufferMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: BufferMode -> BufferMode -> Bool #

(/=) :: BufferMode -> BufferMode -> Bool #

Eq Newline 
Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: Newline -> Newline -> Bool #

(/=) :: Newline -> Newline -> Bool #

Eq NewlineMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: NewlineMode -> NewlineMode -> Bool #

(/=) :: NewlineMode -> NewlineMode -> Bool #

Eq IODeviceType 
Instance details

Defined in GHC.IO.Device

Methods

(==) :: IODeviceType -> IODeviceType -> Bool #

(/=) :: IODeviceType -> IODeviceType -> Bool #

Eq SeekMode 
Instance details

Defined in GHC.IO.Device

Methods

(==) :: SeekMode -> SeekMode -> Bool #

(/=) :: SeekMode -> SeekMode -> Bool #

Eq CodingProgress 
Instance details

Defined in GHC.IO.Encoding.Types

Methods

(==) :: CodingProgress -> CodingProgress -> Bool #

(/=) :: CodingProgress -> CodingProgress -> Bool #

Eq MaskingState 
Instance details

Defined in GHC.IO

Methods

(==) :: MaskingState -> MaskingState -> Bool #

(/=) :: MaskingState -> MaskingState -> Bool #

Eq IOException

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: IOException -> IOException -> Bool #

(/=) :: IOException -> IOException -> Bool #

Eq ErrorCall 
Instance details

Defined in GHC.Exception

Methods

(==) :: ErrorCall -> ErrorCall -> Bool #

(/=) :: ErrorCall -> ErrorCall -> Bool #

Eq ArithException 
Instance details

Defined in GHC.Exception

Methods

(==) :: ArithException -> ArithException -> Bool #

(/=) :: ArithException -> ArithException -> Bool #

Eq All 
Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: All -> All -> Bool #

(/=) :: All -> All -> Bool #

Eq Any 
Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Any -> Any -> Bool #

(/=) :: Any -> Any -> Bool #

Eq Fixity 
Instance details

Defined in GHC.Generics

Methods

(==) :: Fixity -> Fixity -> Bool #

(/=) :: Fixity -> Fixity -> Bool #

Eq Associativity 
Instance details

Defined in GHC.Generics

Methods

(==) :: Associativity -> Associativity -> Bool #

(/=) :: Associativity -> Associativity -> Bool #

Eq SourceUnpackedness 
Instance details

Defined in GHC.Generics

Methods

(==) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

Eq SourceStrictness 
Instance details

Defined in GHC.Generics

Methods

(==) :: SourceStrictness -> SourceStrictness -> Bool #

(/=) :: SourceStrictness -> SourceStrictness -> Bool #

Eq DecidedStrictness 
Instance details

Defined in GHC.Generics

Methods

(==) :: DecidedStrictness -> DecidedStrictness -> Bool #

(/=) :: DecidedStrictness -> DecidedStrictness -> Bool #

Eq SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

(==) :: SomeNat -> SomeNat -> Bool #

(/=) :: SomeNat -> SomeNat -> Bool #

Eq CChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CChar -> CChar -> Bool #

(/=) :: CChar -> CChar -> Bool #

Eq CSChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSChar -> CSChar -> Bool #

(/=) :: CSChar -> CSChar -> Bool #

Eq CUChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUChar -> CUChar -> Bool #

(/=) :: CUChar -> CUChar -> Bool #

Eq CShort 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CShort -> CShort -> Bool #

(/=) :: CShort -> CShort -> Bool #

Eq CUShort 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUShort -> CUShort -> Bool #

(/=) :: CUShort -> CUShort -> Bool #

Eq CInt 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CInt -> CInt -> Bool #

(/=) :: CInt -> CInt -> Bool #

Eq CUInt 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUInt -> CUInt -> Bool #

(/=) :: CUInt -> CUInt -> Bool #

Eq CLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CLong -> CLong -> Bool #

(/=) :: CLong -> CLong -> Bool #

Eq CULong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CULong -> CULong -> Bool #

(/=) :: CULong -> CULong -> Bool #

Eq CLLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CLLong -> CLLong -> Bool #

(/=) :: CLLong -> CLLong -> Bool #

Eq CULLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CULLong -> CULLong -> Bool #

(/=) :: CULLong -> CULLong -> Bool #

Eq CBool 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CBool -> CBool -> Bool #

(/=) :: CBool -> CBool -> Bool #

Eq CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CFloat -> CFloat -> Bool #

(/=) :: CFloat -> CFloat -> Bool #

Eq CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CDouble -> CDouble -> Bool #

(/=) :: CDouble -> CDouble -> Bool #

Eq CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CPtrdiff -> CPtrdiff -> Bool #

(/=) :: CPtrdiff -> CPtrdiff -> Bool #

Eq CSize 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSize -> CSize -> Bool #

(/=) :: CSize -> CSize -> Bool #

Eq CWchar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CWchar -> CWchar -> Bool #

(/=) :: CWchar -> CWchar -> Bool #

Eq CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSigAtomic -> CSigAtomic -> Bool #

(/=) :: CSigAtomic -> CSigAtomic -> Bool #

Eq CClock 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CClock -> CClock -> Bool #

(/=) :: CClock -> CClock -> Bool #

Eq CTime 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CTime -> CTime -> Bool #

(/=) :: CTime -> CTime -> Bool #

Eq CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUSeconds -> CUSeconds -> Bool #

(/=) :: CUSeconds -> CUSeconds -> Bool #

Eq CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSUSeconds -> CSUSeconds -> Bool #

(/=) :: CSUSeconds -> CSUSeconds -> Bool #

Eq CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CIntPtr -> CIntPtr -> Bool #

(/=) :: CIntPtr -> CIntPtr -> Bool #

Eq CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUIntPtr -> CUIntPtr -> Bool #

(/=) :: CUIntPtr -> CUIntPtr -> Bool #

Eq CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CIntMax -> CIntMax -> Bool #

(/=) :: CIntMax -> CIntMax -> Bool #

Eq CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUIntMax -> CUIntMax -> Bool #

(/=) :: CUIntMax -> CUIntMax -> Bool #

Eq Lexeme 
Instance details

Defined in Text.Read.Lex

Methods

(==) :: Lexeme -> Lexeme -> Bool #

(/=) :: Lexeme -> Lexeme -> Bool #

Eq Number 
Instance details

Defined in Text.Read.Lex

Methods

(==) :: Number -> Number -> Bool #

(/=) :: Number -> Number -> Bool #

Eq GeneralCategory 
Instance details

Defined in GHC.Unicode

Methods

(==) :: GeneralCategory -> GeneralCategory -> Bool #

(/=) :: GeneralCategory -> GeneralCategory -> Bool #

Eq SrcLoc 
Instance details

Defined in GHC.Stack.Types

Methods

(==) :: SrcLoc -> SrcLoc -> Bool #

(/=) :: SrcLoc -> SrcLoc -> Bool #

Eq ASCII7_Invalid 
Instance details

Defined in Basement.String.Encoding.ASCII7

Methods

(==) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #

(/=) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #

Eq ISO_8859_1_Invalid 
Instance details

Defined in Basement.String.Encoding.ISO_8859_1

Methods

(==) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #

(/=) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #

Eq UTF16_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF16

Methods

(==) :: UTF16_Invalid -> UTF16_Invalid -> Bool #

(/=) :: UTF16_Invalid -> UTF16_Invalid -> Bool #

Eq UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

(==) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(/=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

Eq Encoding 
Instance details

Defined in Basement.String

Methods

(==) :: Encoding -> Encoding -> Bool #

(/=) :: Encoding -> Encoding -> Bool #

Eq String 
Instance details

Defined in Basement.UTF8.Base

Methods

(==) :: String -> String -> Bool #

(/=) :: String -> String -> Bool #

Eq FileSize 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: FileSize -> FileSize -> Bool #

(/=) :: FileSize -> FileSize -> Bool #

Eq IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

(==) :: IntSet -> IntSet -> Bool #

(/=) :: IntSet -> IntSet -> Bool #

Eq XdgDirectory 
Instance details

Defined in System.Directory

Methods

(==) :: XdgDirectory -> XdgDirectory -> Bool #

(/=) :: XdgDirectory -> XdgDirectory -> Bool #

Eq FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: FileType -> FileType -> Bool #

(/=) :: FileType -> FileType -> Bool #

Eq Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: Permissions -> Permissions -> Bool #

(/=) :: Permissions -> Permissions -> Bool #

Eq StdStream 
Instance details

Defined in System.Process.Common

Methods

(==) :: StdStream -> StdStream -> Bool #

(/=) :: StdStream -> StdStream -> Bool #

Eq CmdSpec 
Instance details

Defined in System.Process.Common

Methods

(==) :: CmdSpec -> CmdSpec -> Bool #

(/=) :: CmdSpec -> CmdSpec -> Bool #

Eq CreateProcess 
Instance details

Defined in System.Process.Common

Methods

(==) :: CreateProcess -> CreateProcess -> Bool #

(/=) :: CreateProcess -> CreateProcess -> Bool #

Eq Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Methods

(==) :: Extension -> Extension -> Bool #

(/=) :: Extension -> Extension -> Bool #

Eq ForeignSrcLang 
Instance details

Defined in GHC.ForeignSrcLang.Type

Methods

(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool #

(/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #

Eq CSVField 
Instance details

Defined in Text.CSV.Lazy.ByteString

Methods

(==) :: CSVField -> CSVField -> Bool #

(/=) :: CSVField -> CSVField -> Bool #

Eq CSVError 
Instance details

Defined in Text.CSV.Lazy.ByteString

Methods

(==) :: CSVError -> CSVError -> Bool #

(/=) :: CSVError -> CSVError -> Bool #

Eq TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TyVarBndr -> TyVarBndr -> Bool #

(/=) :: TyVarBndr -> TyVarBndr -> Bool #

Eq LabelPosition 
Instance details

Defined in Plots.Axis.Render

Methods

(==) :: LabelPosition -> LabelPosition -> Bool #

(/=) :: LabelPosition -> LabelPosition -> Bool #

Eq Name 
Instance details

Defined in Diagrams.Core.Names

Methods

(==) :: Name -> Name -> Bool #

(/=) :: Name -> Name -> Bool #

Eq TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

(==) :: TicksAlignment -> TicksAlignment -> Bool #

(/=) :: TicksAlignment -> TicksAlignment -> Bool #

Eq AxisLineType 
Instance details

Defined in Plots.Axis.Line

Methods

(==) :: AxisLineType -> AxisLineType -> Bool #

(/=) :: AxisLineType -> AxisLineType -> Bool #

Eq Orientation 
Instance details

Defined in Plots.Types

Methods

(==) :: Orientation -> Orientation -> Bool #

(/=) :: Orientation -> Orientation -> Bool #

Eq Placement 
Instance details

Defined in Plots.Types

Methods

(==) :: Placement -> Placement -> Bool #

(/=) :: Placement -> Placement -> Bool #

Eq LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: LogScale -> LogScale -> Bool #

(/=) :: LogScale -> LogScale -> Bool #

Eq Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

(==) :: Doc -> Doc -> Bool #

(/=) :: Doc -> Doc -> Bool #

Eq TextDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: TextDetails -> TextDetails -> Bool #

(/=) :: TextDetails -> TextDetails -> Bool #

Eq Style 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Style -> Style -> Bool #

(/=) :: Style -> Style -> Bool #

Eq Mode 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Mode -> Mode -> Bool #

(/=) :: Mode -> Mode -> Bool #

Eq ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

(==) :: ByteArray -> ByteArray -> Bool #

(/=) :: ByteArray -> ByteArray -> Bool #

Eq Addr 
Instance details

Defined in Data.Primitive.Types

Methods

(==) :: Addr -> Addr -> Bool #

(/=) :: Addr -> Addr -> Bool #

Eq FilePath 
Instance details

Defined in Filesystem.Path.Internal

Methods

(==) :: FilePath -> FilePath -> Bool #

(/=) :: FilePath -> FilePath -> Bool #

Eq Root 
Instance details

Defined in Filesystem.Path.Internal

Methods

(==) :: Root -> Root -> Bool #

(/=) :: Root -> Root -> Bool #

Eq ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: ModName -> ModName -> Bool #

(/=) :: ModName -> ModName -> Bool #

Eq PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PkgName -> PkgName -> Bool #

(/=) :: PkgName -> PkgName -> Bool #

Eq Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Module -> Module -> Bool #

(/=) :: Module -> Module -> Bool #

Eq OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: OccName -> OccName -> Bool #

(/=) :: OccName -> OccName -> Bool #

Eq NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: NameFlavour -> NameFlavour -> Bool #

(/=) :: NameFlavour -> NameFlavour -> Bool #

Eq NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: NameSpace -> NameSpace -> Bool #

(/=) :: NameSpace -> NameSpace -> Bool #

Eq Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Loc -> Loc -> Bool #

(/=) :: Loc -> Loc -> Bool #

Eq Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Info -> Info -> Bool #

(/=) :: Info -> Info -> Bool #

Eq ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: ModuleInfo -> ModuleInfo -> Bool #

(/=) :: ModuleInfo -> ModuleInfo -> Bool #

Eq Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Fixity -> Fixity -> Bool #

(/=) :: Fixity -> Fixity -> Bool #

Eq FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FixityDirection -> FixityDirection -> Bool #

(/=) :: FixityDirection -> FixityDirection -> Bool #

Eq Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Lit -> Lit -> Bool #

(/=) :: Lit -> Lit -> Bool #

Eq Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Body -> Body -> Bool #

(/=) :: Body -> Body -> Bool #

Eq Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Guard -> Guard -> Bool #

(/=) :: Guard -> Guard -> Bool #

Eq Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Stmt -> Stmt -> Bool #

(/=) :: Stmt -> Stmt -> Bool #

Eq Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Range -> Range -> Bool #

(/=) :: Range -> Range -> Bool #

Eq DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DerivClause -> DerivClause -> Bool #

(/=) :: DerivClause -> DerivClause -> Bool #

Eq TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

Eq TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TySynEqn -> TySynEqn -> Bool #

(/=) :: TySynEqn -> TySynEqn -> Bool #

Eq Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Foreign -> Foreign -> Bool #

(/=) :: Foreign -> Foreign -> Bool #

Eq Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Callconv -> Callconv -> Bool #

(/=) :: Callconv -> Callconv -> Bool #

Eq Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Safety -> Safety -> Bool #

(/=) :: Safety -> Safety -> Bool #

Eq Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Pragma -> Pragma -> Bool #

(/=) :: Pragma -> Pragma -> Bool #

Eq Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Inline -> Inline -> Bool #

(/=) :: Inline -> Inline -> Bool #

Eq RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: RuleMatch -> RuleMatch -> Bool #

(/=) :: RuleMatch -> RuleMatch -> Bool #

Eq Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Phases -> Phases -> Bool #

(/=) :: Phases -> Phases -> Bool #

Eq RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: RuleBndr -> RuleBndr -> Bool #

(/=) :: RuleBndr -> RuleBndr -> Bool #

Eq AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: AnnTarget -> AnnTarget -> Bool #

(/=) :: AnnTarget -> AnnTarget -> Bool #

Eq SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

Eq SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: SourceStrictness -> SourceStrictness -> Bool #

(/=) :: SourceStrictness -> SourceStrictness -> Bool #

Eq DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DecidedStrictness -> DecidedStrictness -> Bool #

(/=) :: DecidedStrictness -> DecidedStrictness -> Bool #

Eq Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Bang -> Bang -> Bool #

(/=) :: Bang -> Bang -> Bool #

Eq PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PatSynDir -> PatSynDir -> Bool #

(/=) :: PatSynDir -> PatSynDir -> Bool #

Eq PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PatSynArgs -> PatSynArgs -> Bool #

(/=) :: PatSynArgs -> PatSynArgs -> Bool #

Eq FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FamilyResultSig -> FamilyResultSig -> Bool #

(/=) :: FamilyResultSig -> FamilyResultSig -> Bool #

Eq TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TyLit -> TyLit -> Bool #

(/=) :: TyLit -> TyLit -> Bool #

Eq Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Role -> Role -> Bool #

(/=) :: Role -> Role -> Bool #

Eq AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: AnnLookup -> AnnLookup -> Bool #

(/=) :: AnnLookup -> AnnLookup -> Bool #

Eq DatatypeInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: DatatypeInfo -> DatatypeInfo -> Bool #

(/=) :: DatatypeInfo -> DatatypeInfo -> Bool #

Eq DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: DatatypeVariant -> DatatypeVariant -> Bool #

(/=) :: DatatypeVariant -> DatatypeVariant -> Bool #

Eq ConstructorInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: ConstructorInfo -> ConstructorInfo -> Bool #

(/=) :: ConstructorInfo -> ConstructorInfo -> Bool #

Eq ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: ConstructorVariant -> ConstructorVariant -> Bool #

(/=) :: ConstructorVariant -> ConstructorVariant -> Bool #

Eq FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: FieldStrictness -> FieldStrictness -> Bool #

(/=) :: FieldStrictness -> FieldStrictness -> Bool #

Eq Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: Unpackedness -> Unpackedness -> Bool #

(/=) :: Unpackedness -> Unpackedness -> Bool #

Eq Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: Strictness -> Strictness -> Bool #

(/=) :: Strictness -> Strictness -> Bool #

Eq TimeOfDay 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

(==) :: TimeOfDay -> TimeOfDay -> Bool #

(/=) :: TimeOfDay -> TimeOfDay -> Bool #

Eq TimeZone 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

(==) :: TimeZone -> TimeZone -> Bool #

(/=) :: TimeZone -> TimeZone -> Bool #

Eq UniversalTime 
Instance details

Defined in Data.Time.Clock.Internal.UniversalTime

Methods

(==) :: UniversalTime -> UniversalTime -> Bool #

(/=) :: UniversalTime -> UniversalTime -> Bool #

Eq NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(==) :: NominalDiffTime -> NominalDiffTime -> Bool #

(/=) :: NominalDiffTime -> NominalDiffTime -> Bool #

Eq AbsoluteTime 
Instance details

Defined in Data.Time.Clock.Internal.AbsoluteTime

Methods

(==) :: AbsoluteTime -> AbsoluteTime -> Bool #

(/=) :: AbsoluteTime -> AbsoluteTime -> Bool #

Eq DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(==) :: DiffTime -> DiffTime -> Bool #

(/=) :: DiffTime -> DiffTime -> Bool #

Eq Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

(==) :: Day -> Day -> Bool #

(/=) :: Day -> Day -> Bool #

Eq MatrixOrder 
Instance details

Defined in Internal.Matrix

Methods

(==) :: MatrixOrder -> MatrixOrder -> Bool #

(/=) :: MatrixOrder -> MatrixOrder -> Bool #

Eq Seed 
Instance details

Defined in System.Random.MWC

Methods

(==) :: Seed -> Seed -> Bool #

(/=) :: Seed -> Seed -> Bool #

Eq Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(==) :: Cairo -> Cairo -> Bool #

(/=) :: Cairo -> Cairo -> Bool #

Eq OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(==) :: OutputType -> OutputType -> Bool #

(/=) :: OutputType -> OutputType -> Bool #

Eq AName 
Instance details

Defined in Diagrams.Core.Names

Methods

(==) :: AName -> AName -> Bool #

(/=) :: AName -> AName -> Bool #

Eq FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(==) :: FillRule -> FillRule -> Bool #

(/=) :: FillRule -> FillRule -> Bool #

Eq Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Methods

(==) :: Points -> Points -> Bool #

(/=) :: Points -> Points -> Bool #

Eq Value 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: Value -> Value -> Bool #

(/=) :: Value -> Value -> Bool #

Eq JSONPathElement 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: JSONPathElement -> JSONPathElement -> Bool #

(/=) :: JSONPathElement -> JSONPathElement -> Bool #

Eq Scientific 
Instance details

Defined in Data.Scientific

Methods

(==) :: Scientific -> Scientific -> Bool #

(/=) :: Scientific -> Scientific -> Bool #

Eq KBNSum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KBNSum -> KBNSum -> Bool #

(/=) :: KBNSum -> KBNSum -> Bool #

Eq Font 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: Font -> Font -> Bool #

(/=) :: Font -> Font -> Bool #

Eq FontFace 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontFace -> FontFace -> Bool #

(/=) :: FontFace -> FontFace -> Bool #

Eq FontFamily 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontFamily -> FontFamily -> Bool #

(/=) :: FontFamily -> FontFamily -> Bool #

Eq FontMap 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontMap -> FontMap -> Bool #

(/=) :: FontMap -> FontMap -> Bool #

Eq Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(==) :: Crossings -> Crossings -> Bool #

(/=) :: Crossings -> Crossings -> Bool #

Eq More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(==) :: More -> More -> Bool #

(/=) :: More -> More -> Bool #

Eq Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(==) :: Pos -> Pos -> Bool #

(/=) :: Pos -> Pos -> Bool #

Eq FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Eq FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Eq PixelRGBA8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(/=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

Eq PixelRGB8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGB8 -> PixelRGB8 -> Bool #

(/=) :: PixelRGB8 -> PixelRGB8 -> Bool #

Eq PixelCMYK16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(/=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

Eq PixelCMYK8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(/=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

Eq PixelRGB16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGB16 -> PixelRGB16 -> Bool #

(/=) :: PixelRGB16 -> PixelRGB16 -> Bool #

Eq PixelRGBA16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(/=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

Eq PixelYA16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYA16 -> PixelYA16 -> Bool #

(/=) :: PixelYA16 -> PixelYA16 -> Bool #

Eq PixelYA8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYA8 -> PixelYA8 -> Bool #

(/=) :: PixelYA8 -> PixelYA8 -> Bool #

Eq PixelYCbCr8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(/=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

Eq PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBF -> PixelRGBF -> Bool #

(/=) :: PixelRGBF -> PixelRGBF -> Bool #

Eq PixelYCbCrK8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(/=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

Eq Font 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: Font -> Font -> Bool #

(/=) :: Font -> Font -> Bool #

Eq LinePass 
Instance details

Defined in Linear.Plucker

Methods

(==) :: LinePass -> LinePass -> Bool #

(/=) :: LinePass -> LinePass -> Bool #

Eq CompressionLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: CompressionLevel -> CompressionLevel -> Bool #

(/=) :: CompressionLevel -> CompressionLevel -> Bool #

Eq CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: CompressionStrategy -> CompressionStrategy -> Bool #

(/=) :: CompressionStrategy -> CompressionStrategy -> Bool #

Eq DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: DictionaryHash -> DictionaryHash -> Bool #

(/=) :: DictionaryHash -> DictionaryHash -> Bool #

Eq Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: Format -> Format -> Bool #

(/=) :: Format -> Format -> Bool #

Eq MemoryLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: MemoryLevel -> MemoryLevel -> Bool #

(/=) :: MemoryLevel -> MemoryLevel -> Bool #

Eq Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: Method -> Method -> Bool #

(/=) :: Method -> Method -> Bool #

Eq WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: WindowBits -> WindowBits -> Bool #

(/=) :: WindowBits -> WindowBits -> Bool #

Eq DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: DotNetTime -> DotNetTime -> Bool #

(/=) :: DotNetTime -> DotNetTime -> Bool #

Eq SumEncoding 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: SumEncoding -> SumEncoding -> Bool #

(/=) :: SumEncoding -> SumEncoding -> Bool #

Eq KB2Sum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KB2Sum -> KB2Sum -> Bool #

(/=) :: KB2Sum -> KB2Sum -> Bool #

Eq KahanSum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KahanSum -> KahanSum -> Bool #

(/=) :: KahanSum -> KahanSum -> Bool #

Eq UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

(==) :: UUID -> UUID -> Bool #

(/=) :: UUID -> UUID -> Bool #

Eq UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

(==) :: UnpackedUUID -> UnpackedUUID -> Bool #

(/=) :: UnpackedUUID -> UnpackedUUID -> Bool #

Eq FontSet 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontSet -> FontSet -> Bool #

(/=) :: FontSet -> FontSet -> Bool #

Eq PangoContext 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: PangoContext -> PangoContext -> Bool #

(/=) :: PangoContext -> PangoContext -> Bool #

Eq PangoLayoutRaw 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(/=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

Eq NCon 
Instance details

Defined in Control.Lens.Internal.PrismTH

Methods

(==) :: NCon -> NCon -> Bool #

(/=) :: NCon -> NCon -> Bool #

Eq LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(==) :: LogFloat -> LogFloat -> Bool #

(/=) :: LogFloat -> LogFloat -> Bool #

Eq ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==) :: ConstVal -> ConstVal -> Bool #

(/=) :: ConstVal -> ConstVal -> Bool #

Eq BimapException 
Instance details

Defined in Data.Bimap

Methods

(==) :: BimapException -> BimapException -> Bool #

(/=) :: BimapException -> BimapException -> Bool #

Eq Type # 
Instance details

Defined in Data.Expression

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Eq LVal # 
Instance details

Defined in Data.Expression

Methods

(==) :: LVal -> LVal -> Bool #

(/=) :: LVal -> LVal -> Bool #

Eq DExpr # 
Instance details

Defined in Data.Expression

Methods

(==) :: DExpr -> DExpr -> Bool #

(/=) :: DExpr -> DExpr -> Bool #

Eq NodeRef # 
Instance details

Defined in Data.Expression

Methods

(==) :: NodeRef -> NodeRef -> Bool #

(/=) :: NodeRef -> NodeRef -> Bool #

Eq Id # 
Instance details

Defined in Data.Expression

Methods

(==) :: Id -> Id -> Bool #

(/=) :: Id -> Id -> Bool #

Eq a => Eq [a] 
Instance details

Defined in GHC.Classes

Methods

(==) :: [a] -> [a] -> Bool #

(/=) :: [a] -> [a] -> Bool #

Eq a => Eq (Maybe a) 
Instance details

Defined in GHC.Base

Methods

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

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

Eq a => Eq (Ratio a) 
Instance details

Defined in GHC.Real

Methods

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

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

Eq (StablePtr a)

Since: base-2.1

Instance details

Defined in GHC.Stable

Methods

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

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

Eq (Ptr a) 
Instance details

Defined in GHC.Ptr

Methods

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

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

Eq (FunPtr a) 
Instance details

Defined in GHC.Ptr

Methods

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

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

Eq p => Eq (Par1 p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: Par1 p -> Par1 p -> Bool #

(/=) :: Par1 p -> Par1 p -> Bool #

Eq a => Eq (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

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

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

Eq a => Eq (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Eq a => Eq (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

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

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

Eq a => Eq (Complex a) 
Instance details

Defined in Data.Complex

Methods

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

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

Eq a => Eq (Min a) 
Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (Max a) 
Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (First a) 
Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (Last a) 
Instance details

Defined in Data.Semigroup

Methods

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

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

Eq m => Eq (WrappedMonoid m) 
Instance details

Defined in Data.Semigroup

Methods

(==) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

Eq a => Eq (Option a) 
Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (ZipList a) 
Instance details

Defined in Control.Applicative

Methods

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

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

Eq a => Eq (First a) 
Instance details

Defined in Data.Monoid

Methods

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

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

Eq a => Eq (Last a) 
Instance details

Defined in Data.Monoid

Methods

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

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

Eq a => Eq (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

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

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

Eq a => Eq (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

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

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

Eq a => Eq (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

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

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

Eq a => Eq (Down a) 
Instance details

Defined in Data.Ord

Methods

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

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

Eq a => Eq (NonEmpty a) 
Instance details

Defined in GHC.Base

Methods

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

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

(PrimType ty, Eq ty) => Eq (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

(==) :: UArray ty -> UArray ty -> Bool #

(/=) :: UArray ty -> UArray ty -> Bool #

(PrimType ty, Eq ty) => Eq (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

(==) :: Block ty -> Block ty -> Bool #

(/=) :: Block ty -> Block ty -> Bool #

Eq a => Eq (NonEmpty a) 
Instance details

Defined in Basement.NonEmpty

Methods

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

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

Eq (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: Offset ty -> Offset ty -> Bool #

(/=) :: Offset ty -> Offset ty -> Bool #

Eq (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: CountOf ty -> CountOf ty -> Bool #

(/=) :: CountOf ty -> CountOf ty -> Bool #

Eq a => Eq (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

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

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

Eq vertex => Eq (SCC vertex)

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

(==) :: SCC vertex -> SCC vertex -> Bool #

(/=) :: SCC vertex -> SCC vertex -> Bool #

Eq a => Eq (Tree a) 
Instance details

Defined in Data.Tree

Methods

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

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

Eq a => Eq (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

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

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

Eq a => Eq (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

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

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

Eq a => Eq (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

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

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

Eq a => Eq (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

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

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

Eq a => Eq (DList a) 
Instance details

Defined in Data.DList

Methods

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

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

Eq n => Eq (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

(==) :: Angle n -> Angle n -> Bool #

(/=) :: Angle n -> Angle n -> Bool #

Eq a => Eq (V3 a) 
Instance details

Defined in Linear.V3

Methods

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

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

Eq a => Eq (V2 a) 
Instance details

Defined in Linear.V2

Methods

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

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

Eq n => Eq (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: Extending n -> Extending n -> Bool #

(/=) :: Extending n -> Extending n -> Bool #

Eq (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

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

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

Eq a => Eq (AnnotDetails a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

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

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

Eq a => Eq (Span a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

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

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

Eq a => Eq (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

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

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

(Storable a, Eq a) => Eq (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

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

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

Eq a => Eq (Vector a) 
Instance details

Defined in Data.Vector

Methods

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

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

Eq a => Eq (Root a) 
Instance details

Defined in Numeric.RootFinding

Methods

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

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

(Prim a, Eq a) => Eq (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

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

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

Eq n => Eq (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

(==) :: VarInt n -> VarInt n -> Bool #

(/=) :: VarInt n -> VarInt n -> Bool #

Eq a => Eq (Log a) 
Instance details

Defined in Numeric.Log

Methods

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

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

Eq a => Eq (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

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

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

Eq t => Eq (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(==) :: TransInv t -> TransInv t -> Bool #

(/=) :: TransInv t -> TransInv t -> Bool #

(Eq (V a (N a)), Eq a) => Eq (Located a) 
Instance details

Defined in Diagrams.Located

Methods

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

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

Eq n => Eq (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

(==) :: PolyOrientation n -> PolyOrientation n -> Bool #

(/=) :: PolyOrientation n -> PolyOrientation n -> Bool #

Eq n => Eq (Time n) 
Instance details

Defined in Data.Active

Methods

(==) :: Time n -> Time n -> Bool #

(/=) :: Time n -> Time n -> Bool #

Eq a => Eq (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

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

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

Eq a => Eq (V1 a) 
Instance details

Defined in Linear.V1

Methods

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

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

Eq n => Eq (Duration n) 
Instance details

Defined in Data.Active

Methods

(==) :: Duration n -> Duration n -> Bool #

(/=) :: Duration n -> Duration n -> Bool #

Eq a => Eq (V4 a) 
Instance details

Defined in Linear.V4

Methods

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

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

Eq a => Eq (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

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

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

Eq a => Eq (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

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

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

Eq (V0 a) 
Instance details

Defined in Linear.V0

Methods

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

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

Eq a => Eq (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

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

Eq a => Eq (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

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

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

Eq t => Eq (P t) # 
Instance details

Defined in Data.Program

Methods

(==) :: P t -> P t -> Bool #

(/=) :: P t -> P t -> Bool #

Eq (Digest a) 
Instance details

Defined in Crypto.Hash.Types

Methods

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

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

Eq a => Eq (Hashed a) 
Instance details

Defined in Data.Hashable.Class

Methods

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

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

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

Defined in Data.Either

Methods

(==) :: Either a b -> Either a b -> Bool #

(/=) :: Either a b -> Either a b -> Bool #

Eq (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: V1 p -> V1 p -> Bool #

(/=) :: V1 p -> V1 p -> Bool #

Eq (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: U1 p -> U1 p -> Bool #

(/=) :: U1 p -> U1 p -> Bool #

Eq (TypeRep a)

Since: base-2.1

Instance details

Defined in Data.Typeable.Internal

Methods

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

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

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

Defined in GHC.Classes

Methods

(==) :: (a, b) -> (a, b) -> Bool #

(/=) :: (a, b) -> (a, b) -> Bool #

(Eq i, Eq a) => Eq (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(==) :: Level i a -> Level i a -> Bool #

(/=) :: Level i a -> Level i a -> Bool #

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

Defined in Data.Map.Internal

Methods

(==) :: Map k a -> Map k a -> Bool #

(/=) :: Map k a -> Map k a -> Bool #

Eq (IOUArray i e) 
Instance details

Defined in Data.Array.IO.Internals

Methods

(==) :: IOUArray i e -> IOUArray i e -> Bool #

(/=) :: IOUArray i e -> IOUArray i e -> Bool #

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

Defined in Data.Array.Base

Methods

(==) :: UArray ix e -> UArray ix e -> Bool #

(/=) :: UArray ix e -> UArray ix e -> Bool #

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

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

(==) :: Array i e -> Array i e -> Bool #

(/=) :: Array i e -> Array i e -> Bool #

Eq (IOArray i e)

Since: base-4.1.0.0

Instance details

Defined in GHC.IOArray

Methods

(==) :: IOArray i e -> IOArray i e -> Bool #

(/=) :: IOArray i e -> IOArray i e -> Bool #

Eq a => Eq (Arg a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(==) :: Arg a b -> Arg a b -> Bool #

(/=) :: Arg a b -> Arg a b -> Bool #

Eq (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(==) :: Proxy s -> Proxy s -> Bool #

(/=) :: Proxy s -> Proxy s -> Bool #

(Eq1 m, Eq a) => Eq (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(==) :: MaybeT m a -> MaybeT m a -> Bool #

(/=) :: MaybeT m a -> MaybeT m a -> Bool #

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

Defined in Data.FingerTree

Methods

(==) :: ViewL s a -> ViewL s a -> Bool #

(/=) :: ViewL s a -> ViewL s a -> Bool #

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

Defined in Data.FingerTree

Methods

(==) :: ViewR s a -> ViewR s a -> Bool #

(/=) :: ViewR s a -> ViewR s a -> Bool #

Eq a => Eq (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: FingerTree v a -> FingerTree v a -> Bool #

(/=) :: FingerTree v a -> FingerTree v a -> Bool #

Eq a => Eq (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: SearchResult v a -> SearchResult v a -> Bool #

(/=) :: SearchResult v a -> SearchResult v a -> Bool #

(Eq1 m, Eq a) => Eq (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(==) :: ListT m a -> ListT m a -> Bool #

(/=) :: ListT m a -> ListT m a -> Bool #

Eq (v n) => Eq (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: Trail v n -> Trail v n -> Bool #

(/=) :: Trail v n -> Trail v n -> Bool #

Eq (v n) => Eq (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(==) :: BoundingBox v n -> BoundingBox v n -> Bool #

(/=) :: BoundingBox v n -> BoundingBox v n -> Bool #

Eq (v n) => Eq (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

(==) :: Path v n -> Path v n -> Bool #

(/=) :: Path v n -> Path v n -> Bool #

Eq (f a) => Eq (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(==) :: Point f a -> Point f a -> Bool #

(/=) :: Point f a -> Point f a -> Bool #

Eq (MutableArray s a) 
Instance details

Defined in Data.Primitive.Array

Methods

(==) :: MutableArray s a -> MutableArray s a -> Bool #

(/=) :: MutableArray s a -> MutableArray s a -> Bool #

(Eq t, KnownNat m) => Eq (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

(==) :: Mod m t -> Mod m t -> Bool #

(/=) :: Mod m t -> Mod m t -> Bool #

(Ix i, Show i, Eq e) => Eq (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(==) :: AbstractArray i e -> AbstractArray i e -> Bool #

(/=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(Eq p, Eq a) => Eq (Categorical p a) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(==) :: Categorical p a -> Categorical p a -> Bool #

(/=) :: Categorical p a -> Categorical p a -> Bool #

(Eq k, Eq v) => Eq (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(==) :: HashMap k v -> HashMap k v -> Bool #

(/=) :: HashMap k v -> HashMap k v -> Bool #

(Eq k, Eq v) => Eq (Leaf k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(==) :: Leaf k v -> Leaf k v -> Bool #

(/=) :: Leaf k v -> Leaf k v -> Bool #

Eq (v n) => Eq (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: SegTree v n -> SegTree v n -> Bool #

(/=) :: SegTree v n -> SegTree v n -> Bool #

(Eq1 f, Eq a) => Eq (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(==) :: Cofree f a -> Cofree f a -> Bool #

(/=) :: Cofree f a -> Cofree f a -> Bool #

Eq (v n) => Eq (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

(==) :: Direction v n -> Direction v n -> Bool #

(/=) :: Direction v n -> Direction v n -> Bool #

Eq (v n) => Eq (NonEmptyBoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(==) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> Bool #

(/=) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> Bool #

(Eq a, Eq b) => Eq (a :& b) 
Instance details

Defined in Diagrams.Coordinates

Methods

(==) :: (a :& b) -> (a :& b) -> Bool #

(/=) :: (a :& b) -> (a :& b) -> Bool #

(Eq1 f, Eq a) => Eq (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

(==) :: Free f a -> Free f a -> Bool #

(/=) :: Free f a -> Free f a -> Bool #

(Eq1 f, Eq a) => Eq (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(==) :: Yoneda f a -> Yoneda f a -> Bool #

(/=) :: Yoneda f a -> Yoneda f a -> Bool #

(Eq a, Eq b) => Eq (Bimap a b) 
Instance details

Defined in Data.Bimap

Methods

(==) :: Bimap a b -> Bimap a b -> Bool #

(/=) :: Bimap a b -> Bimap a b -> Bool #

Eq (f p) => Eq (Rec1 f p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: Rec1 f p -> Rec1 f p -> Bool #

(/=) :: Rec1 f p -> Rec1 f p -> Bool #

Eq (URec (Ptr ()) p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

Eq (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Char p -> URec Char p -> Bool #

(/=) :: URec Char p -> URec Char p -> Bool #

Eq (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

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

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

Eq (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

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

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

Eq (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

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

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

Eq (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Word p -> URec Word p -> Bool #

(/=) :: URec Word p -> URec Word p -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c) -> (a, b, c) -> Bool #

(/=) :: (a, b, c) -> (a, b, c) -> Bool #

Eq a => Eq (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

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

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

Eq (STUArray s i e) 
Instance details

Defined in Data.Array.Base

Methods

(==) :: STUArray s i e -> STUArray s i e -> Bool #

(/=) :: STUArray s i e -> STUArray s i e -> Bool #

Eq (STArray s i e)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

(==) :: STArray s i e -> STArray s i e -> Bool #

(/=) :: STArray s i e -> STArray s i e -> Bool #

Eq (f a) => Eq (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Alt f a -> Alt f a -> Bool #

(/=) :: Alt f a -> Alt f a -> Bool #

Eq (a :~: b) 
Instance details

Defined in Data.Type.Equality

Methods

(==) :: (a :~: b) -> (a :~: b) -> Bool #

(/=) :: (a :~: b) -> (a :~: b) -> Bool #

(Eq1 f, Eq a) => Eq (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(==) :: IdentityT f a -> IdentityT f a -> Bool #

(/=) :: IdentityT f a -> IdentityT f a -> Bool #

(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(==) :: ExceptT e m a -> ExceptT e m a -> Bool #

(/=) :: ExceptT e m a -> ExceptT e m a -> Bool #

(Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(==) :: ErrorT e m a -> ErrorT e m a -> Bool #

(/=) :: ErrorT e m a -> ErrorT e m a -> Bool #

(Eq1 f, Eq a) => Eq (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

(==) :: Backwards f a -> Backwards f a -> Bool #

(/=) :: Backwards f a -> Backwards f a -> Bool #

(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(==) :: WriterT w m a -> WriterT w m a -> Bool #

(/=) :: WriterT w m a -> WriterT w m a -> Bool #

(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(==) :: WriterT w m a -> WriterT w m a -> Bool #

(/=) :: WriterT w m a -> WriterT w m a -> Bool #

Eq (p a a) => Eq (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

(==) :: Join p a -> Join p a -> Bool #

(/=) :: Join p a -> Join p a -> Bool #

Eq b => Eq (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

(==) :: Tagged s b -> Tagged s b -> Bool #

(/=) :: Tagged s b -> Tagged s b -> Bool #

Eq (v n) => Eq (Segment c v n) 
Instance details

Defined in Diagrams.Segment

Methods

(==) :: Segment c v n -> Segment c v n -> Bool #

(/=) :: Segment c v n -> Segment c v n -> Bool #

Eq (v n) => Eq (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: Trail' l v n -> Trail' l v n -> Bool #

(/=) :: Trail' l v n -> Trail' l v n -> Bool #

Eq (v n) => Eq (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

(==) :: Offset c v n -> Offset c v n -> Bool #

(/=) :: Offset c v n -> Offset c v n -> Bool #

Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(==) :: CofreeT f w a -> CofreeT f w a -> Bool #

(/=) :: CofreeT f w a -> CofreeT f w a -> Bool #

(Eq a, Eq (f b)) => Eq (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(==) :: CofreeF f a b -> CofreeF f a b -> Bool #

(/=) :: CofreeF f a b -> CofreeF f a b -> Bool #

Eq (p (Fix p a) a) => Eq (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

(==) :: Fix p a -> Fix p a -> Bool #

(/=) :: Fix p a -> Fix p a -> Bool #

(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(==) :: FreeT f m a -> FreeT f m a -> Bool #

(/=) :: FreeT f m a -> FreeT f m a -> Bool #

(Eq a, Eq (f b)) => Eq (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(==) :: FreeF f a b -> FreeF f a b -> Bool #

(/=) :: FreeF f a b -> FreeF f a b -> Bool #

Eq a => Eq (V n a) 
Instance details

Defined in Linear.V

Methods

(==) :: V n a -> V n a -> Bool #

(/=) :: V n a -> V n a -> Bool #

Eq c => Eq (K1 i c p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: K1 i c p -> K1 i c p -> Bool #

(/=) :: K1 i c p -> K1 i c p -> Bool #

(Eq (f p), Eq (g p)) => Eq ((f :+: g) p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: (f :+: g) p -> (f :+: g) p -> Bool #

(/=) :: (f :+: g) p -> (f :+: g) p -> Bool #

(Eq (f p), Eq (g p)) => Eq ((f :*: g) p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: (f :*: g) p -> (f :*: g) p -> Bool #

(/=) :: (f :*: g) p -> (f :*: g) p -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(==) :: Product f g a -> Product f g a -> Bool #

(/=) :: Product f g a -> Product f g a -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

(==) :: Sum f g a -> Sum f g a -> Bool #

(/=) :: Sum f g a -> Sum f g a -> Bool #

Eq (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

(==) :: (a :~~: b) -> (a :~~: b) -> Bool #

(/=) :: (a :~~: b) -> (a :~~: b) -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTreeU d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTreeU d u a l -> DUALTreeU d u a l -> Bool #

(/=) :: DUALTreeU d u a l -> DUALTreeU d u a l -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTree d u a l -> DUALTree d u a l -> Bool #

(/=) :: DUALTree d u a l -> DUALTree d u a l -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTreeNE d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> Bool #

(/=) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> Bool #

Eq (f p) => Eq (M1 i c f p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: M1 i c f p -> M1 i c f p -> Bool #

(/=) :: M1 i c f p -> M1 i c f p -> Bool #

Eq (f (g p)) => Eq ((f :.: g) p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: (f :.: g) p -> (f :.: g) p -> Bool #

(/=) :: (f :.: g) p -> (f :.: g) p -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

(==) :: Compose f g a -> Compose f g a -> Bool #

(/=) :: Compose f g a -> Compose f g a -> Bool #

Eq (f a) => Eq (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

(==) :: Clown f a b -> Clown f a b -> Bool #

(/=) :: Clown f a b -> Clown f a b -> Bool #

Eq (p b a) => Eq (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

(==) :: Flip p a b -> Flip p a b -> Bool #

(/=) :: Flip p a b -> Flip p a b -> Bool #

Eq (g b) => Eq (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

(==) :: Joker g a b -> Joker g a b -> Bool #

(/=) :: Joker g a b -> Joker g a b -> Bool #

Eq (p a b) => Eq (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

(==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(/=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(Eq (f a b), Eq (g a b)) => Eq (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

(==) :: Product f g a b -> Product f g a b -> Bool #

(/=) :: Product f g a b -> Product f g a b -> Bool #

(Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

(==) :: Sum p q a b -> Sum p q a b -> Bool #

(/=) :: Sum p q a b -> Sum p q a b -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(/=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

Eq (f (p a b)) => Eq (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

(==) :: Tannen f p a b -> Tannen f p a b -> Bool #

(/=) :: Tannen f p a b -> Tannen f p a b -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

Eq (p (f a) (g b)) => Eq (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

(==) :: Biff p f g a b -> Biff p f g a b -> Bool #

(/=) :: Biff p f g a b -> Biff p f g a b -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

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

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

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

Defined in GHC.Classes

Methods

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

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

class Fractional a => Floating a where #

Trigonometric and hyperbolic functions and related functions.

Minimal complete definition

pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh

Methods

pi :: a #

exp :: a -> a #

log :: a -> a #

sqrt :: a -> a #

(**) :: a -> a -> a infixr 8 #

logBase :: a -> a -> a #

sin :: a -> a #

cos :: a -> a #

tan :: a -> a #

asin :: a -> a #

acos :: a -> a #

atan :: a -> a #

sinh :: a -> a #

cosh :: a -> a #

tanh :: a -> a #

asinh :: a -> a #

acosh :: a -> a #

atanh :: a -> a #

Instances
Floating Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Double #

exp :: Double -> Double #

log :: Double -> Double #

sqrt :: Double -> Double #

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

logBase :: Double -> Double -> Double #

sin :: Double -> Double #

cos :: Double -> Double #

tan :: Double -> Double #

asin :: Double -> Double #

acos :: Double -> Double #

atan :: Double -> Double #

sinh :: Double -> Double #

cosh :: Double -> Double #

tanh :: Double -> Double #

asinh :: Double -> Double #

acosh :: Double -> Double #

atanh :: Double -> Double #

log1p :: Double -> Double #

expm1 :: Double -> Double #

log1pexp :: Double -> Double #

log1mexp :: Double -> Double #

Floating Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Float #

exp :: Float -> Float #

log :: Float -> Float #

sqrt :: Float -> Float #

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

logBase :: Float -> Float -> Float #

sin :: Float -> Float #

cos :: Float -> Float #

tan :: Float -> Float #

asin :: Float -> Float #

acos :: Float -> Float #

atan :: Float -> Float #

sinh :: Float -> Float #

cosh :: Float -> Float #

tanh :: Float -> Float #

asinh :: Float -> Float #

acosh :: Float -> Float #

atanh :: Float -> Float #

log1p :: Float -> Float #

expm1 :: Float -> Float #

log1pexp :: Float -> Float #

log1mexp :: Float -> Float #

Floating Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: Percent #

exp :: Percent -> Percent #

log :: Percent -> Percent #

sqrt :: Percent -> Percent #

(**) :: Percent -> Percent -> Percent #

logBase :: Percent -> Percent -> Percent #

sin :: Percent -> Percent #

cos :: Percent -> Percent #

tan :: Percent -> Percent #

asin :: Percent -> Percent #

acos :: Percent -> Percent #

atan :: Percent -> Percent #

sinh :: Percent -> Percent #

cosh :: Percent -> Percent #

tanh :: Percent -> Percent #

asinh :: Percent -> Percent #

acosh :: Percent -> Percent #

atanh :: Percent -> Percent #

log1p :: Percent -> Percent #

expm1 :: Percent -> Percent #

log1pexp :: Percent -> Percent #

log1mexp :: Percent -> Percent #

Floating LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: LogValue #

exp :: LogValue -> LogValue #

log :: LogValue -> LogValue #

sqrt :: LogValue -> LogValue #

(**) :: LogValue -> LogValue -> LogValue #

logBase :: LogValue -> LogValue -> LogValue #

sin :: LogValue -> LogValue #

cos :: LogValue -> LogValue #

tan :: LogValue -> LogValue #

asin :: LogValue -> LogValue #

acos :: LogValue -> LogValue #

atan :: LogValue -> LogValue #

sinh :: LogValue -> LogValue #

cosh :: LogValue -> LogValue #

tanh :: LogValue -> LogValue #

asinh :: LogValue -> LogValue #

acosh :: LogValue -> LogValue #

atanh :: LogValue -> LogValue #

log1p :: LogValue -> LogValue #

expm1 :: LogValue -> LogValue #

log1pexp :: LogValue -> LogValue #

log1mexp :: LogValue -> LogValue #

Floating CFloat 
Instance details

Defined in Foreign.C.Types

Methods

pi :: CFloat #

exp :: CFloat -> CFloat #

log :: CFloat -> CFloat #

sqrt :: CFloat -> CFloat #

(**) :: CFloat -> CFloat -> CFloat #

logBase :: CFloat -> CFloat -> CFloat #

sin :: CFloat -> CFloat #

cos :: CFloat -> CFloat #

tan :: CFloat -> CFloat #

asin :: CFloat -> CFloat #

acos :: CFloat -> CFloat #

atan :: CFloat -> CFloat #

sinh :: CFloat -> CFloat #

cosh :: CFloat -> CFloat #

tanh :: CFloat -> CFloat #

asinh :: CFloat -> CFloat #

acosh :: CFloat -> CFloat #

atanh :: CFloat -> CFloat #

log1p :: CFloat -> CFloat #

expm1 :: CFloat -> CFloat #

log1pexp :: CFloat -> CFloat #

log1mexp :: CFloat -> CFloat #

Floating CDouble 
Instance details

Defined in Foreign.C.Types

Methods

pi :: CDouble #

exp :: CDouble -> CDouble #

log :: CDouble -> CDouble #

sqrt :: CDouble -> CDouble #

(**) :: CDouble -> CDouble -> CDouble #

logBase :: CDouble -> CDouble -> CDouble #

sin :: CDouble -> CDouble #

cos :: CDouble -> CDouble #

tan :: CDouble -> CDouble #

asin :: CDouble -> CDouble #

acos :: CDouble -> CDouble #

atan :: CDouble -> CDouble #

sinh :: CDouble -> CDouble #

cosh :: CDouble -> CDouble #

tanh :: CDouble -> CDouble #

asinh :: CDouble -> CDouble #

acosh :: CDouble -> CDouble #

atanh :: CDouble -> CDouble #

log1p :: CDouble -> CDouble #

expm1 :: CDouble -> CDouble #

log1pexp :: CDouble -> CDouble #

log1mexp :: CDouble -> CDouble #

Floating ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

pi :: ConstVal #

exp :: ConstVal -> ConstVal #

log :: ConstVal -> ConstVal #

sqrt :: ConstVal -> ConstVal #

(**) :: ConstVal -> ConstVal -> ConstVal #

logBase :: ConstVal -> ConstVal -> ConstVal #

sin :: ConstVal -> ConstVal #

cos :: ConstVal -> ConstVal #

tan :: ConstVal -> ConstVal #

asin :: ConstVal -> ConstVal #

acos :: ConstVal -> ConstVal #

atan :: ConstVal -> ConstVal #

sinh :: ConstVal -> ConstVal #

cosh :: ConstVal -> ConstVal #

tanh :: ConstVal -> ConstVal #

asinh :: ConstVal -> ConstVal #

acosh :: ConstVal -> ConstVal #

atanh :: ConstVal -> ConstVal #

log1p :: ConstVal -> ConstVal #

expm1 :: ConstVal -> ConstVal #

log1pexp :: ConstVal -> ConstVal #

log1mexp :: ConstVal -> ConstVal #

Floating DExpr # 
Instance details

Defined in Data.Expression

Methods

pi :: DExpr #

exp :: DExpr -> DExpr #

log :: DExpr -> DExpr #

sqrt :: DExpr -> DExpr #

(**) :: DExpr -> DExpr -> DExpr #

logBase :: DExpr -> DExpr -> DExpr #

sin :: DExpr -> DExpr #

cos :: DExpr -> DExpr #

tan :: DExpr -> DExpr #

asin :: DExpr -> DExpr #

acos :: DExpr -> DExpr #

atan :: DExpr -> DExpr #

sinh :: DExpr -> DExpr #

cosh :: DExpr -> DExpr #

tanh :: DExpr -> DExpr #

asinh :: DExpr -> DExpr #

acosh :: DExpr -> DExpr #

atanh :: DExpr -> DExpr #

log1p :: DExpr -> DExpr #

expm1 :: DExpr -> DExpr #

log1pexp :: DExpr -> DExpr #

log1mexp :: DExpr -> DExpr #

Floating t => Floating [t] # 
Instance details

Defined in Util

Methods

pi :: [t] #

exp :: [t] -> [t] #

log :: [t] -> [t] #

sqrt :: [t] -> [t] #

(**) :: [t] -> [t] -> [t] #

logBase :: [t] -> [t] -> [t] #

sin :: [t] -> [t] #

cos :: [t] -> [t] #

tan :: [t] -> [t] #

asin :: [t] -> [t] #

acos :: [t] -> [t] #

atan :: [t] -> [t] #

sinh :: [t] -> [t] #

cosh :: [t] -> [t] #

tanh :: [t] -> [t] #

asinh :: [t] -> [t] #

acosh :: [t] -> [t] #

atanh :: [t] -> [t] #

log1p :: [t] -> [t] #

expm1 :: [t] -> [t] #

log1pexp :: [t] -> [t] #

log1mexp :: [t] -> [t] #

Floating a => Floating (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

pi :: Identity a #

exp :: Identity a -> Identity a #

log :: Identity a -> Identity a #

sqrt :: Identity a -> Identity a #

(**) :: Identity a -> Identity a -> Identity a #

logBase :: Identity a -> Identity a -> Identity a #

sin :: Identity a -> Identity a #

cos :: Identity a -> Identity a #

tan :: Identity a -> Identity a #

asin :: Identity a -> Identity a #

acos :: Identity a -> Identity a #

atan :: Identity a -> Identity a #

sinh :: Identity a -> Identity a #

cosh :: Identity a -> Identity a #

tanh :: Identity a -> Identity a #

asinh :: Identity a -> Identity a #

acosh :: Identity a -> Identity a #

atanh :: Identity a -> Identity a #

log1p :: Identity a -> Identity a #

expm1 :: Identity a -> Identity a #

log1pexp :: Identity a -> Identity a #

log1mexp :: Identity a -> Identity a #

RealFloat a => Floating (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

pi :: Complex a #

exp :: Complex a -> Complex a #

log :: Complex a -> Complex a #

sqrt :: Complex a -> Complex a #

(**) :: Complex a -> Complex a -> Complex a #

logBase :: Complex a -> Complex a -> Complex a #

sin :: Complex a -> Complex a #

cos :: Complex a -> Complex a #

tan :: Complex a -> Complex a #

asin :: Complex a -> Complex a #

acos :: Complex a -> Complex a #

atan :: Complex a -> Complex a #

sinh :: Complex a -> Complex a #

cosh :: Complex a -> Complex a #

tanh :: Complex a -> Complex a #

asinh :: Complex a -> Complex a #

acosh :: Complex a -> Complex a #

atanh :: Complex a -> Complex a #

log1p :: Complex a -> Complex a #

expm1 :: Complex a -> Complex a #

log1pexp :: Complex a -> Complex a #

log1mexp :: Complex a -> Complex a #

Floating a => Floating (V3 a) 
Instance details

Defined in Linear.V3

Methods

pi :: V3 a #

exp :: V3 a -> V3 a #

log :: V3 a -> V3 a #

sqrt :: V3 a -> V3 a #

(**) :: V3 a -> V3 a -> V3 a #

logBase :: V3 a -> V3 a -> V3 a #

sin :: V3 a -> V3 a #

cos :: V3 a -> V3 a #

tan :: V3 a -> V3 a #

asin :: V3 a -> V3 a #

acos :: V3 a -> V3 a #

atan :: V3 a -> V3 a #

sinh :: V3 a -> V3 a #

cosh :: V3 a -> V3 a #

tanh :: V3 a -> V3 a #

asinh :: V3 a -> V3 a #

acosh :: V3 a -> V3 a #

atanh :: V3 a -> V3 a #

log1p :: V3 a -> V3 a #

expm1 :: V3 a -> V3 a #

log1pexp :: V3 a -> V3 a #

log1mexp :: V3 a -> V3 a #

Floating a => Floating (V2 a) 
Instance details

Defined in Linear.V2

Methods

pi :: V2 a #

exp :: V2 a -> V2 a #

log :: V2 a -> V2 a #

sqrt :: V2 a -> V2 a #

(**) :: V2 a -> V2 a -> V2 a #

logBase :: V2 a -> V2 a -> V2 a #

sin :: V2 a -> V2 a #

cos :: V2 a -> V2 a #

tan :: V2 a -> V2 a #

asin :: V2 a -> V2 a #

acos :: V2 a -> V2 a #

atan :: V2 a -> V2 a #

sinh :: V2 a -> V2 a #

cosh :: V2 a -> V2 a #

tanh :: V2 a -> V2 a #

asinh :: V2 a -> V2 a #

acosh :: V2 a -> V2 a #

atanh :: V2 a -> V2 a #

log1p :: V2 a -> V2 a #

expm1 :: V2 a -> V2 a #

log1pexp :: V2 a -> V2 a #

log1mexp :: V2 a -> V2 a #

(RealFloat a, Precise a) => Floating (Log a) 
Instance details

Defined in Numeric.Log

Methods

pi :: Log a #

exp :: Log a -> Log a #

log :: Log a -> Log a #

sqrt :: Log a -> Log a #

(**) :: Log a -> Log a -> Log a #

logBase :: Log a -> Log a -> Log a #

sin :: Log a -> Log a #

cos :: Log a -> Log a #

tan :: Log a -> Log a #

asin :: Log a -> Log a #

acos :: Log a -> Log a #

atan :: Log a -> Log a #

sinh :: Log a -> Log a #

cosh :: Log a -> Log a #

tanh :: Log a -> Log a #

asinh :: Log a -> Log a #

acosh :: Log a -> Log a #

atanh :: Log a -> Log a #

log1p :: Log a -> Log a #

expm1 :: Log a -> Log a #

log1pexp :: Log a -> Log a #

log1mexp :: Log a -> Log a #

(RealFloat a, Ord a) => Floating (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

pi :: Interval a #

exp :: Interval a -> Interval a #

log :: Interval a -> Interval a #

sqrt :: Interval a -> Interval a #

(**) :: Interval a -> Interval a -> Interval a #

logBase :: Interval a -> Interval a -> Interval a #

sin :: Interval a -> Interval a #

cos :: Interval a -> Interval a #

tan :: Interval a -> Interval a #

asin :: Interval a -> Interval a #

acos :: Interval a -> Interval a #

atan :: Interval a -> Interval a #

sinh :: Interval a -> Interval a #

cosh :: Interval a -> Interval a #

tanh :: Interval a -> Interval a #

asinh :: Interval a -> Interval a #

acosh :: Interval a -> Interval a #

atanh :: Interval a -> Interval a #

log1p :: Interval a -> Interval a #

expm1 :: Interval a -> Interval a #

log1pexp :: Interval a -> Interval a #

log1mexp :: Interval a -> Interval a #

Floating a => Floating (V1 a) 
Instance details

Defined in Linear.V1

Methods

pi :: V1 a #

exp :: V1 a -> V1 a #

log :: V1 a -> V1 a #

sqrt :: V1 a -> V1 a #

(**) :: V1 a -> V1 a -> V1 a #

logBase :: V1 a -> V1 a -> V1 a #

sin :: V1 a -> V1 a #

cos :: V1 a -> V1 a #

tan :: V1 a -> V1 a #

asin :: V1 a -> V1 a #

acos :: V1 a -> V1 a #

atan :: V1 a -> V1 a #

sinh :: V1 a -> V1 a #

cosh :: V1 a -> V1 a #

tanh :: V1 a -> V1 a #

asinh :: V1 a -> V1 a #

acosh :: V1 a -> V1 a #

atanh :: V1 a -> V1 a #

log1p :: V1 a -> V1 a #

expm1 :: V1 a -> V1 a #

log1pexp :: V1 a -> V1 a #

log1mexp :: V1 a -> V1 a #

Floating a => Floating (V4 a) 
Instance details

Defined in Linear.V4

Methods

pi :: V4 a #

exp :: V4 a -> V4 a #

log :: V4 a -> V4 a #

sqrt :: V4 a -> V4 a #

(**) :: V4 a -> V4 a -> V4 a #

logBase :: V4 a -> V4 a -> V4 a #

sin :: V4 a -> V4 a #

cos :: V4 a -> V4 a #

tan :: V4 a -> V4 a #

asin :: V4 a -> V4 a #

acos :: V4 a -> V4 a #

atan :: V4 a -> V4 a #

sinh :: V4 a -> V4 a #

cosh :: V4 a -> V4 a #

tanh :: V4 a -> V4 a #

asinh :: V4 a -> V4 a #

acosh :: V4 a -> V4 a #

atanh :: V4 a -> V4 a #

log1p :: V4 a -> V4 a #

expm1 :: V4 a -> V4 a #

log1pexp :: V4 a -> V4 a #

log1mexp :: V4 a -> V4 a #

Floating a => Floating (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

pi :: Plucker a #

exp :: Plucker a -> Plucker a #

log :: Plucker a -> Plucker a #

sqrt :: Plucker a -> Plucker a #

(**) :: Plucker a -> Plucker a -> Plucker a #

logBase :: Plucker a -> Plucker a -> Plucker a #

sin :: Plucker a -> Plucker a #

cos :: Plucker a -> Plucker a #

tan :: Plucker a -> Plucker a #

asin :: Plucker a -> Plucker a #

acos :: Plucker a -> Plucker a #

atan :: Plucker a -> Plucker a #

sinh :: Plucker a -> Plucker a #

cosh :: Plucker a -> Plucker a #

tanh :: Plucker a -> Plucker a #

asinh :: Plucker a -> Plucker a #

acosh :: Plucker a -> Plucker a #

atanh :: Plucker a -> Plucker a #

log1p :: Plucker a -> Plucker a #

expm1 :: Plucker a -> Plucker a #

log1pexp :: Plucker a -> Plucker a #

log1mexp :: Plucker a -> Plucker a #

RealFloat a => Floating (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

pi :: Quaternion a #

exp :: Quaternion a -> Quaternion a #

log :: Quaternion a -> Quaternion a #

sqrt :: Quaternion a -> Quaternion a #

(**) :: Quaternion a -> Quaternion a -> Quaternion a #

logBase :: Quaternion a -> Quaternion a -> Quaternion a #

sin :: Quaternion a -> Quaternion a #

cos :: Quaternion a -> Quaternion a #

tan :: Quaternion a -> Quaternion a #

asin :: Quaternion a -> Quaternion a #

acos :: Quaternion a -> Quaternion a #

atan :: Quaternion a -> Quaternion a #

sinh :: Quaternion a -> Quaternion a #

cosh :: Quaternion a -> Quaternion a #

tanh :: Quaternion a -> Quaternion a #

asinh :: Quaternion a -> Quaternion a #

acosh :: Quaternion a -> Quaternion a #

atanh :: Quaternion a -> Quaternion a #

log1p :: Quaternion a -> Quaternion a #

expm1 :: Quaternion a -> Quaternion a #

log1pexp :: Quaternion a -> Quaternion a #

log1mexp :: Quaternion a -> Quaternion a #

Floating (V0 a) 
Instance details

Defined in Linear.V0

Methods

pi :: V0 a #

exp :: V0 a -> V0 a #

log :: V0 a -> V0 a #

sqrt :: V0 a -> V0 a #

(**) :: V0 a -> V0 a -> V0 a #

logBase :: V0 a -> V0 a -> V0 a #

sin :: V0 a -> V0 a #

cos :: V0 a -> V0 a #

tan :: V0 a -> V0 a #

asin :: V0 a -> V0 a #

acos :: V0 a -> V0 a #

atan :: V0 a -> V0 a #

sinh :: V0 a -> V0 a #

cosh :: V0 a -> V0 a #

tanh :: V0 a -> V0 a #

asinh :: V0 a -> V0 a #

acosh :: V0 a -> V0 a #

atanh :: V0 a -> V0 a #

log1p :: V0 a -> V0 a #

expm1 :: V0 a -> V0 a #

log1pexp :: V0 a -> V0 a #

log1mexp :: V0 a -> V0 a #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

Floating a => Floating (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

pi :: Measured n a #

exp :: Measured n a -> Measured n a #

log :: Measured n a -> Measured n a #

sqrt :: Measured n a -> Measured n a #

(**) :: Measured n a -> Measured n a -> Measured n a #

logBase :: Measured n a -> Measured n a -> Measured n a #

sin :: Measured n a -> Measured n a #

cos :: Measured n a -> Measured n a #

tan :: Measured n a -> Measured n a #

asin :: Measured n a -> Measured n a #

acos :: Measured n a -> Measured n a #

atan :: Measured n a -> Measured n a #

sinh :: Measured n a -> Measured n a #

cosh :: Measured n a -> Measured n a #

tanh :: Measured n a -> Measured n a #

asinh :: Measured n a -> Measured n a #

acosh :: Measured n a -> Measured n a #

atanh :: Measured n a -> Measured n a #

log1p :: Measured n a -> Measured n a #

expm1 :: Measured n a -> Measured n a #

log1pexp :: Measured n a -> Measured n a #

log1mexp :: Measured n a -> Measured n a #

Floating a => Floating (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

pi :: Op a b #

exp :: Op a b -> Op a b #

log :: Op a b -> Op a b #

sqrt :: Op a b -> Op a b #

(**) :: Op a b -> Op a b -> Op a b #

logBase :: Op a b -> Op a b -> Op a b #

sin :: Op a b -> Op a b #

cos :: Op a b -> Op a b #

tan :: Op a b -> Op a b #

asin :: Op a b -> Op a b #

acos :: Op a b -> Op a b #

atan :: Op a b -> Op a b #

sinh :: Op a b -> Op a b #

cosh :: Op a b -> Op a b #

tanh :: Op a b -> Op a b #

asinh :: Op a b -> Op a b #

acosh :: Op a b -> Op a b #

atanh :: Op a b -> Op a b #

log1p :: Op a b -> Op a b #

expm1 :: Op a b -> Op a b #

log1pexp :: Op a b -> Op a b #

log1mexp :: Op a b -> Op a b #

Floating a => Floating (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

pi :: Const a b #

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Floating a => Floating (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

pi :: Tagged s a #

exp :: Tagged s a -> Tagged s a #

log :: Tagged s a -> Tagged s a #

sqrt :: Tagged s a -> Tagged s a #

(**) :: Tagged s a -> Tagged s a -> Tagged s a #

logBase :: Tagged s a -> Tagged s a -> Tagged s a #

sin :: Tagged s a -> Tagged s a #

cos :: Tagged s a -> Tagged s a #

tan :: Tagged s a -> Tagged s a #

asin :: Tagged s a -> Tagged s a #

acos :: Tagged s a -> Tagged s a #

atan :: Tagged s a -> Tagged s a #

sinh :: Tagged s a -> Tagged s a #

cosh :: Tagged s a -> Tagged s a #

tanh :: Tagged s a -> Tagged s a #

asinh :: Tagged s a -> Tagged s a #

acosh :: Tagged s a -> Tagged s a #

atanh :: Tagged s a -> Tagged s a #

log1p :: Tagged s a -> Tagged s a #

expm1 :: Tagged s a -> Tagged s a #

log1pexp :: Tagged s a -> Tagged s a #

log1mexp :: Tagged s a -> Tagged s a #

(Dim n, Floating a) => Floating (V n a) 
Instance details

Defined in Linear.V

Methods

pi :: V n a #

exp :: V n a -> V n a #

log :: V n a -> V n a #

sqrt :: V n a -> V n a #

(**) :: V n a -> V n a -> V n a #

logBase :: V n a -> V n a -> V n a #

sin :: V n a -> V n a #

cos :: V n a -> V n a #

tan :: V n a -> V n a #

asin :: V n a -> V n a #

acos :: V n a -> V n a #

atan :: V n a -> V n a #

sinh :: V n a -> V n a #

cosh :: V n a -> V n a #

tanh :: V n a -> V n a #

asinh :: V n a -> V n a #

acosh :: V n a -> V n a #

atanh :: V n a -> V n a #

log1p :: V n a -> V n a #

expm1 :: V n a -> V n a #

log1pexp :: V n a -> V n a #

log1mexp :: V n a -> V n a #

class Num a => Fractional a where #

Fractional numbers, supporting real division.

Minimal complete definition

fromRational, (recip | (/))

Methods

(/) :: a -> a -> a infixl 7 #

fractional division

recip :: a -> a #

reciprocal fraction

fromRational :: Rational -> a #

Conversion from a Rational (that is Ratio Integer). + instances of Eq.

The Haskell Report defines no laws for Eq. However, == is customarily + expected to implement an equivalence relationship where two values comparing + equal are indistinguishable by "public" functions, with a "public" function + being one not allowing to see implementation details. For example, for a + type representing non-normalised natural numbers modulo 100, a "public" + function doesn't make the difference between 1 and 201. It is expected to + have the following properties:

Reflexivity
x == x = True
Symmetry
x == y = y == x
Transitivity
if x == y && y == z = True, then x == z = True
Substitutivity
if x == y = True and f is a "public" function + whose return type is an instance of Eq, then f x == f y = True
Negation
x /= y = not (x == y)

Minimal complete definition: either == or /=.

Minimal complete definition

(==) | (/=)

Instances
Eq Bool 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Char 
Instance details

Defined in GHC.Classes

Methods

(==) :: Char -> Char -> Bool #

(/=) :: Char -> Char -> Bool #

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 #

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

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 substitutivity:

>>> 0 == (-0 :: Float)
+True
+>>> recip 0 == recip (-0 :: Float)
+False
+
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Int 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int8 -> Int8 -> Bool #

(/=) :: Int8 -> Int8 -> Bool #

Eq Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int16 -> Int16 -> Bool #

(/=) :: Int16 -> Int16 -> Bool #

Eq Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int32 -> Int32 -> Bool #

(/=) :: Int32 -> Int32 -> Bool #

Eq Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(==) :: Int64 -> Int64 -> Bool #

(/=) :: Int64 -> Int64 -> Bool #

Eq Integer 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: Integer -> Integer -> Bool #

(/=) :: Integer -> Integer -> Bool #

Eq Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Natural

Methods

(==) :: Natural -> Natural -> Bool #

(/=) :: Natural -> Natural -> Bool #

Eq Ordering 
Instance details

Defined in GHC.Classes

Methods

(==) :: Ordering -> Ordering -> Bool #

(/=) :: Ordering -> Ordering -> Bool #

Eq Word 
Instance details

Defined in GHC.Classes

Methods

(==) :: Word -> Word -> Bool #

(/=) :: Word -> Word -> Bool #

Eq Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word8 -> Word8 -> Bool #

(/=) :: Word8 -> Word8 -> Bool #

Eq Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word16 -> Word16 -> Bool #

(/=) :: Word16 -> Word16 -> Bool #

Eq Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word32 -> Word32 -> Bool #

(/=) :: Word32 -> Word32 -> Bool #

Eq Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(==) :: Word64 -> Word64 -> Bool #

(/=) :: Word64 -> Word64 -> Bool #

Eq SomeTypeRep 
Instance details

Defined in Data.Typeable.Internal

Methods

(==) :: SomeTypeRep -> SomeTypeRep -> Bool #

(/=) :: SomeTypeRep -> SomeTypeRep -> Bool #

Eq Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Exp -> Exp -> Bool #

(/=) :: Exp -> Exp -> Bool #

Eq Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Match -> Match -> Bool #

(/=) :: Match -> Match -> Bool #

Eq Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Clause -> Clause -> Bool #

(/=) :: Clause -> Clause -> Bool #

Eq Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Pat -> Pat -> Bool #

(/=) :: Pat -> Pat -> Bool #

Eq Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Eq Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Dec -> Dec -> Bool #

(/=) :: Dec -> Dec -> Bool #

Eq Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Name -> Name -> Bool #

(/=) :: Name -> Name -> Bool #

Eq FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FunDep -> FunDep -> Bool #

(/=) :: FunDep -> FunDep -> Bool #

Eq InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: InjectivityAnn -> InjectivityAnn -> Bool #

(/=) :: InjectivityAnn -> InjectivityAnn -> Bool #

Eq Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Overlap -> Overlap -> Bool #

(/=) :: Overlap -> Overlap -> Bool #

Eq () 
Instance details

Defined in GHC.Classes

Methods

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

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

Eq TyCon 
Instance details

Defined in GHC.Classes

Methods

(==) :: TyCon -> TyCon -> Bool #

(/=) :: TyCon -> TyCon -> Bool #

Eq Module 
Instance details

Defined in GHC.Classes

Methods

(==) :: Module -> Module -> Bool #

(/=) :: Module -> Module -> Bool #

Eq TrName 
Instance details

Defined in GHC.Classes

Methods

(==) :: TrName -> TrName -> Bool #

(/=) :: TrName -> TrName -> Bool #

Eq ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

(==) :: ByteString -> ByteString -> Bool #

(/=) :: ByteString -> ByteString -> Bool #

Eq DynamicImage 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: DynamicImage -> DynamicImage -> Bool #

(/=) :: DynamicImage -> DynamicImage -> Bool #

Eq PixelYA8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYA8 -> PixelYA8 -> Bool #

(/=) :: PixelYA8 -> PixelYA8 -> Bool #

Eq PixelYA16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYA16 -> PixelYA16 -> Bool #

(/=) :: PixelYA16 -> PixelYA16 -> Bool #

Eq PixelRGB8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGB8 -> PixelRGB8 -> Bool #

(/=) :: PixelRGB8 -> PixelRGB8 -> Bool #

Eq PixelYCbCrK8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(/=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

Eq PixelRGB16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGB16 -> PixelRGB16 -> Bool #

(/=) :: PixelRGB16 -> PixelRGB16 -> Bool #

Eq PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBF -> PixelRGBF -> Bool #

(/=) :: PixelRGBF -> PixelRGBF -> Bool #

Eq PixelYCbCr8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(/=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

Eq PixelCMYK8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(/=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

Eq PixelCMYK16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(/=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

Eq PixelRGBA8 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(/=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

Eq PixelRGBA16 
Instance details

Defined in Codec.Picture.Types

Methods

(==) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(/=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

Eq Fd 
Instance details

Defined in System.Posix.Types

Methods

(==) :: Fd -> Fd -> Bool #

(/=) :: Fd -> Fd -> Bool #

Eq CTimer 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CTimer -> CTimer -> Bool #

(/=) :: CTimer -> CTimer -> Bool #

Eq CKey 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CKey -> CKey -> Bool #

(/=) :: CKey -> CKey -> Bool #

Eq CId 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CId -> CId -> Bool #

(/=) :: CId -> CId -> Bool #

Eq CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CFsFilCnt -> CFsFilCnt -> Bool #

(/=) :: CFsFilCnt -> CFsFilCnt -> Bool #

Eq CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

(/=) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

Eq CClockId 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CClockId -> CClockId -> Bool #

(/=) :: CClockId -> CClockId -> Bool #

Eq CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CBlkCnt -> CBlkCnt -> Bool #

(/=) :: CBlkCnt -> CBlkCnt -> Bool #

Eq CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CBlkSize -> CBlkSize -> Bool #

(/=) :: CBlkSize -> CBlkSize -> Bool #

Eq CRLim 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CRLim -> CRLim -> Bool #

(/=) :: CRLim -> CRLim -> Bool #

Eq CTcflag 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CTcflag -> CTcflag -> Bool #

(/=) :: CTcflag -> CTcflag -> Bool #

Eq CSpeed 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CSpeed -> CSpeed -> Bool #

(/=) :: CSpeed -> CSpeed -> Bool #

Eq CCc 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CCc -> CCc -> Bool #

(/=) :: CCc -> CCc -> Bool #

Eq CUid 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CUid -> CUid -> Bool #

(/=) :: CUid -> CUid -> Bool #

Eq CNlink 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CNlink -> CNlink -> Bool #

(/=) :: CNlink -> CNlink -> Bool #

Eq CGid 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CGid -> CGid -> Bool #

(/=) :: CGid -> CGid -> Bool #

Eq CSsize 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CSsize -> CSsize -> Bool #

(/=) :: CSsize -> CSsize -> Bool #

Eq CPid 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CPid -> CPid -> Bool #

(/=) :: CPid -> CPid -> Bool #

Eq COff 
Instance details

Defined in System.Posix.Types

Methods

(==) :: COff -> COff -> Bool #

(/=) :: COff -> COff -> Bool #

Eq CMode 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CMode -> CMode -> Bool #

(/=) :: CMode -> CMode -> Bool #

Eq CIno 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CIno -> CIno -> Bool #

(/=) :: CIno -> CIno -> Bool #

Eq CDev 
Instance details

Defined in System.Posix.Types

Methods

(==) :: CDev -> CDev -> Bool #

(/=) :: CDev -> CDev -> Bool #

Eq IOMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.IOMode

Methods

(==) :: IOMode -> IOMode -> Bool #

(/=) :: IOMode -> IOMode -> Bool #

Eq Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Con -> Con -> Bool #

(/=) :: Con -> Con -> Bool #

Eq ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

(==) :: ByteString -> ByteString -> Bool #

(/=) :: ByteString -> ByteString -> Bool #

Eq Scientific

Scientific numbers can be safely compared for equality. No magnitude 10^e + is calculated so there's no risk of a blowup in space or time when comparing + scientific numbers coming from untrusted sources.

Instance details

Defined in Data.Scientific

Methods

(==) :: Scientific -> Scientific -> Bool #

(/=) :: Scientific -> Scientific -> Bool #

Eq UTCTime 
Instance details

Defined in Data.Time.Clock.Internal.UTCTime

Methods

(==) :: UTCTime -> UTCTime -> Bool #

(/=) :: UTCTime -> UTCTime -> Bool #

Eq JSONPathElement 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: JSONPathElement -> JSONPathElement -> Bool #

(/=) :: JSONPathElement -> JSONPathElement -> Bool #

Eq Value 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: Value -> Value -> Bool #

(/=) :: Value -> Value -> Bool #

Eq DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: DotNetTime -> DotNetTime -> Bool #

(/=) :: DotNetTime -> DotNetTime -> Bool #

Eq SumEncoding 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(==) :: SumEncoding -> SumEncoding -> Bool #

(/=) :: SumEncoding -> SumEncoding -> Bool #

Eq Handle

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: Handle -> Handle -> Bool #

(/=) :: Handle -> Handle -> Bool #

Eq Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(==) :: Pos -> Pos -> Bool #

(/=) :: Pos -> Pos -> Bool #

Eq More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(==) :: More -> More -> Bool #

(/=) :: More -> More -> Bool #

Eq BigNat 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: BigNat -> BigNat -> Bool #

(/=) :: BigNat -> BigNat -> Bool #

Eq Void

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

(==) :: Void -> Void -> Bool #

(/=) :: Void -> Void -> Bool #

Eq SpecConstrAnnotation

Since: base-4.3.0.0

Instance details

Defined in GHC.Exts

Methods

(==) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #

(/=) :: SpecConstrAnnotation -> SpecConstrAnnotation -> Bool #

Eq Version

Since: base-2.1

Instance details

Defined in Data.Version

Methods

(==) :: Version -> Version -> Bool #

(/=) :: Version -> Version -> Bool #

Eq HandlePosn

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle

Methods

(==) :: HandlePosn -> HandlePosn -> Bool #

(/=) :: HandlePosn -> HandlePosn -> Bool #

Eq AsyncException

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: AsyncException -> AsyncException -> Bool #

(/=) :: AsyncException -> AsyncException -> Bool #

Eq ArrayException

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: ArrayException -> ArrayException -> Bool #

(/=) :: ArrayException -> ArrayException -> Bool #

Eq ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

(==) :: ExitCode -> ExitCode -> Bool #

(/=) :: ExitCode -> ExitCode -> Bool #

Eq IOErrorType

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: IOErrorType -> IOErrorType -> Bool #

(/=) :: IOErrorType -> IOErrorType -> Bool #

Eq BufferMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: BufferMode -> BufferMode -> Bool #

(/=) :: BufferMode -> BufferMode -> Bool #

Eq Newline

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: Newline -> Newline -> Bool #

(/=) :: Newline -> Newline -> Bool #

Eq NewlineMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

(==) :: NewlineMode -> NewlineMode -> Bool #

(/=) :: NewlineMode -> NewlineMode -> Bool #

Eq IODeviceType

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Device

Methods

(==) :: IODeviceType -> IODeviceType -> Bool #

(/=) :: IODeviceType -> IODeviceType -> Bool #

Eq SeekMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Device

Methods

(==) :: SeekMode -> SeekMode -> Bool #

(/=) :: SeekMode -> SeekMode -> Bool #

Eq CodingProgress

Since: base-4.4.0.0

Instance details

Defined in GHC.IO.Encoding.Types

Methods

(==) :: CodingProgress -> CodingProgress -> Bool #

(/=) :: CodingProgress -> CodingProgress -> Bool #

Eq MaskingState

Since: base-4.3.0.0

Instance details

Defined in GHC.IO

Methods

(==) :: MaskingState -> MaskingState -> Bool #

(/=) :: MaskingState -> MaskingState -> Bool #

Eq IOException

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

(==) :: IOException -> IOException -> Bool #

(/=) :: IOException -> IOException -> Bool #

Eq ErrorCall

Since: base-4.7.0.0

Instance details

Defined in GHC.Exception

Methods

(==) :: ErrorCall -> ErrorCall -> Bool #

(/=) :: ErrorCall -> ErrorCall -> Bool #

Eq ArithException

Since: base-3.0

Instance details

Defined in GHC.Exception.Type

Methods

(==) :: ArithException -> ArithException -> Bool #

(/=) :: ArithException -> ArithException -> Bool #

Eq All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: All -> All -> Bool #

(/=) :: All -> All -> Bool #

Eq Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Any -> Any -> Bool #

(/=) :: Any -> Any -> Bool #

Eq Fixity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: Fixity -> Fixity -> Bool #

(/=) :: Fixity -> Fixity -> Bool #

Eq Associativity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: Associativity -> Associativity -> Bool #

(/=) :: Associativity -> Associativity -> Bool #

Eq SourceUnpackedness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

Eq SourceStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: SourceStrictness -> SourceStrictness -> Bool #

(/=) :: SourceStrictness -> SourceStrictness -> Bool #

Eq DecidedStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: DecidedStrictness -> DecidedStrictness -> Bool #

(/=) :: DecidedStrictness -> DecidedStrictness -> Bool #

Eq SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

(==) :: SomeNat -> SomeNat -> Bool #

(/=) :: SomeNat -> SomeNat -> Bool #

Eq CChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CChar -> CChar -> Bool #

(/=) :: CChar -> CChar -> Bool #

Eq CSChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSChar -> CSChar -> Bool #

(/=) :: CSChar -> CSChar -> Bool #

Eq CUChar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUChar -> CUChar -> Bool #

(/=) :: CUChar -> CUChar -> Bool #

Eq CShort 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CShort -> CShort -> Bool #

(/=) :: CShort -> CShort -> Bool #

Eq CUShort 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUShort -> CUShort -> Bool #

(/=) :: CUShort -> CUShort -> Bool #

Eq CInt 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CInt -> CInt -> Bool #

(/=) :: CInt -> CInt -> Bool #

Eq CUInt 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUInt -> CUInt -> Bool #

(/=) :: CUInt -> CUInt -> Bool #

Eq CLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CLong -> CLong -> Bool #

(/=) :: CLong -> CLong -> Bool #

Eq CULong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CULong -> CULong -> Bool #

(/=) :: CULong -> CULong -> Bool #

Eq CLLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CLLong -> CLLong -> Bool #

(/=) :: CLLong -> CLLong -> Bool #

Eq CULLong 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CULLong -> CULLong -> Bool #

(/=) :: CULLong -> CULLong -> Bool #

Eq CBool 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CBool -> CBool -> Bool #

(/=) :: CBool -> CBool -> Bool #

Eq CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CFloat -> CFloat -> Bool #

(/=) :: CFloat -> CFloat -> Bool #

Eq CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CDouble -> CDouble -> Bool #

(/=) :: CDouble -> CDouble -> Bool #

Eq CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CPtrdiff -> CPtrdiff -> Bool #

(/=) :: CPtrdiff -> CPtrdiff -> Bool #

Eq CSize 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSize -> CSize -> Bool #

(/=) :: CSize -> CSize -> Bool #

Eq CWchar 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CWchar -> CWchar -> Bool #

(/=) :: CWchar -> CWchar -> Bool #

Eq CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSigAtomic -> CSigAtomic -> Bool #

(/=) :: CSigAtomic -> CSigAtomic -> Bool #

Eq CClock 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CClock -> CClock -> Bool #

(/=) :: CClock -> CClock -> Bool #

Eq CTime 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CTime -> CTime -> Bool #

(/=) :: CTime -> CTime -> Bool #

Eq CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUSeconds -> CUSeconds -> Bool #

(/=) :: CUSeconds -> CUSeconds -> Bool #

Eq CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CSUSeconds -> CSUSeconds -> Bool #

(/=) :: CSUSeconds -> CSUSeconds -> Bool #

Eq CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CIntPtr -> CIntPtr -> Bool #

(/=) :: CIntPtr -> CIntPtr -> Bool #

Eq CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUIntPtr -> CUIntPtr -> Bool #

(/=) :: CUIntPtr -> CUIntPtr -> Bool #

Eq CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CIntMax -> CIntMax -> Bool #

(/=) :: CIntMax -> CIntMax -> Bool #

Eq CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(==) :: CUIntMax -> CUIntMax -> Bool #

(/=) :: CUIntMax -> CUIntMax -> Bool #

Eq Lexeme

Since: base-2.1

Instance details

Defined in Text.Read.Lex

Methods

(==) :: Lexeme -> Lexeme -> Bool #

(/=) :: Lexeme -> Lexeme -> Bool #

Eq Number

Since: base-4.6.0.0

Instance details

Defined in Text.Read.Lex

Methods

(==) :: Number -> Number -> Bool #

(/=) :: Number -> Number -> Bool #

Eq GeneralCategory

Since: base-2.1

Instance details

Defined in GHC.Unicode

Methods

(==) :: GeneralCategory -> GeneralCategory -> Bool #

(/=) :: GeneralCategory -> GeneralCategory -> Bool #

Eq SrcLoc

Since: base-4.9.0.0

Instance details

Defined in GHC.Stack.Types

Methods

(==) :: SrcLoc -> SrcLoc -> Bool #

(/=) :: SrcLoc -> SrcLoc -> Bool #

Eq ASCII7_Invalid 
Instance details

Defined in Basement.String.Encoding.ASCII7

Methods

(==) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #

(/=) :: ASCII7_Invalid -> ASCII7_Invalid -> Bool #

Eq ISO_8859_1_Invalid 
Instance details

Defined in Basement.String.Encoding.ISO_8859_1

Methods

(==) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #

(/=) :: ISO_8859_1_Invalid -> ISO_8859_1_Invalid -> Bool #

Eq UTF16_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF16

Methods

(==) :: UTF16_Invalid -> UTF16_Invalid -> Bool #

(/=) :: UTF16_Invalid -> UTF16_Invalid -> Bool #

Eq UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

(==) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(/=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

Eq Encoding 
Instance details

Defined in Basement.String

Methods

(==) :: Encoding -> Encoding -> Bool #

(/=) :: Encoding -> Encoding -> Bool #

Eq String 
Instance details

Defined in Basement.UTF8.Base

Methods

(==) :: String -> String -> Bool #

(/=) :: String -> String -> Bool #

Eq FileSize 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: FileSize -> FileSize -> Bool #

(/=) :: FileSize -> FileSize -> Bool #

Eq BimapException 
Instance details

Defined in Data.Bimap

Methods

(==) :: BimapException -> BimapException -> Bool #

(/=) :: BimapException -> BimapException -> Bool #

Eq Quoting 
Instance details

Defined in Data.Csv.Encoding

Methods

(==) :: Quoting -> Quoting -> Bool #

(/=) :: Quoting -> Quoting -> Bool #

Eq EncodeOptions 
Instance details

Defined in Data.Csv.Encoding

Methods

(==) :: EncodeOptions -> EncodeOptions -> Bool #

(/=) :: EncodeOptions -> EncodeOptions -> Bool #

Eq IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

(==) :: IntSet -> IntSet -> Bool #

(/=) :: IntSet -> IntSet -> Bool #

Eq FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: FileType -> FileType -> Bool #

(/=) :: FileType -> FileType -> Bool #

Eq Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: Permissions -> Permissions -> Bool #

(/=) :: Permissions -> Permissions -> Bool #

Eq XdgDirectory 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: XdgDirectory -> XdgDirectory -> Bool #

(/=) :: XdgDirectory -> XdgDirectory -> Bool #

Eq XdgDirectoryList 
Instance details

Defined in System.Directory.Internal.Common

Methods

(==) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

(/=) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

Eq StdStream 
Instance details

Defined in System.Process.Common

Methods

(==) :: StdStream -> StdStream -> Bool #

(/=) :: StdStream -> StdStream -> Bool #

Eq CmdSpec 
Instance details

Defined in System.Process.Common

Methods

(==) :: CmdSpec -> CmdSpec -> Bool #

(/=) :: CmdSpec -> CmdSpec -> Bool #

Eq CreateProcess 
Instance details

Defined in System.Process.Common

Methods

(==) :: CreateProcess -> CreateProcess -> Bool #

(/=) :: CreateProcess -> CreateProcess -> Bool #

Eq Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Methods

(==) :: Extension -> Extension -> Bool #

(/=) :: Extension -> Extension -> Bool #

Eq ForeignSrcLang 
Instance details

Defined in GHC.ForeignSrcLang.Type

Methods

(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool #

(/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool #

Eq MatrixOrder 
Instance details

Defined in Internal.Matrix

Methods

(==) :: MatrixOrder -> MatrixOrder -> Bool #

(/=) :: MatrixOrder -> MatrixOrder -> Bool #

Eq LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(==) :: LogFloat -> LogFloat -> Bool #

(/=) :: LogFloat -> LogFloat -> Bool #

Eq TimeLocale 
Instance details

Defined in System.Locale

Methods

(==) :: TimeLocale -> TimeLocale -> Bool #

(/=) :: TimeLocale -> TimeLocale -> Bool #

Eq Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

(==) :: Doc -> Doc -> Bool #

(/=) :: Doc -> Doc -> Bool #

Eq TextDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: TextDetails -> TextDetails -> Bool #

(/=) :: TextDetails -> TextDetails -> Bool #

Eq Style 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Style -> Style -> Bool #

(/=) :: Style -> Style -> Bool #

Eq Mode 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Mode -> Mode -> Bool #

(/=) :: Mode -> Mode -> Bool #

Eq ByteArray

Since: primitive-0.6.3.0

Instance details

Defined in Data.Primitive.ByteArray

Methods

(==) :: ByteArray -> ByteArray -> Bool #

(/=) :: ByteArray -> ByteArray -> Bool #

Eq Addr 
Instance details

Defined in Data.Primitive.Types

Methods

(==) :: Addr -> Addr -> Bool #

(/=) :: Addr -> Addr -> Bool #

Eq Root 
Instance details

Defined in Filesystem.Path.Internal

Methods

(==) :: Root -> Root -> Bool #

(/=) :: Root -> Root -> Bool #

Eq FilePath 
Instance details

Defined in Filesystem.Path.Internal

Methods

(==) :: FilePath -> FilePath -> Bool #

(/=) :: FilePath -> FilePath -> Bool #

Eq ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: ModName -> ModName -> Bool #

(/=) :: ModName -> ModName -> Bool #

Eq PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PkgName -> PkgName -> Bool #

(/=) :: PkgName -> PkgName -> Bool #

Eq Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Module -> Module -> Bool #

(/=) :: Module -> Module -> Bool #

Eq OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: OccName -> OccName -> Bool #

(/=) :: OccName -> OccName -> Bool #

Eq NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: NameFlavour -> NameFlavour -> Bool #

(/=) :: NameFlavour -> NameFlavour -> Bool #

Eq NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: NameSpace -> NameSpace -> Bool #

(/=) :: NameSpace -> NameSpace -> Bool #

Eq Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Loc -> Loc -> Bool #

(/=) :: Loc -> Loc -> Bool #

Eq Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Info -> Info -> Bool #

(/=) :: Info -> Info -> Bool #

Eq ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: ModuleInfo -> ModuleInfo -> Bool #

(/=) :: ModuleInfo -> ModuleInfo -> Bool #

Eq Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Fixity -> Fixity -> Bool #

(/=) :: Fixity -> Fixity -> Bool #

Eq FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FixityDirection -> FixityDirection -> Bool #

(/=) :: FixityDirection -> FixityDirection -> Bool #

Eq Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Lit -> Lit -> Bool #

(/=) :: Lit -> Lit -> Bool #

Eq Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Body -> Body -> Bool #

(/=) :: Body -> Body -> Bool #

Eq Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Guard -> Guard -> Bool #

(/=) :: Guard -> Guard -> Bool #

Eq Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Stmt -> Stmt -> Bool #

(/=) :: Stmt -> Stmt -> Bool #

Eq Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Range -> Range -> Bool #

(/=) :: Range -> Range -> Bool #

Eq DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DerivClause -> DerivClause -> Bool #

(/=) :: DerivClause -> DerivClause -> Bool #

Eq DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DerivStrategy -> DerivStrategy -> Bool #

(/=) :: DerivStrategy -> DerivStrategy -> Bool #

Eq TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(/=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

Eq TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TySynEqn -> TySynEqn -> Bool #

(/=) :: TySynEqn -> TySynEqn -> Bool #

Eq Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Foreign -> Foreign -> Bool #

(/=) :: Foreign -> Foreign -> Bool #

Eq Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Callconv -> Callconv -> Bool #

(/=) :: Callconv -> Callconv -> Bool #

Eq Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Safety -> Safety -> Bool #

(/=) :: Safety -> Safety -> Bool #

Eq Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Pragma -> Pragma -> Bool #

(/=) :: Pragma -> Pragma -> Bool #

Eq Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Inline -> Inline -> Bool #

(/=) :: Inline -> Inline -> Bool #

Eq RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: RuleMatch -> RuleMatch -> Bool #

(/=) :: RuleMatch -> RuleMatch -> Bool #

Eq Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Phases -> Phases -> Bool #

(/=) :: Phases -> Phases -> Bool #

Eq RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: RuleBndr -> RuleBndr -> Bool #

(/=) :: RuleBndr -> RuleBndr -> Bool #

Eq AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: AnnTarget -> AnnTarget -> Bool #

(/=) :: AnnTarget -> AnnTarget -> Bool #

Eq SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(/=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

Eq SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: SourceStrictness -> SourceStrictness -> Bool #

(/=) :: SourceStrictness -> SourceStrictness -> Bool #

Eq DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: DecidedStrictness -> DecidedStrictness -> Bool #

(/=) :: DecidedStrictness -> DecidedStrictness -> Bool #

Eq Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Bang -> Bang -> Bool #

(/=) :: Bang -> Bang -> Bool #

Eq PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PatSynDir -> PatSynDir -> Bool #

(/=) :: PatSynDir -> PatSynDir -> Bool #

Eq PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: PatSynArgs -> PatSynArgs -> Bool #

(/=) :: PatSynArgs -> PatSynArgs -> Bool #

Eq TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TyVarBndr -> TyVarBndr -> Bool #

(/=) :: TyVarBndr -> TyVarBndr -> Bool #

Eq FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: FamilyResultSig -> FamilyResultSig -> Bool #

(/=) :: FamilyResultSig -> FamilyResultSig -> Bool #

Eq TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: TyLit -> TyLit -> Bool #

(/=) :: TyLit -> TyLit -> Bool #

Eq Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: Role -> Role -> Bool #

(/=) :: Role -> Role -> Bool #

Eq AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(==) :: AnnLookup -> AnnLookup -> Bool #

(/=) :: AnnLookup -> AnnLookup -> Bool #

Eq B 
Instance details

Defined in Data.Text.Short.Internal

Methods

(==) :: B -> B -> Bool #

(/=) :: B -> B -> Bool #

Eq ShortText 
Instance details

Defined in Data.Text.Short.Internal

Methods

(==) :: ShortText -> ShortText -> Bool #

(/=) :: ShortText -> ShortText -> Bool #

Eq DatatypeInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: DatatypeInfo -> DatatypeInfo -> Bool #

(/=) :: DatatypeInfo -> DatatypeInfo -> Bool #

Eq DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: DatatypeVariant -> DatatypeVariant -> Bool #

(/=) :: DatatypeVariant -> DatatypeVariant -> Bool #

Eq ConstructorInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: ConstructorInfo -> ConstructorInfo -> Bool #

(/=) :: ConstructorInfo -> ConstructorInfo -> Bool #

Eq ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: ConstructorVariant -> ConstructorVariant -> Bool #

(/=) :: ConstructorVariant -> ConstructorVariant -> Bool #

Eq FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: FieldStrictness -> FieldStrictness -> Bool #

(/=) :: FieldStrictness -> FieldStrictness -> Bool #

Eq Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: Unpackedness -> Unpackedness -> Bool #

(/=) :: Unpackedness -> Unpackedness -> Bool #

Eq Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

(==) :: Strictness -> Strictness -> Bool #

(/=) :: Strictness -> Strictness -> Bool #

Eq LocalTime 
Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

(==) :: LocalTime -> LocalTime -> Bool #

(/=) :: LocalTime -> LocalTime -> Bool #

Eq TimeOfDay 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

(==) :: TimeOfDay -> TimeOfDay -> Bool #

(/=) :: TimeOfDay -> TimeOfDay -> Bool #

Eq TimeZone 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

(==) :: TimeZone -> TimeZone -> Bool #

(/=) :: TimeZone -> TimeZone -> Bool #

Eq UniversalTime 
Instance details

Defined in Data.Time.Clock.Internal.UniversalTime

Methods

(==) :: UniversalTime -> UniversalTime -> Bool #

(/=) :: UniversalTime -> UniversalTime -> Bool #

Eq NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(==) :: NominalDiffTime -> NominalDiffTime -> Bool #

(/=) :: NominalDiffTime -> NominalDiffTime -> Bool #

Eq AbsoluteTime 
Instance details

Defined in Data.Time.Clock.Internal.AbsoluteTime

Methods

(==) :: AbsoluteTime -> AbsoluteTime -> Bool #

(/=) :: AbsoluteTime -> AbsoluteTime -> Bool #

Eq DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(==) :: DiffTime -> DiffTime -> Bool #

(/=) :: DiffTime -> DiffTime -> Bool #

Eq Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

(==) :: Day -> Day -> Bool #

(/=) :: Day -> Day -> Bool #

Eq UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

(==) :: UnpackedUUID -> UnpackedUUID -> Bool #

(/=) :: UnpackedUUID -> UnpackedUUID -> Bool #

Eq UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

(==) :: UUID -> UUID -> Bool #

(/=) :: UUID -> UUID -> Bool #

Eq DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: DictionaryHash -> DictionaryHash -> Bool #

(/=) :: DictionaryHash -> DictionaryHash -> Bool #

Eq Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: Format -> Format -> Bool #

(/=) :: Format -> Format -> Bool #

Eq Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: Method -> Method -> Bool #

(/=) :: Method -> Method -> Bool #

Eq CompressionLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: CompressionLevel -> CompressionLevel -> Bool #

(/=) :: CompressionLevel -> CompressionLevel -> Bool #

Eq WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: WindowBits -> WindowBits -> Bool #

(/=) :: WindowBits -> WindowBits -> Bool #

Eq MemoryLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: MemoryLevel -> MemoryLevel -> Bool #

(/=) :: MemoryLevel -> MemoryLevel -> Bool #

Eq CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(==) :: CompressionStrategy -> CompressionStrategy -> Bool #

(/=) :: CompressionStrategy -> CompressionStrategy -> Bool #

Eq NewtonParam 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: NewtonParam -> NewtonParam -> Bool #

(/=) :: NewtonParam -> NewtonParam -> Bool #

Eq NewtonStep 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: NewtonStep -> NewtonStep -> Bool #

(/=) :: NewtonStep -> NewtonStep -> Bool #

Eq RiddersParam 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: RiddersParam -> RiddersParam -> Bool #

(/=) :: RiddersParam -> RiddersParam -> Bool #

Eq RiddersStep 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: RiddersStep -> RiddersStep -> Bool #

(/=) :: RiddersStep -> RiddersStep -> Bool #

Eq Tolerance 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: Tolerance -> Tolerance -> Bool #

(/=) :: Tolerance -> Tolerance -> Bool #

Eq Seed 
Instance details

Defined in System.Random.MWC

Methods

(==) :: Seed -> Seed -> Bool #

(/=) :: Seed -> Seed -> Bool #

Eq ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==) :: ConstVal -> ConstVal -> Bool #

(/=) :: ConstVal -> ConstVal -> Bool #

Eq Type # 
Instance details

Defined in Data.Expression

Methods

(==) :: Type -> Type -> Bool #

(/=) :: Type -> Type -> Bool #

Eq LVal # 
Instance details

Defined in Data.Expression

Methods

(==) :: LVal -> LVal -> Bool #

(/=) :: LVal -> LVal -> Bool #

Eq DExpr # 
Instance details

Defined in Data.Expression

Methods

(==) :: DExpr -> DExpr -> Bool #

(/=) :: DExpr -> DExpr -> Bool #

Eq NodeRef # 
Instance details

Defined in Data.Expression

Methods

(==) :: NodeRef -> NodeRef -> Bool #

(/=) :: NodeRef -> NodeRef -> Bool #

Eq Id # 
Instance details

Defined in Data.Expression

Methods

(==) :: Id -> Id -> Bool #

(/=) :: Id -> Id -> Bool #

Eq Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(==) :: Cairo -> Cairo -> Bool #

(/=) :: Cairo -> Cairo -> Bool #

Eq OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(==) :: OutputType -> OutputType -> Bool #

(/=) :: OutputType -> OutputType -> Bool #

Eq AName 
Instance details

Defined in Diagrams.Core.Names

Methods

(==) :: AName -> AName -> Bool #

(/=) :: AName -> AName -> Bool #

Eq Name 
Instance details

Defined in Diagrams.Core.Names

Methods

(==) :: Name -> Name -> Bool #

(/=) :: Name -> Name -> Bool #

Eq FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(==) :: FillRule -> FillRule -> Bool #

(/=) :: FillRule -> FillRule -> Bool #

Eq LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: LogValue -> LogValue -> Bool #

(/=) :: LogValue -> LogValue -> Bool #

Eq Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(==) :: Percent -> Percent -> Bool #

(/=) :: Percent -> Percent -> Bool #

Eq PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(==) :: PlotIndex -> PlotIndex -> Bool #

(/=) :: PlotIndex -> PlotIndex -> Bool #

Eq FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FillStyle -> FillStyle -> Bool #

(/=) :: FillStyle -> FillStyle -> Bool #

Eq FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Eq FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontStyle -> FontStyle -> Bool #

(/=) :: FontStyle -> FontStyle -> Bool #

Eq FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Eq HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: HTextAnchor -> HTextAnchor -> Bool #

(/=) :: HTextAnchor -> HTextAnchor -> Bool #

Eq LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineCap -> LineCap -> Bool #

(/=) :: LineCap -> LineCap -> Bool #

Eq LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineJoin -> LineJoin -> Bool #

(/=) :: LineJoin -> LineJoin -> Bool #

Eq LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: LineStyle -> LineStyle -> Bool #

(/=) :: LineStyle -> LineStyle -> Bool #

Eq TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: TextSize -> TextSize -> Bool #

(/=) :: TextSize -> TextSize -> Bool #

Eq VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

(==) :: VTextAnchor -> VTextAnchor -> Bool #

(/=) :: VTextAnchor -> VTextAnchor -> Bool #

Eq DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

(==) :: DefName -> DefName -> Bool #

(/=) :: DefName -> DefName -> Bool #

Eq LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: LogScale -> LogScale -> Bool #

(/=) :: LogScale -> LogScale -> Bool #

Eq TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

(==) :: TicksAlignment -> TicksAlignment -> Bool #

(/=) :: TicksAlignment -> TicksAlignment -> Bool #

Eq Orientation 
Instance details

Defined in Plots.Types

Methods

(==) :: Orientation -> Orientation -> Bool #

(/=) :: Orientation -> Orientation -> Bool #

Eq Placement 
Instance details

Defined in Plots.Types

Methods

(==) :: Placement -> Placement -> Bool #

(/=) :: Placement -> Placement -> Bool #

Eq KBNSum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KBNSum -> KBNSum -> Bool #

(/=) :: KBNSum -> KBNSum -> Bool #

Eq Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Methods

(==) :: Points -> Points -> Bool #

(/=) :: Points -> Points -> Bool #

Eq Font 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: Font -> Font -> Bool #

(/=) :: Font -> Font -> Bool #

Eq FontFace 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontFace -> FontFace -> Bool #

(/=) :: FontFace -> FontFace -> Bool #

Eq FontFamily 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontFamily -> FontFamily -> Bool #

(/=) :: FontFamily -> FontFamily -> Bool #

Eq FontMap 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontMap -> FontMap -> Bool #

(/=) :: FontMap -> FontMap -> Bool #

Eq LabelPosition 
Instance details

Defined in Plots.Axis.Render

Methods

(==) :: LabelPosition -> LabelPosition -> Bool #

(/=) :: LabelPosition -> LabelPosition -> Bool #

Eq Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(==) :: Crossings -> Crossings -> Bool #

(/=) :: Crossings -> Crossings -> Bool #

Eq FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: FontSlant -> FontSlant -> Bool #

(/=) :: FontSlant -> FontSlant -> Bool #

Eq FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: FontWeight -> FontWeight -> Bool #

(/=) :: FontWeight -> FontWeight -> Bool #

Eq AxisLineType 
Instance details

Defined in Plots.Axis.Line

Methods

(==) :: AxisLineType -> AxisLineType -> Bool #

(/=) :: AxisLineType -> AxisLineType -> Bool #

Eq Font 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(==) :: Font -> Font -> Bool #

(/=) :: Font -> Font -> Bool #

Eq LinePass 
Instance details

Defined in Linear.Plucker

Methods

(==) :: LinePass -> LinePass -> Bool #

(/=) :: LinePass -> LinePass -> Bool #

Eq KB2Sum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KB2Sum -> KB2Sum -> Bool #

(/=) :: KB2Sum -> KB2Sum -> Bool #

Eq KahanSum 
Instance details

Defined in Numeric.Sum

Methods

(==) :: KahanSum -> KahanSum -> Bool #

(/=) :: KahanSum -> KahanSum -> Bool #

Eq FontSet 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: FontSet -> FontSet -> Bool #

(/=) :: FontSet -> FontSet -> Bool #

Eq PangoContext 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: PangoContext -> PangoContext -> Bool #

(/=) :: PangoContext -> PangoContext -> Bool #

Eq PangoLayoutRaw 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

(==) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(/=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

Eq NCon 
Instance details

Defined in Control.Lens.Internal.PrismTH

Methods

(==) :: NCon -> NCon -> Bool #

(/=) :: NCon -> NCon -> Bool #

Eq a => Eq [a] 
Instance details

Defined in GHC.Classes

Methods

(==) :: [a] -> [a] -> Bool #

(/=) :: [a] -> [a] -> Bool #

Eq a => Eq (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Maybe

Methods

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

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

Eq a => Eq (Ratio a)

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

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

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

Eq (StablePtr a)

Since: base-2.1

Instance details

Defined in GHC.Stable

Methods

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

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

Eq (Ptr a)

Since: base-2.1

Instance details

Defined in GHC.Ptr

Methods

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

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

Eq (FunPtr a) 
Instance details

Defined in GHC.Ptr

Methods

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

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

Eq p => Eq (Par1 p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: Par1 p -> Par1 p -> Bool #

(/=) :: Par1 p -> Par1 p -> Bool #

(Storable a, Eq a) => Eq (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

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

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

(Eq (PixelBaseComponent a), Storable (PixelBaseComponent a)) => Eq (Image a) 
Instance details

Defined in Codec.Picture.Types

Methods

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

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

Eq a => Eq (Only a) 
Instance details

Defined in Data.Tuple.Only

Methods

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

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

Eq a => Eq (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

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

Eq a => Eq (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

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

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

Eq a => Eq (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

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

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

Eq a => Eq (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

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

Eq m => Eq (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(==) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

Eq a => Eq (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

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

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

Eq a => Eq (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

Methods

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

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

Eq a => Eq (Identity a)

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

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

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

Eq a => Eq (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

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

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

Eq a => Eq (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

(==) :: Last a -> Last a -> Bool #

(/=) :: Last a -> Last a -> Bool #

Eq a => Eq (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Dual a -> Dual a -> Bool #

(/=) :: Dual a -> Dual a -> Bool #

Eq a => Eq (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Sum a -> Sum a -> Bool #

(/=) :: Sum a -> Sum a -> Bool #

Eq a => Eq (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Product a -> Product a -> Bool #

(/=) :: Product a -> Product a -> Bool #

Eq a => Eq (Down a)

Since: base-4.6.0.0

Instance details

Defined in Data.Ord

Methods

(==) :: Down a -> Down a -> Bool #

(/=) :: Down a -> Down a -> Bool #

Eq a => Eq (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(==) :: NonEmpty a -> NonEmpty a -> Bool #

(/=) :: NonEmpty a -> NonEmpty a -> Bool #

(PrimType ty, Eq ty) => Eq (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

(==) :: UArray ty -> UArray ty -> Bool #

(/=) :: UArray ty -> UArray ty -> Bool #

(PrimType ty, Eq ty) => Eq (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

(==) :: Block ty -> Block ty -> Bool #

(/=) :: Block ty -> Block ty -> Bool #

Eq a => Eq (NonEmpty a) 
Instance details

Defined in Basement.NonEmpty

Methods

(==) :: NonEmpty a -> NonEmpty a -> Bool #

(/=) :: NonEmpty a -> NonEmpty a -> Bool #

Eq (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: Offset ty -> Offset ty -> Bool #

(/=) :: Offset ty -> Offset ty -> Bool #

Eq (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(==) :: CountOf ty -> CountOf ty -> Bool #

(/=) :: CountOf ty -> CountOf ty -> Bool #

Eq (Zn64 n) 
Instance details

Defined in Basement.Bounded

Methods

(==) :: Zn64 n -> Zn64 n -> Bool #

(/=) :: Zn64 n -> Zn64 n -> Bool #

Eq (Zn n) 
Instance details

Defined in Basement.Bounded

Methods

(==) :: Zn n -> Zn n -> Bool #

(/=) :: Zn n -> Zn n -> Bool #

Eq n => Eq (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

(==) :: VarInt n -> VarInt n -> Bool #

(/=) :: VarInt n -> VarInt n -> Bool #

Eq a => Eq (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(==) :: Colour a -> Colour a -> Bool #

(/=) :: Colour a -> Colour a -> Bool #

Eq a => Eq (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(==) :: AlphaColour a -> AlphaColour a -> Bool #

(/=) :: AlphaColour a -> AlphaColour a -> Bool #

Eq a => Eq (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

(==) :: IntMap a -> IntMap a -> Bool #

(/=) :: IntMap a -> IntMap a -> Bool #

Eq a => Eq (Tree a) 
Instance details

Defined in Data.Tree

Methods

(==) :: Tree a -> Tree a -> Bool #

(/=) :: Tree a -> Tree a -> Bool #

Eq a => Eq (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

(==) :: Seq a -> Seq a -> Bool #

(/=) :: Seq a -> Seq a -> Bool #

Eq a => Eq (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

(==) :: ViewL a -> ViewL a -> Bool #

(/=) :: ViewL a -> ViewL a -> Bool #

Eq a => Eq (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

(==) :: ViewR a -> ViewR a -> Bool #

(/=) :: ViewR a -> ViewR a -> Bool #

Eq a => Eq (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

(==) :: Set a -> Set a -> Bool #

(/=) :: Set a -> Set a -> Bool #

Eq (Digest a) 
Instance details

Defined in Crypto.Hash.Types

Methods

(==) :: Digest a -> Digest a -> Bool #

(/=) :: Digest a -> Digest a -> Bool #

Eq a => Eq (DList a) 
Instance details

Defined in Data.DList

Methods

(==) :: DList a -> DList a -> Bool #

(/=) :: DList a -> DList a -> Bool #

(Generic a, Eq (Rep a ())) => Eq (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

(==) :: Generically a -> Generically a -> Bool #

(/=) :: Generically a -> Generically a -> Bool #

Eq a => Eq (Hashed a)

Uses precomputed hash to detect inequality faster

Instance details

Defined in Data.Hashable.Class

Methods

(==) :: Hashed a -> Hashed a -> Bool #

(/=) :: Hashed a -> Hashed a -> Bool #

Eq a => Eq (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(==) :: Interval a -> Interval a -> Bool #

(/=) :: Interval a -> Interval a -> Bool #

Eq (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Doc a -> Doc a -> Bool #

(/=) :: Doc a -> Doc a -> Bool #

Eq a => Eq (AnnotDetails a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: AnnotDetails a -> AnnotDetails a -> Bool #

(/=) :: AnnotDetails a -> AnnotDetails a -> Bool #

Eq a => Eq (Span a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(==) :: Span a -> Span a -> Bool #

(/=) :: Span a -> Span a -> Bool #

(Eq a, PrimUnlifted a) => Eq (UnliftedArray a) 
Instance details

Defined in Data.Primitive.UnliftedArray

Methods

(==) :: UnliftedArray a -> UnliftedArray a -> Bool #

(/=) :: UnliftedArray a -> UnliftedArray a -> Bool #

(Eq a, Prim a) => Eq (PrimArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Methods

(==) :: PrimArray a -> PrimArray a -> Bool #

(/=) :: PrimArray a -> PrimArray a -> Bool #

Eq a => Eq (SmallArray a) 
Instance details

Defined in Data.Primitive.SmallArray

Methods

(==) :: SmallArray a -> SmallArray a -> Bool #

(/=) :: SmallArray a -> SmallArray a -> Bool #

Eq a => Eq (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

(==) :: Array a -> Array a -> Bool #

(/=) :: Array a -> Array a -> Bool #

Eq a => Eq (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Methods

(==) :: HashSet a -> HashSet a -> Bool #

(/=) :: HashSet a -> HashSet a -> Bool #

(Prim a, Eq a) => Eq (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

(==) :: Vector a -> Vector a -> Bool #

(/=) :: Vector a -> Vector a -> Bool #

Eq a => Eq (Vector a) 
Instance details

Defined in Data.Vector

Methods

(==) :: Vector a -> Vector a -> Bool #

(/=) :: Vector a -> Vector a -> Bool #

Eq a => Eq (Root a) 
Instance details

Defined in Numeric.RootFinding

Methods

(==) :: Root a -> Root a -> Bool #

(/=) :: Root a -> Root a -> Bool #

Eq a => Eq (Log a) 
Instance details

Defined in Numeric.Log

Methods

(==) :: Log a -> Log a -> Bool #

(/=) :: Log a -> Log a -> Bool #

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

Eq1 f => Eq (Fix f) 
Instance details

Defined in Data.Functor.Foldable

Methods

(==) :: Fix f -> Fix f -> Bool #

(/=) :: Fix f -> Fix f -> Bool #

(Functor f, Eq1 f) => Eq (Mu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

(==) :: Mu f -> Mu f -> Bool #

(/=) :: Mu f -> Mu f -> Bool #

(Functor f, Eq1 f) => Eq (Nu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

(==) :: Nu f -> Nu f -> Bool #

(/=) :: Nu f -> Nu f -> Bool #

Eq t => Eq (P t) # 
Instance details

Defined in Data.Program

Methods

(==) :: P t -> P t -> Bool #

(/=) :: P t -> P t -> Bool #

Eq a => Eq (V2 a) 
Instance details

Defined in Linear.V2

Methods

(==) :: V2 a -> V2 a -> Bool #

(/=) :: V2 a -> V2 a -> Bool #

Eq t => Eq (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(==) :: TransInv t -> TransInv t -> Bool #

(/=) :: TransInv t -> TransInv t -> Bool #

(Eq (V a (N a)), Eq a) => Eq (Located a) 
Instance details

Defined in Diagrams.Located

Methods

(==) :: Located a -> Located a -> Bool #

(/=) :: Located a -> Located a -> Bool #

Eq n => Eq (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

(==) :: PolyOrientation n -> PolyOrientation n -> Bool #

(/=) :: PolyOrientation n -> PolyOrientation n -> Bool #

Eq n => Eq (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

(==) :: Extending n -> Extending n -> Bool #

(/=) :: Extending n -> Extending n -> Bool #

Eq n => Eq (Time n) 
Instance details

Defined in Data.Active

Methods

(==) :: Time n -> Time n -> Bool #

(/=) :: Time n -> Time n -> Bool #

Eq a => Eq (V3 a) 
Instance details

Defined in Linear.V3

Methods

(==) :: V3 a -> V3 a -> Bool #

(/=) :: V3 a -> V3 a -> Bool #

Eq n => Eq (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

(==) :: Angle n -> Angle n -> Bool #

(/=) :: Angle n -> Angle n -> Bool #

Eq a => Eq (V1 a) 
Instance details

Defined in Linear.V1

Methods

(==) :: V1 a -> V1 a -> Bool #

(/=) :: V1 a -> V1 a -> Bool #

Eq n => Eq (Duration n) 
Instance details

Defined in Data.Active

Methods

(==) :: Duration n -> Duration n -> Bool #

(/=) :: Duration n -> Duration n -> Bool #

Eq a => Eq (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

(==) :: Plucker a -> Plucker a -> Bool #

(/=) :: Plucker a -> Plucker a -> Bool #

Eq a => Eq (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

(==) :: Quaternion a -> Quaternion a -> Bool #

(/=) :: Quaternion a -> Quaternion a -> Bool #

Eq (V0 a) 
Instance details

Defined in Linear.V0

Methods

(==) :: V0 a -> V0 a -> Bool #

(/=) :: V0 a -> V0 a -> Bool #

Eq a => Eq (V4 a) 
Instance details

Defined in Linear.V4

Methods

(==) :: V4 a -> V4 a -> Bool #

(/=) :: V4 a -> V4 a -> Bool #

(Eq a, Eq b) => Eq (Either a b)

Since: base-2.1

Instance details

Defined in Data.Either

Methods

(==) :: Either a b -> Either a b -> Bool #

(/=) :: Either a b -> Either a b -> Bool #

Eq (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: V1 p -> V1 p -> Bool #

(/=) :: V1 p -> V1 p -> Bool #

Eq (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: U1 p -> U1 p -> Bool #

(/=) :: U1 p -> U1 p -> Bool #

Eq (TypeRep a)

Since: base-2.1

Instance details

Defined in Data.Typeable.Internal

Methods

(==) :: TypeRep a -> TypeRep a -> Bool #

(/=) :: TypeRep a -> TypeRep a -> Bool #

(Eq a, Eq b) => Eq (a, b) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b) -> (a, b) -> Bool #

(/=) :: (a, b) -> (a, b) -> Bool #

(Eq k, Eq v) => Eq (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(==) :: HashMap k v -> HashMap k v -> Bool #

(/=) :: HashMap k v -> HashMap k v -> Bool #

(Eq k, Eq a) => Eq (Map k a) 
Instance details

Defined in Data.Map.Internal

Methods

(==) :: Map k a -> Map k a -> Bool #

(/=) :: Map k a -> Map k a -> Bool #

Eq (IOUArray i e) 
Instance details

Defined in Data.Array.IO.Internals

Methods

(==) :: IOUArray i e -> IOUArray i e -> Bool #

(/=) :: IOUArray i e -> IOUArray i e -> Bool #

(Ix ix, Eq e, IArray UArray e) => Eq (UArray ix e) 
Instance details

Defined in Data.Array.Base

Methods

(==) :: UArray ix e -> UArray ix e -> Bool #

(/=) :: UArray ix e -> UArray ix e -> Bool #

(Ix i, Eq e) => Eq (Array i e)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

(==) :: Array i e -> Array i e -> Bool #

(/=) :: Array i e -> Array i e -> Bool #

Eq (IOArray i e)

Since: base-4.1.0.0

Instance details

Defined in GHC.IOArray

Methods

(==) :: IOArray i e -> IOArray i e -> Bool #

(/=) :: IOArray i e -> IOArray i e -> Bool #

Eq a => Eq (Arg a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(==) :: Arg a b -> Arg a b -> Bool #

(/=) :: Arg a b -> Arg a b -> Bool #

Eq (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(==) :: Proxy s -> Proxy s -> Bool #

(/=) :: Proxy s -> Proxy s -> Bool #

(Eq a, Eq b) => Eq (Bimap a b) 
Instance details

Defined in Data.Bimap

Methods

(==) :: Bimap a b -> Bimap a b -> Bool #

(/=) :: Bimap a b -> Bimap a b -> Bool #

(Eq1 m, Eq a) => Eq (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(==) :: MaybeT m a -> MaybeT m a -> Bool #

(/=) :: MaybeT m a -> MaybeT m a -> Bool #

(Eq a, Eq (s a)) => Eq (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: ViewL s a -> ViewL s a -> Bool #

(/=) :: ViewL s a -> ViewL s a -> Bool #

(Eq a, Eq (s a)) => Eq (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: ViewR s a -> ViewR s a -> Bool #

(/=) :: ViewR s a -> ViewR s a -> Bool #

Eq a => Eq (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: FingerTree v a -> FingerTree v a -> Bool #

(/=) :: FingerTree v a -> FingerTree v a -> Bool #

Eq a => Eq (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Methods

(==) :: SearchResult v a -> SearchResult v a -> Bool #

(/=) :: SearchResult v a -> SearchResult v a -> Bool #

(Generic1 f, Eq1 (Rep1 f), Eq a) => Eq (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

(==) :: Generically1 f a -> Generically1 f a -> Bool #

(/=) :: Generically1 f a -> Generically1 f a -> Bool #

Eq (ConId a) 
Instance details

Defined in Generic.Data.Internal.Meta

Methods

(==) :: ConId a -> ConId a -> Bool #

(/=) :: ConId a -> ConId a -> Bool #

Eq (GConId r) 
Instance details

Defined in Generic.Data.Internal.Meta

Methods

(==) :: GConId r -> GConId r -> Bool #

(/=) :: GConId r -> GConId r -> Bool #

(Eq t, KnownNat m) => Eq (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

(==) :: Mod m t -> Mod m t -> Bool #

(/=) :: Mod m t -> Mod m t -> Bool #

(Eq1 m, Eq a) => Eq (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(==) :: ListT m a -> ListT m a -> Bool #

(/=) :: ListT m a -> ListT m a -> Bool #

Eq (MutableUnliftedArray s a) 
Instance details

Defined in Data.Primitive.UnliftedArray

Methods

(==) :: MutableUnliftedArray s a -> MutableUnliftedArray s a -> Bool #

(/=) :: MutableUnliftedArray s a -> MutableUnliftedArray s a -> Bool #

Eq (SmallMutableArray s a) 
Instance details

Defined in Data.Primitive.SmallArray

Methods

(==) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool #

(/=) :: SmallMutableArray s a -> SmallMutableArray s a -> Bool #

Eq (MutableArray s a) 
Instance details

Defined in Data.Primitive.Array

Methods

(==) :: MutableArray s a -> MutableArray s a -> Bool #

(/=) :: MutableArray s a -> MutableArray s a -> Bool #

(Eq k, Eq v) => Eq (Leaf k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(==) :: Leaf k v -> Leaf k v -> Bool #

(/=) :: Leaf k v -> Leaf k v -> Bool #

(Ix i, Show i, Eq e) => Eq (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(==) :: AbstractArray i e -> AbstractArray i e -> Bool #

(/=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(Eq p, Eq a) => Eq (Categorical p a) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(==) :: Categorical p a -> Categorical p a -> Bool #

(/=) :: Categorical p a -> Categorical p a -> Bool #

(Eq a, Eq b) => Eq (ListF a b) 
Instance details

Defined in Data.Functor.Foldable

Methods

(==) :: ListF a b -> ListF a b -> Bool #

(/=) :: ListF a b -> ListF a b -> Bool #

(Eq1 f, Eq a) => Eq (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(==) :: Cofree f a -> Cofree f a -> Bool #

(/=) :: Cofree f a -> Cofree f a -> Bool #

(Eq1 f, Eq a) => Eq (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

(==) :: Free f a -> Free f a -> Bool #

(/=) :: Free f a -> Free f a -> Bool #

(Eq a, Eq b) => Eq (NonEmptyF a b) 
Instance details

Defined in Data.Functor.Base

Methods

(==) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

(/=) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

Eq (f a) => Eq (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(==) :: Point f a -> Point f a -> Bool #

(/=) :: Point f a -> Point f a -> Bool #

Eq (v n) => Eq (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

(==) :: Path v n -> Path v n -> Bool #

(/=) :: Path v n -> Path v n -> Bool #

Eq (v n) => Eq (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: Trail v n -> Trail v n -> Bool #

(/=) :: Trail v n -> Trail v n -> Bool #

(Eq i, Eq a) => Eq (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(==) :: Level i a -> Level i a -> Bool #

(/=) :: Level i a -> Level i a -> Bool #

Eq (v n) => Eq (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: SegTree v n -> SegTree v n -> Bool #

(/=) :: SegTree v n -> SegTree v n -> Bool #

Eq (v n) => Eq (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

(==) :: Direction v n -> Direction v n -> Bool #

(/=) :: Direction v n -> Direction v n -> Bool #

Eq (v n) => Eq (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(==) :: BoundingBox v n -> BoundingBox v n -> Bool #

(/=) :: BoundingBox v n -> BoundingBox v n -> Bool #

Eq (v n) => Eq (NonEmptyBoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(==) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> Bool #

(/=) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> Bool #

(Eq a, Eq b) => Eq (a :& b) 
Instance details

Defined in Diagrams.Coordinates

Methods

(==) :: (a :& b) -> (a :& b) -> Bool #

(/=) :: (a :& b) -> (a :& b) -> Bool #

(Eq1 f, Eq a) => Eq (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(==) :: Yoneda f a -> Yoneda f a -> Bool #

(/=) :: Yoneda f a -> Yoneda f a -> Bool #

Eq (f p) => Eq (Rec1 f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: Rec1 f p -> Rec1 f p -> Bool #

(/=) :: Rec1 f p -> Rec1 f p -> Bool #

Eq (URec (Ptr ()) p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(/=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

Eq (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Char p -> URec Char p -> Bool #

(/=) :: URec Char p -> URec Char p -> Bool #

Eq (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Double p -> URec Double p -> Bool #

(/=) :: URec Double p -> URec Double p -> Bool #

Eq (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Float p -> URec Float p -> Bool #

(/=) :: URec Float p -> URec Float p -> Bool #

Eq (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Int p -> URec Int p -> Bool #

(/=) :: URec Int p -> URec Int p -> Bool #

Eq (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Word p -> URec Word p -> Bool #

(/=) :: URec Word p -> URec Word p -> Bool #

(Eq a, Eq b, Eq c) => Eq (a, b, c) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c) -> (a, b, c) -> Bool #

(/=) :: (a, b, c) -> (a, b, c) -> Bool #

Eq (STUArray s i e) 
Instance details

Defined in Data.Array.Base

Methods

(==) :: STUArray s i e -> STUArray s i e -> Bool #

(/=) :: STUArray s i e -> STUArray s i e -> Bool #

Eq (STArray s i e)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

(==) :: STArray s i e -> STArray s i e -> Bool #

(/=) :: STArray s i e -> STArray s i e -> Bool #

Eq a => Eq (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

(==) :: Const a b -> Const a b -> Bool #

(/=) :: Const a b -> Const a b -> Bool #

Eq (f a) => Eq (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(==) :: Ap f a -> Ap f a -> Bool #

(/=) :: Ap f a -> Ap f a -> Bool #

Eq (f a) => Eq (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(==) :: Alt f a -> Alt f a -> Bool #

(/=) :: Alt f a -> Alt f a -> Bool #

Eq (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

(==) :: (a :~: b) -> (a :~: b) -> Bool #

(/=) :: (a :~: b) -> (a :~: b) -> Bool #

Eq (p a a) => Eq (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

(==) :: Join p a -> Join p a -> Bool #

(/=) :: Join p a -> Join p a -> Bool #

Eq (p (Fix p a) a) => Eq (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

(==) :: Fix p a -> Fix p a -> Bool #

(/=) :: Fix p a -> Fix p a -> Bool #

(Eq1 f, Eq a) => Eq (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(==) :: IdentityT f a -> IdentityT f a -> Bool #

(/=) :: IdentityT f a -> IdentityT f a -> Bool #

(Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(==) :: ExceptT e m a -> ExceptT e m a -> Bool #

(/=) :: ExceptT e m a -> ExceptT e m a -> Bool #

(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(==) :: WriterT w m a -> WriterT w m a -> Bool #

(/=) :: WriterT w m a -> WriterT w m a -> Bool #

(Eq e, Eq1 m, Eq a) => Eq (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(==) :: ErrorT e m a -> ErrorT e m a -> Bool #

(/=) :: ErrorT e m a -> ErrorT e m a -> Bool #

(Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(==) :: WriterT w m a -> WriterT w m a -> Bool #

(/=) :: WriterT w m a -> WriterT w m a -> Bool #

Eq b => Eq (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

(==) :: Tagged s b -> Tagged s b -> Bool #

(/=) :: Tagged s b -> Tagged s b -> Bool #

(Eq1 f, Eq a) => Eq (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

(==) :: Backwards f a -> Backwards f a -> Bool #

(/=) :: Backwards f a -> Backwards f a -> Bool #

Eq (w (CofreeF f a (CofreeT f w a))) => Eq (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(==) :: CofreeT f w a -> CofreeT f w a -> Bool #

(/=) :: CofreeT f w a -> CofreeT f w a -> Bool #

(Eq a, Eq (f b)) => Eq (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(==) :: CofreeF f a b -> CofreeF f a b -> Bool #

(/=) :: CofreeF f a b -> CofreeF f a b -> Bool #

(Eq1 f, Eq1 m, Eq a) => Eq (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(==) :: FreeT f m a -> FreeT f m a -> Bool #

(/=) :: FreeT f m a -> FreeT f m a -> Bool #

(Eq a, Eq (f b)) => Eq (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(==) :: FreeF f a b -> FreeF f a b -> Bool #

(/=) :: FreeF f a b -> FreeF f a b -> Bool #

Eq (v n) => Eq (Segment c v n) 
Instance details

Defined in Diagrams.Segment

Methods

(==) :: Segment c v n -> Segment c v n -> Bool #

(/=) :: Segment c v n -> Segment c v n -> Bool #

Eq (v n) => Eq (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

(==) :: Trail' l v n -> Trail' l v n -> Bool #

(/=) :: Trail' l v n -> Trail' l v n -> Bool #

Eq (v n) => Eq (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

(==) :: Offset c v n -> Offset c v n -> Bool #

(/=) :: Offset c v n -> Offset c v n -> Bool #

Eq a => Eq (V n a) 
Instance details

Defined in Linear.V

Methods

(==) :: V n a -> V n a -> Bool #

(/=) :: V n a -> V n a -> Bool #

Eq c => Eq (K1 i c p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: K1 i c p -> K1 i c p -> Bool #

(/=) :: K1 i c p -> K1 i c p -> Bool #

(Eq (f p), Eq (g p)) => Eq ((f :+: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: (f :+: g) p -> (f :+: g) p -> Bool #

(/=) :: (f :+: g) p -> (f :+: g) p -> Bool #

(Eq (f p), Eq (g p)) => Eq ((f :*: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: (f :*: g) p -> (f :*: g) p -> Bool #

(/=) :: (f :*: g) p -> (f :*: g) p -> Bool #

(Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(/=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(==) :: Product f g a -> Product f g a -> Bool #

(/=) :: Product f g a -> Product f g a -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

(==) :: Sum f g a -> Sum f g a -> Bool #

(/=) :: Sum f g a -> Sum f g a -> Bool #

Eq (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

(==) :: (a :~~: b) -> (a :~~: b) -> Bool #

(/=) :: (a :~~: b) -> (a :~~: b) -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTree d u a l -> DUALTree d u a l -> Bool #

(/=) :: DUALTree d u a l -> DUALTree d u a l -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTreeU d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTreeU d u a l -> DUALTreeU d u a l -> Bool #

(/=) :: DUALTreeU d u a l -> DUALTreeU d u a l -> Bool #

(Eq u, Eq l, Eq d, Eq a) => Eq (DUALTreeNE d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(==) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> Bool #

(/=) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> Bool #

Eq (f p) => Eq (M1 i c f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: M1 i c f p -> M1 i c f p -> Bool #

(/=) :: M1 i c f p -> M1 i c f p -> Bool #

Eq (f (g p)) => Eq ((f :.: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: (f :.: g) p -> (f :.: g) p -> Bool #

(/=) :: (f :.: g) p -> (f :.: g) p -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(/=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

(==) :: Compose f g a -> Compose f g a -> Bool #

(/=) :: Compose f g a -> Compose f g a -> Bool #

Eq (p a b) => Eq (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

(==) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(/=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

Eq (g b) => Eq (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

(==) :: Joker g a b -> Joker g a b -> Bool #

(/=) :: Joker g a b -> Joker g a b -> Bool #

Eq (p b a) => Eq (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

(==) :: Flip p a b -> Flip p a b -> Bool #

(/=) :: Flip p a b -> Flip p a b -> Bool #

Eq (f a) => Eq (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

(==) :: Clown f a b -> Clown f a b -> Bool #

(/=) :: Clown f a b -> Clown f a b -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(/=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(Eq (p a b), Eq (q a b)) => Eq (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

(==) :: Sum p q a b -> Sum p q a b -> Bool #

(/=) :: Sum p q a b -> Sum p q a b -> Bool #

(Eq (f a b), Eq (g a b)) => Eq (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

(==) :: Product f g a b -> Product f g a b -> Bool #

(/=) :: Product f g a b -> Product f g a b -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(/=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

Eq (f (p a b)) => Eq (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

(==) :: Tannen f p a b -> Tannen f p a b -> Bool #

(/=) :: Tannen f p a b -> Tannen f p a b -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

Eq (p (f a) (g b)) => Eq (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

(==) :: Biff p f g a b -> Biff p f g a b -> Bool #

(/=) :: Biff p f g a b -> Biff p f g a b -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) 
Instance details

Defined in GHC.Classes

Methods

(==) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(/=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

class Fractional a => Floating a where #

Trigonometric and hyperbolic functions and related functions.

The Haskell Report defines no laws for Floating. However, '(+)', '(*)' + and exp are customarily expected to define an exponential field and have + the following properties:

  • exp (a + b) = @exp a * exp b
  • exp (fromInteger 0) = fromInteger 1

Minimal complete definition

pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh

Methods

pi :: a #

exp :: a -> a #

log :: a -> a #

sqrt :: a -> a #

(**) :: a -> a -> a infixr 8 #

logBase :: a -> a -> a #

sin :: a -> a #

cos :: a -> a #

tan :: a -> a #

asin :: a -> a #

acos :: a -> a #

atan :: a -> a #

sinh :: a -> a #

cosh :: a -> a #

tanh :: a -> a #

asinh :: a -> a #

acosh :: a -> a #

atanh :: a -> a #

Instances
Floating Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Double #

exp :: Double -> Double #

log :: Double -> Double #

sqrt :: Double -> Double #

(**) :: Double -> Double -> Double #

logBase :: Double -> Double -> Double #

sin :: Double -> Double #

cos :: Double -> Double #

tan :: Double -> Double #

asin :: Double -> Double #

acos :: Double -> Double #

atan :: Double -> Double #

sinh :: Double -> Double #

cosh :: Double -> Double #

tanh :: Double -> Double #

asinh :: Double -> Double #

acosh :: Double -> Double #

atanh :: Double -> Double #

log1p :: Double -> Double #

expm1 :: Double -> Double #

log1pexp :: Double -> Double #

log1mexp :: Double -> Double #

Floating Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Float #

exp :: Float -> Float #

log :: Float -> Float #

sqrt :: Float -> Float #

(**) :: Float -> Float -> Float #

logBase :: Float -> Float -> Float #

sin :: Float -> Float #

cos :: Float -> Float #

tan :: Float -> Float #

asin :: Float -> Float #

acos :: Float -> Float #

atan :: Float -> Float #

sinh :: Float -> Float #

cosh :: Float -> Float #

tanh :: Float -> Float #

asinh :: Float -> Float #

acosh :: Float -> Float #

atanh :: Float -> Float #

log1p :: Float -> Float #

expm1 :: Float -> Float #

log1pexp :: Float -> Float #

log1mexp :: Float -> Float #

Floating CFloat 
Instance details

Defined in Foreign.C.Types

Methods

pi :: CFloat #

exp :: CFloat -> CFloat #

log :: CFloat -> CFloat #

sqrt :: CFloat -> CFloat #

(**) :: CFloat -> CFloat -> CFloat #

logBase :: CFloat -> CFloat -> CFloat #

sin :: CFloat -> CFloat #

cos :: CFloat -> CFloat #

tan :: CFloat -> CFloat #

asin :: CFloat -> CFloat #

acos :: CFloat -> CFloat #

atan :: CFloat -> CFloat #

sinh :: CFloat -> CFloat #

cosh :: CFloat -> CFloat #

tanh :: CFloat -> CFloat #

asinh :: CFloat -> CFloat #

acosh :: CFloat -> CFloat #

atanh :: CFloat -> CFloat #

log1p :: CFloat -> CFloat #

expm1 :: CFloat -> CFloat #

log1pexp :: CFloat -> CFloat #

log1mexp :: CFloat -> CFloat #

Floating CDouble 
Instance details

Defined in Foreign.C.Types

Methods

pi :: CDouble #

exp :: CDouble -> CDouble #

log :: CDouble -> CDouble #

sqrt :: CDouble -> CDouble #

(**) :: CDouble -> CDouble -> CDouble #

logBase :: CDouble -> CDouble -> CDouble #

sin :: CDouble -> CDouble #

cos :: CDouble -> CDouble #

tan :: CDouble -> CDouble #

asin :: CDouble -> CDouble #

acos :: CDouble -> CDouble #

atan :: CDouble -> CDouble #

sinh :: CDouble -> CDouble #

cosh :: CDouble -> CDouble #

tanh :: CDouble -> CDouble #

asinh :: CDouble -> CDouble #

acosh :: CDouble -> CDouble #

atanh :: CDouble -> CDouble #

log1p :: CDouble -> CDouble #

expm1 :: CDouble -> CDouble #

log1pexp :: CDouble -> CDouble #

log1mexp :: CDouble -> CDouble #

Floating ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

pi :: ConstVal #

exp :: ConstVal -> ConstVal #

log :: ConstVal -> ConstVal #

sqrt :: ConstVal -> ConstVal #

(**) :: ConstVal -> ConstVal -> ConstVal #

logBase :: ConstVal -> ConstVal -> ConstVal #

sin :: ConstVal -> ConstVal #

cos :: ConstVal -> ConstVal #

tan :: ConstVal -> ConstVal #

asin :: ConstVal -> ConstVal #

acos :: ConstVal -> ConstVal #

atan :: ConstVal -> ConstVal #

sinh :: ConstVal -> ConstVal #

cosh :: ConstVal -> ConstVal #

tanh :: ConstVal -> ConstVal #

asinh :: ConstVal -> ConstVal #

acosh :: ConstVal -> ConstVal #

atanh :: ConstVal -> ConstVal #

log1p :: ConstVal -> ConstVal #

expm1 :: ConstVal -> ConstVal #

log1pexp :: ConstVal -> ConstVal #

log1mexp :: ConstVal -> ConstVal #

Floating DExpr # 
Instance details

Defined in Data.Expression

Methods

pi :: DExpr #

exp :: DExpr -> DExpr #

log :: DExpr -> DExpr #

sqrt :: DExpr -> DExpr #

(**) :: DExpr -> DExpr -> DExpr #

logBase :: DExpr -> DExpr -> DExpr #

sin :: DExpr -> DExpr #

cos :: DExpr -> DExpr #

tan :: DExpr -> DExpr #

asin :: DExpr -> DExpr #

acos :: DExpr -> DExpr #

atan :: DExpr -> DExpr #

sinh :: DExpr -> DExpr #

cosh :: DExpr -> DExpr #

tanh :: DExpr -> DExpr #

asinh :: DExpr -> DExpr #

acosh :: DExpr -> DExpr #

atanh :: DExpr -> DExpr #

log1p :: DExpr -> DExpr #

expm1 :: DExpr -> DExpr #

log1pexp :: DExpr -> DExpr #

log1mexp :: DExpr -> DExpr #

Floating LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: LogValue #

exp :: LogValue -> LogValue #

log :: LogValue -> LogValue #

sqrt :: LogValue -> LogValue #

(**) :: LogValue -> LogValue -> LogValue #

logBase :: LogValue -> LogValue -> LogValue #

sin :: LogValue -> LogValue #

cos :: LogValue -> LogValue #

tan :: LogValue -> LogValue #

asin :: LogValue -> LogValue #

acos :: LogValue -> LogValue #

atan :: LogValue -> LogValue #

sinh :: LogValue -> LogValue #

cosh :: LogValue -> LogValue #

tanh :: LogValue -> LogValue #

asinh :: LogValue -> LogValue #

acosh :: LogValue -> LogValue #

atanh :: LogValue -> LogValue #

log1p :: LogValue -> LogValue #

expm1 :: LogValue -> LogValue #

log1pexp :: LogValue -> LogValue #

log1mexp :: LogValue -> LogValue #

Floating Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

pi :: Percent #

exp :: Percent -> Percent #

log :: Percent -> Percent #

sqrt :: Percent -> Percent #

(**) :: Percent -> Percent -> Percent #

logBase :: Percent -> Percent -> Percent #

sin :: Percent -> Percent #

cos :: Percent -> Percent #

tan :: Percent -> Percent #

asin :: Percent -> Percent #

acos :: Percent -> Percent #

atan :: Percent -> Percent #

sinh :: Percent -> Percent #

cosh :: Percent -> Percent #

tanh :: Percent -> Percent #

asinh :: Percent -> Percent #

acosh :: Percent -> Percent #

atanh :: Percent -> Percent #

log1p :: Percent -> Percent #

expm1 :: Percent -> Percent #

log1pexp :: Percent -> Percent #

log1mexp :: Percent -> Percent #

Floating t => Floating [t] # 
Instance details

Defined in Util

Methods

pi :: [t] #

exp :: [t] -> [t] #

log :: [t] -> [t] #

sqrt :: [t] -> [t] #

(**) :: [t] -> [t] -> [t] #

logBase :: [t] -> [t] -> [t] #

sin :: [t] -> [t] #

cos :: [t] -> [t] #

tan :: [t] -> [t] #

asin :: [t] -> [t] #

acos :: [t] -> [t] #

atan :: [t] -> [t] #

sinh :: [t] -> [t] #

cosh :: [t] -> [t] #

tanh :: [t] -> [t] #

asinh :: [t] -> [t] #

acosh :: [t] -> [t] #

atanh :: [t] -> [t] #

log1p :: [t] -> [t] #

expm1 :: [t] -> [t] #

log1pexp :: [t] -> [t] #

log1mexp :: [t] -> [t] #

RealFloat a => Floating (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

pi :: Complex a #

exp :: Complex a -> Complex a #

log :: Complex a -> Complex a #

sqrt :: Complex a -> Complex a #

(**) :: Complex a -> Complex a -> Complex a #

logBase :: Complex a -> Complex a -> Complex a #

sin :: Complex a -> Complex a #

cos :: Complex a -> Complex a #

tan :: Complex a -> Complex a #

asin :: Complex a -> Complex a #

acos :: Complex a -> Complex a #

atan :: Complex a -> Complex a #

sinh :: Complex a -> Complex a #

cosh :: Complex a -> Complex a #

tanh :: Complex a -> Complex a #

asinh :: Complex a -> Complex a #

acosh :: Complex a -> Complex a #

atanh :: Complex a -> Complex a #

log1p :: Complex a -> Complex a #

expm1 :: Complex a -> Complex a #

log1pexp :: Complex a -> Complex a #

log1mexp :: Complex a -> Complex a #

Floating a => Floating (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

pi :: Identity a #

exp :: Identity a -> Identity a #

log :: Identity a -> Identity a #

sqrt :: Identity a -> Identity a #

(**) :: Identity a -> Identity a -> Identity a #

logBase :: Identity a -> Identity a -> Identity a #

sin :: Identity a -> Identity a #

cos :: Identity a -> Identity a #

tan :: Identity a -> Identity a #

asin :: Identity a -> Identity a #

acos :: Identity a -> Identity a #

atan :: Identity a -> Identity a #

sinh :: Identity a -> Identity a #

cosh :: Identity a -> Identity a #

tanh :: Identity a -> Identity a #

asinh :: Identity a -> Identity a #

acosh :: Identity a -> Identity a #

atanh :: Identity a -> Identity a #

log1p :: Identity a -> Identity a #

expm1 :: Identity a -> Identity a #

log1pexp :: Identity a -> Identity a #

log1mexp :: Identity a -> Identity a #

(RealFloat a, Ord a) => Floating (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

pi :: Interval a #

exp :: Interval a -> Interval a #

log :: Interval a -> Interval a #

sqrt :: Interval a -> Interval a #

(**) :: Interval a -> Interval a -> Interval a #

logBase :: Interval a -> Interval a -> Interval a #

sin :: Interval a -> Interval a #

cos :: Interval a -> Interval a #

tan :: Interval a -> Interval a #

asin :: Interval a -> Interval a #

acos :: Interval a -> Interval a #

atan :: Interval a -> Interval a #

sinh :: Interval a -> Interval a #

cosh :: Interval a -> Interval a #

tanh :: Interval a -> Interval a #

asinh :: Interval a -> Interval a #

acosh :: Interval a -> Interval a #

atanh :: Interval a -> Interval a #

log1p :: Interval a -> Interval a #

expm1 :: Interval a -> Interval a #

log1pexp :: Interval a -> Interval a #

log1mexp :: Interval a -> Interval a #

(RealFloat a, Precise a) => Floating (Log a) 
Instance details

Defined in Numeric.Log

Methods

pi :: Log a #

exp :: Log a -> Log a #

log :: Log a -> Log a #

sqrt :: Log a -> Log a #

(**) :: Log a -> Log a -> Log a #

logBase :: Log a -> Log a -> Log a #

sin :: Log a -> Log a #

cos :: Log a -> Log a #

tan :: Log a -> Log a #

asin :: Log a -> Log a #

acos :: Log a -> Log a #

atan :: Log a -> Log a #

sinh :: Log a -> Log a #

cosh :: Log a -> Log a #

tanh :: Log a -> Log a #

asinh :: Log a -> Log a #

acosh :: Log a -> Log a #

atanh :: Log a -> Log a #

log1p :: Log a -> Log a #

expm1 :: Log a -> Log a #

log1pexp :: Log a -> Log a #

log1mexp :: Log a -> Log a #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

Floating a => Floating (V2 a) 
Instance details

Defined in Linear.V2

Methods

pi :: V2 a #

exp :: V2 a -> V2 a #

log :: V2 a -> V2 a #

sqrt :: V2 a -> V2 a #

(**) :: V2 a -> V2 a -> V2 a #

logBase :: V2 a -> V2 a -> V2 a #

sin :: V2 a -> V2 a #

cos :: V2 a -> V2 a #

tan :: V2 a -> V2 a #

asin :: V2 a -> V2 a #

acos :: V2 a -> V2 a #

atan :: V2 a -> V2 a #

sinh :: V2 a -> V2 a #

cosh :: V2 a -> V2 a #

tanh :: V2 a -> V2 a #

asinh :: V2 a -> V2 a #

acosh :: V2 a -> V2 a #

atanh :: V2 a -> V2 a #

log1p :: V2 a -> V2 a #

expm1 :: V2 a -> V2 a #

log1pexp :: V2 a -> V2 a #

log1mexp :: V2 a -> V2 a #

Floating a => Floating (V3 a) 
Instance details

Defined in Linear.V3

Methods

pi :: V3 a #

exp :: V3 a -> V3 a #

log :: V3 a -> V3 a #

sqrt :: V3 a -> V3 a #

(**) :: V3 a -> V3 a -> V3 a #

logBase :: V3 a -> V3 a -> V3 a #

sin :: V3 a -> V3 a #

cos :: V3 a -> V3 a #

tan :: V3 a -> V3 a #

asin :: V3 a -> V3 a #

acos :: V3 a -> V3 a #

atan :: V3 a -> V3 a #

sinh :: V3 a -> V3 a #

cosh :: V3 a -> V3 a #

tanh :: V3 a -> V3 a #

asinh :: V3 a -> V3 a #

acosh :: V3 a -> V3 a #

atanh :: V3 a -> V3 a #

log1p :: V3 a -> V3 a #

expm1 :: V3 a -> V3 a #

log1pexp :: V3 a -> V3 a #

log1mexp :: V3 a -> V3 a #

Floating a => Floating (V1 a) 
Instance details

Defined in Linear.V1

Methods

pi :: V1 a #

exp :: V1 a -> V1 a #

log :: V1 a -> V1 a #

sqrt :: V1 a -> V1 a #

(**) :: V1 a -> V1 a -> V1 a #

logBase :: V1 a -> V1 a -> V1 a #

sin :: V1 a -> V1 a #

cos :: V1 a -> V1 a #

tan :: V1 a -> V1 a #

asin :: V1 a -> V1 a #

acos :: V1 a -> V1 a #

atan :: V1 a -> V1 a #

sinh :: V1 a -> V1 a #

cosh :: V1 a -> V1 a #

tanh :: V1 a -> V1 a #

asinh :: V1 a -> V1 a #

acosh :: V1 a -> V1 a #

atanh :: V1 a -> V1 a #

log1p :: V1 a -> V1 a #

expm1 :: V1 a -> V1 a #

log1pexp :: V1 a -> V1 a #

log1mexp :: V1 a -> V1 a #

Floating a => Floating (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

pi :: Plucker a #

exp :: Plucker a -> Plucker a #

log :: Plucker a -> Plucker a #

sqrt :: Plucker a -> Plucker a #

(**) :: Plucker a -> Plucker a -> Plucker a #

logBase :: Plucker a -> Plucker a -> Plucker a #

sin :: Plucker a -> Plucker a #

cos :: Plucker a -> Plucker a #

tan :: Plucker a -> Plucker a #

asin :: Plucker a -> Plucker a #

acos :: Plucker a -> Plucker a #

atan :: Plucker a -> Plucker a #

sinh :: Plucker a -> Plucker a #

cosh :: Plucker a -> Plucker a #

tanh :: Plucker a -> Plucker a #

asinh :: Plucker a -> Plucker a #

acosh :: Plucker a -> Plucker a #

atanh :: Plucker a -> Plucker a #

log1p :: Plucker a -> Plucker a #

expm1 :: Plucker a -> Plucker a #

log1pexp :: Plucker a -> Plucker a #

log1mexp :: Plucker a -> Plucker a #

RealFloat a => Floating (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

pi :: Quaternion a #

exp :: Quaternion a -> Quaternion a #

log :: Quaternion a -> Quaternion a #

sqrt :: Quaternion a -> Quaternion a #

(**) :: Quaternion a -> Quaternion a -> Quaternion a #

logBase :: Quaternion a -> Quaternion a -> Quaternion a #

sin :: Quaternion a -> Quaternion a #

cos :: Quaternion a -> Quaternion a #

tan :: Quaternion a -> Quaternion a #

asin :: Quaternion a -> Quaternion a #

acos :: Quaternion a -> Quaternion a #

atan :: Quaternion a -> Quaternion a #

sinh :: Quaternion a -> Quaternion a #

cosh :: Quaternion a -> Quaternion a #

tanh :: Quaternion a -> Quaternion a #

asinh :: Quaternion a -> Quaternion a #

acosh :: Quaternion a -> Quaternion a #

atanh :: Quaternion a -> Quaternion a #

log1p :: Quaternion a -> Quaternion a #

expm1 :: Quaternion a -> Quaternion a #

log1pexp :: Quaternion a -> Quaternion a #

log1mexp :: Quaternion a -> Quaternion a #

Floating (V0 a) 
Instance details

Defined in Linear.V0

Methods

pi :: V0 a #

exp :: V0 a -> V0 a #

log :: V0 a -> V0 a #

sqrt :: V0 a -> V0 a #

(**) :: V0 a -> V0 a -> V0 a #

logBase :: V0 a -> V0 a -> V0 a #

sin :: V0 a -> V0 a #

cos :: V0 a -> V0 a #

tan :: V0 a -> V0 a #

asin :: V0 a -> V0 a #

acos :: V0 a -> V0 a #

atan :: V0 a -> V0 a #

sinh :: V0 a -> V0 a #

cosh :: V0 a -> V0 a #

tanh :: V0 a -> V0 a #

asinh :: V0 a -> V0 a #

acosh :: V0 a -> V0 a #

atanh :: V0 a -> V0 a #

log1p :: V0 a -> V0 a #

expm1 :: V0 a -> V0 a #

log1pexp :: V0 a -> V0 a #

log1mexp :: V0 a -> V0 a #

Floating a => Floating (V4 a) 
Instance details

Defined in Linear.V4

Methods

pi :: V4 a #

exp :: V4 a -> V4 a #

log :: V4 a -> V4 a #

sqrt :: V4 a -> V4 a #

(**) :: V4 a -> V4 a -> V4 a #

logBase :: V4 a -> V4 a -> V4 a #

sin :: V4 a -> V4 a #

cos :: V4 a -> V4 a #

tan :: V4 a -> V4 a #

asin :: V4 a -> V4 a #

acos :: V4 a -> V4 a #

atan :: V4 a -> V4 a #

sinh :: V4 a -> V4 a #

cosh :: V4 a -> V4 a #

tanh :: V4 a -> V4 a #

asinh :: V4 a -> V4 a #

acosh :: V4 a -> V4 a #

atanh :: V4 a -> V4 a #

log1p :: V4 a -> V4 a #

expm1 :: V4 a -> V4 a #

log1pexp :: V4 a -> V4 a #

log1mexp :: V4 a -> V4 a #

Floating a => Floating (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

pi :: Op a b #

exp :: Op a b -> Op a b #

log :: Op a b -> Op a b #

sqrt :: Op a b -> Op a b #

(**) :: Op a b -> Op a b -> Op a b #

logBase :: Op a b -> Op a b -> Op a b #

sin :: Op a b -> Op a b #

cos :: Op a b -> Op a b #

tan :: Op a b -> Op a b #

asin :: Op a b -> Op a b #

acos :: Op a b -> Op a b #

atan :: Op a b -> Op a b #

sinh :: Op a b -> Op a b #

cosh :: Op a b -> Op a b #

tanh :: Op a b -> Op a b #

asinh :: Op a b -> Op a b #

acosh :: Op a b -> Op a b #

atanh :: Op a b -> Op a b #

log1p :: Op a b -> Op a b #

expm1 :: Op a b -> Op a b #

log1pexp :: Op a b -> Op a b #

log1mexp :: Op a b -> Op a b #

Floating a => Floating (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

pi :: Measured n a #

exp :: Measured n a -> Measured n a #

log :: Measured n a -> Measured n a #

sqrt :: Measured n a -> Measured n a #

(**) :: Measured n a -> Measured n a -> Measured n a #

logBase :: Measured n a -> Measured n a -> Measured n a #

sin :: Measured n a -> Measured n a #

cos :: Measured n a -> Measured n a #

tan :: Measured n a -> Measured n a #

asin :: Measured n a -> Measured n a #

acos :: Measured n a -> Measured n a #

atan :: Measured n a -> Measured n a #

sinh :: Measured n a -> Measured n a #

cosh :: Measured n a -> Measured n a #

tanh :: Measured n a -> Measured n a #

asinh :: Measured n a -> Measured n a #

acosh :: Measured n a -> Measured n a #

atanh :: Measured n a -> Measured n a #

log1p :: Measured n a -> Measured n a #

expm1 :: Measured n a -> Measured n a #

log1pexp :: Measured n a -> Measured n a #

log1mexp :: Measured n a -> Measured n a #

Floating a => Floating (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

pi :: Const a b #

exp :: Const a b -> Const a b #

log :: Const a b -> Const a b #

sqrt :: Const a b -> Const a b #

(**) :: Const a b -> Const a b -> Const a b #

logBase :: Const a b -> Const a b -> Const a b #

sin :: Const a b -> Const a b #

cos :: Const a b -> Const a b #

tan :: Const a b -> Const a b #

asin :: Const a b -> Const a b #

acos :: Const a b -> Const a b #

atan :: Const a b -> Const a b #

sinh :: Const a b -> Const a b #

cosh :: Const a b -> Const a b #

tanh :: Const a b -> Const a b #

asinh :: Const a b -> Const a b #

acosh :: Const a b -> Const a b #

atanh :: Const a b -> Const a b #

log1p :: Const a b -> Const a b #

expm1 :: Const a b -> Const a b #

log1pexp :: Const a b -> Const a b #

log1mexp :: Const a b -> Const a b #

Floating a => Floating (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

pi :: Tagged s a #

exp :: Tagged s a -> Tagged s a #

log :: Tagged s a -> Tagged s a #

sqrt :: Tagged s a -> Tagged s a #

(**) :: Tagged s a -> Tagged s a -> Tagged s a #

logBase :: Tagged s a -> Tagged s a -> Tagged s a #

sin :: Tagged s a -> Tagged s a #

cos :: Tagged s a -> Tagged s a #

tan :: Tagged s a -> Tagged s a #

asin :: Tagged s a -> Tagged s a #

acos :: Tagged s a -> Tagged s a #

atan :: Tagged s a -> Tagged s a #

sinh :: Tagged s a -> Tagged s a #

cosh :: Tagged s a -> Tagged s a #

tanh :: Tagged s a -> Tagged s a #

asinh :: Tagged s a -> Tagged s a #

acosh :: Tagged s a -> Tagged s a #

atanh :: Tagged s a -> Tagged s a #

log1p :: Tagged s a -> Tagged s a #

expm1 :: Tagged s a -> Tagged s a #

log1pexp :: Tagged s a -> Tagged s a #

log1mexp :: Tagged s a -> Tagged s a #

(Dim n, Floating a) => Floating (V n a) 
Instance details

Defined in Linear.V

Methods

pi :: V n a #

exp :: V n a -> V n a #

log :: V n a -> V n a #

sqrt :: V n a -> V n a #

(**) :: V n a -> V n a -> V n a #

logBase :: V n a -> V n a -> V n a #

sin :: V n a -> V n a #

cos :: V n a -> V n a #

tan :: V n a -> V n a #

asin :: V n a -> V n a #

acos :: V n a -> V n a #

atan :: V n a -> V n a #

sinh :: V n a -> V n a #

cosh :: V n a -> V n a #

tanh :: V n a -> V n a #

asinh :: V n a -> V n a #

acosh :: V n a -> V n a #

atanh :: V n a -> V n a #

log1p :: V n a -> V n a #

expm1 :: V n a -> V n a #

log1pexp :: V n a -> V n a #

log1mexp :: V n a -> V n a #

class Num a => Fractional a where #

Fractional numbers, supporting real division.

The Haskell Report defines no laws for Fractional. However, '(+)' and + '(*)' are customarily expected to define a division ring and have the + following properties:

recip gives the multiplicative inverse
x * recip x = recip x * x = fromInteger 1

Note that it isn't customarily expected that a type instance of + Fractional implement a field. However, all instances in base do.

Minimal complete definition

fromRational, (recip | (/))

Methods

(/) :: a -> a -> a infixl 7 #

fractional division

recip :: a -> a #

reciprocal fraction

fromRational :: Rational -> a #

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 Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: Percent -> Percent -> Percent #

recip :: Percent -> Percent #

fromRational :: Rational -> Percent #

Fractional LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: LogValue -> LogValue -> LogValue #

recip :: LogValue -> LogValue #

fromRational :: Rational -> LogValue #

Fractional CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(/) :: CFloat -> CFloat -> CFloat #

recip :: CFloat -> CFloat #

fromRational :: Rational -> CFloat #

Fractional CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(/) :: CDouble -> CDouble -> CDouble #

recip :: CDouble -> CDouble #

fromRational :: Rational -> CDouble #

Fractional NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(/) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

recip :: NominalDiffTime -> NominalDiffTime #

fromRational :: Rational -> NominalDiffTime #

Fractional DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(/) :: DiffTime -> DiffTime -> DiffTime #

recip :: DiffTime -> DiffTime #

fromRational :: Rational -> DiffTime #

Fractional Scientific 
Instance details

Defined in Data.Scientific

Methods

(/) :: Scientific -> Scientific -> Scientific #

recip :: Scientific -> Scientific #

fromRational :: Rational -> Scientific #

Fractional LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(/) :: LogFloat -> LogFloat -> LogFloat #

recip :: LogFloat -> LogFloat #

fromRational :: Rational -> LogFloat #

Fractional ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(/) :: ConstVal -> ConstVal -> ConstVal #

recip :: ConstVal -> ConstVal #

fromRational :: Rational -> ConstVal #

Fractional DExpr # 
Instance details

Defined in Data.Expression

Methods

(/) :: DExpr -> DExpr -> DExpr #

recip :: DExpr -> DExpr #

fromRational :: Rational -> DExpr #

Fractional t => Fractional [t] # 
Instance details

Defined in Util

Methods

(/) :: [t] -> [t] -> [t] #

recip :: [t] -> [t] #

fromRational :: Rational -> [t] #

Integral a => Fractional (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

(/) :: Ratio a -> Ratio a -> Ratio a #

recip :: Ratio a -> Ratio a #

fromRational :: Rational -> Ratio a #

Fractional a => Fractional (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(/) :: Identity a -> Identity a -> Identity a #

recip :: Identity a -> Identity a #

fromRational :: Rational -> Identity a #

RealFloat a => Fractional (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

(/) :: Complex a -> Complex a -> Complex a #

recip :: Complex a -> Complex a #

fromRational :: Rational -> Complex a #

Fractional a => Fractional (V3 a) 
Instance details

Defined in Linear.V3

Methods

(/) :: V3 a -> V3 a -> V3 a #

recip :: V3 a -> V3 a #

fromRational :: Rational -> V3 a #

Fractional a => Fractional (V2 a) 
Instance details

Defined in Linear.V2

Methods

(/) :: V2 a -> V2 a -> V2 a #

recip :: V2 a -> V2 a #

fromRational :: Rational -> V2 a #

(Precise a, RealFloat a) => Fractional (Log a) 
Instance details

Defined in Numeric.Log

Methods

(/) :: Log a -> Log a -> Log a #

recip :: Log a -> Log a #

fromRational :: Rational -> Log a #

Fractional n => Fractional (Time n) 
Instance details

Defined in Data.Active

Methods

(/) :: Time n -> Time n -> Time n #

recip :: Time n -> Time n #

fromRational :: Rational -> Time n #

(Fractional a, Ord a) => Fractional (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(/) :: Interval a -> Interval a -> Interval a #

recip :: Interval a -> Interval a #

fromRational :: Rational -> Interval a #

Fractional a => Fractional (V1 a) 
Instance details

Defined in Linear.V1

Methods

(/) :: V1 a -> V1 a -> V1 a #

recip :: V1 a -> V1 a #

fromRational :: Rational -> V1 a #

Fractional n => Fractional (Duration n) 
Instance details

Defined in Data.Active

Methods

(/) :: Duration n -> Duration n -> Duration n #

recip :: Duration n -> Duration n #

fromRational :: Rational -> Duration n #

Fractional a => Fractional (V4 a) 
Instance details

Defined in Linear.V4

Methods

(/) :: V4 a -> V4 a -> V4 a #

recip :: V4 a -> V4 a #

fromRational :: Rational -> V4 a #

Fractional a => Fractional (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

(/) :: Plucker a -> Plucker a -> Plucker a #

recip :: Plucker a -> Plucker a #

fromRational :: Rational -> Plucker a #

RealFloat a => Fractional (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

(/) :: Quaternion a -> Quaternion a -> Quaternion a #

recip :: Quaternion a -> Quaternion a #

fromRational :: Rational -> Quaternion a #

Fractional (V0 a) 
Instance details

Defined in Linear.V0

Methods

(/) :: V0 a -> V0 a -> V0 a #

recip :: V0 a -> V0 a #

fromRational :: Rational -> V0 a #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

Fractional (f a) => Fractional (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(/) :: Point f a -> Point f a -> Point f a #

recip :: Point f a -> Point f a #

fromRational :: Rational -> Point f a #

(Show (Mod m t), Num (Mod m t), Eq t, KnownNat m) => Fractional (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

(/) :: Mod m t -> Mod m t -> Mod m t #

recip :: Mod m t -> Mod m t #

fromRational :: Rational -> Mod m t #

Fractional a => Fractional (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(/) :: Measured n a -> Measured n a -> Measured n a #

recip :: Measured n a -> Measured n a #

fromRational :: Rational -> Measured n a #

Fractional a => Fractional (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(/) :: Op a b -> Op a b -> Op a b #

recip :: Op a b -> Op a b #

fromRational :: Rational -> Op a b #

Fractional a => Fractional (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

(/) :: Const a b -> Const a b -> Const a b #

recip :: Const a b -> Const a b #

fromRational :: Rational -> Const a b #

Fractional a => Fractional (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(/) :: Tagged s a -> Tagged s a -> Tagged s a #

recip :: Tagged s a -> Tagged s a #

fromRational :: Rational -> Tagged s a #

(Dim n, Fractional a) => Fractional (V n a) 
Instance details

Defined in Linear.V

Methods

(/) :: V n a -> V n a -> V n a #

recip :: V n a -> V n a #

fromRational :: Rational -> V n a #

class (Real a, Enum a) => Integral a where #

Integral numbers, supporting integer division.

Minimal complete definition

quotRem, toInteger

Methods

quot :: a -> a -> a infixl 7 #

integer division truncated toward zero

rem :: a -> a -> a infixl 7 #

integer remainder, satisfying

(x `quot` y)*y + (x `rem` y) == x

div :: a -> a -> a infixl 7 #

integer division truncated toward negative infinity

mod :: a -> a -> a infixl 7 #

integer modulus, satisfying

(x `div` y)*y + (x `mod` y) == x

quotRem :: a -> a -> (a, a) #

simultaneous quot and rem

divMod :: a -> a -> (a, a) #

simultaneous div and mod

toInteger :: a -> Integer #

conversion to Integer

Instances
Integral Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Int -> Int -> Int #

rem :: Int -> Int -> Int #

div :: Int -> Int -> Int #

mod :: Int -> Int -> Int #

quotRem :: Int -> Int -> (Int, Int) #

divMod :: Int -> Int -> (Int, Int) #

toInteger :: Int -> Integer #

Integral Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int8 -> Int8 -> Int8 #

rem :: Int8 -> Int8 -> Int8 #

div :: Int8 -> Int8 -> Int8 #

mod :: Int8 -> Int8 -> Int8 #

quotRem :: Int8 -> Int8 -> (Int8, Int8) #

divMod :: Int8 -> Int8 -> (Int8, Int8) #

toInteger :: Int8 -> Integer #

Integral Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int16 -> Int16 -> Int16 #

rem :: Int16 -> Int16 -> Int16 #

div :: Int16 -> Int16 -> Int16 #

mod :: Int16 -> Int16 -> Int16 #

quotRem :: Int16 -> Int16 -> (Int16, Int16) #

divMod :: Int16 -> Int16 -> (Int16, Int16) #

toInteger :: Int16 -> Integer #

Integral Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int32 -> Int32 -> Int32 #

rem :: Int32 -> Int32 -> Int32 #

div :: Int32 -> Int32 -> Int32 #

mod :: Int32 -> Int32 -> Int32 #

quotRem :: Int32 -> Int32 -> (Int32, Int32) #

divMod :: Int32 -> Int32 -> (Int32, Int32) #

toInteger :: Int32 -> Integer #

Integral Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int64 -> Int64 -> Int64 #

rem :: Int64 -> Int64 -> Int64 #

div :: Int64 -> Int64 -> Int64 #

mod :: Int64 -> Int64 -> Int64 #

quotRem :: Int64 -> Int64 -> (Int64, Int64) #

divMod :: Int64 -> Int64 -> (Int64, Int64) #

toInteger :: Int64 -> Integer #

Integral Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Integer -> Integer -> Integer #

rem :: Integer -> Integer -> Integer #

div :: Integer -> Integer -> Integer #

mod :: Integer -> Integer -> Integer #

quotRem :: Integer -> Integer -> (Integer, Integer) #

divMod :: Integer -> Integer -> (Integer, Integer) #

toInteger :: Integer -> Integer #

Integral Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

quot :: Word -> Word -> Word #

rem :: Word -> Word -> Word #

div :: Word -> Word -> Word #

mod :: Word -> Word -> Word #

quotRem :: Word -> Word -> (Word, Word) #

divMod :: Word -> Word -> (Word, Word) #

toInteger :: Word -> Integer #

Integral Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word8 -> Word8 -> Word8 #

rem :: Word8 -> Word8 -> Word8 #

div :: Word8 -> Word8 -> Word8 #

mod :: Word8 -> Word8 -> Word8 #

quotRem :: Word8 -> Word8 -> (Word8, Word8) #

divMod :: Word8 -> Word8 -> (Word8, Word8) #

toInteger :: Word8 -> Integer #

Integral Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word16 -> Word16 -> Word16 #

rem :: Word16 -> Word16 -> Word16 #

div :: Word16 -> Word16 -> Word16 #

mod :: Word16 -> Word16 -> Word16 #

quotRem :: Word16 -> Word16 -> (Word16, Word16) #

divMod :: Word16 -> Word16 -> (Word16, Word16) #

toInteger :: Word16 -> Integer #

Integral Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word32 -> Word32 -> Word32 #

rem :: Word32 -> Word32 -> Word32 #

div :: Word32 -> Word32 -> Word32 #

mod :: Word32 -> Word32 -> Word32 #

quotRem :: Word32 -> Word32 -> (Word32, Word32) #

divMod :: Word32 -> Word32 -> (Word32, Word32) #

toInteger :: Word32 -> Integer #

Integral Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word64 -> Word64 -> Word64 #

rem :: Word64 -> Word64 -> Word64 #

div :: Word64 -> Word64 -> Word64 #

mod :: Word64 -> Word64 -> Word64 #

quotRem :: Word64 -> Word64 -> (Word64, Word64) #

divMod :: Word64 -> Word64 -> (Word64, Word64) #

toInteger :: Word64 -> Integer #

Integral PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

quot :: PlotIndex -> PlotIndex -> PlotIndex #

rem :: PlotIndex -> PlotIndex -> PlotIndex #

div :: PlotIndex -> PlotIndex -> PlotIndex #

mod :: PlotIndex -> PlotIndex -> PlotIndex #

quotRem :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

divMod :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

toInteger :: PlotIndex -> Integer #

Integral CChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CChar -> CChar -> CChar #

rem :: CChar -> CChar -> CChar #

div :: CChar -> CChar -> CChar #

mod :: CChar -> CChar -> CChar #

quotRem :: CChar -> CChar -> (CChar, CChar) #

divMod :: CChar -> CChar -> (CChar, CChar) #

toInteger :: CChar -> Integer #

Integral CSChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSChar -> CSChar -> CSChar #

rem :: CSChar -> CSChar -> CSChar #

div :: CSChar -> CSChar -> CSChar #

mod :: CSChar -> CSChar -> CSChar #

quotRem :: CSChar -> CSChar -> (CSChar, CSChar) #

divMod :: CSChar -> CSChar -> (CSChar, CSChar) #

toInteger :: CSChar -> Integer #

Integral CUChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUChar -> CUChar -> CUChar #

rem :: CUChar -> CUChar -> CUChar #

div :: CUChar -> CUChar -> CUChar #

mod :: CUChar -> CUChar -> CUChar #

quotRem :: CUChar -> CUChar -> (CUChar, CUChar) #

divMod :: CUChar -> CUChar -> (CUChar, CUChar) #

toInteger :: CUChar -> Integer #

Integral CShort 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CShort -> CShort -> CShort #

rem :: CShort -> CShort -> CShort #

div :: CShort -> CShort -> CShort #

mod :: CShort -> CShort -> CShort #

quotRem :: CShort -> CShort -> (CShort, CShort) #

divMod :: CShort -> CShort -> (CShort, CShort) #

toInteger :: CShort -> Integer #

Integral CUShort 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUShort -> CUShort -> CUShort #

rem :: CUShort -> CUShort -> CUShort #

div :: CUShort -> CUShort -> CUShort #

mod :: CUShort -> CUShort -> CUShort #

quotRem :: CUShort -> CUShort -> (CUShort, CUShort) #

divMod :: CUShort -> CUShort -> (CUShort, CUShort) #

toInteger :: CUShort -> Integer #

Integral CInt 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CInt -> CInt -> CInt #

rem :: CInt -> CInt -> CInt #

div :: CInt -> CInt -> CInt #

mod :: CInt -> CInt -> CInt #

quotRem :: CInt -> CInt -> (CInt, CInt) #

divMod :: CInt -> CInt -> (CInt, CInt) #

toInteger :: CInt -> Integer #

Integral CUInt 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUInt -> CUInt -> CUInt #

rem :: CUInt -> CUInt -> CUInt #

div :: CUInt -> CUInt -> CUInt #

mod :: CUInt -> CUInt -> CUInt #

quotRem :: CUInt -> CUInt -> (CUInt, CUInt) #

divMod :: CUInt -> CUInt -> (CUInt, CUInt) #

toInteger :: CUInt -> Integer #

Integral CLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CLong -> CLong -> CLong #

rem :: CLong -> CLong -> CLong #

div :: CLong -> CLong -> CLong #

mod :: CLong -> CLong -> CLong #

quotRem :: CLong -> CLong -> (CLong, CLong) #

divMod :: CLong -> CLong -> (CLong, CLong) #

toInteger :: CLong -> Integer #

Integral CULong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CULong -> CULong -> CULong #

rem :: CULong -> CULong -> CULong #

div :: CULong -> CULong -> CULong #

mod :: CULong -> CULong -> CULong #

quotRem :: CULong -> CULong -> (CULong, CULong) #

divMod :: CULong -> CULong -> (CULong, CULong) #

toInteger :: CULong -> Integer #

Integral CLLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CLLong -> CLLong -> CLLong #

rem :: CLLong -> CLLong -> CLLong #

div :: CLLong -> CLLong -> CLLong #

mod :: CLLong -> CLLong -> CLLong #

quotRem :: CLLong -> CLLong -> (CLLong, CLLong) #

divMod :: CLLong -> CLLong -> (CLLong, CLLong) #

toInteger :: CLLong -> Integer #

Integral CULLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CULLong -> CULLong -> CULLong #

rem :: CULLong -> CULLong -> CULLong #

div :: CULLong -> CULLong -> CULLong #

mod :: CULLong -> CULLong -> CULLong #

quotRem :: CULLong -> CULLong -> (CULLong, CULLong) #

divMod :: CULLong -> CULLong -> (CULLong, CULLong) #

toInteger :: CULLong -> Integer #

Integral CBool 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CBool -> CBool -> CBool #

rem :: CBool -> CBool -> CBool #

div :: CBool -> CBool -> CBool #

mod :: CBool -> CBool -> CBool #

quotRem :: CBool -> CBool -> (CBool, CBool) #

divMod :: CBool -> CBool -> (CBool, CBool) #

toInteger :: CBool -> Integer #

Integral CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CPtrdiff -> CPtrdiff -> CPtrdiff #

rem :: CPtrdiff -> CPtrdiff -> CPtrdiff #

div :: CPtrdiff -> CPtrdiff -> CPtrdiff #

mod :: CPtrdiff -> CPtrdiff -> CPtrdiff #

quotRem :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) #

divMod :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) #

toInteger :: CPtrdiff -> Integer #

Integral CSize 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSize -> CSize -> CSize #

rem :: CSize -> CSize -> CSize #

div :: CSize -> CSize -> CSize #

mod :: CSize -> CSize -> CSize #

quotRem :: CSize -> CSize -> (CSize, CSize) #

divMod :: CSize -> CSize -> (CSize, CSize) #

toInteger :: CSize -> Integer #

Integral CWchar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CWchar -> CWchar -> CWchar #

rem :: CWchar -> CWchar -> CWchar #

div :: CWchar -> CWchar -> CWchar #

mod :: CWchar -> CWchar -> CWchar #

quotRem :: CWchar -> CWchar -> (CWchar, CWchar) #

divMod :: CWchar -> CWchar -> (CWchar, CWchar) #

toInteger :: CWchar -> Integer #

Integral CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSigAtomic -> CSigAtomic -> CSigAtomic #

rem :: CSigAtomic -> CSigAtomic -> CSigAtomic #

div :: CSigAtomic -> CSigAtomic -> CSigAtomic #

mod :: CSigAtomic -> CSigAtomic -> CSigAtomic #

quotRem :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) #

divMod :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) #

toInteger :: CSigAtomic -> Integer #

Integral CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CIntPtr -> CIntPtr -> CIntPtr #

rem :: CIntPtr -> CIntPtr -> CIntPtr #

div :: CIntPtr -> CIntPtr -> CIntPtr #

mod :: CIntPtr -> CIntPtr -> CIntPtr #

quotRem :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) #

divMod :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) #

toInteger :: CIntPtr -> Integer #

Integral CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUIntPtr -> CUIntPtr -> CUIntPtr #

rem :: CUIntPtr -> CUIntPtr -> CUIntPtr #

div :: CUIntPtr -> CUIntPtr -> CUIntPtr #

mod :: CUIntPtr -> CUIntPtr -> CUIntPtr #

quotRem :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) #

divMod :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) #

toInteger :: CUIntPtr -> Integer #

Integral CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CIntMax -> CIntMax -> CIntMax #

rem :: CIntMax -> CIntMax -> CIntMax #

div :: CIntMax -> CIntMax -> CIntMax #

mod :: CIntMax -> CIntMax -> CIntMax #

quotRem :: CIntMax -> CIntMax -> (CIntMax, CIntMax) #

divMod :: CIntMax -> CIntMax -> (CIntMax, CIntMax) #

toInteger :: CIntMax -> Integer #

Integral CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUIntMax -> CUIntMax -> CUIntMax #

rem :: CUIntMax -> CUIntMax -> CUIntMax #

div :: CUIntMax -> CUIntMax -> CUIntMax #

mod :: CUIntMax -> CUIntMax -> CUIntMax #

quotRem :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) #

divMod :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) #

toInteger :: CUIntMax -> Integer #

Integral Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

quot :: Crossings -> Crossings -> Crossings #

rem :: Crossings -> Crossings -> Crossings #

div :: Crossings -> Crossings -> Crossings #

mod :: Crossings -> Crossings -> Crossings #

quotRem :: Crossings -> Crossings -> (Crossings, Crossings) #

divMod :: Crossings -> Crossings -> (Crossings, Crossings) #

toInteger :: Crossings -> Integer #

Integral ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

quot :: ConstVal -> ConstVal -> ConstVal #

rem :: ConstVal -> ConstVal -> ConstVal #

div :: ConstVal -> ConstVal -> ConstVal #

mod :: ConstVal -> ConstVal -> ConstVal #

quotRem :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

divMod :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

toInteger :: ConstVal -> Integer #

Integral a => Integral (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a #

rem :: Identity a -> Identity a -> Identity a #

div :: Identity a -> Identity a -> Identity a #

mod :: Identity a -> Identity a -> Identity a #

quotRem :: Identity a -> Identity a -> (Identity a, Identity a) #

divMod :: Identity a -> Identity a -> (Identity a, Identity a) #

toInteger :: Identity a -> Integer #

Integral n => Integral (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

quot :: VarInt n -> VarInt n -> VarInt n #

rem :: VarInt n -> VarInt n -> VarInt n #

div :: VarInt n -> VarInt n -> VarInt n #

mod :: VarInt n -> VarInt n -> VarInt n #

quotRem :: VarInt n -> VarInt n -> (VarInt n, VarInt n) #

divMod :: VarInt n -> VarInt n -> (VarInt n, VarInt n) #

toInteger :: VarInt n -> Integer #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(Integral t, KnownNat m, Num (Mod m t)) => Integral (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

quot :: Mod m t -> Mod m t -> Mod m t #

rem :: Mod m t -> Mod m t -> Mod m t #

div :: Mod m t -> Mod m t -> Mod m t #

mod :: Mod m t -> Mod m t -> Mod m t #

quotRem :: Mod m t -> Mod m t -> (Mod m t, Mod m t) #

divMod :: Mod m t -> Mod m t -> (Mod m t, Mod m t) #

toInteger :: Mod m t -> Integer #

Integral a => Integral (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

quot :: Const a b -> Const a b -> Const a b #

rem :: Const a b -> Const a b -> Const a b #

div :: Const a b -> Const a b -> Const a b #

mod :: Const a b -> Const a b -> Const a b #

quotRem :: Const a b -> Const a b -> (Const a b, Const a b) #

divMod :: Const a b -> Const a b -> (Const a b, Const a b) #

toInteger :: Const a b -> Integer #

Integral a => Integral (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

quot :: Tagged s a -> Tagged s a -> Tagged s a #

rem :: Tagged s a -> Tagged s a -> Tagged s a #

div :: Tagged s a -> Tagged s a -> Tagged s a #

mod :: Tagged s a -> Tagged s a -> Tagged s a #

quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #

divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #

toInteger :: Tagged s a -> Integer #

class Applicative m => Monad (m :: * -> *) where #

The Monad class defines the basic operations over a monad, + (Fractional a) => a.

Instances
Fractional Scientific

WARNING: recip and / will throw an error when their outputs are + repeating decimals.

fromRational will throw an error when the input Rational is a repeating + decimal. Consider using fromRationalRepetend for these rationals which + will detect the repetition and indicate where it starts.

Instance details

Defined in Data.Scientific

Methods

(/) :: Scientific -> Scientific -> Scientific #

recip :: Scientific -> Scientific #

fromRational :: Rational -> Scientific #

Fractional CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(/) :: CFloat -> CFloat -> CFloat #

recip :: CFloat -> CFloat #

fromRational :: Rational -> CFloat #

Fractional CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(/) :: CDouble -> CDouble -> CDouble #

recip :: CDouble -> CDouble #

fromRational :: Rational -> CDouble #

Fractional LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(/) :: LogFloat -> LogFloat -> LogFloat #

recip :: LogFloat -> LogFloat #

fromRational :: Rational -> LogFloat #

Fractional NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(/) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

recip :: NominalDiffTime -> NominalDiffTime #

fromRational :: Rational -> NominalDiffTime #

Fractional DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(/) :: DiffTime -> DiffTime -> DiffTime #

recip :: DiffTime -> DiffTime #

fromRational :: Rational -> DiffTime #

Fractional ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(/) :: ConstVal -> ConstVal -> ConstVal #

recip :: ConstVal -> ConstVal #

fromRational :: Rational -> ConstVal #

Fractional DExpr # 
Instance details

Defined in Data.Expression

Methods

(/) :: DExpr -> DExpr -> DExpr #

recip :: DExpr -> DExpr #

fromRational :: Rational -> DExpr #

Fractional LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: LogValue -> LogValue -> LogValue #

recip :: LogValue -> LogValue #

fromRational :: Rational -> LogValue #

Fractional Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(/) :: Percent -> Percent -> Percent #

recip :: Percent -> Percent #

fromRational :: Rational -> Percent #

Fractional t => Fractional [t] # 
Instance details

Defined in Util

Methods

(/) :: [t] -> [t] -> [t] #

recip :: [t] -> [t] #

fromRational :: Rational -> [t] #

Integral a => Fractional (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

(/) :: Ratio a -> Ratio a -> Ratio a #

recip :: Ratio a -> Ratio a #

fromRational :: Rational -> Ratio a #

RealFloat a => Fractional (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

(/) :: Complex a -> Complex a -> Complex a #

recip :: Complex a -> Complex a #

fromRational :: Rational -> Complex a #

Fractional a => Fractional (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(/) :: Identity a -> Identity a -> Identity a #

recip :: Identity a -> Identity a #

fromRational :: Rational -> Identity a #

(Fractional a, Ord a) => Fractional (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(/) :: Interval a -> Interval a -> Interval a #

recip :: Interval a -> Interval a #

fromRational :: Rational -> Interval a #

(Precise a, RealFloat a) => Fractional (Log a) 
Instance details

Defined in Numeric.Log

Methods

(/) :: Log a -> Log a -> Log a #

recip :: Log a -> Log a #

fromRational :: Rational -> Log a #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

Fractional a => Fractional (V2 a) 
Instance details

Defined in Linear.V2

Methods

(/) :: V2 a -> V2 a -> V2 a #

recip :: V2 a -> V2 a #

fromRational :: Rational -> V2 a #

Fractional n => Fractional (Time n) 
Instance details

Defined in Data.Active

Methods

(/) :: Time n -> Time n -> Time n #

recip :: Time n -> Time n #

fromRational :: Rational -> Time n #

Fractional a => Fractional (V3 a) 
Instance details

Defined in Linear.V3

Methods

(/) :: V3 a -> V3 a -> V3 a #

recip :: V3 a -> V3 a #

fromRational :: Rational -> V3 a #

Fractional a => Fractional (V1 a) 
Instance details

Defined in Linear.V1

Methods

(/) :: V1 a -> V1 a -> V1 a #

recip :: V1 a -> V1 a #

fromRational :: Rational -> V1 a #

Fractional n => Fractional (Duration n) 
Instance details

Defined in Data.Active

Methods

(/) :: Duration n -> Duration n -> Duration n #

recip :: Duration n -> Duration n #

fromRational :: Rational -> Duration n #

Fractional a => Fractional (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

(/) :: Plucker a -> Plucker a -> Plucker a #

recip :: Plucker a -> Plucker a #

fromRational :: Rational -> Plucker a #

RealFloat a => Fractional (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

(/) :: Quaternion a -> Quaternion a -> Quaternion a #

recip :: Quaternion a -> Quaternion a #

fromRational :: Rational -> Quaternion a #

Fractional (V0 a) 
Instance details

Defined in Linear.V0

Methods

(/) :: V0 a -> V0 a -> V0 a #

recip :: V0 a -> V0 a #

fromRational :: Rational -> V0 a #

Fractional a => Fractional (V4 a) 
Instance details

Defined in Linear.V4

Methods

(/) :: V4 a -> V4 a -> V4 a #

recip :: V4 a -> V4 a #

fromRational :: Rational -> V4 a #

Fractional a => Fractional (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(/) :: Op a b -> Op a b -> Op a b #

recip :: Op a b -> Op a b #

fromRational :: Rational -> Op a b #

(Show (Mod m t), Num (Mod m t), Eq t, KnownNat m) => Fractional (Mod m t)

this instance is only valid for prime m

Instance details

Defined in Internal.Modular

Methods

(/) :: Mod m t -> Mod m t -> Mod m t #

recip :: Mod m t -> Mod m t #

fromRational :: Rational -> Mod m t #

Fractional a => Fractional (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(/) :: Measured n a -> Measured n a -> Measured n a #

recip :: Measured n a -> Measured n a #

fromRational :: Rational -> Measured n a #

Fractional (f a) => Fractional (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(/) :: Point f a -> Point f a -> Point f a #

recip :: Point f a -> Point f a #

fromRational :: Rational -> Point f a #

Fractional a => Fractional (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

(/) :: Const a b -> Const a b -> Const a b #

recip :: Const a b -> Const a b #

fromRational :: Rational -> Const a b #

Fractional a => Fractional (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(/) :: Tagged s a -> Tagged s a -> Tagged s a #

recip :: Tagged s a -> Tagged s a #

fromRational :: Rational -> Tagged s a #

(Dim n, Fractional a) => Fractional (V n a) 
Instance details

Defined in Linear.V

Methods

(/) :: V n a -> V n a -> V n a #

recip :: V n a -> V n a #

fromRational :: Rational -> V n a #

class (Real a, Enum a) => Integral a where #

Integral numbers, supporting integer division.

The Haskell Report defines no laws for Integral. However, Integral + instances are customarily expected to define a Euclidean domain and have the + following properties for the 'div'/'mod' and 'quot'/'rem' pairs, given + suitable Euclidean functions f and g:

  • x = y * quot x y + rem x y with rem x y = fromInteger 0 or + g (rem x y) < g y
  • x = y * div x y + mod x y with mod x y = fromInteger 0 or + f (mod x y) < f y

An example of a suitable Euclidean function, for Integer's instance, is + abs.

Minimal complete definition

quotRem, toInteger

Methods

quot :: a -> a -> a infixl 7 #

integer division truncated toward zero

rem :: a -> a -> a infixl 7 #

integer remainder, satisfying

(x `quot` y)*y + (x `rem` y) == x

div :: a -> a -> a infixl 7 #

integer division truncated toward negative infinity

mod :: a -> a -> a infixl 7 #

integer modulus, satisfying

(x `div` y)*y + (x `mod` y) == x

quotRem :: a -> a -> (a, a) #

simultaneous quot and rem

divMod :: a -> a -> (a, a) #

simultaneous div and mod

toInteger :: a -> Integer #

conversion to Integer

Instances
Integral Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Int -> Int -> Int #

rem :: Int -> Int -> Int #

div :: Int -> Int -> Int #

mod :: Int -> Int -> Int #

quotRem :: Int -> Int -> (Int, Int) #

divMod :: Int -> Int -> (Int, Int) #

toInteger :: Int -> Integer #

Integral Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int8 -> Int8 -> Int8 #

rem :: Int8 -> Int8 -> Int8 #

div :: Int8 -> Int8 -> Int8 #

mod :: Int8 -> Int8 -> Int8 #

quotRem :: Int8 -> Int8 -> (Int8, Int8) #

divMod :: Int8 -> Int8 -> (Int8, Int8) #

toInteger :: Int8 -> Integer #

Integral Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int16 -> Int16 -> Int16 #

rem :: Int16 -> Int16 -> Int16 #

div :: Int16 -> Int16 -> Int16 #

mod :: Int16 -> Int16 -> Int16 #

quotRem :: Int16 -> Int16 -> (Int16, Int16) #

divMod :: Int16 -> Int16 -> (Int16, Int16) #

toInteger :: Int16 -> Integer #

Integral Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int32 -> Int32 -> Int32 #

rem :: Int32 -> Int32 -> Int32 #

div :: Int32 -> Int32 -> Int32 #

mod :: Int32 -> Int32 -> Int32 #

quotRem :: Int32 -> Int32 -> (Int32, Int32) #

divMod :: Int32 -> Int32 -> (Int32, Int32) #

toInteger :: Int32 -> Integer #

Integral Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

quot :: Int64 -> Int64 -> Int64 #

rem :: Int64 -> Int64 -> Int64 #

div :: Int64 -> Int64 -> Int64 #

mod :: Int64 -> Int64 -> Int64 #

quotRem :: Int64 -> Int64 -> (Int64, Int64) #

divMod :: Int64 -> Int64 -> (Int64, Int64) #

toInteger :: Int64 -> Integer #

Integral Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Integer -> Integer -> Integer #

rem :: Integer -> Integer -> Integer #

div :: Integer -> Integer -> Integer #

mod :: Integer -> Integer -> Integer #

quotRem :: Integer -> Integer -> (Integer, Integer) #

divMod :: Integer -> Integer -> (Integer, Integer) #

toInteger :: Integer -> Integer #

Integral Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Real

Methods

quot :: Natural -> Natural -> Natural #

rem :: Natural -> Natural -> Natural #

div :: Natural -> Natural -> Natural #

mod :: Natural -> Natural -> Natural #

quotRem :: Natural -> Natural -> (Natural, Natural) #

divMod :: Natural -> Natural -> (Natural, Natural) #

toInteger :: Natural -> Integer #

Integral Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

quot :: Word -> Word -> Word #

rem :: Word -> Word -> Word #

div :: Word -> Word -> Word #

mod :: Word -> Word -> Word #

quotRem :: Word -> Word -> (Word, Word) #

divMod :: Word -> Word -> (Word, Word) #

toInteger :: Word -> Integer #

Integral Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word8 -> Word8 -> Word8 #

rem :: Word8 -> Word8 -> Word8 #

div :: Word8 -> Word8 -> Word8 #

mod :: Word8 -> Word8 -> Word8 #

quotRem :: Word8 -> Word8 -> (Word8, Word8) #

divMod :: Word8 -> Word8 -> (Word8, Word8) #

toInteger :: Word8 -> Integer #

Integral Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word16 -> Word16 -> Word16 #

rem :: Word16 -> Word16 -> Word16 #

div :: Word16 -> Word16 -> Word16 #

mod :: Word16 -> Word16 -> Word16 #

quotRem :: Word16 -> Word16 -> (Word16, Word16) #

divMod :: Word16 -> Word16 -> (Word16, Word16) #

toInteger :: Word16 -> Integer #

Integral Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word32 -> Word32 -> Word32 #

rem :: Word32 -> Word32 -> Word32 #

div :: Word32 -> Word32 -> Word32 #

mod :: Word32 -> Word32 -> Word32 #

quotRem :: Word32 -> Word32 -> (Word32, Word32) #

divMod :: Word32 -> Word32 -> (Word32, Word32) #

toInteger :: Word32 -> Integer #

Integral Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

quot :: Word64 -> Word64 -> Word64 #

rem :: Word64 -> Word64 -> Word64 #

div :: Word64 -> Word64 -> Word64 #

mod :: Word64 -> Word64 -> Word64 #

quotRem :: Word64 -> Word64 -> (Word64, Word64) #

divMod :: Word64 -> Word64 -> (Word64, Word64) #

toInteger :: Word64 -> Integer #

Integral Fd 
Instance details

Defined in System.Posix.Types

Methods

quot :: Fd -> Fd -> Fd #

rem :: Fd -> Fd -> Fd #

div :: Fd -> Fd -> Fd #

mod :: Fd -> Fd -> Fd #

quotRem :: Fd -> Fd -> (Fd, Fd) #

divMod :: Fd -> Fd -> (Fd, Fd) #

toInteger :: Fd -> Integer #

Integral CKey 
Instance details

Defined in System.Posix.Types

Methods

quot :: CKey -> CKey -> CKey #

rem :: CKey -> CKey -> CKey #

div :: CKey -> CKey -> CKey #

mod :: CKey -> CKey -> CKey #

quotRem :: CKey -> CKey -> (CKey, CKey) #

divMod :: CKey -> CKey -> (CKey, CKey) #

toInteger :: CKey -> Integer #

Integral CId 
Instance details

Defined in System.Posix.Types

Methods

quot :: CId -> CId -> CId #

rem :: CId -> CId -> CId #

div :: CId -> CId -> CId #

mod :: CId -> CId -> CId #

quotRem :: CId -> CId -> (CId, CId) #

divMod :: CId -> CId -> (CId, CId) #

toInteger :: CId -> Integer #

Integral CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

quot :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

rem :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

div :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

mod :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

quotRem :: CFsFilCnt -> CFsFilCnt -> (CFsFilCnt, CFsFilCnt) #

divMod :: CFsFilCnt -> CFsFilCnt -> (CFsFilCnt, CFsFilCnt) #

toInteger :: CFsFilCnt -> Integer #

Integral CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

quot :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

rem :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

div :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

mod :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

quotRem :: CFsBlkCnt -> CFsBlkCnt -> (CFsBlkCnt, CFsBlkCnt) #

divMod :: CFsBlkCnt -> CFsBlkCnt -> (CFsBlkCnt, CFsBlkCnt) #

toInteger :: CFsBlkCnt -> Integer #

Integral CClockId 
Instance details

Defined in System.Posix.Types

Methods

quot :: CClockId -> CClockId -> CClockId #

rem :: CClockId -> CClockId -> CClockId #

div :: CClockId -> CClockId -> CClockId #

mod :: CClockId -> CClockId -> CClockId #

quotRem :: CClockId -> CClockId -> (CClockId, CClockId) #

divMod :: CClockId -> CClockId -> (CClockId, CClockId) #

toInteger :: CClockId -> Integer #

Integral CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

quot :: CBlkCnt -> CBlkCnt -> CBlkCnt #

rem :: CBlkCnt -> CBlkCnt -> CBlkCnt #

div :: CBlkCnt -> CBlkCnt -> CBlkCnt #

mod :: CBlkCnt -> CBlkCnt -> CBlkCnt #

quotRem :: CBlkCnt -> CBlkCnt -> (CBlkCnt, CBlkCnt) #

divMod :: CBlkCnt -> CBlkCnt -> (CBlkCnt, CBlkCnt) #

toInteger :: CBlkCnt -> Integer #

Integral CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

quot :: CBlkSize -> CBlkSize -> CBlkSize #

rem :: CBlkSize -> CBlkSize -> CBlkSize #

div :: CBlkSize -> CBlkSize -> CBlkSize #

mod :: CBlkSize -> CBlkSize -> CBlkSize #

quotRem :: CBlkSize -> CBlkSize -> (CBlkSize, CBlkSize) #

divMod :: CBlkSize -> CBlkSize -> (CBlkSize, CBlkSize) #

toInteger :: CBlkSize -> Integer #

Integral CRLim 
Instance details

Defined in System.Posix.Types

Methods

quot :: CRLim -> CRLim -> CRLim #

rem :: CRLim -> CRLim -> CRLim #

div :: CRLim -> CRLim -> CRLim #

mod :: CRLim -> CRLim -> CRLim #

quotRem :: CRLim -> CRLim -> (CRLim, CRLim) #

divMod :: CRLim -> CRLim -> (CRLim, CRLim) #

toInteger :: CRLim -> Integer #

Integral CTcflag 
Instance details

Defined in System.Posix.Types

Methods

quot :: CTcflag -> CTcflag -> CTcflag #

rem :: CTcflag -> CTcflag -> CTcflag #

div :: CTcflag -> CTcflag -> CTcflag #

mod :: CTcflag -> CTcflag -> CTcflag #

quotRem :: CTcflag -> CTcflag -> (CTcflag, CTcflag) #

divMod :: CTcflag -> CTcflag -> (CTcflag, CTcflag) #

toInteger :: CTcflag -> Integer #

Integral CUid 
Instance details

Defined in System.Posix.Types

Methods

quot :: CUid -> CUid -> CUid #

rem :: CUid -> CUid -> CUid #

div :: CUid -> CUid -> CUid #

mod :: CUid -> CUid -> CUid #

quotRem :: CUid -> CUid -> (CUid, CUid) #

divMod :: CUid -> CUid -> (CUid, CUid) #

toInteger :: CUid -> Integer #

Integral CNlink 
Instance details

Defined in System.Posix.Types

Methods

quot :: CNlink -> CNlink -> CNlink #

rem :: CNlink -> CNlink -> CNlink #

div :: CNlink -> CNlink -> CNlink #

mod :: CNlink -> CNlink -> CNlink #

quotRem :: CNlink -> CNlink -> (CNlink, CNlink) #

divMod :: CNlink -> CNlink -> (CNlink, CNlink) #

toInteger :: CNlink -> Integer #

Integral CGid 
Instance details

Defined in System.Posix.Types

Methods

quot :: CGid -> CGid -> CGid #

rem :: CGid -> CGid -> CGid #

div :: CGid -> CGid -> CGid #

mod :: CGid -> CGid -> CGid #

quotRem :: CGid -> CGid -> (CGid, CGid) #

divMod :: CGid -> CGid -> (CGid, CGid) #

toInteger :: CGid -> Integer #

Integral CSsize 
Instance details

Defined in System.Posix.Types

Methods

quot :: CSsize -> CSsize -> CSsize #

rem :: CSsize -> CSsize -> CSsize #

div :: CSsize -> CSsize -> CSsize #

mod :: CSsize -> CSsize -> CSsize #

quotRem :: CSsize -> CSsize -> (CSsize, CSsize) #

divMod :: CSsize -> CSsize -> (CSsize, CSsize) #

toInteger :: CSsize -> Integer #

Integral CPid 
Instance details

Defined in System.Posix.Types

Methods

quot :: CPid -> CPid -> CPid #

rem :: CPid -> CPid -> CPid #

div :: CPid -> CPid -> CPid #

mod :: CPid -> CPid -> CPid #

quotRem :: CPid -> CPid -> (CPid, CPid) #

divMod :: CPid -> CPid -> (CPid, CPid) #

toInteger :: CPid -> Integer #

Integral COff 
Instance details

Defined in System.Posix.Types

Methods

quot :: COff -> COff -> COff #

rem :: COff -> COff -> COff #

div :: COff -> COff -> COff #

mod :: COff -> COff -> COff #

quotRem :: COff -> COff -> (COff, COff) #

divMod :: COff -> COff -> (COff, COff) #

toInteger :: COff -> Integer #

Integral CMode 
Instance details

Defined in System.Posix.Types

Methods

quot :: CMode -> CMode -> CMode #

rem :: CMode -> CMode -> CMode #

div :: CMode -> CMode -> CMode #

mod :: CMode -> CMode -> CMode #

quotRem :: CMode -> CMode -> (CMode, CMode) #

divMod :: CMode -> CMode -> (CMode, CMode) #

toInteger :: CMode -> Integer #

Integral CIno 
Instance details

Defined in System.Posix.Types

Methods

quot :: CIno -> CIno -> CIno #

rem :: CIno -> CIno -> CIno #

div :: CIno -> CIno -> CIno #

mod :: CIno -> CIno -> CIno #

quotRem :: CIno -> CIno -> (CIno, CIno) #

divMod :: CIno -> CIno -> (CIno, CIno) #

toInteger :: CIno -> Integer #

Integral CDev 
Instance details

Defined in System.Posix.Types

Methods

quot :: CDev -> CDev -> CDev #

rem :: CDev -> CDev -> CDev #

div :: CDev -> CDev -> CDev #

mod :: CDev -> CDev -> CDev #

quotRem :: CDev -> CDev -> (CDev, CDev) #

divMod :: CDev -> CDev -> (CDev, CDev) #

toInteger :: CDev -> Integer #

Integral CChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CChar -> CChar -> CChar #

rem :: CChar -> CChar -> CChar #

div :: CChar -> CChar -> CChar #

mod :: CChar -> CChar -> CChar #

quotRem :: CChar -> CChar -> (CChar, CChar) #

divMod :: CChar -> CChar -> (CChar, CChar) #

toInteger :: CChar -> Integer #

Integral CSChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSChar -> CSChar -> CSChar #

rem :: CSChar -> CSChar -> CSChar #

div :: CSChar -> CSChar -> CSChar #

mod :: CSChar -> CSChar -> CSChar #

quotRem :: CSChar -> CSChar -> (CSChar, CSChar) #

divMod :: CSChar -> CSChar -> (CSChar, CSChar) #

toInteger :: CSChar -> Integer #

Integral CUChar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUChar -> CUChar -> CUChar #

rem :: CUChar -> CUChar -> CUChar #

div :: CUChar -> CUChar -> CUChar #

mod :: CUChar -> CUChar -> CUChar #

quotRem :: CUChar -> CUChar -> (CUChar, CUChar) #

divMod :: CUChar -> CUChar -> (CUChar, CUChar) #

toInteger :: CUChar -> Integer #

Integral CShort 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CShort -> CShort -> CShort #

rem :: CShort -> CShort -> CShort #

div :: CShort -> CShort -> CShort #

mod :: CShort -> CShort -> CShort #

quotRem :: CShort -> CShort -> (CShort, CShort) #

divMod :: CShort -> CShort -> (CShort, CShort) #

toInteger :: CShort -> Integer #

Integral CUShort 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUShort -> CUShort -> CUShort #

rem :: CUShort -> CUShort -> CUShort #

div :: CUShort -> CUShort -> CUShort #

mod :: CUShort -> CUShort -> CUShort #

quotRem :: CUShort -> CUShort -> (CUShort, CUShort) #

divMod :: CUShort -> CUShort -> (CUShort, CUShort) #

toInteger :: CUShort -> Integer #

Integral CInt 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CInt -> CInt -> CInt #

rem :: CInt -> CInt -> CInt #

div :: CInt -> CInt -> CInt #

mod :: CInt -> CInt -> CInt #

quotRem :: CInt -> CInt -> (CInt, CInt) #

divMod :: CInt -> CInt -> (CInt, CInt) #

toInteger :: CInt -> Integer #

Integral CUInt 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUInt -> CUInt -> CUInt #

rem :: CUInt -> CUInt -> CUInt #

div :: CUInt -> CUInt -> CUInt #

mod :: CUInt -> CUInt -> CUInt #

quotRem :: CUInt -> CUInt -> (CUInt, CUInt) #

divMod :: CUInt -> CUInt -> (CUInt, CUInt) #

toInteger :: CUInt -> Integer #

Integral CLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CLong -> CLong -> CLong #

rem :: CLong -> CLong -> CLong #

div :: CLong -> CLong -> CLong #

mod :: CLong -> CLong -> CLong #

quotRem :: CLong -> CLong -> (CLong, CLong) #

divMod :: CLong -> CLong -> (CLong, CLong) #

toInteger :: CLong -> Integer #

Integral CULong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CULong -> CULong -> CULong #

rem :: CULong -> CULong -> CULong #

div :: CULong -> CULong -> CULong #

mod :: CULong -> CULong -> CULong #

quotRem :: CULong -> CULong -> (CULong, CULong) #

divMod :: CULong -> CULong -> (CULong, CULong) #

toInteger :: CULong -> Integer #

Integral CLLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CLLong -> CLLong -> CLLong #

rem :: CLLong -> CLLong -> CLLong #

div :: CLLong -> CLLong -> CLLong #

mod :: CLLong -> CLLong -> CLLong #

quotRem :: CLLong -> CLLong -> (CLLong, CLLong) #

divMod :: CLLong -> CLLong -> (CLLong, CLLong) #

toInteger :: CLLong -> Integer #

Integral CULLong 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CULLong -> CULLong -> CULLong #

rem :: CULLong -> CULLong -> CULLong #

div :: CULLong -> CULLong -> CULLong #

mod :: CULLong -> CULLong -> CULLong #

quotRem :: CULLong -> CULLong -> (CULLong, CULLong) #

divMod :: CULLong -> CULLong -> (CULLong, CULLong) #

toInteger :: CULLong -> Integer #

Integral CBool 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CBool -> CBool -> CBool #

rem :: CBool -> CBool -> CBool #

div :: CBool -> CBool -> CBool #

mod :: CBool -> CBool -> CBool #

quotRem :: CBool -> CBool -> (CBool, CBool) #

divMod :: CBool -> CBool -> (CBool, CBool) #

toInteger :: CBool -> Integer #

Integral CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CPtrdiff -> CPtrdiff -> CPtrdiff #

rem :: CPtrdiff -> CPtrdiff -> CPtrdiff #

div :: CPtrdiff -> CPtrdiff -> CPtrdiff #

mod :: CPtrdiff -> CPtrdiff -> CPtrdiff #

quotRem :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) #

divMod :: CPtrdiff -> CPtrdiff -> (CPtrdiff, CPtrdiff) #

toInteger :: CPtrdiff -> Integer #

Integral CSize 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSize -> CSize -> CSize #

rem :: CSize -> CSize -> CSize #

div :: CSize -> CSize -> CSize #

mod :: CSize -> CSize -> CSize #

quotRem :: CSize -> CSize -> (CSize, CSize) #

divMod :: CSize -> CSize -> (CSize, CSize) #

toInteger :: CSize -> Integer #

Integral CWchar 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CWchar -> CWchar -> CWchar #

rem :: CWchar -> CWchar -> CWchar #

div :: CWchar -> CWchar -> CWchar #

mod :: CWchar -> CWchar -> CWchar #

quotRem :: CWchar -> CWchar -> (CWchar, CWchar) #

divMod :: CWchar -> CWchar -> (CWchar, CWchar) #

toInteger :: CWchar -> Integer #

Integral CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CSigAtomic -> CSigAtomic -> CSigAtomic #

rem :: CSigAtomic -> CSigAtomic -> CSigAtomic #

div :: CSigAtomic -> CSigAtomic -> CSigAtomic #

mod :: CSigAtomic -> CSigAtomic -> CSigAtomic #

quotRem :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) #

divMod :: CSigAtomic -> CSigAtomic -> (CSigAtomic, CSigAtomic) #

toInteger :: CSigAtomic -> Integer #

Integral CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CIntPtr -> CIntPtr -> CIntPtr #

rem :: CIntPtr -> CIntPtr -> CIntPtr #

div :: CIntPtr -> CIntPtr -> CIntPtr #

mod :: CIntPtr -> CIntPtr -> CIntPtr #

quotRem :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) #

divMod :: CIntPtr -> CIntPtr -> (CIntPtr, CIntPtr) #

toInteger :: CIntPtr -> Integer #

Integral CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUIntPtr -> CUIntPtr -> CUIntPtr #

rem :: CUIntPtr -> CUIntPtr -> CUIntPtr #

div :: CUIntPtr -> CUIntPtr -> CUIntPtr #

mod :: CUIntPtr -> CUIntPtr -> CUIntPtr #

quotRem :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) #

divMod :: CUIntPtr -> CUIntPtr -> (CUIntPtr, CUIntPtr) #

toInteger :: CUIntPtr -> Integer #

Integral CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CIntMax -> CIntMax -> CIntMax #

rem :: CIntMax -> CIntMax -> CIntMax #

div :: CIntMax -> CIntMax -> CIntMax #

mod :: CIntMax -> CIntMax -> CIntMax #

quotRem :: CIntMax -> CIntMax -> (CIntMax, CIntMax) #

divMod :: CIntMax -> CIntMax -> (CIntMax, CIntMax) #

toInteger :: CIntMax -> Integer #

Integral CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

quot :: CUIntMax -> CUIntMax -> CUIntMax #

rem :: CUIntMax -> CUIntMax -> CUIntMax #

div :: CUIntMax -> CUIntMax -> CUIntMax #

mod :: CUIntMax -> CUIntMax -> CUIntMax #

quotRem :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) #

divMod :: CUIntMax -> CUIntMax -> (CUIntMax, CUIntMax) #

toInteger :: CUIntMax -> Integer #

Integral ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

quot :: ConstVal -> ConstVal -> ConstVal #

rem :: ConstVal -> ConstVal -> ConstVal #

div :: ConstVal -> ConstVal -> ConstVal #

mod :: ConstVal -> ConstVal -> ConstVal #

quotRem :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

divMod :: ConstVal -> ConstVal -> (ConstVal, ConstVal) #

toInteger :: ConstVal -> Integer #

Integral PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

quot :: PlotIndex -> PlotIndex -> PlotIndex #

rem :: PlotIndex -> PlotIndex -> PlotIndex #

div :: PlotIndex -> PlotIndex -> PlotIndex #

mod :: PlotIndex -> PlotIndex -> PlotIndex #

quotRem :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

divMod :: PlotIndex -> PlotIndex -> (PlotIndex, PlotIndex) #

toInteger :: PlotIndex -> Integer #

Integral Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

quot :: Crossings -> Crossings -> Crossings #

rem :: Crossings -> Crossings -> Crossings #

div :: Crossings -> Crossings -> Crossings #

mod :: Crossings -> Crossings -> Crossings #

quotRem :: Crossings -> Crossings -> (Crossings, Crossings) #

divMod :: Crossings -> Crossings -> (Crossings, Crossings) #

toInteger :: Crossings -> Integer #

Integral a => Integral (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

quot :: Identity a -> Identity a -> Identity a #

rem :: Identity a -> Identity a -> Identity a #

div :: Identity a -> Identity a -> Identity a #

mod :: Identity a -> Identity a -> Identity a #

quotRem :: Identity a -> Identity a -> (Identity a, Identity a) #

divMod :: Identity a -> Identity a -> (Identity a, Identity a) #

toInteger :: Identity a -> Integer #

Integral n => Integral (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

quot :: VarInt n -> VarInt n -> VarInt n #

rem :: VarInt n -> VarInt n -> VarInt n #

div :: VarInt n -> VarInt n -> VarInt n #

mod :: VarInt n -> VarInt n -> VarInt n #

quotRem :: VarInt n -> VarInt n -> (VarInt n, VarInt n) #

divMod :: VarInt n -> VarInt n -> (VarInt n, VarInt n) #

toInteger :: VarInt n -> Integer #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(Integral t, KnownNat m, Num (Mod m t)) => Integral (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

quot :: Mod m t -> Mod m t -> Mod m t #

rem :: Mod m t -> Mod m t -> Mod m t #

div :: Mod m t -> Mod m t -> Mod m t #

mod :: Mod m t -> Mod m t -> Mod m t #

quotRem :: Mod m t -> Mod m t -> (Mod m t, Mod m t) #

divMod :: Mod m t -> Mod m t -> (Mod m t, Mod m t) #

toInteger :: Mod m t -> Integer #

Integral a => Integral (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

quot :: Const a b -> Const a b -> Const a b #

rem :: Const a b -> Const a b -> Const a b #

div :: Const a b -> Const a b -> Const a b #

mod :: Const a b -> Const a b -> Const a b #

quotRem :: Const a b -> Const a b -> (Const a b, Const a b) #

divMod :: Const a b -> Const a b -> (Const a b, Const a b) #

toInteger :: Const a b -> Integer #

Integral a => Integral (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

quot :: Tagged s a -> Tagged s a -> Tagged s a #

rem :: Tagged s a -> Tagged s a -> Tagged s a #

div :: Tagged s a -> Tagged s a -> Tagged s a #

mod :: Tagged s a -> Tagged s a -> Tagged s a #

quotRem :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #

divMod :: Tagged s a -> Tagged s a -> (Tagged s a, Tagged s a) #

toInteger :: Tagged s a -> Integer #

class Applicative m => Monad (m :: Type -> Type) where #

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.

Instances of Monad should satisfy the following laws:

Furthermore, the Monad and Applicative operations should relate as follows:

The above laws imply:

and that pure and (<*>) satisfy the applicative functor laws.

The instances of Monad for lists, Maybe and IO -defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 #

Sequentially compose two actions, passing any value produced +monadic expressions.

Instances of Monad should satisfy the following laws:

Furthermore, the Monad and Applicative operations should relate as follows:

The above laws imply:

and that pure and (<*>) satisfy the applicative functor laws.

The instances of Monad for lists, Maybe and IO +defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 #

Sequentially compose two actions, passing any value produced by the first as an argument to the second.

(>>) :: m a -> m b -> m b infixl 1 #

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 #

Inject a value into the monadic type.

fail :: String -> m a #

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.

As part of the MonadFail proposal (MFP), this function is moved - to its own class MonadFail (see Control.Monad.Fail for more + to its own class MonadFail (see Control.Monad.Fail for more details). The definition here will be removed in a future - release.

Instances
Monad []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: [a] -> (a -> [b]) -> [b] #

(>>) :: [a] -> [b] -> [b] #

return :: a -> [a] #

fail :: String -> [a] #

Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Monad Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b #

(>>) :: Par1 a -> Par1 b -> Par1 b #

return :: a -> Par1 a #

fail :: String -> Par1 a #

Monad Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(>>=) :: Q a -> (a -> Q b) -> Q b #

(>>) :: Q a -> Q b -> Q b #

return :: a -> Q a #

fail :: String -> Q a #

Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Monad Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

(>>=) :: Complex a -> (a -> Complex b) -> Complex b #

(>>) :: Complex a -> Complex b -> Complex b #

return :: a -> Complex a #

fail :: String -> Complex a #

Monad Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Min a -> (a -> Min b) -> Min b #

(>>) :: Min a -> Min b -> Min b #

return :: a -> Min a #

fail :: String -> Min a #

Monad Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Max a -> (a -> Max b) -> Max b #

(>>) :: Max a -> Max b -> Max b #

return :: a -> Max a #

fail :: String -> Max a #

Monad First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Option a -> (a -> Option b) -> Option b #

(>>) :: Option a -> Option b -> Option b #

return :: a -> Option a #

fail :: String -> Option a #

Monad First 
Instance details

Defined in Data.Monoid

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last 
Instance details

Defined in Data.Monoid

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Dual a -> (a -> Dual b) -> Dual b #

(>>) :: Dual a -> Dual b -> Dual b #

return :: a -> Dual a #

fail :: String -> Dual a #

Monad Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Sum a -> (a -> Sum b) -> Sum b #

(>>) :: Sum a -> Sum b -> Sum b #

return :: a -> Sum a #

fail :: String -> Sum a #

Monad Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Product a -> (a -> Product b) -> Product b #

(>>) :: Product a -> Product b -> Product b #

return :: a -> Product a #

fail :: String -> Product a #

Monad Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(>>=) :: Down a -> (a -> Down b) -> Down b #

(>>) :: Down a -> Down b -> Down b #

return :: a -> Down a #

fail :: String -> Down a #

Monad ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

(>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b #

(>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #

return :: a -> ReadPrec a #

fail :: String -> ReadPrec a #

Monad ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b #

(>>) :: ReadP a -> ReadP b -> ReadP b #

return :: a -> ReadP a #

fail :: String -> ReadP a #

Monad NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b #

(>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #

return :: a -> NonEmpty a #

fail :: String -> NonEmpty a #

Monad PutM 
Instance details

Defined in Data.Binary.Put

Methods

(>>=) :: PutM a -> (a -> PutM b) -> PutM b #

(>>) :: PutM a -> PutM b -> PutM b #

return :: a -> PutM a #

fail :: String -> PutM a #

Monad Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

(>>=) :: Get a -> (a -> Get b) -> Get b #

(>>) :: Get a -> Get b -> Get b #

return :: a -> Get a #

fail :: String -> Get a #

Monad Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(>>=) :: Put a -> (a -> Put b) -> Put b #

(>>) :: Put a -> Put b -> Put b #

return :: a -> Put a #

fail :: String -> Put a #

Monad Tree 
Instance details

Defined in Data.Tree

Methods

(>>=) :: Tree a -> (a -> Tree b) -> Tree b #

(>>) :: Tree a -> Tree b -> Tree b #

return :: a -> Tree a #

fail :: String -> Tree a #

Monad Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b #

(>>) :: Seq a -> Seq b -> Seq b #

return :: a -> Seq a #

fail :: String -> Seq a #

Monad DList 
Instance details

Defined in Data.DList

Methods

(>>=) :: DList a -> (a -> DList b) -> DList b #

(>>) :: DList a -> DList b -> DList b #

return :: a -> DList a #

fail :: String -> DList a #

Monad V3 
Instance details

Defined in Linear.V3

Methods

(>>=) :: V3 a -> (a -> V3 b) -> V3 b #

(>>) :: V3 a -> V3 b -> V3 b #

return :: a -> V3 a #

fail :: String -> V3 a #

Monad V2 
Instance details

Defined in Linear.V2

Methods

(>>=) :: V2 a -> (a -> V2 b) -> V2 b #

(>>) :: V2 a -> V2 b -> V2 b #

return :: a -> V2 a #

fail :: String -> V2 a #

Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Monad Array 
Instance details

Defined in Data.Primitive.Array

Methods

(>>=) :: Array a -> (a -> Array b) -> Array b #

(>>) :: Array a -> Array b -> Array b #

return :: a -> Array a #

fail :: String -> Array a #

Monad Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Id a -> (a -> Id b) -> Id b #

(>>) :: Id a -> Id b -> Id b #

return :: a -> Id a #

fail :: String -> Id a #

Monad P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Box a -> (a -> Box b) -> Box b #

(>>) :: Box a -> Box b -> Box b #

return :: a -> Box a #

fail :: String -> Box a #

Monad Vector 
Instance details

Defined in Data.Vector

Methods

(>>=) :: Vector a -> (a -> Vector b) -> Vector b #

(>>) :: Vector a -> Vector b -> Vector b #

return :: a -> Vector a #

fail :: String -> Vector a #

Monad Root 
Instance details

Defined in Numeric.RootFinding

Methods

(>>=) :: Root a -> (a -> Root b) -> Root b #

(>>) :: Root a -> Root b -> Root b #

return :: a -> Root a #

fail :: String -> Root a #

Monad Log 
Instance details

Defined in Numeric.Log

Methods

(>>=) :: Log a -> (a -> Log b) -> Log b #

(>>) :: Log a -> Log b -> Log b #

return :: a -> Log a #

fail :: String -> Log a #

Monad Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(>>=) :: Interval a -> (a -> Interval b) -> Interval b #

(>>) :: Interval a -> Interval b -> Interval b #

return :: a -> Interval a #

fail :: String -> Interval a #

Monad V1 
Instance details

Defined in Linear.V1

Methods

(>>=) :: V1 a -> (a -> V1 b) -> V1 b #

(>>) :: V1 a -> V1 b -> V1 b #

return :: a -> V1 a #

fail :: String -> V1 a #

Monad Sh 
Instance details

Defined in Shelly.Base

Methods

(>>=) :: Sh a -> (a -> Sh b) -> Sh b #

(>>) :: Sh a -> Sh b -> Sh b #

return :: a -> Sh a #

fail :: String -> Sh a #

Monad V4 
Instance details

Defined in Linear.V4

Methods

(>>=) :: V4 a -> (a -> V4 b) -> V4 b #

(>>) :: V4 a -> V4 b -> V4 b #

return :: a -> V4 a #

fail :: String -> V4 a #

Monad Plucker 
Instance details

Defined in Linear.Plucker

Methods

(>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b #

(>>) :: Plucker a -> Plucker b -> Plucker b #

return :: a -> Plucker a #

fail :: String -> Plucker a #

Monad Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

(>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b #

(>>) :: Quaternion a -> Quaternion b -> Quaternion b #

return :: a -> Quaternion a #

fail :: String -> Quaternion a #

Monad V0 
Instance details

Defined in Linear.V0

Methods

(>>=) :: V0 a -> (a -> V0 b) -> V0 b #

(>>) :: V0 a -> V0 b -> V0 b #

return :: a -> V0 a #

fail :: String -> V0 a #

Monad Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(>>=) :: Stream a -> (a -> Stream b) -> Stream b #

(>>) :: Stream a -> Stream b -> Stream b #

return :: a -> Stream a #

fail :: String -> Stream a #

Monad IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: IResult a -> (a -> IResult b) -> IResult b #

(>>) :: IResult a -> IResult b -> IResult b #

return :: a -> IResult a #

fail :: String -> IResult a #

Monad Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Result a -> (a -> Result b) -> Result b #

(>>) :: Result a -> Result b -> Result b #

return :: a -> Result a #

fail :: String -> Result a #

Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Monad (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: U1 a -> (a -> U1 b) -> U1 b #

(>>) :: U1 a -> U1 b -> U1 b #

return :: a -> U1 a #

fail :: String -> U1 a #

Monoid a => Monad ((,) a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) #

(>>) :: (a, a0) -> (a, b) -> (a, b) #

return :: a0 -> (a, a0) #

fail :: String -> (a, a0) #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Monad m => Monad (WrappedMonad m) 
Instance details

Defined in Control.Applicative

Methods

(>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b #

(>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #

return :: a -> WrappedMonad m a #

fail :: String -> WrappedMonad m a #

ArrowApply a => Monad (ArrowMonad a)

Since: base-2.1

Instance details

Defined in Control.Arrow

Methods

(>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b #

(>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #

return :: a0 -> ArrowMonad a a0 #

fail :: String -> ArrowMonad a a0 #

Monad (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b #

(>>) :: Proxy a -> Proxy b -> Proxy b #

return :: a -> Proxy a #

fail :: String -> Proxy a #

Monad m => Monad (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b #

(>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #

return :: a -> MaybeT m a #

fail :: String -> MaybeT m a #

Monad m => Monad (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b #

(>>) :: ListT m a -> ListT m b -> ListT m b #

return :: a -> ListT m a #

fail :: String -> ListT m a #

Monad f => Monad (Point f) 
Instance details

Defined in Linear.Affine

Methods

(>>=) :: Point f a -> (a -> Point f b) -> Point f b #

(>>) :: Point f a -> Point f b -> Point f b #

return :: a -> Point f a #

fail :: String -> Point f a #

Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Fractional p => Monad (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(>>=) :: Categorical p a -> (a -> Categorical p b) -> Categorical p b #

(>>) :: Categorical p a -> Categorical p b -> Categorical p b #

return :: a -> Categorical p a #

fail :: String -> Categorical p a #

Monad (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(>>=) :: Measured n a -> (a -> Measured n b) -> Measured n b #

(>>) :: Measured n a -> Measured n b -> Measured n b #

return :: a -> Measured n a #

fail :: String -> Measured n a #

Monad (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b #

(>>) :: Parser i a -> Parser i b -> Parser i b #

return :: a -> Parser i a #

fail :: String -> Parser i a #

Representable f => Monad (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

(>>=) :: Co f a -> (a -> Co f b) -> Co f b #

(>>) :: Co f a -> Co f b -> Co f b #

return :: a -> Co f a #

fail :: String -> Co f a #

Alternative f => Monad (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b #

(>>) :: Cofree f a -> Cofree f b -> Cofree f b #

return :: a -> Cofree f a #

fail :: String -> Cofree f a #

Monad (SetM s) 
Instance details

Defined in Data.Graph

Methods

(>>=) :: SetM s a -> (a -> SetM s b) -> SetM s b #

(>>) :: SetM s a -> SetM s b -> SetM s b #

return :: a -> SetM s a #

fail :: String -> SetM s a #

Functor f => Monad (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

(>>=) :: Free f a -> (a -> Free f b) -> Free f b #

(>>) :: Free f a -> Free f b -> Free f b #

return :: a -> Free f a #

fail :: String -> Free f a #

Monad m => Monad (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b #

(>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b #

return :: a -> Yoneda m a #

fail :: String -> Yoneda m a #

(Monad (Rep p), Representable p) => Monad (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

(>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b #

(>>) :: Prep p a -> Prep p b -> Prep p b #

return :: a -> Prep p a #

fail :: String -> Prep p a #

Monad f => Monad (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b #

(>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #

return :: a -> Rec1 f a #

fail :: String -> Rec1 f a #

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Monad f => Monad (Alt f) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b #

(>>) :: Alt f a -> Alt f b -> Alt f b #

return :: a -> Alt f a #

fail :: String -> Alt f a #

Monad m => Monad (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #

(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

return :: a -> IdentityT m a #

fail :: String -> IdentityT m a #

(Applicative f, Monad f) => Monad (WhenMissing f x)

Equivalent to ReaderT k (ReaderT x (MaybeT f)).

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

(>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b #

(>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #

return :: a -> WhenMissing f x a #

fail :: String -> WhenMissing f x a #

Monad m => Monad (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b #

(>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #

return :: a -> ExceptT e m a #

fail :: String -> ExceptT e m a #

(Monad m, Error e) => Monad (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b #

(>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #

return :: a -> ErrorT e m a #

fail :: String -> ErrorT e m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

(>>=) :: RandT g m a -> (a -> RandT g m b) -> RandT g m b #

(>>) :: RandT g m a -> RandT g m b -> RandT g m b #

return :: a -> RandT g m a #

fail :: String -> RandT g m a #

Monad (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b #

(>>) :: Tagged s a -> Tagged s b -> Tagged s b #

return :: a -> Tagged s a #

fail :: String -> Tagged s a #

Monad (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

(>>=) :: Query v n a -> (a -> Query v n b) -> Query v n b #

(>>) :: Query v n a -> Query v n b -> Query v n b #

return :: a -> Query v n a #

fail :: String -> Query v n a #

(Alternative f, Monad w) => Monad (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b #

(>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #

return :: a -> CofreeT f w a #

fail :: String -> CofreeT f w a #

Monad (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Costar f a a0 -> (a0 -> Costar f a b) -> Costar f a b #

(>>) :: Costar f a a0 -> Costar f a b -> Costar f a b #

return :: a0 -> Costar f a a0 #

fail :: String -> Costar f a a0 #

(Functor f, Monad m) => Monad (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b #

(>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #

return :: a -> FreeT f m a #

fail :: String -> FreeT f m a #

Monad f => Monad (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Star f a a0 -> (a0 -> Star f a b) -> Star f a b #

(>>) :: Star f a a0 -> Star f a b -> Star f a b #

return :: a0 -> Star f a a0 #

fail :: String -> Star f a a0 #

Dim n => Monad (V n) 
Instance details

Defined in Linear.V

Methods

(>>=) :: V n a -> (a -> V n b) -> V n b #

(>>) :: V n a -> V n b -> V n b #

return :: a -> V n a #

fail :: String -> V n a #

Monad ((->) r :: * -> *)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: (r -> a) -> (a -> r -> b) -> r -> b #

(>>) :: (r -> a) -> (r -> b) -> r -> b #

return :: a -> r -> a #

fail :: String -> r -> a #

(Monad f, Monad g) => Monad (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b #

(>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #

return :: a -> (f :*: g) a #

fail :: String -> (f :*: g) a #

(Monad f, Monad g) => Monad (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b #

(>>) :: Product f g a -> Product f g b -> Product f g b #

return :: a -> Product f g a #

fail :: String -> Product f g a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b #

(>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #

return :: a -> WhenMatched f x y a #

fail :: String -> WhenMatched f x y a #

(Applicative f, Monad f) => Monad (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

(>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b #

(>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #

return :: a -> WhenMissing f k x a #

fail :: String -> WhenMissing f k x a #

Monad m => Monad (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #

(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #

return :: a -> ReaderT r m a #

fail :: String -> ReaderT r m a #

Monad (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

(>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b #

(>>) :: ContT r m a -> ContT r m b -> ContT r m b #

return :: a -> ContT r m a #

fail :: String -> ContT r m a #

Monad f => Monad (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b #

(>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #

return :: a -> M1 i c f a #

fail :: String -> M1 i c f a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b #

(>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #

return :: a -> WhenMatched f k x y a #

fail :: String -> WhenMatched f k x y a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

Monad state => Monad (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

(>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b #

(>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #

return :: a -> Builder collection mutCollection step state err a #

fail :: String -> Builder collection mutCollection step state err a #

class Functor (f :: * -> *) where #

The Functor class is used for types that can be mapped over. + release.

Instances
Monad []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: [a] -> (a -> [b]) -> [b] #

(>>) :: [a] -> [b] -> [b] #

return :: a -> [a] #

fail :: String -> [a] #

Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Monad Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b #

(>>) :: Par1 a -> Par1 b -> Par1 b #

return :: a -> Par1 a #

fail :: String -> Par1 a #

Monad Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(>>=) :: Q a -> (a -> Q b) -> Q b #

(>>) :: Q a -> Q b -> Q b #

return :: a -> Q a #

fail :: String -> Q a #

Monad IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: IResult a -> (a -> IResult b) -> IResult b #

(>>) :: IResult a -> IResult b -> IResult b #

return :: a -> IResult a #

fail :: String -> IResult a #

Monad Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Result a -> (a -> Result b) -> Result b #

(>>) :: Result a -> Result b -> Result b #

return :: a -> Result a #

fail :: String -> Result a #

Monad Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

(>>=) :: Complex a -> (a -> Complex b) -> Complex b #

(>>) :: Complex a -> Complex b -> Complex b #

return :: a -> Complex a #

fail :: String -> Complex a #

Monad Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Min a -> (a -> Min b) -> Min b #

(>>) :: Min a -> Min b -> Min b #

return :: a -> Min a #

fail :: String -> Min a #

Monad Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Max a -> (a -> Max b) -> Max b #

(>>) :: Max a -> Max b -> Max b #

return :: a -> Max a #

fail :: String -> Max a #

Monad First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Option a -> (a -> Option b) -> Option b #

(>>) :: Option a -> Option b -> Option b #

return :: a -> Option a #

fail :: String -> Option a #

Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Monad First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Dual a -> (a -> Dual b) -> Dual b #

(>>) :: Dual a -> Dual b -> Dual b #

return :: a -> Dual a #

fail :: String -> Dual a #

Monad Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Sum a -> (a -> Sum b) -> Sum b #

(>>) :: Sum a -> Sum b -> Sum b #

return :: a -> Sum a #

fail :: String -> Sum a #

Monad Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Product a -> (a -> Product b) -> Product b #

(>>) :: Product a -> Product b -> Product b #

return :: a -> Product a #

fail :: String -> Product a #

Monad Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(>>=) :: Down a -> (a -> Down b) -> Down b #

(>>) :: Down a -> Down b -> Down b #

return :: a -> Down a #

fail :: String -> Down a #

Monad ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

(>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b #

(>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #

return :: a -> ReadPrec a #

fail :: String -> ReadPrec a #

Monad ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b #

(>>) :: ReadP a -> ReadP b -> ReadP b #

return :: a -> ReadP a #

fail :: String -> ReadP a #

Monad NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b #

(>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #

return :: a -> NonEmpty a #

fail :: String -> NonEmpty a #

Monad PutM 
Instance details

Defined in Data.Binary.Put

Methods

(>>=) :: PutM a -> (a -> PutM b) -> PutM b #

(>>) :: PutM a -> PutM b -> PutM b #

return :: a -> PutM a #

fail :: String -> PutM a #

Monad Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

(>>=) :: Get a -> (a -> Get b) -> Get b #

(>>) :: Get a -> Get b -> Get b #

return :: a -> Get a #

fail :: String -> Get a #

Monad Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(>>=) :: Put a -> (a -> Put b) -> Put b #

(>>) :: Put a -> Put b -> Put b #

return :: a -> Put a #

fail :: String -> Put a #

Monad Parser 
Instance details

Defined in Data.Csv.Conversion

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Tree 
Instance details

Defined in Data.Tree

Methods

(>>=) :: Tree a -> (a -> Tree b) -> Tree b #

(>>) :: Tree a -> Tree b -> Tree b #

return :: a -> Tree a #

fail :: String -> Tree a #

Monad Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b #

(>>) :: Seq a -> Seq b -> Seq b #

return :: a -> Seq a #

fail :: String -> Seq a #

Monad DList 
Instance details

Defined in Data.DList

Methods

(>>=) :: DList a -> (a -> DList b) -> DList b #

(>>) :: DList a -> DList b -> DList b #

return :: a -> DList a #

fail :: String -> DList a #

Monad Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(>>=) :: Interval a -> (a -> Interval b) -> Interval b #

(>>) :: Interval a -> Interval b -> Interval b #

return :: a -> Interval a #

fail :: String -> Interval a #

Monad SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

(>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b #

(>>) :: SmallArray a -> SmallArray b -> SmallArray b #

return :: a -> SmallArray a #

fail :: String -> SmallArray a #

Monad Array 
Instance details

Defined in Data.Primitive.Array

Methods

(>>=) :: Array a -> (a -> Array b) -> Array b #

(>>) :: Array a -> Array b -> Array b #

return :: a -> Array a #

fail :: String -> Array a #

Monad Vector 
Instance details

Defined in Data.Vector

Methods

(>>=) :: Vector a -> (a -> Vector b) -> Vector b #

(>>) :: Vector a -> Vector b -> Vector b #

return :: a -> Vector a #

fail :: String -> Vector a #

Monad Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Id a -> (a -> Id b) -> Id b #

(>>) :: Id a -> Id b -> Id b #

return :: a -> Id a #

fail :: String -> Id a #

Monad Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Box a -> (a -> Box b) -> Box b #

(>>) :: Box a -> Box b -> Box b #

return :: a -> Box a #

fail :: String -> Box a #

Monad Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(>>=) :: Stream a -> (a -> Stream b) -> Stream b #

(>>) :: Stream a -> Stream b -> Stream b #

return :: a -> Stream a #

fail :: String -> Stream a #

Monad P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad Root 
Instance details

Defined in Numeric.RootFinding

Methods

(>>=) :: Root a -> (a -> Root b) -> Root b #

(>>) :: Root a -> Root b -> Root b #

return :: a -> Root a #

fail :: String -> Root a #

Monad Log 
Instance details

Defined in Numeric.Log

Methods

(>>=) :: Log a -> (a -> Log b) -> Log b #

(>>) :: Log a -> Log b -> Log b #

return :: a -> Log a #

fail :: String -> Log a #

Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad V2 
Instance details

Defined in Linear.V2

Methods

(>>=) :: V2 a -> (a -> V2 b) -> V2 b #

(>>) :: V2 a -> V2 b -> V2 b #

return :: a -> V2 a #

fail :: String -> V2 a #

Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Monad V3 
Instance details

Defined in Linear.V3

Methods

(>>=) :: V3 a -> (a -> V3 b) -> V3 b #

(>>) :: V3 a -> V3 b -> V3 b #

return :: a -> V3 a #

fail :: String -> V3 a #

Monad V1 
Instance details

Defined in Linear.V1

Methods

(>>=) :: V1 a -> (a -> V1 b) -> V1 b #

(>>) :: V1 a -> V1 b -> V1 b #

return :: a -> V1 a #

fail :: String -> V1 a #

Monad Sh 
Instance details

Defined in Shelly.Base

Methods

(>>=) :: Sh a -> (a -> Sh b) -> Sh b #

(>>) :: Sh a -> Sh b -> Sh b #

return :: a -> Sh a #

fail :: String -> Sh a #

Monad Plucker 
Instance details

Defined in Linear.Plucker

Methods

(>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b #

(>>) :: Plucker a -> Plucker b -> Plucker b #

return :: a -> Plucker a #

fail :: String -> Plucker a #

Monad Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

(>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b #

(>>) :: Quaternion a -> Quaternion b -> Quaternion b #

return :: a -> Quaternion a #

fail :: String -> Quaternion a #

Monad V0 
Instance details

Defined in Linear.V0

Methods

(>>=) :: V0 a -> (a -> V0 b) -> V0 b #

(>>) :: V0 a -> V0 b -> V0 b #

return :: a -> V0 a #

fail :: String -> V0 a #

Monad V4 
Instance details

Defined in Linear.V4

Methods

(>>=) :: V4 a -> (a -> V4 b) -> V4 b #

(>>) :: V4 a -> V4 b -> V4 b #

return :: a -> V4 a #

fail :: String -> V4 a #

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Monad (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: U1 a -> (a -> U1 b) -> U1 b #

(>>) :: U1 a -> U1 b -> U1 b #

return :: a -> U1 a #

fail :: String -> U1 a #

Monoid a => Monad ((,) a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) #

(>>) :: (a, a0) -> (a, b) -> (a, b) #

return :: a0 -> (a, a0) #

fail :: String -> (a, a0) #

Monad (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b #

(>>) :: Parser i a -> Parser i b -> Parser i b #

return :: a -> Parser i a #

fail :: String -> Parser i a #

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 #

(>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #

return :: a -> WrappedMonad m a #

fail :: String -> WrappedMonad m a #

ArrowApply a => Monad (ArrowMonad a)

Since: base-2.1

Instance details

Defined in Control.Arrow

Methods

(>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b #

(>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #

return :: a0 -> ArrowMonad a a0 #

fail :: String -> ArrowMonad a a0 #

Monad (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b #

(>>) :: Proxy a -> Proxy b -> Proxy b #

return :: a -> Proxy a #

fail :: String -> Proxy a #

Monad m => Monad (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b #

(>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #

return :: a -> MaybeT m a #

fail :: String -> MaybeT m a #

Monad m => Monad (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b #

(>>) :: ListT m a -> ListT m b -> ListT m b #

return :: a -> ListT m a #

fail :: String -> ListT m a #

(Monad (Rep p), Representable p) => Monad (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

(>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b #

(>>) :: Prep p a -> Prep p b -> Prep p b #

return :: a -> Prep p a #

fail :: String -> Prep p a #

Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Fractional p => Monad (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(>>=) :: Categorical p a -> (a -> Categorical p b) -> Categorical p b #

(>>) :: Categorical p a -> Categorical p b -> Categorical p b #

return :: a -> Categorical p a #

fail :: String -> Categorical p a #

Alternative f => Monad (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b #

(>>) :: Cofree f a -> Cofree f b -> Cofree f b #

return :: a -> Cofree f a #

fail :: String -> Cofree f a #

Functor f => Monad (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

(>>=) :: Free f a -> (a -> Free f b) -> Free f b #

(>>) :: Free f a -> Free f b -> Free f b #

return :: a -> Free f a #

fail :: String -> Free f a #

Monad (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(>>=) :: Measured n a -> (a -> Measured n b) -> Measured n b #

(>>) :: Measured n a -> Measured n b -> Measured n b #

return :: a -> Measured n a #

fail :: String -> Measured n a #

Monad f => Monad (Point f) 
Instance details

Defined in Linear.Affine

Methods

(>>=) :: Point f a -> (a -> Point f b) -> Point f b #

(>>) :: Point f a -> Point f b -> Point f b #

return :: a -> Point f a #

fail :: String -> Point f a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Representable f => Monad (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

(>>=) :: Co f a -> (a -> Co f b) -> Co f b #

(>>) :: Co f a -> Co f b -> Co f b #

return :: a -> Co f a #

fail :: String -> Co f a #

Monad m => Monad (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b #

(>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b #

return :: a -> Yoneda m a #

fail :: String -> Yoneda m a #

Monad f => Monad (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b #

(>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #

return :: a -> Rec1 f a #

fail :: String -> Rec1 f a #

Monad m => Monad (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

(>>=) :: RandT g m a -> (a -> RandT g m b) -> RandT g m b #

(>>) :: RandT g m a -> RandT g m b -> RandT g m b #

return :: a -> RandT g m a #

fail :: String -> RandT g m a #

Monad f => Monad (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b #

(>>) :: Ap f a -> Ap f b -> Ap f b #

return :: a -> Ap f a #

fail :: String -> Ap f a #

Monad f => Monad (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b #

(>>) :: Alt f a -> Alt f b -> Alt f b #

return :: a -> Alt f a #

fail :: String -> Alt f a #

Monad m => Monad (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #

(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

return :: a -> IdentityT m a #

fail :: String -> IdentityT m a #

(Applicative f, Monad f) => Monad (WhenMissing f x)

Equivalent to ReaderT k (ReaderT x (MaybeT f)).

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

(>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b #

(>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #

return :: a -> WhenMissing f x a #

fail :: String -> WhenMissing f x a #

Monad m => Monad (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b #

(>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #

return :: a -> ExceptT e m a #

fail :: String -> ExceptT e m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

Monad m => Monad (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #

(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #

return :: a -> ReaderT r m a #

fail :: String -> ReaderT r m a #

(Monad m, Error e) => Monad (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b #

(>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #

return :: a -> ErrorT e m a #

fail :: String -> ErrorT e m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad f => Monad (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Star f a a0 -> (a0 -> Star f a b) -> Star f a b #

(>>) :: Star f a a0 -> Star f a b -> Star f a b #

return :: a0 -> Star f a a0 #

fail :: String -> Star f a a0 #

Monad (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Costar f a a0 -> (a0 -> Costar f a b) -> Costar f a b #

(>>) :: Costar f a a0 -> Costar f a b -> Costar f a b #

return :: a0 -> Costar f a a0 #

fail :: String -> Costar f a a0 #

Monad (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b #

(>>) :: Tagged s a -> Tagged s b -> Tagged s b #

return :: a -> Tagged s a #

fail :: String -> Tagged s a #

(Alternative f, Monad w) => Monad (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b #

(>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #

return :: a -> CofreeT f w a #

fail :: String -> CofreeT f w a #

(Functor f, Monad m) => Monad (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b #

(>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #

return :: a -> FreeT f m a #

fail :: String -> FreeT f m a #

Monad (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

(>>=) :: Query v n a -> (a -> Query v n b) -> Query v n b #

(>>) :: Query v n a -> Query v n b -> Query v n b #

return :: a -> Query v n a #

fail :: String -> Query v n a #

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Dim n => Monad (V n) 
Instance details

Defined in Linear.V

Methods

(>>=) :: V n a -> (a -> V n b) -> V n b #

(>>) :: V n a -> V n b -> V n b #

return :: a -> V n a #

fail :: String -> V n a #

Monad ((->) r :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: (r -> a) -> (a -> r -> b) -> r -> b #

(>>) :: (r -> a) -> (r -> b) -> r -> b #

return :: a -> r -> a #

fail :: String -> r -> a #

(Monad f, Monad g) => Monad (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b #

(>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #

return :: a -> (f :*: g) a #

fail :: String -> (f :*: g) a #

(Monad f, Monad g) => Monad (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b #

(>>) :: Product f g a -> Product f g b -> Product f g b #

return :: a -> Product f g a #

fail :: String -> Product f g a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b #

(>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #

return :: a -> WhenMatched f x y a #

fail :: String -> WhenMatched f x y a #

(Applicative f, Monad f) => Monad (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

(>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b #

(>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #

return :: a -> WhenMissing f k x a #

fail :: String -> WhenMissing f k x a #

Monad (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

(>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b #

(>>) :: ContT r m a -> ContT r m b -> ContT r m b #

return :: a -> ContT r m a #

fail :: String -> ContT r m a #

Monad f => Monad (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b #

(>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #

return :: a -> M1 i c f a #

fail :: String -> M1 i c f a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b #

(>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #

return :: a -> WhenMatched f k x y a #

fail :: String -> WhenMatched f k x y a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

Monad state => Monad (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

(>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b #

(>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #

return :: a -> Builder collection mutCollection step state err a #

fail :: String -> Builder collection mutCollection step state err a #

class Functor (f :: Type -> Type) where #

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, Maybe and IO +fmap (f . g) == fmap f . fmap g

The instances of Functor for lists, Maybe and IO satisfy these laws.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b #

(<$) :: a -> f b -> f a infixl 4 #

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 []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> [a] -> [b] #

(<$) :: a -> [b] -> [a] #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

Functor Par1 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Par1 a -> Par1 b #

(<$) :: a -> Par1 b -> Par1 a #

Functor Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

fmap :: (a -> b) -> Q a -> Q b #

(<$) :: a -> Q b -> Q a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

Functor Grid 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

fmap :: (a -> b) -> Grid a -> Grid b #

(<$) :: a -> Grid b -> Grid a #

Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

Functor Complex 
Instance details

Defined in Data.Complex

Methods

fmap :: (a -> b) -> Complex a -> Complex b #

(<$) :: a -> Complex b -> Complex a #

Functor Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Min a -> Min b #

(<$) :: a -> Min b -> Min a #

Functor Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Max a -> Max b #

(<$) :: a -> Max b -> Max a #

Functor First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Option a -> Option b #

(<$) :: a -> Option b -> Option a #

Functor ZipList 
Instance details

Defined in Control.Applicative

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b #

(<$) :: a -> ZipList b -> ZipList a #

Functor Handler

Since: base-4.6.0.0

Instance details

Defined in Control.Exception

Methods

fmap :: (a -> b) -> Handler a -> Handler b #

(<$) :: a -> Handler b -> Handler a #

Functor First 
Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last 
Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Dual a -> Dual b #

(<$) :: a -> Dual b -> Dual a #

Functor Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Sum a -> Sum b #

(<$) :: a -> Sum b -> Sum a #

Functor Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Product a -> Product b #

(<$) :: a -> Product b -> Product a #

Functor Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

fmap :: (a -> b) -> Down a -> Down b #

(<$) :: a -> Down b -> Down a #

Functor ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

fmap :: (a -> b) -> ReadPrec a -> ReadPrec b #

(<$) :: a -> ReadPrec b -> ReadPrec a #

Functor ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> ReadP a -> ReadP b #

(<$) :: a -> ReadP b -> ReadP a #

Functor NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> NonEmpty a -> NonEmpty b #

(<$) :: a -> NonEmpty b -> NonEmpty a #

Functor PutM 
Instance details

Defined in Data.Binary.Put

Methods

fmap :: (a -> b) -> PutM a -> PutM b #

(<$) :: a -> PutM b -> PutM a #

Functor Decoder 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Decoder a -> Decoder b #

(<$) :: a -> Decoder b -> Decoder a #

Functor Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Get a -> Get b #

(<$) :: a -> Get b -> Get a #

Functor Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

fmap :: (a -> b) -> Put a -> Put b #

(<$) :: a -> Put b -> Put a #

Functor IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b #

(<$) :: a -> IntMap b -> IntMap a #

Functor SCC

Since: containers-0.5.4

Instance details

Defined in Data.Graph

Methods

fmap :: (a -> b) -> SCC a -> SCC b #

(<$) :: a -> SCC b -> SCC a #

Functor Tree 
Instance details

Defined in Data.Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b #

(<$) :: a -> Tree b -> Tree a #

Functor Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Seq a -> Seq b #

(<$) :: a -> Seq b -> Seq a #

Functor FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> FingerTree a -> FingerTree b #

(<$) :: a -> FingerTree b -> FingerTree a #

Functor Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Digit a -> Digit b #

(<$) :: a -> Digit b -> Digit a #

Functor Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Node a -> Node b #

(<$) :: a -> Node b -> Node a #

Functor Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Elem a -> Elem b #

(<$) :: a -> Elem b -> Elem a #

Functor ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewL a -> ViewL b #

(<$) :: a -> ViewL b -> ViewL a #

Functor ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewR a -> ViewR b #

(<$) :: a -> ViewR b -> ViewR a #

Functor DList 
Instance details

Defined in Data.DList

Methods

fmap :: (a -> b) -> DList a -> DList b #

(<$) :: a -> DList b -> DList a #

Functor Angle 
Instance details

Defined in Diagrams.Angle

Methods

fmap :: (a -> b) -> Angle a -> Angle b #

(<$) :: a -> Angle b -> Angle a #

Functor V3 
Instance details

Defined in Linear.V3

Methods

fmap :: (a -> b) -> V3 a -> V3 b #

(<$) :: a -> V3 b -> V3 a #

Functor V2 
Instance details

Defined in Linear.V2

Methods

fmap :: (a -> b) -> V2 a -> V2 b #

(<$) :: a -> V2 b -> V2 a #

Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

Functor Doc 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Doc a -> Doc b #

(<$) :: a -> Doc b -> Doc a #

Functor AnnotDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b #

(<$) :: a -> AnnotDetails b -> AnnotDetails a #

Functor Span 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Span a -> Span b #

(<$) :: a -> Span b -> Span a #

Functor Array 
Instance details

Defined in Data.Primitive.Array

Methods

fmap :: (a -> b) -> Array a -> Array b #

(<$) :: a -> Array b -> Array a #

Functor Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Id a -> Id b #

(<$) :: a -> Id b -> Id a #

Functor P 
Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Box a -> Box b #

(<$) :: a -> Box b -> Box a #

Functor Vector 
Instance details

Defined in Data.Vector

Methods

fmap :: (a -> b) -> Vector a -> Vector b #

(<$) :: a -> Vector b -> Vector a #

Functor Root 
Instance details

Defined in Numeric.RootFinding

Methods

fmap :: (a -> b) -> Root a -> Root b #

(<$) :: a -> Root b -> Root a #

Functor Log 
Instance details

Defined in Numeric.Log

Methods

fmap :: (a -> b) -> Log a -> Log b #

(<$) :: a -> Log b -> Log a #

Functor Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor Active 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Active a -> Active b #

(<$) :: a -> Active b -> Active a #

Functor Dynamic 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Dynamic a -> Dynamic b #

(<$) :: a -> Dynamic b -> Dynamic a #

Functor Time 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Time a -> Time b #

(<$) :: a -> Time b -> Time a #

Functor Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fmap :: (a -> b) -> Interval a -> Interval b #

(<$) :: a -> Interval b -> Interval a #

Functor FontSize 
Instance details

Defined in Diagrams.TwoD.Text

Methods

fmap :: (a -> b) -> FontSize a -> FontSize b #

(<$) :: a -> FontSize b -> FontSize a #

Functor V1 
Instance details

Defined in Linear.V1

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor Sh 
Instance details

Defined in Shelly.Base

Methods

fmap :: (a -> b) -> Sh a -> Sh b #

(<$) :: a -> Sh b -> Sh a #

Functor Duration 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Duration a -> Duration b #

(<$) :: a -> Duration b -> Duration a #

Functor V4 
Instance details

Defined in Linear.V4

Methods

fmap :: (a -> b) -> V4 a -> V4 b #

(<$) :: a -> V4 b -> V4 a #

Functor BernsteinPoly 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

fmap :: (a -> b) -> BernsteinPoly a -> BernsteinPoly b #

(<$) :: a -> BernsteinPoly b -> BernsteinPoly a #

Functor Plucker 
Instance details

Defined in Linear.Plucker

Methods

fmap :: (a -> b) -> Plucker a -> Plucker b #

(<$) :: a -> Plucker b -> Plucker a #

Functor Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fmap :: (a -> b) -> Quaternion a -> Quaternion b #

(<$) :: a -> Quaternion b -> Quaternion a #

Functor V0 
Instance details

Defined in Linear.V0

Methods

fmap :: (a -> b) -> V0 a -> V0 b #

(<$) :: a -> V0 b -> V0 a #

Functor Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

fmap :: (a -> b) -> Stream a -> Stream b #

(<$) :: a -> Stream b -> Stream a #

Functor IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> IResult a -> IResult b #

(<$) :: a -> IResult b -> IResult a #

Functor Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Result a -> Result b #

(<$) :: a -> Result b -> Result a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor GraphPart 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

fmap :: (a -> b) -> GraphPart a -> GraphPart b #

(<$) :: a -> GraphPart b -> GraphPart a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

Functor (V1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> U1 a -> U1 b #

(<$) :: a -> U1 b -> U1 a #

Functor ((,) a)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a0 -> b) -> (a, a0) -> (a, b) #

(<$) :: a0 -> (a, b) -> (a, a0) #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Functor (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> Map k a -> Map k b #

(<$) :: a -> Map k b -> Map k a #

Functor (Array i)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

fmap :: (a -> b) -> Array i a -> Array i b #

(<$) :: a -> Array i b -> Array i a #

Functor (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a0 -> b) -> Arg a a0 -> Arg a b #

(<$) :: a0 -> Arg a b -> Arg a a0 #

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 #

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a #

Arrow a => Functor (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #

(<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 #

Functor (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

fmap :: (a -> b) -> Proxy a -> Proxy b #

(<$) :: a -> Proxy b -> Proxy a #

Functor m => Functor (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fmap :: (a -> b) -> MaybeT m a -> MaybeT m b #

(<$) :: a -> MaybeT m b -> MaybeT m a #

Functor s => Functor (ViewL s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewL s a -> ViewL s b #

(<$) :: a -> ViewL s b -> ViewL s a #

Functor s => Functor (ViewR s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewR s a -> ViewR s b #

(<$) :: a -> ViewR s b -> ViewR s a #

Functor m => Functor (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b #

(<$) :: a -> ListT m b -> ListT m a #

Functor v => Functor (BoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> BoundingBox v a -> BoundingBox v b #

(<$) :: a -> BoundingBox v b -> BoundingBox v a #

Functor f => Functor (Point f) 
Instance details

Defined in Linear.Affine

Methods

fmap :: (a -> b) -> Point f a -> Point f b #

(<$) :: a -> Point f b -> Point f a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Functor (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fmap :: (a -> b) -> Categorical p a -> Categorical p b #

(<$) :: a -> Categorical p b -> Categorical p a #

Functor (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fmap :: (a -> b) -> HashMap k a -> HashMap k b #

(<$) :: a -> HashMap k b -> HashMap k a #

Functor v => Functor (SizeSpec v) 
Instance details

Defined in Diagrams.Size

Methods

fmap :: (a -> b) -> SizeSpec v a -> SizeSpec v b #

(<$) :: a -> SizeSpec v b -> SizeSpec v a #

Functor (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

fmap :: (a -> b) -> Measured n a -> Measured n b #

(<$) :: a -> Measured n b -> Measured n a #

Functor f => Functor (MaybeApply f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> MaybeApply f a -> MaybeApply f b #

(<$) :: a -> MaybeApply f b -> MaybeApply f a #

Functor (IResult i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> IResult i a -> IResult i b #

(<$) :: a -> IResult i b -> IResult i a #

Functor (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> Parser i a -> Parser i b #

(<$) :: a -> Parser i b -> Parser i a #

Functor f => Functor (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

fmap :: (a -> b) -> Co f a -> Co f b #

(<$) :: a -> Co f b -> Co f a #

Functor f => Functor (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fmap :: (a -> b) -> Cofree f a -> Cofree f b #

(<$) :: a -> Cofree f b -> Cofree f a #

Functor f => Functor (WrappedApplicative f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #

(<$) :: a -> WrappedApplicative f b -> WrappedApplicative f a #

Functor v => Functor (Direction v) 
Instance details

Defined in Diagrams.Direction

Methods

fmap :: (a -> b) -> Direction v a -> Direction v b #

(<$) :: a -> Direction v b -> Direction v a #

Functor f => Functor (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing f a -> Indexing f b #

(<$) :: a -> Indexing f b -> Indexing f a #

Functor v => Functor (NonEmptyBoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> NonEmptyBoundingBox v a -> NonEmptyBoundingBox v b #

(<$) :: a -> NonEmptyBoundingBox v b -> NonEmptyBoundingBox v a #

Functor (SetM s) 
Instance details

Defined in Data.Graph

Methods

fmap :: (a -> b) -> SetM s a -> SetM s b #

(<$) :: a -> SetM s b -> SetM s a #

Functor f => Functor (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fmap :: (a -> b) -> Free f a -> Free f b #

(<$) :: a -> Free f b -> Free f a #

Functor (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fmap :: (a -> b) -> Yoneda f a -> Yoneda f b #

(<$) :: a -> Yoneda f b -> Yoneda f a #

Functor f => Functor (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b #

(<$) :: a -> Indexing64 f b -> Indexing64 f a #

Profunctor p => Functor (Coprep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Coprep p a -> Coprep p b #

(<$) :: a -> Coprep p b -> Coprep p a #

Profunctor p => Functor (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Prep p a -> Prep p b #

(<$) :: a -> Prep p b -> Prep p a #

Monad m => Functor (Handler m) 
Instance details

Defined in Control.Monad.Catch

Methods

fmap :: (a -> b) -> Handler m a -> Handler m b #

(<$) :: a -> Handler m b -> Handler m a #

Functor f => Functor (Rec1 f) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Rec1 f a -> Rec1 f b #

(<$) :: a -> Rec1 f b -> Rec1 f a #

Functor (URec Char :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Functor (URec Double :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Functor (URec Float :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Functor (URec Int :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Functor (URec Word :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Functor (URec (Ptr ()) :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b #

(<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a #

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

(<$) :: a0 -> Context a b b0 -> Context a b a0 #

Functor (Const m :: * -> *)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b #

(<$) :: a -> Const m b -> Const m a #

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 #

(<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #

Functor f => Functor (Alt f) 
Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Alt f a -> Alt f b #

(<$) :: a -> Alt f b -> Alt f a #

Functor m => Functor (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fmap :: (a -> b) -> IdentityT m a -> IdentityT m b #

(<$) :: a -> IdentityT m b -> IdentityT m a #

(Applicative f, Monad f) => Functor (WhenMissing f x)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b #

(<$) :: a -> WhenMissing f x b -> WhenMissing f x a #

Functor m => Functor (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b #

(<$) :: a -> ExceptT e m b -> ExceptT e m a #

Functor m => Functor (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b #

(<$) :: a -> ErrorT e m b -> ErrorT e m a #

Functor f => Functor (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b #

(<$) :: a -> Backwards f b -> Backwards f a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Monad m => Functor (Bundle m v) 
Instance details

Defined in Data.Vector.Fusion.Bundle.Monadic

Methods

fmap :: (a -> b) -> Bundle m v a -> Bundle m v b #

(<$) :: a -> Bundle m v b -> Bundle m v a #

Functor m => Functor (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

fmap :: (a -> b) -> RandT g m a -> RandT g m b #

(<$) :: a -> RandT g m b -> RandT g m a #

Bifunctor p => Functor (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fmap :: (a -> b) -> Join p a -> Join p b #

(<$) :: a -> Join p b -> Join p a #

Functor (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fmap :: (a -> b) -> Tagged s a -> Tagged s b #

(<$) :: a -> Tagged s b -> Tagged s a #

Functor (Mag a b) 
Instance details

Defined in Data.Biapplicative

Methods

fmap :: (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #

(<$) :: a0 -> Mag a b b0 -> Mag a b a0 #

Functor (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

fmap :: (a -> b) -> Query v n a -> Query v n b #

(<$) :: a -> Query v n b -> Query v n a #

Functor v => Functor (Segment c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Segment c v a -> Segment c v b #

(<$) :: a -> Segment c v b -> Segment c v a #

Functor v => Functor (Offset c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Offset c v a -> Offset c v b #

(<$) :: a -> Offset c v b -> Offset c v a #

(Functor f, Functor w) => Functor (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b #

(<$) :: a -> CofreeT f w b -> CofreeT f w a #

Functor f => Functor (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b #

(<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 #

Functor (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Costar f a a0 -> Costar f a b #

(<$) :: a0 -> Costar f a b -> Costar f a a0 #

Bifunctor p => Functor (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fmap :: (a -> b) -> Fix p a -> Fix p b #

(<$) :: a -> Fix p b -> Fix p a #

Functor (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Forget r a a0 -> Forget r a b #

(<$) :: a0 -> Forget r a b -> Forget r a a0 #

(Functor f, Monad m) => Functor (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a -> b) -> FreeT f m a -> FreeT f m b #

(<$) :: a -> FreeT f m b -> FreeT f m a #

Functor f => Functor (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b #

(<$) :: a0 -> FreeF f a b -> FreeF f a a0 #

Functor f => Functor (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Star f a a0 -> Star f a b #

(<$) :: a0 -> Star f a b -> Star f a a0 #

Functor (V n) 
Instance details

Defined in Linear.V

Methods

fmap :: (a -> b) -> V n a -> V n b #

(<$) :: a -> V n b -> V n a #

Functor (Day f g) 
Instance details

Defined in Data.Functor.Day

Methods

fmap :: (a -> b) -> Day f g a -> Day f g b #

(<$) :: a -> Day f g b -> Day f g a #

Functor (CotambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> CotambaraSum p a a0 -> CotambaraSum p a b #

(<$) :: a0 -> CotambaraSum p a b -> CotambaraSum p a a0 #

Profunctor p => Functor (TambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> TambaraSum p a a0 -> TambaraSum p a b #

(<$) :: a0 -> TambaraSum p a b -> TambaraSum p a a0 #

Profunctor p => Functor (Tambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Tambara p a a0 -> Tambara p a b #

(<$) :: a0 -> Tambara p a b -> Tambara p a a0 #

Functor (Holes t m) 
Instance details

Defined in Control.Lens.Traversal

Methods

fmap :: (a -> b) -> Holes t m a -> Holes t m b #

(<$) :: a -> Holes t m b -> Holes t m a #

Functor g => Functor (Curried g h) 
Instance details

Defined in Data.Functor.Day.Curried

Methods

fmap :: (a -> b) -> Curried g h a -> Curried g h b #

(<$) :: a -> Curried g h b -> Curried g h a #

Functor f => Functor (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a -> b0) -> AlongsideLeft f b a -> AlongsideLeft f b b0 #

(<$) :: a -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Functor f => Functor (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b #

(<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 #

Functor (Mafic a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #

(<$) :: a0 -> Mafic a b b0 -> Mafic a b a0 #

Functor (Flows i b) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b0) -> Flows i b a -> Flows i b b0 #

(<$) :: a -> Flows i b b0 -> Flows i b a #

Functor (Cotambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Cotambara p a a0 -> Cotambara p a b #

(<$) :: a0 -> Cotambara p a b -> Cotambara p a a0 #

Functor ((->) r :: * -> *)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> (r -> a) -> r -> b #

(<$) :: a -> (r -> b) -> r -> a #

Functor (K1 i c :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> K1 i c a -> K1 i c b #

(<$) :: a -> K1 i c b -> K1 i c a #

(Functor f, Functor g) => Functor (f :+: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b #

(<$) :: a -> (f :+: g) b -> (f :+: g) a #

(Functor f, Functor g) => Functor (f :*: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b #

(<$) :: a -> (f :*: g) b -> (f :*: g) a #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

(Functor f, Functor g) => Functor (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fmap :: (a -> b) -> Product f g a -> Product f g b #

(<$) :: a -> Product f g b -> Product f g a #

(Functor f, Functor g) => Functor (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fmap :: (a -> b) -> Sum f g a -> Sum f g b #

(<$) :: a -> Sum f g b -> Sum f g a #

Functor f => Functor (WhenMatched f x y)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #

(<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a #

(Applicative f, Monad f) => Functor (WhenMissing f k x)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #

(<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a #

Functor m => Functor (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b #

(<$) :: a -> ReaderT r m b -> ReaderT r m a #

Functor (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

fmap :: (a -> b) -> ContT r m a -> ContT r m b #

(<$) :: a -> ContT r m b -> ContT r m a #

Functor (QDiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiagram b v n a -> QDiagram b v n b0 #

(<$) :: a -> QDiagram b v n b0 -> QDiagram b v n a #

Functor (SubMap b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> SubMap b v n a -> SubMap b v n b0 #

(<$) :: a -> SubMap b v n b0 -> SubMap b v n a #

Functor (Subdiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> Subdiagram b v n a -> Subdiagram b v n b0 #

(<$) :: a -> Subdiagram b v n b0 -> Subdiagram b v n a #

Functor (Exchange a b s) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

fmap :: (a0 -> b0) -> Exchange a b s a0 -> Exchange a b s b0 #

(<$) :: a0 -> Exchange a b s b0 -> Exchange a b s a0 #

Functor (QDiaLeaf b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiaLeaf b v n a -> QDiaLeaf b v n b0 #

(<$) :: a -> QDiaLeaf b v n b0 -> QDiaLeaf b v n a #

Functor (DUALTreeU d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeU d u a a0 -> DUALTreeU d u a b #

(<$) :: a0 -> DUALTreeU d u a b -> DUALTreeU d u a a0 #

Functor (DUALTree d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTree d u a a0 -> DUALTree d u a b #

(<$) :: a0 -> DUALTree d u a b -> DUALTree d u a a0 #

Functor (DUALTreeNE d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeNE d u a a0 -> DUALTreeNE d u a b #

(<$) :: a0 -> DUALTreeNE d u a b -> DUALTreeNE d u a a0 #

Profunctor p => Functor (Procompose p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b #

(<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 #

Profunctor p => Functor (Rift p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b #

(<$) :: a0 -> Rift p q a b -> Rift p q a a0 #

Functor (Pretext p a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Pretext p a b a0 -> Pretext p a b b0 #

(<$) :: a0 -> Pretext p a b b0 -> Pretext p a b a0 #

Functor (Molten i a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #

(<$) :: a0 -> Molten i a b b0 -> Molten i a b a0 #

Functor f => Functor (M1 i c f) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> M1 i c f a -> M1 i c f b #

(<$) :: a -> M1 i c f b -> M1 i c f a #

(Functor f, Functor g) => Functor (f :.: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b #

(<$) :: a -> (f :.: g) b -> (f :.: g) a #

(Functor f, Functor g) => Functor (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fmap :: (a -> b) -> Compose f g a -> Compose f g b #

(<$) :: a -> Compose f g b -> Compose f g a #

Functor f => Functor (WhenMatched f k x y)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #

(<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor (Clown f a :: * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b #

(<$) :: a0 -> Clown f a b -> Clown f a a0 #

Bifunctor p => Functor (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b #

(<$) :: a0 -> Flip p a b -> Flip p a a0 #

Functor g => Functor (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b #

(<$) :: a0 -> Joker g a b -> Joker g a a0 #

Bifunctor p => Functor (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b #

(<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 #

Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) 
Instance details

Defined in Data.Reflection

Methods

fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #

(<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #

Functor (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #

(<$) :: a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

Functor (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT1 p g a b a0 -> BazaarT1 p g a b b0 #

(<$) :: a0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

Functor (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #

(<$) :: a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

Functor (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> PretextT p g a b a0 -> PretextT p g a b b0 #

(<$) :: a0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

Monad state => Functor (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

fmap :: (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #

(<$) :: a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

(Functor f, Bifunctor p) => Functor (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b #

(<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 #

(Bifunctor p, Functor g) => Functor (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b #

(<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 #

class Num a where #

Basic numeric class.

Minimal complete definition

(+), (*), abs, signum, fromInteger, (negate | (-))

Methods

(+) :: a -> a -> a infixl 6 #

(-) :: a -> a -> a infixl 6 #

(*) :: a -> a -> a infixl 7 #

negate :: a -> a #

Unary negation.

abs :: a -> a #

Absolute value.

signum :: a -> a #

Sign of a number. + overridden with a more efficient version.

Instances
Functor []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> [a] -> [b] #

(<$) :: a -> [b] -> [a] #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

Functor Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Par1 a -> Par1 b #

(<$) :: a -> Par1 b -> Par1 a #

Functor Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

fmap :: (a -> b) -> Q a -> Q b #

(<$) :: a -> Q b -> Q a #

Functor Only 
Instance details

Defined in Data.Tuple.Only

Methods

fmap :: (a -> b) -> Only a -> Only b #

(<$) :: a -> Only b -> Only a #

Functor IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> IResult a -> IResult b #

(<$) :: a -> IResult b -> IResult a #

Functor Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Result a -> Result b #

(<$) :: a -> Result b -> Result a #

Functor Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

fmap :: (a -> b) -> Complex a -> Complex b #

(<$) :: a -> Complex b -> Complex a #

Functor Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Min a -> Min b #

(<$) :: a -> Min b -> Min a #

Functor Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Max a -> Max b #

(<$) :: a -> Max b -> Max a #

Functor First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Option a -> Option b #

(<$) :: a -> Option b -> Option a #

Functor ZipList

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b #

(<$) :: a -> ZipList b -> ZipList a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

Functor Handler

Since: base-4.6.0.0

Instance details

Defined in Control.Exception

Methods

fmap :: (a -> b) -> Handler a -> Handler b #

(<$) :: a -> Handler b -> Handler a #

Functor First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Dual a -> Dual b #

(<$) :: a -> Dual b -> Dual a #

Functor Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Sum a -> Sum b #

(<$) :: a -> Sum b -> Sum a #

Functor Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Product a -> Product b #

(<$) :: a -> Product b -> Product a #

Functor Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

fmap :: (a -> b) -> Down a -> Down b #

(<$) :: a -> Down b -> Down a #

Functor ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

fmap :: (a -> b) -> ReadPrec a -> ReadPrec b #

(<$) :: a -> ReadPrec b -> ReadPrec a #

Functor ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> ReadP a -> ReadP b #

(<$) :: a -> ReadP b -> ReadP a #

Functor NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> NonEmpty a -> NonEmpty b #

(<$) :: a -> NonEmpty b -> NonEmpty a #

Functor PutM 
Instance details

Defined in Data.Binary.Put

Methods

fmap :: (a -> b) -> PutM a -> PutM b #

(<$) :: a -> PutM b -> PutM a #

Functor Decoder 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Decoder a -> Decoder b #

(<$) :: a -> Decoder b -> Decoder a #

Functor Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Get a -> Get b #

(<$) :: a -> Get b -> Get a #

Functor Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

fmap :: (a -> b) -> Put a -> Put b #

(<$) :: a -> Put b -> Put a #

Functor Parser 
Instance details

Defined in Data.Csv.Conversion

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b #

(<$) :: a -> IntMap b -> IntMap a #

Functor Tree 
Instance details

Defined in Data.Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b #

(<$) :: a -> Tree b -> Tree a #

Functor Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Seq a -> Seq b #

(<$) :: a -> Seq b -> Seq a #

Functor FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> FingerTree a -> FingerTree b #

(<$) :: a -> FingerTree b -> FingerTree a #

Functor Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Digit a -> Digit b #

(<$) :: a -> Digit b -> Digit a #

Functor Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Node a -> Node b #

(<$) :: a -> Node b -> Node a #

Functor Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Elem a -> Elem b #

(<$) :: a -> Elem b -> Elem a #

Functor ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewL a -> ViewL b #

(<$) :: a -> ViewL b -> ViewL a #

Functor ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewR a -> ViewR b #

(<$) :: a -> ViewR b -> ViewR a #

Functor DList 
Instance details

Defined in Data.DList

Methods

fmap :: (a -> b) -> DList a -> DList b #

(<$) :: a -> DList b -> DList a #

Functor Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fmap :: (a -> b) -> Interval a -> Interval b #

(<$) :: a -> Interval b -> Interval a #

Functor Doc 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Doc a -> Doc b #

(<$) :: a -> Doc b -> Doc a #

Functor AnnotDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b #

(<$) :: a -> AnnotDetails b -> AnnotDetails a #

Functor Span 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Span a -> Span b #

(<$) :: a -> Span b -> Span a #

Functor SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

fmap :: (a -> b) -> SmallArray a -> SmallArray b #

(<$) :: a -> SmallArray b -> SmallArray a #

Functor Array 
Instance details

Defined in Data.Primitive.Array

Methods

fmap :: (a -> b) -> Array a -> Array b #

(<$) :: a -> Array b -> Array a #

Functor Vector 
Instance details

Defined in Data.Vector

Methods

fmap :: (a -> b) -> Vector a -> Vector b #

(<$) :: a -> Vector b -> Vector a #

Functor Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Id a -> Id b #

(<$) :: a -> Id b -> Id a #

Functor Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Box a -> Box b #

(<$) :: a -> Box b -> Box a #

Functor Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

fmap :: (a -> b) -> Stream a -> Stream b #

(<$) :: a -> Stream b -> Stream a #

Functor P

Since: base-4.8.0.0

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor Root 
Instance details

Defined in Numeric.RootFinding

Methods

fmap :: (a -> b) -> Root a -> Root b #

(<$) :: a -> Root b -> Root a #

Functor Log 
Instance details

Defined in Numeric.Log

Methods

fmap :: (a -> b) -> Log a -> Log b #

(<$) :: a -> Log b -> Log a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor V2 
Instance details

Defined in Linear.V2

Methods

fmap :: (a -> b) -> V2 a -> V2 b #

(<$) :: a -> V2 b -> V2 a #

Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

Functor Grid 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

fmap :: (a -> b) -> Grid a -> Grid b #

(<$) :: a -> Grid b -> Grid a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Functor Active 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Active a -> Active b #

(<$) :: a -> Active b -> Active a #

Functor Dynamic 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Dynamic a -> Dynamic b #

(<$) :: a -> Dynamic b -> Dynamic a #

Functor Time 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Time a -> Time b #

(<$) :: a -> Time b -> Time a #

Functor V3 
Instance details

Defined in Linear.V3

Methods

fmap :: (a -> b) -> V3 a -> V3 b #

(<$) :: a -> V3 b -> V3 a #

Functor Angle 
Instance details

Defined in Diagrams.Angle

Methods

fmap :: (a -> b) -> Angle a -> Angle b #

(<$) :: a -> Angle b -> Angle a #

Functor FontSize 
Instance details

Defined in Diagrams.TwoD.Text

Methods

fmap :: (a -> b) -> FontSize a -> FontSize b #

(<$) :: a -> FontSize b -> FontSize a #

Functor V1 
Instance details

Defined in Linear.V1

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor Sh 
Instance details

Defined in Shelly.Base

Methods

fmap :: (a -> b) -> Sh a -> Sh b #

(<$) :: a -> Sh b -> Sh a #

Functor Duration 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Duration a -> Duration b #

(<$) :: a -> Duration b -> Duration a #

Functor Plucker 
Instance details

Defined in Linear.Plucker

Methods

fmap :: (a -> b) -> Plucker a -> Plucker b #

(<$) :: a -> Plucker b -> Plucker a #

Functor Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fmap :: (a -> b) -> Quaternion a -> Quaternion b #

(<$) :: a -> Quaternion b -> Quaternion a #

Functor V0 
Instance details

Defined in Linear.V0

Methods

fmap :: (a -> b) -> V0 a -> V0 b #

(<$) :: a -> V0 b -> V0 a #

Functor V4 
Instance details

Defined in Linear.V4

Methods

fmap :: (a -> b) -> V4 a -> V4 b #

(<$) :: a -> V4 b -> V4 a #

Functor BernsteinPoly 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

fmap :: (a -> b) -> BernsteinPoly a -> BernsteinPoly b #

(<$) :: a -> BernsteinPoly b -> BernsteinPoly a #

Functor GraphPart 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

fmap :: (a -> b) -> GraphPart a -> GraphPart b #

(<$) :: a -> GraphPart b -> GraphPart a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

Functor (V1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> U1 a -> U1 b #

(<$) :: a -> U1 b -> U1 a #

Functor ((,) a)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a0 -> b) -> (a, a0) -> (a, b) #

(<$) :: a0 -> (a, b) -> (a, a0) #

Functor (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fmap :: (a -> b) -> HashMap k a -> HashMap k b #

(<$) :: a -> HashMap k b -> HashMap k a #

Functor (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> Map k a -> Map k b #

(<$) :: a -> Map k b -> Map k a #

Functor (Array i)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

fmap :: (a -> b) -> Array i a -> Array i b #

(<$) :: a -> Array i b -> Array i a #

Functor (IResult i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> IResult i a -> IResult i b #

(<$) :: a -> IResult i b -> IResult i a #

Functor (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> Parser i a -> Parser i b #

(<$) :: a -> Parser i b -> Parser i a #

Functor (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a0 -> b) -> Arg a a0 -> Arg a b #

(<$) :: a0 -> Arg a b -> Arg a a0 #

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 #

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a #

Arrow a => Functor (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #

(<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 #

Functor (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

fmap :: (a -> b) -> Proxy a -> Proxy b #

(<$) :: a -> Proxy b -> Proxy a #

Functor m => Functor (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fmap :: (a -> b) -> MaybeT m a -> MaybeT m b #

(<$) :: a -> MaybeT m b -> MaybeT m a #

Monad m => Functor (Handler m) 
Instance details

Defined in Control.Monad.Catch

Methods

fmap :: (a -> b) -> Handler m a -> Handler m b #

(<$) :: a -> Handler m b -> Handler m a #

Functor s => Functor (ViewL s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewL s a -> ViewL s b #

(<$) :: a -> ViewL s b -> ViewL s a #

Functor s => Functor (ViewR s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewR s a -> ViewR s b #

(<$) :: a -> ViewR s b -> ViewR s a #

(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

fmap :: (a -> b) -> Generically1 f a -> Generically1 f b #

(<$) :: a -> Generically1 f b -> Generically1 f a #

Functor m => Functor (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b #

(<$) :: a -> ListT m b -> ListT m a #

Profunctor p => Functor (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Prep p a -> Prep p b #

(<$) :: a -> Prep p b -> Prep p a #

Profunctor p => Functor (Coprep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Coprep p a -> Coprep p b #

(<$) :: a -> Coprep p b -> Coprep p a #

Functor f => Functor (WrappedApplicative f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #

(<$) :: a -> WrappedApplicative f b -> WrappedApplicative f a #

Functor f => Functor (MaybeApply f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> MaybeApply f a -> MaybeApply f b #

(<$) :: a -> MaybeApply f b -> MaybeApply f a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Functor (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fmap :: (a -> b) -> Categorical p a -> Categorical p b #

(<$) :: a -> Categorical p b -> Categorical p a #

Functor (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

fmap :: (a0 -> b) -> ListF a a0 -> ListF a b #

(<$) :: a0 -> ListF a b -> ListF a a0 #

Functor f => Functor (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fmap :: (a -> b) -> Cofree f a -> Cofree f b #

(<$) :: a -> Cofree f b -> Cofree f a #

Functor f => Functor (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fmap :: (a -> b) -> Free f a -> Free f b #

(<$) :: a -> Free f b -> Free f a #

Functor (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

fmap :: (a0 -> b) -> NonEmptyF a a0 -> NonEmptyF a b #

(<$) :: a0 -> NonEmptyF a b -> NonEmptyF a a0 #

Functor v => Functor (SizeSpec v) 
Instance details

Defined in Diagrams.Size

Methods

fmap :: (a -> b) -> SizeSpec v a -> SizeSpec v b #

(<$) :: a -> SizeSpec v b -> SizeSpec v a #

Functor (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

fmap :: (a -> b) -> Measured n a -> Measured n b #

(<$) :: a -> Measured n b -> Measured n a #

Functor f => Functor (Point f) 
Instance details

Defined in Linear.Affine

Methods

fmap :: (a -> b) -> Point f a -> Point f b #

(<$) :: a -> Point f b -> Point f a #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Functor f => Functor (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

fmap :: (a -> b) -> Co f a -> Co f b #

(<$) :: a -> Co f b -> Co f a #

Functor v => Functor (Direction v) 
Instance details

Defined in Diagrams.Direction

Methods

fmap :: (a -> b) -> Direction v a -> Direction v b #

(<$) :: a -> Direction v b -> Direction v a #

Functor v => Functor (BoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> BoundingBox v a -> BoundingBox v b #

(<$) :: a -> BoundingBox v b -> BoundingBox v a #

Functor f => Functor (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing f a -> Indexing f b #

(<$) :: a -> Indexing f b -> Indexing f a #

Functor v => Functor (NonEmptyBoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> NonEmptyBoundingBox v a -> NonEmptyBoundingBox v b #

(<$) :: a -> NonEmptyBoundingBox v b -> NonEmptyBoundingBox v a #

Functor (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fmap :: (a -> b) -> Yoneda f a -> Yoneda f b #

(<$) :: a -> Yoneda f b -> Yoneda f a #

Functor f => Functor (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b #

(<$) :: a -> Indexing64 f b -> Indexing64 f a #

Functor f => Functor (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Rec1 f a -> Rec1 f b #

(<$) :: a -> Rec1 f b -> Rec1 f a #

Functor (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Functor (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Functor (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Functor (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Functor (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Functor (URec (Ptr ()) :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b #

(<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a #

Functor m => Functor (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

fmap :: (a -> b) -> RandT g m a -> RandT g m b #

(<$) :: a -> RandT g m b -> RandT g m a #

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 #

(<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #

Functor (Const m :: Type -> Type)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b #

(<$) :: a -> Const m b -> Const m a #

Functor f => Functor (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Ap f a -> Ap f b #

(<$) :: a -> Ap f b -> Ap f a #

Functor f => Functor (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Alt f a -> Alt f b #

(<$) :: a -> Alt f b -> Alt f a #

Bifunctor p => Functor (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fmap :: (a -> b) -> Join p a -> Join p b #

(<$) :: a -> Join p b -> Join p a #

Bifunctor p => Functor (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fmap :: (a -> b) -> Fix p a -> Fix p b #

(<$) :: a -> Fix p b -> Fix p a #

Functor m => Functor (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fmap :: (a -> b) -> IdentityT m a -> IdentityT m b #

(<$) :: a -> IdentityT m b -> IdentityT m a #

(Applicative f, Monad f) => Functor (WhenMissing f x)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b #

(<$) :: a -> WhenMissing f x b -> WhenMissing f x a #

Functor m => Functor (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b #

(<$) :: a -> ExceptT e m b -> ExceptT e m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b #

(<$) :: a -> ReaderT r m b -> ReaderT r m a #

Functor m => Functor (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b #

(<$) :: a -> ErrorT e m b -> ErrorT e m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Profunctor p => Functor (TambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> TambaraSum p a a0 -> TambaraSum p a b #

(<$) :: a0 -> TambaraSum p a b -> TambaraSum p a a0 #

Functor (CotambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> CotambaraSum p a a0 -> CotambaraSum p a b #

(<$) :: a0 -> CotambaraSum p a b -> CotambaraSum p a a0 #

Profunctor p => Functor (Tambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Tambara p a a0 -> Tambara p a b #

(<$) :: a0 -> Tambara p a b -> Tambara p a a0 #

Functor (Cotambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Cotambara p a a0 -> Cotambara p a b #

(<$) :: a0 -> Cotambara p a b -> Cotambara p a a0 #

Functor f => Functor (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Star f a a0 -> Star f a b #

(<$) :: a0 -> Star f a b -> Star f a a0 #

Functor (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Costar f a a0 -> Costar f a b #

(<$) :: a0 -> Costar f a b -> Costar f a a0 #

Functor (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Forget r a a0 -> Forget r a b #

(<$) :: a0 -> Forget r a b -> Forget r a a0 #

Functor (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fmap :: (a -> b) -> Tagged s a -> Tagged s b #

(<$) :: a -> Tagged s b -> Tagged s a #

Functor f => Functor (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b #

(<$) :: a -> Backwards f b -> Backwards f a #

Monad m => Functor (Bundle m v) 
Instance details

Defined in Data.Vector.Fusion.Bundle.Monadic

Methods

fmap :: (a -> b) -> Bundle m v a -> Bundle m v b #

(<$) :: a -> Bundle m v b -> Bundle m v a #

Functor (Mag a b) 
Instance details

Defined in Data.Biapplicative

Methods

fmap :: (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #

(<$) :: a0 -> Mag a b b0 -> Mag a b a0 #

(Functor f, Functor w) => Functor (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b #

(<$) :: a -> CofreeT f w b -> CofreeT f w a #

Functor f => Functor (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b #

(<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 #

(Functor f, Monad m) => Functor (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a -> b) -> FreeT f m a -> FreeT f m b #

(<$) :: a -> FreeT f m b -> FreeT f m a #

Functor f => Functor (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b #

(<$) :: a0 -> FreeF f a b -> FreeF f a a0 #

Functor (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

fmap :: (a -> b) -> Query v n a -> Query v n b #

(<$) :: a -> Query v n b -> Query v n a #

Functor v => Functor (Segment c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Segment c v a -> Segment c v b #

(<$) :: a -> Segment c v b -> Segment c v a #

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

(<$) :: a0 -> Context a b b0 -> Context a b a0 #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Functor v => Functor (Offset c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Offset c v a -> Offset c v b #

(<$) :: a -> Offset c v b -> Offset c v a #

Functor (V n) 
Instance details

Defined in Linear.V

Methods

fmap :: (a -> b) -> V n a -> V n b #

(<$) :: a -> V n b -> V n a #

Functor (Day f g) 
Instance details

Defined in Data.Functor.Day

Methods

fmap :: (a -> b) -> Day f g a -> Day f g b #

(<$) :: a -> Day f g b -> Day f g a #

Functor (Mafic a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #

(<$) :: a0 -> Mafic a b b0 -> Mafic a b a0 #

Functor f => Functor (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a -> b0) -> AlongsideLeft f b a -> AlongsideLeft f b b0 #

(<$) :: a -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Functor f => Functor (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b #

(<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 #

Functor (Flows i b) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b0) -> Flows i b a -> Flows i b b0 #

(<$) :: a -> Flows i b b0 -> Flows i b a #

Functor (Holes t m) 
Instance details

Defined in Control.Lens.Traversal

Methods

fmap :: (a -> b) -> Holes t m a -> Holes t m b #

(<$) :: a -> Holes t m b -> Holes t m a #

Functor g => Functor (Curried g h) 
Instance details

Defined in Data.Functor.Day.Curried

Methods

fmap :: (a -> b) -> Curried g h a -> Curried g h b #

(<$) :: a -> Curried g h b -> Curried g h a #

Functor ((->) r :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> (r -> a) -> r -> b #

(<$) :: a -> (r -> b) -> r -> a #

Functor (K1 i c :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> K1 i c a -> K1 i c b #

(<$) :: a -> K1 i c b -> K1 i c a #

(Functor f, Functor g) => Functor (f :+: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b #

(<$) :: a -> (f :+: g) b -> (f :+: g) a #

(Functor f, Functor g) => Functor (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b #

(<$) :: a -> (f :*: g) b -> (f :*: g) a #

(Functor f, Functor g) => Functor (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fmap :: (a -> b) -> Product f g a -> Product f g b #

(<$) :: a -> Product f g b -> Product f g a #

(Functor f, Functor g) => Functor (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fmap :: (a -> b) -> Sum f g a -> Sum f g b #

(<$) :: a -> Sum f g b -> Sum f g a #

Functor f => Functor (WhenMatched f x y)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #

(<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a #

(Applicative f, Monad f) => Functor (WhenMissing f k x)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #

(<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a #

Functor (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

fmap :: (a -> b) -> ContT r m a -> ContT r m b #

(<$) :: a -> ContT r m b -> ContT r m a #

Profunctor p => Functor (Procompose p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b #

(<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 #

Profunctor p => Functor (Rift p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b #

(<$) :: a0 -> Rift p q a b -> Rift p q a a0 #

Functor (QDiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiagram b v n a -> QDiagram b v n b0 #

(<$) :: a -> QDiagram b v n b0 -> QDiagram b v n a #

Functor (SubMap b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> SubMap b v n a -> SubMap b v n b0 #

(<$) :: a -> SubMap b v n b0 -> SubMap b v n a #

Functor (Subdiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> Subdiagram b v n a -> Subdiagram b v n b0 #

(<$) :: a -> Subdiagram b v n b0 -> Subdiagram b v n a #

Functor (Exchange a b s) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

fmap :: (a0 -> b0) -> Exchange a b s a0 -> Exchange a b s b0 #

(<$) :: a0 -> Exchange a b s b0 -> Exchange a b s a0 #

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Functor (QDiaLeaf b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiaLeaf b v n a -> QDiaLeaf b v n b0 #

(<$) :: a -> QDiaLeaf b v n b0 -> QDiaLeaf b v n a #

Functor (DUALTree d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTree d u a a0 -> DUALTree d u a b #

(<$) :: a0 -> DUALTree d u a b -> DUALTree d u a a0 #

Functor (DUALTreeU d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeU d u a a0 -> DUALTreeU d u a b #

(<$) :: a0 -> DUALTreeU d u a b -> DUALTreeU d u a a0 #

Functor (DUALTreeNE d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeNE d u a a0 -> DUALTreeNE d u a b #

(<$) :: a0 -> DUALTreeNE d u a b -> DUALTreeNE d u a a0 #

Functor (Molten i a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #

(<$) :: a0 -> Molten i a b b0 -> Molten i a b a0 #

Functor (Pretext p a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Pretext p a b a0 -> Pretext p a b b0 #

(<$) :: a0 -> Pretext p a b b0 -> Pretext p a b a0 #

Functor f => Functor (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> M1 i c f a -> M1 i c f b #

(<$) :: a -> M1 i c f b -> M1 i c f a #

(Functor f, Functor g) => Functor (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b #

(<$) :: a -> (f :.: g) b -> (f :.: g) a #

(Functor f, Functor g) => Functor (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fmap :: (a -> b) -> Compose f g a -> Compose f g b #

(<$) :: a -> Compose f g b -> Compose f g a #

Bifunctor p => Functor (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b #

(<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 #

Functor g => Functor (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b #

(<$) :: a0 -> Joker g a b -> Joker g a a0 #

Bifunctor p => Functor (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b #

(<$) :: a0 -> Flip p a b -> Flip p a a0 #

Functor (Clown f a :: Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b #

(<$) :: a0 -> Clown f a b -> Clown f a a0 #

Functor f => Functor (WhenMatched f k x y)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #

(<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) 
Instance details

Defined in Data.Reflection

Methods

fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #

(<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #

Functor (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #

(<$) :: a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

Functor (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> PretextT p g a b a0 -> PretextT p g a b b0 #

(<$) :: a0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

Functor (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #

(<$) :: a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

Functor (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT1 p g a b a0 -> BazaarT1 p g a b b0 #

(<$) :: a0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

Monad state => Functor (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

fmap :: (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #

(<$) :: a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

(Functor f, Bifunctor p) => Functor (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b #

(<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 #

(Bifunctor p, Functor g) => Functor (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b #

(<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 #

class Num a where #

Basic numeric class.

The Haskell Report defines no laws for Num. However, '(+)' and '(*)' are + customarily expected to define a ring and have the following properties:

Associativity of (+)
(x + y) + z = x + (y + z)
Commutativity of (+)
x + y = y + x
fromInteger 0 is the additive identity
x + fromInteger 0 = x
negate gives the additive inverse
x + negate x = fromInteger 0
Associativity of (*)
(x * y) * z = x * (y * z)
fromInteger 1 is the multiplicative identity
x * fromInteger 1 = x and fromInteger 1 * x = x
Distributivity of (*) with respect to (+)
a * (b + c) = (a * b) + (a * c) and (b + c) * a = (b * a) + (c * a)

Note that it isn't customarily expected that a type instance of both Num + and Ord implement an ordered ring. Indeed, in base only Integer and + Rational do.

Minimal complete definition

(+), (*), abs, signum, fromInteger, (negate | (-))

Methods

(+) :: a -> a -> a infixl 6 #

(-) :: a -> a -> a infixl 6 #

(*) :: a -> a -> a infixl 7 #

negate :: a -> a #

Unary negation.

abs :: a -> a #

Absolute value.

signum :: a -> a #

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 #

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
Num Int

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Int -> Int -> Int #

(-) :: Int -> Int -> Int #

(*) :: Int -> Int -> Int #

negate :: Int -> Int #

abs :: Int -> Int #

signum :: Int -> Int #

fromInteger :: Integer -> Int #

Num Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int8 -> Int8 -> Int8 #

(-) :: Int8 -> Int8 -> Int8 #

(*) :: Int8 -> Int8 -> Int8 #

negate :: Int8 -> Int8 #

abs :: Int8 -> Int8 #

signum :: Int8 -> Int8 #

fromInteger :: Integer -> Int8 #

Num Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int16 -> Int16 -> Int16 #

(-) :: Int16 -> Int16 -> Int16 #

(*) :: Int16 -> Int16 -> Int16 #

negate :: Int16 -> Int16 #

abs :: Int16 -> Int16 #

signum :: Int16 -> Int16 #

fromInteger :: Integer -> Int16 #

Num Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int32 -> Int32 -> Int32 #

(-) :: Int32 -> Int32 -> Int32 #

(*) :: Int32 -> Int32 -> Int32 #

negate :: Int32 -> Int32 #

abs :: Int32 -> Int32 #

signum :: Int32 -> Int32 #

fromInteger :: Integer -> Int32 #

Num Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int64 -> Int64 -> Int64 #

(-) :: Int64 -> Int64 -> Int64 #

(*) :: Int64 -> Int64 -> Int64 #

negate :: Int64 -> Int64 #

abs :: Int64 -> Int64 #

signum :: Int64 -> Int64 #

fromInteger :: Integer -> Int64 #

Num Integer

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Integer -> Integer -> Integer #

(-) :: Integer -> Integer -> Integer #

(*) :: Integer -> Integer -> Integer #

negate :: Integer -> Integer #

abs :: Integer -> Integer #

signum :: Integer -> Integer #

fromInteger :: Integer -> Integer #

Num Word

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Word -> Word -> Word #

(-) :: Word -> Word -> Word #

(*) :: Word -> Word -> Word #

negate :: Word -> Word #

abs :: Word -> Word #

signum :: Word -> Word #

fromInteger :: Integer -> Word #

Num Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word8 -> Word8 -> Word8 #

(-) :: Word8 -> Word8 -> Word8 #

(*) :: Word8 -> Word8 -> Word8 #

negate :: Word8 -> Word8 #

abs :: Word8 -> Word8 #

signum :: Word8 -> Word8 #

fromInteger :: Integer -> Word8 #

Num Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word16 -> Word16 -> Word16 #

(-) :: Word16 -> Word16 -> Word16 #

(*) :: Word16 -> Word16 -> Word16 #

negate :: Word16 -> Word16 #

abs :: Word16 -> Word16 #

signum :: Word16 -> Word16 #

fromInteger :: Integer -> Word16 #

Num Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word32 -> Word32 -> Word32 #

(-) :: Word32 -> Word32 -> Word32 #

(*) :: Word32 -> Word32 -> Word32 #

negate :: Word32 -> Word32 #

abs :: Word32 -> Word32 #

signum :: Word32 -> Word32 #

fromInteger :: Integer -> Word32 #

Num Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word64 -> Word64 -> Word64 #

(-) :: Word64 -> Word64 -> Word64 #

(*) :: Word64 -> Word64 -> Word64 #

negate :: Word64 -> Word64 #

abs :: Word64 -> Word64 #

signum :: Word64 -> Word64 #

fromInteger :: Integer -> Word64 #

Num Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: Percent -> Percent -> Percent #

(-) :: Percent -> Percent -> Percent #

(*) :: Percent -> Percent -> Percent #

negate :: Percent -> Percent #

abs :: Percent -> Percent #

signum :: Percent -> Percent #

fromInteger :: Integer -> Percent #

Num LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: LogValue -> LogValue -> LogValue #

(-) :: LogValue -> LogValue -> LogValue #

(*) :: LogValue -> LogValue -> LogValue #

negate :: LogValue -> LogValue #

abs :: LogValue -> LogValue #

signum :: LogValue -> LogValue #

fromInteger :: Integer -> LogValue #

Num PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(+) :: PlotIndex -> PlotIndex -> PlotIndex #

(-) :: PlotIndex -> PlotIndex -> PlotIndex #

(*) :: PlotIndex -> PlotIndex -> PlotIndex #

negate :: PlotIndex -> PlotIndex #

abs :: PlotIndex -> PlotIndex #

signum :: PlotIndex -> PlotIndex #

fromInteger :: Integer -> PlotIndex #

Num Matrix

Copied from Graphics.Rendering.Cairo.Matrix

Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(+) :: Matrix -> Matrix -> Matrix #

(-) :: Matrix -> Matrix -> Matrix #

(*) :: Matrix -> Matrix -> Matrix #

negate :: Matrix -> Matrix #

abs :: Matrix -> Matrix #

signum :: Matrix -> Matrix #

fromInteger :: Integer -> Matrix #

Num CChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CChar -> CChar -> CChar #

(-) :: CChar -> CChar -> CChar #

(*) :: CChar -> CChar -> CChar #

negate :: CChar -> CChar #

abs :: CChar -> CChar #

signum :: CChar -> CChar #

fromInteger :: Integer -> CChar #

Num CSChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSChar -> CSChar -> CSChar #

(-) :: CSChar -> CSChar -> CSChar #

(*) :: CSChar -> CSChar -> CSChar #

negate :: CSChar -> CSChar #

abs :: CSChar -> CSChar #

signum :: CSChar -> CSChar #

fromInteger :: Integer -> CSChar #

Num CUChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUChar -> CUChar -> CUChar #

(-) :: CUChar -> CUChar -> CUChar #

(*) :: CUChar -> CUChar -> CUChar #

negate :: CUChar -> CUChar #

abs :: CUChar -> CUChar #

signum :: CUChar -> CUChar #

fromInteger :: Integer -> CUChar #

Num CShort 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CShort -> CShort -> CShort #

(-) :: CShort -> CShort -> CShort #

(*) :: CShort -> CShort -> CShort #

negate :: CShort -> CShort #

abs :: CShort -> CShort #

signum :: CShort -> CShort #

fromInteger :: Integer -> CShort #

Num CUShort 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUShort -> CUShort -> CUShort #

(-) :: CUShort -> CUShort -> CUShort #

(*) :: CUShort -> CUShort -> CUShort #

negate :: CUShort -> CUShort #

abs :: CUShort -> CUShort #

signum :: CUShort -> CUShort #

fromInteger :: Integer -> CUShort #

Num CInt 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CInt -> CInt -> CInt #

(-) :: CInt -> CInt -> CInt #

(*) :: CInt -> CInt -> CInt #

negate :: CInt -> CInt #

abs :: CInt -> CInt #

signum :: CInt -> CInt #

fromInteger :: Integer -> CInt #

Num CUInt 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUInt -> CUInt -> CUInt #

(-) :: CUInt -> CUInt -> CUInt #

(*) :: CUInt -> CUInt -> CUInt #

negate :: CUInt -> CUInt #

abs :: CUInt -> CUInt #

signum :: CUInt -> CUInt #

fromInteger :: Integer -> CUInt #

Num CLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CLong -> CLong -> CLong #

(-) :: CLong -> CLong -> CLong #

(*) :: CLong -> CLong -> CLong #

negate :: CLong -> CLong #

abs :: CLong -> CLong #

signum :: CLong -> CLong #

fromInteger :: Integer -> CLong #

Num CULong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CULong -> CULong -> CULong #

(-) :: CULong -> CULong -> CULong #

(*) :: CULong -> CULong -> CULong #

negate :: CULong -> CULong #

abs :: CULong -> CULong #

signum :: CULong -> CULong #

fromInteger :: Integer -> CULong #

Num CLLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CLLong -> CLLong -> CLLong #

(-) :: CLLong -> CLLong -> CLLong #

(*) :: CLLong -> CLLong -> CLLong #

negate :: CLLong -> CLLong #

abs :: CLLong -> CLLong #

signum :: CLLong -> CLLong #

fromInteger :: Integer -> CLLong #

Num CULLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CULLong -> CULLong -> CULLong #

(-) :: CULLong -> CULLong -> CULLong #

(*) :: CULLong -> CULLong -> CULLong #

negate :: CULLong -> CULLong #

abs :: CULLong -> CULLong #

signum :: CULLong -> CULLong #

fromInteger :: Integer -> CULLong #

Num CBool 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CBool -> CBool -> CBool #

(-) :: CBool -> CBool -> CBool #

(*) :: CBool -> CBool -> CBool #

negate :: CBool -> CBool #

abs :: CBool -> CBool #

signum :: CBool -> CBool #

fromInteger :: Integer -> CBool #

Num CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CFloat -> CFloat -> CFloat #

(-) :: CFloat -> CFloat -> CFloat #

(*) :: CFloat -> CFloat -> CFloat #

negate :: CFloat -> CFloat #

abs :: CFloat -> CFloat #

signum :: CFloat -> CFloat #

fromInteger :: Integer -> CFloat #

Num CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CDouble -> CDouble -> CDouble #

(-) :: CDouble -> CDouble -> CDouble #

(*) :: CDouble -> CDouble -> CDouble #

negate :: CDouble -> CDouble #

abs :: CDouble -> CDouble #

signum :: CDouble -> CDouble #

fromInteger :: Integer -> CDouble #

Num CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

(-) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

(*) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

negate :: CPtrdiff -> CPtrdiff #

abs :: CPtrdiff -> CPtrdiff #

signum :: CPtrdiff -> CPtrdiff #

fromInteger :: Integer -> CPtrdiff #

Num CSize 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSize -> CSize -> CSize #

(-) :: CSize -> CSize -> CSize #

(*) :: CSize -> CSize -> CSize #

negate :: CSize -> CSize #

abs :: CSize -> CSize #

signum :: CSize -> CSize #

fromInteger :: Integer -> CSize #

Num CWchar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CWchar -> CWchar -> CWchar #

(-) :: CWchar -> CWchar -> CWchar #

(*) :: CWchar -> CWchar -> CWchar #

negate :: CWchar -> CWchar #

abs :: CWchar -> CWchar #

signum :: CWchar -> CWchar #

fromInteger :: Integer -> CWchar #

Num CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

(-) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

(*) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

negate :: CSigAtomic -> CSigAtomic #

abs :: CSigAtomic -> CSigAtomic #

signum :: CSigAtomic -> CSigAtomic #

fromInteger :: Integer -> CSigAtomic #

Num CClock 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CClock -> CClock -> CClock #

(-) :: CClock -> CClock -> CClock #

(*) :: CClock -> CClock -> CClock #

negate :: CClock -> CClock #

abs :: CClock -> CClock #

signum :: CClock -> CClock #

fromInteger :: Integer -> CClock #

Num CTime 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CTime -> CTime -> CTime #

(-) :: CTime -> CTime -> CTime #

(*) :: CTime -> CTime -> CTime #

negate :: CTime -> CTime #

abs :: CTime -> CTime #

signum :: CTime -> CTime #

fromInteger :: Integer -> CTime #

Num CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUSeconds -> CUSeconds -> CUSeconds #

(-) :: CUSeconds -> CUSeconds -> CUSeconds #

(*) :: CUSeconds -> CUSeconds -> CUSeconds #

negate :: CUSeconds -> CUSeconds #

abs :: CUSeconds -> CUSeconds #

signum :: CUSeconds -> CUSeconds #

fromInteger :: Integer -> CUSeconds #

Num CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

(-) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

(*) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

negate :: CSUSeconds -> CSUSeconds #

abs :: CSUSeconds -> CSUSeconds #

signum :: CSUSeconds -> CSUSeconds #

fromInteger :: Integer -> CSUSeconds #

Num CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CIntPtr -> CIntPtr -> CIntPtr #

(-) :: CIntPtr -> CIntPtr -> CIntPtr #

(*) :: CIntPtr -> CIntPtr -> CIntPtr #

negate :: CIntPtr -> CIntPtr #

abs :: CIntPtr -> CIntPtr #

signum :: CIntPtr -> CIntPtr #

fromInteger :: Integer -> CIntPtr #

Num CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

(-) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

(*) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

negate :: CUIntPtr -> CUIntPtr #

abs :: CUIntPtr -> CUIntPtr #

signum :: CUIntPtr -> CUIntPtr #

fromInteger :: Integer -> CUIntPtr #

Num CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CIntMax -> CIntMax -> CIntMax #

(-) :: CIntMax -> CIntMax -> CIntMax #

(*) :: CIntMax -> CIntMax -> CIntMax #

negate :: CIntMax -> CIntMax #

abs :: CIntMax -> CIntMax #

signum :: CIntMax -> CIntMax #

fromInteger :: Integer -> CIntMax #

Num CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUIntMax -> CUIntMax -> CUIntMax #

(-) :: CUIntMax -> CUIntMax -> CUIntMax #

(*) :: CUIntMax -> CUIntMax -> CUIntMax #

negate :: CUIntMax -> CUIntMax #

abs :: CUIntMax -> CUIntMax #

signum :: CUIntMax -> CUIntMax #

fromInteger :: Integer -> CUIntMax #

Num NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

(-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

(*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

negate :: NominalDiffTime -> NominalDiffTime #

abs :: NominalDiffTime -> NominalDiffTime #

signum :: NominalDiffTime -> NominalDiffTime #

fromInteger :: Integer -> NominalDiffTime #

Num DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(+) :: DiffTime -> DiffTime -> DiffTime #

(-) :: DiffTime -> DiffTime -> DiffTime #

(*) :: DiffTime -> DiffTime -> DiffTime #

negate :: DiffTime -> DiffTime #

abs :: DiffTime -> DiffTime #

signum :: DiffTime -> DiffTime #

fromInteger :: Integer -> DiffTime #

Num Scientific 
Instance details

Defined in Data.Scientific

Methods

(+) :: Scientific -> Scientific -> Scientific #

(-) :: Scientific -> Scientific -> Scientific #

(*) :: Scientific -> Scientific -> Scientific #

negate :: Scientific -> Scientific #

abs :: Scientific -> Scientific #

signum :: Scientific -> Scientific #

fromInteger :: Integer -> Scientific #

Num Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(+) :: Crossings -> Crossings -> Crossings #

(-) :: Crossings -> Crossings -> Crossings #

(*) :: Crossings -> Crossings -> Crossings #

negate :: Crossings -> Crossings #

abs :: Crossings -> Crossings #

signum :: Crossings -> Crossings #

fromInteger :: Integer -> Crossings #

Num Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(+) :: Pos -> Pos -> Pos #

(-) :: Pos -> Pos -> Pos #

(*) :: Pos -> Pos -> Pos #

negate :: Pos -> Pos #

abs :: Pos -> Pos #

signum :: Pos -> Pos #

fromInteger :: Integer -> Pos #

Num LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(+) :: LogFloat -> LogFloat -> LogFloat #

(-) :: LogFloat -> LogFloat -> LogFloat #

(*) :: LogFloat -> LogFloat -> LogFloat #

negate :: LogFloat -> LogFloat #

abs :: LogFloat -> LogFloat #

signum :: LogFloat -> LogFloat #

fromInteger :: Integer -> LogFloat #

Num ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(+) :: ConstVal -> ConstVal -> ConstVal #

(-) :: ConstVal -> ConstVal -> ConstVal #

(*) :: ConstVal -> ConstVal -> ConstVal #

negate :: ConstVal -> ConstVal #

abs :: ConstVal -> ConstVal #

signum :: ConstVal -> ConstVal #

fromInteger :: Integer -> ConstVal #

Num DExpr # 
Instance details

Defined in Data.Expression

Methods

(+) :: DExpr -> DExpr -> DExpr #

(-) :: DExpr -> DExpr -> DExpr #

(*) :: DExpr -> DExpr -> DExpr #

negate :: DExpr -> DExpr #

abs :: DExpr -> DExpr #

signum :: DExpr -> DExpr #

fromInteger :: Integer -> DExpr #

Num t => Num [t] # 
Instance details

Defined in Util

Methods

(+) :: [t] -> [t] -> [t] #

(-) :: [t] -> [t] -> [t] #

(*) :: [t] -> [t] -> [t] #

negate :: [t] -> [t] #

abs :: [t] -> [t] #

signum :: [t] -> [t] #

fromInteger :: Integer -> [t] #

Integral a => Num (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

(+) :: Ratio a -> Ratio a -> Ratio a #

(-) :: Ratio a -> Ratio a -> Ratio a #

(*) :: Ratio a -> Ratio a -> Ratio a #

negate :: Ratio a -> Ratio a #

abs :: Ratio a -> Ratio a #

signum :: Ratio a -> Ratio a #

fromInteger :: Integer -> Ratio a #

Num a => Num (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a #

(-) :: Identity a -> Identity a -> Identity a #

(*) :: Identity a -> Identity a -> Identity a #

negate :: Identity a -> Identity a #

abs :: Identity a -> Identity a #

signum :: Identity a -> Identity a #

fromInteger :: Integer -> Identity a #

RealFloat a => Num (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

(+) :: Complex a -> Complex a -> Complex a #

(-) :: Complex a -> Complex a -> Complex a #

(*) :: Complex a -> Complex a -> Complex a #

negate :: Complex a -> Complex a #

abs :: Complex a -> Complex a #

signum :: Complex a -> Complex a #

fromInteger :: Integer -> Complex a #

Num a => Num (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(+) :: Min a -> Min a -> Min a #

(-) :: Min a -> Min a -> Min a #

(*) :: Min a -> Min a -> Min a #

negate :: Min a -> Min a #

abs :: Min a -> Min a #

signum :: Min a -> Min a #

fromInteger :: Integer -> Min a #

Num a => Num (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(+) :: Max a -> Max a -> Max a #

(-) :: Max a -> Max a -> Max a #

(*) :: Max a -> Max a -> Max a #

negate :: Max a -> Max a #

abs :: Max a -> Max a #

signum :: Max a -> Max a #

fromInteger :: Integer -> Max a #

Num a => Num (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Sum a -> Sum a -> Sum a #

(-) :: Sum a -> Sum a -> Sum a #

(*) :: Sum a -> Sum a -> Sum a #

negate :: Sum a -> Sum a #

abs :: Sum a -> Sum a #

signum :: Sum a -> Sum a #

fromInteger :: Integer -> Sum a #

Num a => Num (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Product a -> Product a -> Product a #

(-) :: Product a -> Product a -> Product a #

(*) :: Product a -> Product a -> Product a #

negate :: Product a -> Product a #

abs :: Product a -> Product a #

signum :: Product a -> Product a #

fromInteger :: Integer -> Product a #

Num a => Num (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(+) :: Down a -> Down a -> Down a #

(-) :: Down a -> Down a -> Down a #

(*) :: Down a -> Down a -> Down a #

negate :: Down a -> Down a #

abs :: Down a -> Down a #

signum :: Down a -> Down a #

fromInteger :: Integer -> Down a #

Num (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(+) :: Offset ty -> Offset ty -> Offset ty #

(-) :: Offset ty -> Offset ty -> Offset ty #

(*) :: Offset ty -> Offset ty -> Offset ty #

negate :: Offset ty -> Offset ty #

abs :: Offset ty -> Offset ty #

signum :: Offset ty -> Offset ty #

fromInteger :: Integer -> Offset ty #

Num (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(+) :: CountOf ty -> CountOf ty -> CountOf ty #

(-) :: CountOf ty -> CountOf ty -> CountOf ty #

(*) :: CountOf ty -> CountOf ty -> CountOf ty #

negate :: CountOf ty -> CountOf ty #

abs :: CountOf ty -> CountOf ty #

signum :: CountOf ty -> CountOf ty #

fromInteger :: Integer -> CountOf ty #

Num a => Num (V3 a) 
Instance details

Defined in Linear.V3

Methods

(+) :: V3 a -> V3 a -> V3 a #

(-) :: V3 a -> V3 a -> V3 a #

(*) :: V3 a -> V3 a -> V3 a #

negate :: V3 a -> V3 a #

abs :: V3 a -> V3 a #

signum :: V3 a -> V3 a #

fromInteger :: Integer -> V3 a #

Num a => Num (V2 a) 
Instance details

Defined in Linear.V2

Methods

(+) :: V2 a -> V2 a -> V2 a #

(-) :: V2 a -> V2 a -> V2 a #

(*) :: V2 a -> V2 a -> V2 a #

negate :: V2 a -> V2 a #

abs :: V2 a -> V2 a #

signum :: V2 a -> V2 a #

fromInteger :: Integer -> V2 a #

KnownNat m => Num (Vector (Mod m I)) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

(-) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

(*) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

negate :: Vector (Mod m I) -> Vector (Mod m I) #

abs :: Vector (Mod m I) -> Vector (Mod m I) #

signum :: Vector (Mod m I) -> Vector (Mod m I) #

fromInteger :: Integer -> Vector (Mod m I) #

KnownNat m => Num (Vector (Mod m Z)) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

(-) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

(*) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

negate :: Vector (Mod m Z) -> Vector (Mod m Z) #

abs :: Vector (Mod m Z) -> Vector (Mod m Z) #

signum :: Vector (Mod m Z) -> Vector (Mod m Z) #

fromInteger :: Integer -> Vector (Mod m Z) #

Num n => Num (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

(+) :: VarInt n -> VarInt n -> VarInt n #

(-) :: VarInt n -> VarInt n -> VarInt n #

(*) :: VarInt n -> VarInt n -> VarInt n #

negate :: VarInt n -> VarInt n #

abs :: VarInt n -> VarInt n #

signum :: VarInt n -> VarInt n #

fromInteger :: Integer -> VarInt n #

(Precise a, RealFloat a) => Num (Log a) 
Instance details

Defined in Numeric.Log

Methods

(+) :: Log a -> Log a -> Log a #

(-) :: Log a -> Log a -> Log a #

(*) :: Log a -> Log a -> Log a #

negate :: Log a -> Log a #

abs :: Log a -> Log a #

signum :: Log a -> Log a #

fromInteger :: Integer -> Log a #

Num n => Num (Time n) 
Instance details

Defined in Data.Active

Methods

(+) :: Time n -> Time n -> Time n #

(-) :: Time n -> Time n -> Time n #

(*) :: Time n -> Time n -> Time n #

negate :: Time n -> Time n #

abs :: Time n -> Time n #

signum :: Time n -> Time n #

fromInteger :: Integer -> Time n #

(Num a, Ord a) => Num (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(+) :: Interval a -> Interval a -> Interval a #

(-) :: Interval a -> Interval a -> Interval a #

(*) :: Interval a -> Interval a -> Interval a #

negate :: Interval a -> Interval a #

abs :: Interval a -> Interval a #

signum :: Interval a -> Interval a #

fromInteger :: Integer -> Interval a #

Num a => Num (V1 a) 
Instance details

Defined in Linear.V1

Methods

(+) :: V1 a -> V1 a -> V1 a #

(-) :: V1 a -> V1 a -> V1 a #

(*) :: V1 a -> V1 a -> V1 a #

negate :: V1 a -> V1 a #

abs :: V1 a -> V1 a #

signum :: V1 a -> V1 a #

fromInteger :: Integer -> V1 a #

Num n => Num (Duration n) 
Instance details

Defined in Data.Active

Methods

(+) :: Duration n -> Duration n -> Duration n #

(-) :: Duration n -> Duration n -> Duration n #

(*) :: Duration n -> Duration n -> Duration n #

negate :: Duration n -> Duration n #

abs :: Duration n -> Duration n #

signum :: Duration n -> Duration n #

fromInteger :: Integer -> Duration n #

Num a => Num (V4 a) 
Instance details

Defined in Linear.V4

Methods

(+) :: V4 a -> V4 a -> V4 a #

(-) :: V4 a -> V4 a -> V4 a #

(*) :: V4 a -> V4 a -> V4 a #

negate :: V4 a -> V4 a #

abs :: V4 a -> V4 a #

signum :: V4 a -> V4 a #

fromInteger :: Integer -> V4 a #

Fractional n => Num (BernsteinPoly n) 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

(+) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

(-) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

(*) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

negate :: BernsteinPoly n -> BernsteinPoly n #

abs :: BernsteinPoly n -> BernsteinPoly n #

signum :: BernsteinPoly n -> BernsteinPoly n #

fromInteger :: Integer -> BernsteinPoly n #

Num a => Num (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

(+) :: Plucker a -> Plucker a -> Plucker a #

(-) :: Plucker a -> Plucker a -> Plucker a #

(*) :: Plucker a -> Plucker a -> Plucker a #

negate :: Plucker a -> Plucker a #

abs :: Plucker a -> Plucker a #

signum :: Plucker a -> Plucker a #

fromInteger :: Integer -> Plucker a #

RealFloat a => Num (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

(+) :: Quaternion a -> Quaternion a -> Quaternion a #

(-) :: Quaternion a -> Quaternion a -> Quaternion a #

(*) :: Quaternion a -> Quaternion a -> Quaternion a #

negate :: Quaternion a -> Quaternion a #

abs :: Quaternion a -> Quaternion a #

signum :: Quaternion a -> Quaternion a #

fromInteger :: Integer -> Quaternion a #

Num (V0 a) 
Instance details

Defined in Linear.V0

Methods

(+) :: V0 a -> V0 a -> V0 a #

(-) :: V0 a -> V0 a -> V0 a #

(*) :: V0 a -> V0 a -> V0 a #

negate :: V0 a -> V0 a #

abs :: V0 a -> V0 a #

signum :: V0 a -> V0 a #

fromInteger :: Integer -> V0 a #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Num (f a) => Num (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(+) :: Point f a -> Point f a -> Point f a #

(-) :: Point f a -> Point f a -> Point f a #

(*) :: Point f a -> Point f a -> Point f a #

negate :: Point f a -> Point f a #

abs :: Point f a -> Point f a #

signum :: Point f a -> Point f a #

fromInteger :: Integer -> Point f a #

(Integral t, KnownNat n) => Num (Mod n t) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Mod n t -> Mod n t -> Mod n t #

(-) :: Mod n t -> Mod n t -> Mod n t #

(*) :: Mod n t -> Mod n t -> Mod n t #

negate :: Mod n t -> Mod n t #

abs :: Mod n t -> Mod n t #

signum :: Mod n t -> Mod n t #

fromInteger :: Integer -> Mod n t #

Num a => Num (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(+) :: Measured n a -> Measured n a -> Measured n a #

(-) :: Measured n a -> Measured n a -> Measured n a #

(*) :: Measured n a -> Measured n a -> Measured n a #

negate :: Measured n a -> Measured n a #

abs :: Measured n a -> Measured n a #

signum :: Measured n a -> Measured n a #

fromInteger :: Integer -> Measured n a #

Num a => Num (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(+) :: Op a b -> Op a b -> Op a b #

(-) :: Op a b -> Op a b -> Op a b #

(*) :: Op a b -> Op a b -> Op a b #

negate :: Op a b -> Op a b #

abs :: Op a b -> Op a b #

signum :: Op a b -> Op a b #

fromInteger :: Integer -> Op a b #

Num a => Num (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

(+) :: Const a b -> Const a b -> Const a b #

(-) :: Const a b -> Const a b -> Const a b #

(*) :: Const a b -> Const a b -> Const a b #

negate :: Const a b -> Const a b #

abs :: Const a b -> Const a b #

signum :: Const a b -> Const a b #

fromInteger :: Integer -> Const a b #

Num (f a) => Num (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Alt f a -> Alt f a -> Alt f a #

(-) :: Alt f a -> Alt f a -> Alt f a #

(*) :: Alt f a -> Alt f a -> Alt f a #

negate :: Alt f a -> Alt f a #

abs :: Alt f a -> Alt f a #

signum :: Alt f a -> Alt f a #

fromInteger :: Integer -> Alt f a #

Num a => Num (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(+) :: Tagged s a -> Tagged s a -> Tagged s a #

(-) :: Tagged s a -> Tagged s a -> Tagged s a #

(*) :: Tagged s a -> Tagged s a -> Tagged s a #

negate :: Tagged s a -> Tagged s a #

abs :: Tagged s a -> Tagged s a #

signum :: Tagged s a -> Tagged s a #

fromInteger :: Integer -> Tagged s a #

(Dim n, Num a) => Num (V n a) 
Instance details

Defined in Linear.V

Methods

(+) :: V n a -> V n a -> V n a #

(-) :: V n a -> V n a -> V n a #

(*) :: V n a -> V n a -> V n a #

negate :: V n a -> V n a #

abs :: V n a -> V n a #

signum :: V n a -> V n a #

fromInteger :: Integer -> V n a #

class Eq a => Ord a where #

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.

Minimal complete definition

compare | (<=)

Methods

compare :: a -> a -> Ordering #

Instances
Ord Bool 
Instance details

Defined in GHC.Classes

Methods

compare :: Bool -> Bool -> Ordering #

(<) :: Bool -> Bool -> Bool #

(<=) :: Bool -> Bool -> Bool #

(>) :: Bool -> Bool -> Bool #

(>=) :: Bool -> Bool -> Bool #

max :: Bool -> Bool -> Bool #

min :: Bool -> Bool -> Bool #

Ord Char 
Instance details

Defined in GHC.Classes

Methods

compare :: Char -> Char -> Ordering #

(<) :: Char -> Char -> Bool #

(<=) :: Char -> Char -> Bool #

(>) :: Char -> Char -> Bool #

(>=) :: Char -> Char -> Bool #

max :: Char -> Char -> Char #

min :: Char -> Char -> Char #

Ord Double 
Instance details

Defined in GHC.Classes

Methods

compare :: Double -> Double -> Ordering #

(<) :: Double -> Double -> Bool #

(<=) :: Double -> Double -> Bool #

(>) :: Double -> Double -> Bool #

(>=) :: Double -> Double -> Bool #

max :: Double -> Double -> Double #

min :: Double -> Double -> Double #

Ord Float 
Instance details

Defined in GHC.Classes

Methods

compare :: Float -> Float -> Ordering #

(<) :: Float -> Float -> Bool #

(<=) :: Float -> Float -> Bool #

(>) :: Float -> Float -> Bool #

(>=) :: Float -> Float -> Bool #

max :: Float -> Float -> Float #

min :: Float -> Float -> Float #

Ord Int 
Instance details

Defined in GHC.Classes

Methods

compare :: Int -> Int -> Ordering #

(<) :: Int -> Int -> Bool #

(<=) :: Int -> Int -> Bool #

(>) :: Int -> Int -> Bool #

(>=) :: Int -> Int -> Bool #

max :: Int -> Int -> Int #

min :: Int -> Int -> Int #

Ord Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int8 -> Int8 -> Ordering #

(<) :: Int8 -> Int8 -> Bool #

(<=) :: Int8 -> Int8 -> Bool #

(>) :: Int8 -> Int8 -> Bool #

(>=) :: Int8 -> Int8 -> Bool #

max :: Int8 -> Int8 -> Int8 #

min :: Int8 -> Int8 -> Int8 #

Ord Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int16 -> Int16 -> Ordering #

(<) :: Int16 -> Int16 -> Bool #

(<=) :: Int16 -> Int16 -> Bool #

(>) :: Int16 -> Int16 -> Bool #

(>=) :: Int16 -> Int16 -> Bool #

max :: Int16 -> Int16 -> Int16 #

min :: Int16 -> Int16 -> Int16 #

Ord Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int32 -> Int32 -> Ordering #

(<) :: Int32 -> Int32 -> Bool #

(<=) :: Int32 -> Int32 -> Bool #

(>) :: Int32 -> Int32 -> Bool #

(>=) :: Int32 -> Int32 -> Bool #

max :: Int32 -> Int32 -> Int32 #

min :: Int32 -> Int32 -> Int32 #

Ord Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int64 -> Int64 -> Ordering #

(<) :: Int64 -> Int64 -> Bool #

(<=) :: Int64 -> Int64 -> Bool #

(>) :: Int64 -> Int64 -> Bool #

(>=) :: Int64 -> Int64 -> Bool #

max :: Int64 -> Int64 -> Int64 #

min :: Int64 -> Int64 -> Int64 #

Ord Integer 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: Integer -> Integer -> Ordering #

(<) :: Integer -> Integer -> Bool #

(<=) :: Integer -> Integer -> Bool #

(>) :: Integer -> Integer -> Bool #

(>=) :: Integer -> Integer -> Bool #

max :: Integer -> Integer -> Integer #

min :: Integer -> Integer -> Integer #

Ord Ordering 
Instance details

Defined in GHC.Classes

Methods

compare :: Ordering -> Ordering -> Ordering #

(<) :: Ordering -> Ordering -> Bool #

(<=) :: Ordering -> Ordering -> Bool #

(>) :: Ordering -> Ordering -> Bool #

(>=) :: Ordering -> Ordering -> Bool #

max :: Ordering -> Ordering -> Ordering #

min :: Ordering -> Ordering -> Ordering #

Ord Word 
Instance details

Defined in GHC.Classes

Methods

compare :: Word -> Word -> Ordering #

(<) :: Word -> Word -> Bool #

(<=) :: Word -> Word -> Bool #

(>) :: Word -> Word -> Bool #

(>=) :: Word -> Word -> Bool #

max :: Word -> Word -> Word #

min :: Word -> Word -> Word #

Ord Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word8 -> Word8 -> Ordering #

(<) :: Word8 -> Word8 -> Bool #

(<=) :: Word8 -> Word8 -> Bool #

(>) :: Word8 -> Word8 -> Bool #

(>=) :: Word8 -> Word8 -> Bool #

max :: Word8 -> Word8 -> Word8 #

min :: Word8 -> Word8 -> Word8 #

Ord Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word16 -> Word16 -> Ordering #

(<) :: Word16 -> Word16 -> Bool #

(<=) :: Word16 -> Word16 -> Bool #

(>) :: Word16 -> Word16 -> Bool #

(>=) :: Word16 -> Word16 -> Bool #

max :: Word16 -> Word16 -> Word16 #

min :: Word16 -> Word16 -> Word16 #

Ord Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word32 -> Word32 -> Ordering #

(<) :: Word32 -> Word32 -> Bool #

(<=) :: Word32 -> Word32 -> Bool #

(>) :: Word32 -> Word32 -> Bool #

(>=) :: Word32 -> Word32 -> Bool #

max :: Word32 -> Word32 -> Word32 #

min :: Word32 -> Word32 -> Word32 #

Ord Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word64 -> Word64 -> Ordering #

(<) :: Word64 -> Word64 -> Bool #

(<=) :: Word64 -> Word64 -> Bool #

(>) :: Word64 -> Word64 -> Bool #

(>=) :: Word64 -> Word64 -> Bool #

max :: Word64 -> Word64 -> Word64 #

min :: Word64 -> Word64 -> Word64 #

Ord SomeTypeRep 
Instance details

Defined in Data.Typeable.Internal

Methods

compare :: SomeTypeRep -> SomeTypeRep -> Ordering #

(<) :: SomeTypeRep -> SomeTypeRep -> Bool #

(<=) :: SomeTypeRep -> SomeTypeRep -> Bool #

(>) :: SomeTypeRep -> SomeTypeRep -> Bool #

(>=) :: SomeTypeRep -> SomeTypeRep -> Bool #

max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #

min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #

Ord Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Exp -> Exp -> Ordering #

(<) :: Exp -> Exp -> Bool #

(<=) :: Exp -> Exp -> Bool #

(>) :: Exp -> Exp -> Bool #

(>=) :: Exp -> Exp -> Bool #

max :: Exp -> Exp -> Exp #

min :: Exp -> Exp -> Exp #

Ord Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Match -> Match -> Ordering #

(<) :: Match -> Match -> Bool #

(<=) :: Match -> Match -> Bool #

(>) :: Match -> Match -> Bool #

(>=) :: Match -> Match -> Bool #

max :: Match -> Match -> Match #

min :: Match -> Match -> Match #

Ord Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Clause -> Clause -> Ordering #

(<) :: Clause -> Clause -> Bool #

(<=) :: Clause -> Clause -> Bool #

(>) :: Clause -> Clause -> Bool #

(>=) :: Clause -> Clause -> Bool #

max :: Clause -> Clause -> Clause #

min :: Clause -> Clause -> Clause #

Ord Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Pat -> Pat -> Ordering #

(<) :: Pat -> Pat -> Bool #

(<=) :: Pat -> Pat -> Bool #

(>) :: Pat -> Pat -> Bool #

(>=) :: Pat -> Pat -> Bool #

max :: Pat -> Pat -> Pat #

min :: Pat -> Pat -> Pat #

Ord Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Ord Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Dec -> Dec -> Ordering #

(<) :: Dec -> Dec -> Bool #

(<=) :: Dec -> Dec -> Bool #

(>) :: Dec -> Dec -> Bool #

(>=) :: Dec -> Dec -> Bool #

max :: Dec -> Dec -> Dec #

min :: Dec -> Dec -> Dec #

Ord Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Name -> Name -> Ordering #

(<) :: Name -> Name -> Bool #

(<=) :: Name -> Name -> Bool #

(>) :: Name -> Name -> Bool #

(>=) :: Name -> Name -> Bool #

max :: Name -> Name -> Name #

min :: Name -> Name -> Name #

Ord FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FunDep -> FunDep -> Ordering #

(<) :: FunDep -> FunDep -> Bool #

(<=) :: FunDep -> FunDep -> Bool #

(>) :: FunDep -> FunDep -> Bool #

(>=) :: FunDep -> FunDep -> Bool #

max :: FunDep -> FunDep -> FunDep #

min :: FunDep -> FunDep -> FunDep #

Ord InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: InjectivityAnn -> InjectivityAnn -> Ordering #

(<) :: InjectivityAnn -> InjectivityAnn -> Bool #

(<=) :: InjectivityAnn -> InjectivityAnn -> Bool #

(>) :: InjectivityAnn -> InjectivityAnn -> Bool #

(>=) :: InjectivityAnn -> InjectivityAnn -> Bool #

max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #

min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #

Ord Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Overlap -> Overlap -> Ordering #

(<) :: Overlap -> Overlap -> Bool #

(<=) :: Overlap -> Overlap -> Bool #

(>) :: Overlap -> Overlap -> Bool #

(>=) :: Overlap -> Overlap -> Bool #

max :: Overlap -> Overlap -> Overlap #

min :: Overlap -> Overlap -> Overlap #

Ord DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivStrategy -> DerivStrategy -> Ordering #

(<) :: DerivStrategy -> DerivStrategy -> Bool #

(<=) :: DerivStrategy -> DerivStrategy -> Bool #

(>) :: DerivStrategy -> DerivStrategy -> Bool #

(>=) :: DerivStrategy -> DerivStrategy -> Bool #

max :: DerivStrategy -> DerivStrategy -> DerivStrategy #

min :: DerivStrategy -> DerivStrategy -> DerivStrategy #

Ord () 
Instance details

Defined in GHC.Classes

Methods

compare :: () -> () -> Ordering #

(<) :: () -> () -> Bool #

(<=) :: () -> () -> Bool #

(>) :: () -> () -> Bool #

(>=) :: () -> () -> Bool #

max :: () -> () -> () #

min :: () -> () -> () #

Ord TyCon 
Instance details

Defined in GHC.Classes

Methods

compare :: TyCon -> TyCon -> Ordering #

(<) :: TyCon -> TyCon -> Bool #

(<=) :: TyCon -> TyCon -> Bool #

(>) :: TyCon -> TyCon -> Bool #

(>=) :: TyCon -> TyCon -> Bool #

max :: TyCon -> TyCon -> TyCon #

min :: TyCon -> TyCon -> TyCon #

Ord DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

compare :: DefName -> DefName -> Ordering #

(<) :: DefName -> DefName -> Bool #

(<=) :: DefName -> DefName -> Bool #

(>) :: DefName -> DefName -> Bool #

(>=) :: DefName -> DefName -> Bool #

max :: DefName -> DefName -> DefName #

min :: DefName -> DefName -> DefName #

Ord LocalTime 
Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

compare :: LocalTime -> LocalTime -> Ordering #

(<) :: LocalTime -> LocalTime -> Bool #

(<=) :: LocalTime -> LocalTime -> Bool #

(>) :: LocalTime -> LocalTime -> Bool #

(>=) :: LocalTime -> LocalTime -> Bool #

max :: LocalTime -> LocalTime -> LocalTime #

min :: LocalTime -> LocalTime -> LocalTime #

Ord Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: Percent -> Percent -> Ordering #

(<) :: Percent -> Percent -> Bool #

(<=) :: Percent -> Percent -> Bool #

(>) :: Percent -> Percent -> Bool #

(>=) :: Percent -> Percent -> Bool #

max :: Percent -> Percent -> Percent #

min :: Percent -> Percent -> Percent #

Ord LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: LogValue -> LogValue -> Ordering #

(<) :: LogValue -> LogValue -> Bool #

(<=) :: LogValue -> LogValue -> Bool #

(>) :: LogValue -> LogValue -> Bool #

(>=) :: LogValue -> LogValue -> Bool #

max :: LogValue -> LogValue -> LogValue #

min :: LogValue -> LogValue -> LogValue #

Ord PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

compare :: PlotIndex -> PlotIndex -> Ordering #

(<) :: PlotIndex -> PlotIndex -> Bool #

(<=) :: PlotIndex -> PlotIndex -> Bool #

(>) :: PlotIndex -> PlotIndex -> Bool #

(>=) :: PlotIndex -> PlotIndex -> Bool #

max :: PlotIndex -> PlotIndex -> PlotIndex #

min :: PlotIndex -> PlotIndex -> PlotIndex #

Ord LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineCap -> LineCap -> Ordering #

(<) :: LineCap -> LineCap -> Bool #

(<=) :: LineCap -> LineCap -> Bool #

(>) :: LineCap -> LineCap -> Bool #

(>=) :: LineCap -> LineCap -> Bool #

max :: LineCap -> LineCap -> LineCap #

min :: LineCap -> LineCap -> LineCap #

Ord LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineJoin -> LineJoin -> Ordering #

(<) :: LineJoin -> LineJoin -> Bool #

(<=) :: LineJoin -> LineJoin -> Bool #

(>) :: LineJoin -> LineJoin -> Bool #

(>=) :: LineJoin -> LineJoin -> Bool #

max :: LineJoin -> LineJoin -> LineJoin #

min :: LineJoin -> LineJoin -> LineJoin #

Ord FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Ord FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Ord HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: HTextAnchor -> HTextAnchor -> Ordering #

(<) :: HTextAnchor -> HTextAnchor -> Bool #

(<=) :: HTextAnchor -> HTextAnchor -> Bool #

(>) :: HTextAnchor -> HTextAnchor -> Bool #

(>=) :: HTextAnchor -> HTextAnchor -> Bool #

max :: HTextAnchor -> HTextAnchor -> HTextAnchor #

min :: HTextAnchor -> HTextAnchor -> HTextAnchor #

Ord VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: VTextAnchor -> VTextAnchor -> Ordering #

(<) :: VTextAnchor -> VTextAnchor -> Bool #

(<=) :: VTextAnchor -> VTextAnchor -> Bool #

(>) :: VTextAnchor -> VTextAnchor -> Bool #

(>=) :: VTextAnchor -> VTextAnchor -> Bool #

max :: VTextAnchor -> VTextAnchor -> VTextAnchor #

min :: VTextAnchor -> VTextAnchor -> VTextAnchor #

Ord IOMode 
Instance details

Defined in GHC.IO.IOMode

Methods

compare :: IOMode -> IOMode -> Ordering #

(<) :: IOMode -> IOMode -> Bool #

(<=) :: IOMode -> IOMode -> Bool #

(>) :: IOMode -> IOMode -> Bool #

(>=) :: IOMode -> IOMode -> Bool #

max :: IOMode -> IOMode -> IOMode #

min :: IOMode -> IOMode -> IOMode #

Ord Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Con -> Con -> Ordering #

(<) :: Con -> Con -> Bool #

(<=) :: Con -> Con -> Bool #

(>) :: Con -> Con -> Bool #

(>=) :: Con -> Con -> Bool #

max :: Con -> Con -> Con #

min :: Con -> Con -> Con #

Ord ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

compare :: ByteString -> ByteString -> Ordering #

(<) :: ByteString -> ByteString -> Bool #

(<=) :: ByteString -> ByteString -> Bool #

(>) :: ByteString -> ByteString -> Bool #

(>=) :: ByteString -> ByteString -> Bool #

max :: ByteString -> ByteString -> ByteString #

min :: ByteString -> ByteString -> ByteString #

Ord ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

compare :: ByteString -> ByteString -> Ordering #

(<) :: ByteString -> ByteString -> Bool #

(<=) :: ByteString -> ByteString -> Bool #

(>) :: ByteString -> ByteString -> Bool #

(>=) :: ByteString -> ByteString -> Bool #

max :: ByteString -> ByteString -> ByteString #

min :: ByteString -> ByteString -> ByteString #

Ord UTCTime 
Instance details

Defined in Data.Time.Clock.Internal.UTCTime

Methods

compare :: UTCTime -> UTCTime -> Ordering #

(<) :: UTCTime -> UTCTime -> Bool #

(<=) :: UTCTime -> UTCTime -> Bool #

(>) :: UTCTime -> UTCTime -> Bool #

(>=) :: UTCTime -> UTCTime -> Bool #

max :: UTCTime -> UTCTime -> UTCTime #

min :: UTCTime -> UTCTime -> UTCTime #

Ord BigNat 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: BigNat -> BigNat -> Ordering #

(<) :: BigNat -> BigNat -> Bool #

(<=) :: BigNat -> BigNat -> Bool #

(>) :: BigNat -> BigNat -> Bool #

(>=) :: BigNat -> BigNat -> Bool #

max :: BigNat -> BigNat -> BigNat #

min :: BigNat -> BigNat -> BigNat #

Ord Void

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

compare :: Void -> Void -> Ordering #

(<) :: Void -> Void -> Bool #

(<=) :: Void -> Void -> Bool #

(>) :: Void -> Void -> Bool #

(>=) :: Void -> Void -> Bool #

max :: Void -> Void -> Void #

min :: Void -> Void -> Void #

Ord Version

Since: base-2.1

Instance details

Defined in Data.Version

Methods

compare :: Version -> Version -> Ordering #

(<) :: Version -> Version -> Bool #

(<=) :: Version -> Version -> Bool #

(>) :: Version -> Version -> Bool #

(>=) :: Version -> Version -> Bool #

max :: Version -> Version -> Version #

min :: Version -> Version -> Version #

Ord AsyncException 
Instance details

Defined in GHC.IO.Exception

Methods

compare :: AsyncException -> AsyncException -> Ordering #

(<) :: AsyncException -> AsyncException -> Bool #

(<=) :: AsyncException -> AsyncException -> Bool #

(>) :: AsyncException -> AsyncException -> Bool #

(>=) :: AsyncException -> AsyncException -> Bool #

max :: AsyncException -> AsyncException -> AsyncException #

min :: AsyncException -> AsyncException -> AsyncException #

Ord ArrayException 
Instance details

Defined in GHC.IO.Exception

Methods

compare :: ArrayException -> ArrayException -> Ordering #

(<) :: ArrayException -> ArrayException -> Bool #

(<=) :: ArrayException -> ArrayException -> Bool #

(>) :: ArrayException -> ArrayException -> Bool #

(>=) :: ArrayException -> ArrayException -> Bool #

max :: ArrayException -> ArrayException -> ArrayException #

min :: ArrayException -> ArrayException -> ArrayException #

Ord ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

compare :: ExitCode -> ExitCode -> Ordering #

(<) :: ExitCode -> ExitCode -> Bool #

(<=) :: ExitCode -> ExitCode -> Bool #

(>) :: ExitCode -> ExitCode -> Bool #

(>=) :: ExitCode -> ExitCode -> Bool #

max :: ExitCode -> ExitCode -> ExitCode #

min :: ExitCode -> ExitCode -> ExitCode #

Ord BufferMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: BufferMode -> BufferMode -> Ordering #

(<) :: BufferMode -> BufferMode -> Bool #

(<=) :: BufferMode -> BufferMode -> Bool #

(>) :: BufferMode -> BufferMode -> Bool #

(>=) :: BufferMode -> BufferMode -> Bool #

max :: BufferMode -> BufferMode -> BufferMode #

min :: BufferMode -> BufferMode -> BufferMode #

Ord Newline 
Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: Newline -> Newline -> Ordering #

(<) :: Newline -> Newline -> Bool #

(<=) :: Newline -> Newline -> Bool #

(>) :: Newline -> Newline -> Bool #

(>=) :: Newline -> Newline -> Bool #

max :: Newline -> Newline -> Newline #

min :: Newline -> Newline -> Newline #

Ord NewlineMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: NewlineMode -> NewlineMode -> Ordering #

(<) :: NewlineMode -> NewlineMode -> Bool #

(<=) :: NewlineMode -> NewlineMode -> Bool #

(>) :: NewlineMode -> NewlineMode -> Bool #

(>=) :: NewlineMode -> NewlineMode -> Bool #

max :: NewlineMode -> NewlineMode -> NewlineMode #

min :: NewlineMode -> NewlineMode -> NewlineMode #

Ord SeekMode 
Instance details

Defined in GHC.IO.Device

Methods

compare :: SeekMode -> SeekMode -> Ordering #

(<) :: SeekMode -> SeekMode -> Bool #

(<=) :: SeekMode -> SeekMode -> Bool #

(>) :: SeekMode -> SeekMode -> Bool #

(>=) :: SeekMode -> SeekMode -> Bool #

max :: SeekMode -> SeekMode -> SeekMode #

min :: SeekMode -> SeekMode -> SeekMode #

Ord ErrorCall 
Instance details

Defined in GHC.Exception

Methods

compare :: ErrorCall -> ErrorCall -> Ordering #

(<) :: ErrorCall -> ErrorCall -> Bool #

(<=) :: ErrorCall -> ErrorCall -> Bool #

(>) :: ErrorCall -> ErrorCall -> Bool #

(>=) :: ErrorCall -> ErrorCall -> Bool #

max :: ErrorCall -> ErrorCall -> ErrorCall #

min :: ErrorCall -> ErrorCall -> ErrorCall #

Ord ArithException 
Instance details

Defined in GHC.Exception

Methods

compare :: ArithException -> ArithException -> Ordering #

(<) :: ArithException -> ArithException -> Bool #

(<=) :: ArithException -> ArithException -> Bool #

(>) :: ArithException -> ArithException -> Bool #

(>=) :: ArithException -> ArithException -> Bool #

max :: ArithException -> ArithException -> ArithException #

min :: ArithException -> ArithException -> ArithException #

Ord All 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: All -> All -> Ordering #

(<) :: All -> All -> Bool #

(<=) :: All -> All -> Bool #

(>) :: All -> All -> Bool #

(>=) :: All -> All -> Bool #

max :: All -> All -> All #

min :: All -> All -> All #

Ord Any 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Any -> Any -> Ordering #

(<) :: Any -> Any -> Bool #

(<=) :: Any -> Any -> Bool #

(>) :: Any -> Any -> Bool #

(>=) :: Any -> Any -> Bool #

max :: Any -> Any -> Any #

min :: Any -> Any -> Any #

Ord Fixity 
Instance details

Defined in GHC.Generics

Methods

compare :: Fixity -> Fixity -> Ordering #

(<) :: Fixity -> Fixity -> Bool #

(<=) :: Fixity -> Fixity -> Bool #

(>) :: Fixity -> Fixity -> Bool #

(>=) :: Fixity -> Fixity -> Bool #

max :: Fixity -> Fixity -> Fixity #

min :: Fixity -> Fixity -> Fixity #

Ord Associativity 
Instance details

Defined in GHC.Generics

Methods

compare :: Associativity -> Associativity -> Ordering #

(<) :: Associativity -> Associativity -> Bool #

(<=) :: Associativity -> Associativity -> Bool #

(>) :: Associativity -> Associativity -> Bool #

(>=) :: Associativity -> Associativity -> Bool #

max :: Associativity -> Associativity -> Associativity #

min :: Associativity -> Associativity -> Associativity #

Ord SourceUnpackedness 
Instance details

Defined in GHC.Generics

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

Ord SourceStrictness 
Instance details

Defined in GHC.Generics

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering #

(<) :: SourceStrictness -> SourceStrictness -> Bool #

(<=) :: SourceStrictness -> SourceStrictness -> Bool #

(>) :: SourceStrictness -> SourceStrictness -> Bool #

(>=) :: SourceStrictness -> SourceStrictness -> Bool #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness #

Ord DecidedStrictness 
Instance details

Defined in GHC.Generics

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

Ord SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

compare :: SomeNat -> SomeNat -> Ordering #

(<) :: SomeNat -> SomeNat -> Bool #

(<=) :: SomeNat -> SomeNat -> Bool #

(>) :: SomeNat -> SomeNat -> Bool #

(>=) :: SomeNat -> SomeNat -> Bool #

max :: SomeNat -> SomeNat -> SomeNat #

min :: SomeNat -> SomeNat -> SomeNat #

Ord CChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CChar -> CChar -> Ordering #

(<) :: CChar -> CChar -> Bool #

(<=) :: CChar -> CChar -> Bool #

(>) :: CChar -> CChar -> Bool #

(>=) :: CChar -> CChar -> Bool #

max :: CChar -> CChar -> CChar #

min :: CChar -> CChar -> CChar #

Ord CSChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSChar -> CSChar -> Ordering #

(<) :: CSChar -> CSChar -> Bool #

(<=) :: CSChar -> CSChar -> Bool #

(>) :: CSChar -> CSChar -> Bool #

(>=) :: CSChar -> CSChar -> Bool #

max :: CSChar -> CSChar -> CSChar #

min :: CSChar -> CSChar -> CSChar #

Ord CUChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUChar -> CUChar -> Ordering #

(<) :: CUChar -> CUChar -> Bool #

(<=) :: CUChar -> CUChar -> Bool #

(>) :: CUChar -> CUChar -> Bool #

(>=) :: CUChar -> CUChar -> Bool #

max :: CUChar -> CUChar -> CUChar #

min :: CUChar -> CUChar -> CUChar #

Ord CShort 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CShort -> CShort -> Ordering #

(<) :: CShort -> CShort -> Bool #

(<=) :: CShort -> CShort -> Bool #

(>) :: CShort -> CShort -> Bool #

(>=) :: CShort -> CShort -> Bool #

max :: CShort -> CShort -> CShort #

min :: CShort -> CShort -> CShort #

Ord CUShort 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUShort -> CUShort -> Ordering #

(<) :: CUShort -> CUShort -> Bool #

(<=) :: CUShort -> CUShort -> Bool #

(>) :: CUShort -> CUShort -> Bool #

(>=) :: CUShort -> CUShort -> Bool #

max :: CUShort -> CUShort -> CUShort #

min :: CUShort -> CUShort -> CUShort #

Ord CInt 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CInt -> CInt -> Ordering #

(<) :: CInt -> CInt -> Bool #

(<=) :: CInt -> CInt -> Bool #

(>) :: CInt -> CInt -> Bool #

(>=) :: CInt -> CInt -> Bool #

max :: CInt -> CInt -> CInt #

min :: CInt -> CInt -> CInt #

Ord CUInt 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUInt -> CUInt -> Ordering #

(<) :: CUInt -> CUInt -> Bool #

(<=) :: CUInt -> CUInt -> Bool #

(>) :: CUInt -> CUInt -> Bool #

(>=) :: CUInt -> CUInt -> Bool #

max :: CUInt -> CUInt -> CUInt #

min :: CUInt -> CUInt -> CUInt #

Ord CLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CLong -> CLong -> Ordering #

(<) :: CLong -> CLong -> Bool #

(<=) :: CLong -> CLong -> Bool #

(>) :: CLong -> CLong -> Bool #

(>=) :: CLong -> CLong -> Bool #

max :: CLong -> CLong -> CLong #

min :: CLong -> CLong -> CLong #

Ord CULong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CULong -> CULong -> Ordering #

(<) :: CULong -> CULong -> Bool #

(<=) :: CULong -> CULong -> Bool #

(>) :: CULong -> CULong -> Bool #

(>=) :: CULong -> CULong -> Bool #

max :: CULong -> CULong -> CULong #

min :: CULong -> CULong -> CULong #

Ord CLLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CLLong -> CLLong -> Ordering #

(<) :: CLLong -> CLLong -> Bool #

(<=) :: CLLong -> CLLong -> Bool #

(>) :: CLLong -> CLLong -> Bool #

(>=) :: CLLong -> CLLong -> Bool #

max :: CLLong -> CLLong -> CLLong #

min :: CLLong -> CLLong -> CLLong #

Ord CULLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CULLong -> CULLong -> Ordering #

(<) :: CULLong -> CULLong -> Bool #

(<=) :: CULLong -> CULLong -> Bool #

(>) :: CULLong -> CULLong -> Bool #

(>=) :: CULLong -> CULLong -> Bool #

max :: CULLong -> CULLong -> CULLong #

min :: CULLong -> CULLong -> CULLong #

Ord CBool 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CBool -> CBool -> Ordering #

(<) :: CBool -> CBool -> Bool #

(<=) :: CBool -> CBool -> Bool #

(>) :: CBool -> CBool -> Bool #

(>=) :: CBool -> CBool -> Bool #

max :: CBool -> CBool -> CBool #

min :: CBool -> CBool -> CBool #

Ord CFloat 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CFloat -> CFloat -> Ordering #

(<) :: CFloat -> CFloat -> Bool #

(<=) :: CFloat -> CFloat -> Bool #

(>) :: CFloat -> CFloat -> Bool #

(>=) :: CFloat -> CFloat -> Bool #

max :: CFloat -> CFloat -> CFloat #

min :: CFloat -> CFloat -> CFloat #

Ord CDouble 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CDouble -> CDouble -> Ordering #

(<) :: CDouble -> CDouble -> Bool #

(<=) :: CDouble -> CDouble -> Bool #

(>) :: CDouble -> CDouble -> Bool #

(>=) :: CDouble -> CDouble -> Bool #

max :: CDouble -> CDouble -> CDouble #

min :: CDouble -> CDouble -> CDouble #

Ord CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CPtrdiff -> CPtrdiff -> Ordering #

(<) :: CPtrdiff -> CPtrdiff -> Bool #

(<=) :: CPtrdiff -> CPtrdiff -> Bool #

(>) :: CPtrdiff -> CPtrdiff -> Bool #

(>=) :: CPtrdiff -> CPtrdiff -> Bool #

max :: CPtrdiff -> CPtrdiff -> CPtrdiff #

min :: CPtrdiff -> CPtrdiff -> CPtrdiff #

Ord CSize 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSize -> CSize -> Ordering #

(<) :: CSize -> CSize -> Bool #

(<=) :: CSize -> CSize -> Bool #

(>) :: CSize -> CSize -> Bool #

(>=) :: CSize -> CSize -> Bool #

max :: CSize -> CSize -> CSize #

min :: CSize -> CSize -> CSize #

Ord CWchar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CWchar -> CWchar -> Ordering #

(<) :: CWchar -> CWchar -> Bool #

(<=) :: CWchar -> CWchar -> Bool #

(>) :: CWchar -> CWchar -> Bool #

(>=) :: CWchar -> CWchar -> Bool #

max :: CWchar -> CWchar -> CWchar #

min :: CWchar -> CWchar -> CWchar #

Ord CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSigAtomic -> CSigAtomic -> Ordering #

(<) :: CSigAtomic -> CSigAtomic -> Bool #

(<=) :: CSigAtomic -> CSigAtomic -> Bool #

(>) :: CSigAtomic -> CSigAtomic -> Bool #

(>=) :: CSigAtomic -> CSigAtomic -> Bool #

max :: CSigAtomic -> CSigAtomic -> CSigAtomic #

min :: CSigAtomic -> CSigAtomic -> CSigAtomic #

Ord CClock 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CClock -> CClock -> Ordering #

(<) :: CClock -> CClock -> Bool #

(<=) :: CClock -> CClock -> Bool #

(>) :: CClock -> CClock -> Bool #

(>=) :: CClock -> CClock -> Bool #

max :: CClock -> CClock -> CClock #

min :: CClock -> CClock -> CClock #

Ord CTime 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CTime -> CTime -> Ordering #

(<) :: CTime -> CTime -> Bool #

(<=) :: CTime -> CTime -> Bool #

(>) :: CTime -> CTime -> Bool #

(>=) :: CTime -> CTime -> Bool #

max :: CTime -> CTime -> CTime #

min :: CTime -> CTime -> CTime #

Ord CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUSeconds -> CUSeconds -> Ordering #

(<) :: CUSeconds -> CUSeconds -> Bool #

(<=) :: CUSeconds -> CUSeconds -> Bool #

(>) :: CUSeconds -> CUSeconds -> Bool #

(>=) :: CUSeconds -> CUSeconds -> Bool #

max :: CUSeconds -> CUSeconds -> CUSeconds #

min :: CUSeconds -> CUSeconds -> CUSeconds #

Ord CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSUSeconds -> CSUSeconds -> Ordering #

(<) :: CSUSeconds -> CSUSeconds -> Bool #

(<=) :: CSUSeconds -> CSUSeconds -> Bool #

(>) :: CSUSeconds -> CSUSeconds -> Bool #

(>=) :: CSUSeconds -> CSUSeconds -> Bool #

max :: CSUSeconds -> CSUSeconds -> CSUSeconds #

min :: CSUSeconds -> CSUSeconds -> CSUSeconds #

Ord CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CIntPtr -> CIntPtr -> Ordering #

(<) :: CIntPtr -> CIntPtr -> Bool #

(<=) :: CIntPtr -> CIntPtr -> Bool #

(>) :: CIntPtr -> CIntPtr -> Bool #

(>=) :: CIntPtr -> CIntPtr -> Bool #

max :: CIntPtr -> CIntPtr -> CIntPtr #

min :: CIntPtr -> CIntPtr -> CIntPtr #

Ord CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUIntPtr -> CUIntPtr -> Ordering #

(<) :: CUIntPtr -> CUIntPtr -> Bool #

(<=) :: CUIntPtr -> CUIntPtr -> Bool #

(>) :: CUIntPtr -> CUIntPtr -> Bool #

(>=) :: CUIntPtr -> CUIntPtr -> Bool #

max :: CUIntPtr -> CUIntPtr -> CUIntPtr #

min :: CUIntPtr -> CUIntPtr -> CUIntPtr #

Ord CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CIntMax -> CIntMax -> Ordering #

(<) :: CIntMax -> CIntMax -> Bool #

(<=) :: CIntMax -> CIntMax -> Bool #

(>) :: CIntMax -> CIntMax -> Bool #

(>=) :: CIntMax -> CIntMax -> Bool #

max :: CIntMax -> CIntMax -> CIntMax #

min :: CIntMax -> CIntMax -> CIntMax #

Ord CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUIntMax -> CUIntMax -> Ordering #

(<) :: CUIntMax -> CUIntMax -> Bool #

(<=) :: CUIntMax -> CUIntMax -> Bool #

(>) :: CUIntMax -> CUIntMax -> Bool #

(>=) :: CUIntMax -> CUIntMax -> Bool #

max :: CUIntMax -> CUIntMax -> CUIntMax #

min :: CUIntMax -> CUIntMax -> CUIntMax #

Ord GeneralCategory 
Instance details

Defined in GHC.Unicode

Methods

compare :: GeneralCategory -> GeneralCategory -> Ordering #

(<) :: GeneralCategory -> GeneralCategory -> Bool #

(<=) :: GeneralCategory -> GeneralCategory -> Bool #

(>) :: GeneralCategory -> GeneralCategory -> Bool #

(>=) :: GeneralCategory -> GeneralCategory -> Bool #

max :: GeneralCategory -> GeneralCategory -> GeneralCategory #

min :: GeneralCategory -> GeneralCategory -> GeneralCategory #

Ord UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

compare :: UTF32_Invalid -> UTF32_Invalid -> Ordering #

(<) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(<=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(>) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(>=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

max :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #

min :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #

Ord Encoding 
Instance details

Defined in Basement.String

Methods

compare :: Encoding -> Encoding -> Ordering #

(<) :: Encoding -> Encoding -> Bool #

(<=) :: Encoding -> Encoding -> Bool #

(>) :: Encoding -> Encoding -> Bool #

(>=) :: Encoding -> Encoding -> Bool #

max :: Encoding -> Encoding -> Encoding #

min :: Encoding -> Encoding -> Encoding #

Ord String 
Instance details

Defined in Basement.UTF8.Base

Methods

compare :: String -> String -> Ordering #

(<) :: String -> String -> Bool #

(<=) :: String -> String -> Bool #

(>) :: String -> String -> Bool #

(>=) :: String -> String -> Bool #

max :: String -> String -> String #

min :: String -> String -> String #

Ord FileSize 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: FileSize -> FileSize -> Ordering #

(<) :: FileSize -> FileSize -> Bool #

(<=) :: FileSize -> FileSize -> Bool #

(>) :: FileSize -> FileSize -> Bool #

(>=) :: FileSize -> FileSize -> Bool #

max :: FileSize -> FileSize -> FileSize #

min :: FileSize -> FileSize -> FileSize #

Ord IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

compare :: IntSet -> IntSet -> Ordering #

(<) :: IntSet -> IntSet -> Bool #

(<=) :: IntSet -> IntSet -> Bool #

(>) :: IntSet -> IntSet -> Bool #

(>=) :: IntSet -> IntSet -> Bool #

max :: IntSet -> IntSet -> IntSet #

min :: IntSet -> IntSet -> IntSet #

Ord XdgDirectory 
Instance details

Defined in System.Directory

Methods

compare :: XdgDirectory -> XdgDirectory -> Ordering #

(<) :: XdgDirectory -> XdgDirectory -> Bool #

(<=) :: XdgDirectory -> XdgDirectory -> Bool #

(>) :: XdgDirectory -> XdgDirectory -> Bool #

(>=) :: XdgDirectory -> XdgDirectory -> Bool #

max :: XdgDirectory -> XdgDirectory -> XdgDirectory #

min :: XdgDirectory -> XdgDirectory -> XdgDirectory #

Ord FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: FileType -> FileType -> Ordering #

(<) :: FileType -> FileType -> Bool #

(<=) :: FileType -> FileType -> Bool #

(>) :: FileType -> FileType -> Bool #

(>=) :: FileType -> FileType -> Bool #

max :: FileType -> FileType -> FileType #

min :: FileType -> FileType -> FileType #

Ord Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: Permissions -> Permissions -> Ordering #

(<) :: Permissions -> Permissions -> Bool #

(<=) :: Permissions -> Permissions -> Bool #

(>) :: Permissions -> Permissions -> Bool #

(>=) :: Permissions -> Permissions -> Bool #

max :: Permissions -> Permissions -> Permissions #

min :: Permissions -> Permissions -> Permissions #

Ord TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TyVarBndr -> TyVarBndr -> Ordering #

(<) :: TyVarBndr -> TyVarBndr -> Bool #

(<=) :: TyVarBndr -> TyVarBndr -> Bool #

(>) :: TyVarBndr -> TyVarBndr -> Bool #

(>=) :: TyVarBndr -> TyVarBndr -> Bool #

max :: TyVarBndr -> TyVarBndr -> TyVarBndr #

min :: TyVarBndr -> TyVarBndr -> TyVarBndr #

Ord Name 
Instance details

Defined in Diagrams.Core.Names

Methods

compare :: Name -> Name -> Ordering #

(<) :: Name -> Name -> Bool #

(<=) :: Name -> Name -> Bool #

(>) :: Name -> Name -> Bool #

(>=) :: Name -> Name -> Bool #

max :: Name -> Name -> Name #

min :: Name -> Name -> Name #

Ord Orientation 
Instance details

Defined in Plots.Types

Methods

compare :: Orientation -> Orientation -> Ordering #

(<) :: Orientation -> Orientation -> Bool #

(<=) :: Orientation -> Orientation -> Bool #

(>) :: Orientation -> Orientation -> Bool #

(>=) :: Orientation -> Orientation -> Bool #

max :: Orientation -> Orientation -> Orientation #

min :: Orientation -> Orientation -> Orientation #

Ord Placement 
Instance details

Defined in Plots.Types

Methods

compare :: Placement -> Placement -> Ordering #

(<) :: Placement -> Placement -> Bool #

(<=) :: Placement -> Placement -> Bool #

(>) :: Placement -> Placement -> Bool #

(>=) :: Placement -> Placement -> Bool #

max :: Placement -> Placement -> Placement #

min :: Placement -> Placement -> Placement #

Ord ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

compare :: ByteArray -> ByteArray -> Ordering #

(<) :: ByteArray -> ByteArray -> Bool #

(<=) :: ByteArray -> ByteArray -> Bool #

(>) :: ByteArray -> ByteArray -> Bool #

(>=) :: ByteArray -> ByteArray -> Bool #

max :: ByteArray -> ByteArray -> ByteArray #

min :: ByteArray -> ByteArray -> ByteArray #

Ord Addr 
Instance details

Defined in Data.Primitive.Types

Methods

compare :: Addr -> Addr -> Ordering #

(<) :: Addr -> Addr -> Bool #

(<=) :: Addr -> Addr -> Bool #

(>) :: Addr -> Addr -> Bool #

(>=) :: Addr -> Addr -> Bool #

max :: Addr -> Addr -> Addr #

min :: Addr -> Addr -> Addr #

Ord FilePath 
Instance details

Defined in Filesystem.Path.Internal

Methods

compare :: FilePath -> FilePath -> Ordering #

(<) :: FilePath -> FilePath -> Bool #

(<=) :: FilePath -> FilePath -> Bool #

(>) :: FilePath -> FilePath -> Bool #

(>=) :: FilePath -> FilePath -> Bool #

max :: FilePath -> FilePath -> FilePath #

min :: FilePath -> FilePath -> FilePath #

Ord Root 
Instance details

Defined in Filesystem.Path.Internal

Methods

compare :: Root -> Root -> Ordering #

(<) :: Root -> Root -> Bool #

(<=) :: Root -> Root -> Bool #

(>) :: Root -> Root -> Bool #

(>=) :: Root -> Root -> Bool #

max :: Root -> Root -> Root #

min :: Root -> Root -> Root #

Ord ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: ModName -> ModName -> Ordering #

(<) :: ModName -> ModName -> Bool #

(<=) :: ModName -> ModName -> Bool #

(>) :: ModName -> ModName -> Bool #

(>=) :: ModName -> ModName -> Bool #

max :: ModName -> ModName -> ModName #

min :: ModName -> ModName -> ModName #

Ord PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PkgName -> PkgName -> Ordering #

(<) :: PkgName -> PkgName -> Bool #

(<=) :: PkgName -> PkgName -> Bool #

(>) :: PkgName -> PkgName -> Bool #

(>=) :: PkgName -> PkgName -> Bool #

max :: PkgName -> PkgName -> PkgName #

min :: PkgName -> PkgName -> PkgName #

Ord Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Module -> Module -> Ordering #

(<) :: Module -> Module -> Bool #

(<=) :: Module -> Module -> Bool #

(>) :: Module -> Module -> Bool #

(>=) :: Module -> Module -> Bool #

max :: Module -> Module -> Module #

min :: Module -> Module -> Module #

Ord OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: OccName -> OccName -> Ordering #

(<) :: OccName -> OccName -> Bool #

(<=) :: OccName -> OccName -> Bool #

(>) :: OccName -> OccName -> Bool #

(>=) :: OccName -> OccName -> Bool #

max :: OccName -> OccName -> OccName #

min :: OccName -> OccName -> OccName #

Ord NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameFlavour -> NameFlavour -> Ordering #

(<) :: NameFlavour -> NameFlavour -> Bool #

(<=) :: NameFlavour -> NameFlavour -> Bool #

(>) :: NameFlavour -> NameFlavour -> Bool #

(>=) :: NameFlavour -> NameFlavour -> Bool #

max :: NameFlavour -> NameFlavour -> NameFlavour #

min :: NameFlavour -> NameFlavour -> NameFlavour #

Ord NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameSpace -> NameSpace -> Ordering #

(<) :: NameSpace -> NameSpace -> Bool #

(<=) :: NameSpace -> NameSpace -> Bool #

(>) :: NameSpace -> NameSpace -> Bool #

(>=) :: NameSpace -> NameSpace -> Bool #

max :: NameSpace -> NameSpace -> NameSpace #

min :: NameSpace -> NameSpace -> NameSpace #

Ord Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Loc -> Loc -> Ordering #

(<) :: Loc -> Loc -> Bool #

(<=) :: Loc -> Loc -> Bool #

(>) :: Loc -> Loc -> Bool #

(>=) :: Loc -> Loc -> Bool #

max :: Loc -> Loc -> Loc #

min :: Loc -> Loc -> Loc #

Ord Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Info -> Info -> Ordering #

(<) :: Info -> Info -> Bool #

(<=) :: Info -> Info -> Bool #

(>) :: Info -> Info -> Bool #

(>=) :: Info -> Info -> Bool #

max :: Info -> Info -> Info #

min :: Info -> Info -> Info #

Ord ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: ModuleInfo -> ModuleInfo -> Ordering #

(<) :: ModuleInfo -> ModuleInfo -> Bool #

(<=) :: ModuleInfo -> ModuleInfo -> Bool #

(>) :: ModuleInfo -> ModuleInfo -> Bool #

(>=) :: ModuleInfo -> ModuleInfo -> Bool #

max :: ModuleInfo -> ModuleInfo -> ModuleInfo #

min :: ModuleInfo -> ModuleInfo -> ModuleInfo #

Ord Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Fixity -> Fixity -> Ordering #

(<) :: Fixity -> Fixity -> Bool #

(<=) :: Fixity -> Fixity -> Bool #

(>) :: Fixity -> Fixity -> Bool #

(>=) :: Fixity -> Fixity -> Bool #

max :: Fixity -> Fixity -> Fixity #

min :: Fixity -> Fixity -> Fixity #

Ord FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FixityDirection -> FixityDirection -> Ordering #

(<) :: FixityDirection -> FixityDirection -> Bool #

(<=) :: FixityDirection -> FixityDirection -> Bool #

(>) :: FixityDirection -> FixityDirection -> Bool #

(>=) :: FixityDirection -> FixityDirection -> Bool #

max :: FixityDirection -> FixityDirection -> FixityDirection #

min :: FixityDirection -> FixityDirection -> FixityDirection #

Ord Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Lit -> Lit -> Ordering #

(<) :: Lit -> Lit -> Bool #

(<=) :: Lit -> Lit -> Bool #

(>) :: Lit -> Lit -> Bool #

(>=) :: Lit -> Lit -> Bool #

max :: Lit -> Lit -> Lit #

min :: Lit -> Lit -> Lit #

Ord Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Body -> Body -> Ordering #

(<) :: Body -> Body -> Bool #

(<=) :: Body -> Body -> Bool #

(>) :: Body -> Body -> Bool #

(>=) :: Body -> Body -> Bool #

max :: Body -> Body -> Body #

min :: Body -> Body -> Body #

Ord Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Guard -> Guard -> Ordering #

(<) :: Guard -> Guard -> Bool #

(<=) :: Guard -> Guard -> Bool #

(>) :: Guard -> Guard -> Bool #

(>=) :: Guard -> Guard -> Bool #

max :: Guard -> Guard -> Guard #

min :: Guard -> Guard -> Guard #

Ord Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Stmt -> Stmt -> Ordering #

(<) :: Stmt -> Stmt -> Bool #

(<=) :: Stmt -> Stmt -> Bool #

(>) :: Stmt -> Stmt -> Bool #

(>=) :: Stmt -> Stmt -> Bool #

max :: Stmt -> Stmt -> Stmt #

min :: Stmt -> Stmt -> Stmt #

Ord Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Range -> Range -> Ordering #

(<) :: Range -> Range -> Bool #

(<=) :: Range -> Range -> Bool #

(>) :: Range -> Range -> Bool #

(>=) :: Range -> Range -> Bool #

max :: Range -> Range -> Range #

min :: Range -> Range -> Range #

Ord DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivClause -> DerivClause -> Ordering #

(<) :: DerivClause -> DerivClause -> Bool #

(<=) :: DerivClause -> DerivClause -> Bool #

(>) :: DerivClause -> DerivClause -> Bool #

(>=) :: DerivClause -> DerivClause -> Bool #

max :: DerivClause -> DerivClause -> DerivClause #

min :: DerivClause -> DerivClause -> DerivClause #

Ord TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering #

(<) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(>) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #

min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #

Ord TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TySynEqn -> TySynEqn -> Ordering #

(<) :: TySynEqn -> TySynEqn -> Bool #

(<=) :: TySynEqn -> TySynEqn -> Bool #

(>) :: TySynEqn -> TySynEqn -> Bool #

(>=) :: TySynEqn -> TySynEqn -> Bool #

max :: TySynEqn -> TySynEqn -> TySynEqn #

min :: TySynEqn -> TySynEqn -> TySynEqn #

Ord Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Foreign -> Foreign -> Ordering #

(<) :: Foreign -> Foreign -> Bool #

(<=) :: Foreign -> Foreign -> Bool #

(>) :: Foreign -> Foreign -> Bool #

(>=) :: Foreign -> Foreign -> Bool #

max :: Foreign -> Foreign -> Foreign #

min :: Foreign -> Foreign -> Foreign #

Ord Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Callconv -> Callconv -> Ordering #

(<) :: Callconv -> Callconv -> Bool #

(<=) :: Callconv -> Callconv -> Bool #

(>) :: Callconv -> Callconv -> Bool #

(>=) :: Callconv -> Callconv -> Bool #

max :: Callconv -> Callconv -> Callconv #

min :: Callconv -> Callconv -> Callconv #

Ord Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Safety -> Safety -> Ordering #

(<) :: Safety -> Safety -> Bool #

(<=) :: Safety -> Safety -> Bool #

(>) :: Safety -> Safety -> Bool #

(>=) :: Safety -> Safety -> Bool #

max :: Safety -> Safety -> Safety #

min :: Safety -> Safety -> Safety #

Ord Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Pragma -> Pragma -> Ordering #

(<) :: Pragma -> Pragma -> Bool #

(<=) :: Pragma -> Pragma -> Bool #

(>) :: Pragma -> Pragma -> Bool #

(>=) :: Pragma -> Pragma -> Bool #

max :: Pragma -> Pragma -> Pragma #

min :: Pragma -> Pragma -> Pragma #

Ord Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Inline -> Inline -> Ordering #

(<) :: Inline -> Inline -> Bool #

(<=) :: Inline -> Inline -> Bool #

(>) :: Inline -> Inline -> Bool #

(>=) :: Inline -> Inline -> Bool #

max :: Inline -> Inline -> Inline #

min :: Inline -> Inline -> Inline #

Ord RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: RuleMatch -> RuleMatch -> Ordering #

(<) :: RuleMatch -> RuleMatch -> Bool #

(<=) :: RuleMatch -> RuleMatch -> Bool #

(>) :: RuleMatch -> RuleMatch -> Bool #

(>=) :: RuleMatch -> RuleMatch -> Bool #

max :: RuleMatch -> RuleMatch -> RuleMatch #

min :: RuleMatch -> RuleMatch -> RuleMatch #

Ord Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Phases -> Phases -> Ordering #

(<) :: Phases -> Phases -> Bool #

(<=) :: Phases -> Phases -> Bool #

(>) :: Phases -> Phases -> Bool #

(>=) :: Phases -> Phases -> Bool #

max :: Phases -> Phases -> Phases #

min :: Phases -> Phases -> Phases #

Ord RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: RuleBndr -> RuleBndr -> Ordering #

(<) :: RuleBndr -> RuleBndr -> Bool #

(<=) :: RuleBndr -> RuleBndr -> Bool #

(>) :: RuleBndr -> RuleBndr -> Bool #

(>=) :: RuleBndr -> RuleBndr -> Bool #

max :: RuleBndr -> RuleBndr -> RuleBndr #

min :: RuleBndr -> RuleBndr -> RuleBndr #

Ord AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnTarget -> AnnTarget -> Ordering #

(<) :: AnnTarget -> AnnTarget -> Bool #

(<=) :: AnnTarget -> AnnTarget -> Bool #

(>) :: AnnTarget -> AnnTarget -> Bool #

(>=) :: AnnTarget -> AnnTarget -> Bool #

max :: AnnTarget -> AnnTarget -> AnnTarget #

min :: AnnTarget -> AnnTarget -> AnnTarget #

Ord SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

Ord SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering #

(<) :: SourceStrictness -> SourceStrictness -> Bool #

(<=) :: SourceStrictness -> SourceStrictness -> Bool #

(>) :: SourceStrictness -> SourceStrictness -> Bool #

(>=) :: SourceStrictness -> SourceStrictness -> Bool #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness #

Ord DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

Ord Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Bang -> Bang -> Ordering #

(<) :: Bang -> Bang -> Bool #

(<=) :: Bang -> Bang -> Bool #

(>) :: Bang -> Bang -> Bool #

(>=) :: Bang -> Bang -> Bool #

max :: Bang -> Bang -> Bang #

min :: Bang -> Bang -> Bang #

Ord PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynDir -> PatSynDir -> Ordering #

(<) :: PatSynDir -> PatSynDir -> Bool #

(<=) :: PatSynDir -> PatSynDir -> Bool #

(>) :: PatSynDir -> PatSynDir -> Bool #

(>=) :: PatSynDir -> PatSynDir -> Bool #

max :: PatSynDir -> PatSynDir -> PatSynDir #

min :: PatSynDir -> PatSynDir -> PatSynDir #

Ord PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynArgs -> PatSynArgs -> Ordering #

(<) :: PatSynArgs -> PatSynArgs -> Bool #

(<=) :: PatSynArgs -> PatSynArgs -> Bool #

(>) :: PatSynArgs -> PatSynArgs -> Bool #

(>=) :: PatSynArgs -> PatSynArgs -> Bool #

max :: PatSynArgs -> PatSynArgs -> PatSynArgs #

min :: PatSynArgs -> PatSynArgs -> PatSynArgs #

Ord FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FamilyResultSig -> FamilyResultSig -> Ordering #

(<) :: FamilyResultSig -> FamilyResultSig -> Bool #

(<=) :: FamilyResultSig -> FamilyResultSig -> Bool #

(>) :: FamilyResultSig -> FamilyResultSig -> Bool #

(>=) :: FamilyResultSig -> FamilyResultSig -> Bool #

max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #

min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #

Ord TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TyLit -> TyLit -> Ordering #

(<) :: TyLit -> TyLit -> Bool #

(<=) :: TyLit -> TyLit -> Bool #

(>) :: TyLit -> TyLit -> Bool #

(>=) :: TyLit -> TyLit -> Bool #

max :: TyLit -> TyLit -> TyLit #

min :: TyLit -> TyLit -> TyLit #

Ord Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Role -> Role -> Ordering #

(<) :: Role -> Role -> Bool #

(<=) :: Role -> Role -> Bool #

(>) :: Role -> Role -> Bool #

(>=) :: Role -> Role -> Bool #

max :: Role -> Role -> Role #

min :: Role -> Role -> Role #

Ord AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnLookup -> AnnLookup -> Ordering #

(<) :: AnnLookup -> AnnLookup -> Bool #

(<=) :: AnnLookup -> AnnLookup -> Bool #

(>) :: AnnLookup -> AnnLookup -> Bool #

(>=) :: AnnLookup -> AnnLookup -> Bool #

max :: AnnLookup -> AnnLookup -> AnnLookup #

min :: AnnLookup -> AnnLookup -> AnnLookup #

Ord DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: DatatypeVariant -> DatatypeVariant -> Ordering #

(<) :: DatatypeVariant -> DatatypeVariant -> Bool #

(<=) :: DatatypeVariant -> DatatypeVariant -> Bool #

(>) :: DatatypeVariant -> DatatypeVariant -> Bool #

(>=) :: DatatypeVariant -> DatatypeVariant -> Bool #

max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #

min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #

Ord ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: ConstructorVariant -> ConstructorVariant -> Ordering #

(<) :: ConstructorVariant -> ConstructorVariant -> Bool #

(<=) :: ConstructorVariant -> ConstructorVariant -> Bool #

(>) :: ConstructorVariant -> ConstructorVariant -> Bool #

(>=) :: ConstructorVariant -> ConstructorVariant -> Bool #

max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #

min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #

Ord FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: FieldStrictness -> FieldStrictness -> Ordering #

(<) :: FieldStrictness -> FieldStrictness -> Bool #

(<=) :: FieldStrictness -> FieldStrictness -> Bool #

(>) :: FieldStrictness -> FieldStrictness -> Bool #

(>=) :: FieldStrictness -> FieldStrictness -> Bool #

max :: FieldStrictness -> FieldStrictness -> FieldStrictness #

min :: FieldStrictness -> FieldStrictness -> FieldStrictness #

Ord Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Unpackedness -> Unpackedness -> Ordering #

(<) :: Unpackedness -> Unpackedness -> Bool #

(<=) :: Unpackedness -> Unpackedness -> Bool #

(>) :: Unpackedness -> Unpackedness -> Bool #

(>=) :: Unpackedness -> Unpackedness -> Bool #

max :: Unpackedness -> Unpackedness -> Unpackedness #

min :: Unpackedness -> Unpackedness -> Unpackedness #

Ord Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Strictness -> Strictness -> Ordering #

(<) :: Strictness -> Strictness -> Bool #

(<=) :: Strictness -> Strictness -> Bool #

(>) :: Strictness -> Strictness -> Bool #

(>=) :: Strictness -> Strictness -> Bool #

max :: Strictness -> Strictness -> Strictness #

min :: Strictness -> Strictness -> Strictness #

Ord TimeOfDay 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

compare :: TimeOfDay -> TimeOfDay -> Ordering #

(<) :: TimeOfDay -> TimeOfDay -> Bool #

(<=) :: TimeOfDay -> TimeOfDay -> Bool #

(>) :: TimeOfDay -> TimeOfDay -> Bool #

(>=) :: TimeOfDay -> TimeOfDay -> Bool #

max :: TimeOfDay -> TimeOfDay -> TimeOfDay #

min :: TimeOfDay -> TimeOfDay -> TimeOfDay #

Ord TimeZone 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

compare :: TimeZone -> TimeZone -> Ordering #

(<) :: TimeZone -> TimeZone -> Bool #

(<=) :: TimeZone -> TimeZone -> Bool #

(>) :: TimeZone -> TimeZone -> Bool #

(>=) :: TimeZone -> TimeZone -> Bool #

max :: TimeZone -> TimeZone -> TimeZone #

min :: TimeZone -> TimeZone -> TimeZone #

Ord UniversalTime 
Instance details

Defined in Data.Time.Clock.Internal.UniversalTime

Methods

compare :: UniversalTime -> UniversalTime -> Ordering #

(<) :: UniversalTime -> UniversalTime -> Bool #

(<=) :: UniversalTime -> UniversalTime -> Bool #

(>) :: UniversalTime -> UniversalTime -> Bool #

(>=) :: UniversalTime -> UniversalTime -> Bool #

max :: UniversalTime -> UniversalTime -> UniversalTime #

min :: UniversalTime -> UniversalTime -> UniversalTime #

Ord NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

compare :: NominalDiffTime -> NominalDiffTime -> Ordering #

(<) :: NominalDiffTime -> NominalDiffTime -> Bool #

(<=) :: NominalDiffTime -> NominalDiffTime -> Bool #

(>) :: NominalDiffTime -> NominalDiffTime -> Bool #

(>=) :: NominalDiffTime -> NominalDiffTime -> Bool #

max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

Ord AbsoluteTime 
Instance details

Defined in Data.Time.Clock.Internal.AbsoluteTime

Methods

compare :: AbsoluteTime -> AbsoluteTime -> Ordering #

(<) :: AbsoluteTime -> AbsoluteTime -> Bool #

(<=) :: AbsoluteTime -> AbsoluteTime -> Bool #

(>) :: AbsoluteTime -> AbsoluteTime -> Bool #

(>=) :: AbsoluteTime -> AbsoluteTime -> Bool #

max :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime #

min :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime #

Ord DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

compare :: DiffTime -> DiffTime -> Ordering #

(<) :: DiffTime -> DiffTime -> Bool #

(<=) :: DiffTime -> DiffTime -> Bool #

(>) :: DiffTime -> DiffTime -> Bool #

(>=) :: DiffTime -> DiffTime -> Bool #

max :: DiffTime -> DiffTime -> DiffTime #

min :: DiffTime -> DiffTime -> DiffTime #

Ord Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

compare :: Day -> Day -> Ordering #

(<) :: Day -> Day -> Bool #

(<=) :: Day -> Day -> Bool #

(>) :: Day -> Day -> Bool #

(>=) :: Day -> Day -> Bool #

max :: Day -> Day -> Day #

min :: Day -> Day -> Day #

Ord Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

compare :: Cairo -> Cairo -> Ordering #

(<) :: Cairo -> Cairo -> Bool #

(<=) :: Cairo -> Cairo -> Bool #

(>) :: Cairo -> Cairo -> Bool #

(>=) :: Cairo -> Cairo -> Bool #

max :: Cairo -> Cairo -> Cairo #

min :: Cairo -> Cairo -> Cairo #

Ord OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

compare :: OutputType -> OutputType -> Ordering #

(<) :: OutputType -> OutputType -> Bool #

(<=) :: OutputType -> OutputType -> Bool #

(>) :: OutputType -> OutputType -> Bool #

(>=) :: OutputType -> OutputType -> Bool #

max :: OutputType -> OutputType -> OutputType #

min :: OutputType -> OutputType -> OutputType #

Ord AName 
Instance details

Defined in Diagrams.Core.Names

Methods

compare :: AName -> AName -> Ordering #

(<) :: AName -> AName -> Bool #

(<=) :: AName -> AName -> Bool #

(>) :: AName -> AName -> Bool #

(>=) :: AName -> AName -> Bool #

max :: AName -> AName -> AName #

min :: AName -> AName -> AName #

Ord FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

compare :: FillRule -> FillRule -> Ordering #

(<) :: FillRule -> FillRule -> Bool #

(<=) :: FillRule -> FillRule -> Bool #

(>) :: FillRule -> FillRule -> Bool #

(>=) :: FillRule -> FillRule -> Bool #

max :: FillRule -> FillRule -> FillRule #

min :: FillRule -> FillRule -> FillRule #

Ord JSONPathElement 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: JSONPathElement -> JSONPathElement -> Ordering #

(<) :: JSONPathElement -> JSONPathElement -> Bool #

(<=) :: JSONPathElement -> JSONPathElement -> Bool #

(>) :: JSONPathElement -> JSONPathElement -> Bool #

(>=) :: JSONPathElement -> JSONPathElement -> Bool #

max :: JSONPathElement -> JSONPathElement -> JSONPathElement #

min :: JSONPathElement -> JSONPathElement -> JSONPathElement #

Ord Scientific 
Instance details

Defined in Data.Scientific

Methods

compare :: Scientific -> Scientific -> Ordering #

(<) :: Scientific -> Scientific -> Bool #

(<=) :: Scientific -> Scientific -> Bool #

(>) :: Scientific -> Scientific -> Bool #

(>=) :: Scientific -> Scientific -> Bool #

max :: Scientific -> Scientific -> Scientific #

min :: Scientific -> Scientific -> Scientific #

Ord Font 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: Font -> Font -> Ordering #

(<) :: Font -> Font -> Bool #

(<=) :: Font -> Font -> Bool #

(>) :: Font -> Font -> Bool #

(>=) :: Font -> Font -> Bool #

max :: Font -> Font -> Font #

min :: Font -> Font -> Font #

Ord FontFace 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontFace -> FontFace -> Ordering #

(<) :: FontFace -> FontFace -> Bool #

(<=) :: FontFace -> FontFace -> Bool #

(>) :: FontFace -> FontFace -> Bool #

(>=) :: FontFace -> FontFace -> Bool #

max :: FontFace -> FontFace -> FontFace #

min :: FontFace -> FontFace -> FontFace #

Ord FontFamily 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontFamily -> FontFamily -> Ordering #

(<) :: FontFamily -> FontFamily -> Bool #

(<=) :: FontFamily -> FontFamily -> Bool #

(>) :: FontFamily -> FontFamily -> Bool #

(>=) :: FontFamily -> FontFamily -> Bool #

max :: FontFamily -> FontFamily -> FontFamily #

min :: FontFamily -> FontFamily -> FontFamily #

Ord FontMap 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontMap -> FontMap -> Ordering #

(<) :: FontMap -> FontMap -> Bool #

(<=) :: FontMap -> FontMap -> Bool #

(>) :: FontMap -> FontMap -> Bool #

(>=) :: FontMap -> FontMap -> Bool #

max :: FontMap -> FontMap -> FontMap #

min :: FontMap -> FontMap -> FontMap #

Ord Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

compare :: Crossings -> Crossings -> Ordering #

(<) :: Crossings -> Crossings -> Bool #

(<=) :: Crossings -> Crossings -> Bool #

(>) :: Crossings -> Crossings -> Bool #

(>=) :: Crossings -> Crossings -> Bool #

max :: Crossings -> Crossings -> Crossings #

min :: Crossings -> Crossings -> Crossings #

Ord Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

compare :: Pos -> Pos -> Ordering #

(<) :: Pos -> Pos -> Bool #

(<=) :: Pos -> Pos -> Bool #

(>) :: Pos -> Pos -> Bool #

(>=) :: Pos -> Pos -> Bool #

max :: Pos -> Pos -> Pos #

min :: Pos -> Pos -> Pos #

Ord FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Ord FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Ord PixelRGBA8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBA8 -> PixelRGBA8 -> Ordering #

(<) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(<=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(>) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(>=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

max :: PixelRGBA8 -> PixelRGBA8 -> PixelRGBA8 #

min :: PixelRGBA8 -> PixelRGBA8 -> PixelRGBA8 #

Ord PixelRGB8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGB8 -> PixelRGB8 -> Ordering #

(<) :: PixelRGB8 -> PixelRGB8 -> Bool #

(<=) :: PixelRGB8 -> PixelRGB8 -> Bool #

(>) :: PixelRGB8 -> PixelRGB8 -> Bool #

(>=) :: PixelRGB8 -> PixelRGB8 -> Bool #

max :: PixelRGB8 -> PixelRGB8 -> PixelRGB8 #

min :: PixelRGB8 -> PixelRGB8 -> PixelRGB8 #

Ord PixelCMYK16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelCMYK16 -> PixelCMYK16 -> Ordering #

(<) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(<=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(>) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(>=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

max :: PixelCMYK16 -> PixelCMYK16 -> PixelCMYK16 #

min :: PixelCMYK16 -> PixelCMYK16 -> PixelCMYK16 #

Ord PixelCMYK8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelCMYK8 -> PixelCMYK8 -> Ordering #

(<) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(<=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(>) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(>=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

max :: PixelCMYK8 -> PixelCMYK8 -> PixelCMYK8 #

min :: PixelCMYK8 -> PixelCMYK8 -> PixelCMYK8 #

Ord PixelRGB16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGB16 -> PixelRGB16 -> Ordering #

(<) :: PixelRGB16 -> PixelRGB16 -> Bool #

(<=) :: PixelRGB16 -> PixelRGB16 -> Bool #

(>) :: PixelRGB16 -> PixelRGB16 -> Bool #

(>=) :: PixelRGB16 -> PixelRGB16 -> Bool #

max :: PixelRGB16 -> PixelRGB16 -> PixelRGB16 #

min :: PixelRGB16 -> PixelRGB16 -> PixelRGB16 #

Ord PixelRGBA16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBA16 -> PixelRGBA16 -> Ordering #

(<) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(<=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(>) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(>=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

max :: PixelRGBA16 -> PixelRGBA16 -> PixelRGBA16 #

min :: PixelRGBA16 -> PixelRGBA16 -> PixelRGBA16 #

Ord PixelYA16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYA16 -> PixelYA16 -> Ordering #

(<) :: PixelYA16 -> PixelYA16 -> Bool #

(<=) :: PixelYA16 -> PixelYA16 -> Bool #

(>) :: PixelYA16 -> PixelYA16 -> Bool #

(>=) :: PixelYA16 -> PixelYA16 -> Bool #

max :: PixelYA16 -> PixelYA16 -> PixelYA16 #

min :: PixelYA16 -> PixelYA16 -> PixelYA16 #

Ord PixelYA8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYA8 -> PixelYA8 -> Ordering #

(<) :: PixelYA8 -> PixelYA8 -> Bool #

(<=) :: PixelYA8 -> PixelYA8 -> Bool #

(>) :: PixelYA8 -> PixelYA8 -> Bool #

(>=) :: PixelYA8 -> PixelYA8 -> Bool #

max :: PixelYA8 -> PixelYA8 -> PixelYA8 #

min :: PixelYA8 -> PixelYA8 -> PixelYA8 #

Ord PixelYCbCr8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYCbCr8 -> PixelYCbCr8 -> Ordering #

(<) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(<=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(>) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(>=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

max :: PixelYCbCr8 -> PixelYCbCr8 -> PixelYCbCr8 #

min :: PixelYCbCr8 -> PixelYCbCr8 -> PixelYCbCr8 #

Ord PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBF -> PixelRGBF -> Ordering #

(<) :: PixelRGBF -> PixelRGBF -> Bool #

(<=) :: PixelRGBF -> PixelRGBF -> Bool #

(>) :: PixelRGBF -> PixelRGBF -> Bool #

(>=) :: PixelRGBF -> PixelRGBF -> Bool #

max :: PixelRGBF -> PixelRGBF -> PixelRGBF #

min :: PixelRGBF -> PixelRGBF -> PixelRGBF #

Ord PixelYCbCrK8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYCbCrK8 -> PixelYCbCrK8 -> Ordering #

(<) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(<=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(>) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(>=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

max :: PixelYCbCrK8 -> PixelYCbCrK8 -> PixelYCbCrK8 #

min :: PixelYCbCrK8 -> PixelYCbCrK8 -> PixelYCbCrK8 #

Ord CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: CompressionStrategy -> CompressionStrategy -> Ordering #

(<) :: CompressionStrategy -> CompressionStrategy -> Bool #

(<=) :: CompressionStrategy -> CompressionStrategy -> Bool #

(>) :: CompressionStrategy -> CompressionStrategy -> Bool #

(>=) :: CompressionStrategy -> CompressionStrategy -> Bool #

max :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy #

min :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy #

Ord DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: DictionaryHash -> DictionaryHash -> Ordering #

(<) :: DictionaryHash -> DictionaryHash -> Bool #

(<=) :: DictionaryHash -> DictionaryHash -> Bool #

(>) :: DictionaryHash -> DictionaryHash -> Bool #

(>=) :: DictionaryHash -> DictionaryHash -> Bool #

max :: DictionaryHash -> DictionaryHash -> DictionaryHash #

min :: DictionaryHash -> DictionaryHash -> DictionaryHash #

Ord Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: Format -> Format -> Ordering #

(<) :: Format -> Format -> Bool #

(<=) :: Format -> Format -> Bool #

(>) :: Format -> Format -> Bool #

(>=) :: Format -> Format -> Bool #

max :: Format -> Format -> Format #

min :: Format -> Format -> Format #

Ord Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: Method -> Method -> Ordering #

(<) :: Method -> Method -> Bool #

(<=) :: Method -> Method -> Bool #

(>) :: Method -> Method -> Bool #

(>=) :: Method -> Method -> Bool #

max :: Method -> Method -> Method #

min :: Method -> Method -> Method #

Ord WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: WindowBits -> WindowBits -> Ordering #

(<) :: WindowBits -> WindowBits -> Bool #

(<=) :: WindowBits -> WindowBits -> Bool #

(>) :: WindowBits -> WindowBits -> Bool #

(>=) :: WindowBits -> WindowBits -> Bool #

max :: WindowBits -> WindowBits -> WindowBits #

min :: WindowBits -> WindowBits -> WindowBits #

Ord DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: DotNetTime -> DotNetTime -> Ordering #

(<) :: DotNetTime -> DotNetTime -> Bool #

(<=) :: DotNetTime -> DotNetTime -> Bool #

(>) :: DotNetTime -> DotNetTime -> Bool #

(>=) :: DotNetTime -> DotNetTime -> Bool #

max :: DotNetTime -> DotNetTime -> DotNetTime #

min :: DotNetTime -> DotNetTime -> DotNetTime #

Ord UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

compare :: UUID -> UUID -> Ordering #

(<) :: UUID -> UUID -> Bool #

(<=) :: UUID -> UUID -> Bool #

(>) :: UUID -> UUID -> Bool #

(>=) :: UUID -> UUID -> Bool #

max :: UUID -> UUID -> UUID #

min :: UUID -> UUID -> UUID #

Ord UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

compare :: UnpackedUUID -> UnpackedUUID -> Ordering #

(<) :: UnpackedUUID -> UnpackedUUID -> Bool #

(<=) :: UnpackedUUID -> UnpackedUUID -> Bool #

(>) :: UnpackedUUID -> UnpackedUUID -> Bool #

(>=) :: UnpackedUUID -> UnpackedUUID -> Bool #

max :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #

min :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #

Ord FontSet 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontSet -> FontSet -> Ordering #

(<) :: FontSet -> FontSet -> Bool #

(<=) :: FontSet -> FontSet -> Bool #

(>) :: FontSet -> FontSet -> Bool #

(>=) :: FontSet -> FontSet -> Bool #

max :: FontSet -> FontSet -> FontSet #

min :: FontSet -> FontSet -> FontSet #

Ord PangoContext 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: PangoContext -> PangoContext -> Ordering #

(<) :: PangoContext -> PangoContext -> Bool #

(<=) :: PangoContext -> PangoContext -> Bool #

(>) :: PangoContext -> PangoContext -> Bool #

(>=) :: PangoContext -> PangoContext -> Bool #

max :: PangoContext -> PangoContext -> PangoContext #

min :: PangoContext -> PangoContext -> PangoContext #

Ord PangoLayoutRaw 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: PangoLayoutRaw -> PangoLayoutRaw -> Ordering #

(<) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(<=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(>) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(>=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

max :: PangoLayoutRaw -> PangoLayoutRaw -> PangoLayoutRaw #

min :: PangoLayoutRaw -> PangoLayoutRaw -> PangoLayoutRaw #

Ord LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

compare :: LogFloat -> LogFloat -> Ordering #

(<) :: LogFloat -> LogFloat -> Bool #

(<=) :: LogFloat -> LogFloat -> Bool #

(>) :: LogFloat -> LogFloat -> Bool #

(>=) :: LogFloat -> LogFloat -> Bool #

max :: LogFloat -> LogFloat -> LogFloat #

min :: LogFloat -> LogFloat -> LogFloat #

Ord ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

compare :: ConstVal -> ConstVal -> Ordering #

(<) :: ConstVal -> ConstVal -> Bool #

(<=) :: ConstVal -> ConstVal -> Bool #

(>) :: ConstVal -> ConstVal -> Bool #

(>=) :: ConstVal -> ConstVal -> Bool #

max :: ConstVal -> ConstVal -> ConstVal #

min :: ConstVal -> ConstVal -> ConstVal #

Ord Type # 
Instance details

Defined in Data.Expression

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Ord LVal # 
Instance details

Defined in Data.Expression

Methods

compare :: LVal -> LVal -> Ordering #

(<) :: LVal -> LVal -> Bool #

(<=) :: LVal -> LVal -> Bool #

(>) :: LVal -> LVal -> Bool #

(>=) :: LVal -> LVal -> Bool #

max :: LVal -> LVal -> LVal #

min :: LVal -> LVal -> LVal #

Ord DExpr # 
Instance details

Defined in Data.Expression

Methods

compare :: DExpr -> DExpr -> Ordering #

(<) :: DExpr -> DExpr -> Bool #

(<=) :: DExpr -> DExpr -> Bool #

(>) :: DExpr -> DExpr -> Bool #

(>=) :: DExpr -> DExpr -> Bool #

max :: DExpr -> DExpr -> DExpr #

min :: DExpr -> DExpr -> DExpr #

Ord NodeRef # 
Instance details

Defined in Data.Expression

Methods

compare :: NodeRef -> NodeRef -> Ordering #

(<) :: NodeRef -> NodeRef -> Bool #

(<=) :: NodeRef -> NodeRef -> Bool #

(>) :: NodeRef -> NodeRef -> Bool #

(>=) :: NodeRef -> NodeRef -> Bool #

max :: NodeRef -> NodeRef -> NodeRef #

min :: NodeRef -> NodeRef -> NodeRef #

Ord Id # 
Instance details

Defined in Data.Expression

Methods

compare :: Id -> Id -> Ordering #

(<) :: Id -> Id -> Bool #

(<=) :: Id -> Id -> Bool #

(>) :: Id -> Id -> Bool #

(>=) :: Id -> Id -> Bool #

max :: Id -> Id -> Id #

min :: Id -> Id -> Id #

Ord a => Ord [a] 
Instance details

Defined in GHC.Classes

Methods

compare :: [a] -> [a] -> Ordering #

(<) :: [a] -> [a] -> Bool #

(<=) :: [a] -> [a] -> Bool #

(>) :: [a] -> [a] -> Bool #

(>=) :: [a] -> [a] -> Bool #

max :: [a] -> [a] -> [a] #

min :: [a] -> [a] -> [a] #

Ord a => Ord (Maybe a) 
Instance details

Defined in GHC.Base

Methods

compare :: Maybe a -> Maybe a -> Ordering #

(<) :: Maybe a -> Maybe a -> Bool #

(<=) :: Maybe a -> Maybe a -> Bool #

(>) :: Maybe a -> Maybe a -> Bool #

(>=) :: Maybe a -> Maybe a -> Bool #

max :: Maybe a -> Maybe a -> Maybe a #

min :: Maybe a -> Maybe a -> Maybe a #

Integral a => Ord (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

compare :: Ratio a -> Ratio a -> Ordering #

(<) :: Ratio a -> Ratio a -> Bool #

(<=) :: Ratio a -> Ratio a -> Bool #

(>) :: Ratio a -> Ratio a -> Bool #

(>=) :: Ratio a -> Ratio a -> Bool #

max :: Ratio a -> Ratio a -> Ratio a #

min :: Ratio a -> Ratio a -> Ratio a #

Ord (Ptr a) 
Instance details

Defined in GHC.Ptr

Methods

compare :: Ptr a -> Ptr a -> Ordering #

(<) :: Ptr a -> Ptr a -> Bool #

(<=) :: Ptr a -> Ptr a -> Bool #

(>) :: Ptr a -> Ptr a -> Bool #

(>=) :: Ptr a -> Ptr a -> Bool #

max :: Ptr a -> Ptr a -> Ptr a #

min :: Ptr a -> Ptr a -> Ptr a #

Ord (FunPtr a) 
Instance details

Defined in GHC.Ptr

Methods

compare :: FunPtr a -> FunPtr a -> Ordering #

(<) :: FunPtr a -> FunPtr a -> Bool #

(<=) :: FunPtr a -> FunPtr a -> Bool #

(>) :: FunPtr a -> FunPtr a -> Bool #

(>=) :: FunPtr a -> FunPtr a -> Bool #

max :: FunPtr a -> FunPtr a -> FunPtr a #

min :: FunPtr a -> FunPtr a -> FunPtr a #

Ord p => Ord (Par1 p) 
Instance details

Defined in GHC.Generics

Methods

compare :: Par1 p -> Par1 p -> Ordering #

(<) :: Par1 p -> Par1 p -> Bool #

(<=) :: Par1 p -> Par1 p -> Bool #

(>) :: Par1 p -> Par1 p -> Bool #

(>=) :: Par1 p -> Par1 p -> Bool #

max :: Par1 p -> Par1 p -> Par1 p #

min :: Par1 p -> Par1 p -> Par1 p #

Ord a => Ord (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering #

(<) :: Identity a -> Identity a -> Bool #

(<=) :: Identity a -> Identity a -> Bool #

(>) :: Identity a -> Identity a -> Bool #

(>=) :: Identity a -> Identity a -> Bool #

max :: Identity a -> Identity a -> Identity a #

min :: Identity a -> Identity a -> Identity a #

Ord a => Ord (Min a) 
Instance details

Defined in Data.Semigroup

Methods

compare :: Min a -> Min a -> Ordering #

(<) :: Min a -> Min a -> Bool #

(<=) :: Min a -> Min a -> Bool #

(>) :: Min a -> Min a -> Bool #

(>=) :: Min a -> Min a -> Bool #

max :: Min a -> Min a -> Min a #

min :: Min a -> Min a -> Min a #

Ord a => Ord (Max a) 
Instance details

Defined in Data.Semigroup

Methods

compare :: Max a -> Max a -> Ordering #

(<) :: Max a -> Max a -> Bool #

(<=) :: Max a -> Max a -> Bool #

(>) :: Max a -> Max a -> Bool #

(>=) :: Max a -> Max a -> Bool #

max :: Max a -> Max a -> Max a #

min :: Max a -> Max a -> Max a #

Ord a => Ord (First a) 
Instance details

Defined in Data.Semigroup

Methods

compare :: First a -> First a -> Ordering #

(<) :: First a -> First a -> Bool #

(<=) :: First a -> First a -> Bool #

(>) :: First a -> First a -> Bool #

(>=) :: First a -> First a -> Bool #

max :: First a -> First a -> First a #

min :: First a -> First a -> First a #

Ord a => Ord (Last a) 
Instance details

Defined in Data.Semigroup

Methods

compare :: Last a -> Last a -> Ordering #

(<) :: Last a -> Last a -> Bool #

(<=) :: Last a -> Last a -> Bool #

(>) :: Last a -> Last a -> Bool #

(>=) :: Last a -> Last a -> Bool #

max :: Last a -> Last a -> Last a #

min :: Last a -> Last a -> Last a #

Ord m => Ord (WrappedMonoid m) 
Instance details

Defined in Data.Semigroup

Methods

compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering #

(<) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(>) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

Ord a => Ord (Option a) 
Instance details

Defined in Data.Semigroup

Methods

compare :: Option a -> Option a -> Ordering #

(<) :: Option a -> Option a -> Bool #

(<=) :: Option a -> Option a -> Bool #

(>) :: Option a -> Option a -> Bool #

(>=) :: Option a -> Option a -> Bool #

max :: Option a -> Option a -> Option a #

min :: Option a -> Option a -> Option a #

Ord a => Ord (ZipList a) 
Instance details

Defined in Control.Applicative

Methods

compare :: ZipList a -> ZipList a -> Ordering #

(<) :: ZipList a -> ZipList a -> Bool #

(<=) :: ZipList a -> ZipList a -> Bool #

(>) :: ZipList a -> ZipList a -> Bool #

(>=) :: ZipList a -> ZipList a -> Bool #

max :: ZipList a -> ZipList a -> ZipList a #

min :: ZipList a -> ZipList a -> ZipList a #

Ord a => Ord (First a) 
Instance details

Defined in Data.Monoid

Methods

compare :: First a -> First a -> Ordering #

(<) :: First a -> First a -> Bool #

(<=) :: First a -> First a -> Bool #

(>) :: First a -> First a -> Bool #

(>=) :: First a -> First a -> Bool #

max :: First a -> First a -> First a #

min :: First a -> First a -> First a #

Ord a => Ord (Last a) 
Instance details

Defined in Data.Monoid

Methods

compare :: Last a -> Last a -> Ordering #

(<) :: Last a -> Last a -> Bool #

(<=) :: Last a -> Last a -> Bool #

(>) :: Last a -> Last a -> Bool #

(>=) :: Last a -> Last a -> Bool #

max :: Last a -> Last a -> Last a #

min :: Last a -> Last a -> Last a #

Ord a => Ord (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Dual a -> Dual a -> Ordering #

(<) :: Dual a -> Dual a -> Bool #

(<=) :: Dual a -> Dual a -> Bool #

(>) :: Dual a -> Dual a -> Bool #

(>=) :: Dual a -> Dual a -> Bool #

max :: Dual a -> Dual a -> Dual a #

min :: Dual a -> Dual a -> Dual a #

Ord a => Ord (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Sum a -> Sum a -> Ordering #

(<) :: Sum a -> Sum a -> Bool #

(<=) :: Sum a -> Sum a -> Bool #

(>) :: Sum a -> Sum a -> Bool #

(>=) :: Sum a -> Sum a -> Bool #

max :: Sum a -> Sum a -> Sum a #

min :: Sum a -> Sum a -> Sum a #

Ord a => Ord (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Product a -> Product a -> Ordering #

(<) :: Product a -> Product a -> Bool #

(<=) :: Product a -> Product a -> Bool #

(>) :: Product a -> Product a -> Bool #

(>=) :: Product a -> Product a -> Bool #

max :: Product a -> Product a -> Product a #

min :: Product a -> Product a -> Product a #

Ord a => Ord (Down a)

Since: base-4.6.0.0

Instance details

Defined in Data.Ord

Methods

compare :: Down a -> Down a -> Ordering #

(<) :: Down a -> Down a -> Bool #

(<=) :: Down a -> Down a -> Bool #

(>) :: Down a -> Down a -> Bool #

(>=) :: Down a -> Down a -> Bool #

max :: Down a -> Down a -> Down a #

min :: Down a -> Down a -> Down a #

Ord a => Ord (NonEmpty a) 
Instance details

Defined in GHC.Base

Methods

compare :: NonEmpty a -> NonEmpty a -> Ordering #

(<) :: NonEmpty a -> NonEmpty a -> Bool #

(<=) :: NonEmpty a -> NonEmpty a -> Bool #

(>) :: NonEmpty a -> NonEmpty a -> Bool #

(>=) :: NonEmpty a -> NonEmpty a -> Bool #

max :: NonEmpty a -> NonEmpty a -> NonEmpty a #

min :: NonEmpty a -> NonEmpty a -> NonEmpty a #

(PrimType ty, Ord ty) => Ord (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

compare :: UArray ty -> UArray ty -> Ordering #

(<) :: UArray ty -> UArray ty -> Bool #

(<=) :: UArray ty -> UArray ty -> Bool #

(>) :: UArray ty -> UArray ty -> Bool #

(>=) :: UArray ty -> UArray ty -> Bool #

max :: UArray ty -> UArray ty -> UArray ty #

min :: UArray ty -> UArray ty -> UArray ty #

(PrimType ty, Ord ty) => Ord (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

compare :: Block ty -> Block ty -> Ordering #

(<) :: Block ty -> Block ty -> Bool #

(<=) :: Block ty -> Block ty -> Bool #

(>) :: Block ty -> Block ty -> Bool #

(>=) :: Block ty -> Block ty -> Bool #

max :: Block ty -> Block ty -> Block ty #

min :: Block ty -> Block ty -> Block ty #

Ord (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: Offset ty -> Offset ty -> Ordering #

(<) :: Offset ty -> Offset ty -> Bool #

(<=) :: Offset ty -> Offset ty -> Bool #

(>) :: Offset ty -> Offset ty -> Bool #

(>=) :: Offset ty -> Offset ty -> Bool #

max :: Offset ty -> Offset ty -> Offset ty #

min :: Offset ty -> Offset ty -> Offset ty #

Ord (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: CountOf ty -> CountOf ty -> Ordering #

(<) :: CountOf ty -> CountOf ty -> Bool #

(<=) :: CountOf ty -> CountOf ty -> Bool #

(>) :: CountOf ty -> CountOf ty -> Bool #

(>=) :: CountOf ty -> CountOf ty -> Bool #

max :: CountOf ty -> CountOf ty -> CountOf ty #

min :: CountOf ty -> CountOf ty -> CountOf ty #

Ord a => Ord (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

compare :: IntMap a -> IntMap a -> Ordering #

(<) :: IntMap a -> IntMap a -> Bool #

(<=) :: IntMap a -> IntMap a -> Bool #

(>) :: IntMap a -> IntMap a -> Bool #

(>=) :: IntMap a -> IntMap a -> Bool #

max :: IntMap a -> IntMap a -> IntMap a #

min :: IntMap a -> IntMap a -> IntMap a #

Ord a => Ord (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: Seq a -> Seq a -> Ordering #

(<) :: Seq a -> Seq a -> Bool #

(<=) :: Seq a -> Seq a -> Bool #

(>) :: Seq a -> Seq a -> Bool #

(>=) :: Seq a -> Seq a -> Bool #

max :: Seq a -> Seq a -> Seq a #

min :: Seq a -> Seq a -> Seq a #

Ord a => Ord (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: ViewL a -> ViewL a -> Ordering #

(<) :: ViewL a -> ViewL a -> Bool #

(<=) :: ViewL a -> ViewL a -> Bool #

(>) :: ViewL a -> ViewL a -> Bool #

(>=) :: ViewL a -> ViewL a -> Bool #

max :: ViewL a -> ViewL a -> ViewL a #

min :: ViewL a -> ViewL a -> ViewL a #

Ord a => Ord (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: ViewR a -> ViewR a -> Ordering #

(<) :: ViewR a -> ViewR a -> Bool #

(<=) :: ViewR a -> ViewR a -> Bool #

(>) :: ViewR a -> ViewR a -> Bool #

(>=) :: ViewR a -> ViewR a -> Bool #

max :: ViewR a -> ViewR a -> ViewR a #

min :: ViewR a -> ViewR a -> ViewR a #

Ord a => Ord (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

compare :: Set a -> Set a -> Ordering #

(<) :: Set a -> Set a -> Bool #

(<=) :: Set a -> Set a -> Bool #

(>) :: Set a -> Set a -> Bool #

(>=) :: Set a -> Set a -> Bool #

max :: Set a -> Set a -> Set a #

min :: Set a -> Set a -> Set a #

Ord a => Ord (DList a) 
Instance details

Defined in Data.DList

Methods

compare :: DList a -> DList a -> Ordering #

(<) :: DList a -> DList a -> Bool #

(<=) :: DList a -> DList a -> Bool #

(>) :: DList a -> DList a -> Bool #

(>=) :: DList a -> DList a -> Bool #

max :: DList a -> DList a -> DList a #

min :: DList a -> DList a -> DList a #

Ord n => Ord (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

compare :: Angle n -> Angle n -> Ordering #

(<) :: Angle n -> Angle n -> Bool #

(<=) :: Angle n -> Angle n -> Bool #

(>) :: Angle n -> Angle n -> Bool #

(>=) :: Angle n -> Angle n -> Bool #

max :: Angle n -> Angle n -> Angle n #

min :: Angle n -> Angle n -> Angle n #

Ord a => Ord (V3 a) 
Instance details

Defined in Linear.V3

Methods

compare :: V3 a -> V3 a -> Ordering #

(<) :: V3 a -> V3 a -> Bool #

(<=) :: V3 a -> V3 a -> Bool #

(>) :: V3 a -> V3 a -> Bool #

(>=) :: V3 a -> V3 a -> Bool #

max :: V3 a -> V3 a -> V3 a #

min :: V3 a -> V3 a -> V3 a #

Ord a => Ord (V2 a) 
Instance details

Defined in Linear.V2

Methods

compare :: V2 a -> V2 a -> Ordering #

(<) :: V2 a -> V2 a -> Bool #

(<=) :: V2 a -> V2 a -> Bool #

(>) :: V2 a -> V2 a -> Bool #

(>=) :: V2 a -> V2 a -> Bool #

max :: V2 a -> V2 a -> V2 a #

min :: V2 a -> V2 a -> V2 a #

Ord n => Ord (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

compare :: Extending n -> Extending n -> Ordering #

(<) :: Extending n -> Extending n -> Bool #

(<=) :: Extending n -> Extending n -> Bool #

(>) :: Extending n -> Extending n -> Bool #

(>=) :: Extending n -> Extending n -> Bool #

max :: Extending n -> Extending n -> Extending n #

min :: Extending n -> Extending n -> Extending n #

Ord a => Ord (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

compare :: Array a -> Array a -> Ordering #

(<) :: Array a -> Array a -> Bool #

(<=) :: Array a -> Array a -> Bool #

(>) :: Array a -> Array a -> Bool #

(>=) :: Array a -> Array a -> Bool #

max :: Array a -> Array a -> Array a #

min :: Array a -> Array a -> Array a #

(Storable a, Ord a) => Ord (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

Ord a => Ord (Vector a) 
Instance details

Defined in Data.Vector

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

(Prim a, Ord a) => Ord (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

Ord n => Ord (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

compare :: VarInt n -> VarInt n -> Ordering #

(<) :: VarInt n -> VarInt n -> Bool #

(<=) :: VarInt n -> VarInt n -> Bool #

(>) :: VarInt n -> VarInt n -> Bool #

(>=) :: VarInt n -> VarInt n -> Bool #

max :: VarInt n -> VarInt n -> VarInt n #

min :: VarInt n -> VarInt n -> VarInt n #

Ord a => Ord (Log a) 
Instance details

Defined in Numeric.Log

Methods

compare :: Log a -> Log a -> Ordering #

(<) :: Log a -> Log a -> Bool #

(<=) :: Log a -> Log a -> Bool #

(>) :: Log a -> Log a -> Bool #

(>=) :: Log a -> Log a -> Bool #

max :: Log a -> Log a -> Log a #

min :: Log a -> Log a -> Log a #

Ord a => Ord (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

compare :: HashSet a -> HashSet a -> Ordering #

(<) :: HashSet a -> HashSet a -> Bool #

(<=) :: HashSet a -> HashSet a -> Bool #

(>) :: HashSet a -> HashSet a -> Bool #

(>=) :: HashSet a -> HashSet a -> Bool #

max :: HashSet a -> HashSet a -> HashSet a #

min :: HashSet a -> HashSet a -> HashSet a #

Ord t => Ord (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

compare :: TransInv t -> TransInv t -> Ordering #

(<) :: TransInv t -> TransInv t -> Bool #

(<=) :: TransInv t -> TransInv t -> Bool #

(>) :: TransInv t -> TransInv t -> Bool #

(>=) :: TransInv t -> TransInv t -> Bool #

max :: TransInv t -> TransInv t -> TransInv t #

min :: TransInv t -> TransInv t -> TransInv t #

(Ord (V a (N a)), Ord a) => Ord (Located a) 
Instance details

Defined in Diagrams.Located

Methods

compare :: Located a -> Located a -> Ordering #

(<) :: Located a -> Located a -> Bool #

(<=) :: Located a -> Located a -> Bool #

(>) :: Located a -> Located a -> Bool #

(>=) :: Located a -> Located a -> Bool #

max :: Located a -> Located a -> Located a #

min :: Located a -> Located a -> Located a #

Ord n => Ord (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

compare :: PolyOrientation n -> PolyOrientation n -> Ordering #

(<) :: PolyOrientation n -> PolyOrientation n -> Bool #

(<=) :: PolyOrientation n -> PolyOrientation n -> Bool #

(>) :: PolyOrientation n -> PolyOrientation n -> Bool #

(>=) :: PolyOrientation n -> PolyOrientation n -> Bool #

max :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n #

min :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n #

Ord n => Ord (Time n) 
Instance details

Defined in Data.Active

Methods

compare :: Time n -> Time n -> Ordering #

(<) :: Time n -> Time n -> Bool #

(<=) :: Time n -> Time n -> Bool #

(>) :: Time n -> Time n -> Bool #

(>=) :: Time n -> Time n -> Bool #

max :: Time n -> Time n -> Time n #

min :: Time n -> Time n -> Time n #

Ord a => Ord (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

compare :: Interval a -> Interval a -> Ordering #

(<) :: Interval a -> Interval a -> Bool #

(<=) :: Interval a -> Interval a -> Bool #

(>) :: Interval a -> Interval a -> Bool #

(>=) :: Interval a -> Interval a -> Bool #

max :: Interval a -> Interval a -> Interval a #

min :: Interval a -> Interval a -> Interval a #

Ord a => Ord (V1 a) 
Instance details

Defined in Linear.V1

Methods

compare :: V1 a -> V1 a -> Ordering #

(<) :: V1 a -> V1 a -> Bool #

(<=) :: V1 a -> V1 a -> Bool #

(>) :: V1 a -> V1 a -> Bool #

(>=) :: V1 a -> V1 a -> Bool #

max :: V1 a -> V1 a -> V1 a #

min :: V1 a -> V1 a -> V1 a #

Ord n => Ord (Duration n) 
Instance details

Defined in Data.Active

Methods

compare :: Duration n -> Duration n -> Ordering #

(<) :: Duration n -> Duration n -> Bool #

(<=) :: Duration n -> Duration n -> Bool #

(>) :: Duration n -> Duration n -> Bool #

(>=) :: Duration n -> Duration n -> Bool #

max :: Duration n -> Duration n -> Duration n #

min :: Duration n -> Duration n -> Duration n #

Ord a => Ord (V4 a) 
Instance details

Defined in Linear.V4

Methods

compare :: V4 a -> V4 a -> Ordering #

(<) :: V4 a -> V4 a -> Bool #

(<=) :: V4 a -> V4 a -> Bool #

(>) :: V4 a -> V4 a -> Bool #

(>=) :: V4 a -> V4 a -> Bool #

max :: V4 a -> V4 a -> V4 a #

min :: V4 a -> V4 a -> V4 a #

Ord a => Ord (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

compare :: Plucker a -> Plucker a -> Ordering #

(<) :: Plucker a -> Plucker a -> Bool #

(<=) :: Plucker a -> Plucker a -> Bool #

(>) :: Plucker a -> Plucker a -> Bool #

(>=) :: Plucker a -> Plucker a -> Bool #

max :: Plucker a -> Plucker a -> Plucker a #

min :: Plucker a -> Plucker a -> Plucker a #

Ord a => Ord (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

compare :: Quaternion a -> Quaternion a -> Ordering #

(<) :: Quaternion a -> Quaternion a -> Bool #

(<=) :: Quaternion a -> Quaternion a -> Bool #

(>) :: Quaternion a -> Quaternion a -> Bool #

(>=) :: Quaternion a -> Quaternion a -> Bool #

max :: Quaternion a -> Quaternion a -> Quaternion a #

min :: Quaternion a -> Quaternion a -> Quaternion a #

Ord (V0 a) 
Instance details

Defined in Linear.V0

Methods

compare :: V0 a -> V0 a -> Ordering #

(<) :: V0 a -> V0 a -> Bool #

(<=) :: V0 a -> V0 a -> Bool #

(>) :: V0 a -> V0 a -> Bool #

(>=) :: V0 a -> V0 a -> Bool #

max :: V0 a -> V0 a -> V0 a #

min :: V0 a -> V0 a -> V0 a #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

Ord (Digest a) 
Instance details

Defined in Crypto.Hash.Types

Methods

compare :: Digest a -> Digest a -> Ordering #

(<) :: Digest a -> Digest a -> Bool #

(<=) :: Digest a -> Digest a -> Bool #

(>) :: Digest a -> Digest a -> Bool #

(>=) :: Digest a -> Digest a -> Bool #

max :: Digest a -> Digest a -> Digest a #

min :: Digest a -> Digest a -> Digest a #

Ord a => Ord (Hashed a) 
Instance details

Defined in Data.Hashable.Class

Methods

compare :: Hashed a -> Hashed a -> Ordering #

(<) :: Hashed a -> Hashed a -> Bool #

(<=) :: Hashed a -> Hashed a -> Bool #

(>) :: Hashed a -> Hashed a -> Bool #

(>=) :: Hashed a -> Hashed a -> Bool #

max :: Hashed a -> Hashed a -> Hashed a #

min :: Hashed a -> Hashed a -> Hashed a #

(Ord a, Ord b) => Ord (Either a b) 
Instance details

Defined in Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering #

(<) :: Either a b -> Either a b -> Bool #

(<=) :: Either a b -> Either a b -> Bool #

(>) :: Either a b -> Either a b -> Bool #

(>=) :: Either a b -> Either a b -> Bool #

max :: Either a b -> Either a b -> Either a b #

min :: Either a b -> Either a b -> Either a b #

Ord (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: V1 p -> V1 p -> Ordering #

(<) :: V1 p -> V1 p -> Bool #

(<=) :: V1 p -> V1 p -> Bool #

(>) :: V1 p -> V1 p -> Bool #

(>=) :: V1 p -> V1 p -> Bool #

max :: V1 p -> V1 p -> V1 p #

min :: V1 p -> V1 p -> V1 p #

Ord (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: U1 p -> U1 p -> Ordering #

(<) :: U1 p -> U1 p -> Bool #

(<=) :: U1 p -> U1 p -> Bool #

(>) :: U1 p -> U1 p -> Bool #

(>=) :: U1 p -> U1 p -> Bool #

max :: U1 p -> U1 p -> U1 p #

min :: U1 p -> U1 p -> U1 p #

Ord (TypeRep a)

Since: base-4.4.0.0

Instance details

Defined in Data.Typeable.Internal

Methods

compare :: TypeRep a -> TypeRep a -> Ordering #

(<) :: TypeRep a -> TypeRep a -> Bool #

(<=) :: TypeRep a -> TypeRep a -> Bool #

(>) :: TypeRep a -> TypeRep a -> Bool #

(>=) :: TypeRep a -> TypeRep a -> Bool #

max :: TypeRep a -> TypeRep a -> TypeRep a #

min :: TypeRep a -> TypeRep a -> TypeRep a #

(Ord a, Ord b) => Ord (a, b) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b) -> (a, b) -> Ordering #

(<) :: (a, b) -> (a, b) -> Bool #

(<=) :: (a, b) -> (a, b) -> Bool #

(>) :: (a, b) -> (a, b) -> Bool #

(>=) :: (a, b) -> (a, b) -> Bool #

max :: (a, b) -> (a, b) -> (a, b) #

min :: (a, b) -> (a, b) -> (a, b) #

(Ord i, Ord a) => Ord (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

compare :: Level i a -> Level i a -> Ordering #

(<) :: Level i a -> Level i a -> Bool #

(<=) :: Level i a -> Level i a -> Bool #

(>) :: Level i a -> Level i a -> Bool #

(>=) :: Level i a -> Level i a -> Bool #

max :: Level i a -> Level i a -> Level i a #

min :: Level i a -> Level i a -> Level i a #

(Ord k, Ord v) => Ord (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

compare :: Map k v -> Map k v -> Ordering #

(<) :: Map k v -> Map k v -> Bool #

(<=) :: Map k v -> Map k v -> Bool #

(>) :: Map k v -> Map k v -> Bool #

(>=) :: Map k v -> Map k v -> Bool #

max :: Map k v -> Map k v -> Map k v #

min :: Map k v -> Map k v -> Map k v #

(Ix ix, Ord e, IArray UArray e) => Ord (UArray ix e) 
Instance details

Defined in Data.Array.Base

Methods

compare :: UArray ix e -> UArray ix e -> Ordering #

(<) :: UArray ix e -> UArray ix e -> Bool #

(<=) :: UArray ix e -> UArray ix e -> Bool #

(>) :: UArray ix e -> UArray ix e -> Bool #

(>=) :: UArray ix e -> UArray ix e -> Bool #

max :: UArray ix e -> UArray ix e -> UArray ix e #

min :: UArray ix e -> UArray ix e -> UArray ix e #

(Ix i, Ord e) => Ord (Array i e)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

compare :: Array i e -> Array i e -> Ordering #

(<) :: Array i e -> Array i e -> Bool #

(<=) :: Array i e -> Array i e -> Bool #

(>) :: Array i e -> Array i e -> Bool #

(>=) :: Array i e -> Array i e -> Bool #

max :: Array i e -> Array i e -> Array i e #

min :: Array i e -> Array i e -> Array i e #

Ord a => Ord (Arg a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Arg a b -> Arg a b -> Ordering #

(<) :: Arg a b -> Arg a b -> Bool #

(<=) :: Arg a b -> Arg a b -> Bool #

(>) :: Arg a b -> Arg a b -> Bool #

(>=) :: Arg a b -> Arg a b -> Bool #

max :: Arg a b -> Arg a b -> Arg a b #

min :: Arg a b -> Arg a b -> Arg a b #

Ord (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

compare :: Proxy s -> Proxy s -> Ordering #

(<) :: Proxy s -> Proxy s -> Bool #

(<=) :: Proxy s -> Proxy s -> Bool #

(>) :: Proxy s -> Proxy s -> Bool #

(>=) :: Proxy s -> Proxy s -> Bool #

max :: Proxy s -> Proxy s -> Proxy s #

min :: Proxy s -> Proxy s -> Proxy s #

(Ord1 m, Ord a) => Ord (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

compare :: MaybeT m a -> MaybeT m a -> Ordering #

(<) :: MaybeT m a -> MaybeT m a -> Bool #

(<=) :: MaybeT m a -> MaybeT m a -> Bool #

(>) :: MaybeT m a -> MaybeT m a -> Bool #

(>=) :: MaybeT m a -> MaybeT m a -> Bool #

max :: MaybeT m a -> MaybeT m a -> MaybeT m a #

min :: MaybeT m a -> MaybeT m a -> MaybeT m a #

(Ord a, Ord (s a)) => Ord (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: ViewL s a -> ViewL s a -> Ordering #

(<) :: ViewL s a -> ViewL s a -> Bool #

(<=) :: ViewL s a -> ViewL s a -> Bool #

(>) :: ViewL s a -> ViewL s a -> Bool #

(>=) :: ViewL s a -> ViewL s a -> Bool #

max :: ViewL s a -> ViewL s a -> ViewL s a #

min :: ViewL s a -> ViewL s a -> ViewL s a #

(Ord a, Ord (s a)) => Ord (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: ViewR s a -> ViewR s a -> Ordering #

(<) :: ViewR s a -> ViewR s a -> Bool #

(<=) :: ViewR s a -> ViewR s a -> Bool #

(>) :: ViewR s a -> ViewR s a -> Bool #

(>=) :: ViewR s a -> ViewR s a -> Bool #

max :: ViewR s a -> ViewR s a -> ViewR s a #

min :: ViewR s a -> ViewR s a -> ViewR s a #

Ord a => Ord (FingerTree v a)

Lexicographical order from left to right.

Instance details

Defined in Data.FingerTree

Methods

compare :: FingerTree v a -> FingerTree v a -> Ordering #

(<) :: FingerTree v a -> FingerTree v a -> Bool #

(<=) :: FingerTree v a -> FingerTree v a -> Bool #

(>) :: FingerTree v a -> FingerTree v a -> Bool #

(>=) :: FingerTree v a -> FingerTree v a -> Bool #

max :: FingerTree v a -> FingerTree v a -> FingerTree v a #

min :: FingerTree v a -> FingerTree v a -> FingerTree v a #

Ord a => Ord (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: SearchResult v a -> SearchResult v a -> Ordering #

(<) :: SearchResult v a -> SearchResult v a -> Bool #

(<=) :: SearchResult v a -> SearchResult v a -> Bool #

(>) :: SearchResult v a -> SearchResult v a -> Bool #

(>=) :: SearchResult v a -> SearchResult v a -> Bool #

max :: SearchResult v a -> SearchResult v a -> SearchResult v a #

min :: SearchResult v a -> SearchResult v a -> SearchResult v a #

(Ord1 m, Ord a) => Ord (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

compare :: ListT m a -> ListT m a -> Ordering #

(<) :: ListT m a -> ListT m a -> Bool #

(<=) :: ListT m a -> ListT m a -> Bool #

(>) :: ListT m a -> ListT m a -> Bool #

(>=) :: ListT m a -> ListT m a -> Bool #

max :: ListT m a -> ListT m a -> ListT m a #

min :: ListT m a -> ListT m a -> ListT m a #

Ord (v n) => Ord (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: Trail v n -> Trail v n -> Ordering #

(<) :: Trail v n -> Trail v n -> Bool #

(<=) :: Trail v n -> Trail v n -> Bool #

(>) :: Trail v n -> Trail v n -> Bool #

(>=) :: Trail v n -> Trail v n -> Bool #

max :: Trail v n -> Trail v n -> Trail v n #

min :: Trail v n -> Trail v n -> Trail v n #

Ord (v n) => Ord (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

compare :: Path v n -> Path v n -> Ordering #

(<) :: Path v n -> Path v n -> Bool #

(<=) :: Path v n -> Path v n -> Bool #

(>) :: Path v n -> Path v n -> Bool #

(>=) :: Path v n -> Path v n -> Bool #

max :: Path v n -> Path v n -> Path v n #

min :: Path v n -> Path v n -> Path v n #

Ord (f a) => Ord (Point f a) 
Instance details

Defined in Linear.Affine

Methods

compare :: Point f a -> Point f a -> Ordering #

(<) :: Point f a -> Point f a -> Bool #

(<=) :: Point f a -> Point f a -> Bool #

(>) :: Point f a -> Point f a -> Bool #

(>=) :: Point f a -> Point f a -> Bool #

max :: Point f a -> Point f a -> Point f a #

min :: Point f a -> Point f a -> Point f a #

(Ord t, KnownNat m) => Ord (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

compare :: Mod m t -> Mod m t -> Ordering #

(<) :: Mod m t -> Mod m t -> Bool #

(<=) :: Mod m t -> Mod m t -> Bool #

(>) :: Mod m t -> Mod m t -> Bool #

(>=) :: Mod m t -> Mod m t -> Bool #

max :: Mod m t -> Mod m t -> Mod m t #

min :: Mod m t -> Mod m t -> Mod m t #

(Ix i, Show i, Ord e) => Ord (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

compare :: AbstractArray i e -> AbstractArray i e -> Ordering #

(<) :: AbstractArray i e -> AbstractArray i e -> Bool #

(<=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>=) :: AbstractArray i e -> AbstractArray i e -> Bool #

max :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

min :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

(Ord k, Ord v) => Ord (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

compare :: HashMap k v -> HashMap k v -> Ordering #

(<) :: HashMap k v -> HashMap k v -> Bool #

(<=) :: HashMap k v -> HashMap k v -> Bool #

(>) :: HashMap k v -> HashMap k v -> Bool #

(>=) :: HashMap k v -> HashMap k v -> Bool #

max :: HashMap k v -> HashMap k v -> HashMap k v #

min :: HashMap k v -> HashMap k v -> HashMap k v #

Ord (v n) => Ord (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: SegTree v n -> SegTree v n -> Ordering #

(<) :: SegTree v n -> SegTree v n -> Bool #

(<=) :: SegTree v n -> SegTree v n -> Bool #

(>) :: SegTree v n -> SegTree v n -> Bool #

(>=) :: SegTree v n -> SegTree v n -> Bool #

max :: SegTree v n -> SegTree v n -> SegTree v n #

min :: SegTree v n -> SegTree v n -> SegTree v n #

(Ord1 f, Ord a) => Ord (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

compare :: Cofree f a -> Cofree f a -> Ordering #

(<) :: Cofree f a -> Cofree f a -> Bool #

(<=) :: Cofree f a -> Cofree f a -> Bool #

(>) :: Cofree f a -> Cofree f a -> Bool #

(>=) :: Cofree f a -> Cofree f a -> Bool #

max :: Cofree f a -> Cofree f a -> Cofree f a #

min :: Cofree f a -> Cofree f a -> Cofree f a #

Ord (v n) => Ord (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

compare :: Direction v n -> Direction v n -> Ordering #

(<) :: Direction v n -> Direction v n -> Bool #

(<=) :: Direction v n -> Direction v n -> Bool #

(>) :: Direction v n -> Direction v n -> Bool #

(>=) :: Direction v n -> Direction v n -> Bool #

max :: Direction v n -> Direction v n -> Direction v n #

min :: Direction v n -> Direction v n -> Direction v n #

(Ord a, Ord b) => Ord (a :& b) 
Instance details

Defined in Diagrams.Coordinates

Methods

compare :: (a :& b) -> (a :& b) -> Ordering #

(<) :: (a :& b) -> (a :& b) -> Bool #

(<=) :: (a :& b) -> (a :& b) -> Bool #

(>) :: (a :& b) -> (a :& b) -> Bool #

(>=) :: (a :& b) -> (a :& b) -> Bool #

max :: (a :& b) -> (a :& b) -> a :& b #

min :: (a :& b) -> (a :& b) -> a :& b #

(Ord1 f, Ord a) => Ord (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

compare :: Free f a -> Free f a -> Ordering #

(<) :: Free f a -> Free f a -> Bool #

(<=) :: Free f a -> Free f a -> Bool #

(>) :: Free f a -> Free f a -> Bool #

(>=) :: Free f a -> Free f a -> Bool #

max :: Free f a -> Free f a -> Free f a #

min :: Free f a -> Free f a -> Free f a #

(Ord1 f, Ord a) => Ord (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

compare :: Yoneda f a -> Yoneda f a -> Ordering #

(<) :: Yoneda f a -> Yoneda f a -> Bool #

(<=) :: Yoneda f a -> Yoneda f a -> Bool #

(>) :: Yoneda f a -> Yoneda f a -> Bool #

(>=) :: Yoneda f a -> Yoneda f a -> Bool #

max :: Yoneda f a -> Yoneda f a -> Yoneda f a #

min :: Yoneda f a -> Yoneda f a -> Yoneda f a #

(Ord a, Ord b) => Ord (Bimap a b) 
Instance details

Defined in Data.Bimap

Methods

compare :: Bimap a b -> Bimap a b -> Ordering #

(<) :: Bimap a b -> Bimap a b -> Bool #

(<=) :: Bimap a b -> Bimap a b -> Bool #

(>) :: Bimap a b -> Bimap a b -> Bool #

(>=) :: Bimap a b -> Bimap a b -> Bool #

max :: Bimap a b -> Bimap a b -> Bimap a b #

min :: Bimap a b -> Bimap a b -> Bimap a b #

Ord (f p) => Ord (Rec1 f p) 
Instance details

Defined in GHC.Generics

Methods

compare :: Rec1 f p -> Rec1 f p -> Ordering #

(<) :: Rec1 f p -> Rec1 f p -> Bool #

(<=) :: Rec1 f p -> Rec1 f p -> Bool #

(>) :: Rec1 f p -> Rec1 f p -> Bool #

(>=) :: Rec1 f p -> Rec1 f p -> Bool #

max :: Rec1 f p -> Rec1 f p -> Rec1 f p #

min :: Rec1 f p -> Rec1 f p -> Rec1 f p #

Ord (URec (Ptr ()) p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering #

(<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #

min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #

Ord (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering #

(<) :: URec Char p -> URec Char p -> Bool #

(<=) :: URec Char p -> URec Char p -> Bool #

(>) :: URec Char p -> URec Char p -> Bool #

(>=) :: URec Char p -> URec Char p -> Bool #

max :: URec Char p -> URec Char p -> URec Char p #

min :: URec Char p -> URec Char p -> URec Char p #

Ord (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering #

(<) :: URec Double p -> URec Double p -> Bool #

(<=) :: URec Double p -> URec Double p -> Bool #

(>) :: URec Double p -> URec Double p -> Bool #

(>=) :: URec Double p -> URec Double p -> Bool #

max :: URec Double p -> URec Double p -> URec Double p #

min :: URec Double p -> URec Double p -> URec Double p #

Ord (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering #

(<) :: URec Float p -> URec Float p -> Bool #

(<=) :: URec Float p -> URec Float p -> Bool #

(>) :: URec Float p -> URec Float p -> Bool #

(>=) :: URec Float p -> URec Float p -> Bool #

max :: URec Float p -> URec Float p -> URec Float p #

min :: URec Float p -> URec Float p -> URec Float p #

Ord (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering #

(<) :: URec Int p -> URec Int p -> Bool #

(<=) :: URec Int p -> URec Int p -> Bool #

(>) :: URec Int p -> URec Int p -> Bool #

(>=) :: URec Int p -> URec Int p -> Bool #

max :: URec Int p -> URec Int p -> URec Int p #

min :: URec Int p -> URec Int p -> URec Int p #

Ord (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering #

(<) :: URec Word p -> URec Word p -> Bool #

(<=) :: URec Word p -> URec Word p -> Bool #

(>) :: URec Word p -> URec Word p -> Bool #

(>=) :: URec Word p -> URec Word p -> Bool #

max :: URec Word p -> URec Word p -> URec Word p #

min :: URec Word p -> URec Word p -> URec Word p #

(Ord a, Ord b, Ord c) => Ord (a, b, c) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c) -> (a, b, c) -> Ordering #

(<) :: (a, b, c) -> (a, b, c) -> Bool #

(<=) :: (a, b, c) -> (a, b, c) -> Bool #

(>) :: (a, b, c) -> (a, b, c) -> Bool #

(>=) :: (a, b, c) -> (a, b, c) -> Bool #

max :: (a, b, c) -> (a, b, c) -> (a, b, c) #

min :: (a, b, c) -> (a, b, c) -> (a, b, c) #

Ord a => Ord (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

compare :: Const a b -> Const a b -> Ordering #

(<) :: Const a b -> Const a b -> Bool #

(<=) :: Const a b -> Const a b -> Bool #

(>) :: Const a b -> Const a b -> Bool #

(>=) :: Const a b -> Const a b -> Bool #

max :: Const a b -> Const a b -> Const a b #

min :: Const a b -> Const a b -> Const a b #

Ord (f a) => Ord (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Alt f a -> Alt f a -> Ordering #

(<) :: Alt f a -> Alt f a -> Bool #

(<=) :: Alt f a -> Alt f a -> Bool #

(>) :: Alt f a -> Alt f a -> Bool #

(>=) :: Alt f a -> Alt f a -> Bool #

max :: Alt f a -> Alt f a -> Alt f a #

min :: Alt f a -> Alt f a -> Alt f a #

Ord (a :~: b) 
Instance details

Defined in Data.Type.Equality

Methods

compare :: (a :~: b) -> (a :~: b) -> Ordering #

(<) :: (a :~: b) -> (a :~: b) -> Bool #

(<=) :: (a :~: b) -> (a :~: b) -> Bool #

(>) :: (a :~: b) -> (a :~: b) -> Bool #

(>=) :: (a :~: b) -> (a :~: b) -> Bool #

max :: (a :~: b) -> (a :~: b) -> a :~: b #

min :: (a :~: b) -> (a :~: b) -> a :~: b #

(Ord1 f, Ord a) => Ord (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

compare :: IdentityT f a -> IdentityT f a -> Ordering #

(<) :: IdentityT f a -> IdentityT f a -> Bool #

(<=) :: IdentityT f a -> IdentityT f a -> Bool #

(>) :: IdentityT f a -> IdentityT f a -> Bool #

(>=) :: IdentityT f a -> IdentityT f a -> Bool #

max :: IdentityT f a -> IdentityT f a -> IdentityT f a #

min :: IdentityT f a -> IdentityT f a -> IdentityT f a #

(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

compare :: ExceptT e m a -> ExceptT e m a -> Ordering #

(<) :: ExceptT e m a -> ExceptT e m a -> Bool #

(<=) :: ExceptT e m a -> ExceptT e m a -> Bool #

(>) :: ExceptT e m a -> ExceptT e m a -> Bool #

(>=) :: ExceptT e m a -> ExceptT e m a -> Bool #

max :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

min :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

(Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

compare :: ErrorT e m a -> ErrorT e m a -> Ordering #

(<) :: ErrorT e m a -> ErrorT e m a -> Bool #

(<=) :: ErrorT e m a -> ErrorT e m a -> Bool #

(>) :: ErrorT e m a -> ErrorT e m a -> Bool #

(>=) :: ErrorT e m a -> ErrorT e m a -> Bool #

max :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

min :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

(Ord1 f, Ord a) => Ord (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

compare :: Backwards f a -> Backwards f a -> Ordering #

(<) :: Backwards f a -> Backwards f a -> Bool #

(<=) :: Backwards f a -> Backwards f a -> Bool #

(>) :: Backwards f a -> Backwards f a -> Bool #

(>=) :: Backwards f a -> Backwards f a -> Bool #

max :: Backwards f a -> Backwards f a -> Backwards f a #

min :: Backwards f a -> Backwards f a -> Backwards f a #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering #

(<) :: WriterT w m a -> WriterT w m a -> Bool #

(<=) :: WriterT w m a -> WriterT w m a -> Bool #

(>) :: WriterT w m a -> WriterT w m a -> Bool #

(>=) :: WriterT w m a -> WriterT w m a -> Bool #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering #

(<) :: WriterT w m a -> WriterT w m a -> Bool #

(<=) :: WriterT w m a -> WriterT w m a -> Bool #

(>) :: WriterT w m a -> WriterT w m a -> Bool #

(>=) :: WriterT w m a -> WriterT w m a -> Bool #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a #

Ord (p a a) => Ord (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

compare :: Join p a -> Join p a -> Ordering #

(<) :: Join p a -> Join p a -> Bool #

(<=) :: Join p a -> Join p a -> Bool #

(>) :: Join p a -> Join p a -> Bool #

(>=) :: Join p a -> Join p a -> Bool #

max :: Join p a -> Join p a -> Join p a #

min :: Join p a -> Join p a -> Join p a #

Ord b => Ord (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

compare :: Tagged s b -> Tagged s b -> Ordering #

(<) :: Tagged s b -> Tagged s b -> Bool #

(<=) :: Tagged s b -> Tagged s b -> Bool #

(>) :: Tagged s b -> Tagged s b -> Bool #

(>=) :: Tagged s b -> Tagged s b -> Bool #

max :: Tagged s b -> Tagged s b -> Tagged s b #

min :: Tagged s b -> Tagged s b -> Tagged s b #

Ord (v n) => Ord (Segment c v n) 
Instance details

Defined in Diagrams.Segment

Methods

compare :: Segment c v n -> Segment c v n -> Ordering #

(<) :: Segment c v n -> Segment c v n -> Bool #

(<=) :: Segment c v n -> Segment c v n -> Bool #

(>) :: Segment c v n -> Segment c v n -> Bool #

(>=) :: Segment c v n -> Segment c v n -> Bool #

max :: Segment c v n -> Segment c v n -> Segment c v n #

min :: Segment c v n -> Segment c v n -> Segment c v n #

Ord (v n) => Ord (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: Trail' l v n -> Trail' l v n -> Ordering #

(<) :: Trail' l v n -> Trail' l v n -> Bool #

(<=) :: Trail' l v n -> Trail' l v n -> Bool #

(>) :: Trail' l v n -> Trail' l v n -> Bool #

(>=) :: Trail' l v n -> Trail' l v n -> Bool #

max :: Trail' l v n -> Trail' l v n -> Trail' l v n #

min :: Trail' l v n -> Trail' l v n -> Trail' l v n #

Ord (v n) => Ord (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

compare :: Offset c v n -> Offset c v n -> Ordering #

(<) :: Offset c v n -> Offset c v n -> Bool #

(<=) :: Offset c v n -> Offset c v n -> Bool #

(>) :: Offset c v n -> Offset c v n -> Bool #

(>=) :: Offset c v n -> Offset c v n -> Bool #

max :: Offset c v n -> Offset c v n -> Offset c v n #

min :: Offset c v n -> Offset c v n -> Offset c v n #

Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeT f w a -> CofreeT f w a -> Ordering #

(<) :: CofreeT f w a -> CofreeT f w a -> Bool #

(<=) :: CofreeT f w a -> CofreeT f w a -> Bool #

(>) :: CofreeT f w a -> CofreeT f w a -> Bool #

(>=) :: CofreeT f w a -> CofreeT f w a -> Bool #

max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #

min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #

(Ord a, Ord (f b)) => Ord (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeF f a b -> CofreeF f a b -> Ordering #

(<) :: CofreeF f a b -> CofreeF f a b -> Bool #

(<=) :: CofreeF f a b -> CofreeF f a b -> Bool #

(>) :: CofreeF f a b -> CofreeF f a b -> Bool #

(>=) :: CofreeF f a b -> CofreeF f a b -> Bool #

max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #

min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #

Ord (p (Fix p a) a) => Ord (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

compare :: Fix p a -> Fix p a -> Ordering #

(<) :: Fix p a -> Fix p a -> Bool #

(<=) :: Fix p a -> Fix p a -> Bool #

(>) :: Fix p a -> Fix p a -> Bool #

(>=) :: Fix p a -> Fix p a -> Bool #

max :: Fix p a -> Fix p a -> Fix p a #

min :: Fix p a -> Fix p a -> Fix p a #

(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeT f m a -> FreeT f m a -> Ordering #

(<) :: FreeT f m a -> FreeT f m a -> Bool #

(<=) :: FreeT f m a -> FreeT f m a -> Bool #

(>) :: FreeT f m a -> FreeT f m a -> Bool #

(>=) :: FreeT f m a -> FreeT f m a -> Bool #

max :: FreeT f m a -> FreeT f m a -> FreeT f m a #

min :: FreeT f m a -> FreeT f m a -> FreeT f m a #

(Ord a, Ord (f b)) => Ord (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeF f a b -> FreeF f a b -> Ordering #

(<) :: FreeF f a b -> FreeF f a b -> Bool #

(<=) :: FreeF f a b -> FreeF f a b -> Bool #

(>) :: FreeF f a b -> FreeF f a b -> Bool #

(>=) :: FreeF f a b -> FreeF f a b -> Bool #

max :: FreeF f a b -> FreeF f a b -> FreeF f a b #

min :: FreeF f a b -> FreeF f a b -> FreeF f a b #

Ord a => Ord (V n a) 
Instance details

Defined in Linear.V

Methods

compare :: V n a -> V n a -> Ordering #

(<) :: V n a -> V n a -> Bool #

(<=) :: V n a -> V n a -> Bool #

(>) :: V n a -> V n a -> Bool #

(>=) :: V n a -> V n a -> Bool #

max :: V n a -> V n a -> V n a #

min :: V n a -> V n a -> V n a #

Ord c => Ord (K1 i c p) 
Instance details

Defined in GHC.Generics

Methods

compare :: K1 i c p -> K1 i c p -> Ordering #

(<) :: K1 i c p -> K1 i c p -> Bool #

(<=) :: K1 i c p -> K1 i c p -> Bool #

(>) :: K1 i c p -> K1 i c p -> Bool #

(>=) :: K1 i c p -> K1 i c p -> Bool #

max :: K1 i c p -> K1 i c p -> K1 i c p #

min :: K1 i c p -> K1 i c p -> K1 i c p #

(Ord (f p), Ord (g p)) => Ord ((f :+: g) p) 
Instance details

Defined in GHC.Generics

Methods

compare :: (f :+: g) p -> (f :+: g) p -> Ordering #

(<) :: (f :+: g) p -> (f :+: g) p -> Bool #

(<=) :: (f :+: g) p -> (f :+: g) p -> Bool #

(>) :: (f :+: g) p -> (f :+: g) p -> Bool #

(>=) :: (f :+: g) p -> (f :+: g) p -> Bool #

max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #

min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #

(Ord (f p), Ord (g p)) => Ord ((f :*: g) p) 
Instance details

Defined in GHC.Generics

Methods

compare :: (f :*: g) p -> (f :*: g) p -> Ordering #

(<) :: (f :*: g) p -> (f :*: g) p -> Bool #

(<=) :: (f :*: g) p -> (f :*: g) p -> Bool #

(>) :: (f :*: g) p -> (f :*: g) p -> Bool #

(>=) :: (f :*: g) p -> (f :*: g) p -> Bool #

max :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

min :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering #

(<) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(>) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

compare :: Product f g a -> Product f g a -> Ordering #

(<) :: Product f g a -> Product f g a -> Bool #

(<=) :: Product f g a -> Product f g a -> Bool #

(>) :: Product f g a -> Product f g a -> Bool #

(>=) :: Product f g a -> Product f g a -> Bool #

max :: Product f g a -> Product f g a -> Product f g a #

min :: Product f g a -> Product f g a -> Product f g a #

(Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

compare :: Sum f g a -> Sum f g a -> Ordering #

(<) :: Sum f g a -> Sum f g a -> Bool #

(<=) :: Sum f g a -> Sum f g a -> Bool #

(>) :: Sum f g a -> Sum f g a -> Bool #

(>=) :: Sum f g a -> Sum f g a -> Bool #

max :: Sum f g a -> Sum f g a -> Sum f g a #

min :: Sum f g a -> Sum f g a -> Sum f g a #

Ord (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

compare :: (a :~~: b) -> (a :~~: b) -> Ordering #

(<) :: (a :~~: b) -> (a :~~: b) -> Bool #

(<=) :: (a :~~: b) -> (a :~~: b) -> Bool #

(>) :: (a :~~: b) -> (a :~~: b) -> Bool #

(>=) :: (a :~~: b) -> (a :~~: b) -> Bool #

max :: (a :~~: b) -> (a :~~: b) -> a :~~: b #

min :: (a :~~: b) -> (a :~~: b) -> a :~~: b #

Ord (f p) => Ord (M1 i c f p) 
Instance details

Defined in GHC.Generics

Methods

compare :: M1 i c f p -> M1 i c f p -> Ordering #

(<) :: M1 i c f p -> M1 i c f p -> Bool #

(<=) :: M1 i c f p -> M1 i c f p -> Bool #

(>) :: M1 i c f p -> M1 i c f p -> Bool #

(>=) :: M1 i c f p -> M1 i c f p -> Bool #

max :: M1 i c f p -> M1 i c f p -> M1 i c f p #

min :: M1 i c f p -> M1 i c f p -> M1 i c f p #

Ord (f (g p)) => Ord ((f :.: g) p) 
Instance details

Defined in GHC.Generics

Methods

compare :: (f :.: g) p -> (f :.: g) p -> Ordering #

(<) :: (f :.: g) p -> (f :.: g) p -> Bool #

(<=) :: (f :.: g) p -> (f :.: g) p -> Bool #

(>) :: (f :.: g) p -> (f :.: g) p -> Bool #

(>=) :: (f :.: g) p -> (f :.: g) p -> Bool #

max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering #

(<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

compare :: Compose f g a -> Compose f g a -> Ordering #

(<) :: Compose f g a -> Compose f g a -> Bool #

(<=) :: Compose f g a -> Compose f g a -> Bool #

(>) :: Compose f g a -> Compose f g a -> Bool #

(>=) :: Compose f g a -> Compose f g a -> Bool #

max :: Compose f g a -> Compose f g a -> Compose f g a #

min :: Compose f g a -> Compose f g a -> Compose f g a #

Ord (f a) => Ord (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

compare :: Clown f a b -> Clown f a b -> Ordering #

(<) :: Clown f a b -> Clown f a b -> Bool #

(<=) :: Clown f a b -> Clown f a b -> Bool #

(>) :: Clown f a b -> Clown f a b -> Bool #

(>=) :: Clown f a b -> Clown f a b -> Bool #

max :: Clown f a b -> Clown f a b -> Clown f a b #

min :: Clown f a b -> Clown f a b -> Clown f a b #

Ord (p b a) => Ord (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

compare :: Flip p a b -> Flip p a b -> Ordering #

(<) :: Flip p a b -> Flip p a b -> Bool #

(<=) :: Flip p a b -> Flip p a b -> Bool #

(>) :: Flip p a b -> Flip p a b -> Bool #

(>=) :: Flip p a b -> Flip p a b -> Bool #

max :: Flip p a b -> Flip p a b -> Flip p a b #

min :: Flip p a b -> Flip p a b -> Flip p a b #

Ord (g b) => Ord (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

compare :: Joker g a b -> Joker g a b -> Ordering #

(<) :: Joker g a b -> Joker g a b -> Bool #

(<=) :: Joker g a b -> Joker g a b -> Bool #

(>) :: Joker g a b -> Joker g a b -> Bool #

(>=) :: Joker g a b -> Joker g a b -> Bool #

max :: Joker g a b -> Joker g a b -> Joker g a b #

min :: Joker g a b -> Joker g a b -> Joker g a b #

Ord (p a b) => Ord (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering #

(<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #

min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering #

(<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

(Ord (f a b), Ord (g a b)) => Ord (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

compare :: Product f g a b -> Product f g a b -> Ordering #

(<) :: Product f g a b -> Product f g a b -> Bool #

(<=) :: Product f g a b -> Product f g a b -> Bool #

(>) :: Product f g a b -> Product f g a b -> Bool #

(>=) :: Product f g a b -> Product f g a b -> Bool #

max :: Product f g a b -> Product f g a b -> Product f g a b #

min :: Product f g a b -> Product f g a b -> Product f g a b #

(Ord (p a b), Ord (q a b)) => Ord (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

compare :: Sum p q a b -> Sum p q a b -> Ordering #

(<) :: Sum p q a b -> Sum p q a b -> Bool #

(<=) :: Sum p q a b -> Sum p q a b -> Bool #

(>) :: Sum p q a b -> Sum p q a b -> Bool #

(>=) :: Sum p q a b -> Sum p q a b -> Bool #

max :: Sum p q a b -> Sum p q a b -> Sum p q a b #

min :: Sum p q a b -> Sum p q a b -> Sum p q a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering #

(<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

Ord (f (p a b)) => Ord (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

compare :: Tannen f p a b -> Tannen f p a b -> Ordering #

(<) :: Tannen f p a b -> Tannen f p a b -> Bool #

(<=) :: Tannen f p a b -> Tannen f p a b -> Bool #

(>) :: Tannen f p a b -> Tannen f p a b -> Bool #

(>=) :: Tannen f p a b -> Tannen f p a b -> Bool #

max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #

min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #

min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

Ord (p (f a) (g b)) => Ord (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

compare :: Biff p f g a b -> Biff p f g a b -> Ordering #

(<) :: Biff p f g a b -> Biff p f g a b -> Bool #

(<=) :: Biff p f g a b -> Biff p f g a b -> Bool #

(>) :: Biff p f g a b -> Biff p f g a b -> Bool #

(>=) :: Biff p f g a b -> Biff p f g a b -> Bool #

max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #

min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) #

min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) #

min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Read a where #

Parsing of Strings, producing values.

Derived instances of Read make the following assumptions, which - derived instances of Show obey:

  • If the constructor is defined to be an infix operator, then the + so such literals have type (Num a) => a.

Instances
Num Int

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Int -> Int -> Int #

(-) :: Int -> Int -> Int #

(*) :: Int -> Int -> Int #

negate :: Int -> Int #

abs :: Int -> Int #

signum :: Int -> Int #

fromInteger :: Integer -> Int #

Num Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int8 -> Int8 -> Int8 #

(-) :: Int8 -> Int8 -> Int8 #

(*) :: Int8 -> Int8 -> Int8 #

negate :: Int8 -> Int8 #

abs :: Int8 -> Int8 #

signum :: Int8 -> Int8 #

fromInteger :: Integer -> Int8 #

Num Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int16 -> Int16 -> Int16 #

(-) :: Int16 -> Int16 -> Int16 #

(*) :: Int16 -> Int16 -> Int16 #

negate :: Int16 -> Int16 #

abs :: Int16 -> Int16 #

signum :: Int16 -> Int16 #

fromInteger :: Integer -> Int16 #

Num Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int32 -> Int32 -> Int32 #

(-) :: Int32 -> Int32 -> Int32 #

(*) :: Int32 -> Int32 -> Int32 #

negate :: Int32 -> Int32 #

abs :: Int32 -> Int32 #

signum :: Int32 -> Int32 #

fromInteger :: Integer -> Int32 #

Num Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

(+) :: Int64 -> Int64 -> Int64 #

(-) :: Int64 -> Int64 -> Int64 #

(*) :: Int64 -> Int64 -> Int64 #

negate :: Int64 -> Int64 #

abs :: Int64 -> Int64 #

signum :: Int64 -> Int64 #

fromInteger :: Integer -> Int64 #

Num Integer

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Integer -> Integer -> Integer #

(-) :: Integer -> Integer -> Integer #

(*) :: Integer -> Integer -> Integer #

negate :: Integer -> Integer #

abs :: Integer -> Integer #

signum :: Integer -> Integer #

fromInteger :: Integer -> Integer #

Num Natural

Note that Natural's Num instance isn't a ring: no element but 0 has an + additive inverse. It is a semiring though.

Since: base-4.8.0.0

Instance details

Defined in GHC.Num

Methods

(+) :: Natural -> Natural -> Natural #

(-) :: Natural -> Natural -> Natural #

(*) :: Natural -> Natural -> Natural #

negate :: Natural -> Natural #

abs :: Natural -> Natural #

signum :: Natural -> Natural #

fromInteger :: Integer -> Natural #

Num Word

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Word -> Word -> Word #

(-) :: Word -> Word -> Word #

(*) :: Word -> Word -> Word #

negate :: Word -> Word #

abs :: Word -> Word #

signum :: Word -> Word #

fromInteger :: Integer -> Word #

Num Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word8 -> Word8 -> Word8 #

(-) :: Word8 -> Word8 -> Word8 #

(*) :: Word8 -> Word8 -> Word8 #

negate :: Word8 -> Word8 #

abs :: Word8 -> Word8 #

signum :: Word8 -> Word8 #

fromInteger :: Integer -> Word8 #

Num Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word16 -> Word16 -> Word16 #

(-) :: Word16 -> Word16 -> Word16 #

(*) :: Word16 -> Word16 -> Word16 #

negate :: Word16 -> Word16 #

abs :: Word16 -> Word16 #

signum :: Word16 -> Word16 #

fromInteger :: Integer -> Word16 #

Num Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word32 -> Word32 -> Word32 #

(-) :: Word32 -> Word32 -> Word32 #

(*) :: Word32 -> Word32 -> Word32 #

negate :: Word32 -> Word32 #

abs :: Word32 -> Word32 #

signum :: Word32 -> Word32 #

fromInteger :: Integer -> Word32 #

Num Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

(+) :: Word64 -> Word64 -> Word64 #

(-) :: Word64 -> Word64 -> Word64 #

(*) :: Word64 -> Word64 -> Word64 #

negate :: Word64 -> Word64 #

abs :: Word64 -> Word64 #

signum :: Word64 -> Word64 #

fromInteger :: Integer -> Word64 #

Num Fd 
Instance details

Defined in System.Posix.Types

Methods

(+) :: Fd -> Fd -> Fd #

(-) :: Fd -> Fd -> Fd #

(*) :: Fd -> Fd -> Fd #

negate :: Fd -> Fd #

abs :: Fd -> Fd #

signum :: Fd -> Fd #

fromInteger :: Integer -> Fd #

Num CKey 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CKey -> CKey -> CKey #

(-) :: CKey -> CKey -> CKey #

(*) :: CKey -> CKey -> CKey #

negate :: CKey -> CKey #

abs :: CKey -> CKey #

signum :: CKey -> CKey #

fromInteger :: Integer -> CKey #

Num CId 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CId -> CId -> CId #

(-) :: CId -> CId -> CId #

(*) :: CId -> CId -> CId #

negate :: CId -> CId #

abs :: CId -> CId #

signum :: CId -> CId #

fromInteger :: Integer -> CId #

Num CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

(-) :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

(*) :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

negate :: CFsFilCnt -> CFsFilCnt #

abs :: CFsFilCnt -> CFsFilCnt #

signum :: CFsFilCnt -> CFsFilCnt #

fromInteger :: Integer -> CFsFilCnt #

Num CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

(-) :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

(*) :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

negate :: CFsBlkCnt -> CFsBlkCnt #

abs :: CFsBlkCnt -> CFsBlkCnt #

signum :: CFsBlkCnt -> CFsBlkCnt #

fromInteger :: Integer -> CFsBlkCnt #

Num CClockId 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CClockId -> CClockId -> CClockId #

(-) :: CClockId -> CClockId -> CClockId #

(*) :: CClockId -> CClockId -> CClockId #

negate :: CClockId -> CClockId #

abs :: CClockId -> CClockId #

signum :: CClockId -> CClockId #

fromInteger :: Integer -> CClockId #

Num CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CBlkCnt -> CBlkCnt -> CBlkCnt #

(-) :: CBlkCnt -> CBlkCnt -> CBlkCnt #

(*) :: CBlkCnt -> CBlkCnt -> CBlkCnt #

negate :: CBlkCnt -> CBlkCnt #

abs :: CBlkCnt -> CBlkCnt #

signum :: CBlkCnt -> CBlkCnt #

fromInteger :: Integer -> CBlkCnt #

Num CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CBlkSize -> CBlkSize -> CBlkSize #

(-) :: CBlkSize -> CBlkSize -> CBlkSize #

(*) :: CBlkSize -> CBlkSize -> CBlkSize #

negate :: CBlkSize -> CBlkSize #

abs :: CBlkSize -> CBlkSize #

signum :: CBlkSize -> CBlkSize #

fromInteger :: Integer -> CBlkSize #

Num CRLim 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CRLim -> CRLim -> CRLim #

(-) :: CRLim -> CRLim -> CRLim #

(*) :: CRLim -> CRLim -> CRLim #

negate :: CRLim -> CRLim #

abs :: CRLim -> CRLim #

signum :: CRLim -> CRLim #

fromInteger :: Integer -> CRLim #

Num CTcflag 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CTcflag -> CTcflag -> CTcflag #

(-) :: CTcflag -> CTcflag -> CTcflag #

(*) :: CTcflag -> CTcflag -> CTcflag #

negate :: CTcflag -> CTcflag #

abs :: CTcflag -> CTcflag #

signum :: CTcflag -> CTcflag #

fromInteger :: Integer -> CTcflag #

Num CSpeed 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CSpeed -> CSpeed -> CSpeed #

(-) :: CSpeed -> CSpeed -> CSpeed #

(*) :: CSpeed -> CSpeed -> CSpeed #

negate :: CSpeed -> CSpeed #

abs :: CSpeed -> CSpeed #

signum :: CSpeed -> CSpeed #

fromInteger :: Integer -> CSpeed #

Num CCc 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CCc -> CCc -> CCc #

(-) :: CCc -> CCc -> CCc #

(*) :: CCc -> CCc -> CCc #

negate :: CCc -> CCc #

abs :: CCc -> CCc #

signum :: CCc -> CCc #

fromInteger :: Integer -> CCc #

Num CUid 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CUid -> CUid -> CUid #

(-) :: CUid -> CUid -> CUid #

(*) :: CUid -> CUid -> CUid #

negate :: CUid -> CUid #

abs :: CUid -> CUid #

signum :: CUid -> CUid #

fromInteger :: Integer -> CUid #

Num CNlink 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CNlink -> CNlink -> CNlink #

(-) :: CNlink -> CNlink -> CNlink #

(*) :: CNlink -> CNlink -> CNlink #

negate :: CNlink -> CNlink #

abs :: CNlink -> CNlink #

signum :: CNlink -> CNlink #

fromInteger :: Integer -> CNlink #

Num CGid 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CGid -> CGid -> CGid #

(-) :: CGid -> CGid -> CGid #

(*) :: CGid -> CGid -> CGid #

negate :: CGid -> CGid #

abs :: CGid -> CGid #

signum :: CGid -> CGid #

fromInteger :: Integer -> CGid #

Num CSsize 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CSsize -> CSsize -> CSsize #

(-) :: CSsize -> CSsize -> CSsize #

(*) :: CSsize -> CSsize -> CSsize #

negate :: CSsize -> CSsize #

abs :: CSsize -> CSsize #

signum :: CSsize -> CSsize #

fromInteger :: Integer -> CSsize #

Num CPid 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CPid -> CPid -> CPid #

(-) :: CPid -> CPid -> CPid #

(*) :: CPid -> CPid -> CPid #

negate :: CPid -> CPid #

abs :: CPid -> CPid #

signum :: CPid -> CPid #

fromInteger :: Integer -> CPid #

Num COff 
Instance details

Defined in System.Posix.Types

Methods

(+) :: COff -> COff -> COff #

(-) :: COff -> COff -> COff #

(*) :: COff -> COff -> COff #

negate :: COff -> COff #

abs :: COff -> COff #

signum :: COff -> COff #

fromInteger :: Integer -> COff #

Num CMode 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CMode -> CMode -> CMode #

(-) :: CMode -> CMode -> CMode #

(*) :: CMode -> CMode -> CMode #

negate :: CMode -> CMode #

abs :: CMode -> CMode #

signum :: CMode -> CMode #

fromInteger :: Integer -> CMode #

Num CIno 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CIno -> CIno -> CIno #

(-) :: CIno -> CIno -> CIno #

(*) :: CIno -> CIno -> CIno #

negate :: CIno -> CIno #

abs :: CIno -> CIno #

signum :: CIno -> CIno #

fromInteger :: Integer -> CIno #

Num CDev 
Instance details

Defined in System.Posix.Types

Methods

(+) :: CDev -> CDev -> CDev #

(-) :: CDev -> CDev -> CDev #

(*) :: CDev -> CDev -> CDev #

negate :: CDev -> CDev #

abs :: CDev -> CDev #

signum :: CDev -> CDev #

fromInteger :: Integer -> CDev #

Num Scientific

WARNING: + and - compute the Integer magnitude: 10^e where e is + the difference between the base10Exponents of the arguments. If these + methods are applied to arguments which have huge exponents this could fill up + all space and crash your program! So don't apply these methods to scientific + numbers coming from untrusted sources. The other methods can be used safely.

Instance details

Defined in Data.Scientific

Methods

(+) :: Scientific -> Scientific -> Scientific #

(-) :: Scientific -> Scientific -> Scientific #

(*) :: Scientific -> Scientific -> Scientific #

negate :: Scientific -> Scientific #

abs :: Scientific -> Scientific #

signum :: Scientific -> Scientific #

fromInteger :: Integer -> Scientific #

Num Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(+) :: Pos -> Pos -> Pos #

(-) :: Pos -> Pos -> Pos #

(*) :: Pos -> Pos -> Pos #

negate :: Pos -> Pos #

abs :: Pos -> Pos #

signum :: Pos -> Pos #

fromInteger :: Integer -> Pos #

Num CChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CChar -> CChar -> CChar #

(-) :: CChar -> CChar -> CChar #

(*) :: CChar -> CChar -> CChar #

negate :: CChar -> CChar #

abs :: CChar -> CChar #

signum :: CChar -> CChar #

fromInteger :: Integer -> CChar #

Num CSChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSChar -> CSChar -> CSChar #

(-) :: CSChar -> CSChar -> CSChar #

(*) :: CSChar -> CSChar -> CSChar #

negate :: CSChar -> CSChar #

abs :: CSChar -> CSChar #

signum :: CSChar -> CSChar #

fromInteger :: Integer -> CSChar #

Num CUChar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUChar -> CUChar -> CUChar #

(-) :: CUChar -> CUChar -> CUChar #

(*) :: CUChar -> CUChar -> CUChar #

negate :: CUChar -> CUChar #

abs :: CUChar -> CUChar #

signum :: CUChar -> CUChar #

fromInteger :: Integer -> CUChar #

Num CShort 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CShort -> CShort -> CShort #

(-) :: CShort -> CShort -> CShort #

(*) :: CShort -> CShort -> CShort #

negate :: CShort -> CShort #

abs :: CShort -> CShort #

signum :: CShort -> CShort #

fromInteger :: Integer -> CShort #

Num CUShort 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUShort -> CUShort -> CUShort #

(-) :: CUShort -> CUShort -> CUShort #

(*) :: CUShort -> CUShort -> CUShort #

negate :: CUShort -> CUShort #

abs :: CUShort -> CUShort #

signum :: CUShort -> CUShort #

fromInteger :: Integer -> CUShort #

Num CInt 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CInt -> CInt -> CInt #

(-) :: CInt -> CInt -> CInt #

(*) :: CInt -> CInt -> CInt #

negate :: CInt -> CInt #

abs :: CInt -> CInt #

signum :: CInt -> CInt #

fromInteger :: Integer -> CInt #

Num CUInt 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUInt -> CUInt -> CUInt #

(-) :: CUInt -> CUInt -> CUInt #

(*) :: CUInt -> CUInt -> CUInt #

negate :: CUInt -> CUInt #

abs :: CUInt -> CUInt #

signum :: CUInt -> CUInt #

fromInteger :: Integer -> CUInt #

Num CLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CLong -> CLong -> CLong #

(-) :: CLong -> CLong -> CLong #

(*) :: CLong -> CLong -> CLong #

negate :: CLong -> CLong #

abs :: CLong -> CLong #

signum :: CLong -> CLong #

fromInteger :: Integer -> CLong #

Num CULong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CULong -> CULong -> CULong #

(-) :: CULong -> CULong -> CULong #

(*) :: CULong -> CULong -> CULong #

negate :: CULong -> CULong #

abs :: CULong -> CULong #

signum :: CULong -> CULong #

fromInteger :: Integer -> CULong #

Num CLLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CLLong -> CLLong -> CLLong #

(-) :: CLLong -> CLLong -> CLLong #

(*) :: CLLong -> CLLong -> CLLong #

negate :: CLLong -> CLLong #

abs :: CLLong -> CLLong #

signum :: CLLong -> CLLong #

fromInteger :: Integer -> CLLong #

Num CULLong 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CULLong -> CULLong -> CULLong #

(-) :: CULLong -> CULLong -> CULLong #

(*) :: CULLong -> CULLong -> CULLong #

negate :: CULLong -> CULLong #

abs :: CULLong -> CULLong #

signum :: CULLong -> CULLong #

fromInteger :: Integer -> CULLong #

Num CBool 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CBool -> CBool -> CBool #

(-) :: CBool -> CBool -> CBool #

(*) :: CBool -> CBool -> CBool #

negate :: CBool -> CBool #

abs :: CBool -> CBool #

signum :: CBool -> CBool #

fromInteger :: Integer -> CBool #

Num CFloat 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CFloat -> CFloat -> CFloat #

(-) :: CFloat -> CFloat -> CFloat #

(*) :: CFloat -> CFloat -> CFloat #

negate :: CFloat -> CFloat #

abs :: CFloat -> CFloat #

signum :: CFloat -> CFloat #

fromInteger :: Integer -> CFloat #

Num CDouble 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CDouble -> CDouble -> CDouble #

(-) :: CDouble -> CDouble -> CDouble #

(*) :: CDouble -> CDouble -> CDouble #

negate :: CDouble -> CDouble #

abs :: CDouble -> CDouble #

signum :: CDouble -> CDouble #

fromInteger :: Integer -> CDouble #

Num CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

(-) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

(*) :: CPtrdiff -> CPtrdiff -> CPtrdiff #

negate :: CPtrdiff -> CPtrdiff #

abs :: CPtrdiff -> CPtrdiff #

signum :: CPtrdiff -> CPtrdiff #

fromInteger :: Integer -> CPtrdiff #

Num CSize 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSize -> CSize -> CSize #

(-) :: CSize -> CSize -> CSize #

(*) :: CSize -> CSize -> CSize #

negate :: CSize -> CSize #

abs :: CSize -> CSize #

signum :: CSize -> CSize #

fromInteger :: Integer -> CSize #

Num CWchar 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CWchar -> CWchar -> CWchar #

(-) :: CWchar -> CWchar -> CWchar #

(*) :: CWchar -> CWchar -> CWchar #

negate :: CWchar -> CWchar #

abs :: CWchar -> CWchar #

signum :: CWchar -> CWchar #

fromInteger :: Integer -> CWchar #

Num CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

(-) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

(*) :: CSigAtomic -> CSigAtomic -> CSigAtomic #

negate :: CSigAtomic -> CSigAtomic #

abs :: CSigAtomic -> CSigAtomic #

signum :: CSigAtomic -> CSigAtomic #

fromInteger :: Integer -> CSigAtomic #

Num CClock 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CClock -> CClock -> CClock #

(-) :: CClock -> CClock -> CClock #

(*) :: CClock -> CClock -> CClock #

negate :: CClock -> CClock #

abs :: CClock -> CClock #

signum :: CClock -> CClock #

fromInteger :: Integer -> CClock #

Num CTime 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CTime -> CTime -> CTime #

(-) :: CTime -> CTime -> CTime #

(*) :: CTime -> CTime -> CTime #

negate :: CTime -> CTime #

abs :: CTime -> CTime #

signum :: CTime -> CTime #

fromInteger :: Integer -> CTime #

Num CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUSeconds -> CUSeconds -> CUSeconds #

(-) :: CUSeconds -> CUSeconds -> CUSeconds #

(*) :: CUSeconds -> CUSeconds -> CUSeconds #

negate :: CUSeconds -> CUSeconds #

abs :: CUSeconds -> CUSeconds #

signum :: CUSeconds -> CUSeconds #

fromInteger :: Integer -> CUSeconds #

Num CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

(-) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

(*) :: CSUSeconds -> CSUSeconds -> CSUSeconds #

negate :: CSUSeconds -> CSUSeconds #

abs :: CSUSeconds -> CSUSeconds #

signum :: CSUSeconds -> CSUSeconds #

fromInteger :: Integer -> CSUSeconds #

Num CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CIntPtr -> CIntPtr -> CIntPtr #

(-) :: CIntPtr -> CIntPtr -> CIntPtr #

(*) :: CIntPtr -> CIntPtr -> CIntPtr #

negate :: CIntPtr -> CIntPtr #

abs :: CIntPtr -> CIntPtr #

signum :: CIntPtr -> CIntPtr #

fromInteger :: Integer -> CIntPtr #

Num CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

(-) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

(*) :: CUIntPtr -> CUIntPtr -> CUIntPtr #

negate :: CUIntPtr -> CUIntPtr #

abs :: CUIntPtr -> CUIntPtr #

signum :: CUIntPtr -> CUIntPtr #

fromInteger :: Integer -> CUIntPtr #

Num CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CIntMax -> CIntMax -> CIntMax #

(-) :: CIntMax -> CIntMax -> CIntMax #

(*) :: CIntMax -> CIntMax -> CIntMax #

negate :: CIntMax -> CIntMax #

abs :: CIntMax -> CIntMax #

signum :: CIntMax -> CIntMax #

fromInteger :: Integer -> CIntMax #

Num CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

(+) :: CUIntMax -> CUIntMax -> CUIntMax #

(-) :: CUIntMax -> CUIntMax -> CUIntMax #

(*) :: CUIntMax -> CUIntMax -> CUIntMax #

negate :: CUIntMax -> CUIntMax #

abs :: CUIntMax -> CUIntMax #

signum :: CUIntMax -> CUIntMax #

fromInteger :: Integer -> CUIntMax #

Num LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

(+) :: LogFloat -> LogFloat -> LogFloat #

(-) :: LogFloat -> LogFloat -> LogFloat #

(*) :: LogFloat -> LogFloat -> LogFloat #

negate :: LogFloat -> LogFloat #

abs :: LogFloat -> LogFloat #

signum :: LogFloat -> LogFloat #

fromInteger :: Integer -> LogFloat #

Num B 
Instance details

Defined in Data.Text.Short.Internal

Methods

(+) :: B -> B -> B #

(-) :: B -> B -> B #

(*) :: B -> B -> B #

negate :: B -> B #

abs :: B -> B #

signum :: B -> B #

fromInteger :: Integer -> B #

Num NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

(+) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

(-) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

(*) :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

negate :: NominalDiffTime -> NominalDiffTime #

abs :: NominalDiffTime -> NominalDiffTime #

signum :: NominalDiffTime -> NominalDiffTime #

fromInteger :: Integer -> NominalDiffTime #

Num DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

(+) :: DiffTime -> DiffTime -> DiffTime #

(-) :: DiffTime -> DiffTime -> DiffTime #

(*) :: DiffTime -> DiffTime -> DiffTime #

negate :: DiffTime -> DiffTime #

abs :: DiffTime -> DiffTime #

signum :: DiffTime -> DiffTime #

fromInteger :: Integer -> DiffTime #

Num ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(+) :: ConstVal -> ConstVal -> ConstVal #

(-) :: ConstVal -> ConstVal -> ConstVal #

(*) :: ConstVal -> ConstVal -> ConstVal #

negate :: ConstVal -> ConstVal #

abs :: ConstVal -> ConstVal #

signum :: ConstVal -> ConstVal #

fromInteger :: Integer -> ConstVal #

Num DExpr # 
Instance details

Defined in Data.Expression

Methods

(+) :: DExpr -> DExpr -> DExpr #

(-) :: DExpr -> DExpr -> DExpr #

(*) :: DExpr -> DExpr -> DExpr #

negate :: DExpr -> DExpr #

abs :: DExpr -> DExpr #

signum :: DExpr -> DExpr #

fromInteger :: Integer -> DExpr #

Num LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: LogValue -> LogValue -> LogValue #

(-) :: LogValue -> LogValue -> LogValue #

(*) :: LogValue -> LogValue -> LogValue #

negate :: LogValue -> LogValue #

abs :: LogValue -> LogValue #

signum :: LogValue -> LogValue #

fromInteger :: Integer -> LogValue #

Num Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

(+) :: Percent -> Percent -> Percent #

(-) :: Percent -> Percent -> Percent #

(*) :: Percent -> Percent -> Percent #

negate :: Percent -> Percent #

abs :: Percent -> Percent #

signum :: Percent -> Percent #

fromInteger :: Integer -> Percent #

Num PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

(+) :: PlotIndex -> PlotIndex -> PlotIndex #

(-) :: PlotIndex -> PlotIndex -> PlotIndex #

(*) :: PlotIndex -> PlotIndex -> PlotIndex #

negate :: PlotIndex -> PlotIndex #

abs :: PlotIndex -> PlotIndex #

signum :: PlotIndex -> PlotIndex #

fromInteger :: Integer -> PlotIndex #

Num Matrix 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(+) :: Matrix -> Matrix -> Matrix #

(-) :: Matrix -> Matrix -> Matrix #

(*) :: Matrix -> Matrix -> Matrix #

negate :: Matrix -> Matrix #

abs :: Matrix -> Matrix #

signum :: Matrix -> Matrix #

fromInteger :: Integer -> Matrix #

Num Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(+) :: Crossings -> Crossings -> Crossings #

(-) :: Crossings -> Crossings -> Crossings #

(*) :: Crossings -> Crossings -> Crossings #

negate :: Crossings -> Crossings #

abs :: Crossings -> Crossings #

signum :: Crossings -> Crossings #

fromInteger :: Integer -> Crossings #

Num t => Num [t] # 
Instance details

Defined in Util

Methods

(+) :: [t] -> [t] -> [t] #

(-) :: [t] -> [t] -> [t] #

(*) :: [t] -> [t] -> [t] #

negate :: [t] -> [t] #

abs :: [t] -> [t] #

signum :: [t] -> [t] #

fromInteger :: Integer -> [t] #

Integral a => Num (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

(+) :: Ratio a -> Ratio a -> Ratio a #

(-) :: Ratio a -> Ratio a -> Ratio a #

(*) :: Ratio a -> Ratio a -> Ratio a #

negate :: Ratio a -> Ratio a #

abs :: Ratio a -> Ratio a #

signum :: Ratio a -> Ratio a #

fromInteger :: Integer -> Ratio a #

KnownNat m => Num (Vector (Mod m I)) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

(-) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

(*) :: Vector (Mod m I) -> Vector (Mod m I) -> Vector (Mod m I) #

negate :: Vector (Mod m I) -> Vector (Mod m I) #

abs :: Vector (Mod m I) -> Vector (Mod m I) #

signum :: Vector (Mod m I) -> Vector (Mod m I) #

fromInteger :: Integer -> Vector (Mod m I) #

KnownNat m => Num (Vector (Mod m Z)) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

(-) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

(*) :: Vector (Mod m Z) -> Vector (Mod m Z) -> Vector (Mod m Z) #

negate :: Vector (Mod m Z) -> Vector (Mod m Z) #

abs :: Vector (Mod m Z) -> Vector (Mod m Z) #

signum :: Vector (Mod m Z) -> Vector (Mod m Z) #

fromInteger :: Integer -> Vector (Mod m Z) #

RealFloat a => Num (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

(+) :: Complex a -> Complex a -> Complex a #

(-) :: Complex a -> Complex a -> Complex a #

(*) :: Complex a -> Complex a -> Complex a #

negate :: Complex a -> Complex a #

abs :: Complex a -> Complex a #

signum :: Complex a -> Complex a #

fromInteger :: Integer -> Complex a #

Num a => Num (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(+) :: Min a -> Min a -> Min a #

(-) :: Min a -> Min a -> Min a #

(*) :: Min a -> Min a -> Min a #

negate :: Min a -> Min a #

abs :: Min a -> Min a #

signum :: Min a -> Min a #

fromInteger :: Integer -> Min a #

Num a => Num (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(+) :: Max a -> Max a -> Max a #

(-) :: Max a -> Max a -> Max a #

(*) :: Max a -> Max a -> Max a #

negate :: Max a -> Max a #

abs :: Max a -> Max a #

signum :: Max a -> Max a #

fromInteger :: Integer -> Max a #

Num a => Num (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(+) :: Identity a -> Identity a -> Identity a #

(-) :: Identity a -> Identity a -> Identity a #

(*) :: Identity a -> Identity a -> Identity a #

negate :: Identity a -> Identity a #

abs :: Identity a -> Identity a #

signum :: Identity a -> Identity a #

fromInteger :: Integer -> Identity a #

Num a => Num (Sum a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Sum a -> Sum a -> Sum a #

(-) :: Sum a -> Sum a -> Sum a #

(*) :: Sum a -> Sum a -> Sum a #

negate :: Sum a -> Sum a #

abs :: Sum a -> Sum a #

signum :: Sum a -> Sum a #

fromInteger :: Integer -> Sum a #

Num a => Num (Product a)

Since: base-4.7.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Product a -> Product a -> Product a #

(-) :: Product a -> Product a -> Product a #

(*) :: Product a -> Product a -> Product a #

negate :: Product a -> Product a #

abs :: Product a -> Product a #

signum :: Product a -> Product a #

fromInteger :: Integer -> Product a #

Num a => Num (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(+) :: Down a -> Down a -> Down a #

(-) :: Down a -> Down a -> Down a #

(*) :: Down a -> Down a -> Down a #

negate :: Down a -> Down a #

abs :: Down a -> Down a #

signum :: Down a -> Down a #

fromInteger :: Integer -> Down a #

Num (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(+) :: Offset ty -> Offset ty -> Offset ty #

(-) :: Offset ty -> Offset ty -> Offset ty #

(*) :: Offset ty -> Offset ty -> Offset ty #

negate :: Offset ty -> Offset ty #

abs :: Offset ty -> Offset ty #

signum :: Offset ty -> Offset ty #

fromInteger :: Integer -> Offset ty #

Num (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(+) :: CountOf ty -> CountOf ty -> CountOf ty #

(-) :: CountOf ty -> CountOf ty -> CountOf ty #

(*) :: CountOf ty -> CountOf ty -> CountOf ty #

negate :: CountOf ty -> CountOf ty #

abs :: CountOf ty -> CountOf ty #

signum :: CountOf ty -> CountOf ty #

fromInteger :: Integer -> CountOf ty #

(KnownNat n, NatWithinBound Word64 n) => Num (Zn64 n) 
Instance details

Defined in Basement.Bounded

Methods

(+) :: Zn64 n -> Zn64 n -> Zn64 n #

(-) :: Zn64 n -> Zn64 n -> Zn64 n #

(*) :: Zn64 n -> Zn64 n -> Zn64 n #

negate :: Zn64 n -> Zn64 n #

abs :: Zn64 n -> Zn64 n #

signum :: Zn64 n -> Zn64 n #

fromInteger :: Integer -> Zn64 n #

KnownNat n => Num (Zn n) 
Instance details

Defined in Basement.Bounded

Methods

(+) :: Zn n -> Zn n -> Zn n #

(-) :: Zn n -> Zn n -> Zn n #

(*) :: Zn n -> Zn n -> Zn n #

negate :: Zn n -> Zn n #

abs :: Zn n -> Zn n #

signum :: Zn n -> Zn n #

fromInteger :: Integer -> Zn n #

Num n => Num (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

(+) :: VarInt n -> VarInt n -> VarInt n #

(-) :: VarInt n -> VarInt n -> VarInt n #

(*) :: VarInt n -> VarInt n -> VarInt n #

negate :: VarInt n -> VarInt n #

abs :: VarInt n -> VarInt n #

signum :: VarInt n -> VarInt n #

fromInteger :: Integer -> VarInt n #

(Num a, Ord a) => Num (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(+) :: Interval a -> Interval a -> Interval a #

(-) :: Interval a -> Interval a -> Interval a #

(*) :: Interval a -> Interval a -> Interval a #

negate :: Interval a -> Interval a #

abs :: Interval a -> Interval a #

signum :: Interval a -> Interval a #

fromInteger :: Integer -> Interval a #

(Precise a, RealFloat a) => Num (Log a) 
Instance details

Defined in Numeric.Log

Methods

(+) :: Log a -> Log a -> Log a #

(-) :: Log a -> Log a -> Log a #

(*) :: Log a -> Log a -> Log a #

negate :: Log a -> Log a #

abs :: Log a -> Log a #

signum :: Log a -> Log a #

fromInteger :: Integer -> Log a #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Num a => Num (V2 a) 
Instance details

Defined in Linear.V2

Methods

(+) :: V2 a -> V2 a -> V2 a #

(-) :: V2 a -> V2 a -> V2 a #

(*) :: V2 a -> V2 a -> V2 a #

negate :: V2 a -> V2 a #

abs :: V2 a -> V2 a #

signum :: V2 a -> V2 a #

fromInteger :: Integer -> V2 a #

Num n => Num (Time n) 
Instance details

Defined in Data.Active

Methods

(+) :: Time n -> Time n -> Time n #

(-) :: Time n -> Time n -> Time n #

(*) :: Time n -> Time n -> Time n #

negate :: Time n -> Time n #

abs :: Time n -> Time n #

signum :: Time n -> Time n #

fromInteger :: Integer -> Time n #

Num a => Num (V3 a) 
Instance details

Defined in Linear.V3

Methods

(+) :: V3 a -> V3 a -> V3 a #

(-) :: V3 a -> V3 a -> V3 a #

(*) :: V3 a -> V3 a -> V3 a #

negate :: V3 a -> V3 a #

abs :: V3 a -> V3 a #

signum :: V3 a -> V3 a #

fromInteger :: Integer -> V3 a #

Num a => Num (V1 a) 
Instance details

Defined in Linear.V1

Methods

(+) :: V1 a -> V1 a -> V1 a #

(-) :: V1 a -> V1 a -> V1 a #

(*) :: V1 a -> V1 a -> V1 a #

negate :: V1 a -> V1 a #

abs :: V1 a -> V1 a #

signum :: V1 a -> V1 a #

fromInteger :: Integer -> V1 a #

Num n => Num (Duration n) 
Instance details

Defined in Data.Active

Methods

(+) :: Duration n -> Duration n -> Duration n #

(-) :: Duration n -> Duration n -> Duration n #

(*) :: Duration n -> Duration n -> Duration n #

negate :: Duration n -> Duration n #

abs :: Duration n -> Duration n #

signum :: Duration n -> Duration n #

fromInteger :: Integer -> Duration n #

Num a => Num (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

(+) :: Plucker a -> Plucker a -> Plucker a #

(-) :: Plucker a -> Plucker a -> Plucker a #

(*) :: Plucker a -> Plucker a -> Plucker a #

negate :: Plucker a -> Plucker a #

abs :: Plucker a -> Plucker a #

signum :: Plucker a -> Plucker a #

fromInteger :: Integer -> Plucker a #

RealFloat a => Num (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

(+) :: Quaternion a -> Quaternion a -> Quaternion a #

(-) :: Quaternion a -> Quaternion a -> Quaternion a #

(*) :: Quaternion a -> Quaternion a -> Quaternion a #

negate :: Quaternion a -> Quaternion a #

abs :: Quaternion a -> Quaternion a #

signum :: Quaternion a -> Quaternion a #

fromInteger :: Integer -> Quaternion a #

Num (V0 a) 
Instance details

Defined in Linear.V0

Methods

(+) :: V0 a -> V0 a -> V0 a #

(-) :: V0 a -> V0 a -> V0 a #

(*) :: V0 a -> V0 a -> V0 a #

negate :: V0 a -> V0 a #

abs :: V0 a -> V0 a #

signum :: V0 a -> V0 a #

fromInteger :: Integer -> V0 a #

Num a => Num (V4 a) 
Instance details

Defined in Linear.V4

Methods

(+) :: V4 a -> V4 a -> V4 a #

(-) :: V4 a -> V4 a -> V4 a #

(*) :: V4 a -> V4 a -> V4 a #

negate :: V4 a -> V4 a #

abs :: V4 a -> V4 a #

signum :: V4 a -> V4 a #

fromInteger :: Integer -> V4 a #

Fractional n => Num (BernsteinPoly n) 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

(+) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

(-) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

(*) :: BernsteinPoly n -> BernsteinPoly n -> BernsteinPoly n #

negate :: BernsteinPoly n -> BernsteinPoly n #

abs :: BernsteinPoly n -> BernsteinPoly n #

signum :: BernsteinPoly n -> BernsteinPoly n #

fromInteger :: Integer -> BernsteinPoly n #

Num a => Num (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(+) :: Op a b -> Op a b -> Op a b #

(-) :: Op a b -> Op a b -> Op a b #

(*) :: Op a b -> Op a b -> Op a b #

negate :: Op a b -> Op a b #

abs :: Op a b -> Op a b #

signum :: Op a b -> Op a b #

fromInteger :: Integer -> Op a b #

(Integral t, KnownNat n) => Num (Mod n t) 
Instance details

Defined in Internal.Modular

Methods

(+) :: Mod n t -> Mod n t -> Mod n t #

(-) :: Mod n t -> Mod n t -> Mod n t #

(*) :: Mod n t -> Mod n t -> Mod n t #

negate :: Mod n t -> Mod n t #

abs :: Mod n t -> Mod n t #

signum :: Mod n t -> Mod n t #

fromInteger :: Integer -> Mod n t #

Num a => Num (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(+) :: Measured n a -> Measured n a -> Measured n a #

(-) :: Measured n a -> Measured n a -> Measured n a #

(*) :: Measured n a -> Measured n a -> Measured n a #

negate :: Measured n a -> Measured n a #

abs :: Measured n a -> Measured n a #

signum :: Measured n a -> Measured n a #

fromInteger :: Integer -> Measured n a #

Num (f a) => Num (Point f a) 
Instance details

Defined in Linear.Affine

Methods

(+) :: Point f a -> Point f a -> Point f a #

(-) :: Point f a -> Point f a -> Point f a #

(*) :: Point f a -> Point f a -> Point f a #

negate :: Point f a -> Point f a #

abs :: Point f a -> Point f a #

signum :: Point f a -> Point f a #

fromInteger :: Integer -> Point f a #

Num a => Num (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

(+) :: Const a b -> Const a b -> Const a b #

(-) :: Const a b -> Const a b -> Const a b #

(*) :: Const a b -> Const a b -> Const a b #

negate :: Const a b -> Const a b #

abs :: Const a b -> Const a b #

signum :: Const a b -> Const a b #

fromInteger :: Integer -> Const a b #

(Applicative f, Num a) => Num (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(+) :: Ap f a -> Ap f a -> Ap f a #

(-) :: Ap f a -> Ap f a -> Ap f a #

(*) :: Ap f a -> Ap f a -> Ap f a #

negate :: Ap f a -> Ap f a #

abs :: Ap f a -> Ap f a #

signum :: Ap f a -> Ap f a #

fromInteger :: Integer -> Ap f a #

Num (f a) => Num (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(+) :: Alt f a -> Alt f a -> Alt f a #

(-) :: Alt f a -> Alt f a -> Alt f a #

(*) :: Alt f a -> Alt f a -> Alt f a #

negate :: Alt f a -> Alt f a #

abs :: Alt f a -> Alt f a #

signum :: Alt f a -> Alt f a #

fromInteger :: Integer -> Alt f a #

Num a => Num (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(+) :: Tagged s a -> Tagged s a -> Tagged s a #

(-) :: Tagged s a -> Tagged s a -> Tagged s a #

(*) :: Tagged s a -> Tagged s a -> Tagged s a #

negate :: Tagged s a -> Tagged s a #

abs :: Tagged s a -> Tagged s a #

signum :: Tagged s a -> Tagged s a #

fromInteger :: Integer -> Tagged s a #

(Dim n, Num a) => Num (V n a) 
Instance details

Defined in Linear.V

Methods

(+) :: V n a -> V n a -> V n a #

(-) :: V n a -> V n a -> V n a #

(*) :: V n a -> V n a -> V n a #

negate :: V n a -> V n a #

abs :: V n a -> V n a #

signum :: V n a -> V n a #

fromInteger :: Integer -> V n a #

class Eq a => Ord a where #

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.

The Haskell Report defines no laws for Ord. However, <= is customarily + expected to implement a non-strict partial order and have the following + properties:

Transitivity
if x <= y && y <= z = True, then x <= z = True
Reflexivity
x <= x = True
Antisymmetry
if x <= y && y <= x = True, then x == y = True

Note that the following operator interactions are expected to hold:

  1. x >= y = y <= x
  2. x < y = x <= y && x /= y
  3. x > y = y < x
  4. x < y = compare x y == LT
  5. x > y = compare x y == GT
  6. x == y = compare x y == EQ
  7. min x y == if x <= y then x else y = True
  8. max x y == if x >= y then x else y = True

Minimal complete definition: either compare or <=. + Using compare can be more efficient for complex types.

Minimal complete definition

compare | (<=)

Methods

compare :: a -> a -> Ordering #

Instances
Ord Bool 
Instance details

Defined in GHC.Classes

Methods

compare :: Bool -> Bool -> Ordering #

(<) :: Bool -> Bool -> Bool #

(<=) :: Bool -> Bool -> Bool #

(>) :: Bool -> Bool -> Bool #

(>=) :: Bool -> Bool -> Bool #

max :: Bool -> Bool -> Bool #

min :: Bool -> Bool -> Bool #

Ord Char 
Instance details

Defined in GHC.Classes

Methods

compare :: Char -> Char -> Ordering #

(<) :: Char -> Char -> Bool #

(<=) :: Char -> Char -> Bool #

(>) :: Char -> Char -> Bool #

(>=) :: Char -> Char -> Bool #

max :: Char -> Char -> Char #

min :: Char -> Char -> Char #

Ord Double

Note that due to the presence of NaN, Double's Ord instance does not + satisfy reflexivity.

>>> 0/0 <= (0/0 :: Double)
+False
+

Also note that, due to the same, Ord's operator interactions are not + respected by Double's instance:

>>> (0/0 :: Double) > 1
+False
+>>> compare (0/0 :: Double) 1
+GT
+
Instance details

Defined in GHC.Classes

Methods

compare :: Double -> Double -> Ordering #

(<) :: Double -> Double -> Bool #

(<=) :: Double -> Double -> Bool #

(>) :: Double -> Double -> Bool #

(>=) :: Double -> Double -> Bool #

max :: Double -> Double -> Double #

min :: Double -> Double -> Double #

Ord Float

Note that due to the presence of NaN, Float's Ord instance does not + satisfy reflexivity.

>>> 0/0 <= (0/0 :: Float)
+False
+

Also note that, due to the same, Ord's operator interactions are not + respected by Float's instance:

>>> (0/0 :: Float) > 1
+False
+>>> compare (0/0 :: Float) 1
+GT
+
Instance details

Defined in GHC.Classes

Methods

compare :: Float -> Float -> Ordering #

(<) :: Float -> Float -> Bool #

(<=) :: Float -> Float -> Bool #

(>) :: Float -> Float -> Bool #

(>=) :: Float -> Float -> Bool #

max :: Float -> Float -> Float #

min :: Float -> Float -> Float #

Ord Int 
Instance details

Defined in GHC.Classes

Methods

compare :: Int -> Int -> Ordering #

(<) :: Int -> Int -> Bool #

(<=) :: Int -> Int -> Bool #

(>) :: Int -> Int -> Bool #

(>=) :: Int -> Int -> Bool #

max :: Int -> Int -> Int #

min :: Int -> Int -> Int #

Ord Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int8 -> Int8 -> Ordering #

(<) :: Int8 -> Int8 -> Bool #

(<=) :: Int8 -> Int8 -> Bool #

(>) :: Int8 -> Int8 -> Bool #

(>=) :: Int8 -> Int8 -> Bool #

max :: Int8 -> Int8 -> Int8 #

min :: Int8 -> Int8 -> Int8 #

Ord Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int16 -> Int16 -> Ordering #

(<) :: Int16 -> Int16 -> Bool #

(<=) :: Int16 -> Int16 -> Bool #

(>) :: Int16 -> Int16 -> Bool #

(>=) :: Int16 -> Int16 -> Bool #

max :: Int16 -> Int16 -> Int16 #

min :: Int16 -> Int16 -> Int16 #

Ord Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int32 -> Int32 -> Ordering #

(<) :: Int32 -> Int32 -> Bool #

(<=) :: Int32 -> Int32 -> Bool #

(>) :: Int32 -> Int32 -> Bool #

(>=) :: Int32 -> Int32 -> Bool #

max :: Int32 -> Int32 -> Int32 #

min :: Int32 -> Int32 -> Int32 #

Ord Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

compare :: Int64 -> Int64 -> Ordering #

(<) :: Int64 -> Int64 -> Bool #

(<=) :: Int64 -> Int64 -> Bool #

(>) :: Int64 -> Int64 -> Bool #

(>=) :: Int64 -> Int64 -> Bool #

max :: Int64 -> Int64 -> Int64 #

min :: Int64 -> Int64 -> Int64 #

Ord Integer 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: Integer -> Integer -> Ordering #

(<) :: Integer -> Integer -> Bool #

(<=) :: Integer -> Integer -> Bool #

(>) :: Integer -> Integer -> Bool #

(>=) :: Integer -> Integer -> Bool #

max :: Integer -> Integer -> Integer #

min :: Integer -> Integer -> Integer #

Ord Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Natural

Methods

compare :: Natural -> Natural -> Ordering #

(<) :: Natural -> Natural -> Bool #

(<=) :: Natural -> Natural -> Bool #

(>) :: Natural -> Natural -> Bool #

(>=) :: Natural -> Natural -> Bool #

max :: Natural -> Natural -> Natural #

min :: Natural -> Natural -> Natural #

Ord Ordering 
Instance details

Defined in GHC.Classes

Methods

compare :: Ordering -> Ordering -> Ordering #

(<) :: Ordering -> Ordering -> Bool #

(<=) :: Ordering -> Ordering -> Bool #

(>) :: Ordering -> Ordering -> Bool #

(>=) :: Ordering -> Ordering -> Bool #

max :: Ordering -> Ordering -> Ordering #

min :: Ordering -> Ordering -> Ordering #

Ord Word 
Instance details

Defined in GHC.Classes

Methods

compare :: Word -> Word -> Ordering #

(<) :: Word -> Word -> Bool #

(<=) :: Word -> Word -> Bool #

(>) :: Word -> Word -> Bool #

(>=) :: Word -> Word -> Bool #

max :: Word -> Word -> Word #

min :: Word -> Word -> Word #

Ord Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word8 -> Word8 -> Ordering #

(<) :: Word8 -> Word8 -> Bool #

(<=) :: Word8 -> Word8 -> Bool #

(>) :: Word8 -> Word8 -> Bool #

(>=) :: Word8 -> Word8 -> Bool #

max :: Word8 -> Word8 -> Word8 #

min :: Word8 -> Word8 -> Word8 #

Ord Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word16 -> Word16 -> Ordering #

(<) :: Word16 -> Word16 -> Bool #

(<=) :: Word16 -> Word16 -> Bool #

(>) :: Word16 -> Word16 -> Bool #

(>=) :: Word16 -> Word16 -> Bool #

max :: Word16 -> Word16 -> Word16 #

min :: Word16 -> Word16 -> Word16 #

Ord Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word32 -> Word32 -> Ordering #

(<) :: Word32 -> Word32 -> Bool #

(<=) :: Word32 -> Word32 -> Bool #

(>) :: Word32 -> Word32 -> Bool #

(>=) :: Word32 -> Word32 -> Bool #

max :: Word32 -> Word32 -> Word32 #

min :: Word32 -> Word32 -> Word32 #

Ord Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

compare :: Word64 -> Word64 -> Ordering #

(<) :: Word64 -> Word64 -> Bool #

(<=) :: Word64 -> Word64 -> Bool #

(>) :: Word64 -> Word64 -> Bool #

(>=) :: Word64 -> Word64 -> Bool #

max :: Word64 -> Word64 -> Word64 #

min :: Word64 -> Word64 -> Word64 #

Ord SomeTypeRep 
Instance details

Defined in Data.Typeable.Internal

Methods

compare :: SomeTypeRep -> SomeTypeRep -> Ordering #

(<) :: SomeTypeRep -> SomeTypeRep -> Bool #

(<=) :: SomeTypeRep -> SomeTypeRep -> Bool #

(>) :: SomeTypeRep -> SomeTypeRep -> Bool #

(>=) :: SomeTypeRep -> SomeTypeRep -> Bool #

max :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #

min :: SomeTypeRep -> SomeTypeRep -> SomeTypeRep #

Ord Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Exp -> Exp -> Ordering #

(<) :: Exp -> Exp -> Bool #

(<=) :: Exp -> Exp -> Bool #

(>) :: Exp -> Exp -> Bool #

(>=) :: Exp -> Exp -> Bool #

max :: Exp -> Exp -> Exp #

min :: Exp -> Exp -> Exp #

Ord Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Match -> Match -> Ordering #

(<) :: Match -> Match -> Bool #

(<=) :: Match -> Match -> Bool #

(>) :: Match -> Match -> Bool #

(>=) :: Match -> Match -> Bool #

max :: Match -> Match -> Match #

min :: Match -> Match -> Match #

Ord Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Clause -> Clause -> Ordering #

(<) :: Clause -> Clause -> Bool #

(<=) :: Clause -> Clause -> Bool #

(>) :: Clause -> Clause -> Bool #

(>=) :: Clause -> Clause -> Bool #

max :: Clause -> Clause -> Clause #

min :: Clause -> Clause -> Clause #

Ord Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Pat -> Pat -> Ordering #

(<) :: Pat -> Pat -> Bool #

(<=) :: Pat -> Pat -> Bool #

(>) :: Pat -> Pat -> Bool #

(>=) :: Pat -> Pat -> Bool #

max :: Pat -> Pat -> Pat #

min :: Pat -> Pat -> Pat #

Ord Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Ord Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Dec -> Dec -> Ordering #

(<) :: Dec -> Dec -> Bool #

(<=) :: Dec -> Dec -> Bool #

(>) :: Dec -> Dec -> Bool #

(>=) :: Dec -> Dec -> Bool #

max :: Dec -> Dec -> Dec #

min :: Dec -> Dec -> Dec #

Ord Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Name -> Name -> Ordering #

(<) :: Name -> Name -> Bool #

(<=) :: Name -> Name -> Bool #

(>) :: Name -> Name -> Bool #

(>=) :: Name -> Name -> Bool #

max :: Name -> Name -> Name #

min :: Name -> Name -> Name #

Ord FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FunDep -> FunDep -> Ordering #

(<) :: FunDep -> FunDep -> Bool #

(<=) :: FunDep -> FunDep -> Bool #

(>) :: FunDep -> FunDep -> Bool #

(>=) :: FunDep -> FunDep -> Bool #

max :: FunDep -> FunDep -> FunDep #

min :: FunDep -> FunDep -> FunDep #

Ord InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: InjectivityAnn -> InjectivityAnn -> Ordering #

(<) :: InjectivityAnn -> InjectivityAnn -> Bool #

(<=) :: InjectivityAnn -> InjectivityAnn -> Bool #

(>) :: InjectivityAnn -> InjectivityAnn -> Bool #

(>=) :: InjectivityAnn -> InjectivityAnn -> Bool #

max :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #

min :: InjectivityAnn -> InjectivityAnn -> InjectivityAnn #

Ord Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Overlap -> Overlap -> Ordering #

(<) :: Overlap -> Overlap -> Bool #

(<=) :: Overlap -> Overlap -> Bool #

(>) :: Overlap -> Overlap -> Bool #

(>=) :: Overlap -> Overlap -> Bool #

max :: Overlap -> Overlap -> Overlap #

min :: Overlap -> Overlap -> Overlap #

Ord () 
Instance details

Defined in GHC.Classes

Methods

compare :: () -> () -> Ordering #

(<) :: () -> () -> Bool #

(<=) :: () -> () -> Bool #

(>) :: () -> () -> Bool #

(>=) :: () -> () -> Bool #

max :: () -> () -> () #

min :: () -> () -> () #

Ord TyCon 
Instance details

Defined in GHC.Classes

Methods

compare :: TyCon -> TyCon -> Ordering #

(<) :: TyCon -> TyCon -> Bool #

(<=) :: TyCon -> TyCon -> Bool #

(>) :: TyCon -> TyCon -> Bool #

(>=) :: TyCon -> TyCon -> Bool #

max :: TyCon -> TyCon -> TyCon #

min :: TyCon -> TyCon -> TyCon #

Ord ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

compare :: ByteString -> ByteString -> Ordering #

(<) :: ByteString -> ByteString -> Bool #

(<=) :: ByteString -> ByteString -> Bool #

(>) :: ByteString -> ByteString -> Bool #

(>=) :: ByteString -> ByteString -> Bool #

max :: ByteString -> ByteString -> ByteString #

min :: ByteString -> ByteString -> ByteString #

Ord PixelYA8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYA8 -> PixelYA8 -> Ordering #

(<) :: PixelYA8 -> PixelYA8 -> Bool #

(<=) :: PixelYA8 -> PixelYA8 -> Bool #

(>) :: PixelYA8 -> PixelYA8 -> Bool #

(>=) :: PixelYA8 -> PixelYA8 -> Bool #

max :: PixelYA8 -> PixelYA8 -> PixelYA8 #

min :: PixelYA8 -> PixelYA8 -> PixelYA8 #

Ord PixelYA16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYA16 -> PixelYA16 -> Ordering #

(<) :: PixelYA16 -> PixelYA16 -> Bool #

(<=) :: PixelYA16 -> PixelYA16 -> Bool #

(>) :: PixelYA16 -> PixelYA16 -> Bool #

(>=) :: PixelYA16 -> PixelYA16 -> Bool #

max :: PixelYA16 -> PixelYA16 -> PixelYA16 #

min :: PixelYA16 -> PixelYA16 -> PixelYA16 #

Ord PixelRGB8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGB8 -> PixelRGB8 -> Ordering #

(<) :: PixelRGB8 -> PixelRGB8 -> Bool #

(<=) :: PixelRGB8 -> PixelRGB8 -> Bool #

(>) :: PixelRGB8 -> PixelRGB8 -> Bool #

(>=) :: PixelRGB8 -> PixelRGB8 -> Bool #

max :: PixelRGB8 -> PixelRGB8 -> PixelRGB8 #

min :: PixelRGB8 -> PixelRGB8 -> PixelRGB8 #

Ord PixelYCbCrK8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYCbCrK8 -> PixelYCbCrK8 -> Ordering #

(<) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(<=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(>) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

(>=) :: PixelYCbCrK8 -> PixelYCbCrK8 -> Bool #

max :: PixelYCbCrK8 -> PixelYCbCrK8 -> PixelYCbCrK8 #

min :: PixelYCbCrK8 -> PixelYCbCrK8 -> PixelYCbCrK8 #

Ord PixelRGB16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGB16 -> PixelRGB16 -> Ordering #

(<) :: PixelRGB16 -> PixelRGB16 -> Bool #

(<=) :: PixelRGB16 -> PixelRGB16 -> Bool #

(>) :: PixelRGB16 -> PixelRGB16 -> Bool #

(>=) :: PixelRGB16 -> PixelRGB16 -> Bool #

max :: PixelRGB16 -> PixelRGB16 -> PixelRGB16 #

min :: PixelRGB16 -> PixelRGB16 -> PixelRGB16 #

Ord PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBF -> PixelRGBF -> Ordering #

(<) :: PixelRGBF -> PixelRGBF -> Bool #

(<=) :: PixelRGBF -> PixelRGBF -> Bool #

(>) :: PixelRGBF -> PixelRGBF -> Bool #

(>=) :: PixelRGBF -> PixelRGBF -> Bool #

max :: PixelRGBF -> PixelRGBF -> PixelRGBF #

min :: PixelRGBF -> PixelRGBF -> PixelRGBF #

Ord PixelYCbCr8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelYCbCr8 -> PixelYCbCr8 -> Ordering #

(<) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(<=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(>) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

(>=) :: PixelYCbCr8 -> PixelYCbCr8 -> Bool #

max :: PixelYCbCr8 -> PixelYCbCr8 -> PixelYCbCr8 #

min :: PixelYCbCr8 -> PixelYCbCr8 -> PixelYCbCr8 #

Ord PixelCMYK8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelCMYK8 -> PixelCMYK8 -> Ordering #

(<) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(<=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(>) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

(>=) :: PixelCMYK8 -> PixelCMYK8 -> Bool #

max :: PixelCMYK8 -> PixelCMYK8 -> PixelCMYK8 #

min :: PixelCMYK8 -> PixelCMYK8 -> PixelCMYK8 #

Ord PixelCMYK16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelCMYK16 -> PixelCMYK16 -> Ordering #

(<) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(<=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(>) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

(>=) :: PixelCMYK16 -> PixelCMYK16 -> Bool #

max :: PixelCMYK16 -> PixelCMYK16 -> PixelCMYK16 #

min :: PixelCMYK16 -> PixelCMYK16 -> PixelCMYK16 #

Ord PixelRGBA8 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBA8 -> PixelRGBA8 -> Ordering #

(<) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(<=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(>) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

(>=) :: PixelRGBA8 -> PixelRGBA8 -> Bool #

max :: PixelRGBA8 -> PixelRGBA8 -> PixelRGBA8 #

min :: PixelRGBA8 -> PixelRGBA8 -> PixelRGBA8 #

Ord PixelRGBA16 
Instance details

Defined in Codec.Picture.Types

Methods

compare :: PixelRGBA16 -> PixelRGBA16 -> Ordering #

(<) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(<=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(>) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

(>=) :: PixelRGBA16 -> PixelRGBA16 -> Bool #

max :: PixelRGBA16 -> PixelRGBA16 -> PixelRGBA16 #

min :: PixelRGBA16 -> PixelRGBA16 -> PixelRGBA16 #

Ord Fd 
Instance details

Defined in System.Posix.Types

Methods

compare :: Fd -> Fd -> Ordering #

(<) :: Fd -> Fd -> Bool #

(<=) :: Fd -> Fd -> Bool #

(>) :: Fd -> Fd -> Bool #

(>=) :: Fd -> Fd -> Bool #

max :: Fd -> Fd -> Fd #

min :: Fd -> Fd -> Fd #

Ord CTimer 
Instance details

Defined in System.Posix.Types

Methods

compare :: CTimer -> CTimer -> Ordering #

(<) :: CTimer -> CTimer -> Bool #

(<=) :: CTimer -> CTimer -> Bool #

(>) :: CTimer -> CTimer -> Bool #

(>=) :: CTimer -> CTimer -> Bool #

max :: CTimer -> CTimer -> CTimer #

min :: CTimer -> CTimer -> CTimer #

Ord CKey 
Instance details

Defined in System.Posix.Types

Methods

compare :: CKey -> CKey -> Ordering #

(<) :: CKey -> CKey -> Bool #

(<=) :: CKey -> CKey -> Bool #

(>) :: CKey -> CKey -> Bool #

(>=) :: CKey -> CKey -> Bool #

max :: CKey -> CKey -> CKey #

min :: CKey -> CKey -> CKey #

Ord CId 
Instance details

Defined in System.Posix.Types

Methods

compare :: CId -> CId -> Ordering #

(<) :: CId -> CId -> Bool #

(<=) :: CId -> CId -> Bool #

(>) :: CId -> CId -> Bool #

(>=) :: CId -> CId -> Bool #

max :: CId -> CId -> CId #

min :: CId -> CId -> CId #

Ord CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

compare :: CFsFilCnt -> CFsFilCnt -> Ordering #

(<) :: CFsFilCnt -> CFsFilCnt -> Bool #

(<=) :: CFsFilCnt -> CFsFilCnt -> Bool #

(>) :: CFsFilCnt -> CFsFilCnt -> Bool #

(>=) :: CFsFilCnt -> CFsFilCnt -> Bool #

max :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

min :: CFsFilCnt -> CFsFilCnt -> CFsFilCnt #

Ord CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

compare :: CFsBlkCnt -> CFsBlkCnt -> Ordering #

(<) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

(<=) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

(>) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

(>=) :: CFsBlkCnt -> CFsBlkCnt -> Bool #

max :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

min :: CFsBlkCnt -> CFsBlkCnt -> CFsBlkCnt #

Ord CClockId 
Instance details

Defined in System.Posix.Types

Methods

compare :: CClockId -> CClockId -> Ordering #

(<) :: CClockId -> CClockId -> Bool #

(<=) :: CClockId -> CClockId -> Bool #

(>) :: CClockId -> CClockId -> Bool #

(>=) :: CClockId -> CClockId -> Bool #

max :: CClockId -> CClockId -> CClockId #

min :: CClockId -> CClockId -> CClockId #

Ord CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

compare :: CBlkCnt -> CBlkCnt -> Ordering #

(<) :: CBlkCnt -> CBlkCnt -> Bool #

(<=) :: CBlkCnt -> CBlkCnt -> Bool #

(>) :: CBlkCnt -> CBlkCnt -> Bool #

(>=) :: CBlkCnt -> CBlkCnt -> Bool #

max :: CBlkCnt -> CBlkCnt -> CBlkCnt #

min :: CBlkCnt -> CBlkCnt -> CBlkCnt #

Ord CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

compare :: CBlkSize -> CBlkSize -> Ordering #

(<) :: CBlkSize -> CBlkSize -> Bool #

(<=) :: CBlkSize -> CBlkSize -> Bool #

(>) :: CBlkSize -> CBlkSize -> Bool #

(>=) :: CBlkSize -> CBlkSize -> Bool #

max :: CBlkSize -> CBlkSize -> CBlkSize #

min :: CBlkSize -> CBlkSize -> CBlkSize #

Ord CRLim 
Instance details

Defined in System.Posix.Types

Methods

compare :: CRLim -> CRLim -> Ordering #

(<) :: CRLim -> CRLim -> Bool #

(<=) :: CRLim -> CRLim -> Bool #

(>) :: CRLim -> CRLim -> Bool #

(>=) :: CRLim -> CRLim -> Bool #

max :: CRLim -> CRLim -> CRLim #

min :: CRLim -> CRLim -> CRLim #

Ord CTcflag 
Instance details

Defined in System.Posix.Types

Methods

compare :: CTcflag -> CTcflag -> Ordering #

(<) :: CTcflag -> CTcflag -> Bool #

(<=) :: CTcflag -> CTcflag -> Bool #

(>) :: CTcflag -> CTcflag -> Bool #

(>=) :: CTcflag -> CTcflag -> Bool #

max :: CTcflag -> CTcflag -> CTcflag #

min :: CTcflag -> CTcflag -> CTcflag #

Ord CSpeed 
Instance details

Defined in System.Posix.Types

Methods

compare :: CSpeed -> CSpeed -> Ordering #

(<) :: CSpeed -> CSpeed -> Bool #

(<=) :: CSpeed -> CSpeed -> Bool #

(>) :: CSpeed -> CSpeed -> Bool #

(>=) :: CSpeed -> CSpeed -> Bool #

max :: CSpeed -> CSpeed -> CSpeed #

min :: CSpeed -> CSpeed -> CSpeed #

Ord CCc 
Instance details

Defined in System.Posix.Types

Methods

compare :: CCc -> CCc -> Ordering #

(<) :: CCc -> CCc -> Bool #

(<=) :: CCc -> CCc -> Bool #

(>) :: CCc -> CCc -> Bool #

(>=) :: CCc -> CCc -> Bool #

max :: CCc -> CCc -> CCc #

min :: CCc -> CCc -> CCc #

Ord CUid 
Instance details

Defined in System.Posix.Types

Methods

compare :: CUid -> CUid -> Ordering #

(<) :: CUid -> CUid -> Bool #

(<=) :: CUid -> CUid -> Bool #

(>) :: CUid -> CUid -> Bool #

(>=) :: CUid -> CUid -> Bool #

max :: CUid -> CUid -> CUid #

min :: CUid -> CUid -> CUid #

Ord CNlink 
Instance details

Defined in System.Posix.Types

Methods

compare :: CNlink -> CNlink -> Ordering #

(<) :: CNlink -> CNlink -> Bool #

(<=) :: CNlink -> CNlink -> Bool #

(>) :: CNlink -> CNlink -> Bool #

(>=) :: CNlink -> CNlink -> Bool #

max :: CNlink -> CNlink -> CNlink #

min :: CNlink -> CNlink -> CNlink #

Ord CGid 
Instance details

Defined in System.Posix.Types

Methods

compare :: CGid -> CGid -> Ordering #

(<) :: CGid -> CGid -> Bool #

(<=) :: CGid -> CGid -> Bool #

(>) :: CGid -> CGid -> Bool #

(>=) :: CGid -> CGid -> Bool #

max :: CGid -> CGid -> CGid #

min :: CGid -> CGid -> CGid #

Ord CSsize 
Instance details

Defined in System.Posix.Types

Methods

compare :: CSsize -> CSsize -> Ordering #

(<) :: CSsize -> CSsize -> Bool #

(<=) :: CSsize -> CSsize -> Bool #

(>) :: CSsize -> CSsize -> Bool #

(>=) :: CSsize -> CSsize -> Bool #

max :: CSsize -> CSsize -> CSsize #

min :: CSsize -> CSsize -> CSsize #

Ord CPid 
Instance details

Defined in System.Posix.Types

Methods

compare :: CPid -> CPid -> Ordering #

(<) :: CPid -> CPid -> Bool #

(<=) :: CPid -> CPid -> Bool #

(>) :: CPid -> CPid -> Bool #

(>=) :: CPid -> CPid -> Bool #

max :: CPid -> CPid -> CPid #

min :: CPid -> CPid -> CPid #

Ord COff 
Instance details

Defined in System.Posix.Types

Methods

compare :: COff -> COff -> Ordering #

(<) :: COff -> COff -> Bool #

(<=) :: COff -> COff -> Bool #

(>) :: COff -> COff -> Bool #

(>=) :: COff -> COff -> Bool #

max :: COff -> COff -> COff #

min :: COff -> COff -> COff #

Ord CMode 
Instance details

Defined in System.Posix.Types

Methods

compare :: CMode -> CMode -> Ordering #

(<) :: CMode -> CMode -> Bool #

(<=) :: CMode -> CMode -> Bool #

(>) :: CMode -> CMode -> Bool #

(>=) :: CMode -> CMode -> Bool #

max :: CMode -> CMode -> CMode #

min :: CMode -> CMode -> CMode #

Ord CIno 
Instance details

Defined in System.Posix.Types

Methods

compare :: CIno -> CIno -> Ordering #

(<) :: CIno -> CIno -> Bool #

(<=) :: CIno -> CIno -> Bool #

(>) :: CIno -> CIno -> Bool #

(>=) :: CIno -> CIno -> Bool #

max :: CIno -> CIno -> CIno #

min :: CIno -> CIno -> CIno #

Ord CDev 
Instance details

Defined in System.Posix.Types

Methods

compare :: CDev -> CDev -> Ordering #

(<) :: CDev -> CDev -> Bool #

(<=) :: CDev -> CDev -> Bool #

(>) :: CDev -> CDev -> Bool #

(>=) :: CDev -> CDev -> Bool #

max :: CDev -> CDev -> CDev #

min :: CDev -> CDev -> CDev #

Ord IOMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.IOMode

Methods

compare :: IOMode -> IOMode -> Ordering #

(<) :: IOMode -> IOMode -> Bool #

(<=) :: IOMode -> IOMode -> Bool #

(>) :: IOMode -> IOMode -> Bool #

(>=) :: IOMode -> IOMode -> Bool #

max :: IOMode -> IOMode -> IOMode #

min :: IOMode -> IOMode -> IOMode #

Ord Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Con -> Con -> Ordering #

(<) :: Con -> Con -> Bool #

(<=) :: Con -> Con -> Bool #

(>) :: Con -> Con -> Bool #

(>=) :: Con -> Con -> Bool #

max :: Con -> Con -> Con #

min :: Con -> Con -> Con #

Ord ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

compare :: ByteString -> ByteString -> Ordering #

(<) :: ByteString -> ByteString -> Bool #

(<=) :: ByteString -> ByteString -> Bool #

(>) :: ByteString -> ByteString -> Bool #

(>=) :: ByteString -> ByteString -> Bool #

max :: ByteString -> ByteString -> ByteString #

min :: ByteString -> ByteString -> ByteString #

Ord Scientific

Scientific numbers can be safely compared for ordering. No magnitude 10^e + is calculated so there's no risk of a blowup in space or time when comparing + scientific numbers coming from untrusted sources.

Instance details

Defined in Data.Scientific

Methods

compare :: Scientific -> Scientific -> Ordering #

(<) :: Scientific -> Scientific -> Bool #

(<=) :: Scientific -> Scientific -> Bool #

(>) :: Scientific -> Scientific -> Bool #

(>=) :: Scientific -> Scientific -> Bool #

max :: Scientific -> Scientific -> Scientific #

min :: Scientific -> Scientific -> Scientific #

Ord UTCTime 
Instance details

Defined in Data.Time.Clock.Internal.UTCTime

Methods

compare :: UTCTime -> UTCTime -> Ordering #

(<) :: UTCTime -> UTCTime -> Bool #

(<=) :: UTCTime -> UTCTime -> Bool #

(>) :: UTCTime -> UTCTime -> Bool #

(>=) :: UTCTime -> UTCTime -> Bool #

max :: UTCTime -> UTCTime -> UTCTime #

min :: UTCTime -> UTCTime -> UTCTime #

Ord JSONPathElement 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: JSONPathElement -> JSONPathElement -> Ordering #

(<) :: JSONPathElement -> JSONPathElement -> Bool #

(<=) :: JSONPathElement -> JSONPathElement -> Bool #

(>) :: JSONPathElement -> JSONPathElement -> Bool #

(>=) :: JSONPathElement -> JSONPathElement -> Bool #

max :: JSONPathElement -> JSONPathElement -> JSONPathElement #

min :: JSONPathElement -> JSONPathElement -> JSONPathElement #

Ord DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

compare :: DotNetTime -> DotNetTime -> Ordering #

(<) :: DotNetTime -> DotNetTime -> Bool #

(<=) :: DotNetTime -> DotNetTime -> Bool #

(>) :: DotNetTime -> DotNetTime -> Bool #

(>=) :: DotNetTime -> DotNetTime -> Bool #

max :: DotNetTime -> DotNetTime -> DotNetTime #

min :: DotNetTime -> DotNetTime -> DotNetTime #

Ord Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

compare :: Pos -> Pos -> Ordering #

(<) :: Pos -> Pos -> Bool #

(<=) :: Pos -> Pos -> Bool #

(>) :: Pos -> Pos -> Bool #

(>=) :: Pos -> Pos -> Bool #

max :: Pos -> Pos -> Pos #

min :: Pos -> Pos -> Pos #

Ord BigNat 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: BigNat -> BigNat -> Ordering #

(<) :: BigNat -> BigNat -> Bool #

(<=) :: BigNat -> BigNat -> Bool #

(>) :: BigNat -> BigNat -> Bool #

(>=) :: BigNat -> BigNat -> Bool #

max :: BigNat -> BigNat -> BigNat #

min :: BigNat -> BigNat -> BigNat #

Ord Void

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

compare :: Void -> Void -> Ordering #

(<) :: Void -> Void -> Bool #

(<=) :: Void -> Void -> Bool #

(>) :: Void -> Void -> Bool #

(>=) :: Void -> Void -> Bool #

max :: Void -> Void -> Void #

min :: Void -> Void -> Void #

Ord Version

Since: base-2.1

Instance details

Defined in Data.Version

Methods

compare :: Version -> Version -> Ordering #

(<) :: Version -> Version -> Bool #

(<=) :: Version -> Version -> Bool #

(>) :: Version -> Version -> Bool #

(>=) :: Version -> Version -> Bool #

max :: Version -> Version -> Version #

min :: Version -> Version -> Version #

Ord AsyncException

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Exception

Methods

compare :: AsyncException -> AsyncException -> Ordering #

(<) :: AsyncException -> AsyncException -> Bool #

(<=) :: AsyncException -> AsyncException -> Bool #

(>) :: AsyncException -> AsyncException -> Bool #

(>=) :: AsyncException -> AsyncException -> Bool #

max :: AsyncException -> AsyncException -> AsyncException #

min :: AsyncException -> AsyncException -> AsyncException #

Ord ArrayException

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Exception

Methods

compare :: ArrayException -> ArrayException -> Ordering #

(<) :: ArrayException -> ArrayException -> Bool #

(<=) :: ArrayException -> ArrayException -> Bool #

(>) :: ArrayException -> ArrayException -> Bool #

(>=) :: ArrayException -> ArrayException -> Bool #

max :: ArrayException -> ArrayException -> ArrayException #

min :: ArrayException -> ArrayException -> ArrayException #

Ord ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

compare :: ExitCode -> ExitCode -> Ordering #

(<) :: ExitCode -> ExitCode -> Bool #

(<=) :: ExitCode -> ExitCode -> Bool #

(>) :: ExitCode -> ExitCode -> Bool #

(>=) :: ExitCode -> ExitCode -> Bool #

max :: ExitCode -> ExitCode -> ExitCode #

min :: ExitCode -> ExitCode -> ExitCode #

Ord BufferMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: BufferMode -> BufferMode -> Ordering #

(<) :: BufferMode -> BufferMode -> Bool #

(<=) :: BufferMode -> BufferMode -> Bool #

(>) :: BufferMode -> BufferMode -> Bool #

(>=) :: BufferMode -> BufferMode -> Bool #

max :: BufferMode -> BufferMode -> BufferMode #

min :: BufferMode -> BufferMode -> BufferMode #

Ord Newline

Since: base-4.3.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: Newline -> Newline -> Ordering #

(<) :: Newline -> Newline -> Bool #

(<=) :: Newline -> Newline -> Bool #

(>) :: Newline -> Newline -> Bool #

(>=) :: Newline -> Newline -> Bool #

max :: Newline -> Newline -> Newline #

min :: Newline -> Newline -> Newline #

Ord NewlineMode

Since: base-4.3.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

compare :: NewlineMode -> NewlineMode -> Ordering #

(<) :: NewlineMode -> NewlineMode -> Bool #

(<=) :: NewlineMode -> NewlineMode -> Bool #

(>) :: NewlineMode -> NewlineMode -> Bool #

(>=) :: NewlineMode -> NewlineMode -> Bool #

max :: NewlineMode -> NewlineMode -> NewlineMode #

min :: NewlineMode -> NewlineMode -> NewlineMode #

Ord SeekMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Device

Methods

compare :: SeekMode -> SeekMode -> Ordering #

(<) :: SeekMode -> SeekMode -> Bool #

(<=) :: SeekMode -> SeekMode -> Bool #

(>) :: SeekMode -> SeekMode -> Bool #

(>=) :: SeekMode -> SeekMode -> Bool #

max :: SeekMode -> SeekMode -> SeekMode #

min :: SeekMode -> SeekMode -> SeekMode #

Ord ErrorCall

Since: base-4.7.0.0

Instance details

Defined in GHC.Exception

Methods

compare :: ErrorCall -> ErrorCall -> Ordering #

(<) :: ErrorCall -> ErrorCall -> Bool #

(<=) :: ErrorCall -> ErrorCall -> Bool #

(>) :: ErrorCall -> ErrorCall -> Bool #

(>=) :: ErrorCall -> ErrorCall -> Bool #

max :: ErrorCall -> ErrorCall -> ErrorCall #

min :: ErrorCall -> ErrorCall -> ErrorCall #

Ord ArithException

Since: base-3.0

Instance details

Defined in GHC.Exception.Type

Methods

compare :: ArithException -> ArithException -> Ordering #

(<) :: ArithException -> ArithException -> Bool #

(<=) :: ArithException -> ArithException -> Bool #

(>) :: ArithException -> ArithException -> Bool #

(>=) :: ArithException -> ArithException -> Bool #

max :: ArithException -> ArithException -> ArithException #

min :: ArithException -> ArithException -> ArithException #

Ord All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: All -> All -> Ordering #

(<) :: All -> All -> Bool #

(<=) :: All -> All -> Bool #

(>) :: All -> All -> Bool #

(>=) :: All -> All -> Bool #

max :: All -> All -> All #

min :: All -> All -> All #

Ord Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Any -> Any -> Ordering #

(<) :: Any -> Any -> Bool #

(<=) :: Any -> Any -> Bool #

(>) :: Any -> Any -> Bool #

(>=) :: Any -> Any -> Bool #

max :: Any -> Any -> Any #

min :: Any -> Any -> Any #

Ord Fixity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: Fixity -> Fixity -> Ordering #

(<) :: Fixity -> Fixity -> Bool #

(<=) :: Fixity -> Fixity -> Bool #

(>) :: Fixity -> Fixity -> Bool #

(>=) :: Fixity -> Fixity -> Bool #

max :: Fixity -> Fixity -> Fixity #

min :: Fixity -> Fixity -> Fixity #

Ord Associativity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: Associativity -> Associativity -> Ordering #

(<) :: Associativity -> Associativity -> Bool #

(<=) :: Associativity -> Associativity -> Bool #

(>) :: Associativity -> Associativity -> Bool #

(>=) :: Associativity -> Associativity -> Bool #

max :: Associativity -> Associativity -> Associativity #

min :: Associativity -> Associativity -> Associativity #

Ord SourceUnpackedness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

Ord SourceStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering #

(<) :: SourceStrictness -> SourceStrictness -> Bool #

(<=) :: SourceStrictness -> SourceStrictness -> Bool #

(>) :: SourceStrictness -> SourceStrictness -> Bool #

(>=) :: SourceStrictness -> SourceStrictness -> Bool #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness #

Ord DecidedStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

Ord SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

compare :: SomeNat -> SomeNat -> Ordering #

(<) :: SomeNat -> SomeNat -> Bool #

(<=) :: SomeNat -> SomeNat -> Bool #

(>) :: SomeNat -> SomeNat -> Bool #

(>=) :: SomeNat -> SomeNat -> Bool #

max :: SomeNat -> SomeNat -> SomeNat #

min :: SomeNat -> SomeNat -> SomeNat #

Ord CChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CChar -> CChar -> Ordering #

(<) :: CChar -> CChar -> Bool #

(<=) :: CChar -> CChar -> Bool #

(>) :: CChar -> CChar -> Bool #

(>=) :: CChar -> CChar -> Bool #

max :: CChar -> CChar -> CChar #

min :: CChar -> CChar -> CChar #

Ord CSChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSChar -> CSChar -> Ordering #

(<) :: CSChar -> CSChar -> Bool #

(<=) :: CSChar -> CSChar -> Bool #

(>) :: CSChar -> CSChar -> Bool #

(>=) :: CSChar -> CSChar -> Bool #

max :: CSChar -> CSChar -> CSChar #

min :: CSChar -> CSChar -> CSChar #

Ord CUChar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUChar -> CUChar -> Ordering #

(<) :: CUChar -> CUChar -> Bool #

(<=) :: CUChar -> CUChar -> Bool #

(>) :: CUChar -> CUChar -> Bool #

(>=) :: CUChar -> CUChar -> Bool #

max :: CUChar -> CUChar -> CUChar #

min :: CUChar -> CUChar -> CUChar #

Ord CShort 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CShort -> CShort -> Ordering #

(<) :: CShort -> CShort -> Bool #

(<=) :: CShort -> CShort -> Bool #

(>) :: CShort -> CShort -> Bool #

(>=) :: CShort -> CShort -> Bool #

max :: CShort -> CShort -> CShort #

min :: CShort -> CShort -> CShort #

Ord CUShort 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUShort -> CUShort -> Ordering #

(<) :: CUShort -> CUShort -> Bool #

(<=) :: CUShort -> CUShort -> Bool #

(>) :: CUShort -> CUShort -> Bool #

(>=) :: CUShort -> CUShort -> Bool #

max :: CUShort -> CUShort -> CUShort #

min :: CUShort -> CUShort -> CUShort #

Ord CInt 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CInt -> CInt -> Ordering #

(<) :: CInt -> CInt -> Bool #

(<=) :: CInt -> CInt -> Bool #

(>) :: CInt -> CInt -> Bool #

(>=) :: CInt -> CInt -> Bool #

max :: CInt -> CInt -> CInt #

min :: CInt -> CInt -> CInt #

Ord CUInt 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUInt -> CUInt -> Ordering #

(<) :: CUInt -> CUInt -> Bool #

(<=) :: CUInt -> CUInt -> Bool #

(>) :: CUInt -> CUInt -> Bool #

(>=) :: CUInt -> CUInt -> Bool #

max :: CUInt -> CUInt -> CUInt #

min :: CUInt -> CUInt -> CUInt #

Ord CLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CLong -> CLong -> Ordering #

(<) :: CLong -> CLong -> Bool #

(<=) :: CLong -> CLong -> Bool #

(>) :: CLong -> CLong -> Bool #

(>=) :: CLong -> CLong -> Bool #

max :: CLong -> CLong -> CLong #

min :: CLong -> CLong -> CLong #

Ord CULong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CULong -> CULong -> Ordering #

(<) :: CULong -> CULong -> Bool #

(<=) :: CULong -> CULong -> Bool #

(>) :: CULong -> CULong -> Bool #

(>=) :: CULong -> CULong -> Bool #

max :: CULong -> CULong -> CULong #

min :: CULong -> CULong -> CULong #

Ord CLLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CLLong -> CLLong -> Ordering #

(<) :: CLLong -> CLLong -> Bool #

(<=) :: CLLong -> CLLong -> Bool #

(>) :: CLLong -> CLLong -> Bool #

(>=) :: CLLong -> CLLong -> Bool #

max :: CLLong -> CLLong -> CLLong #

min :: CLLong -> CLLong -> CLLong #

Ord CULLong 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CULLong -> CULLong -> Ordering #

(<) :: CULLong -> CULLong -> Bool #

(<=) :: CULLong -> CULLong -> Bool #

(>) :: CULLong -> CULLong -> Bool #

(>=) :: CULLong -> CULLong -> Bool #

max :: CULLong -> CULLong -> CULLong #

min :: CULLong -> CULLong -> CULLong #

Ord CBool 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CBool -> CBool -> Ordering #

(<) :: CBool -> CBool -> Bool #

(<=) :: CBool -> CBool -> Bool #

(>) :: CBool -> CBool -> Bool #

(>=) :: CBool -> CBool -> Bool #

max :: CBool -> CBool -> CBool #

min :: CBool -> CBool -> CBool #

Ord CFloat 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CFloat -> CFloat -> Ordering #

(<) :: CFloat -> CFloat -> Bool #

(<=) :: CFloat -> CFloat -> Bool #

(>) :: CFloat -> CFloat -> Bool #

(>=) :: CFloat -> CFloat -> Bool #

max :: CFloat -> CFloat -> CFloat #

min :: CFloat -> CFloat -> CFloat #

Ord CDouble 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CDouble -> CDouble -> Ordering #

(<) :: CDouble -> CDouble -> Bool #

(<=) :: CDouble -> CDouble -> Bool #

(>) :: CDouble -> CDouble -> Bool #

(>=) :: CDouble -> CDouble -> Bool #

max :: CDouble -> CDouble -> CDouble #

min :: CDouble -> CDouble -> CDouble #

Ord CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CPtrdiff -> CPtrdiff -> Ordering #

(<) :: CPtrdiff -> CPtrdiff -> Bool #

(<=) :: CPtrdiff -> CPtrdiff -> Bool #

(>) :: CPtrdiff -> CPtrdiff -> Bool #

(>=) :: CPtrdiff -> CPtrdiff -> Bool #

max :: CPtrdiff -> CPtrdiff -> CPtrdiff #

min :: CPtrdiff -> CPtrdiff -> CPtrdiff #

Ord CSize 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSize -> CSize -> Ordering #

(<) :: CSize -> CSize -> Bool #

(<=) :: CSize -> CSize -> Bool #

(>) :: CSize -> CSize -> Bool #

(>=) :: CSize -> CSize -> Bool #

max :: CSize -> CSize -> CSize #

min :: CSize -> CSize -> CSize #

Ord CWchar 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CWchar -> CWchar -> Ordering #

(<) :: CWchar -> CWchar -> Bool #

(<=) :: CWchar -> CWchar -> Bool #

(>) :: CWchar -> CWchar -> Bool #

(>=) :: CWchar -> CWchar -> Bool #

max :: CWchar -> CWchar -> CWchar #

min :: CWchar -> CWchar -> CWchar #

Ord CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSigAtomic -> CSigAtomic -> Ordering #

(<) :: CSigAtomic -> CSigAtomic -> Bool #

(<=) :: CSigAtomic -> CSigAtomic -> Bool #

(>) :: CSigAtomic -> CSigAtomic -> Bool #

(>=) :: CSigAtomic -> CSigAtomic -> Bool #

max :: CSigAtomic -> CSigAtomic -> CSigAtomic #

min :: CSigAtomic -> CSigAtomic -> CSigAtomic #

Ord CClock 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CClock -> CClock -> Ordering #

(<) :: CClock -> CClock -> Bool #

(<=) :: CClock -> CClock -> Bool #

(>) :: CClock -> CClock -> Bool #

(>=) :: CClock -> CClock -> Bool #

max :: CClock -> CClock -> CClock #

min :: CClock -> CClock -> CClock #

Ord CTime 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CTime -> CTime -> Ordering #

(<) :: CTime -> CTime -> Bool #

(<=) :: CTime -> CTime -> Bool #

(>) :: CTime -> CTime -> Bool #

(>=) :: CTime -> CTime -> Bool #

max :: CTime -> CTime -> CTime #

min :: CTime -> CTime -> CTime #

Ord CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUSeconds -> CUSeconds -> Ordering #

(<) :: CUSeconds -> CUSeconds -> Bool #

(<=) :: CUSeconds -> CUSeconds -> Bool #

(>) :: CUSeconds -> CUSeconds -> Bool #

(>=) :: CUSeconds -> CUSeconds -> Bool #

max :: CUSeconds -> CUSeconds -> CUSeconds #

min :: CUSeconds -> CUSeconds -> CUSeconds #

Ord CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CSUSeconds -> CSUSeconds -> Ordering #

(<) :: CSUSeconds -> CSUSeconds -> Bool #

(<=) :: CSUSeconds -> CSUSeconds -> Bool #

(>) :: CSUSeconds -> CSUSeconds -> Bool #

(>=) :: CSUSeconds -> CSUSeconds -> Bool #

max :: CSUSeconds -> CSUSeconds -> CSUSeconds #

min :: CSUSeconds -> CSUSeconds -> CSUSeconds #

Ord CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CIntPtr -> CIntPtr -> Ordering #

(<) :: CIntPtr -> CIntPtr -> Bool #

(<=) :: CIntPtr -> CIntPtr -> Bool #

(>) :: CIntPtr -> CIntPtr -> Bool #

(>=) :: CIntPtr -> CIntPtr -> Bool #

max :: CIntPtr -> CIntPtr -> CIntPtr #

min :: CIntPtr -> CIntPtr -> CIntPtr #

Ord CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUIntPtr -> CUIntPtr -> Ordering #

(<) :: CUIntPtr -> CUIntPtr -> Bool #

(<=) :: CUIntPtr -> CUIntPtr -> Bool #

(>) :: CUIntPtr -> CUIntPtr -> Bool #

(>=) :: CUIntPtr -> CUIntPtr -> Bool #

max :: CUIntPtr -> CUIntPtr -> CUIntPtr #

min :: CUIntPtr -> CUIntPtr -> CUIntPtr #

Ord CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CIntMax -> CIntMax -> Ordering #

(<) :: CIntMax -> CIntMax -> Bool #

(<=) :: CIntMax -> CIntMax -> Bool #

(>) :: CIntMax -> CIntMax -> Bool #

(>=) :: CIntMax -> CIntMax -> Bool #

max :: CIntMax -> CIntMax -> CIntMax #

min :: CIntMax -> CIntMax -> CIntMax #

Ord CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

compare :: CUIntMax -> CUIntMax -> Ordering #

(<) :: CUIntMax -> CUIntMax -> Bool #

(<=) :: CUIntMax -> CUIntMax -> Bool #

(>) :: CUIntMax -> CUIntMax -> Bool #

(>=) :: CUIntMax -> CUIntMax -> Bool #

max :: CUIntMax -> CUIntMax -> CUIntMax #

min :: CUIntMax -> CUIntMax -> CUIntMax #

Ord GeneralCategory

Since: base-2.1

Instance details

Defined in GHC.Unicode

Methods

compare :: GeneralCategory -> GeneralCategory -> Ordering #

(<) :: GeneralCategory -> GeneralCategory -> Bool #

(<=) :: GeneralCategory -> GeneralCategory -> Bool #

(>) :: GeneralCategory -> GeneralCategory -> Bool #

(>=) :: GeneralCategory -> GeneralCategory -> Bool #

max :: GeneralCategory -> GeneralCategory -> GeneralCategory #

min :: GeneralCategory -> GeneralCategory -> GeneralCategory #

Ord UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

compare :: UTF32_Invalid -> UTF32_Invalid -> Ordering #

(<) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(<=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(>) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

(>=) :: UTF32_Invalid -> UTF32_Invalid -> Bool #

max :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #

min :: UTF32_Invalid -> UTF32_Invalid -> UTF32_Invalid #

Ord Encoding 
Instance details

Defined in Basement.String

Methods

compare :: Encoding -> Encoding -> Ordering #

(<) :: Encoding -> Encoding -> Bool #

(<=) :: Encoding -> Encoding -> Bool #

(>) :: Encoding -> Encoding -> Bool #

(>=) :: Encoding -> Encoding -> Bool #

max :: Encoding -> Encoding -> Encoding #

min :: Encoding -> Encoding -> Encoding #

Ord String 
Instance details

Defined in Basement.UTF8.Base

Methods

compare :: String -> String -> Ordering #

(<) :: String -> String -> Bool #

(<=) :: String -> String -> Bool #

(>) :: String -> String -> Bool #

(>=) :: String -> String -> Bool #

max :: String -> String -> String #

min :: String -> String -> String #

Ord FileSize 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: FileSize -> FileSize -> Ordering #

(<) :: FileSize -> FileSize -> Bool #

(<=) :: FileSize -> FileSize -> Bool #

(>) :: FileSize -> FileSize -> Bool #

(>=) :: FileSize -> FileSize -> Bool #

max :: FileSize -> FileSize -> FileSize #

min :: FileSize -> FileSize -> FileSize #

Ord IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

compare :: IntSet -> IntSet -> Ordering #

(<) :: IntSet -> IntSet -> Bool #

(<=) :: IntSet -> IntSet -> Bool #

(>) :: IntSet -> IntSet -> Bool #

(>=) :: IntSet -> IntSet -> Bool #

max :: IntSet -> IntSet -> IntSet #

min :: IntSet -> IntSet -> IntSet #

Ord FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: FileType -> FileType -> Ordering #

(<) :: FileType -> FileType -> Bool #

(<=) :: FileType -> FileType -> Bool #

(>) :: FileType -> FileType -> Bool #

(>=) :: FileType -> FileType -> Bool #

max :: FileType -> FileType -> FileType #

min :: FileType -> FileType -> FileType #

Ord Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: Permissions -> Permissions -> Ordering #

(<) :: Permissions -> Permissions -> Bool #

(<=) :: Permissions -> Permissions -> Bool #

(>) :: Permissions -> Permissions -> Bool #

(>=) :: Permissions -> Permissions -> Bool #

max :: Permissions -> Permissions -> Permissions #

min :: Permissions -> Permissions -> Permissions #

Ord XdgDirectory 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: XdgDirectory -> XdgDirectory -> Ordering #

(<) :: XdgDirectory -> XdgDirectory -> Bool #

(<=) :: XdgDirectory -> XdgDirectory -> Bool #

(>) :: XdgDirectory -> XdgDirectory -> Bool #

(>=) :: XdgDirectory -> XdgDirectory -> Bool #

max :: XdgDirectory -> XdgDirectory -> XdgDirectory #

min :: XdgDirectory -> XdgDirectory -> XdgDirectory #

Ord XdgDirectoryList 
Instance details

Defined in System.Directory.Internal.Common

Methods

compare :: XdgDirectoryList -> XdgDirectoryList -> Ordering #

(<) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

(<=) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

(>) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

(>=) :: XdgDirectoryList -> XdgDirectoryList -> Bool #

max :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList #

min :: XdgDirectoryList -> XdgDirectoryList -> XdgDirectoryList #

Ord LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

compare :: LogFloat -> LogFloat -> Ordering #

(<) :: LogFloat -> LogFloat -> Bool #

(<=) :: LogFloat -> LogFloat -> Bool #

(>) :: LogFloat -> LogFloat -> Bool #

(>=) :: LogFloat -> LogFloat -> Bool #

max :: LogFloat -> LogFloat -> LogFloat #

min :: LogFloat -> LogFloat -> LogFloat #

Ord TimeLocale 
Instance details

Defined in System.Locale

Methods

compare :: TimeLocale -> TimeLocale -> Ordering #

(<) :: TimeLocale -> TimeLocale -> Bool #

(<=) :: TimeLocale -> TimeLocale -> Bool #

(>) :: TimeLocale -> TimeLocale -> Bool #

(>=) :: TimeLocale -> TimeLocale -> Bool #

max :: TimeLocale -> TimeLocale -> TimeLocale #

min :: TimeLocale -> TimeLocale -> TimeLocale #

Ord ByteArray

Non-lexicographic ordering. This compares the lengths of + the byte arrays first and uses a lexicographic ordering if + the lengths are equal. Subject to change between major versions.

Since: primitive-0.6.3.0

Instance details

Defined in Data.Primitive.ByteArray

Methods

compare :: ByteArray -> ByteArray -> Ordering #

(<) :: ByteArray -> ByteArray -> Bool #

(<=) :: ByteArray -> ByteArray -> Bool #

(>) :: ByteArray -> ByteArray -> Bool #

(>=) :: ByteArray -> ByteArray -> Bool #

max :: ByteArray -> ByteArray -> ByteArray #

min :: ByteArray -> ByteArray -> ByteArray #

Ord Addr 
Instance details

Defined in Data.Primitive.Types

Methods

compare :: Addr -> Addr -> Ordering #

(<) :: Addr -> Addr -> Bool #

(<=) :: Addr -> Addr -> Bool #

(>) :: Addr -> Addr -> Bool #

(>=) :: Addr -> Addr -> Bool #

max :: Addr -> Addr -> Addr #

min :: Addr -> Addr -> Addr #

Ord Root 
Instance details

Defined in Filesystem.Path.Internal

Methods

compare :: Root -> Root -> Ordering #

(<) :: Root -> Root -> Bool #

(<=) :: Root -> Root -> Bool #

(>) :: Root -> Root -> Bool #

(>=) :: Root -> Root -> Bool #

max :: Root -> Root -> Root #

min :: Root -> Root -> Root #

Ord FilePath 
Instance details

Defined in Filesystem.Path.Internal

Methods

compare :: FilePath -> FilePath -> Ordering #

(<) :: FilePath -> FilePath -> Bool #

(<=) :: FilePath -> FilePath -> Bool #

(>) :: FilePath -> FilePath -> Bool #

(>=) :: FilePath -> FilePath -> Bool #

max :: FilePath -> FilePath -> FilePath #

min :: FilePath -> FilePath -> FilePath #

Ord ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: ModName -> ModName -> Ordering #

(<) :: ModName -> ModName -> Bool #

(<=) :: ModName -> ModName -> Bool #

(>) :: ModName -> ModName -> Bool #

(>=) :: ModName -> ModName -> Bool #

max :: ModName -> ModName -> ModName #

min :: ModName -> ModName -> ModName #

Ord PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PkgName -> PkgName -> Ordering #

(<) :: PkgName -> PkgName -> Bool #

(<=) :: PkgName -> PkgName -> Bool #

(>) :: PkgName -> PkgName -> Bool #

(>=) :: PkgName -> PkgName -> Bool #

max :: PkgName -> PkgName -> PkgName #

min :: PkgName -> PkgName -> PkgName #

Ord Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Module -> Module -> Ordering #

(<) :: Module -> Module -> Bool #

(<=) :: Module -> Module -> Bool #

(>) :: Module -> Module -> Bool #

(>=) :: Module -> Module -> Bool #

max :: Module -> Module -> Module #

min :: Module -> Module -> Module #

Ord OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: OccName -> OccName -> Ordering #

(<) :: OccName -> OccName -> Bool #

(<=) :: OccName -> OccName -> Bool #

(>) :: OccName -> OccName -> Bool #

(>=) :: OccName -> OccName -> Bool #

max :: OccName -> OccName -> OccName #

min :: OccName -> OccName -> OccName #

Ord NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameFlavour -> NameFlavour -> Ordering #

(<) :: NameFlavour -> NameFlavour -> Bool #

(<=) :: NameFlavour -> NameFlavour -> Bool #

(>) :: NameFlavour -> NameFlavour -> Bool #

(>=) :: NameFlavour -> NameFlavour -> Bool #

max :: NameFlavour -> NameFlavour -> NameFlavour #

min :: NameFlavour -> NameFlavour -> NameFlavour #

Ord NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: NameSpace -> NameSpace -> Ordering #

(<) :: NameSpace -> NameSpace -> Bool #

(<=) :: NameSpace -> NameSpace -> Bool #

(>) :: NameSpace -> NameSpace -> Bool #

(>=) :: NameSpace -> NameSpace -> Bool #

max :: NameSpace -> NameSpace -> NameSpace #

min :: NameSpace -> NameSpace -> NameSpace #

Ord Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Loc -> Loc -> Ordering #

(<) :: Loc -> Loc -> Bool #

(<=) :: Loc -> Loc -> Bool #

(>) :: Loc -> Loc -> Bool #

(>=) :: Loc -> Loc -> Bool #

max :: Loc -> Loc -> Loc #

min :: Loc -> Loc -> Loc #

Ord Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Info -> Info -> Ordering #

(<) :: Info -> Info -> Bool #

(<=) :: Info -> Info -> Bool #

(>) :: Info -> Info -> Bool #

(>=) :: Info -> Info -> Bool #

max :: Info -> Info -> Info #

min :: Info -> Info -> Info #

Ord ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: ModuleInfo -> ModuleInfo -> Ordering #

(<) :: ModuleInfo -> ModuleInfo -> Bool #

(<=) :: ModuleInfo -> ModuleInfo -> Bool #

(>) :: ModuleInfo -> ModuleInfo -> Bool #

(>=) :: ModuleInfo -> ModuleInfo -> Bool #

max :: ModuleInfo -> ModuleInfo -> ModuleInfo #

min :: ModuleInfo -> ModuleInfo -> ModuleInfo #

Ord Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Fixity -> Fixity -> Ordering #

(<) :: Fixity -> Fixity -> Bool #

(<=) :: Fixity -> Fixity -> Bool #

(>) :: Fixity -> Fixity -> Bool #

(>=) :: Fixity -> Fixity -> Bool #

max :: Fixity -> Fixity -> Fixity #

min :: Fixity -> Fixity -> Fixity #

Ord FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FixityDirection -> FixityDirection -> Ordering #

(<) :: FixityDirection -> FixityDirection -> Bool #

(<=) :: FixityDirection -> FixityDirection -> Bool #

(>) :: FixityDirection -> FixityDirection -> Bool #

(>=) :: FixityDirection -> FixityDirection -> Bool #

max :: FixityDirection -> FixityDirection -> FixityDirection #

min :: FixityDirection -> FixityDirection -> FixityDirection #

Ord Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Lit -> Lit -> Ordering #

(<) :: Lit -> Lit -> Bool #

(<=) :: Lit -> Lit -> Bool #

(>) :: Lit -> Lit -> Bool #

(>=) :: Lit -> Lit -> Bool #

max :: Lit -> Lit -> Lit #

min :: Lit -> Lit -> Lit #

Ord Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Body -> Body -> Ordering #

(<) :: Body -> Body -> Bool #

(<=) :: Body -> Body -> Bool #

(>) :: Body -> Body -> Bool #

(>=) :: Body -> Body -> Bool #

max :: Body -> Body -> Body #

min :: Body -> Body -> Body #

Ord Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Guard -> Guard -> Ordering #

(<) :: Guard -> Guard -> Bool #

(<=) :: Guard -> Guard -> Bool #

(>) :: Guard -> Guard -> Bool #

(>=) :: Guard -> Guard -> Bool #

max :: Guard -> Guard -> Guard #

min :: Guard -> Guard -> Guard #

Ord Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Stmt -> Stmt -> Ordering #

(<) :: Stmt -> Stmt -> Bool #

(<=) :: Stmt -> Stmt -> Bool #

(>) :: Stmt -> Stmt -> Bool #

(>=) :: Stmt -> Stmt -> Bool #

max :: Stmt -> Stmt -> Stmt #

min :: Stmt -> Stmt -> Stmt #

Ord Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Range -> Range -> Ordering #

(<) :: Range -> Range -> Bool #

(<=) :: Range -> Range -> Bool #

(>) :: Range -> Range -> Bool #

(>=) :: Range -> Range -> Bool #

max :: Range -> Range -> Range #

min :: Range -> Range -> Range #

Ord DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivClause -> DerivClause -> Ordering #

(<) :: DerivClause -> DerivClause -> Bool #

(<=) :: DerivClause -> DerivClause -> Bool #

(>) :: DerivClause -> DerivClause -> Bool #

(>=) :: DerivClause -> DerivClause -> Bool #

max :: DerivClause -> DerivClause -> DerivClause #

min :: DerivClause -> DerivClause -> DerivClause #

Ord DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DerivStrategy -> DerivStrategy -> Ordering #

(<) :: DerivStrategy -> DerivStrategy -> Bool #

(<=) :: DerivStrategy -> DerivStrategy -> Bool #

(>) :: DerivStrategy -> DerivStrategy -> Bool #

(>=) :: DerivStrategy -> DerivStrategy -> Bool #

max :: DerivStrategy -> DerivStrategy -> DerivStrategy #

min :: DerivStrategy -> DerivStrategy -> DerivStrategy #

Ord TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering #

(<) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(>) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

(>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool #

max :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #

min :: TypeFamilyHead -> TypeFamilyHead -> TypeFamilyHead #

Ord TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TySynEqn -> TySynEqn -> Ordering #

(<) :: TySynEqn -> TySynEqn -> Bool #

(<=) :: TySynEqn -> TySynEqn -> Bool #

(>) :: TySynEqn -> TySynEqn -> Bool #

(>=) :: TySynEqn -> TySynEqn -> Bool #

max :: TySynEqn -> TySynEqn -> TySynEqn #

min :: TySynEqn -> TySynEqn -> TySynEqn #

Ord Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Foreign -> Foreign -> Ordering #

(<) :: Foreign -> Foreign -> Bool #

(<=) :: Foreign -> Foreign -> Bool #

(>) :: Foreign -> Foreign -> Bool #

(>=) :: Foreign -> Foreign -> Bool #

max :: Foreign -> Foreign -> Foreign #

min :: Foreign -> Foreign -> Foreign #

Ord Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Callconv -> Callconv -> Ordering #

(<) :: Callconv -> Callconv -> Bool #

(<=) :: Callconv -> Callconv -> Bool #

(>) :: Callconv -> Callconv -> Bool #

(>=) :: Callconv -> Callconv -> Bool #

max :: Callconv -> Callconv -> Callconv #

min :: Callconv -> Callconv -> Callconv #

Ord Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Safety -> Safety -> Ordering #

(<) :: Safety -> Safety -> Bool #

(<=) :: Safety -> Safety -> Bool #

(>) :: Safety -> Safety -> Bool #

(>=) :: Safety -> Safety -> Bool #

max :: Safety -> Safety -> Safety #

min :: Safety -> Safety -> Safety #

Ord Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Pragma -> Pragma -> Ordering #

(<) :: Pragma -> Pragma -> Bool #

(<=) :: Pragma -> Pragma -> Bool #

(>) :: Pragma -> Pragma -> Bool #

(>=) :: Pragma -> Pragma -> Bool #

max :: Pragma -> Pragma -> Pragma #

min :: Pragma -> Pragma -> Pragma #

Ord Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Inline -> Inline -> Ordering #

(<) :: Inline -> Inline -> Bool #

(<=) :: Inline -> Inline -> Bool #

(>) :: Inline -> Inline -> Bool #

(>=) :: Inline -> Inline -> Bool #

max :: Inline -> Inline -> Inline #

min :: Inline -> Inline -> Inline #

Ord RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: RuleMatch -> RuleMatch -> Ordering #

(<) :: RuleMatch -> RuleMatch -> Bool #

(<=) :: RuleMatch -> RuleMatch -> Bool #

(>) :: RuleMatch -> RuleMatch -> Bool #

(>=) :: RuleMatch -> RuleMatch -> Bool #

max :: RuleMatch -> RuleMatch -> RuleMatch #

min :: RuleMatch -> RuleMatch -> RuleMatch #

Ord Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Phases -> Phases -> Ordering #

(<) :: Phases -> Phases -> Bool #

(<=) :: Phases -> Phases -> Bool #

(>) :: Phases -> Phases -> Bool #

(>=) :: Phases -> Phases -> Bool #

max :: Phases -> Phases -> Phases #

min :: Phases -> Phases -> Phases #

Ord RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: RuleBndr -> RuleBndr -> Ordering #

(<) :: RuleBndr -> RuleBndr -> Bool #

(<=) :: RuleBndr -> RuleBndr -> Bool #

(>) :: RuleBndr -> RuleBndr -> Bool #

(>=) :: RuleBndr -> RuleBndr -> Bool #

max :: RuleBndr -> RuleBndr -> RuleBndr #

min :: RuleBndr -> RuleBndr -> RuleBndr #

Ord AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnTarget -> AnnTarget -> Ordering #

(<) :: AnnTarget -> AnnTarget -> Bool #

(<=) :: AnnTarget -> AnnTarget -> Bool #

(>) :: AnnTarget -> AnnTarget -> Bool #

(>=) :: AnnTarget -> AnnTarget -> Bool #

max :: AnnTarget -> AnnTarget -> AnnTarget #

min :: AnnTarget -> AnnTarget -> AnnTarget #

Ord SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceUnpackedness -> SourceUnpackedness -> Ordering #

(<) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(<=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

(>=) :: SourceUnpackedness -> SourceUnpackedness -> Bool #

max :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

min :: SourceUnpackedness -> SourceUnpackedness -> SourceUnpackedness #

Ord SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: SourceStrictness -> SourceStrictness -> Ordering #

(<) :: SourceStrictness -> SourceStrictness -> Bool #

(<=) :: SourceStrictness -> SourceStrictness -> Bool #

(>) :: SourceStrictness -> SourceStrictness -> Bool #

(>=) :: SourceStrictness -> SourceStrictness -> Bool #

max :: SourceStrictness -> SourceStrictness -> SourceStrictness #

min :: SourceStrictness -> SourceStrictness -> SourceStrictness #

Ord DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: DecidedStrictness -> DecidedStrictness -> Ordering #

(<) :: DecidedStrictness -> DecidedStrictness -> Bool #

(<=) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>) :: DecidedStrictness -> DecidedStrictness -> Bool #

(>=) :: DecidedStrictness -> DecidedStrictness -> Bool #

max :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

min :: DecidedStrictness -> DecidedStrictness -> DecidedStrictness #

Ord Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Bang -> Bang -> Ordering #

(<) :: Bang -> Bang -> Bool #

(<=) :: Bang -> Bang -> Bool #

(>) :: Bang -> Bang -> Bool #

(>=) :: Bang -> Bang -> Bool #

max :: Bang -> Bang -> Bang #

min :: Bang -> Bang -> Bang #

Ord PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynDir -> PatSynDir -> Ordering #

(<) :: PatSynDir -> PatSynDir -> Bool #

(<=) :: PatSynDir -> PatSynDir -> Bool #

(>) :: PatSynDir -> PatSynDir -> Bool #

(>=) :: PatSynDir -> PatSynDir -> Bool #

max :: PatSynDir -> PatSynDir -> PatSynDir #

min :: PatSynDir -> PatSynDir -> PatSynDir #

Ord PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: PatSynArgs -> PatSynArgs -> Ordering #

(<) :: PatSynArgs -> PatSynArgs -> Bool #

(<=) :: PatSynArgs -> PatSynArgs -> Bool #

(>) :: PatSynArgs -> PatSynArgs -> Bool #

(>=) :: PatSynArgs -> PatSynArgs -> Bool #

max :: PatSynArgs -> PatSynArgs -> PatSynArgs #

min :: PatSynArgs -> PatSynArgs -> PatSynArgs #

Ord TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TyVarBndr -> TyVarBndr -> Ordering #

(<) :: TyVarBndr -> TyVarBndr -> Bool #

(<=) :: TyVarBndr -> TyVarBndr -> Bool #

(>) :: TyVarBndr -> TyVarBndr -> Bool #

(>=) :: TyVarBndr -> TyVarBndr -> Bool #

max :: TyVarBndr -> TyVarBndr -> TyVarBndr #

min :: TyVarBndr -> TyVarBndr -> TyVarBndr #

Ord FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: FamilyResultSig -> FamilyResultSig -> Ordering #

(<) :: FamilyResultSig -> FamilyResultSig -> Bool #

(<=) :: FamilyResultSig -> FamilyResultSig -> Bool #

(>) :: FamilyResultSig -> FamilyResultSig -> Bool #

(>=) :: FamilyResultSig -> FamilyResultSig -> Bool #

max :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #

min :: FamilyResultSig -> FamilyResultSig -> FamilyResultSig #

Ord TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: TyLit -> TyLit -> Ordering #

(<) :: TyLit -> TyLit -> Bool #

(<=) :: TyLit -> TyLit -> Bool #

(>) :: TyLit -> TyLit -> Bool #

(>=) :: TyLit -> TyLit -> Bool #

max :: TyLit -> TyLit -> TyLit #

min :: TyLit -> TyLit -> TyLit #

Ord Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: Role -> Role -> Ordering #

(<) :: Role -> Role -> Bool #

(<=) :: Role -> Role -> Bool #

(>) :: Role -> Role -> Bool #

(>=) :: Role -> Role -> Bool #

max :: Role -> Role -> Role #

min :: Role -> Role -> Role #

Ord AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

compare :: AnnLookup -> AnnLookup -> Ordering #

(<) :: AnnLookup -> AnnLookup -> Bool #

(<=) :: AnnLookup -> AnnLookup -> Bool #

(>) :: AnnLookup -> AnnLookup -> Bool #

(>=) :: AnnLookup -> AnnLookup -> Bool #

max :: AnnLookup -> AnnLookup -> AnnLookup #

min :: AnnLookup -> AnnLookup -> AnnLookup #

Ord B 
Instance details

Defined in Data.Text.Short.Internal

Methods

compare :: B -> B -> Ordering #

(<) :: B -> B -> Bool #

(<=) :: B -> B -> Bool #

(>) :: B -> B -> Bool #

(>=) :: B -> B -> Bool #

max :: B -> B -> B #

min :: B -> B -> B #

Ord ShortText 
Instance details

Defined in Data.Text.Short.Internal

Methods

compare :: ShortText -> ShortText -> Ordering #

(<) :: ShortText -> ShortText -> Bool #

(<=) :: ShortText -> ShortText -> Bool #

(>) :: ShortText -> ShortText -> Bool #

(>=) :: ShortText -> ShortText -> Bool #

max :: ShortText -> ShortText -> ShortText #

min :: ShortText -> ShortText -> ShortText #

Ord DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: DatatypeVariant -> DatatypeVariant -> Ordering #

(<) :: DatatypeVariant -> DatatypeVariant -> Bool #

(<=) :: DatatypeVariant -> DatatypeVariant -> Bool #

(>) :: DatatypeVariant -> DatatypeVariant -> Bool #

(>=) :: DatatypeVariant -> DatatypeVariant -> Bool #

max :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #

min :: DatatypeVariant -> DatatypeVariant -> DatatypeVariant #

Ord ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: ConstructorVariant -> ConstructorVariant -> Ordering #

(<) :: ConstructorVariant -> ConstructorVariant -> Bool #

(<=) :: ConstructorVariant -> ConstructorVariant -> Bool #

(>) :: ConstructorVariant -> ConstructorVariant -> Bool #

(>=) :: ConstructorVariant -> ConstructorVariant -> Bool #

max :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #

min :: ConstructorVariant -> ConstructorVariant -> ConstructorVariant #

Ord FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: FieldStrictness -> FieldStrictness -> Ordering #

(<) :: FieldStrictness -> FieldStrictness -> Bool #

(<=) :: FieldStrictness -> FieldStrictness -> Bool #

(>) :: FieldStrictness -> FieldStrictness -> Bool #

(>=) :: FieldStrictness -> FieldStrictness -> Bool #

max :: FieldStrictness -> FieldStrictness -> FieldStrictness #

min :: FieldStrictness -> FieldStrictness -> FieldStrictness #

Ord Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Unpackedness -> Unpackedness -> Ordering #

(<) :: Unpackedness -> Unpackedness -> Bool #

(<=) :: Unpackedness -> Unpackedness -> Bool #

(>) :: Unpackedness -> Unpackedness -> Bool #

(>=) :: Unpackedness -> Unpackedness -> Bool #

max :: Unpackedness -> Unpackedness -> Unpackedness #

min :: Unpackedness -> Unpackedness -> Unpackedness #

Ord Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

compare :: Strictness -> Strictness -> Ordering #

(<) :: Strictness -> Strictness -> Bool #

(<=) :: Strictness -> Strictness -> Bool #

(>) :: Strictness -> Strictness -> Bool #

(>=) :: Strictness -> Strictness -> Bool #

max :: Strictness -> Strictness -> Strictness #

min :: Strictness -> Strictness -> Strictness #

Ord LocalTime 
Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

compare :: LocalTime -> LocalTime -> Ordering #

(<) :: LocalTime -> LocalTime -> Bool #

(<=) :: LocalTime -> LocalTime -> Bool #

(>) :: LocalTime -> LocalTime -> Bool #

(>=) :: LocalTime -> LocalTime -> Bool #

max :: LocalTime -> LocalTime -> LocalTime #

min :: LocalTime -> LocalTime -> LocalTime #

Ord TimeOfDay 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

compare :: TimeOfDay -> TimeOfDay -> Ordering #

(<) :: TimeOfDay -> TimeOfDay -> Bool #

(<=) :: TimeOfDay -> TimeOfDay -> Bool #

(>) :: TimeOfDay -> TimeOfDay -> Bool #

(>=) :: TimeOfDay -> TimeOfDay -> Bool #

max :: TimeOfDay -> TimeOfDay -> TimeOfDay #

min :: TimeOfDay -> TimeOfDay -> TimeOfDay #

Ord TimeZone 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

compare :: TimeZone -> TimeZone -> Ordering #

(<) :: TimeZone -> TimeZone -> Bool #

(<=) :: TimeZone -> TimeZone -> Bool #

(>) :: TimeZone -> TimeZone -> Bool #

(>=) :: TimeZone -> TimeZone -> Bool #

max :: TimeZone -> TimeZone -> TimeZone #

min :: TimeZone -> TimeZone -> TimeZone #

Ord UniversalTime 
Instance details

Defined in Data.Time.Clock.Internal.UniversalTime

Methods

compare :: UniversalTime -> UniversalTime -> Ordering #

(<) :: UniversalTime -> UniversalTime -> Bool #

(<=) :: UniversalTime -> UniversalTime -> Bool #

(>) :: UniversalTime -> UniversalTime -> Bool #

(>=) :: UniversalTime -> UniversalTime -> Bool #

max :: UniversalTime -> UniversalTime -> UniversalTime #

min :: UniversalTime -> UniversalTime -> UniversalTime #

Ord NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

compare :: NominalDiffTime -> NominalDiffTime -> Ordering #

(<) :: NominalDiffTime -> NominalDiffTime -> Bool #

(<=) :: NominalDiffTime -> NominalDiffTime -> Bool #

(>) :: NominalDiffTime -> NominalDiffTime -> Bool #

(>=) :: NominalDiffTime -> NominalDiffTime -> Bool #

max :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

min :: NominalDiffTime -> NominalDiffTime -> NominalDiffTime #

Ord AbsoluteTime 
Instance details

Defined in Data.Time.Clock.Internal.AbsoluteTime

Methods

compare :: AbsoluteTime -> AbsoluteTime -> Ordering #

(<) :: AbsoluteTime -> AbsoluteTime -> Bool #

(<=) :: AbsoluteTime -> AbsoluteTime -> Bool #

(>) :: AbsoluteTime -> AbsoluteTime -> Bool #

(>=) :: AbsoluteTime -> AbsoluteTime -> Bool #

max :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime #

min :: AbsoluteTime -> AbsoluteTime -> AbsoluteTime #

Ord DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

compare :: DiffTime -> DiffTime -> Ordering #

(<) :: DiffTime -> DiffTime -> Bool #

(<=) :: DiffTime -> DiffTime -> Bool #

(>) :: DiffTime -> DiffTime -> Bool #

(>=) :: DiffTime -> DiffTime -> Bool #

max :: DiffTime -> DiffTime -> DiffTime #

min :: DiffTime -> DiffTime -> DiffTime #

Ord Day 
Instance details

Defined in Data.Time.Calendar.Days

Methods

compare :: Day -> Day -> Ordering #

(<) :: Day -> Day -> Bool #

(<=) :: Day -> Day -> Bool #

(>) :: Day -> Day -> Bool #

(>=) :: Day -> Day -> Bool #

max :: Day -> Day -> Day #

min :: Day -> Day -> Day #

Ord UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

compare :: UnpackedUUID -> UnpackedUUID -> Ordering #

(<) :: UnpackedUUID -> UnpackedUUID -> Bool #

(<=) :: UnpackedUUID -> UnpackedUUID -> Bool #

(>) :: UnpackedUUID -> UnpackedUUID -> Bool #

(>=) :: UnpackedUUID -> UnpackedUUID -> Bool #

max :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #

min :: UnpackedUUID -> UnpackedUUID -> UnpackedUUID #

Ord UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

compare :: UUID -> UUID -> Ordering #

(<) :: UUID -> UUID -> Bool #

(<=) :: UUID -> UUID -> Bool #

(>) :: UUID -> UUID -> Bool #

(>=) :: UUID -> UUID -> Bool #

max :: UUID -> UUID -> UUID #

min :: UUID -> UUID -> UUID #

Ord DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: DictionaryHash -> DictionaryHash -> Ordering #

(<) :: DictionaryHash -> DictionaryHash -> Bool #

(<=) :: DictionaryHash -> DictionaryHash -> Bool #

(>) :: DictionaryHash -> DictionaryHash -> Bool #

(>=) :: DictionaryHash -> DictionaryHash -> Bool #

max :: DictionaryHash -> DictionaryHash -> DictionaryHash #

min :: DictionaryHash -> DictionaryHash -> DictionaryHash #

Ord Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: Format -> Format -> Ordering #

(<) :: Format -> Format -> Bool #

(<=) :: Format -> Format -> Bool #

(>) :: Format -> Format -> Bool #

(>=) :: Format -> Format -> Bool #

max :: Format -> Format -> Format #

min :: Format -> Format -> Format #

Ord Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: Method -> Method -> Ordering #

(<) :: Method -> Method -> Bool #

(<=) :: Method -> Method -> Bool #

(>) :: Method -> Method -> Bool #

(>=) :: Method -> Method -> Bool #

max :: Method -> Method -> Method #

min :: Method -> Method -> Method #

Ord WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: WindowBits -> WindowBits -> Ordering #

(<) :: WindowBits -> WindowBits -> Bool #

(<=) :: WindowBits -> WindowBits -> Bool #

(>) :: WindowBits -> WindowBits -> Bool #

(>=) :: WindowBits -> WindowBits -> Bool #

max :: WindowBits -> WindowBits -> WindowBits #

min :: WindowBits -> WindowBits -> WindowBits #

Ord CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

compare :: CompressionStrategy -> CompressionStrategy -> Ordering #

(<) :: CompressionStrategy -> CompressionStrategy -> Bool #

(<=) :: CompressionStrategy -> CompressionStrategy -> Bool #

(>) :: CompressionStrategy -> CompressionStrategy -> Bool #

(>=) :: CompressionStrategy -> CompressionStrategy -> Bool #

max :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy #

min :: CompressionStrategy -> CompressionStrategy -> CompressionStrategy #

Ord ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

compare :: ConstVal -> ConstVal -> Ordering #

(<) :: ConstVal -> ConstVal -> Bool #

(<=) :: ConstVal -> ConstVal -> Bool #

(>) :: ConstVal -> ConstVal -> Bool #

(>=) :: ConstVal -> ConstVal -> Bool #

max :: ConstVal -> ConstVal -> ConstVal #

min :: ConstVal -> ConstVal -> ConstVal #

Ord Type # 
Instance details

Defined in Data.Expression

Methods

compare :: Type -> Type -> Ordering #

(<) :: Type -> Type -> Bool #

(<=) :: Type -> Type -> Bool #

(>) :: Type -> Type -> Bool #

(>=) :: Type -> Type -> Bool #

max :: Type -> Type -> Type #

min :: Type -> Type -> Type #

Ord LVal # 
Instance details

Defined in Data.Expression

Methods

compare :: LVal -> LVal -> Ordering #

(<) :: LVal -> LVal -> Bool #

(<=) :: LVal -> LVal -> Bool #

(>) :: LVal -> LVal -> Bool #

(>=) :: LVal -> LVal -> Bool #

max :: LVal -> LVal -> LVal #

min :: LVal -> LVal -> LVal #

Ord DExpr # 
Instance details

Defined in Data.Expression

Methods

compare :: DExpr -> DExpr -> Ordering #

(<) :: DExpr -> DExpr -> Bool #

(<=) :: DExpr -> DExpr -> Bool #

(>) :: DExpr -> DExpr -> Bool #

(>=) :: DExpr -> DExpr -> Bool #

max :: DExpr -> DExpr -> DExpr #

min :: DExpr -> DExpr -> DExpr #

Ord NodeRef # 
Instance details

Defined in Data.Expression

Methods

compare :: NodeRef -> NodeRef -> Ordering #

(<) :: NodeRef -> NodeRef -> Bool #

(<=) :: NodeRef -> NodeRef -> Bool #

(>) :: NodeRef -> NodeRef -> Bool #

(>=) :: NodeRef -> NodeRef -> Bool #

max :: NodeRef -> NodeRef -> NodeRef #

min :: NodeRef -> NodeRef -> NodeRef #

Ord Id # 
Instance details

Defined in Data.Expression

Methods

compare :: Id -> Id -> Ordering #

(<) :: Id -> Id -> Bool #

(<=) :: Id -> Id -> Bool #

(>) :: Id -> Id -> Bool #

(>=) :: Id -> Id -> Bool #

max :: Id -> Id -> Id #

min :: Id -> Id -> Id #

Ord Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

compare :: Cairo -> Cairo -> Ordering #

(<) :: Cairo -> Cairo -> Bool #

(<=) :: Cairo -> Cairo -> Bool #

(>) :: Cairo -> Cairo -> Bool #

(>=) :: Cairo -> Cairo -> Bool #

max :: Cairo -> Cairo -> Cairo #

min :: Cairo -> Cairo -> Cairo #

Ord OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

compare :: OutputType -> OutputType -> Ordering #

(<) :: OutputType -> OutputType -> Bool #

(<=) :: OutputType -> OutputType -> Bool #

(>) :: OutputType -> OutputType -> Bool #

(>=) :: OutputType -> OutputType -> Bool #

max :: OutputType -> OutputType -> OutputType #

min :: OutputType -> OutputType -> OutputType #

Ord AName 
Instance details

Defined in Diagrams.Core.Names

Methods

compare :: AName -> AName -> Ordering #

(<) :: AName -> AName -> Bool #

(<=) :: AName -> AName -> Bool #

(>) :: AName -> AName -> Bool #

(>=) :: AName -> AName -> Bool #

max :: AName -> AName -> AName #

min :: AName -> AName -> AName #

Ord Name 
Instance details

Defined in Diagrams.Core.Names

Methods

compare :: Name -> Name -> Ordering #

(<) :: Name -> Name -> Bool #

(<=) :: Name -> Name -> Bool #

(>) :: Name -> Name -> Bool #

(>=) :: Name -> Name -> Bool #

max :: Name -> Name -> Name #

min :: Name -> Name -> Name #

Ord FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

compare :: FillRule -> FillRule -> Ordering #

(<) :: FillRule -> FillRule -> Bool #

(<=) :: FillRule -> FillRule -> Bool #

(>) :: FillRule -> FillRule -> Bool #

(>=) :: FillRule -> FillRule -> Bool #

max :: FillRule -> FillRule -> FillRule #

min :: FillRule -> FillRule -> FillRule #

Ord LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: LogValue -> LogValue -> Ordering #

(<) :: LogValue -> LogValue -> Bool #

(<=) :: LogValue -> LogValue -> Bool #

(>) :: LogValue -> LogValue -> Bool #

(>=) :: LogValue -> LogValue -> Bool #

max :: LogValue -> LogValue -> LogValue #

min :: LogValue -> LogValue -> LogValue #

Ord Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

compare :: Percent -> Percent -> Ordering #

(<) :: Percent -> Percent -> Bool #

(<=) :: Percent -> Percent -> Bool #

(>) :: Percent -> Percent -> Bool #

(>=) :: Percent -> Percent -> Bool #

max :: Percent -> Percent -> Percent #

min :: Percent -> Percent -> Percent #

Ord PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

compare :: PlotIndex -> PlotIndex -> Ordering #

(<) :: PlotIndex -> PlotIndex -> Bool #

(<=) :: PlotIndex -> PlotIndex -> Bool #

(>) :: PlotIndex -> PlotIndex -> Bool #

(>=) :: PlotIndex -> PlotIndex -> Bool #

max :: PlotIndex -> PlotIndex -> PlotIndex #

min :: PlotIndex -> PlotIndex -> PlotIndex #

Ord FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Ord FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Ord HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: HTextAnchor -> HTextAnchor -> Ordering #

(<) :: HTextAnchor -> HTextAnchor -> Bool #

(<=) :: HTextAnchor -> HTextAnchor -> Bool #

(>) :: HTextAnchor -> HTextAnchor -> Bool #

(>=) :: HTextAnchor -> HTextAnchor -> Bool #

max :: HTextAnchor -> HTextAnchor -> HTextAnchor #

min :: HTextAnchor -> HTextAnchor -> HTextAnchor #

Ord LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineCap -> LineCap -> Ordering #

(<) :: LineCap -> LineCap -> Bool #

(<=) :: LineCap -> LineCap -> Bool #

(>) :: LineCap -> LineCap -> Bool #

(>=) :: LineCap -> LineCap -> Bool #

max :: LineCap -> LineCap -> LineCap #

min :: LineCap -> LineCap -> LineCap #

Ord LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: LineJoin -> LineJoin -> Ordering #

(<) :: LineJoin -> LineJoin -> Bool #

(<=) :: LineJoin -> LineJoin -> Bool #

(>) :: LineJoin -> LineJoin -> Bool #

(>=) :: LineJoin -> LineJoin -> Bool #

max :: LineJoin -> LineJoin -> LineJoin #

min :: LineJoin -> LineJoin -> LineJoin #

Ord VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

compare :: VTextAnchor -> VTextAnchor -> Ordering #

(<) :: VTextAnchor -> VTextAnchor -> Bool #

(<=) :: VTextAnchor -> VTextAnchor -> Bool #

(>) :: VTextAnchor -> VTextAnchor -> Bool #

(>=) :: VTextAnchor -> VTextAnchor -> Bool #

max :: VTextAnchor -> VTextAnchor -> VTextAnchor #

min :: VTextAnchor -> VTextAnchor -> VTextAnchor #

Ord DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

compare :: DefName -> DefName -> Ordering #

(<) :: DefName -> DefName -> Bool #

(<=) :: DefName -> DefName -> Bool #

(>) :: DefName -> DefName -> Bool #

(>=) :: DefName -> DefName -> Bool #

max :: DefName -> DefName -> DefName #

min :: DefName -> DefName -> DefName #

Ord Orientation 
Instance details

Defined in Plots.Types

Methods

compare :: Orientation -> Orientation -> Ordering #

(<) :: Orientation -> Orientation -> Bool #

(<=) :: Orientation -> Orientation -> Bool #

(>) :: Orientation -> Orientation -> Bool #

(>=) :: Orientation -> Orientation -> Bool #

max :: Orientation -> Orientation -> Orientation #

min :: Orientation -> Orientation -> Orientation #

Ord Placement 
Instance details

Defined in Plots.Types

Methods

compare :: Placement -> Placement -> Ordering #

(<) :: Placement -> Placement -> Bool #

(<=) :: Placement -> Placement -> Bool #

(>) :: Placement -> Placement -> Bool #

(>=) :: Placement -> Placement -> Bool #

max :: Placement -> Placement -> Placement #

min :: Placement -> Placement -> Placement #

Ord Font 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: Font -> Font -> Ordering #

(<) :: Font -> Font -> Bool #

(<=) :: Font -> Font -> Bool #

(>) :: Font -> Font -> Bool #

(>=) :: Font -> Font -> Bool #

max :: Font -> Font -> Font #

min :: Font -> Font -> Font #

Ord FontFace 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontFace -> FontFace -> Ordering #

(<) :: FontFace -> FontFace -> Bool #

(<=) :: FontFace -> FontFace -> Bool #

(>) :: FontFace -> FontFace -> Bool #

(>=) :: FontFace -> FontFace -> Bool #

max :: FontFace -> FontFace -> FontFace #

min :: FontFace -> FontFace -> FontFace #

Ord FontFamily 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontFamily -> FontFamily -> Ordering #

(<) :: FontFamily -> FontFamily -> Bool #

(<=) :: FontFamily -> FontFamily -> Bool #

(>) :: FontFamily -> FontFamily -> Bool #

(>=) :: FontFamily -> FontFamily -> Bool #

max :: FontFamily -> FontFamily -> FontFamily #

min :: FontFamily -> FontFamily -> FontFamily #

Ord FontMap 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontMap -> FontMap -> Ordering #

(<) :: FontMap -> FontMap -> Bool #

(<=) :: FontMap -> FontMap -> Bool #

(>) :: FontMap -> FontMap -> Bool #

(>=) :: FontMap -> FontMap -> Bool #

max :: FontMap -> FontMap -> FontMap #

min :: FontMap -> FontMap -> FontMap #

Ord Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

compare :: Crossings -> Crossings -> Ordering #

(<) :: Crossings -> Crossings -> Bool #

(<=) :: Crossings -> Crossings -> Bool #

(>) :: Crossings -> Crossings -> Bool #

(>=) :: Crossings -> Crossings -> Bool #

max :: Crossings -> Crossings -> Crossings #

min :: Crossings -> Crossings -> Crossings #

Ord FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

compare :: FontSlant -> FontSlant -> Ordering #

(<) :: FontSlant -> FontSlant -> Bool #

(<=) :: FontSlant -> FontSlant -> Bool #

(>) :: FontSlant -> FontSlant -> Bool #

(>=) :: FontSlant -> FontSlant -> Bool #

max :: FontSlant -> FontSlant -> FontSlant #

min :: FontSlant -> FontSlant -> FontSlant #

Ord FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

compare :: FontWeight -> FontWeight -> Ordering #

(<) :: FontWeight -> FontWeight -> Bool #

(<=) :: FontWeight -> FontWeight -> Bool #

(>) :: FontWeight -> FontWeight -> Bool #

(>=) :: FontWeight -> FontWeight -> Bool #

max :: FontWeight -> FontWeight -> FontWeight #

min :: FontWeight -> FontWeight -> FontWeight #

Ord FontSet 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: FontSet -> FontSet -> Ordering #

(<) :: FontSet -> FontSet -> Bool #

(<=) :: FontSet -> FontSet -> Bool #

(>) :: FontSet -> FontSet -> Bool #

(>=) :: FontSet -> FontSet -> Bool #

max :: FontSet -> FontSet -> FontSet #

min :: FontSet -> FontSet -> FontSet #

Ord PangoContext 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: PangoContext -> PangoContext -> Ordering #

(<) :: PangoContext -> PangoContext -> Bool #

(<=) :: PangoContext -> PangoContext -> Bool #

(>) :: PangoContext -> PangoContext -> Bool #

(>=) :: PangoContext -> PangoContext -> Bool #

max :: PangoContext -> PangoContext -> PangoContext #

min :: PangoContext -> PangoContext -> PangoContext #

Ord PangoLayoutRaw 
Instance details

Defined in Graphics.Rendering.Pango.Types

Methods

compare :: PangoLayoutRaw -> PangoLayoutRaw -> Ordering #

(<) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(<=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(>) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

(>=) :: PangoLayoutRaw -> PangoLayoutRaw -> Bool #

max :: PangoLayoutRaw -> PangoLayoutRaw -> PangoLayoutRaw #

min :: PangoLayoutRaw -> PangoLayoutRaw -> PangoLayoutRaw #

Ord a => Ord [a] 
Instance details

Defined in GHC.Classes

Methods

compare :: [a] -> [a] -> Ordering #

(<) :: [a] -> [a] -> Bool #

(<=) :: [a] -> [a] -> Bool #

(>) :: [a] -> [a] -> Bool #

(>=) :: [a] -> [a] -> Bool #

max :: [a] -> [a] -> [a] #

min :: [a] -> [a] -> [a] #

Ord a => Ord (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Maybe

Methods

compare :: Maybe a -> Maybe a -> Ordering #

(<) :: Maybe a -> Maybe a -> Bool #

(<=) :: Maybe a -> Maybe a -> Bool #

(>) :: Maybe a -> Maybe a -> Bool #

(>=) :: Maybe a -> Maybe a -> Bool #

max :: Maybe a -> Maybe a -> Maybe a #

min :: Maybe a -> Maybe a -> Maybe a #

Integral a => Ord (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

compare :: Ratio a -> Ratio a -> Ordering #

(<) :: Ratio a -> Ratio a -> Bool #

(<=) :: Ratio a -> Ratio a -> Bool #

(>) :: Ratio a -> Ratio a -> Bool #

(>=) :: Ratio a -> Ratio a -> Bool #

max :: Ratio a -> Ratio a -> Ratio a #

min :: Ratio a -> Ratio a -> Ratio a #

Ord (Ptr a)

Since: base-2.1

Instance details

Defined in GHC.Ptr

Methods

compare :: Ptr a -> Ptr a -> Ordering #

(<) :: Ptr a -> Ptr a -> Bool #

(<=) :: Ptr a -> Ptr a -> Bool #

(>) :: Ptr a -> Ptr a -> Bool #

(>=) :: Ptr a -> Ptr a -> Bool #

max :: Ptr a -> Ptr a -> Ptr a #

min :: Ptr a -> Ptr a -> Ptr a #

Ord (FunPtr a) 
Instance details

Defined in GHC.Ptr

Methods

compare :: FunPtr a -> FunPtr a -> Ordering #

(<) :: FunPtr a -> FunPtr a -> Bool #

(<=) :: FunPtr a -> FunPtr a -> Bool #

(>) :: FunPtr a -> FunPtr a -> Bool #

(>=) :: FunPtr a -> FunPtr a -> Bool #

max :: FunPtr a -> FunPtr a -> FunPtr a #

min :: FunPtr a -> FunPtr a -> FunPtr a #

Ord p => Ord (Par1 p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: Par1 p -> Par1 p -> Ordering #

(<) :: Par1 p -> Par1 p -> Bool #

(<=) :: Par1 p -> Par1 p -> Bool #

(>) :: Par1 p -> Par1 p -> Bool #

(>=) :: Par1 p -> Par1 p -> Bool #

max :: Par1 p -> Par1 p -> Par1 p #

min :: Par1 p -> Par1 p -> Par1 p #

(Storable a, Ord a) => Ord (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

Ord a => Ord (Only a) 
Instance details

Defined in Data.Tuple.Only

Methods

compare :: Only a -> Only a -> Ordering #

(<) :: Only a -> Only a -> Bool #

(<=) :: Only a -> Only a -> Bool #

(>) :: Only a -> Only a -> Bool #

(>=) :: Only a -> Only a -> Bool #

max :: Only a -> Only a -> Only a #

min :: Only a -> Only a -> Only a #

Ord a => Ord (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Min a -> Min a -> Ordering #

(<) :: Min a -> Min a -> Bool #

(<=) :: Min a -> Min a -> Bool #

(>) :: Min a -> Min a -> Bool #

(>=) :: Min a -> Min a -> Bool #

max :: Min a -> Min a -> Min a #

min :: Min a -> Min a -> Min a #

Ord a => Ord (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Max a -> Max a -> Ordering #

(<) :: Max a -> Max a -> Bool #

(<=) :: Max a -> Max a -> Bool #

(>) :: Max a -> Max a -> Bool #

(>=) :: Max a -> Max a -> Bool #

max :: Max a -> Max a -> Max a #

min :: Max a -> Max a -> Max a #

Ord a => Ord (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: First a -> First a -> Ordering #

(<) :: First a -> First a -> Bool #

(<=) :: First a -> First a -> Bool #

(>) :: First a -> First a -> Bool #

(>=) :: First a -> First a -> Bool #

max :: First a -> First a -> First a #

min :: First a -> First a -> First a #

Ord a => Ord (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Last a -> Last a -> Ordering #

(<) :: Last a -> Last a -> Bool #

(<=) :: Last a -> Last a -> Bool #

(>) :: Last a -> Last a -> Bool #

(>=) :: Last a -> Last a -> Bool #

max :: Last a -> Last a -> Last a #

min :: Last a -> Last a -> Last a #

Ord m => Ord (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering #

(<) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(>) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

(>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool #

max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

Ord a => Ord (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Option a -> Option a -> Ordering #

(<) :: Option a -> Option a -> Bool #

(<=) :: Option a -> Option a -> Bool #

(>) :: Option a -> Option a -> Bool #

(>=) :: Option a -> Option a -> Bool #

max :: Option a -> Option a -> Option a #

min :: Option a -> Option a -> Option a #

Ord a => Ord (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

Methods

compare :: ZipList a -> ZipList a -> Ordering #

(<) :: ZipList a -> ZipList a -> Bool #

(<=) :: ZipList a -> ZipList a -> Bool #

(>) :: ZipList a -> ZipList a -> Bool #

(>=) :: ZipList a -> ZipList a -> Bool #

max :: ZipList a -> ZipList a -> ZipList a #

min :: ZipList a -> ZipList a -> ZipList a #

Ord a => Ord (Identity a)

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

compare :: Identity a -> Identity a -> Ordering #

(<) :: Identity a -> Identity a -> Bool #

(<=) :: Identity a -> Identity a -> Bool #

(>) :: Identity a -> Identity a -> Bool #

(>=) :: Identity a -> Identity a -> Bool #

max :: Identity a -> Identity a -> Identity a #

min :: Identity a -> Identity a -> Identity a #

Ord a => Ord (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

compare :: First a -> First a -> Ordering #

(<) :: First a -> First a -> Bool #

(<=) :: First a -> First a -> Bool #

(>) :: First a -> First a -> Bool #

(>=) :: First a -> First a -> Bool #

max :: First a -> First a -> First a #

min :: First a -> First a -> First a #

Ord a => Ord (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

compare :: Last a -> Last a -> Ordering #

(<) :: Last a -> Last a -> Bool #

(<=) :: Last a -> Last a -> Bool #

(>) :: Last a -> Last a -> Bool #

(>=) :: Last a -> Last a -> Bool #

max :: Last a -> Last a -> Last a #

min :: Last a -> Last a -> Last a #

Ord a => Ord (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Dual a -> Dual a -> Ordering #

(<) :: Dual a -> Dual a -> Bool #

(<=) :: Dual a -> Dual a -> Bool #

(>) :: Dual a -> Dual a -> Bool #

(>=) :: Dual a -> Dual a -> Bool #

max :: Dual a -> Dual a -> Dual a #

min :: Dual a -> Dual a -> Dual a #

Ord a => Ord (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Sum a -> Sum a -> Ordering #

(<) :: Sum a -> Sum a -> Bool #

(<=) :: Sum a -> Sum a -> Bool #

(>) :: Sum a -> Sum a -> Bool #

(>=) :: Sum a -> Sum a -> Bool #

max :: Sum a -> Sum a -> Sum a #

min :: Sum a -> Sum a -> Sum a #

Ord a => Ord (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Product a -> Product a -> Ordering #

(<) :: Product a -> Product a -> Bool #

(<=) :: Product a -> Product a -> Bool #

(>) :: Product a -> Product a -> Bool #

(>=) :: Product a -> Product a -> Bool #

max :: Product a -> Product a -> Product a #

min :: Product a -> Product a -> Product a #

Ord a => Ord (Down a)

Since: base-4.6.0.0

Instance details

Defined in Data.Ord

Methods

compare :: Down a -> Down a -> Ordering #

(<) :: Down a -> Down a -> Bool #

(<=) :: Down a -> Down a -> Bool #

(>) :: Down a -> Down a -> Bool #

(>=) :: Down a -> Down a -> Bool #

max :: Down a -> Down a -> Down a #

min :: Down a -> Down a -> Down a #

Ord a => Ord (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

compare :: NonEmpty a -> NonEmpty a -> Ordering #

(<) :: NonEmpty a -> NonEmpty a -> Bool #

(<=) :: NonEmpty a -> NonEmpty a -> Bool #

(>) :: NonEmpty a -> NonEmpty a -> Bool #

(>=) :: NonEmpty a -> NonEmpty a -> Bool #

max :: NonEmpty a -> NonEmpty a -> NonEmpty a #

min :: NonEmpty a -> NonEmpty a -> NonEmpty a #

(PrimType ty, Ord ty) => Ord (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

compare :: UArray ty -> UArray ty -> Ordering #

(<) :: UArray ty -> UArray ty -> Bool #

(<=) :: UArray ty -> UArray ty -> Bool #

(>) :: UArray ty -> UArray ty -> Bool #

(>=) :: UArray ty -> UArray ty -> Bool #

max :: UArray ty -> UArray ty -> UArray ty #

min :: UArray ty -> UArray ty -> UArray ty #

(PrimType ty, Ord ty) => Ord (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

compare :: Block ty -> Block ty -> Ordering #

(<) :: Block ty -> Block ty -> Bool #

(<=) :: Block ty -> Block ty -> Bool #

(>) :: Block ty -> Block ty -> Bool #

(>=) :: Block ty -> Block ty -> Bool #

max :: Block ty -> Block ty -> Block ty #

min :: Block ty -> Block ty -> Block ty #

Ord (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: Offset ty -> Offset ty -> Ordering #

(<) :: Offset ty -> Offset ty -> Bool #

(<=) :: Offset ty -> Offset ty -> Bool #

(>) :: Offset ty -> Offset ty -> Bool #

(>=) :: Offset ty -> Offset ty -> Bool #

max :: Offset ty -> Offset ty -> Offset ty #

min :: Offset ty -> Offset ty -> Offset ty #

Ord (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

compare :: CountOf ty -> CountOf ty -> Ordering #

(<) :: CountOf ty -> CountOf ty -> Bool #

(<=) :: CountOf ty -> CountOf ty -> Bool #

(>) :: CountOf ty -> CountOf ty -> Bool #

(>=) :: CountOf ty -> CountOf ty -> Bool #

max :: CountOf ty -> CountOf ty -> CountOf ty #

min :: CountOf ty -> CountOf ty -> CountOf ty #

Ord (Zn64 n) 
Instance details

Defined in Basement.Bounded

Methods

compare :: Zn64 n -> Zn64 n -> Ordering #

(<) :: Zn64 n -> Zn64 n -> Bool #

(<=) :: Zn64 n -> Zn64 n -> Bool #

(>) :: Zn64 n -> Zn64 n -> Bool #

(>=) :: Zn64 n -> Zn64 n -> Bool #

max :: Zn64 n -> Zn64 n -> Zn64 n #

min :: Zn64 n -> Zn64 n -> Zn64 n #

Ord (Zn n) 
Instance details

Defined in Basement.Bounded

Methods

compare :: Zn n -> Zn n -> Ordering #

(<) :: Zn n -> Zn n -> Bool #

(<=) :: Zn n -> Zn n -> Bool #

(>) :: Zn n -> Zn n -> Bool #

(>=) :: Zn n -> Zn n -> Bool #

max :: Zn n -> Zn n -> Zn n #

min :: Zn n -> Zn n -> Zn n #

Ord n => Ord (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

compare :: VarInt n -> VarInt n -> Ordering #

(<) :: VarInt n -> VarInt n -> Bool #

(<=) :: VarInt n -> VarInt n -> Bool #

(>) :: VarInt n -> VarInt n -> Bool #

(>=) :: VarInt n -> VarInt n -> Bool #

max :: VarInt n -> VarInt n -> VarInt n #

min :: VarInt n -> VarInt n -> VarInt n #

Ord a => Ord (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

compare :: IntMap a -> IntMap a -> Ordering #

(<) :: IntMap a -> IntMap a -> Bool #

(<=) :: IntMap a -> IntMap a -> Bool #

(>) :: IntMap a -> IntMap a -> Bool #

(>=) :: IntMap a -> IntMap a -> Bool #

max :: IntMap a -> IntMap a -> IntMap a #

min :: IntMap a -> IntMap a -> IntMap a #

Ord a => Ord (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: Seq a -> Seq a -> Ordering #

(<) :: Seq a -> Seq a -> Bool #

(<=) :: Seq a -> Seq a -> Bool #

(>) :: Seq a -> Seq a -> Bool #

(>=) :: Seq a -> Seq a -> Bool #

max :: Seq a -> Seq a -> Seq a #

min :: Seq a -> Seq a -> Seq a #

Ord a => Ord (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: ViewL a -> ViewL a -> Ordering #

(<) :: ViewL a -> ViewL a -> Bool #

(<=) :: ViewL a -> ViewL a -> Bool #

(>) :: ViewL a -> ViewL a -> Bool #

(>=) :: ViewL a -> ViewL a -> Bool #

max :: ViewL a -> ViewL a -> ViewL a #

min :: ViewL a -> ViewL a -> ViewL a #

Ord a => Ord (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

compare :: ViewR a -> ViewR a -> Ordering #

(<) :: ViewR a -> ViewR a -> Bool #

(<=) :: ViewR a -> ViewR a -> Bool #

(>) :: ViewR a -> ViewR a -> Bool #

(>=) :: ViewR a -> ViewR a -> Bool #

max :: ViewR a -> ViewR a -> ViewR a #

min :: ViewR a -> ViewR a -> ViewR a #

Ord a => Ord (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

compare :: Set a -> Set a -> Ordering #

(<) :: Set a -> Set a -> Bool #

(<=) :: Set a -> Set a -> Bool #

(>) :: Set a -> Set a -> Bool #

(>=) :: Set a -> Set a -> Bool #

max :: Set a -> Set a -> Set a #

min :: Set a -> Set a -> Set a #

Ord (Digest a) 
Instance details

Defined in Crypto.Hash.Types

Methods

compare :: Digest a -> Digest a -> Ordering #

(<) :: Digest a -> Digest a -> Bool #

(<=) :: Digest a -> Digest a -> Bool #

(>) :: Digest a -> Digest a -> Bool #

(>=) :: Digest a -> Digest a -> Bool #

max :: Digest a -> Digest a -> Digest a #

min :: Digest a -> Digest a -> Digest a #

Ord a => Ord (DList a) 
Instance details

Defined in Data.DList

Methods

compare :: DList a -> DList a -> Ordering #

(<) :: DList a -> DList a -> Bool #

(<=) :: DList a -> DList a -> Bool #

(>) :: DList a -> DList a -> Bool #

(>=) :: DList a -> DList a -> Bool #

max :: DList a -> DList a -> DList a #

min :: DList a -> DList a -> DList a #

(Generic a, Ord (Rep a ())) => Ord (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

compare :: Generically a -> Generically a -> Ordering #

(<) :: Generically a -> Generically a -> Bool #

(<=) :: Generically a -> Generically a -> Bool #

(>) :: Generically a -> Generically a -> Bool #

(>=) :: Generically a -> Generically a -> Bool #

max :: Generically a -> Generically a -> Generically a #

min :: Generically a -> Generically a -> Generically a #

Ord a => Ord (Hashed a) 
Instance details

Defined in Data.Hashable.Class

Methods

compare :: Hashed a -> Hashed a -> Ordering #

(<) :: Hashed a -> Hashed a -> Bool #

(<=) :: Hashed a -> Hashed a -> Bool #

(>) :: Hashed a -> Hashed a -> Bool #

(>=) :: Hashed a -> Hashed a -> Bool #

max :: Hashed a -> Hashed a -> Hashed a #

min :: Hashed a -> Hashed a -> Hashed a #

Ord a => Ord (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

compare :: Interval a -> Interval a -> Ordering #

(<) :: Interval a -> Interval a -> Bool #

(<=) :: Interval a -> Interval a -> Bool #

(>) :: Interval a -> Interval a -> Bool #

(>=) :: Interval a -> Interval a -> Bool #

max :: Interval a -> Interval a -> Interval a #

min :: Interval a -> Interval a -> Interval a #

(Ord a, PrimUnlifted a) => Ord (UnliftedArray a)

Lexicographic ordering. Subject to change between major versions.

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.UnliftedArray

Methods

compare :: UnliftedArray a -> UnliftedArray a -> Ordering #

(<) :: UnliftedArray a -> UnliftedArray a -> Bool #

(<=) :: UnliftedArray a -> UnliftedArray a -> Bool #

(>) :: UnliftedArray a -> UnliftedArray a -> Bool #

(>=) :: UnliftedArray a -> UnliftedArray a -> Bool #

max :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a #

min :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a #

(Ord a, Prim a) => Ord (PrimArray a)

Lexicographic ordering. Subject to change between major versions.

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Methods

compare :: PrimArray a -> PrimArray a -> Ordering #

(<) :: PrimArray a -> PrimArray a -> Bool #

(<=) :: PrimArray a -> PrimArray a -> Bool #

(>) :: PrimArray a -> PrimArray a -> Bool #

(>=) :: PrimArray a -> PrimArray a -> Bool #

max :: PrimArray a -> PrimArray a -> PrimArray a #

min :: PrimArray a -> PrimArray a -> PrimArray a #

Ord a => Ord (SmallArray a)

Lexicographic ordering. Subject to change between major versions.

Instance details

Defined in Data.Primitive.SmallArray

Methods

compare :: SmallArray a -> SmallArray a -> Ordering #

(<) :: SmallArray a -> SmallArray a -> Bool #

(<=) :: SmallArray a -> SmallArray a -> Bool #

(>) :: SmallArray a -> SmallArray a -> Bool #

(>=) :: SmallArray a -> SmallArray a -> Bool #

max :: SmallArray a -> SmallArray a -> SmallArray a #

min :: SmallArray a -> SmallArray a -> SmallArray a #

Ord a => Ord (Array a)

Lexicographic ordering. Subject to change between major versions.

Instance details

Defined in Data.Primitive.Array

Methods

compare :: Array a -> Array a -> Ordering #

(<) :: Array a -> Array a -> Bool #

(<=) :: Array a -> Array a -> Bool #

(>) :: Array a -> Array a -> Bool #

(>=) :: Array a -> Array a -> Bool #

max :: Array a -> Array a -> Array a #

min :: Array a -> Array a -> Array a #

Ord a => Ord (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Methods

compare :: HashSet a -> HashSet a -> Ordering #

(<) :: HashSet a -> HashSet a -> Bool #

(<=) :: HashSet a -> HashSet a -> Bool #

(>) :: HashSet a -> HashSet a -> Bool #

(>=) :: HashSet a -> HashSet a -> Bool #

max :: HashSet a -> HashSet a -> HashSet a #

min :: HashSet a -> HashSet a -> HashSet a #

(Prim a, Ord a) => Ord (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

Ord a => Ord (Vector a) 
Instance details

Defined in Data.Vector

Methods

compare :: Vector a -> Vector a -> Ordering #

(<) :: Vector a -> Vector a -> Bool #

(<=) :: Vector a -> Vector a -> Bool #

(>) :: Vector a -> Vector a -> Bool #

(>=) :: Vector a -> Vector a -> Bool #

max :: Vector a -> Vector a -> Vector a #

min :: Vector a -> Vector a -> Vector a #

Ord a => Ord (Log a) 
Instance details

Defined in Numeric.Log

Methods

compare :: Log a -> Log a -> Ordering #

(<) :: Log a -> Log a -> Bool #

(<=) :: Log a -> Log a -> Bool #

(>) :: Log a -> Log a -> Bool #

(>=) :: Log a -> Log a -> Bool #

max :: Log a -> Log a -> Log a #

min :: Log a -> Log a -> Log a #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

Ord1 f => Ord (Fix f) 
Instance details

Defined in Data.Functor.Foldable

Methods

compare :: Fix f -> Fix f -> Ordering #

(<) :: Fix f -> Fix f -> Bool #

(<=) :: Fix f -> Fix f -> Bool #

(>) :: Fix f -> Fix f -> Bool #

(>=) :: Fix f -> Fix f -> Bool #

max :: Fix f -> Fix f -> Fix f #

min :: Fix f -> Fix f -> Fix f #

(Functor f, Ord1 f) => Ord (Mu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

compare :: Mu f -> Mu f -> Ordering #

(<) :: Mu f -> Mu f -> Bool #

(<=) :: Mu f -> Mu f -> Bool #

(>) :: Mu f -> Mu f -> Bool #

(>=) :: Mu f -> Mu f -> Bool #

max :: Mu f -> Mu f -> Mu f #

min :: Mu f -> Mu f -> Mu f #

(Functor f, Ord1 f) => Ord (Nu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

compare :: Nu f -> Nu f -> Ordering #

(<) :: Nu f -> Nu f -> Bool #

(<=) :: Nu f -> Nu f -> Bool #

(>) :: Nu f -> Nu f -> Bool #

(>=) :: Nu f -> Nu f -> Bool #

max :: Nu f -> Nu f -> Nu f #

min :: Nu f -> Nu f -> Nu f #

Ord a => Ord (V2 a) 
Instance details

Defined in Linear.V2

Methods

compare :: V2 a -> V2 a -> Ordering #

(<) :: V2 a -> V2 a -> Bool #

(<=) :: V2 a -> V2 a -> Bool #

(>) :: V2 a -> V2 a -> Bool #

(>=) :: V2 a -> V2 a -> Bool #

max :: V2 a -> V2 a -> V2 a #

min :: V2 a -> V2 a -> V2 a #

Ord t => Ord (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

compare :: TransInv t -> TransInv t -> Ordering #

(<) :: TransInv t -> TransInv t -> Bool #

(<=) :: TransInv t -> TransInv t -> Bool #

(>) :: TransInv t -> TransInv t -> Bool #

(>=) :: TransInv t -> TransInv t -> Bool #

max :: TransInv t -> TransInv t -> TransInv t #

min :: TransInv t -> TransInv t -> TransInv t #

(Ord (V a (N a)), Ord a) => Ord (Located a) 
Instance details

Defined in Diagrams.Located

Methods

compare :: Located a -> Located a -> Ordering #

(<) :: Located a -> Located a -> Bool #

(<=) :: Located a -> Located a -> Bool #

(>) :: Located a -> Located a -> Bool #

(>=) :: Located a -> Located a -> Bool #

max :: Located a -> Located a -> Located a #

min :: Located a -> Located a -> Located a #

Ord n => Ord (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

compare :: PolyOrientation n -> PolyOrientation n -> Ordering #

(<) :: PolyOrientation n -> PolyOrientation n -> Bool #

(<=) :: PolyOrientation n -> PolyOrientation n -> Bool #

(>) :: PolyOrientation n -> PolyOrientation n -> Bool #

(>=) :: PolyOrientation n -> PolyOrientation n -> Bool #

max :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n #

min :: PolyOrientation n -> PolyOrientation n -> PolyOrientation n #

Ord n => Ord (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

compare :: Extending n -> Extending n -> Ordering #

(<) :: Extending n -> Extending n -> Bool #

(<=) :: Extending n -> Extending n -> Bool #

(>) :: Extending n -> Extending n -> Bool #

(>=) :: Extending n -> Extending n -> Bool #

max :: Extending n -> Extending n -> Extending n #

min :: Extending n -> Extending n -> Extending n #

Ord n => Ord (Time n) 
Instance details

Defined in Data.Active

Methods

compare :: Time n -> Time n -> Ordering #

(<) :: Time n -> Time n -> Bool #

(<=) :: Time n -> Time n -> Bool #

(>) :: Time n -> Time n -> Bool #

(>=) :: Time n -> Time n -> Bool #

max :: Time n -> Time n -> Time n #

min :: Time n -> Time n -> Time n #

Ord a => Ord (V3 a) 
Instance details

Defined in Linear.V3

Methods

compare :: V3 a -> V3 a -> Ordering #

(<) :: V3 a -> V3 a -> Bool #

(<=) :: V3 a -> V3 a -> Bool #

(>) :: V3 a -> V3 a -> Bool #

(>=) :: V3 a -> V3 a -> Bool #

max :: V3 a -> V3 a -> V3 a #

min :: V3 a -> V3 a -> V3 a #

Ord n => Ord (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

compare :: Angle n -> Angle n -> Ordering #

(<) :: Angle n -> Angle n -> Bool #

(<=) :: Angle n -> Angle n -> Bool #

(>) :: Angle n -> Angle n -> Bool #

(>=) :: Angle n -> Angle n -> Bool #

max :: Angle n -> Angle n -> Angle n #

min :: Angle n -> Angle n -> Angle n #

Ord a => Ord (V1 a) 
Instance details

Defined in Linear.V1

Methods

compare :: V1 a -> V1 a -> Ordering #

(<) :: V1 a -> V1 a -> Bool #

(<=) :: V1 a -> V1 a -> Bool #

(>) :: V1 a -> V1 a -> Bool #

(>=) :: V1 a -> V1 a -> Bool #

max :: V1 a -> V1 a -> V1 a #

min :: V1 a -> V1 a -> V1 a #

Ord n => Ord (Duration n) 
Instance details

Defined in Data.Active

Methods

compare :: Duration n -> Duration n -> Ordering #

(<) :: Duration n -> Duration n -> Bool #

(<=) :: Duration n -> Duration n -> Bool #

(>) :: Duration n -> Duration n -> Bool #

(>=) :: Duration n -> Duration n -> Bool #

max :: Duration n -> Duration n -> Duration n #

min :: Duration n -> Duration n -> Duration n #

Ord a => Ord (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

compare :: Plucker a -> Plucker a -> Ordering #

(<) :: Plucker a -> Plucker a -> Bool #

(<=) :: Plucker a -> Plucker a -> Bool #

(>) :: Plucker a -> Plucker a -> Bool #

(>=) :: Plucker a -> Plucker a -> Bool #

max :: Plucker a -> Plucker a -> Plucker a #

min :: Plucker a -> Plucker a -> Plucker a #

Ord a => Ord (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

compare :: Quaternion a -> Quaternion a -> Ordering #

(<) :: Quaternion a -> Quaternion a -> Bool #

(<=) :: Quaternion a -> Quaternion a -> Bool #

(>) :: Quaternion a -> Quaternion a -> Bool #

(>=) :: Quaternion a -> Quaternion a -> Bool #

max :: Quaternion a -> Quaternion a -> Quaternion a #

min :: Quaternion a -> Quaternion a -> Quaternion a #

Ord (V0 a) 
Instance details

Defined in Linear.V0

Methods

compare :: V0 a -> V0 a -> Ordering #

(<) :: V0 a -> V0 a -> Bool #

(<=) :: V0 a -> V0 a -> Bool #

(>) :: V0 a -> V0 a -> Bool #

(>=) :: V0 a -> V0 a -> Bool #

max :: V0 a -> V0 a -> V0 a #

min :: V0 a -> V0 a -> V0 a #

Ord a => Ord (V4 a) 
Instance details

Defined in Linear.V4

Methods

compare :: V4 a -> V4 a -> Ordering #

(<) :: V4 a -> V4 a -> Bool #

(<=) :: V4 a -> V4 a -> Bool #

(>) :: V4 a -> V4 a -> Bool #

(>=) :: V4 a -> V4 a -> Bool #

max :: V4 a -> V4 a -> V4 a #

min :: V4 a -> V4 a -> V4 a #

(Ord a, Ord b) => Ord (Either a b)

Since: base-2.1

Instance details

Defined in Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering #

(<) :: Either a b -> Either a b -> Bool #

(<=) :: Either a b -> Either a b -> Bool #

(>) :: Either a b -> Either a b -> Bool #

(>=) :: Either a b -> Either a b -> Bool #

max :: Either a b -> Either a b -> Either a b #

min :: Either a b -> Either a b -> Either a b #

Ord (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: V1 p -> V1 p -> Ordering #

(<) :: V1 p -> V1 p -> Bool #

(<=) :: V1 p -> V1 p -> Bool #

(>) :: V1 p -> V1 p -> Bool #

(>=) :: V1 p -> V1 p -> Bool #

max :: V1 p -> V1 p -> V1 p #

min :: V1 p -> V1 p -> V1 p #

Ord (U1 p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: U1 p -> U1 p -> Ordering #

(<) :: U1 p -> U1 p -> Bool #

(<=) :: U1 p -> U1 p -> Bool #

(>) :: U1 p -> U1 p -> Bool #

(>=) :: U1 p -> U1 p -> Bool #

max :: U1 p -> U1 p -> U1 p #

min :: U1 p -> U1 p -> U1 p #

Ord (TypeRep a)

Since: base-4.4.0.0

Instance details

Defined in Data.Typeable.Internal

Methods

compare :: TypeRep a -> TypeRep a -> Ordering #

(<) :: TypeRep a -> TypeRep a -> Bool #

(<=) :: TypeRep a -> TypeRep a -> Bool #

(>) :: TypeRep a -> TypeRep a -> Bool #

(>=) :: TypeRep a -> TypeRep a -> Bool #

max :: TypeRep a -> TypeRep a -> TypeRep a #

min :: TypeRep a -> TypeRep a -> TypeRep a #

(Ord a, Ord b) => Ord (a, b) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b) -> (a, b) -> Ordering #

(<) :: (a, b) -> (a, b) -> Bool #

(<=) :: (a, b) -> (a, b) -> Bool #

(>) :: (a, b) -> (a, b) -> Bool #

(>=) :: (a, b) -> (a, b) -> Bool #

max :: (a, b) -> (a, b) -> (a, b) #

min :: (a, b) -> (a, b) -> (a, b) #

(Ord k, Ord v) => Ord (HashMap k v)

The order is total.

Note: Because the hash is not guaranteed to be stable across library + versions, OSes, or architectures, neither is an actual order of elements in + HashMap or an result of compare.is stable.

Instance details

Defined in Data.HashMap.Base

Methods

compare :: HashMap k v -> HashMap k v -> Ordering #

(<) :: HashMap k v -> HashMap k v -> Bool #

(<=) :: HashMap k v -> HashMap k v -> Bool #

(>) :: HashMap k v -> HashMap k v -> Bool #

(>=) :: HashMap k v -> HashMap k v -> Bool #

max :: HashMap k v -> HashMap k v -> HashMap k v #

min :: HashMap k v -> HashMap k v -> HashMap k v #

(Ord k, Ord v) => Ord (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

compare :: Map k v -> Map k v -> Ordering #

(<) :: Map k v -> Map k v -> Bool #

(<=) :: Map k v -> Map k v -> Bool #

(>) :: Map k v -> Map k v -> Bool #

(>=) :: Map k v -> Map k v -> Bool #

max :: Map k v -> Map k v -> Map k v #

min :: Map k v -> Map k v -> Map k v #

(Ix ix, Ord e, IArray UArray e) => Ord (UArray ix e) 
Instance details

Defined in Data.Array.Base

Methods

compare :: UArray ix e -> UArray ix e -> Ordering #

(<) :: UArray ix e -> UArray ix e -> Bool #

(<=) :: UArray ix e -> UArray ix e -> Bool #

(>) :: UArray ix e -> UArray ix e -> Bool #

(>=) :: UArray ix e -> UArray ix e -> Bool #

max :: UArray ix e -> UArray ix e -> UArray ix e #

min :: UArray ix e -> UArray ix e -> UArray ix e #

(Ix i, Ord e) => Ord (Array i e)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

compare :: Array i e -> Array i e -> Ordering #

(<) :: Array i e -> Array i e -> Bool #

(<=) :: Array i e -> Array i e -> Bool #

(>) :: Array i e -> Array i e -> Bool #

(>=) :: Array i e -> Array i e -> Bool #

max :: Array i e -> Array i e -> Array i e #

min :: Array i e -> Array i e -> Array i e #

Ord a => Ord (Arg a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

compare :: Arg a b -> Arg a b -> Ordering #

(<) :: Arg a b -> Arg a b -> Bool #

(<=) :: Arg a b -> Arg a b -> Bool #

(>) :: Arg a b -> Arg a b -> Bool #

(>=) :: Arg a b -> Arg a b -> Bool #

max :: Arg a b -> Arg a b -> Arg a b #

min :: Arg a b -> Arg a b -> Arg a b #

Ord (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

compare :: Proxy s -> Proxy s -> Ordering #

(<) :: Proxy s -> Proxy s -> Bool #

(<=) :: Proxy s -> Proxy s -> Bool #

(>) :: Proxy s -> Proxy s -> Bool #

(>=) :: Proxy s -> Proxy s -> Bool #

max :: Proxy s -> Proxy s -> Proxy s #

min :: Proxy s -> Proxy s -> Proxy s #

(Ord a, Ord b) => Ord (Bimap a b) 
Instance details

Defined in Data.Bimap

Methods

compare :: Bimap a b -> Bimap a b -> Ordering #

(<) :: Bimap a b -> Bimap a b -> Bool #

(<=) :: Bimap a b -> Bimap a b -> Bool #

(>) :: Bimap a b -> Bimap a b -> Bool #

(>=) :: Bimap a b -> Bimap a b -> Bool #

max :: Bimap a b -> Bimap a b -> Bimap a b #

min :: Bimap a b -> Bimap a b -> Bimap a b #

(Ord1 m, Ord a) => Ord (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

compare :: MaybeT m a -> MaybeT m a -> Ordering #

(<) :: MaybeT m a -> MaybeT m a -> Bool #

(<=) :: MaybeT m a -> MaybeT m a -> Bool #

(>) :: MaybeT m a -> MaybeT m a -> Bool #

(>=) :: MaybeT m a -> MaybeT m a -> Bool #

max :: MaybeT m a -> MaybeT m a -> MaybeT m a #

min :: MaybeT m a -> MaybeT m a -> MaybeT m a #

(Ord a, Ord (s a)) => Ord (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: ViewL s a -> ViewL s a -> Ordering #

(<) :: ViewL s a -> ViewL s a -> Bool #

(<=) :: ViewL s a -> ViewL s a -> Bool #

(>) :: ViewL s a -> ViewL s a -> Bool #

(>=) :: ViewL s a -> ViewL s a -> Bool #

max :: ViewL s a -> ViewL s a -> ViewL s a #

min :: ViewL s a -> ViewL s a -> ViewL s a #

(Ord a, Ord (s a)) => Ord (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: ViewR s a -> ViewR s a -> Ordering #

(<) :: ViewR s a -> ViewR s a -> Bool #

(<=) :: ViewR s a -> ViewR s a -> Bool #

(>) :: ViewR s a -> ViewR s a -> Bool #

(>=) :: ViewR s a -> ViewR s a -> Bool #

max :: ViewR s a -> ViewR s a -> ViewR s a #

min :: ViewR s a -> ViewR s a -> ViewR s a #

Ord a => Ord (FingerTree v a)

Lexicographical order from left to right.

Instance details

Defined in Data.FingerTree

Methods

compare :: FingerTree v a -> FingerTree v a -> Ordering #

(<) :: FingerTree v a -> FingerTree v a -> Bool #

(<=) :: FingerTree v a -> FingerTree v a -> Bool #

(>) :: FingerTree v a -> FingerTree v a -> Bool #

(>=) :: FingerTree v a -> FingerTree v a -> Bool #

max :: FingerTree v a -> FingerTree v a -> FingerTree v a #

min :: FingerTree v a -> FingerTree v a -> FingerTree v a #

Ord a => Ord (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Methods

compare :: SearchResult v a -> SearchResult v a -> Ordering #

(<) :: SearchResult v a -> SearchResult v a -> Bool #

(<=) :: SearchResult v a -> SearchResult v a -> Bool #

(>) :: SearchResult v a -> SearchResult v a -> Bool #

(>=) :: SearchResult v a -> SearchResult v a -> Bool #

max :: SearchResult v a -> SearchResult v a -> SearchResult v a #

min :: SearchResult v a -> SearchResult v a -> SearchResult v a #

(Generic1 f, Ord1 (Rep1 f), Ord a) => Ord (Generically1 f a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

compare :: Generically1 f a -> Generically1 f a -> Ordering #

(<) :: Generically1 f a -> Generically1 f a -> Bool #

(<=) :: Generically1 f a -> Generically1 f a -> Bool #

(>) :: Generically1 f a -> Generically1 f a -> Bool #

(>=) :: Generically1 f a -> Generically1 f a -> Bool #

max :: Generically1 f a -> Generically1 f a -> Generically1 f a #

min :: Generically1 f a -> Generically1 f a -> Generically1 f a #

Ord (ConId a) 
Instance details

Defined in Generic.Data.Internal.Meta

Methods

compare :: ConId a -> ConId a -> Ordering #

(<) :: ConId a -> ConId a -> Bool #

(<=) :: ConId a -> ConId a -> Bool #

(>) :: ConId a -> ConId a -> Bool #

(>=) :: ConId a -> ConId a -> Bool #

max :: ConId a -> ConId a -> ConId a #

min :: ConId a -> ConId a -> ConId a #

Ord (GConId r) 
Instance details

Defined in Generic.Data.Internal.Meta

Methods

compare :: GConId r -> GConId r -> Ordering #

(<) :: GConId r -> GConId r -> Bool #

(<=) :: GConId r -> GConId r -> Bool #

(>) :: GConId r -> GConId r -> Bool #

(>=) :: GConId r -> GConId r -> Bool #

max :: GConId r -> GConId r -> GConId r #

min :: GConId r -> GConId r -> GConId r #

(Ord t, KnownNat m) => Ord (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

compare :: Mod m t -> Mod m t -> Ordering #

(<) :: Mod m t -> Mod m t -> Bool #

(<=) :: Mod m t -> Mod m t -> Bool #

(>) :: Mod m t -> Mod m t -> Bool #

(>=) :: Mod m t -> Mod m t -> Bool #

max :: Mod m t -> Mod m t -> Mod m t #

min :: Mod m t -> Mod m t -> Mod m t #

(Ord1 m, Ord a) => Ord (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

compare :: ListT m a -> ListT m a -> Ordering #

(<) :: ListT m a -> ListT m a -> Bool #

(<=) :: ListT m a -> ListT m a -> Bool #

(>) :: ListT m a -> ListT m a -> Bool #

(>=) :: ListT m a -> ListT m a -> Bool #

max :: ListT m a -> ListT m a -> ListT m a #

min :: ListT m a -> ListT m a -> ListT m a #

(Ix i, Show i, Ord e) => Ord (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

compare :: AbstractArray i e -> AbstractArray i e -> Ordering #

(<) :: AbstractArray i e -> AbstractArray i e -> Bool #

(<=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>=) :: AbstractArray i e -> AbstractArray i e -> Bool #

max :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

min :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

(Ord a, Ord b) => Ord (ListF a b) 
Instance details

Defined in Data.Functor.Foldable

Methods

compare :: ListF a b -> ListF a b -> Ordering #

(<) :: ListF a b -> ListF a b -> Bool #

(<=) :: ListF a b -> ListF a b -> Bool #

(>) :: ListF a b -> ListF a b -> Bool #

(>=) :: ListF a b -> ListF a b -> Bool #

max :: ListF a b -> ListF a b -> ListF a b #

min :: ListF a b -> ListF a b -> ListF a b #

(Ord1 f, Ord a) => Ord (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

compare :: Cofree f a -> Cofree f a -> Ordering #

(<) :: Cofree f a -> Cofree f a -> Bool #

(<=) :: Cofree f a -> Cofree f a -> Bool #

(>) :: Cofree f a -> Cofree f a -> Bool #

(>=) :: Cofree f a -> Cofree f a -> Bool #

max :: Cofree f a -> Cofree f a -> Cofree f a #

min :: Cofree f a -> Cofree f a -> Cofree f a #

(Ord1 f, Ord a) => Ord (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

compare :: Free f a -> Free f a -> Ordering #

(<) :: Free f a -> Free f a -> Bool #

(<=) :: Free f a -> Free f a -> Bool #

(>) :: Free f a -> Free f a -> Bool #

(>=) :: Free f a -> Free f a -> Bool #

max :: Free f a -> Free f a -> Free f a #

min :: Free f a -> Free f a -> Free f a #

(Ord a, Ord b) => Ord (NonEmptyF a b) 
Instance details

Defined in Data.Functor.Base

Methods

compare :: NonEmptyF a b -> NonEmptyF a b -> Ordering #

(<) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

(<=) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

(>) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

(>=) :: NonEmptyF a b -> NonEmptyF a b -> Bool #

max :: NonEmptyF a b -> NonEmptyF a b -> NonEmptyF a b #

min :: NonEmptyF a b -> NonEmptyF a b -> NonEmptyF a b #

Ord (f a) => Ord (Point f a) 
Instance details

Defined in Linear.Affine

Methods

compare :: Point f a -> Point f a -> Ordering #

(<) :: Point f a -> Point f a -> Bool #

(<=) :: Point f a -> Point f a -> Bool #

(>) :: Point f a -> Point f a -> Bool #

(>=) :: Point f a -> Point f a -> Bool #

max :: Point f a -> Point f a -> Point f a #

min :: Point f a -> Point f a -> Point f a #

Ord (v n) => Ord (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

compare :: Path v n -> Path v n -> Ordering #

(<) :: Path v n -> Path v n -> Bool #

(<=) :: Path v n -> Path v n -> Bool #

(>) :: Path v n -> Path v n -> Bool #

(>=) :: Path v n -> Path v n -> Bool #

max :: Path v n -> Path v n -> Path v n #

min :: Path v n -> Path v n -> Path v n #

Ord (v n) => Ord (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: Trail v n -> Trail v n -> Ordering #

(<) :: Trail v n -> Trail v n -> Bool #

(<=) :: Trail v n -> Trail v n -> Bool #

(>) :: Trail v n -> Trail v n -> Bool #

(>=) :: Trail v n -> Trail v n -> Bool #

max :: Trail v n -> Trail v n -> Trail v n #

min :: Trail v n -> Trail v n -> Trail v n #

(Ord i, Ord a) => Ord (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

compare :: Level i a -> Level i a -> Ordering #

(<) :: Level i a -> Level i a -> Bool #

(<=) :: Level i a -> Level i a -> Bool #

(>) :: Level i a -> Level i a -> Bool #

(>=) :: Level i a -> Level i a -> Bool #

max :: Level i a -> Level i a -> Level i a #

min :: Level i a -> Level i a -> Level i a #

Ord (v n) => Ord (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: SegTree v n -> SegTree v n -> Ordering #

(<) :: SegTree v n -> SegTree v n -> Bool #

(<=) :: SegTree v n -> SegTree v n -> Bool #

(>) :: SegTree v n -> SegTree v n -> Bool #

(>=) :: SegTree v n -> SegTree v n -> Bool #

max :: SegTree v n -> SegTree v n -> SegTree v n #

min :: SegTree v n -> SegTree v n -> SegTree v n #

Ord (v n) => Ord (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

compare :: Direction v n -> Direction v n -> Ordering #

(<) :: Direction v n -> Direction v n -> Bool #

(<=) :: Direction v n -> Direction v n -> Bool #

(>) :: Direction v n -> Direction v n -> Bool #

(>=) :: Direction v n -> Direction v n -> Bool #

max :: Direction v n -> Direction v n -> Direction v n #

min :: Direction v n -> Direction v n -> Direction v n #

(Ord a, Ord b) => Ord (a :& b) 
Instance details

Defined in Diagrams.Coordinates

Methods

compare :: (a :& b) -> (a :& b) -> Ordering #

(<) :: (a :& b) -> (a :& b) -> Bool #

(<=) :: (a :& b) -> (a :& b) -> Bool #

(>) :: (a :& b) -> (a :& b) -> Bool #

(>=) :: (a :& b) -> (a :& b) -> Bool #

max :: (a :& b) -> (a :& b) -> a :& b #

min :: (a :& b) -> (a :& b) -> a :& b #

(Ord1 f, Ord a) => Ord (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

compare :: Yoneda f a -> Yoneda f a -> Ordering #

(<) :: Yoneda f a -> Yoneda f a -> Bool #

(<=) :: Yoneda f a -> Yoneda f a -> Bool #

(>) :: Yoneda f a -> Yoneda f a -> Bool #

(>=) :: Yoneda f a -> Yoneda f a -> Bool #

max :: Yoneda f a -> Yoneda f a -> Yoneda f a #

min :: Yoneda f a -> Yoneda f a -> Yoneda f a #

Ord (f p) => Ord (Rec1 f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: Rec1 f p -> Rec1 f p -> Ordering #

(<) :: Rec1 f p -> Rec1 f p -> Bool #

(<=) :: Rec1 f p -> Rec1 f p -> Bool #

(>) :: Rec1 f p -> Rec1 f p -> Bool #

(>=) :: Rec1 f p -> Rec1 f p -> Bool #

max :: Rec1 f p -> Rec1 f p -> Rec1 f p #

min :: Rec1 f p -> Rec1 f p -> Rec1 f p #

Ord (URec (Ptr ()) p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering #

(<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

(>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool #

max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #

min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p #

Ord (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering #

(<) :: URec Char p -> URec Char p -> Bool #

(<=) :: URec Char p -> URec Char p -> Bool #

(>) :: URec Char p -> URec Char p -> Bool #

(>=) :: URec Char p -> URec Char p -> Bool #

max :: URec Char p -> URec Char p -> URec Char p #

min :: URec Char p -> URec Char p -> URec Char p #

Ord (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering #

(<) :: URec Double p -> URec Double p -> Bool #

(<=) :: URec Double p -> URec Double p -> Bool #

(>) :: URec Double p -> URec Double p -> Bool #

(>=) :: URec Double p -> URec Double p -> Bool #

max :: URec Double p -> URec Double p -> URec Double p #

min :: URec Double p -> URec Double p -> URec Double p #

Ord (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering #

(<) :: URec Float p -> URec Float p -> Bool #

(<=) :: URec Float p -> URec Float p -> Bool #

(>) :: URec Float p -> URec Float p -> Bool #

(>=) :: URec Float p -> URec Float p -> Bool #

max :: URec Float p -> URec Float p -> URec Float p #

min :: URec Float p -> URec Float p -> URec Float p #

Ord (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering #

(<) :: URec Int p -> URec Int p -> Bool #

(<=) :: URec Int p -> URec Int p -> Bool #

(>) :: URec Int p -> URec Int p -> Bool #

(>=) :: URec Int p -> URec Int p -> Bool #

max :: URec Int p -> URec Int p -> URec Int p #

min :: URec Int p -> URec Int p -> URec Int p #

Ord (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering #

(<) :: URec Word p -> URec Word p -> Bool #

(<=) :: URec Word p -> URec Word p -> Bool #

(>) :: URec Word p -> URec Word p -> Bool #

(>=) :: URec Word p -> URec Word p -> Bool #

max :: URec Word p -> URec Word p -> URec Word p #

min :: URec Word p -> URec Word p -> URec Word p #

(Ord a, Ord b, Ord c) => Ord (a, b, c) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c) -> (a, b, c) -> Ordering #

(<) :: (a, b, c) -> (a, b, c) -> Bool #

(<=) :: (a, b, c) -> (a, b, c) -> Bool #

(>) :: (a, b, c) -> (a, b, c) -> Bool #

(>=) :: (a, b, c) -> (a, b, c) -> Bool #

max :: (a, b, c) -> (a, b, c) -> (a, b, c) #

min :: (a, b, c) -> (a, b, c) -> (a, b, c) #

Ord a => Ord (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

compare :: Const a b -> Const a b -> Ordering #

(<) :: Const a b -> Const a b -> Bool #

(<=) :: Const a b -> Const a b -> Bool #

(>) :: Const a b -> Const a b -> Bool #

(>=) :: Const a b -> Const a b -> Bool #

max :: Const a b -> Const a b -> Const a b #

min :: Const a b -> Const a b -> Const a b #

Ord (f a) => Ord (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

compare :: Ap f a -> Ap f a -> Ordering #

(<) :: Ap f a -> Ap f a -> Bool #

(<=) :: Ap f a -> Ap f a -> Bool #

(>) :: Ap f a -> Ap f a -> Bool #

(>=) :: Ap f a -> Ap f a -> Bool #

max :: Ap f a -> Ap f a -> Ap f a #

min :: Ap f a -> Ap f a -> Ap f a #

Ord (f a) => Ord (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

compare :: Alt f a -> Alt f a -> Ordering #

(<) :: Alt f a -> Alt f a -> Bool #

(<=) :: Alt f a -> Alt f a -> Bool #

(>) :: Alt f a -> Alt f a -> Bool #

(>=) :: Alt f a -> Alt f a -> Bool #

max :: Alt f a -> Alt f a -> Alt f a #

min :: Alt f a -> Alt f a -> Alt f a #

Ord (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

compare :: (a :~: b) -> (a :~: b) -> Ordering #

(<) :: (a :~: b) -> (a :~: b) -> Bool #

(<=) :: (a :~: b) -> (a :~: b) -> Bool #

(>) :: (a :~: b) -> (a :~: b) -> Bool #

(>=) :: (a :~: b) -> (a :~: b) -> Bool #

max :: (a :~: b) -> (a :~: b) -> a :~: b #

min :: (a :~: b) -> (a :~: b) -> a :~: b #

Ord (p a a) => Ord (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

compare :: Join p a -> Join p a -> Ordering #

(<) :: Join p a -> Join p a -> Bool #

(<=) :: Join p a -> Join p a -> Bool #

(>) :: Join p a -> Join p a -> Bool #

(>=) :: Join p a -> Join p a -> Bool #

max :: Join p a -> Join p a -> Join p a #

min :: Join p a -> Join p a -> Join p a #

Ord (p (Fix p a) a) => Ord (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

compare :: Fix p a -> Fix p a -> Ordering #

(<) :: Fix p a -> Fix p a -> Bool #

(<=) :: Fix p a -> Fix p a -> Bool #

(>) :: Fix p a -> Fix p a -> Bool #

(>=) :: Fix p a -> Fix p a -> Bool #

max :: Fix p a -> Fix p a -> Fix p a #

min :: Fix p a -> Fix p a -> Fix p a #

(Ord1 f, Ord a) => Ord (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

compare :: IdentityT f a -> IdentityT f a -> Ordering #

(<) :: IdentityT f a -> IdentityT f a -> Bool #

(<=) :: IdentityT f a -> IdentityT f a -> Bool #

(>) :: IdentityT f a -> IdentityT f a -> Bool #

(>=) :: IdentityT f a -> IdentityT f a -> Bool #

max :: IdentityT f a -> IdentityT f a -> IdentityT f a #

min :: IdentityT f a -> IdentityT f a -> IdentityT f a #

(Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

compare :: ExceptT e m a -> ExceptT e m a -> Ordering #

(<) :: ExceptT e m a -> ExceptT e m a -> Bool #

(<=) :: ExceptT e m a -> ExceptT e m a -> Bool #

(>) :: ExceptT e m a -> ExceptT e m a -> Bool #

(>=) :: ExceptT e m a -> ExceptT e m a -> Bool #

max :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

min :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering #

(<) :: WriterT w m a -> WriterT w m a -> Bool #

(<=) :: WriterT w m a -> WriterT w m a -> Bool #

(>) :: WriterT w m a -> WriterT w m a -> Bool #

(>=) :: WriterT w m a -> WriterT w m a -> Bool #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a #

(Ord e, Ord1 m, Ord a) => Ord (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

compare :: ErrorT e m a -> ErrorT e m a -> Ordering #

(<) :: ErrorT e m a -> ErrorT e m a -> Bool #

(<=) :: ErrorT e m a -> ErrorT e m a -> Bool #

(>) :: ErrorT e m a -> ErrorT e m a -> Bool #

(>=) :: ErrorT e m a -> ErrorT e m a -> Bool #

max :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

min :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

(Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

compare :: WriterT w m a -> WriterT w m a -> Ordering #

(<) :: WriterT w m a -> WriterT w m a -> Bool #

(<=) :: WriterT w m a -> WriterT w m a -> Bool #

(>) :: WriterT w m a -> WriterT w m a -> Bool #

(>=) :: WriterT w m a -> WriterT w m a -> Bool #

max :: WriterT w m a -> WriterT w m a -> WriterT w m a #

min :: WriterT w m a -> WriterT w m a -> WriterT w m a #

Ord b => Ord (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

compare :: Tagged s b -> Tagged s b -> Ordering #

(<) :: Tagged s b -> Tagged s b -> Bool #

(<=) :: Tagged s b -> Tagged s b -> Bool #

(>) :: Tagged s b -> Tagged s b -> Bool #

(>=) :: Tagged s b -> Tagged s b -> Bool #

max :: Tagged s b -> Tagged s b -> Tagged s b #

min :: Tagged s b -> Tagged s b -> Tagged s b #

(Ord1 f, Ord a) => Ord (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

compare :: Backwards f a -> Backwards f a -> Ordering #

(<) :: Backwards f a -> Backwards f a -> Bool #

(<=) :: Backwards f a -> Backwards f a -> Bool #

(>) :: Backwards f a -> Backwards f a -> Bool #

(>=) :: Backwards f a -> Backwards f a -> Bool #

max :: Backwards f a -> Backwards f a -> Backwards f a #

min :: Backwards f a -> Backwards f a -> Backwards f a #

Ord (w (CofreeF f a (CofreeT f w a))) => Ord (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeT f w a -> CofreeT f w a -> Ordering #

(<) :: CofreeT f w a -> CofreeT f w a -> Bool #

(<=) :: CofreeT f w a -> CofreeT f w a -> Bool #

(>) :: CofreeT f w a -> CofreeT f w a -> Bool #

(>=) :: CofreeT f w a -> CofreeT f w a -> Bool #

max :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #

min :: CofreeT f w a -> CofreeT f w a -> CofreeT f w a #

(Ord a, Ord (f b)) => Ord (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

compare :: CofreeF f a b -> CofreeF f a b -> Ordering #

(<) :: CofreeF f a b -> CofreeF f a b -> Bool #

(<=) :: CofreeF f a b -> CofreeF f a b -> Bool #

(>) :: CofreeF f a b -> CofreeF f a b -> Bool #

(>=) :: CofreeF f a b -> CofreeF f a b -> Bool #

max :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #

min :: CofreeF f a b -> CofreeF f a b -> CofreeF f a b #

(Ord1 f, Ord1 m, Ord a) => Ord (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeT f m a -> FreeT f m a -> Ordering #

(<) :: FreeT f m a -> FreeT f m a -> Bool #

(<=) :: FreeT f m a -> FreeT f m a -> Bool #

(>) :: FreeT f m a -> FreeT f m a -> Bool #

(>=) :: FreeT f m a -> FreeT f m a -> Bool #

max :: FreeT f m a -> FreeT f m a -> FreeT f m a #

min :: FreeT f m a -> FreeT f m a -> FreeT f m a #

(Ord a, Ord (f b)) => Ord (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

compare :: FreeF f a b -> FreeF f a b -> Ordering #

(<) :: FreeF f a b -> FreeF f a b -> Bool #

(<=) :: FreeF f a b -> FreeF f a b -> Bool #

(>) :: FreeF f a b -> FreeF f a b -> Bool #

(>=) :: FreeF f a b -> FreeF f a b -> Bool #

max :: FreeF f a b -> FreeF f a b -> FreeF f a b #

min :: FreeF f a b -> FreeF f a b -> FreeF f a b #

Ord (v n) => Ord (Segment c v n) 
Instance details

Defined in Diagrams.Segment

Methods

compare :: Segment c v n -> Segment c v n -> Ordering #

(<) :: Segment c v n -> Segment c v n -> Bool #

(<=) :: Segment c v n -> Segment c v n -> Bool #

(>) :: Segment c v n -> Segment c v n -> Bool #

(>=) :: Segment c v n -> Segment c v n -> Bool #

max :: Segment c v n -> Segment c v n -> Segment c v n #

min :: Segment c v n -> Segment c v n -> Segment c v n #

Ord (v n) => Ord (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

compare :: Trail' l v n -> Trail' l v n -> Ordering #

(<) :: Trail' l v n -> Trail' l v n -> Bool #

(<=) :: Trail' l v n -> Trail' l v n -> Bool #

(>) :: Trail' l v n -> Trail' l v n -> Bool #

(>=) :: Trail' l v n -> Trail' l v n -> Bool #

max :: Trail' l v n -> Trail' l v n -> Trail' l v n #

min :: Trail' l v n -> Trail' l v n -> Trail' l v n #

Ord (v n) => Ord (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

compare :: Offset c v n -> Offset c v n -> Ordering #

(<) :: Offset c v n -> Offset c v n -> Bool #

(<=) :: Offset c v n -> Offset c v n -> Bool #

(>) :: Offset c v n -> Offset c v n -> Bool #

(>=) :: Offset c v n -> Offset c v n -> Bool #

max :: Offset c v n -> Offset c v n -> Offset c v n #

min :: Offset c v n -> Offset c v n -> Offset c v n #

Ord a => Ord (V n a) 
Instance details

Defined in Linear.V

Methods

compare :: V n a -> V n a -> Ordering #

(<) :: V n a -> V n a -> Bool #

(<=) :: V n a -> V n a -> Bool #

(>) :: V n a -> V n a -> Bool #

(>=) :: V n a -> V n a -> Bool #

max :: V n a -> V n a -> V n a #

min :: V n a -> V n a -> V n a #

Ord c => Ord (K1 i c p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: K1 i c p -> K1 i c p -> Ordering #

(<) :: K1 i c p -> K1 i c p -> Bool #

(<=) :: K1 i c p -> K1 i c p -> Bool #

(>) :: K1 i c p -> K1 i c p -> Bool #

(>=) :: K1 i c p -> K1 i c p -> Bool #

max :: K1 i c p -> K1 i c p -> K1 i c p #

min :: K1 i c p -> K1 i c p -> K1 i c p #

(Ord (f p), Ord (g p)) => Ord ((f :+: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: (f :+: g) p -> (f :+: g) p -> Ordering #

(<) :: (f :+: g) p -> (f :+: g) p -> Bool #

(<=) :: (f :+: g) p -> (f :+: g) p -> Bool #

(>) :: (f :+: g) p -> (f :+: g) p -> Bool #

(>=) :: (f :+: g) p -> (f :+: g) p -> Bool #

max :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #

min :: (f :+: g) p -> (f :+: g) p -> (f :+: g) p #

(Ord (f p), Ord (g p)) => Ord ((f :*: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: (f :*: g) p -> (f :*: g) p -> Ordering #

(<) :: (f :*: g) p -> (f :*: g) p -> Bool #

(<=) :: (f :*: g) p -> (f :*: g) p -> Bool #

(>) :: (f :*: g) p -> (f :*: g) p -> Bool #

(>=) :: (f :*: g) p -> (f :*: g) p -> Bool #

max :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

min :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d) -> (a, b, c, d) -> Ordering #

(<) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(<=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(>) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

(>=) :: (a, b, c, d) -> (a, b, c, d) -> Bool #

max :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

min :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

(Ord1 f, Ord1 g, Ord a) => Ord (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

compare :: Product f g a -> Product f g a -> Ordering #

(<) :: Product f g a -> Product f g a -> Bool #

(<=) :: Product f g a -> Product f g a -> Bool #

(>) :: Product f g a -> Product f g a -> Bool #

(>=) :: Product f g a -> Product f g a -> Bool #

max :: Product f g a -> Product f g a -> Product f g a #

min :: Product f g a -> Product f g a -> Product f g a #

(Ord1 f, Ord1 g, Ord a) => Ord (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

compare :: Sum f g a -> Sum f g a -> Ordering #

(<) :: Sum f g a -> Sum f g a -> Bool #

(<=) :: Sum f g a -> Sum f g a -> Bool #

(>) :: Sum f g a -> Sum f g a -> Bool #

(>=) :: Sum f g a -> Sum f g a -> Bool #

max :: Sum f g a -> Sum f g a -> Sum f g a #

min :: Sum f g a -> Sum f g a -> Sum f g a #

Ord (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

compare :: (a :~~: b) -> (a :~~: b) -> Ordering #

(<) :: (a :~~: b) -> (a :~~: b) -> Bool #

(<=) :: (a :~~: b) -> (a :~~: b) -> Bool #

(>) :: (a :~~: b) -> (a :~~: b) -> Bool #

(>=) :: (a :~~: b) -> (a :~~: b) -> Bool #

max :: (a :~~: b) -> (a :~~: b) -> a :~~: b #

min :: (a :~~: b) -> (a :~~: b) -> a :~~: b #

Ord (f p) => Ord (M1 i c f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: M1 i c f p -> M1 i c f p -> Ordering #

(<) :: M1 i c f p -> M1 i c f p -> Bool #

(<=) :: M1 i c f p -> M1 i c f p -> Bool #

(>) :: M1 i c f p -> M1 i c f p -> Bool #

(>=) :: M1 i c f p -> M1 i c f p -> Bool #

max :: M1 i c f p -> M1 i c f p -> M1 i c f p #

min :: M1 i c f p -> M1 i c f p -> M1 i c f p #

Ord (f (g p)) => Ord ((f :.: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: (f :.: g) p -> (f :.: g) p -> Ordering #

(<) :: (f :.: g) p -> (f :.: g) p -> Bool #

(<=) :: (f :.: g) p -> (f :.: g) p -> Bool #

(>) :: (f :.: g) p -> (f :.: g) p -> Bool #

(>=) :: (f :.: g) p -> (f :.: g) p -> Bool #

max :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

min :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

(Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e) -> (a, b, c, d, e) -> Ordering #

(<) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(<=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

(>=) :: (a, b, c, d, e) -> (a, b, c, d, e) -> Bool #

max :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

min :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

(Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

compare :: Compose f g a -> Compose f g a -> Ordering #

(<) :: Compose f g a -> Compose f g a -> Bool #

(<=) :: Compose f g a -> Compose f g a -> Bool #

(>) :: Compose f g a -> Compose f g a -> Bool #

(>=) :: Compose f g a -> Compose f g a -> Bool #

max :: Compose f g a -> Compose f g a -> Compose f g a #

min :: Compose f g a -> Compose f g a -> Compose f g a #

Ord (p a b) => Ord (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

compare :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Ordering #

(<) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(<=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(>) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

(>=) :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> Bool #

max :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #

min :: WrappedBifunctor p a b -> WrappedBifunctor p a b -> WrappedBifunctor p a b #

Ord (g b) => Ord (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

compare :: Joker g a b -> Joker g a b -> Ordering #

(<) :: Joker g a b -> Joker g a b -> Bool #

(<=) :: Joker g a b -> Joker g a b -> Bool #

(>) :: Joker g a b -> Joker g a b -> Bool #

(>=) :: Joker g a b -> Joker g a b -> Bool #

max :: Joker g a b -> Joker g a b -> Joker g a b #

min :: Joker g a b -> Joker g a b -> Joker g a b #

Ord (p b a) => Ord (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

compare :: Flip p a b -> Flip p a b -> Ordering #

(<) :: Flip p a b -> Flip p a b -> Bool #

(<=) :: Flip p a b -> Flip p a b -> Bool #

(>) :: Flip p a b -> Flip p a b -> Bool #

(>=) :: Flip p a b -> Flip p a b -> Bool #

max :: Flip p a b -> Flip p a b -> Flip p a b #

min :: Flip p a b -> Flip p a b -> Flip p a b #

Ord (f a) => Ord (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

compare :: Clown f a b -> Clown f a b -> Ordering #

(<) :: Clown f a b -> Clown f a b -> Bool #

(<=) :: Clown f a b -> Clown f a b -> Bool #

(>) :: Clown f a b -> Clown f a b -> Bool #

(>=) :: Clown f a b -> Clown f a b -> Bool #

max :: Clown f a b -> Clown f a b -> Clown f a b #

min :: Clown f a b -> Clown f a b -> Clown f a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Ordering #

(<) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(<=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(>) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

(>=) :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> Bool #

max :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

min :: (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

(Ord (p a b), Ord (q a b)) => Ord (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

compare :: Sum p q a b -> Sum p q a b -> Ordering #

(<) :: Sum p q a b -> Sum p q a b -> Bool #

(<=) :: Sum p q a b -> Sum p q a b -> Bool #

(>) :: Sum p q a b -> Sum p q a b -> Bool #

(>=) :: Sum p q a b -> Sum p q a b -> Bool #

max :: Sum p q a b -> Sum p q a b -> Sum p q a b #

min :: Sum p q a b -> Sum p q a b -> Sum p q a b #

(Ord (f a b), Ord (g a b)) => Ord (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

compare :: Product f g a b -> Product f g a b -> Ordering #

(<) :: Product f g a b -> Product f g a b -> Bool #

(<=) :: Product f g a b -> Product f g a b -> Bool #

(>) :: Product f g a b -> Product f g a b -> Bool #

(>=) :: Product f g a b -> Product f g a b -> Bool #

max :: Product f g a b -> Product f g a b -> Product f g a b #

min :: Product f g a b -> Product f g a b -> Product f g a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Ordering #

(<) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(<=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(>) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

(>=) :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> Bool #

max :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

min :: (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

Ord (f (p a b)) => Ord (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

compare :: Tannen f p a b -> Tannen f p a b -> Ordering #

(<) :: Tannen f p a b -> Tannen f p a b -> Bool #

(<=) :: Tannen f p a b -> Tannen f p a b -> Bool #

(>) :: Tannen f p a b -> Tannen f p a b -> Bool #

(>=) :: Tannen f p a b -> Tannen f p a b -> Bool #

max :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #

min :: Tannen f p a b -> Tannen f p a b -> Tannen f p a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(>) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> Bool #

max :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #

min :: (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> Bool #

max :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

min :: (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

Ord (p (f a) (g b)) => Ord (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

compare :: Biff p f g a b -> Biff p f g a b -> Ordering #

(<) :: Biff p f g a b -> Biff p f g a b -> Bool #

(<=) :: Biff p f g a b -> Biff p f g a b -> Bool #

(>) :: Biff p f g a b -> Biff p f g a b -> Bool #

(>=) :: Biff p f g a b -> Biff p f g a b -> Bool #

max :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #

min :: Biff p f g a b -> Biff p f g a b -> Biff p f g a b #

(Ord a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h, Ord i, Ord j) => Ord (a, b, c, d, e, f, g, h, i, j) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) #

min :: (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) #

min :: (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (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) 
Instance details

Defined in GHC.Classes

Methods

compare :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Ordering #

(<) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(<=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(>) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

(>=) :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Bool #

max :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

min :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

class Read a where #

Parsing of Strings, producing values.

Derived instances of Read make the following assumptions, which + derived instances of 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 @@ -119,37 +217,43 @@ where app_prec = 10 up_prec = 5 - readListPrec = readListPrecDefault

    Why do both readsPrec and readPrec exist, and why does GHC opt to - implement readPrec in derived Read instances instead of readsPrec? + readListPrec = readListPrecDefault

    Why do both readsPrec and readPrec exist, and why does GHC opt to + implement readPrec in derived Read instances instead of readsPrec? The reason is that readsPrec is based on the ReadS type, and although ReadS is mentioned in the Haskell 2010 Report, it is not a very efficient - parser data structure.

    readPrec, on the other hand, is based on a much more efficient ReadPrec + parser data structure.

    readPrec, on the other hand, is based on a much more efficient ReadPrec datatype (a.k.a "new-style parsers"), but its definition relies on the use - of the RankNTypes language extension. Therefore, readPrec (and its - cousin, readListPrec) are marked as GHC-only. Nevertheless, it is - recommended to use readPrec instead of readsPrec whenever possible + of the RankNTypes language extension. Therefore, readPrec (and its + cousin, readListPrec) are marked as GHC-only. Nevertheless, it is + recommended to use readPrec instead of readsPrec whenever possible for the efficiency improvements it brings.

    As mentioned above, derived Read instances in GHC will implement - readPrec instead of readsPrec. The default implementations of - readsPrec (and its cousin, readList) will simply use readPrec under + readPrec instead of readsPrec. The default implementations of + readsPrec (and its cousin, readList) will simply use readPrec under the hood. If you are writing a Read instance by hand, it is recommended to write it like so:

    instance Read T where
-  readPrec     = ...
-  readListPrec = readListPrecDefault
-

Minimal complete definition

readsPrec | readPrec

Methods

readsPrec #

Arguments

:: Int

the operator precedence of the enclosing + readPrec = ... + readListPrec = readListPrecDefault +

Minimal complete definition

readsPrec | readPrec

Methods

readsPrec #

Arguments

:: 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 Show satisfy the following:

That is, readsPrec parses the string produced by - showsPrec, and delivers the value that - showsPrec started with.

readList :: ReadS [a] #

The method readList is provided to allow the programmer to + successful parse, the returned list is empty.

Derived instances of Read and Show satisfy the following:

That is, readsPrec parses the string produced by + showsPrec, and delivers the value that + showsPrec started with.

readList :: ReadS [a] #

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 Bool

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Bool #

readList :: ReadS [Bool] #

readPrec :: ReadPrec Bool #

readListPrec :: ReadPrec [Bool] #

Read Char

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Char #

readList :: ReadS [Char] #

readPrec :: ReadPrec Char #

readListPrec :: ReadPrec [Char] #

Read Double

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Double #

readList :: ReadS [Double] #

readPrec :: ReadPrec Double #

readListPrec :: ReadPrec [Double] #

Read Float

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Float #

readList :: ReadS [Float] #

readPrec :: ReadPrec Float #

readListPrec :: ReadPrec [Float] #

Read Int

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Int #

readList :: ReadS [Int] #

readPrec :: ReadPrec Int #

readListPrec :: ReadPrec [Int] #

Read Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int8 #

readList :: ReadS [Int8] #

readPrec :: ReadPrec Int8 #

readListPrec :: ReadPrec [Int8] #

Read Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int16 #

readList :: ReadS [Int16] #

readPrec :: ReadPrec Int16 #

readListPrec :: ReadPrec [Int16] #

Read Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int32 #

readList :: ReadS [Int32] #

readPrec :: ReadPrec Int32 #

readListPrec :: ReadPrec [Int32] #

Read Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int64 #

readList :: ReadS [Int64] #

readPrec :: ReadPrec Int64 #

readListPrec :: ReadPrec [Int64] #

Read Integer

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Integer #

readList :: ReadS [Integer] #

readPrec :: ReadPrec Integer #

readListPrec :: ReadPrec [Integer] #

Read Ordering

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Ordering #

readList :: ReadS [Ordering] #

readPrec :: ReadPrec Ordering #

readListPrec :: ReadPrec [Ordering] #

Read Word

Since: base-4.5.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word #

readList :: ReadS [Word] #

readPrec :: ReadPrec Word #

readListPrec :: ReadPrec [Word] #

Read Word8

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word8 #

readList :: ReadS [Word8] #

readPrec :: ReadPrec Word8 #

readListPrec :: ReadPrec [Word8] #

Read Word16

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word16 #

readList :: ReadS [Word16] #

readPrec :: ReadPrec Word16 #

readListPrec :: ReadPrec [Word16] #

Read Word32

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word32 #

readList :: ReadS [Word32] #

readPrec :: ReadPrec Word32 #

readListPrec :: ReadPrec [Word32] #

Read Word64

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word64 #

readList :: ReadS [Word64] #

readPrec :: ReadPrec Word64 #

readListPrec :: ReadPrec [Word64] #

Read ()

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS () #

readList :: ReadS [()] #

readPrec :: ReadPrec () #

readListPrec :: ReadPrec [()] #

Read IOMode 
Instance details

Defined in GHC.IO.IOMode

Methods

readsPrec :: Int -> ReadS IOMode #

readList :: ReadS [IOMode] #

readPrec :: ReadPrec IOMode #

readListPrec :: ReadPrec [IOMode] #

Read StdGen 
Instance details

Defined in System.Random

Methods

readsPrec :: Int -> ReadS StdGen #

readList :: ReadS [StdGen] #

readPrec :: ReadPrec StdGen #

readListPrec :: ReadPrec [StdGen] #

Read ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

readsPrec :: Int -> ReadS ByteString #

readList :: ReadS [ByteString] #

readPrec :: ReadPrec ByteString #

readListPrec :: ReadPrec [ByteString] #

Read ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

readsPrec :: Int -> ReadS ByteString #

readList :: ReadS [ByteString] #

readPrec :: ReadPrec ByteString #

readListPrec :: ReadPrec [ByteString] #

Read Void

Reading a Void value is always a parse error, considering - Void as a data type with no constructors.

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

readsPrec :: Int -> ReadS Void #

readList :: ReadS [Void] #

readPrec :: ReadPrec Void #

readListPrec :: ReadPrec [Void] #

Read Version 
Instance details

Defined in Data.Version

Methods

readsPrec :: Int -> ReadS Version #

readList :: ReadS [Version] #

readPrec :: ReadPrec Version #

readListPrec :: ReadPrec [Version] #

Read ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

readsPrec :: Int -> ReadS ExitCode #

readList :: ReadS [ExitCode] #

readPrec :: ReadPrec ExitCode #

readListPrec :: ReadPrec [ExitCode] #

Read BufferMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS BufferMode #

readList :: ReadS [BufferMode] #

readPrec :: ReadPrec BufferMode #

readListPrec :: ReadPrec [BufferMode] #

Read Newline 
Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS Newline #

readList :: ReadS [Newline] #

readPrec :: ReadPrec Newline #

readListPrec :: ReadPrec [Newline] #

Read NewlineMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS NewlineMode #

readList :: ReadS [NewlineMode] #

readPrec :: ReadPrec NewlineMode #

readListPrec :: ReadPrec [NewlineMode] #

Read SeekMode 
Instance details

Defined in GHC.IO.Device

Methods

readsPrec :: Int -> ReadS SeekMode #

readList :: ReadS [SeekMode] #

readPrec :: ReadPrec SeekMode #

readListPrec :: ReadPrec [SeekMode] #

Read All 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS All #

readList :: ReadS [All] #

readPrec :: ReadPrec All #

readListPrec :: ReadPrec [All] #

Read Any 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS Any #

readList :: ReadS [Any] #

readPrec :: ReadPrec Any #

readListPrec :: ReadPrec [Any] #

Read Fixity 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS Fixity #

readList :: ReadS [Fixity] #

readPrec :: ReadPrec Fixity #

readListPrec :: ReadPrec [Fixity] #

Read Associativity 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS Associativity #

readList :: ReadS [Associativity] #

readPrec :: ReadPrec Associativity #

readListPrec :: ReadPrec [Associativity] #

Read SourceUnpackedness 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS SourceUnpackedness #

readList :: ReadS [SourceUnpackedness] #

readPrec :: ReadPrec SourceUnpackedness #

readListPrec :: ReadPrec [SourceUnpackedness] #

Read SourceStrictness 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS SourceStrictness #

readList :: ReadS [SourceStrictness] #

readPrec :: ReadPrec SourceStrictness #

readListPrec :: ReadPrec [SourceStrictness] #

Read DecidedStrictness 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS DecidedStrictness #

readList :: ReadS [DecidedStrictness] #

readPrec :: ReadPrec DecidedStrictness #

readListPrec :: ReadPrec [DecidedStrictness] #

Read SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

readsPrec :: Int -> ReadS SomeNat #

readList :: ReadS [SomeNat] #

readPrec :: ReadPrec SomeNat #

readListPrec :: ReadPrec [SomeNat] #

Read CChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CChar #

readList :: ReadS [CChar] #

readPrec :: ReadPrec CChar #

readListPrec :: ReadPrec [CChar] #

Read CSChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSChar #

readList :: ReadS [CSChar] #

readPrec :: ReadPrec CSChar #

readListPrec :: ReadPrec [CSChar] #

Read CUChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUChar #

readList :: ReadS [CUChar] #

readPrec :: ReadPrec CUChar #

readListPrec :: ReadPrec [CUChar] #

Read CShort 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CShort #

readList :: ReadS [CShort] #

readPrec :: ReadPrec CShort #

readListPrec :: ReadPrec [CShort] #

Read CUShort 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUShort #

readList :: ReadS [CUShort] #

readPrec :: ReadPrec CUShort #

readListPrec :: ReadPrec [CUShort] #

Read CInt 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CInt #

readList :: ReadS [CInt] #

readPrec :: ReadPrec CInt #

readListPrec :: ReadPrec [CInt] #

Read CUInt 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUInt #

readList :: ReadS [CUInt] #

readPrec :: ReadPrec CUInt #

readListPrec :: ReadPrec [CUInt] #

Read CLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CLong #

readList :: ReadS [CLong] #

readPrec :: ReadPrec CLong #

readListPrec :: ReadPrec [CLong] #

Read CULong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CULong #

readList :: ReadS [CULong] #

readPrec :: ReadPrec CULong #

readListPrec :: ReadPrec [CULong] #

Read CLLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CLLong #

readList :: ReadS [CLLong] #

readPrec :: ReadPrec CLLong #

readListPrec :: ReadPrec [CLLong] #

Read CULLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CULLong #

readList :: ReadS [CULLong] #

readPrec :: ReadPrec CULLong #

readListPrec :: ReadPrec [CULLong] #

Read CBool 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CBool #

readList :: ReadS [CBool] #

readPrec :: ReadPrec CBool #

readListPrec :: ReadPrec [CBool] #

Read CFloat 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CFloat #

readList :: ReadS [CFloat] #

readPrec :: ReadPrec CFloat #

readListPrec :: ReadPrec [CFloat] #

Read CDouble 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CDouble #

readList :: ReadS [CDouble] #

readPrec :: ReadPrec CDouble #

readListPrec :: ReadPrec [CDouble] #

Read CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CPtrdiff #

readList :: ReadS [CPtrdiff] #

readPrec :: ReadPrec CPtrdiff #

readListPrec :: ReadPrec [CPtrdiff] #

Read CSize 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSize #

readList :: ReadS [CSize] #

readPrec :: ReadPrec CSize #

readListPrec :: ReadPrec [CSize] #

Read CWchar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CWchar #

readList :: ReadS [CWchar] #

readPrec :: ReadPrec CWchar #

readListPrec :: ReadPrec [CWchar] #

Read CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSigAtomic #

readList :: ReadS [CSigAtomic] #

readPrec :: ReadPrec CSigAtomic #

readListPrec :: ReadPrec [CSigAtomic] #

Read CClock 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CClock #

readList :: ReadS [CClock] #

readPrec :: ReadPrec CClock #

readListPrec :: ReadPrec [CClock] #

Read CTime 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CTime #

readList :: ReadS [CTime] #

readPrec :: ReadPrec CTime #

readListPrec :: ReadPrec [CTime] #

Read CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUSeconds #

readList :: ReadS [CUSeconds] #

readPrec :: ReadPrec CUSeconds #

readListPrec :: ReadPrec [CUSeconds] #

Read CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSUSeconds #

readList :: ReadS [CSUSeconds] #

readPrec :: ReadPrec CSUSeconds #

readListPrec :: ReadPrec [CSUSeconds] #

Read CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CIntPtr #

readList :: ReadS [CIntPtr] #

readPrec :: ReadPrec CIntPtr #

readListPrec :: ReadPrec [CIntPtr] #

Read CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUIntPtr #

readList :: ReadS [CUIntPtr] #

readPrec :: ReadPrec CUIntPtr #

readListPrec :: ReadPrec [CUIntPtr] #

Read CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CIntMax #

readList :: ReadS [CIntMax] #

readPrec :: ReadPrec CIntMax #

readListPrec :: ReadPrec [CIntMax] #

Read CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUIntMax #

readList :: ReadS [CUIntMax] #

readPrec :: ReadPrec CUIntMax #

readListPrec :: ReadPrec [CUIntMax] #

Read Lexeme

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Lexeme #

readList :: ReadS [Lexeme] #

readPrec :: ReadPrec Lexeme #

readListPrec :: ReadPrec [Lexeme] #

Read GeneralCategory 
Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS GeneralCategory #

readList :: ReadS [GeneralCategory] #

readPrec :: ReadPrec GeneralCategory #

readListPrec :: ReadPrec [GeneralCategory] #

Read IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

readsPrec :: Int -> ReadS IntSet #

readList :: ReadS [IntSet] #

readPrec :: ReadPrec IntSet #

readListPrec :: ReadPrec [IntSet] #

Read XdgDirectory 
Instance details

Defined in System.Directory

Methods

readsPrec :: Int -> ReadS XdgDirectory #

readList :: ReadS [XdgDirectory] #

readPrec :: ReadPrec XdgDirectory #

readListPrec :: ReadPrec [XdgDirectory] #

Read FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS FileType #

readList :: ReadS [FileType] #

readPrec :: ReadPrec FileType #

readListPrec :: ReadPrec [FileType] #

Read Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS Permissions #

readList :: ReadS [Permissions] #

readPrec :: ReadPrec Permissions #

readListPrec :: ReadPrec [Permissions] #

Read Placement 
Instance details

Defined in Plots.Types

Methods

readsPrec :: Int -> ReadS Placement #

readList :: ReadS [Placement] #

readPrec :: ReadPrec Placement #

readListPrec :: ReadPrec [Placement] #

Read ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS ScaleMode #

readList :: ReadS [ScaleMode] #

readPrec :: ReadPrec ScaleMode #

readListPrec :: ReadPrec [ScaleMode] #

Read UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS UniformScaleStrategy #

readList :: ReadS [UniformScaleStrategy] #

readPrec :: ReadPrec UniformScaleStrategy #

readListPrec :: ReadPrec [UniformScaleStrategy] #

Read DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

readsPrec :: Int -> ReadS DatatypeVariant #

readList :: ReadS [DatatypeVariant] #

readPrec :: ReadPrec DatatypeVariant #

readListPrec :: ReadPrec [DatatypeVariant] #

Read Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

readsPrec :: Int -> ReadS Cairo #

readList :: ReadS [Cairo] #

readPrec :: ReadPrec Cairo #

readListPrec :: ReadPrec [Cairo] #

Read OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

readsPrec :: Int -> ReadS OutputType #

readList :: ReadS [OutputType] #

readPrec :: ReadPrec OutputType #

readListPrec :: ReadPrec [OutputType] #

Read Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Methods

readsPrec :: Int -> ReadS Points #

readList :: ReadS [Points] #

readPrec :: ReadPrec Points #

readListPrec :: ReadPrec [Points] #

Read Value 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

readsPrec :: Int -> ReadS Value #

readList :: ReadS [Value] #

readPrec :: ReadPrec Value #

readListPrec :: ReadPrec [Value] #

Read Scientific 
Instance details

Defined in Data.Scientific

Methods

readsPrec :: Int -> ReadS Scientific #

readList :: ReadS [Scientific] #

readPrec :: ReadPrec Scientific #

readListPrec :: ReadPrec [Scientific] #

Read DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

readsPrec :: Int -> ReadS DictionaryHash #

readList :: ReadS [DictionaryHash] #

readPrec :: ReadPrec DictionaryHash #

readListPrec :: ReadPrec [DictionaryHash] #

Read DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

readsPrec :: Int -> ReadS DotNetTime #

readList :: ReadS [DotNetTime] #

readPrec :: ReadPrec DotNetTime #

readListPrec :: ReadPrec [DotNetTime] #

Read UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

readsPrec :: Int -> ReadS UUID #

readList :: ReadS [UUID] #

readPrec :: ReadPrec UUID #

readListPrec :: ReadPrec [UUID] #

Read UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

readsPrec :: Int -> ReadS UnpackedUUID #

readList :: ReadS [UnpackedUUID] #

readPrec :: ReadPrec UnpackedUUID #

readListPrec :: ReadPrec [UnpackedUUID] #

Read ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

readsPrec :: Int -> ReadS ConstVal #

readList :: ReadS [ConstVal] #

readPrec :: ReadPrec ConstVal #

readListPrec :: ReadPrec [ConstVal] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Read a => Read [a]

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS [a] #

readList :: ReadS [[a]] #

readPrec :: ReadPrec [a] #

readListPrec :: ReadPrec [[a]] #

Read a => Read (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Maybe a) #

readList :: ReadS [Maybe a] #

readPrec :: ReadPrec (Maybe a) #

readListPrec :: ReadPrec [Maybe a] #

(Integral a, Read a) => Read (Ratio a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Ratio a) #

readList :: ReadS [Ratio a] #

readPrec :: ReadPrec (Ratio a) #

readListPrec :: ReadPrec [Ratio a] #

Read p => Read (Par1 p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (Par1 p) #

readList :: ReadS [Par1 p] #

readPrec :: ReadPrec (Par1 p) #

readListPrec :: ReadPrec [Par1 p] #

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the - Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

readsPrec :: Int -> ReadS (Identity a) #

readList :: ReadS [Identity a] #

readPrec :: ReadPrec (Identity a) #

readListPrec :: ReadPrec [Identity a] #

Read a => Read (Complex a) 
Instance details

Defined in Data.Complex

Methods

readsPrec :: Int -> ReadS (Complex a) #

readList :: ReadS [Complex a] #

readPrec :: ReadPrec (Complex a) #

readListPrec :: ReadPrec [Complex a] #

Read a => Read (Min a) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Min a) #

readList :: ReadS [Min a] #

readPrec :: ReadPrec (Min a) #

readListPrec :: ReadPrec [Min a] #

Read a => Read (Max a) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Max a) #

readList :: ReadS [Max a] #

readPrec :: ReadPrec (Max a) #

readListPrec :: ReadPrec [Max a] #

Read a => Read (First a) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (First a) #

readList :: ReadS [First a] #

readPrec :: ReadPrec (First a) #

readListPrec :: ReadPrec [First a] #

Read a => Read (Last a) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Last a) #

readList :: ReadS [Last a] #

readPrec :: ReadPrec (Last a) #

readListPrec :: ReadPrec [Last a] #

Read m => Read (WrappedMonoid m) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (WrappedMonoid m) #

readList :: ReadS [WrappedMonoid m] #

readPrec :: ReadPrec (WrappedMonoid m) #

readListPrec :: ReadPrec [WrappedMonoid m] #

Read a => Read (Option a) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Option a) #

readList :: ReadS [Option a] #

readPrec :: ReadPrec (Option a) #

readListPrec :: ReadPrec [Option a] #

Read a => Read (ZipList a) 
Instance details

Defined in Control.Applicative

Methods

readsPrec :: Int -> ReadS (ZipList a) #

readList :: ReadS [ZipList a] #

readPrec :: ReadPrec (ZipList a) #

readListPrec :: ReadPrec [ZipList a] #

Read a => Read (First a) 
Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (First a) #

readList :: ReadS [First a] #

readPrec :: ReadPrec (First a) #

readListPrec :: ReadPrec [First a] #

Read a => Read (Last a) 
Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (Last a) #

readList :: ReadS [Last a] #

readPrec :: ReadPrec (Last a) #

readListPrec :: ReadPrec [Last a] #

Read a => Read (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Dual a) #

readList :: ReadS [Dual a] #

readPrec :: ReadPrec (Dual a) #

readListPrec :: ReadPrec [Dual a] #

Read a => Read (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Sum a) #

readList :: ReadS [Sum a] #

readPrec :: ReadPrec (Sum a) #

readListPrec :: ReadPrec [Sum a] #

Read a => Read (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Product a) #

readList :: ReadS [Product a] #

readPrec :: ReadPrec (Product a) #

readListPrec :: ReadPrec [Product a] #

Read a => Read (Down a)

Since: base-4.7.0.0

Instance details

Defined in Data.Ord

Methods

readsPrec :: Int -> ReadS (Down a) #

readList :: ReadS [Down a] #

readPrec :: ReadPrec (Down a) #

readListPrec :: ReadPrec [Down a] #

Read a => Read (NonEmpty a) 
Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (NonEmpty a) #

readList :: ReadS [NonEmpty a] #

readPrec :: ReadPrec (NonEmpty a) #

readListPrec :: ReadPrec [NonEmpty a] #

Read e => Read (IntMap e) 
Instance details

Defined in Data.IntMap.Internal

Methods

readsPrec :: Int -> ReadS (IntMap e) #

readList :: ReadS [IntMap e] #

readPrec :: ReadPrec (IntMap e) #

readListPrec :: ReadPrec [IntMap e] #

Read vertex => Read (SCC vertex)

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

readsPrec :: Int -> ReadS (SCC vertex) #

readList :: ReadS [SCC vertex] #

readPrec :: ReadPrec (SCC vertex) #

readListPrec :: ReadPrec [SCC vertex] #

Read a => Read (Tree a) 
Instance details

Defined in Data.Tree

Methods

readsPrec :: Int -> ReadS (Tree a) #

readList :: ReadS [Tree a] #

readPrec :: ReadPrec (Tree a) #

readListPrec :: ReadPrec [Tree a] #

Read a => Read (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (Seq a) #

readList :: ReadS [Seq a] #

readPrec :: ReadPrec (Seq a) #

readListPrec :: ReadPrec [Seq a] #

Read a => Read (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (ViewL a) #

readList :: ReadS [ViewL a] #

readPrec :: ReadPrec (ViewL a) #

readListPrec :: ReadPrec [ViewL a] #

Read a => Read (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (ViewR a) #

readList :: ReadS [ViewR a] #

readPrec :: ReadPrec (ViewR a) #

readListPrec :: ReadPrec [ViewR a] #

(Read a, Ord a) => Read (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

readsPrec :: Int -> ReadS (Set a) #

readList :: ReadS [Set a] #

readPrec :: ReadPrec (Set a) #

readListPrec :: ReadPrec [Set a] #

Read a => Read (DList a) 
Instance details

Defined in Data.DList

Methods

readsPrec :: Int -> ReadS (DList a) #

readList :: ReadS [DList a] #

readPrec :: ReadPrec (DList a) #

readListPrec :: ReadPrec [DList a] #

Read n => Read (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

readsPrec :: Int -> ReadS (Angle n) #

readList :: ReadS [Angle n] #

readPrec :: ReadPrec (Angle n) #

readListPrec :: ReadPrec [Angle n] #

Read a => Read (V3 a) 
Instance details

Defined in Linear.V3

Methods

readsPrec :: Int -> ReadS (V3 a) #

readList :: ReadS [V3 a] #

readPrec :: ReadPrec (V3 a) #

readListPrec :: ReadPrec [V3 a] #

Read a => Read (V2 a) 
Instance details

Defined in Linear.V2

Methods

readsPrec :: Int -> ReadS (V2 a) #

readList :: ReadS [V2 a] #

readPrec :: ReadPrec (V2 a) #

readListPrec :: ReadPrec [V2 a] #

Read a => Read (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

readsPrec :: Int -> ReadS (Array a) #

readList :: ReadS [Array a] #

readPrec :: ReadPrec (Array a) #

readListPrec :: ReadPrec [Array a] #

(Read a, Storable a) => Read (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

Read a => Read (Vector a) 
Instance details

Defined in Data.Vector

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

Read a => Read (Root a) 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS (Root a) #

readList :: ReadS [Root a] #

readPrec :: ReadPrec (Root a) #

readListPrec :: ReadPrec [Root a] #

(Read a, Prim a) => Read (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

(Floating a, Read a) => Read (Log a) 
Instance details

Defined in Numeric.Log

Methods

readsPrec :: Int -> ReadS (Log a) #

readList :: ReadS [Log a] #

readPrec :: ReadPrec (Log a) #

readListPrec :: ReadPrec [Log a] #

(Eq a, Hashable a, Read a) => Read (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

readsPrec :: Int -> ReadS (HashSet a) #

readList :: ReadS [HashSet a] #

readPrec :: ReadPrec (HashSet a) #

readListPrec :: ReadPrec [HashSet a] #

(Read (V a (N a)), Read a) => Read (Located a) 
Instance details

Defined in Diagrams.Located

Methods

readsPrec :: Int -> ReadS (Located a) #

readList :: ReadS [Located a] #

readPrec :: ReadPrec (Located a) #

readListPrec :: ReadPrec [Located a] #

Read n => Read (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

readsPrec :: Int -> ReadS (PolyOrientation n) #

readList :: ReadS [PolyOrientation n] #

readPrec :: ReadPrec (PolyOrientation n) #

readListPrec :: ReadPrec [PolyOrientation n] #

Read n => Read (Time n) 
Instance details

Defined in Data.Active

Methods

readsPrec :: Int -> ReadS (Time n) #

readList :: ReadS [Time n] #

readPrec :: ReadPrec (Time n) #

readListPrec :: ReadPrec [Time n] #

Read a => Read (V1 a) 
Instance details

Defined in Linear.V1

Methods

readsPrec :: Int -> ReadS (V1 a) #

readList :: ReadS [V1 a] #

readPrec :: ReadPrec (V1 a) #

readListPrec :: ReadPrec [V1 a] #

Read n => Read (Duration n) 
Instance details

Defined in Data.Active

Methods

readsPrec :: Int -> ReadS (Duration n) #

readList :: ReadS [Duration n] #

readPrec :: ReadPrec (Duration n) #

readListPrec :: ReadPrec [Duration n] #

Read a => Read (V4 a) 
Instance details

Defined in Linear.V4

Methods

readsPrec :: Int -> ReadS (V4 a) #

readList :: ReadS [V4 a] #

readPrec :: ReadPrec (V4 a) #

readListPrec :: ReadPrec [V4 a] #

Read a => Read (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

readsPrec :: Int -> ReadS (Plucker a) #

readList :: ReadS [Plucker a] #

readPrec :: ReadPrec (Plucker a) #

readListPrec :: ReadPrec [Plucker a] #

Read a => Read (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

readsPrec :: Int -> ReadS (Quaternion a) #

readList :: ReadS [Quaternion a] #

readPrec :: ReadPrec (Quaternion a) #

readListPrec :: ReadPrec [Quaternion a] #

Read (V0 a) 
Instance details

Defined in Linear.V0

Methods

readsPrec :: Int -> ReadS (V0 a) #

readList :: ReadS [V0 a] #

readPrec :: ReadPrec (V0 a) #

readListPrec :: ReadPrec [V0 a] #

(Read a, Read b) => Read (Either a b) 
Instance details

Defined in Data.Either

Methods

readsPrec :: Int -> ReadS (Either a b) #

readList :: ReadS [Either a b] #

readPrec :: ReadPrec (Either a b) #

readListPrec :: ReadPrec [Either a b] #

Read (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (V1 p) #

readList :: ReadS [V1 p] #

readPrec :: ReadPrec (V1 p) #

readListPrec :: ReadPrec [V1 p] #

Read (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (U1 p) #

readList :: ReadS [U1 p] #

readPrec :: ReadPrec (U1 p) #

readListPrec :: ReadPrec [U1 p] #

(Read a, Read b) => Read (a, b)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b) #

readList :: ReadS [(a, b)] #

readPrec :: ReadPrec (a, b) #

readListPrec :: ReadPrec [(a, b)] #

(Read i, Read a) => Read (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

readsPrec :: Int -> ReadS (Level i a) #

readList :: ReadS [Level i a] #

readPrec :: ReadPrec (Level i a) #

readListPrec :: ReadPrec [Level i a] #

(Ord k, Read k, Read e) => Read (Map k e) 
Instance details

Defined in Data.Map.Internal

Methods

readsPrec :: Int -> ReadS (Map k e) #

readList :: ReadS [Map k e] #

readPrec :: ReadPrec (Map k e) #

readListPrec :: ReadPrec [Map k e] #

(Ix a, Read a, Read b) => Read (Array a b)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Array a b) #

readList :: ReadS [Array a b] #

readPrec :: ReadPrec (Array a b) #

readListPrec :: ReadPrec [Array a b] #

(Read a, Read b) => Read (Arg a b) 
Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Arg a b) #

readList :: ReadS [Arg a b] #

readPrec :: ReadPrec (Arg a b) #

readListPrec :: ReadPrec [Arg a b] #

Read (Proxy t)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

readsPrec :: Int -> ReadS (Proxy t) #

readList :: ReadS [Proxy t] #

readPrec :: ReadPrec (Proxy t) #

readListPrec :: ReadPrec [Proxy t] #

(Read1 m, Read a) => Read (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

readsPrec :: Int -> ReadS (MaybeT m a) #

readList :: ReadS [MaybeT m a] #

readPrec :: ReadPrec (MaybeT m a) #

readListPrec :: ReadPrec [MaybeT m a] #

(Read a, Read (s a)) => Read (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

readsPrec :: Int -> ReadS (ViewL s a) #

readList :: ReadS [ViewL s a] #

readPrec :: ReadPrec (ViewL s a) #

readListPrec :: ReadPrec [ViewL s a] #

(Read a, Read (s a)) => Read (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

readsPrec :: Int -> ReadS (ViewR s a) #

readList :: ReadS [ViewR s a] #

readPrec :: ReadPrec (ViewR s a) #

readListPrec :: ReadPrec [ViewR s a] #

(Read1 m, Read a) => Read (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

readsPrec :: Int -> ReadS (ListT m a) #

readList :: ReadS [ListT m a] #

readPrec :: ReadPrec (ListT m a) #

readListPrec :: ReadPrec [ListT m a] #

Read (v n) => Read (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

readsPrec :: Int -> ReadS (BoundingBox v n) #

readList :: ReadS [BoundingBox v n] #

readPrec :: ReadPrec (BoundingBox v n) #

readListPrec :: ReadPrec [BoundingBox v n] #

Read (f a) => Read (Point f a) 
Instance details

Defined in Linear.Affine

Methods

readsPrec :: Int -> ReadS (Point f a) #

readList :: ReadS [Point f a] #

readPrec :: ReadPrec (Point f a) #

readListPrec :: ReadPrec [Point f a] #

(Num p, Read p, Read a) => Read (Categorical p a) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

readsPrec :: Int -> ReadS (Categorical p a) #

readList :: ReadS [Categorical p a] #

readPrec :: ReadPrec (Categorical p a) #

readListPrec :: ReadPrec [Categorical p a] #

(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) 
Instance details

Defined in Data.HashMap.Base

Methods

readsPrec :: Int -> ReadS (HashMap k e) #

readList :: ReadS [HashMap k e] #

readPrec :: ReadPrec (HashMap k e) #

readListPrec :: ReadPrec [HashMap k e] #

(Read1 f, Read a) => Read (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

readsPrec :: Int -> ReadS (Cofree f a) #

readList :: ReadS [Cofree f a] #

readPrec :: ReadPrec (Cofree f a) #

readListPrec :: ReadPrec [Cofree f a] #

Read (v n) => Read (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

readsPrec :: Int -> ReadS (Direction v n) #

readList :: ReadS [Direction v n] #

readPrec :: ReadPrec (Direction v n) #

readListPrec :: ReadPrec [Direction v n] #

(Read1 f, Read a) => Read (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

readsPrec :: Int -> ReadS (Free f a) #

readList :: ReadS [Free f a] #

readPrec :: ReadPrec (Free f a) #

readListPrec :: ReadPrec [Free f a] #

(Functor f, Read (f a)) => Read (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

readsPrec :: Int -> ReadS (Yoneda f a) #

readList :: ReadS [Yoneda f a] #

readPrec :: ReadPrec (Yoneda f a) #

readListPrec :: ReadPrec [Yoneda f a] #

Read (f p) => Read (Rec1 f p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (Rec1 f p) #

readList :: ReadS [Rec1 f p] #

readPrec :: ReadPrec (Rec1 f p) #

readListPrec :: ReadPrec [Rec1 f p] #

(Read a, Read b, Read c) => Read (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c) #

readList :: ReadS [(a, b, c)] #

readPrec :: ReadPrec (a, b, c) #

readListPrec :: ReadPrec [(a, b, c)] #

Read a => Read (Const a b)

This instance would be equivalent to the derived instances of the - Const newtype if the runConst field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

readsPrec :: Int -> ReadS (Const a b) #

readList :: ReadS [Const a b] #

readPrec :: ReadPrec (Const a b) #

readListPrec :: ReadPrec [Const a b] #

Read (f a) => Read (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Alt f a) #

readList :: ReadS [Alt f a] #

readPrec :: ReadPrec (Alt f a) #

readListPrec :: ReadPrec [Alt f a] #

a ~ b => Read (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

readsPrec :: Int -> ReadS (a :~: b) #

readList :: ReadS [a :~: b] #

readPrec :: ReadPrec (a :~: b) #

readListPrec :: ReadPrec [a :~: b] #

(Read1 f, Read a) => Read (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

readsPrec :: Int -> ReadS (IdentityT f a) #

readList :: ReadS [IdentityT f a] #

readPrec :: ReadPrec (IdentityT f a) #

readListPrec :: ReadPrec [IdentityT f a] #

(Read e, Read1 m, Read a) => Read (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

readsPrec :: Int -> ReadS (ExceptT e m a) #

readList :: ReadS [ExceptT e m a] #

readPrec :: ReadPrec (ExceptT e m a) #

readListPrec :: ReadPrec [ExceptT e m a] #

(Read e, Read1 m, Read a) => Read (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

readsPrec :: Int -> ReadS (ErrorT e m a) #

readList :: ReadS [ErrorT e m a] #

readPrec :: ReadPrec (ErrorT e m a) #

readListPrec :: ReadPrec [ErrorT e m a] #

(Read1 f, Read a) => Read (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

readsPrec :: Int -> ReadS (Backwards f a) #

readList :: ReadS [Backwards f a] #

readPrec :: ReadPrec (Backwards f a) #

readListPrec :: ReadPrec [Backwards f a] #

(Read w, Read1 m, Read a) => Read (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

readsPrec :: Int -> ReadS (WriterT w m a) #

readList :: ReadS [WriterT w m a] #

readPrec :: ReadPrec (WriterT w m a) #

readListPrec :: ReadPrec [WriterT w m a] #

(Read w, Read1 m, Read a) => Read (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

readsPrec :: Int -> ReadS (WriterT w m a) #

readList :: ReadS [WriterT w m a] #

readPrec :: ReadPrec (WriterT w m a) #

readListPrec :: ReadPrec [WriterT w m a] #

Read (p a a) => Read (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

readsPrec :: Int -> ReadS (Join p a) #

readList :: ReadS [Join p a] #

readPrec :: ReadPrec (Join p a) #

readListPrec :: ReadPrec [Join p a] #

Read b => Read (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

readsPrec :: Int -> ReadS (Tagged s b) #

readList :: ReadS [Tagged s b] #

readPrec :: ReadPrec (Tagged s b) #

readListPrec :: ReadPrec [Tagged s b] #

Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

readsPrec :: Int -> ReadS (CofreeT f w a) #

readList :: ReadS [CofreeT f w a] #

readPrec :: ReadPrec (CofreeT f w a) #

readListPrec :: ReadPrec [CofreeT f w a] #

(Read a, Read (f b)) => Read (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

readsPrec :: Int -> ReadS (CofreeF f a b) #

readList :: ReadS [CofreeF f a b] #

readPrec :: ReadPrec (CofreeF f a b) #

readListPrec :: ReadPrec [CofreeF f a b] #

Read (p (Fix p a) a) => Read (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

readsPrec :: Int -> ReadS (Fix p a) #

readList :: ReadS [Fix p a] #

readPrec :: ReadPrec (Fix p a) #

readListPrec :: ReadPrec [Fix p a] #

(Read1 f, Read1 m, Read a) => Read (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

readsPrec :: Int -> ReadS (FreeT f m a) #

readList :: ReadS [FreeT f m a] #

readPrec :: ReadPrec (FreeT f m a) #

readListPrec :: ReadPrec [FreeT f m a] #

(Read a, Read (f b)) => Read (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

readsPrec :: Int -> ReadS (FreeF f a b) #

readList :: ReadS [FreeF f a b] #

readPrec :: ReadPrec (FreeF f a b) #

readListPrec :: ReadPrec [FreeF f a b] #

Read a => Read (V n a) 
Instance details

Defined in Linear.V

Methods

readsPrec :: Int -> ReadS (V n a) #

readList :: ReadS [V n a] #

readPrec :: ReadPrec (V n a) #

readListPrec :: ReadPrec [V n a] #

Read (f (a, b)) => Read (AlongsideLeft f b a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

readsPrec :: Int -> ReadS (AlongsideLeft f b a) #

readList :: ReadS [AlongsideLeft f b a] #

readPrec :: ReadPrec (AlongsideLeft f b a) #

readListPrec :: ReadPrec [AlongsideLeft f b a] #

Read (f (a, b)) => Read (AlongsideRight f a b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

readsPrec :: Int -> ReadS (AlongsideRight f a b) #

readList :: ReadS [AlongsideRight f a b] #

readPrec :: ReadPrec (AlongsideRight f a b) #

readListPrec :: ReadPrec [AlongsideRight f a b] #

Read c => Read (K1 i c p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (K1 i c p) #

readList :: ReadS [K1 i c p] #

readPrec :: ReadPrec (K1 i c p) #

readListPrec :: ReadPrec [K1 i c p] #

(Read (f p), Read (g p)) => Read ((f :+: g) p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :+: g) p) #

readList :: ReadS [(f :+: g) p] #

readPrec :: ReadPrec ((f :+: g) p) #

readListPrec :: ReadPrec [(f :+: g) p] #

(Read (f p), Read (g p)) => Read ((f :*: g) p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :*: g) p) #

readList :: ReadS [(f :*: g) p] #

readPrec :: ReadPrec ((f :*: g) p) #

readListPrec :: ReadPrec [(f :*: g) p] #

(Read a, Read b, Read c, Read d) => Read (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d) #

readList :: ReadS [(a, b, c, d)] #

readPrec :: ReadPrec (a, b, c, d) #

readListPrec :: ReadPrec [(a, b, c, d)] #

(Read1 f, Read1 g, Read a) => Read (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

readsPrec :: Int -> ReadS (Product f g a) #

readList :: ReadS [Product f g a] #

readPrec :: ReadPrec (Product f g a) #

readListPrec :: ReadPrec [Product f g a] #

(Read1 f, Read1 g, Read a) => Read (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

readsPrec :: Int -> ReadS (Sum f g a) #

readList :: ReadS [Sum f g a] #

readPrec :: ReadPrec (Sum f g a) #

readListPrec :: ReadPrec [Sum f g a] #

a ~~ b => Read (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

readsPrec :: Int -> ReadS (a :~~: b) #

readList :: ReadS [a :~~: b] #

readPrec :: ReadPrec (a :~~: b) #

readListPrec :: ReadPrec [a :~~: b] #

Read (f p) => Read (M1 i c f p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (M1 i c f p) #

readList :: ReadS [M1 i c f p] #

readPrec :: ReadPrec (M1 i c f p) #

readListPrec :: ReadPrec [M1 i c f p] #

Read (f (g p)) => Read ((f :.: g) p) 
Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :.: g) p) #

readList :: ReadS [(f :.: g) p] #

readPrec :: ReadPrec ((f :.: g) p) #

readListPrec :: ReadPrec [(f :.: g) p] #

(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e) #

readList :: ReadS [(a, b, c, d, e)] #

readPrec :: ReadPrec (a, b, c, d, e) #

readListPrec :: ReadPrec [(a, b, c, d, e)] #

(Read1 f, Read1 g, Read a) => Read (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

readsPrec :: Int -> ReadS (Compose f g a) #

readList :: ReadS [Compose f g a] #

readPrec :: ReadPrec (Compose f g a) #

readListPrec :: ReadPrec [Compose f g a] #

Read (f a) => Read (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

readsPrec :: Int -> ReadS (Clown f a b) #

readList :: ReadS [Clown f a b] #

readPrec :: ReadPrec (Clown f a b) #

readListPrec :: ReadPrec [Clown f a b] #

Read (p b a) => Read (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

readsPrec :: Int -> ReadS (Flip p a b) #

readList :: ReadS [Flip p a b] #

readPrec :: ReadPrec (Flip p a b) #

readListPrec :: ReadPrec [Flip p a b] #

Read (g b) => Read (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

readsPrec :: Int -> ReadS (Joker g a b) #

readList :: ReadS [Joker g a b] #

readPrec :: ReadPrec (Joker g a b) #

readListPrec :: ReadPrec [Joker g a b] #

Read (p a b) => Read (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

readsPrec :: Int -> ReadS (WrappedBifunctor p a b) #

readList :: ReadS [WrappedBifunctor p a b] #

readPrec :: ReadPrec (WrappedBifunctor p a b) #

readListPrec :: ReadPrec [WrappedBifunctor p a b] #

(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f) #

readList :: ReadS [(a, b, c, d, e, f)] #

readPrec :: ReadPrec (a, b, c, d, e, f) #

readListPrec :: ReadPrec [(a, b, c, d, e, f)] #

(Read (f a b), Read (g a b)) => Read (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

readsPrec :: Int -> ReadS (Product f g a b) #

readList :: ReadS [Product f g a b] #

readPrec :: ReadPrec (Product f g a b) #

readListPrec :: ReadPrec [Product f g a b] #

(Read (p a b), Read (q a b)) => Read (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

readsPrec :: Int -> ReadS (Sum p q a b) #

readList :: ReadS [Sum p q a b] #

readPrec :: ReadPrec (Sum p q a b) #

readListPrec :: ReadPrec [Sum p q a b] #

(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g) #

readList :: ReadS [(a, b, c, d, e, f, g)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g)] #

Read (f (p a b)) => Read (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

readsPrec :: Int -> ReadS (Tannen f p a b) #

readList :: ReadS [Tannen f p a b] #

readPrec :: ReadPrec (Tannen f p a b) #

readListPrec :: ReadPrec [Tannen f p a b] #

(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h) #

readList :: ReadS [(a, b, c, d, e, f, g, h)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i)] #

Read (p (f a) (g b)) => Read (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

readsPrec :: Int -> ReadS (Biff p f g a b) #

readList :: ReadS [Biff p f g a b] #

readPrec :: ReadPrec (Biff p f g a b) #

readListPrec :: ReadPrec [Biff p f g a b] #

(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] #

class (Num a, Ord a) => Real a where #

Minimal complete definition

toRational

Methods

toRational :: a -> Rational #

the rational equivalent of its real argument with full precision

Instances
Real Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Int -> Rational #

Real Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int8 -> Rational #

Real Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int16 -> Rational #

Real Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int32 -> Rational #

Real Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int64 -> Rational #

Real Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Integer -> Rational #

Real Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

toRational :: Word -> Rational #

Real Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word8 -> Rational #

Real Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word16 -> Rational #

Real Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word32 -> Rational #

Real Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word64 -> Rational #

Real Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: Percent -> Rational #

Real LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: LogValue -> Rational #

Real PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toRational :: PlotIndex -> Rational #

Real CChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CChar -> Rational #

Real CSChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSChar -> Rational #

Real CUChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUChar -> Rational #

Real CShort 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CShort -> Rational #

Real CUShort 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUShort -> Rational #

Real CInt 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CInt -> Rational #

Real CUInt 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUInt -> Rational #

Real CLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CLong -> Rational #

Real CULong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CULong -> Rational #

Real CLLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CLLong -> Rational #

Real CULLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CULLong -> Rational #

Real CBool 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CBool -> Rational #

Real CFloat 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CFloat -> Rational #

Real CDouble 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CDouble -> Rational #

Real CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CPtrdiff -> Rational #

Real CSize 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSize -> Rational #

Real CWchar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CWchar -> Rational #

Real CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSigAtomic -> Rational #

Real CClock 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CClock -> Rational #

Real CTime 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CTime -> Rational #

Real CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUSeconds -> Rational #

Real CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSUSeconds -> Rational #

Real CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CIntPtr -> Rational #

Real CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUIntPtr -> Rational #

Real CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CIntMax -> Rational #

Real CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUIntMax -> Rational #

Real NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

toRational :: NominalDiffTime -> Rational #

Real DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

toRational :: DiffTime -> Rational #

Real Scientific 
Instance details

Defined in Data.Scientific

Methods

toRational :: Scientific -> Rational #

Real Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

toRational :: Crossings -> Rational #

Real LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

toRational :: LogFloat -> Rational #

Real ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

toRational :: ConstVal -> Rational #

Integral a => Real (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Ratio a -> Rational #

Real a => Real (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

toRational :: Identity a -> Rational #

Real n => Real (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

toRational :: VarInt n -> Rational #

(Precise a, RealFloat a, Ord a) => Real (Log a) 
Instance details

Defined in Numeric.Log

Methods

toRational :: Log a -> Rational #

Real n => Real (Time n) 
Instance details

Defined in Data.Active

Methods

toRational :: Time n -> Rational #

Real a => Real (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

toRational :: Interval a -> Rational #

Real n => Real (Duration n) 
Instance details

Defined in Data.Active

Methods

toRational :: Duration n -> Rational #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

(Integral t, Real t, KnownNat m, Integral (Mod m t)) => Real (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

toRational :: Mod m t -> Rational #

Real a => Real (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

toRational :: Const a b -> Rational #

Real a => Real (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

toRational :: Tagged s a -> Rational #

class (RealFrac a, Floating a) => RealFloat a where #

Efficient, machine-independent access to the components of a + expected to use double quotes, rather than square brackets.

Instances
Read Bool

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Bool #

readList :: ReadS [Bool] #

readPrec :: ReadPrec Bool #

readListPrec :: ReadPrec [Bool] #

Read Char

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Char #

readList :: ReadS [Char] #

readPrec :: ReadPrec Char #

readListPrec :: ReadPrec [Char] #

Read Double

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Double #

readList :: ReadS [Double] #

readPrec :: ReadPrec Double #

readListPrec :: ReadPrec [Double] #

Read Float

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Float #

readList :: ReadS [Float] #

readPrec :: ReadPrec Float #

readListPrec :: ReadPrec [Float] #

Read Int

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Int #

readList :: ReadS [Int] #

readPrec :: ReadPrec Int #

readListPrec :: ReadPrec [Int] #

Read Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int8 #

readList :: ReadS [Int8] #

readPrec :: ReadPrec Int8 #

readListPrec :: ReadPrec [Int8] #

Read Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int16 #

readList :: ReadS [Int16] #

readPrec :: ReadPrec Int16 #

readListPrec :: ReadPrec [Int16] #

Read Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int32 #

readList :: ReadS [Int32] #

readPrec :: ReadPrec Int32 #

readListPrec :: ReadPrec [Int32] #

Read Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

readsPrec :: Int -> ReadS Int64 #

readList :: ReadS [Int64] #

readPrec :: ReadPrec Int64 #

readListPrec :: ReadPrec [Int64] #

Read Integer

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Integer #

readList :: ReadS [Integer] #

readPrec :: ReadPrec Integer #

readListPrec :: ReadPrec [Integer] #

Read Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Natural #

readList :: ReadS [Natural] #

readPrec :: ReadPrec Natural #

readListPrec :: ReadPrec [Natural] #

Read Ordering

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Ordering #

readList :: ReadS [Ordering] #

readPrec :: ReadPrec Ordering #

readListPrec :: ReadPrec [Ordering] #

Read Word

Since: base-4.5.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word #

readList :: ReadS [Word] #

readPrec :: ReadPrec Word #

readListPrec :: ReadPrec [Word] #

Read Word8

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word8 #

readList :: ReadS [Word8] #

readPrec :: ReadPrec Word8 #

readListPrec :: ReadPrec [Word8] #

Read Word16

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word16 #

readList :: ReadS [Word16] #

readPrec :: ReadPrec Word16 #

readListPrec :: ReadPrec [Word16] #

Read Word32

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word32 #

readList :: ReadS [Word32] #

readPrec :: ReadPrec Word32 #

readListPrec :: ReadPrec [Word32] #

Read Word64

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word64 #

readList :: ReadS [Word64] #

readPrec :: ReadPrec Word64 #

readListPrec :: ReadPrec [Word64] #

Read ()

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS () #

readList :: ReadS [()] #

readPrec :: ReadPrec () #

readListPrec :: ReadPrec [()] #

Read ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

readsPrec :: Int -> ReadS ByteString #

readList :: ReadS [ByteString] #

readPrec :: ReadPrec ByteString #

readListPrec :: ReadPrec [ByteString] #

Read Fd 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS Fd #

readList :: ReadS [Fd] #

readPrec :: ReadPrec Fd #

readListPrec :: ReadPrec [Fd] #

Read CKey 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CKey #

readList :: ReadS [CKey] #

readPrec :: ReadPrec CKey #

readListPrec :: ReadPrec [CKey] #

Read CId 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CId #

readList :: ReadS [CId] #

readPrec :: ReadPrec CId #

readListPrec :: ReadPrec [CId] #

Read CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CFsFilCnt #

readList :: ReadS [CFsFilCnt] #

readPrec :: ReadPrec CFsFilCnt #

readListPrec :: ReadPrec [CFsFilCnt] #

Read CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CFsBlkCnt #

readList :: ReadS [CFsBlkCnt] #

readPrec :: ReadPrec CFsBlkCnt #

readListPrec :: ReadPrec [CFsBlkCnt] #

Read CClockId 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CClockId #

readList :: ReadS [CClockId] #

readPrec :: ReadPrec CClockId #

readListPrec :: ReadPrec [CClockId] #

Read CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CBlkCnt #

readList :: ReadS [CBlkCnt] #

readPrec :: ReadPrec CBlkCnt #

readListPrec :: ReadPrec [CBlkCnt] #

Read CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CBlkSize #

readList :: ReadS [CBlkSize] #

readPrec :: ReadPrec CBlkSize #

readListPrec :: ReadPrec [CBlkSize] #

Read CRLim 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CRLim #

readList :: ReadS [CRLim] #

readPrec :: ReadPrec CRLim #

readListPrec :: ReadPrec [CRLim] #

Read CTcflag 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CTcflag #

readList :: ReadS [CTcflag] #

readPrec :: ReadPrec CTcflag #

readListPrec :: ReadPrec [CTcflag] #

Read CSpeed 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CSpeed #

readList :: ReadS [CSpeed] #

readPrec :: ReadPrec CSpeed #

readListPrec :: ReadPrec [CSpeed] #

Read CCc 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CCc #

readList :: ReadS [CCc] #

readPrec :: ReadPrec CCc #

readListPrec :: ReadPrec [CCc] #

Read CUid 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CUid #

readList :: ReadS [CUid] #

readPrec :: ReadPrec CUid #

readListPrec :: ReadPrec [CUid] #

Read CNlink 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CNlink #

readList :: ReadS [CNlink] #

readPrec :: ReadPrec CNlink #

readListPrec :: ReadPrec [CNlink] #

Read CGid 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CGid #

readList :: ReadS [CGid] #

readPrec :: ReadPrec CGid #

readListPrec :: ReadPrec [CGid] #

Read CSsize 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CSsize #

readList :: ReadS [CSsize] #

readPrec :: ReadPrec CSsize #

readListPrec :: ReadPrec [CSsize] #

Read CPid 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CPid #

readList :: ReadS [CPid] #

readPrec :: ReadPrec CPid #

readListPrec :: ReadPrec [CPid] #

Read COff 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS COff #

readList :: ReadS [COff] #

readPrec :: ReadPrec COff #

readListPrec :: ReadPrec [COff] #

Read CMode 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CMode #

readList :: ReadS [CMode] #

readPrec :: ReadPrec CMode #

readListPrec :: ReadPrec [CMode] #

Read CIno 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CIno #

readList :: ReadS [CIno] #

readPrec :: ReadPrec CIno #

readListPrec :: ReadPrec [CIno] #

Read CDev 
Instance details

Defined in System.Posix.Types

Methods

readsPrec :: Int -> ReadS CDev #

readList :: ReadS [CDev] #

readPrec :: ReadPrec CDev #

readListPrec :: ReadPrec [CDev] #

Read IOMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.IOMode

Methods

readsPrec :: Int -> ReadS IOMode #

readList :: ReadS [IOMode] #

readPrec :: ReadPrec IOMode #

readListPrec :: ReadPrec [IOMode] #

Read StdGen 
Instance details

Defined in System.Random

Methods

readsPrec :: Int -> ReadS StdGen #

readList :: ReadS [StdGen] #

readPrec :: ReadPrec StdGen #

readListPrec :: ReadPrec [StdGen] #

Read ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

readsPrec :: Int -> ReadS ByteString #

readList :: ReadS [ByteString] #

readPrec :: ReadPrec ByteString #

readListPrec :: ReadPrec [ByteString] #

Read Scientific

Supports the skipping of parentheses and whitespaces. Example:

> read " ( ((  -1.0e+3 ) ))" :: Scientific
+-1000.0

(Note: This Read instance makes internal use of + scientificP to parse the floating-point number.)

Instance details

Defined in Data.Scientific

Methods

readsPrec :: Int -> ReadS Scientific #

readList :: ReadS [Scientific] #

readPrec :: ReadPrec Scientific #

readListPrec :: ReadPrec [Scientific] #

Read Value 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

readsPrec :: Int -> ReadS Value #

readList :: ReadS [Value] #

readPrec :: ReadPrec Value #

readListPrec :: ReadPrec [Value] #

Read DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

readsPrec :: Int -> ReadS DotNetTime #

readList :: ReadS [DotNetTime] #

readPrec :: ReadPrec DotNetTime #

readListPrec :: ReadPrec [DotNetTime] #

Read Void

Reading a Void value is always a parse error, considering + Void as a data type with no constructors.

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

readsPrec :: Int -> ReadS Void #

readList :: ReadS [Void] #

readPrec :: ReadPrec Void #

readListPrec :: ReadPrec [Void] #

Read Version

Since: base-2.1

Instance details

Defined in Data.Version

Methods

readsPrec :: Int -> ReadS Version #

readList :: ReadS [Version] #

readPrec :: ReadPrec Version #

readListPrec :: ReadPrec [Version] #

Read ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

readsPrec :: Int -> ReadS ExitCode #

readList :: ReadS [ExitCode] #

readPrec :: ReadPrec ExitCode #

readListPrec :: ReadPrec [ExitCode] #

Read BufferMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS BufferMode #

readList :: ReadS [BufferMode] #

readPrec :: ReadPrec BufferMode #

readListPrec :: ReadPrec [BufferMode] #

Read Newline

Since: base-4.3.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS Newline #

readList :: ReadS [Newline] #

readPrec :: ReadPrec Newline #

readListPrec :: ReadPrec [Newline] #

Read NewlineMode

Since: base-4.3.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

readsPrec :: Int -> ReadS NewlineMode #

readList :: ReadS [NewlineMode] #

readPrec :: ReadPrec NewlineMode #

readListPrec :: ReadPrec [NewlineMode] #

Read SeekMode

Since: base-4.2.0.0

Instance details

Defined in GHC.IO.Device

Methods

readsPrec :: Int -> ReadS SeekMode #

readList :: ReadS [SeekMode] #

readPrec :: ReadPrec SeekMode #

readListPrec :: ReadPrec [SeekMode] #

Read All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS All #

readList :: ReadS [All] #

readPrec :: ReadPrec All #

readListPrec :: ReadPrec [All] #

Read Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS Any #

readList :: ReadS [Any] #

readPrec :: ReadPrec Any #

readListPrec :: ReadPrec [Any] #

Read Fixity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS Fixity #

readList :: ReadS [Fixity] #

readPrec :: ReadPrec Fixity #

readListPrec :: ReadPrec [Fixity] #

Read Associativity

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS Associativity #

readList :: ReadS [Associativity] #

readPrec :: ReadPrec Associativity #

readListPrec :: ReadPrec [Associativity] #

Read SourceUnpackedness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS SourceUnpackedness #

readList :: ReadS [SourceUnpackedness] #

readPrec :: ReadPrec SourceUnpackedness #

readListPrec :: ReadPrec [SourceUnpackedness] #

Read SourceStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS SourceStrictness #

readList :: ReadS [SourceStrictness] #

readPrec :: ReadPrec SourceStrictness #

readListPrec :: ReadPrec [SourceStrictness] #

Read DecidedStrictness

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS DecidedStrictness #

readList :: ReadS [DecidedStrictness] #

readPrec :: ReadPrec DecidedStrictness #

readListPrec :: ReadPrec [DecidedStrictness] #

Read SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

readsPrec :: Int -> ReadS SomeNat #

readList :: ReadS [SomeNat] #

readPrec :: ReadPrec SomeNat #

readListPrec :: ReadPrec [SomeNat] #

Read CChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CChar #

readList :: ReadS [CChar] #

readPrec :: ReadPrec CChar #

readListPrec :: ReadPrec [CChar] #

Read CSChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSChar #

readList :: ReadS [CSChar] #

readPrec :: ReadPrec CSChar #

readListPrec :: ReadPrec [CSChar] #

Read CUChar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUChar #

readList :: ReadS [CUChar] #

readPrec :: ReadPrec CUChar #

readListPrec :: ReadPrec [CUChar] #

Read CShort 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CShort #

readList :: ReadS [CShort] #

readPrec :: ReadPrec CShort #

readListPrec :: ReadPrec [CShort] #

Read CUShort 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUShort #

readList :: ReadS [CUShort] #

readPrec :: ReadPrec CUShort #

readListPrec :: ReadPrec [CUShort] #

Read CInt 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CInt #

readList :: ReadS [CInt] #

readPrec :: ReadPrec CInt #

readListPrec :: ReadPrec [CInt] #

Read CUInt 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUInt #

readList :: ReadS [CUInt] #

readPrec :: ReadPrec CUInt #

readListPrec :: ReadPrec [CUInt] #

Read CLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CLong #

readList :: ReadS [CLong] #

readPrec :: ReadPrec CLong #

readListPrec :: ReadPrec [CLong] #

Read CULong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CULong #

readList :: ReadS [CULong] #

readPrec :: ReadPrec CULong #

readListPrec :: ReadPrec [CULong] #

Read CLLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CLLong #

readList :: ReadS [CLLong] #

readPrec :: ReadPrec CLLong #

readListPrec :: ReadPrec [CLLong] #

Read CULLong 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CULLong #

readList :: ReadS [CULLong] #

readPrec :: ReadPrec CULLong #

readListPrec :: ReadPrec [CULLong] #

Read CBool 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CBool #

readList :: ReadS [CBool] #

readPrec :: ReadPrec CBool #

readListPrec :: ReadPrec [CBool] #

Read CFloat 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CFloat #

readList :: ReadS [CFloat] #

readPrec :: ReadPrec CFloat #

readListPrec :: ReadPrec [CFloat] #

Read CDouble 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CDouble #

readList :: ReadS [CDouble] #

readPrec :: ReadPrec CDouble #

readListPrec :: ReadPrec [CDouble] #

Read CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CPtrdiff #

readList :: ReadS [CPtrdiff] #

readPrec :: ReadPrec CPtrdiff #

readListPrec :: ReadPrec [CPtrdiff] #

Read CSize 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSize #

readList :: ReadS [CSize] #

readPrec :: ReadPrec CSize #

readListPrec :: ReadPrec [CSize] #

Read CWchar 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CWchar #

readList :: ReadS [CWchar] #

readPrec :: ReadPrec CWchar #

readListPrec :: ReadPrec [CWchar] #

Read CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSigAtomic #

readList :: ReadS [CSigAtomic] #

readPrec :: ReadPrec CSigAtomic #

readListPrec :: ReadPrec [CSigAtomic] #

Read CClock 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CClock #

readList :: ReadS [CClock] #

readPrec :: ReadPrec CClock #

readListPrec :: ReadPrec [CClock] #

Read CTime 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CTime #

readList :: ReadS [CTime] #

readPrec :: ReadPrec CTime #

readListPrec :: ReadPrec [CTime] #

Read CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUSeconds #

readList :: ReadS [CUSeconds] #

readPrec :: ReadPrec CUSeconds #

readListPrec :: ReadPrec [CUSeconds] #

Read CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CSUSeconds #

readList :: ReadS [CSUSeconds] #

readPrec :: ReadPrec CSUSeconds #

readListPrec :: ReadPrec [CSUSeconds] #

Read CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CIntPtr #

readList :: ReadS [CIntPtr] #

readPrec :: ReadPrec CIntPtr #

readListPrec :: ReadPrec [CIntPtr] #

Read CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUIntPtr #

readList :: ReadS [CUIntPtr] #

readPrec :: ReadPrec CUIntPtr #

readListPrec :: ReadPrec [CUIntPtr] #

Read CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CIntMax #

readList :: ReadS [CIntMax] #

readPrec :: ReadPrec CIntMax #

readListPrec :: ReadPrec [CIntMax] #

Read CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

readsPrec :: Int -> ReadS CUIntMax #

readList :: ReadS [CUIntMax] #

readPrec :: ReadPrec CUIntMax #

readListPrec :: ReadPrec [CUIntMax] #

Read Lexeme

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Lexeme #

readList :: ReadS [Lexeme] #

readPrec :: ReadPrec Lexeme #

readListPrec :: ReadPrec [Lexeme] #

Read GeneralCategory

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS GeneralCategory #

readList :: ReadS [GeneralCategory] #

readPrec :: ReadPrec GeneralCategory #

readListPrec :: ReadPrec [GeneralCategory] #

Read IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

readsPrec :: Int -> ReadS IntSet #

readList :: ReadS [IntSet] #

readPrec :: ReadPrec IntSet #

readListPrec :: ReadPrec [IntSet] #

Read FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS FileType #

readList :: ReadS [FileType] #

readPrec :: ReadPrec FileType #

readListPrec :: ReadPrec [FileType] #

Read Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS Permissions #

readList :: ReadS [Permissions] #

readPrec :: ReadPrec Permissions #

readListPrec :: ReadPrec [Permissions] #

Read XdgDirectory 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS XdgDirectory #

readList :: ReadS [XdgDirectory] #

readPrec :: ReadPrec XdgDirectory #

readListPrec :: ReadPrec [XdgDirectory] #

Read XdgDirectoryList 
Instance details

Defined in System.Directory.Internal.Common

Methods

readsPrec :: Int -> ReadS XdgDirectoryList #

readList :: ReadS [XdgDirectoryList] #

readPrec :: ReadPrec XdgDirectoryList #

readListPrec :: ReadPrec [XdgDirectoryList] #

Read ShortText 
Instance details

Defined in Data.Text.Short.Internal

Methods

readsPrec :: Int -> ReadS ShortText #

readList :: ReadS [ShortText] #

readPrec :: ReadPrec ShortText #

readListPrec :: ReadPrec [ShortText] #

Read DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

readsPrec :: Int -> ReadS DatatypeVariant #

readList :: ReadS [DatatypeVariant] #

readPrec :: ReadPrec DatatypeVariant #

readListPrec :: ReadPrec [DatatypeVariant] #

Read UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

readsPrec :: Int -> ReadS UnpackedUUID #

readList :: ReadS [UnpackedUUID] #

readPrec :: ReadPrec UnpackedUUID #

readListPrec :: ReadPrec [UnpackedUUID] #

Read UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

readsPrec :: Int -> ReadS UUID #

readList :: ReadS [UUID] #

readPrec :: ReadPrec UUID #

readListPrec :: ReadPrec [UUID] #

Read DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

readsPrec :: Int -> ReadS DictionaryHash #

readList :: ReadS [DictionaryHash] #

readPrec :: ReadPrec DictionaryHash #

readListPrec :: ReadPrec [DictionaryHash] #

Read NewtonParam 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS NewtonParam #

readList :: ReadS [NewtonParam] #

readPrec :: ReadPrec NewtonParam #

readListPrec :: ReadPrec [NewtonParam] #

Read NewtonStep 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS NewtonStep #

readList :: ReadS [NewtonStep] #

readPrec :: ReadPrec NewtonStep #

readListPrec :: ReadPrec [NewtonStep] #

Read RiddersParam 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS RiddersParam #

readList :: ReadS [RiddersParam] #

readPrec :: ReadPrec RiddersParam #

readListPrec :: ReadPrec [RiddersParam] #

Read RiddersStep 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS RiddersStep #

readList :: ReadS [RiddersStep] #

readPrec :: ReadPrec RiddersStep #

readListPrec :: ReadPrec [RiddersStep] #

Read Tolerance 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS Tolerance #

readList :: ReadS [Tolerance] #

readPrec :: ReadPrec Tolerance #

readListPrec :: ReadPrec [Tolerance] #

Read ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

readsPrec :: Int -> ReadS ConstVal #

readList :: ReadS [ConstVal] #

readPrec :: ReadPrec ConstVal #

readListPrec :: ReadPrec [ConstVal] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Read Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

readsPrec :: Int -> ReadS Cairo #

readList :: ReadS [Cairo] #

readPrec :: ReadPrec Cairo #

readListPrec :: ReadPrec [Cairo] #

Read OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

readsPrec :: Int -> ReadS OutputType #

readList :: ReadS [OutputType] #

readPrec :: ReadPrec OutputType #

readListPrec :: ReadPrec [OutputType] #

Read ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS ScaleMode #

readList :: ReadS [ScaleMode] #

readPrec :: ReadPrec ScaleMode #

readListPrec :: ReadPrec [ScaleMode] #

Read UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

readsPrec :: Int -> ReadS UniformScaleStrategy #

readList :: ReadS [UniformScaleStrategy] #

readPrec :: ReadPrec UniformScaleStrategy #

readListPrec :: ReadPrec [UniformScaleStrategy] #

Read Placement 
Instance details

Defined in Plots.Types

Methods

readsPrec :: Int -> ReadS Placement #

readList :: ReadS [Placement] #

readPrec :: ReadPrec Placement #

readListPrec :: ReadPrec [Placement] #

Read Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Methods

readsPrec :: Int -> ReadS Points #

readList :: ReadS [Points] #

readPrec :: ReadPrec Points #

readListPrec :: ReadPrec [Points] #

Read a => Read [a]

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS [a] #

readList :: ReadS [[a]] #

readPrec :: ReadPrec [a] #

readListPrec :: ReadPrec [[a]] #

Read a => Read (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Maybe a) #

readList :: ReadS [Maybe a] #

readPrec :: ReadPrec (Maybe a) #

readListPrec :: ReadPrec [Maybe a] #

(Integral a, Read a) => Read (Ratio a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Ratio a) #

readList :: ReadS [Ratio a] #

readPrec :: ReadPrec (Ratio a) #

readListPrec :: ReadPrec [Ratio a] #

Read p => Read (Par1 p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (Par1 p) #

readList :: ReadS [Par1 p] #

readPrec :: ReadPrec (Par1 p) #

readListPrec :: ReadPrec [Par1 p] #

(Read a, Storable a) => Read (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

Read a => Read (Only a) 
Instance details

Defined in Data.Tuple.Only

Methods

readsPrec :: Int -> ReadS (Only a) #

readList :: ReadS [Only a] #

readPrec :: ReadPrec (Only a) #

readListPrec :: ReadPrec [Only a] #

Read a => Read (Complex a)

Since: base-2.1

Instance details

Defined in Data.Complex

Methods

readsPrec :: Int -> ReadS (Complex a) #

readList :: ReadS [Complex a] #

readPrec :: ReadPrec (Complex a) #

readListPrec :: ReadPrec [Complex a] #

Read a => Read (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Min a) #

readList :: ReadS [Min a] #

readPrec :: ReadPrec (Min a) #

readListPrec :: ReadPrec [Min a] #

Read a => Read (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Max a) #

readList :: ReadS [Max a] #

readPrec :: ReadPrec (Max a) #

readListPrec :: ReadPrec [Max a] #

Read a => Read (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (First a) #

readList :: ReadS [First a] #

readPrec :: ReadPrec (First a) #

readListPrec :: ReadPrec [First a] #

Read a => Read (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Last a) #

readList :: ReadS [Last a] #

readPrec :: ReadPrec (Last a) #

readListPrec :: ReadPrec [Last a] #

Read m => Read (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (WrappedMonoid m) #

readList :: ReadS [WrappedMonoid m] #

readPrec :: ReadPrec (WrappedMonoid m) #

readListPrec :: ReadPrec [WrappedMonoid m] #

Read a => Read (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Option a) #

readList :: ReadS [Option a] #

readPrec :: ReadPrec (Option a) #

readListPrec :: ReadPrec [Option a] #

Read a => Read (ZipList a)

Since: base-4.7.0.0

Instance details

Defined in Control.Applicative

Methods

readsPrec :: Int -> ReadS (ZipList a) #

readList :: ReadS [ZipList a] #

readPrec :: ReadPrec (ZipList a) #

readListPrec :: ReadPrec [ZipList a] #

Read a => Read (Identity a)

This instance would be equivalent to the derived instances of the + Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

readsPrec :: Int -> ReadS (Identity a) #

readList :: ReadS [Identity a] #

readPrec :: ReadPrec (Identity a) #

readListPrec :: ReadPrec [Identity a] #

Read a => Read (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (First a) #

readList :: ReadS [First a] #

readPrec :: ReadPrec (First a) #

readListPrec :: ReadPrec [First a] #

Read a => Read (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (Last a) #

readList :: ReadS [Last a] #

readPrec :: ReadPrec (Last a) #

readListPrec :: ReadPrec [Last a] #

Read a => Read (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Dual a) #

readList :: ReadS [Dual a] #

readPrec :: ReadPrec (Dual a) #

readListPrec :: ReadPrec [Dual a] #

Read a => Read (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Sum a) #

readList :: ReadS [Sum a] #

readPrec :: ReadPrec (Sum a) #

readListPrec :: ReadPrec [Sum a] #

Read a => Read (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Product a) #

readList :: ReadS [Product a] #

readPrec :: ReadPrec (Product a) #

readListPrec :: ReadPrec [Product a] #

Read a => Read (Down a)

Since: base-4.7.0.0

Instance details

Defined in Data.Ord

Methods

readsPrec :: Int -> ReadS (Down a) #

readList :: ReadS [Down a] #

readPrec :: ReadPrec (Down a) #

readListPrec :: ReadPrec [Down a] #

Read a => Read (NonEmpty a)

Since: base-4.11.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (NonEmpty a) #

readList :: ReadS [NonEmpty a] #

readPrec :: ReadPrec (NonEmpty a) #

readListPrec :: ReadPrec [NonEmpty a] #

Read e => Read (IntMap e) 
Instance details

Defined in Data.IntMap.Internal

Methods

readsPrec :: Int -> ReadS (IntMap e) #

readList :: ReadS [IntMap e] #

readPrec :: ReadPrec (IntMap e) #

readListPrec :: ReadPrec [IntMap e] #

Read a => Read (Tree a) 
Instance details

Defined in Data.Tree

Methods

readsPrec :: Int -> ReadS (Tree a) #

readList :: ReadS [Tree a] #

readPrec :: ReadPrec (Tree a) #

readListPrec :: ReadPrec [Tree a] #

Read a => Read (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (Seq a) #

readList :: ReadS [Seq a] #

readPrec :: ReadPrec (Seq a) #

readListPrec :: ReadPrec [Seq a] #

Read a => Read (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (ViewL a) #

readList :: ReadS [ViewL a] #

readPrec :: ReadPrec (ViewL a) #

readListPrec :: ReadPrec [ViewL a] #

Read a => Read (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

readsPrec :: Int -> ReadS (ViewR a) #

readList :: ReadS [ViewR a] #

readPrec :: ReadPrec (ViewR a) #

readListPrec :: ReadPrec [ViewR a] #

(Read a, Ord a) => Read (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

readsPrec :: Int -> ReadS (Set a) #

readList :: ReadS [Set a] #

readPrec :: ReadPrec (Set a) #

readListPrec :: ReadPrec [Set a] #

Read a => Read (DList a) 
Instance details

Defined in Data.DList

Methods

readsPrec :: Int -> ReadS (DList a) #

readList :: ReadS [DList a] #

readPrec :: ReadPrec (DList a) #

readListPrec :: ReadPrec [DList a] #

Read a => Read (SmallArray a) 
Instance details

Defined in Data.Primitive.SmallArray

Methods

readsPrec :: Int -> ReadS (SmallArray a) #

readList :: ReadS [SmallArray a] #

readPrec :: ReadPrec (SmallArray a) #

readListPrec :: ReadPrec [SmallArray a] #

Read a => Read (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

readsPrec :: Int -> ReadS (Array a) #

readList :: ReadS [Array a] #

readPrec :: ReadPrec (Array a) #

readListPrec :: ReadPrec [Array a] #

(Eq a, Hashable a, Read a) => Read (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Methods

readsPrec :: Int -> ReadS (HashSet a) #

readList :: ReadS [HashSet a] #

readPrec :: ReadPrec (HashSet a) #

readListPrec :: ReadPrec [HashSet a] #

(Read a, Prim a) => Read (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

Read a => Read (Vector a) 
Instance details

Defined in Data.Vector

Methods

readsPrec :: Int -> ReadS (Vector a) #

readList :: ReadS [Vector a] #

readPrec :: ReadPrec (Vector a) #

readListPrec :: ReadPrec [Vector a] #

Read a => Read (Root a) 
Instance details

Defined in Numeric.RootFinding

Methods

readsPrec :: Int -> ReadS (Root a) #

readList :: ReadS [Root a] #

readPrec :: ReadPrec (Root a) #

readListPrec :: ReadPrec [Root a] #

(Floating a, Read a) => Read (Log a) 
Instance details

Defined in Numeric.Log

Methods

readsPrec :: Int -> ReadS (Log a) #

readList :: ReadS [Log a] #

readPrec :: ReadPrec (Log a) #

readListPrec :: ReadPrec [Log a] #

Read1 f => Read (Fix f) 
Instance details

Defined in Data.Functor.Foldable

Methods

readsPrec :: Int -> ReadS (Fix f) #

readList :: ReadS [Fix f] #

readPrec :: ReadPrec (Fix f) #

readListPrec :: ReadPrec [Fix f] #

(Functor f, Read1 f) => Read (Mu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

readsPrec :: Int -> ReadS (Mu f) #

readList :: ReadS [Mu f] #

readPrec :: ReadPrec (Mu f) #

readListPrec :: ReadPrec [Mu f] #

(Functor f, Read1 f) => Read (Nu f) 
Instance details

Defined in Data.Functor.Foldable

Methods

readsPrec :: Int -> ReadS (Nu f) #

readList :: ReadS [Nu f] #

readPrec :: ReadPrec (Nu f) #

readListPrec :: ReadPrec [Nu f] #

Read a => Read (V2 a) 
Instance details

Defined in Linear.V2

Methods

readsPrec :: Int -> ReadS (V2 a) #

readList :: ReadS [V2 a] #

readPrec :: ReadPrec (V2 a) #

readListPrec :: ReadPrec [V2 a] #

(Read (V a (N a)), Read a) => Read (Located a) 
Instance details

Defined in Diagrams.Located

Methods

readsPrec :: Int -> ReadS (Located a) #

readList :: ReadS [Located a] #

readPrec :: ReadPrec (Located a) #

readListPrec :: ReadPrec [Located a] #

Read n => Read (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

readsPrec :: Int -> ReadS (PolyOrientation n) #

readList :: ReadS [PolyOrientation n] #

readPrec :: ReadPrec (PolyOrientation n) #

readListPrec :: ReadPrec [PolyOrientation n] #

Read n => Read (Time n) 
Instance details

Defined in Data.Active

Methods

readsPrec :: Int -> ReadS (Time n) #

readList :: ReadS [Time n] #

readPrec :: ReadPrec (Time n) #

readListPrec :: ReadPrec [Time n] #

Read a => Read (V3 a) 
Instance details

Defined in Linear.V3

Methods

readsPrec :: Int -> ReadS (V3 a) #

readList :: ReadS [V3 a] #

readPrec :: ReadPrec (V3 a) #

readListPrec :: ReadPrec [V3 a] #

Read n => Read (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

readsPrec :: Int -> ReadS (Angle n) #

readList :: ReadS [Angle n] #

readPrec :: ReadPrec (Angle n) #

readListPrec :: ReadPrec [Angle n] #

Read a => Read (V1 a) 
Instance details

Defined in Linear.V1

Methods

readsPrec :: Int -> ReadS (V1 a) #

readList :: ReadS [V1 a] #

readPrec :: ReadPrec (V1 a) #

readListPrec :: ReadPrec [V1 a] #

Read n => Read (Duration n) 
Instance details

Defined in Data.Active

Methods

readsPrec :: Int -> ReadS (Duration n) #

readList :: ReadS [Duration n] #

readPrec :: ReadPrec (Duration n) #

readListPrec :: ReadPrec [Duration n] #

Read a => Read (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

readsPrec :: Int -> ReadS (Plucker a) #

readList :: ReadS [Plucker a] #

readPrec :: ReadPrec (Plucker a) #

readListPrec :: ReadPrec [Plucker a] #

Read a => Read (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

readsPrec :: Int -> ReadS (Quaternion a) #

readList :: ReadS [Quaternion a] #

readPrec :: ReadPrec (Quaternion a) #

readListPrec :: ReadPrec [Quaternion a] #

Read (V0 a) 
Instance details

Defined in Linear.V0

Methods

readsPrec :: Int -> ReadS (V0 a) #

readList :: ReadS [V0 a] #

readPrec :: ReadPrec (V0 a) #

readListPrec :: ReadPrec [V0 a] #

Read a => Read (V4 a) 
Instance details

Defined in Linear.V4

Methods

readsPrec :: Int -> ReadS (V4 a) #

readList :: ReadS [V4 a] #

readPrec :: ReadPrec (V4 a) #

readListPrec :: ReadPrec [V4 a] #

(Read a, Read b) => Read (Either a b)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

readsPrec :: Int -> ReadS (Either a b) #

readList :: ReadS [Either a b] #

readPrec :: ReadPrec (Either a b) #

readListPrec :: ReadPrec [Either a b] #

Read (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (V1 p) #

readList :: ReadS [V1 p] #

readPrec :: ReadPrec (V1 p) #

readListPrec :: ReadPrec [V1 p] #

Read (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (U1 p) #

readList :: ReadS [U1 p] #

readPrec :: ReadPrec (U1 p) #

readListPrec :: ReadPrec [U1 p] #

(Read a, Read b) => Read (a, b)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b) #

readList :: ReadS [(a, b)] #

readPrec :: ReadPrec (a, b) #

readListPrec :: ReadPrec [(a, b)] #

(Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) 
Instance details

Defined in Data.HashMap.Base

Methods

readsPrec :: Int -> ReadS (HashMap k e) #

readList :: ReadS [HashMap k e] #

readPrec :: ReadPrec (HashMap k e) #

readListPrec :: ReadPrec [HashMap k e] #

(Ord k, Read k, Read e) => Read (Map k e) 
Instance details

Defined in Data.Map.Internal

Methods

readsPrec :: Int -> ReadS (Map k e) #

readList :: ReadS [Map k e] #

readPrec :: ReadPrec (Map k e) #

readListPrec :: ReadPrec [Map k e] #

(Ix a, Read a, Read b) => Read (Array a b)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Array a b) #

readList :: ReadS [Array a b] #

readPrec :: ReadPrec (Array a b) #

readListPrec :: ReadPrec [Array a b] #

(Read a, Read b) => Read (Arg a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

readsPrec :: Int -> ReadS (Arg a b) #

readList :: ReadS [Arg a b] #

readPrec :: ReadPrec (Arg a b) #

readListPrec :: ReadPrec [Arg a b] #

Read (Proxy t)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

readsPrec :: Int -> ReadS (Proxy t) #

readList :: ReadS [Proxy t] #

readPrec :: ReadPrec (Proxy t) #

readListPrec :: ReadPrec [Proxy t] #

(Read1 m, Read a) => Read (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

readsPrec :: Int -> ReadS (MaybeT m a) #

readList :: ReadS [MaybeT m a] #

readPrec :: ReadPrec (MaybeT m a) #

readListPrec :: ReadPrec [MaybeT m a] #

(Read a, Read (s a)) => Read (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

readsPrec :: Int -> ReadS (ViewL s a) #

readList :: ReadS [ViewL s a] #

readPrec :: ReadPrec (ViewL s a) #

readListPrec :: ReadPrec [ViewL s a] #

(Read a, Read (s a)) => Read (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

readsPrec :: Int -> ReadS (ViewR s a) #

readList :: ReadS [ViewR s a] #

readPrec :: ReadPrec (ViewR s a) #

readListPrec :: ReadPrec [ViewR s a] #

(Read1 m, Read a) => Read (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

readsPrec :: Int -> ReadS (ListT m a) #

readList :: ReadS [ListT m a] #

readPrec :: ReadPrec (ListT m a) #

readListPrec :: ReadPrec [ListT m a] #

(Num p, Read p, Read a) => Read (Categorical p a) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

readsPrec :: Int -> ReadS (Categorical p a) #

readList :: ReadS [Categorical p a] #

readPrec :: ReadPrec (Categorical p a) #

readListPrec :: ReadPrec [Categorical p a] #

(Read a, Read b) => Read (ListF a b) 
Instance details

Defined in Data.Functor.Foldable

Methods

readsPrec :: Int -> ReadS (ListF a b) #

readList :: ReadS [ListF a b] #

readPrec :: ReadPrec (ListF a b) #

readListPrec :: ReadPrec [ListF a b] #

(Read1 f, Read a) => Read (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

readsPrec :: Int -> ReadS (Cofree f a) #

readList :: ReadS [Cofree f a] #

readPrec :: ReadPrec (Cofree f a) #

readListPrec :: ReadPrec [Cofree f a] #

(Read1 f, Read a) => Read (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

readsPrec :: Int -> ReadS (Free f a) #

readList :: ReadS [Free f a] #

readPrec :: ReadPrec (Free f a) #

readListPrec :: ReadPrec [Free f a] #

(Read a, Read b) => Read (NonEmptyF a b) 
Instance details

Defined in Data.Functor.Base

Methods

readsPrec :: Int -> ReadS (NonEmptyF a b) #

readList :: ReadS [NonEmptyF a b] #

readPrec :: ReadPrec (NonEmptyF a b) #

readListPrec :: ReadPrec [NonEmptyF a b] #

Read (f a) => Read (Point f a) 
Instance details

Defined in Linear.Affine

Methods

readsPrec :: Int -> ReadS (Point f a) #

readList :: ReadS [Point f a] #

readPrec :: ReadPrec (Point f a) #

readListPrec :: ReadPrec [Point f a] #

(Read i, Read a) => Read (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

readsPrec :: Int -> ReadS (Level i a) #

readList :: ReadS [Level i a] #

readPrec :: ReadPrec (Level i a) #

readListPrec :: ReadPrec [Level i a] #

Read (v n) => Read (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

readsPrec :: Int -> ReadS (Direction v n) #

readList :: ReadS [Direction v n] #

readPrec :: ReadPrec (Direction v n) #

readListPrec :: ReadPrec [Direction v n] #

Read (v n) => Read (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

readsPrec :: Int -> ReadS (BoundingBox v n) #

readList :: ReadS [BoundingBox v n] #

readPrec :: ReadPrec (BoundingBox v n) #

readListPrec :: ReadPrec [BoundingBox v n] #

(Functor f, Read (f a)) => Read (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

readsPrec :: Int -> ReadS (Yoneda f a) #

readList :: ReadS [Yoneda f a] #

readPrec :: ReadPrec (Yoneda f a) #

readListPrec :: ReadPrec [Yoneda f a] #

Read (f p) => Read (Rec1 f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (Rec1 f p) #

readList :: ReadS [Rec1 f p] #

readPrec :: ReadPrec (Rec1 f p) #

readListPrec :: ReadPrec [Rec1 f p] #

(Read a, Read b, Read c) => Read (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c) #

readList :: ReadS [(a, b, c)] #

readPrec :: ReadPrec (a, b, c) #

readListPrec :: ReadPrec [(a, b, c)] #

Read a => Read (Const a b)

This instance would be equivalent to the derived instances of the + Const newtype if the runConst field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

readsPrec :: Int -> ReadS (Const a b) #

readList :: ReadS [Const a b] #

readPrec :: ReadPrec (Const a b) #

readListPrec :: ReadPrec [Const a b] #

Read (f a) => Read (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

readsPrec :: Int -> ReadS (Ap f a) #

readList :: ReadS [Ap f a] #

readPrec :: ReadPrec (Ap f a) #

readListPrec :: ReadPrec [Ap f a] #

Read (f a) => Read (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

readsPrec :: Int -> ReadS (Alt f a) #

readList :: ReadS [Alt f a] #

readPrec :: ReadPrec (Alt f a) #

readListPrec :: ReadPrec [Alt f a] #

a ~ b => Read (a :~: b)

Since: base-4.7.0.0

Instance details

Defined in Data.Type.Equality

Methods

readsPrec :: Int -> ReadS (a :~: b) #

readList :: ReadS [a :~: b] #

readPrec :: ReadPrec (a :~: b) #

readListPrec :: ReadPrec [a :~: b] #

Read (p a a) => Read (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

readsPrec :: Int -> ReadS (Join p a) #

readList :: ReadS [Join p a] #

readPrec :: ReadPrec (Join p a) #

readListPrec :: ReadPrec [Join p a] #

Read (p (Fix p a) a) => Read (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

readsPrec :: Int -> ReadS (Fix p a) #

readList :: ReadS [Fix p a] #

readPrec :: ReadPrec (Fix p a) #

readListPrec :: ReadPrec [Fix p a] #

(Read1 f, Read a) => Read (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

readsPrec :: Int -> ReadS (IdentityT f a) #

readList :: ReadS [IdentityT f a] #

readPrec :: ReadPrec (IdentityT f a) #

readListPrec :: ReadPrec [IdentityT f a] #

(Read e, Read1 m, Read a) => Read (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

readsPrec :: Int -> ReadS (ExceptT e m a) #

readList :: ReadS [ExceptT e m a] #

readPrec :: ReadPrec (ExceptT e m a) #

readListPrec :: ReadPrec [ExceptT e m a] #

(Read w, Read1 m, Read a) => Read (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

readsPrec :: Int -> ReadS (WriterT w m a) #

readList :: ReadS [WriterT w m a] #

readPrec :: ReadPrec (WriterT w m a) #

readListPrec :: ReadPrec [WriterT w m a] #

(Read e, Read1 m, Read a) => Read (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

readsPrec :: Int -> ReadS (ErrorT e m a) #

readList :: ReadS [ErrorT e m a] #

readPrec :: ReadPrec (ErrorT e m a) #

readListPrec :: ReadPrec [ErrorT e m a] #

(Read w, Read1 m, Read a) => Read (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

readsPrec :: Int -> ReadS (WriterT w m a) #

readList :: ReadS [WriterT w m a] #

readPrec :: ReadPrec (WriterT w m a) #

readListPrec :: ReadPrec [WriterT w m a] #

Read b => Read (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

readsPrec :: Int -> ReadS (Tagged s b) #

readList :: ReadS [Tagged s b] #

readPrec :: ReadPrec (Tagged s b) #

readListPrec :: ReadPrec [Tagged s b] #

(Read1 f, Read a) => Read (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

readsPrec :: Int -> ReadS (Backwards f a) #

readList :: ReadS [Backwards f a] #

readPrec :: ReadPrec (Backwards f a) #

readListPrec :: ReadPrec [Backwards f a] #

Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

readsPrec :: Int -> ReadS (CofreeT f w a) #

readList :: ReadS [CofreeT f w a] #

readPrec :: ReadPrec (CofreeT f w a) #

readListPrec :: ReadPrec [CofreeT f w a] #

(Read a, Read (f b)) => Read (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

readsPrec :: Int -> ReadS (CofreeF f a b) #

readList :: ReadS [CofreeF f a b] #

readPrec :: ReadPrec (CofreeF f a b) #

readListPrec :: ReadPrec [CofreeF f a b] #

(Read1 f, Read1 m, Read a) => Read (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

readsPrec :: Int -> ReadS (FreeT f m a) #

readList :: ReadS [FreeT f m a] #

readPrec :: ReadPrec (FreeT f m a) #

readListPrec :: ReadPrec [FreeT f m a] #

(Read a, Read (f b)) => Read (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

readsPrec :: Int -> ReadS (FreeF f a b) #

readList :: ReadS [FreeF f a b] #

readPrec :: ReadPrec (FreeF f a b) #

readListPrec :: ReadPrec [FreeF f a b] #

Read a => Read (V n a) 
Instance details

Defined in Linear.V

Methods

readsPrec :: Int -> ReadS (V n a) #

readList :: ReadS [V n a] #

readPrec :: ReadPrec (V n a) #

readListPrec :: ReadPrec [V n a] #

Read (f (a, b)) => Read (AlongsideLeft f b a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

readsPrec :: Int -> ReadS (AlongsideLeft f b a) #

readList :: ReadS [AlongsideLeft f b a] #

readPrec :: ReadPrec (AlongsideLeft f b a) #

readListPrec :: ReadPrec [AlongsideLeft f b a] #

Read (f (a, b)) => Read (AlongsideRight f a b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

readsPrec :: Int -> ReadS (AlongsideRight f a b) #

readList :: ReadS [AlongsideRight f a b] #

readPrec :: ReadPrec (AlongsideRight f a b) #

readListPrec :: ReadPrec [AlongsideRight f a b] #

Read c => Read (K1 i c p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (K1 i c p) #

readList :: ReadS [K1 i c p] #

readPrec :: ReadPrec (K1 i c p) #

readListPrec :: ReadPrec [K1 i c p] #

(Read (f p), Read (g p)) => Read ((f :+: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :+: g) p) #

readList :: ReadS [(f :+: g) p] #

readPrec :: ReadPrec ((f :+: g) p) #

readListPrec :: ReadPrec [(f :+: g) p] #

(Read (f p), Read (g p)) => Read ((f :*: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :*: g) p) #

readList :: ReadS [(f :*: g) p] #

readPrec :: ReadPrec ((f :*: g) p) #

readListPrec :: ReadPrec [(f :*: g) p] #

(Read a, Read b, Read c, Read d) => Read (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d) #

readList :: ReadS [(a, b, c, d)] #

readPrec :: ReadPrec (a, b, c, d) #

readListPrec :: ReadPrec [(a, b, c, d)] #

(Read1 f, Read1 g, Read a) => Read (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

readsPrec :: Int -> ReadS (Product f g a) #

readList :: ReadS [Product f g a] #

readPrec :: ReadPrec (Product f g a) #

readListPrec :: ReadPrec [Product f g a] #

(Read1 f, Read1 g, Read a) => Read (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

readsPrec :: Int -> ReadS (Sum f g a) #

readList :: ReadS [Sum f g a] #

readPrec :: ReadPrec (Sum f g a) #

readListPrec :: ReadPrec [Sum f g a] #

a ~~ b => Read (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

readsPrec :: Int -> ReadS (a :~~: b) #

readList :: ReadS [a :~~: b] #

readPrec :: ReadPrec (a :~~: b) #

readListPrec :: ReadPrec [a :~~: b] #

Read (f p) => Read (M1 i c f p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS (M1 i c f p) #

readList :: ReadS [M1 i c f p] #

readPrec :: ReadPrec (M1 i c f p) #

readListPrec :: ReadPrec [M1 i c f p] #

Read (f (g p)) => Read ((f :.: g) p)

Since: base-4.7.0.0

Instance details

Defined in GHC.Generics

Methods

readsPrec :: Int -> ReadS ((f :.: g) p) #

readList :: ReadS [(f :.: g) p] #

readPrec :: ReadPrec ((f :.: g) p) #

readListPrec :: ReadPrec [(f :.: g) p] #

(Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e) #

readList :: ReadS [(a, b, c, d, e)] #

readPrec :: ReadPrec (a, b, c, d, e) #

readListPrec :: ReadPrec [(a, b, c, d, e)] #

(Read1 f, Read1 g, Read a) => Read (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

readsPrec :: Int -> ReadS (Compose f g a) #

readList :: ReadS [Compose f g a] #

readPrec :: ReadPrec (Compose f g a) #

readListPrec :: ReadPrec [Compose f g a] #

Read (p a b) => Read (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

readsPrec :: Int -> ReadS (WrappedBifunctor p a b) #

readList :: ReadS [WrappedBifunctor p a b] #

readPrec :: ReadPrec (WrappedBifunctor p a b) #

readListPrec :: ReadPrec [WrappedBifunctor p a b] #

Read (g b) => Read (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

readsPrec :: Int -> ReadS (Joker g a b) #

readList :: ReadS [Joker g a b] #

readPrec :: ReadPrec (Joker g a b) #

readListPrec :: ReadPrec [Joker g a b] #

Read (p b a) => Read (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

readsPrec :: Int -> ReadS (Flip p a b) #

readList :: ReadS [Flip p a b] #

readPrec :: ReadPrec (Flip p a b) #

readListPrec :: ReadPrec [Flip p a b] #

Read (f a) => Read (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

readsPrec :: Int -> ReadS (Clown f a b) #

readList :: ReadS [Clown f a b] #

readPrec :: ReadPrec (Clown f a b) #

readListPrec :: ReadPrec [Clown f a b] #

(Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f) #

readList :: ReadS [(a, b, c, d, e, f)] #

readPrec :: ReadPrec (a, b, c, d, e, f) #

readListPrec :: ReadPrec [(a, b, c, d, e, f)] #

(Read (p a b), Read (q a b)) => Read (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

readsPrec :: Int -> ReadS (Sum p q a b) #

readList :: ReadS [Sum p q a b] #

readPrec :: ReadPrec (Sum p q a b) #

readListPrec :: ReadPrec [Sum p q a b] #

(Read (f a b), Read (g a b)) => Read (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

readsPrec :: Int -> ReadS (Product f g a b) #

readList :: ReadS [Product f g a b] #

readPrec :: ReadPrec (Product f g a b) #

readListPrec :: ReadPrec [Product f g a b] #

(Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g) #

readList :: ReadS [(a, b, c, d, e, f, g)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g)] #

Read (f (p a b)) => Read (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

readsPrec :: Int -> ReadS (Tannen f p a b) #

readList :: ReadS [Tannen f p a b] #

readPrec :: ReadPrec (Tannen f p a b) #

readListPrec :: ReadPrec [Tannen f p a b] #

(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h) #

readList :: ReadS [(a, b, c, d, e, f, g, h)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i)] #

Read (p (f a) (g b)) => Read (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

readsPrec :: Int -> ReadS (Biff p f g a b) #

readList :: ReadS [Biff p f g a b] #

readPrec :: ReadPrec (Biff p f g a b) #

readListPrec :: ReadPrec [Biff p f g a b] #

(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n) #

readListPrec :: ReadPrec [(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)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] #

readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) #

readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] #

class (Num a, Ord a) => Real a where #

Methods

toRational :: a -> Rational #

the rational equivalent of its real argument with full precision

Instances
Real Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Int -> Rational #

Real Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int8 -> Rational #

Real Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int16 -> Rational #

Real Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int32 -> Rational #

Real Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

toRational :: Int64 -> Rational #

Real Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Integer -> Rational #

Real Natural

Since: base-4.8.0.0

Instance details

Defined in GHC.Real

Methods

toRational :: Natural -> Rational #

Real Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

toRational :: Word -> Rational #

Real Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word8 -> Rational #

Real Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word16 -> Rational #

Real Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word32 -> Rational #

Real Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

toRational :: Word64 -> Rational #

Real Fd 
Instance details

Defined in System.Posix.Types

Methods

toRational :: Fd -> Rational #

Real CKey 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CKey -> Rational #

Real CId 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CId -> Rational #

Real CFsFilCnt 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CFsFilCnt -> Rational #

Real CFsBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CFsBlkCnt -> Rational #

Real CClockId 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CClockId -> Rational #

Real CBlkCnt 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CBlkCnt -> Rational #

Real CBlkSize 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CBlkSize -> Rational #

Real CRLim 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CRLim -> Rational #

Real CTcflag 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CTcflag -> Rational #

Real CSpeed 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CSpeed -> Rational #

Real CCc 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CCc -> Rational #

Real CUid 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CUid -> Rational #

Real CNlink 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CNlink -> Rational #

Real CGid 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CGid -> Rational #

Real CSsize 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CSsize -> Rational #

Real CPid 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CPid -> Rational #

Real COff 
Instance details

Defined in System.Posix.Types

Methods

toRational :: COff -> Rational #

Real CMode 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CMode -> Rational #

Real CIno 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CIno -> Rational #

Real CDev 
Instance details

Defined in System.Posix.Types

Methods

toRational :: CDev -> Rational #

Real Scientific

WARNING: toRational needs to compute the Integer magnitude: + 10^e. If applied to a huge exponent this could fill up all space + and crash your program!

Avoid applying toRational (or realToFrac) to scientific numbers + coming from an untrusted source and use toRealFloat instead. The + latter guards against excessive space usage.

Instance details

Defined in Data.Scientific

Methods

toRational :: Scientific -> Rational #

Real CChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CChar -> Rational #

Real CSChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSChar -> Rational #

Real CUChar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUChar -> Rational #

Real CShort 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CShort -> Rational #

Real CUShort 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUShort -> Rational #

Real CInt 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CInt -> Rational #

Real CUInt 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUInt -> Rational #

Real CLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CLong -> Rational #

Real CULong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CULong -> Rational #

Real CLLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CLLong -> Rational #

Real CULLong 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CULLong -> Rational #

Real CBool 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CBool -> Rational #

Real CFloat 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CFloat -> Rational #

Real CDouble 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CDouble -> Rational #

Real CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CPtrdiff -> Rational #

Real CSize 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSize -> Rational #

Real CWchar 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CWchar -> Rational #

Real CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSigAtomic -> Rational #

Real CClock 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CClock -> Rational #

Real CTime 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CTime -> Rational #

Real CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUSeconds -> Rational #

Real CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CSUSeconds -> Rational #

Real CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CIntPtr -> Rational #

Real CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUIntPtr -> Rational #

Real CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CIntMax -> Rational #

Real CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

toRational :: CUIntMax -> Rational #

Real LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

toRational :: LogFloat -> Rational #

Real NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

toRational :: NominalDiffTime -> Rational #

Real DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

toRational :: DiffTime -> Rational #

Real ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

toRational :: ConstVal -> Rational #

Real LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: LogValue -> Rational #

Real Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

toRational :: Percent -> Rational #

Real PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

toRational :: PlotIndex -> Rational #

Real Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

toRational :: Crossings -> Rational #

Integral a => Real (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Ratio a -> Rational #

Real a => Real (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

toRational :: Identity a -> Rational #

Real n => Real (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

toRational :: VarInt n -> Rational #

Real a => Real (Interval a)

realToFrac will use the midpoint

Instance details

Defined in Numeric.Interval.Kaucher

Methods

toRational :: Interval a -> Rational #

(Precise a, RealFloat a, Ord a) => Real (Log a) 
Instance details

Defined in Numeric.Log

Methods

toRational :: Log a -> Rational #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

Real n => Real (Time n) 
Instance details

Defined in Data.Active

Methods

toRational :: Time n -> Rational #

Real n => Real (Duration n) 
Instance details

Defined in Data.Active

Methods

toRational :: Duration n -> Rational #

(Integral t, Real t, KnownNat m, Integral (Mod m t)) => Real (Mod m t) 
Instance details

Defined in Internal.Modular

Methods

toRational :: Mod m t -> Rational #

Real a => Real (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

toRational :: Const a b -> Rational #

Real a => Real (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

toRational :: Tagged s a -> Rational #

class (RealFrac a, Floating a) => RealFloat a where #

Efficient, machine-independent access to the components of a floating-point number.

Minimal complete definition

floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE

Methods

floatRadix :: a -> Integer #

a constant function, returning the radix of the representation (often 2)

floatDigits :: a -> Int #

a constant function, returning the number of digits of floatRadix in the significand

floatRange :: a -> (Int, Int) #

a constant function, returning the lowest and highest values @@ -187,12 +291,16 @@ signed zeroes are supported. atan2 y 1, with y in a type that is RealFloat, should return the same value as atan y. A default definition of atan2 is provided, but implementors - can provide a more accurate implementation.

Instances
RealFloat Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Double -> Integer #

floatDigits :: Double -> Int #

floatRange :: Double -> (Int, Int) #

decodeFloat :: Double -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Double #

exponent :: Double -> Int #

significand :: Double -> Double #

scaleFloat :: Int -> Double -> Double #

isNaN :: Double -> Bool #

isInfinite :: Double -> Bool #

isDenormalized :: Double -> Bool #

isNegativeZero :: Double -> Bool #

isIEEE :: Double -> Bool #

atan2 :: Double -> Double -> Double #

RealFloat Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Float -> Integer #

floatDigits :: Float -> Int #

floatRange :: Float -> (Int, Int) #

decodeFloat :: Float -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Float #

exponent :: Float -> Int #

significand :: Float -> Float #

scaleFloat :: Int -> Float -> Float #

isNaN :: Float -> Bool #

isInfinite :: Float -> Bool #

isDenormalized :: Float -> Bool #

isNegativeZero :: Float -> Bool #

isIEEE :: Float -> Bool #

atan2 :: Float -> Float -> Float #

RealFloat Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: Percent -> Integer #

floatDigits :: Percent -> Int #

floatRange :: Percent -> (Int, Int) #

decodeFloat :: Percent -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Percent #

exponent :: Percent -> Int #

significand :: Percent -> Percent #

scaleFloat :: Int -> Percent -> Percent #

isNaN :: Percent -> Bool #

isInfinite :: Percent -> Bool #

isDenormalized :: Percent -> Bool #

isNegativeZero :: Percent -> Bool #

isIEEE :: Percent -> Bool #

atan2 :: Percent -> Percent -> Percent #

RealFloat LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: LogValue -> Integer #

floatDigits :: LogValue -> Int #

floatRange :: LogValue -> (Int, Int) #

decodeFloat :: LogValue -> (Integer, Int) #

encodeFloat :: Integer -> Int -> LogValue #

exponent :: LogValue -> Int #

significand :: LogValue -> LogValue #

scaleFloat :: Int -> LogValue -> LogValue #

isNaN :: LogValue -> Bool #

isInfinite :: LogValue -> Bool #

isDenormalized :: LogValue -> Bool #

isNegativeZero :: LogValue -> Bool #

isIEEE :: LogValue -> Bool #

atan2 :: LogValue -> LogValue -> LogValue #

RealFloat CFloat 
Instance details

Defined in Foreign.C.Types

Methods

floatRadix :: CFloat -> Integer #

floatDigits :: CFloat -> Int #

floatRange :: CFloat -> (Int, Int) #

decodeFloat :: CFloat -> (Integer, Int) #

encodeFloat :: Integer -> Int -> CFloat #

exponent :: CFloat -> Int #

significand :: CFloat -> CFloat #

scaleFloat :: Int -> CFloat -> CFloat #

isNaN :: CFloat -> Bool #

isInfinite :: CFloat -> Bool #

isDenormalized :: CFloat -> Bool #

isNegativeZero :: CFloat -> Bool #

isIEEE :: CFloat -> Bool #

atan2 :: CFloat -> CFloat -> CFloat #

RealFloat CDouble 
Instance details

Defined in Foreign.C.Types

Methods

floatRadix :: CDouble -> Integer #

floatDigits :: CDouble -> Int #

floatRange :: CDouble -> (Int, Int) #

decodeFloat :: CDouble -> (Integer, Int) #

encodeFloat :: Integer -> Int -> CDouble #

exponent :: CDouble -> Int #

significand :: CDouble -> CDouble #

scaleFloat :: Int -> CDouble -> CDouble #

isNaN :: CDouble -> Bool #

isInfinite :: CDouble -> Bool #

isDenormalized :: CDouble -> Bool #

isNegativeZero :: CDouble -> Bool #

isIEEE :: CDouble -> Bool #

atan2 :: CDouble -> CDouble -> CDouble #

RealFloat a => RealFloat (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer #

floatDigits :: Identity a -> Int #

floatRange :: Identity a -> (Int, Int) #

decodeFloat :: Identity a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Identity a #

exponent :: Identity a -> Int #

significand :: Identity a -> Identity a #

scaleFloat :: Int -> Identity a -> Identity a #

isNaN :: Identity a -> Bool #

isInfinite :: Identity a -> Bool #

isDenormalized :: Identity a -> Bool #

isNegativeZero :: Identity a -> Bool #

isIEEE :: Identity a -> Bool #

atan2 :: Identity a -> Identity a -> Identity a #

RealFloat a => RealFloat (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

floatRadix :: Interval a -> Integer #

floatDigits :: Interval a -> Int #

floatRange :: Interval a -> (Int, Int) #

decodeFloat :: Interval a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Interval a #

exponent :: Interval a -> Int #

significand :: Interval a -> Interval a #

scaleFloat :: Int -> Interval a -> Interval a #

isNaN :: Interval a -> Bool #

isInfinite :: Interval a -> Bool #

isDenormalized :: Interval a -> Bool #

isNegativeZero :: Interval a -> Bool #

isIEEE :: Interval a -> Bool #

atan2 :: Interval a -> Interval a -> Interval a #

RealFloat a => RealFloat (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer #

floatDigits :: Const a b -> Int #

floatRange :: Const a b -> (Int, Int) #

decodeFloat :: Const a b -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Const a b #

exponent :: Const a b -> Int #

significand :: Const a b -> Const a b #

scaleFloat :: Int -> Const a b -> Const a b #

isNaN :: Const a b -> Bool #

isInfinite :: Const a b -> Bool #

isDenormalized :: Const a b -> Bool #

isNegativeZero :: Const a b -> Bool #

isIEEE :: Const a b -> Bool #

atan2 :: Const a b -> Const a b -> Const a b #

RealFloat a => RealFloat (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

floatRadix :: Tagged s a -> Integer #

floatDigits :: Tagged s a -> Int #

floatRange :: Tagged s a -> (Int, Int) #

decodeFloat :: Tagged s a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Tagged s a #

exponent :: Tagged s a -> Int #

significand :: Tagged s a -> Tagged s a #

scaleFloat :: Int -> Tagged s a -> Tagged s a #

isNaN :: Tagged s a -> Bool #

isInfinite :: Tagged s a -> Bool #

isDenormalized :: Tagged s a -> Bool #

isNegativeZero :: Tagged s a -> Bool #

isIEEE :: Tagged s a -> Bool #

atan2 :: Tagged s a -> Tagged s a -> Tagged s a #

class (Real a, Fractional a) => RealFrac a where #

Extracting components of fractions.

Minimal complete definition

properFraction

Methods

properFraction :: Integral b => a -> (b, a) #

The function properFraction takes a real fractional number x + can provide a more accurate implementation.

Instances
RealFloat Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Double -> Integer #

floatDigits :: Double -> Int #

floatRange :: Double -> (Int, Int) #

decodeFloat :: Double -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Double #

exponent :: Double -> Int #

significand :: Double -> Double #

scaleFloat :: Int -> Double -> Double #

isNaN :: Double -> Bool #

isInfinite :: Double -> Bool #

isDenormalized :: Double -> Bool #

isNegativeZero :: Double -> Bool #

isIEEE :: Double -> Bool #

atan2 :: Double -> Double -> Double #

RealFloat Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Float -> Integer #

floatDigits :: Float -> Int #

floatRange :: Float -> (Int, Int) #

decodeFloat :: Float -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Float #

exponent :: Float -> Int #

significand :: Float -> Float #

scaleFloat :: Int -> Float -> Float #

isNaN :: Float -> Bool #

isInfinite :: Float -> Bool #

isDenormalized :: Float -> Bool #

isNegativeZero :: Float -> Bool #

isIEEE :: Float -> Bool #

atan2 :: Float -> Float -> Float #

RealFloat CFloat 
Instance details

Defined in Foreign.C.Types

Methods

floatRadix :: CFloat -> Integer #

floatDigits :: CFloat -> Int #

floatRange :: CFloat -> (Int, Int) #

decodeFloat :: CFloat -> (Integer, Int) #

encodeFloat :: Integer -> Int -> CFloat #

exponent :: CFloat -> Int #

significand :: CFloat -> CFloat #

scaleFloat :: Int -> CFloat -> CFloat #

isNaN :: CFloat -> Bool #

isInfinite :: CFloat -> Bool #

isDenormalized :: CFloat -> Bool #

isNegativeZero :: CFloat -> Bool #

isIEEE :: CFloat -> Bool #

atan2 :: CFloat -> CFloat -> CFloat #

RealFloat CDouble 
Instance details

Defined in Foreign.C.Types

Methods

floatRadix :: CDouble -> Integer #

floatDigits :: CDouble -> Int #

floatRange :: CDouble -> (Int, Int) #

decodeFloat :: CDouble -> (Integer, Int) #

encodeFloat :: Integer -> Int -> CDouble #

exponent :: CDouble -> Int #

significand :: CDouble -> CDouble #

scaleFloat :: Int -> CDouble -> CDouble #

isNaN :: CDouble -> Bool #

isInfinite :: CDouble -> Bool #

isDenormalized :: CDouble -> Bool #

isNegativeZero :: CDouble -> Bool #

isIEEE :: CDouble -> Bool #

atan2 :: CDouble -> CDouble -> CDouble #

RealFloat LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: LogValue -> Integer #

floatDigits :: LogValue -> Int #

floatRange :: LogValue -> (Int, Int) #

decodeFloat :: LogValue -> (Integer, Int) #

encodeFloat :: Integer -> Int -> LogValue #

exponent :: LogValue -> Int #

significand :: LogValue -> LogValue #

scaleFloat :: Int -> LogValue -> LogValue #

isNaN :: LogValue -> Bool #

isInfinite :: LogValue -> Bool #

isDenormalized :: LogValue -> Bool #

isNegativeZero :: LogValue -> Bool #

isIEEE :: LogValue -> Bool #

atan2 :: LogValue -> LogValue -> LogValue #

RealFloat Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

floatRadix :: Percent -> Integer #

floatDigits :: Percent -> Int #

floatRange :: Percent -> (Int, Int) #

decodeFloat :: Percent -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Percent #

exponent :: Percent -> Int #

significand :: Percent -> Percent #

scaleFloat :: Int -> Percent -> Percent #

isNaN :: Percent -> Bool #

isInfinite :: Percent -> Bool #

isDenormalized :: Percent -> Bool #

isNegativeZero :: Percent -> Bool #

isIEEE :: Percent -> Bool #

atan2 :: Percent -> Percent -> Percent #

RealFloat a => RealFloat (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

floatRadix :: Identity a -> Integer #

floatDigits :: Identity a -> Int #

floatRange :: Identity a -> (Int, Int) #

decodeFloat :: Identity a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Identity a #

exponent :: Identity a -> Int #

significand :: Identity a -> Identity a #

scaleFloat :: Int -> Identity a -> Identity a #

isNaN :: Identity a -> Bool #

isInfinite :: Identity a -> Bool #

isDenormalized :: Identity a -> Bool #

isNegativeZero :: Identity a -> Bool #

isIEEE :: Identity a -> Bool #

atan2 :: Identity a -> Identity a -> Identity a #

RealFloat a => RealFloat (Interval a)

We have to play some semantic games to make these methods make sense. + Most compute with the midpoint of the interval.

Instance details

Defined in Numeric.Interval.Kaucher

Methods

floatRadix :: Interval a -> Integer #

floatDigits :: Interval a -> Int #

floatRange :: Interval a -> (Int, Int) #

decodeFloat :: Interval a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Interval a #

exponent :: Interval a -> Int #

significand :: Interval a -> Interval a #

scaleFloat :: Int -> Interval a -> Interval a #

isNaN :: Interval a -> Bool #

isInfinite :: Interval a -> Bool #

isDenormalized :: Interval a -> Bool #

isNegativeZero :: Interval a -> Bool #

isIEEE :: Interval a -> Bool #

atan2 :: Interval a -> Interval a -> Interval a #

RealFloat a => RealFloat (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

floatRadix :: Const a b -> Integer #

floatDigits :: Const a b -> Int #

floatRange :: Const a b -> (Int, Int) #

decodeFloat :: Const a b -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Const a b #

exponent :: Const a b -> Int #

significand :: Const a b -> Const a b #

scaleFloat :: Int -> Const a b -> Const a b #

isNaN :: Const a b -> Bool #

isInfinite :: Const a b -> Bool #

isDenormalized :: Const a b -> Bool #

isNegativeZero :: Const a b -> Bool #

isIEEE :: Const a b -> Bool #

atan2 :: Const a b -> Const a b -> Const a b #

RealFloat a => RealFloat (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

floatRadix :: Tagged s a -> Integer #

floatDigits :: Tagged s a -> Int #

floatRange :: Tagged s a -> (Int, Int) #

decodeFloat :: Tagged s a -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Tagged s a #

exponent :: Tagged s a -> Int #

significand :: Tagged s a -> Tagged s a #

scaleFloat :: Int -> Tagged s a -> Tagged s a #

isNaN :: Tagged s a -> Bool #

isInfinite :: Tagged s a -> Bool #

isDenormalized :: Tagged s a -> Bool #

isNegativeZero :: Tagged s a -> Bool #

isIEEE :: Tagged s a -> Bool #

atan2 :: Tagged s a -> Tagged s a -> Tagged s a #

class (Real a, Fractional a) => RealFrac a where #

Extracting components of fractions.

Minimal complete definition

properFraction

Methods

properFraction :: Integral b => a -> (b, a) #

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 #

truncate x returns the integer nearest x between zero and x

round :: Integral b => a -> b #

round x returns the nearest integer to x; - the even integer if x is equidistant between two integers

ceiling :: Integral b => a -> b #

ceiling x returns the least integer not less than x

floor :: Integral b => a -> b #

floor x returns the greatest integer not greater than x

Instances
RealFrac Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => Percent -> (b, Percent) #

truncate :: Integral b => Percent -> b #

round :: Integral b => Percent -> b #

ceiling :: Integral b => Percent -> b #

floor :: Integral b => Percent -> b #

RealFrac LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => LogValue -> (b, LogValue) #

truncate :: Integral b => LogValue -> b #

round :: Integral b => LogValue -> b #

ceiling :: Integral b => LogValue -> b #

floor :: Integral b => LogValue -> b #

RealFrac CFloat 
Instance details

Defined in Foreign.C.Types

Methods

properFraction :: Integral b => CFloat -> (b, CFloat) #

truncate :: Integral b => CFloat -> b #

round :: Integral b => CFloat -> b #

ceiling :: Integral b => CFloat -> b #

floor :: Integral b => CFloat -> b #

RealFrac CDouble 
Instance details

Defined in Foreign.C.Types

Methods

properFraction :: Integral b => CDouble -> (b, CDouble) #

truncate :: Integral b => CDouble -> b #

round :: Integral b => CDouble -> b #

ceiling :: Integral b => CDouble -> b #

floor :: Integral b => CDouble -> b #

RealFrac NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

properFraction :: Integral b => NominalDiffTime -> (b, NominalDiffTime) #

truncate :: Integral b => NominalDiffTime -> b #

round :: Integral b => NominalDiffTime -> b #

ceiling :: Integral b => NominalDiffTime -> b #

floor :: Integral b => NominalDiffTime -> b #

RealFrac DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

properFraction :: Integral b => DiffTime -> (b, DiffTime) #

truncate :: Integral b => DiffTime -> b #

round :: Integral b => DiffTime -> b #

ceiling :: Integral b => DiffTime -> b #

floor :: Integral b => DiffTime -> b #

RealFrac Scientific 
Instance details

Defined in Data.Scientific

Methods

properFraction :: Integral b => Scientific -> (b, Scientific) #

truncate :: Integral b => Scientific -> b #

round :: Integral b => Scientific -> b #

ceiling :: Integral b => Scientific -> b #

floor :: Integral b => Scientific -> b #

Integral a => RealFrac (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

properFraction :: Integral b => Ratio a -> (b, Ratio a) #

truncate :: Integral b => Ratio a -> b #

round :: Integral b => Ratio a -> b #

ceiling :: Integral b => Ratio a -> b #

floor :: Integral b => Ratio a -> b #

RealFrac a => RealFrac (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

properFraction :: Integral b => Identity a -> (b, Identity a) #

truncate :: Integral b => Identity a -> b #

round :: Integral b => Identity a -> b #

ceiling :: Integral b => Identity a -> b #

floor :: Integral b => Identity a -> b #

(Precise a, RealFloat a) => RealFrac (Log a) 
Instance details

Defined in Numeric.Log

Methods

properFraction :: Integral b => Log a -> (b, Log a) #

truncate :: Integral b => Log a -> b #

round :: Integral b => Log a -> b #

ceiling :: Integral b => Log a -> b #

floor :: Integral b => Log a -> b #

RealFrac n => RealFrac (Time n) 
Instance details

Defined in Data.Active

Methods

properFraction :: Integral b => Time n -> (b, Time n) #

truncate :: Integral b => Time n -> b #

round :: Integral b => Time n -> b #

ceiling :: Integral b => Time n -> b #

floor :: Integral b => Time n -> b #

RealFrac a => RealFrac (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

properFraction :: Integral b => Interval a -> (b, Interval a) #

truncate :: Integral b => Interval a -> b #

round :: Integral b => Interval a -> b #

ceiling :: Integral b => Interval a -> b #

floor :: Integral b => Interval a -> b #

RealFrac n => RealFrac (Duration n) 
Instance details

Defined in Data.Active

Methods

properFraction :: Integral b => Duration n -> (b, Duration n) #

truncate :: Integral b => Duration n -> b #

round :: Integral b => Duration n -> b #

ceiling :: Integral b => Duration n -> b #

floor :: Integral b => Duration n -> b #

RealFrac a => RealFrac (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

properFraction :: Integral b0 => Const a b -> (b0, Const a b) #

truncate :: Integral b0 => Const a b -> b0 #

round :: Integral b0 => Const a b -> b0 #

ceiling :: Integral b0 => Const a b -> b0 #

floor :: Integral b0 => Const a b -> b0 #

RealFrac a => RealFrac (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

properFraction :: Integral b => Tagged s a -> (b, Tagged s a) #

truncate :: Integral b => Tagged s a -> b #

round :: Integral b => Tagged s a -> b #

ceiling :: Integral b => Tagged s a -> b #

floor :: Integral b => Tagged s a -> b #

class Show a where #

Conversion of values to readable Strings.

Derived instances of Show have the following properties, which - are compatible with derived instances of Read:

  • The result of show is a syntactically correct Haskell + the even integer if x is equidistant between two integers

ceiling :: Integral b => a -> b #

ceiling x returns the least integer not less than x

floor :: Integral b => a -> b #

floor x returns the greatest integer not greater than x

Instances
RealFrac Scientific

WARNING: the methods of the RealFrac instance need to compute the + magnitude 10^e. If applied to a huge exponent this could take a long + time. Even worse, when the destination type is unbounded (i.e. Integer) it + could fill up all space and crash your program!

Instance details

Defined in Data.Scientific

Methods

properFraction :: Integral b => Scientific -> (b, Scientific) #

truncate :: Integral b => Scientific -> b #

round :: Integral b => Scientific -> b #

ceiling :: Integral b => Scientific -> b #

floor :: Integral b => Scientific -> b #

RealFrac CFloat 
Instance details

Defined in Foreign.C.Types

Methods

properFraction :: Integral b => CFloat -> (b, CFloat) #

truncate :: Integral b => CFloat -> b #

round :: Integral b => CFloat -> b #

ceiling :: Integral b => CFloat -> b #

floor :: Integral b => CFloat -> b #

RealFrac CDouble 
Instance details

Defined in Foreign.C.Types

Methods

properFraction :: Integral b => CDouble -> (b, CDouble) #

truncate :: Integral b => CDouble -> b #

round :: Integral b => CDouble -> b #

ceiling :: Integral b => CDouble -> b #

floor :: Integral b => CDouble -> b #

RealFrac NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

properFraction :: Integral b => NominalDiffTime -> (b, NominalDiffTime) #

truncate :: Integral b => NominalDiffTime -> b #

round :: Integral b => NominalDiffTime -> b #

ceiling :: Integral b => NominalDiffTime -> b #

floor :: Integral b => NominalDiffTime -> b #

RealFrac DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

properFraction :: Integral b => DiffTime -> (b, DiffTime) #

truncate :: Integral b => DiffTime -> b #

round :: Integral b => DiffTime -> b #

ceiling :: Integral b => DiffTime -> b #

floor :: Integral b => DiffTime -> b #

RealFrac ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

properFraction :: Integral b => ConstVal -> (b, ConstVal) #

truncate :: Integral b => ConstVal -> b #

round :: Integral b => ConstVal -> b #

ceiling :: Integral b => ConstVal -> b #

floor :: Integral b => ConstVal -> b #

RealFrac LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => LogValue -> (b, LogValue) #

truncate :: Integral b => LogValue -> b #

round :: Integral b => LogValue -> b #

ceiling :: Integral b => LogValue -> b #

floor :: Integral b => LogValue -> b #

RealFrac Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

properFraction :: Integral b => Percent -> (b, Percent) #

truncate :: Integral b => Percent -> b #

round :: Integral b => Percent -> b #

ceiling :: Integral b => Percent -> b #

floor :: Integral b => Percent -> b #

Integral a => RealFrac (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

properFraction :: Integral b => Ratio a -> (b, Ratio a) #

truncate :: Integral b => Ratio a -> b #

round :: Integral b => Ratio a -> b #

ceiling :: Integral b => Ratio a -> b #

floor :: Integral b => Ratio a -> b #

RealFrac a => RealFrac (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

properFraction :: Integral b => Identity a -> (b, Identity a) #

truncate :: Integral b => Identity a -> b #

round :: Integral b => Identity a -> b #

ceiling :: Integral b => Identity a -> b #

floor :: Integral b => Identity a -> b #

RealFrac a => RealFrac (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

properFraction :: Integral b => Interval a -> (b, Interval a) #

truncate :: Integral b => Interval a -> b #

round :: Integral b => Interval a -> b #

ceiling :: Integral b => Interval a -> b #

floor :: Integral b => Interval a -> b #

(Precise a, RealFloat a) => RealFrac (Log a) 
Instance details

Defined in Numeric.Log

Methods

properFraction :: Integral b => Log a -> (b, Log a) #

truncate :: Integral b => Log a -> b #

round :: Integral b => Log a -> b #

ceiling :: Integral b => Log a -> b #

floor :: Integral b => Log a -> b #

RealFrac n => RealFrac (Time n) 
Instance details

Defined in Data.Active

Methods

properFraction :: Integral b => Time n -> (b, Time n) #

truncate :: Integral b => Time n -> b #

round :: Integral b => Time n -> b #

ceiling :: Integral b => Time n -> b #

floor :: Integral b => Time n -> b #

RealFrac n => RealFrac (Duration n) 
Instance details

Defined in Data.Active

Methods

properFraction :: Integral b => Duration n -> (b, Duration n) #

truncate :: Integral b => Duration n -> b #

round :: Integral b => Duration n -> b #

ceiling :: Integral b => Duration n -> b #

floor :: Integral b => Duration n -> b #

RealFrac a => RealFrac (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

properFraction :: Integral b0 => Const a b -> (b0, Const a b) #

truncate :: Integral b0 => Const a b -> b0 #

round :: Integral b0 => Const a b -> b0 #

ceiling :: Integral b0 => Const a b -> b0 #

floor :: Integral b0 => Const a b -> b0 #

RealFrac a => RealFrac (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

properFraction :: Integral b => Tagged s a -> (b, Tagged s a) #

truncate :: Integral b => Tagged s a -> b #

round :: Integral b => Tagged s a -> b #

ceiling :: Integral b => Tagged s a -> b #

floor :: Integral b => Tagged s a -> b #

class Show a where #

Conversion of values to readable Strings.

Derived instances of Show have the following properties, which + are compatible with derived instances of Read:

  • The result of show is a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, @@ -218,27 +326,27 @@ where up_prec = 5

    Note that right-associativity of :^: is ignored. For example,

    • show (Leaf 1 :^: Leaf 2 :^: Leaf 3) produces the string "Leaf 1 :^: (Leaf 2 :^: Leaf 3)".

Minimal complete definition

showsPrec | show

Methods

showsPrec #

Arguments

:: Int

the operator precedence of the enclosing context (a number from 0 to 11). - Function application has precedence 10.

-> a

the value to be converted to a String

-> ShowS 

Convert a value to a readable String.

showsPrec should satisfy the law

showsPrec d x r ++ s  ==  showsPrec d x (r ++ s)

Derived instances of Read and Show satisfy the following:

That is, readsPrec parses the string produced by + Function application has precedence 10.

-> a

the value to be converted to a String

-> ShowS 

Convert a value to a readable String.

showsPrec should satisfy the law

showsPrec d x r ++ s  ==  showsPrec d x (r ++ s)

Derived instances of Read and Show satisfy the following:

That is, readsPrec parses the string produced by showsPrec, and delivers the value that showsPrec started with.

show :: a -> String #

A specialised variant of showsPrec, using precedence context zero, and returning an ordinary String.

showList :: [a] -> ShowS #

The method showList is provided to allow the programmer to give a specialised way of showing lists of values. For example, this is used by the predefined Show instance of the Char type, where values of type String should be shown - in double quotes, rather than between square brackets.

Instances
Show Bool 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Bool -> ShowS #

show :: Bool -> String #

showList :: [Bool] -> ShowS #

Show Char

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Char -> ShowS #

show :: Char -> String #

showList :: [Char] -> ShowS #

Show Int

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Int -> ShowS #

show :: Int -> String #

showList :: [Int] -> ShowS #

Show Int8

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

showsPrec :: Int -> Int8 -> ShowS #

show :: Int8 -> String #

showList :: [Int8] -> ShowS #

Show Int16

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

showsPrec :: Int -> Int16 -> ShowS #

show :: Int16 -> String #

showList :: [Int16] -> ShowS #

Show Int32

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

showsPrec :: Int -> Int32 -> ShowS #

show :: Int32 -> String #

showList :: [Int32] -> ShowS #

Show Int64

Since: base-2.1

Instance details

Defined in GHC.Int

Methods

showsPrec :: Int -> Int64 -> ShowS #

show :: Int64 -> String #

showList :: [Int64] -> ShowS #

Show Integer

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Integer -> ShowS #

show :: Integer -> String #

showList :: [Integer] -> ShowS #

Show Ordering 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Ordering -> ShowS #

show :: Ordering -> String #

showList :: [Ordering] -> ShowS #

Show Word

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Word -> ShowS #

show :: Word -> String #

showList :: [Word] -> ShowS #

Show Word8

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

showsPrec :: Int -> Word8 -> ShowS #

show :: Word8 -> String #

showList :: [Word8] -> ShowS #

Show Word16

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

showsPrec :: Int -> Word16 -> ShowS #

show :: Word16 -> String #

showList :: [Word16] -> ShowS #

Show Word32

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

showsPrec :: Int -> Word32 -> ShowS #

show :: Word32 -> String #

showList :: [Word32] -> ShowS #

Show Word64

Since: base-2.1

Instance details

Defined in GHC.Word

Methods

showsPrec :: Int -> Word64 -> ShowS #

show :: Word64 -> String #

showList :: [Word64] -> ShowS #

Show RuntimeRep 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> RuntimeRep -> ShowS #

show :: RuntimeRep -> String #

showList :: [RuntimeRep] -> ShowS #

Show VecCount 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> VecCount -> ShowS #

show :: VecCount -> String #

showList :: [VecCount] -> ShowS #

Show VecElem 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> VecElem -> ShowS #

show :: VecElem -> String #

showList :: [VecElem] -> ShowS #

Show CallStack

Since: base-4.9.0.0

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> CallStack -> ShowS #

show :: CallStack -> String #

showList :: [CallStack] -> ShowS #

Show SomeTypeRep

Since: base-4.10.0.0

Instance details

Defined in Data.Typeable.Internal

Methods

showsPrec :: Int -> SomeTypeRep -> ShowS #

show :: SomeTypeRep -> String #

showList :: [SomeTypeRep] -> ShowS #

Show Exp 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Exp -> ShowS #

show :: Exp -> String #

showList :: [Exp] -> ShowS #

Show Match 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Match -> ShowS #

show :: Match -> String #

showList :: [Match] -> ShowS #

Show Clause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Clause -> ShowS #

show :: Clause -> String #

showList :: [Clause] -> ShowS #

Show Pat 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Pat -> ShowS #

show :: Pat -> String #

showList :: [Pat] -> ShowS #

Show Type 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Type -> ShowS #

show :: Type -> String #

showList :: [Type] -> ShowS #

Show Dec 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Dec -> ShowS #

show :: Dec -> String #

showList :: [Dec] -> ShowS #

Show Name 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Name -> ShowS #

show :: Name -> String #

showList :: [Name] -> ShowS #

Show FunDep 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> FunDep -> ShowS #

show :: FunDep -> String #

showList :: [FunDep] -> ShowS #

Show InjectivityAnn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> InjectivityAnn -> ShowS #

show :: InjectivityAnn -> String #

showList :: [InjectivityAnn] -> ShowS #

Show Overlap 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Overlap -> ShowS #

show :: Overlap -> String #

showList :: [Overlap] -> ShowS #

Show DerivStrategy 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> DerivStrategy -> ShowS #

show :: DerivStrategy -> String #

showList :: [DerivStrategy] -> ShowS #

Show () 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> () -> ShowS #

show :: () -> String #

showList :: [()] -> ShowS #

Show TyCon

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> TyCon -> ShowS #

show :: TyCon -> String #

showList :: [TyCon] -> ShowS #

Show Module

Since: base-4.9.0.0

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Module -> ShowS #

show :: Module -> String #

showList :: [Module] -> ShowS #

Show TrName

Since: base-4.9.0.0

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> TrName -> ShowS #

show :: TrName -> String #

showList :: [TrName] -> ShowS #

Show KindRep 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> KindRep -> ShowS #

show :: KindRep -> String #

showList :: [KindRep] -> ShowS #

Show TypeLitSort 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> TypeLitSort -> ShowS #

show :: TypeLitSort -> String #

showList :: [TypeLitSort] -> ShowS #

Show DefName 
Instance details

Defined in Control.Lens.Internal.FieldTH

Methods

showsPrec :: Int -> DefName -> ShowS #

show :: DefName -> String #

showList :: [DefName] -> ShowS #

Show LocalTime 
Instance details

Defined in Data.Time.LocalTime.Internal.LocalTime

Methods

showsPrec :: Int -> LocalTime -> ShowS #

show :: LocalTime -> String #

showList :: [LocalTime] -> ShowS #

Show PlotBarsStyle 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsStyle -> ShowS #

show :: PlotBarsStyle -> String #

showList :: [PlotBarsStyle] -> ShowS #

Show PlotBarsSpacing 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsSpacing -> ShowS #

show :: PlotBarsSpacing -> String #

showList :: [PlotBarsSpacing] -> ShowS #

Show PlotBarsAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

showsPrec :: Int -> PlotBarsAlignment -> ShowS #

show :: PlotBarsAlignment -> String #

showList :: [PlotBarsAlignment] -> ShowS #

Show Percent 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> Percent -> ShowS #

show :: Percent -> String #

showList :: [Percent] -> ShowS #

Show LogValue 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Floating

Methods

showsPrec :: Int -> LogValue -> ShowS #

show :: LogValue -> String #

showList :: [LogValue] -> ShowS #

Show PlotIndex 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Indexed

Methods

showsPrec :: Int -> PlotIndex -> ShowS #

show :: PlotIndex -> String #

showList :: [PlotIndex] -> ShowS #

Show TimeLabelAlignment 
Instance details

Defined in Graphics.Rendering.Chart.Axis.Time

Methods

showsPrec :: Int -> TimeLabelAlignment -> ShowS #

show :: TimeLabelAlignment -> String #

showList :: [TimeLabelAlignment] -> ShowS #

Show LineCap 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineCap -> ShowS #

show :: LineCap -> String #

showList :: [LineCap] -> ShowS #

Show LineJoin 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineJoin -> ShowS #

show :: LineJoin -> String #

showList :: [LineJoin] -> ShowS #

Show LineStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> LineStyle -> ShowS #

show :: LineStyle -> String #

showList :: [LineStyle] -> ShowS #

Show FontSlant 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontSlant -> ShowS #

show :: FontSlant -> String #

showList :: [FontSlant] -> ShowS #

Show FontWeight 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontWeight -> ShowS #

show :: FontWeight -> String #

showList :: [FontWeight] -> ShowS #

Show FontStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FontStyle -> ShowS #

show :: FontStyle -> String #

showList :: [FontStyle] -> ShowS #

Show HTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> HTextAnchor -> ShowS #

show :: HTextAnchor -> String #

showList :: [HTextAnchor] -> ShowS #

Show VTextAnchor 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> VTextAnchor -> ShowS #

show :: VTextAnchor -> String #

showList :: [VTextAnchor] -> ShowS #

Show TextSize 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> TextSize -> ShowS #

show :: TextSize -> String #

showList :: [TextSize] -> ShowS #

Show FillStyle 
Instance details

Defined in Graphics.Rendering.Chart.Backend.Types

Methods

showsPrec :: Int -> FillStyle -> ShowS #

show :: FillStyle -> String #

showList :: [FillStyle] -> ShowS #

Show Point 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Point -> ShowS #

show :: Point -> String #

showList :: [Point] -> ShowS #

Show Vector 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Vector -> ShowS #

show :: Vector -> String #

showList :: [Vector] -> ShowS #

Show Rect 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Rect -> ShowS #

show :: Rect -> String #

showList :: [Rect] -> ShowS #

Show Matrix 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Matrix -> ShowS #

show :: Matrix -> String #

showList :: [Matrix] -> ShowS #

Show IOMode 
Instance details

Defined in GHC.IO.IOMode

Methods

showsPrec :: Int -> IOMode -> ShowS #

show :: IOMode -> String #

showList :: [IOMode] -> ShowS #

Show StdGen 
Instance details

Defined in System.Random

Methods

showsPrec :: Int -> StdGen -> ShowS #

show :: StdGen -> String #

showList :: [StdGen] -> ShowS #

Show Con 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Con -> ShowS #

show :: Con -> String #

showList :: [Con] -> ShowS #

Show ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

showsPrec :: Int -> ByteString -> ShowS #

show :: ByteString -> String #

showList :: [ByteString] -> ShowS #

Show ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

showsPrec :: Int -> ByteString -> ShowS #

show :: ByteString -> String #

showList :: [ByteString] -> ShowS #

Show Handle

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

showsPrec :: Int -> Handle -> ShowS #

show :: Handle -> String #

showList :: [Handle] -> ShowS #

Show HandleType

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle.Types

Methods

showsPrec :: Int -> HandleType -> ShowS #

show :: HandleType -> String #

showList :: [HandleType] -> ShowS #

Show Void

Since: base-4.8.0.0

Instance details

Defined in Data.Void

Methods

showsPrec :: Int -> Void -> ShowS #

show :: Void -> String #

showList :: [Void] -> ShowS #

Show Version 
Instance details

Defined in Data.Version

Methods

showsPrec :: Int -> Version -> ShowS #

show :: Version -> String #

showList :: [Version] -> ShowS #

Show HandlePosn

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Handle

Methods

showsPrec :: Int -> HandlePosn -> ShowS #

show :: HandlePosn -> String #

showList :: [HandlePosn] -> ShowS #

Show PatternMatchFail

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> PatternMatchFail -> ShowS #

show :: PatternMatchFail -> String #

showList :: [PatternMatchFail] -> ShowS #

Show RecSelError

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> RecSelError -> ShowS #

show :: RecSelError -> String #

showList :: [RecSelError] -> ShowS #

Show RecConError

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> RecConError -> ShowS #

show :: RecConError -> String #

showList :: [RecConError] -> ShowS #

Show RecUpdError

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> RecUpdError -> ShowS #

show :: RecUpdError -> String #

showList :: [RecUpdError] -> ShowS #

Show NoMethodError

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> NoMethodError -> ShowS #

show :: NoMethodError -> String #

showList :: [NoMethodError] -> ShowS #

Show TypeError

Since: base-4.9.0.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> TypeError -> ShowS #

show :: TypeError -> String #

showList :: [TypeError] -> ShowS #

Show NonTermination

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> NonTermination -> ShowS #

show :: NonTermination -> String #

showList :: [NonTermination] -> ShowS #

Show NestedAtomically

Since: base-4.0

Instance details

Defined in Control.Exception.Base

Methods

showsPrec :: Int -> NestedAtomically -> ShowS #

show :: NestedAtomically -> String #

showList :: [NestedAtomically] -> ShowS #

Show BlockedIndefinitelyOnMVar

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS #

show :: BlockedIndefinitelyOnMVar -> String #

showList :: [BlockedIndefinitelyOnMVar] -> ShowS #

Show BlockedIndefinitelyOnSTM

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS #

show :: BlockedIndefinitelyOnSTM -> String #

showList :: [BlockedIndefinitelyOnSTM] -> ShowS #

Show Deadlock

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> Deadlock -> ShowS #

show :: Deadlock -> String #

showList :: [Deadlock] -> ShowS #

Show AllocationLimitExceeded

Since: base-4.7.1.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> AllocationLimitExceeded -> ShowS #

show :: AllocationLimitExceeded -> String #

showList :: [AllocationLimitExceeded] -> ShowS #

Show CompactionFailed

Since: base-4.10.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> CompactionFailed -> ShowS #

show :: CompactionFailed -> String #

showList :: [CompactionFailed] -> ShowS #

Show AssertionFailed

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> AssertionFailed -> ShowS #

show :: AssertionFailed -> String #

showList :: [AssertionFailed] -> ShowS #

Show SomeAsyncException

Since: base-4.7.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> SomeAsyncException -> ShowS #

show :: SomeAsyncException -> String #

showList :: [SomeAsyncException] -> ShowS #

Show AsyncException

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> AsyncException -> ShowS #

show :: AsyncException -> String #

showList :: [AsyncException] -> ShowS #

Show ArrayException

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> ArrayException -> ShowS #

show :: ArrayException -> String #

showList :: [ArrayException] -> ShowS #

Show FixIOException

Since: base-4.11.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> FixIOException -> ShowS #

show :: FixIOException -> String #

showList :: [FixIOException] -> ShowS #

Show ExitCode 
Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> ExitCode -> ShowS #

show :: ExitCode -> String #

showList :: [ExitCode] -> ShowS #

Show IOErrorType

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> IOErrorType -> ShowS #

show :: IOErrorType -> String #

showList :: [IOErrorType] -> ShowS #

Show BufferMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

showsPrec :: Int -> BufferMode -> ShowS #

show :: BufferMode -> String #

showList :: [BufferMode] -> ShowS #

Show Newline 
Instance details

Defined in GHC.IO.Handle.Types

Methods

showsPrec :: Int -> Newline -> ShowS #

show :: Newline -> String #

showList :: [Newline] -> ShowS #

Show NewlineMode 
Instance details

Defined in GHC.IO.Handle.Types

Methods

showsPrec :: Int -> NewlineMode -> ShowS #

show :: NewlineMode -> String #

showList :: [NewlineMode] -> ShowS #

Show SeekMode 
Instance details

Defined in GHC.IO.Device

Methods

showsPrec :: Int -> SeekMode -> ShowS #

show :: SeekMode -> String #

showList :: [SeekMode] -> ShowS #

Show TextEncoding

Since: base-4.3.0.0

Instance details

Defined in GHC.IO.Encoding.Types

Methods

showsPrec :: Int -> TextEncoding -> ShowS #

show :: TextEncoding -> String #

showList :: [TextEncoding] -> ShowS #

Show CodingProgress 
Instance details

Defined in GHC.IO.Encoding.Types

Methods

showsPrec :: Int -> CodingProgress -> ShowS #

show :: CodingProgress -> String #

showList :: [CodingProgress] -> ShowS #

Show MaskingState 
Instance details

Defined in GHC.IO

Methods

showsPrec :: Int -> MaskingState -> ShowS #

show :: MaskingState -> String #

showList :: [MaskingState] -> ShowS #

Show IOException

Since: base-4.1.0.0

Instance details

Defined in GHC.IO.Exception

Methods

showsPrec :: Int -> IOException -> ShowS #

show :: IOException -> String #

showList :: [IOException] -> ShowS #

Show ErrorCall

Since: base-4.0.0.0

Instance details

Defined in GHC.Exception

Methods

showsPrec :: Int -> ErrorCall -> ShowS #

show :: ErrorCall -> String #

showList :: [ErrorCall] -> ShowS #

Show ArithException

Since: base-4.0.0.0

Instance details

Defined in GHC.Exception

Methods

showsPrec :: Int -> ArithException -> ShowS #

show :: ArithException -> String #

showList :: [ArithException] -> ShowS #

Show All 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> All -> ShowS #

show :: All -> String #

showList :: [All] -> ShowS #

Show Any 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Any -> ShowS #

show :: Any -> String #

showList :: [Any] -> ShowS #

Show Fixity 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> Fixity -> ShowS #

show :: Fixity -> String #

showList :: [Fixity] -> ShowS #

Show Associativity 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> Associativity -> ShowS #

show :: Associativity -> String #

showList :: [Associativity] -> ShowS #

Show SourceUnpackedness 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> SourceUnpackedness -> ShowS #

show :: SourceUnpackedness -> String #

showList :: [SourceUnpackedness] -> ShowS #

Show SourceStrictness 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> SourceStrictness -> ShowS #

show :: SourceStrictness -> String #

showList :: [SourceStrictness] -> ShowS #

Show DecidedStrictness 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> DecidedStrictness -> ShowS #

show :: DecidedStrictness -> String #

showList :: [DecidedStrictness] -> ShowS #

Show SomeNat

Since: base-4.7.0.0

Instance details

Defined in GHC.TypeNats

Methods

showsPrec :: Int -> SomeNat -> ShowS #

show :: SomeNat -> String #

showList :: [SomeNat] -> ShowS #

Show CChar 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CChar -> ShowS #

show :: CChar -> String #

showList :: [CChar] -> ShowS #

Show CSChar 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CSChar -> ShowS #

show :: CSChar -> String #

showList :: [CSChar] -> ShowS #

Show CUChar 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUChar -> ShowS #

show :: CUChar -> String #

showList :: [CUChar] -> ShowS #

Show CShort 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CShort -> ShowS #

show :: CShort -> String #

showList :: [CShort] -> ShowS #

Show CUShort 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUShort -> ShowS #

show :: CUShort -> String #

showList :: [CUShort] -> ShowS #

Show CInt 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CInt -> ShowS #

show :: CInt -> String #

showList :: [CInt] -> ShowS #

Show CUInt 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUInt -> ShowS #

show :: CUInt -> String #

showList :: [CUInt] -> ShowS #

Show CLong 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CLong -> ShowS #

show :: CLong -> String #

showList :: [CLong] -> ShowS #

Show CULong 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CULong -> ShowS #

show :: CULong -> String #

showList :: [CULong] -> ShowS #

Show CLLong 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CLLong -> ShowS #

show :: CLLong -> String #

showList :: [CLLong] -> ShowS #

Show CULLong 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CULLong -> ShowS #

show :: CULLong -> String #

showList :: [CULLong] -> ShowS #

Show CBool 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CBool -> ShowS #

show :: CBool -> String #

showList :: [CBool] -> ShowS #

Show CFloat 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CFloat -> ShowS #

show :: CFloat -> String #

showList :: [CFloat] -> ShowS #

Show CDouble 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CDouble -> ShowS #

show :: CDouble -> String #

showList :: [CDouble] -> ShowS #

Show CPtrdiff 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CPtrdiff -> ShowS #

show :: CPtrdiff -> String #

showList :: [CPtrdiff] -> ShowS #

Show CSize 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CSize -> ShowS #

show :: CSize -> String #

showList :: [CSize] -> ShowS #

Show CWchar 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CWchar -> ShowS #

show :: CWchar -> String #

showList :: [CWchar] -> ShowS #

Show CSigAtomic 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CSigAtomic -> ShowS #

show :: CSigAtomic -> String #

showList :: [CSigAtomic] -> ShowS #

Show CClock 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CClock -> ShowS #

show :: CClock -> String #

showList :: [CClock] -> ShowS #

Show CTime 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CTime -> ShowS #

show :: CTime -> String #

showList :: [CTime] -> ShowS #

Show CUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUSeconds -> ShowS #

show :: CUSeconds -> String #

showList :: [CUSeconds] -> ShowS #

Show CSUSeconds 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CSUSeconds -> ShowS #

show :: CSUSeconds -> String #

showList :: [CSUSeconds] -> ShowS #

Show CIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CIntPtr -> ShowS #

show :: CIntPtr -> String #

showList :: [CIntPtr] -> ShowS #

Show CUIntPtr 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUIntPtr -> ShowS #

show :: CUIntPtr -> String #

showList :: [CUIntPtr] -> ShowS #

Show CIntMax 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CIntMax -> ShowS #

show :: CIntMax -> String #

showList :: [CIntMax] -> ShowS #

Show CUIntMax 
Instance details

Defined in Foreign.C.Types

Methods

showsPrec :: Int -> CUIntMax -> ShowS #

show :: CUIntMax -> String #

showList :: [CUIntMax] -> ShowS #

Show Lexeme 
Instance details

Defined in Text.Read.Lex

Methods

showsPrec :: Int -> Lexeme -> ShowS #

show :: Lexeme -> String #

showList :: [Lexeme] -> ShowS #

Show Number 
Instance details

Defined in Text.Read.Lex

Methods

showsPrec :: Int -> Number -> ShowS #

show :: Number -> String #

showList :: [Number] -> ShowS #

Show GeneralCategory 
Instance details

Defined in GHC.Unicode

Methods

showsPrec :: Int -> GeneralCategory -> ShowS #

show :: GeneralCategory -> String #

showList :: [GeneralCategory] -> ShowS #

Show SomeException

Since: base-3.0

Instance details

Defined in GHC.Exception

Methods

showsPrec :: Int -> SomeException -> ShowS #

show :: SomeException -> String #

showList :: [SomeException] -> ShowS #

Show SrcLoc 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> SrcLoc -> ShowS #

show :: SrcLoc -> String #

showList :: [SrcLoc] -> ShowS #

Show ASCII7_Invalid 
Instance details

Defined in Basement.String.Encoding.ASCII7

Methods

showsPrec :: Int -> ASCII7_Invalid -> ShowS #

show :: ASCII7_Invalid -> String #

showList :: [ASCII7_Invalid] -> ShowS #

Show ISO_8859_1_Invalid 
Instance details

Defined in Basement.String.Encoding.ISO_8859_1

Methods

showsPrec :: Int -> ISO_8859_1_Invalid -> ShowS #

show :: ISO_8859_1_Invalid -> String #

showList :: [ISO_8859_1_Invalid] -> ShowS #

Show UTF16_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF16

Methods

showsPrec :: Int -> UTF16_Invalid -> ShowS #

show :: UTF16_Invalid -> String #

showList :: [UTF16_Invalid] -> ShowS #

Show UTF32_Invalid 
Instance details

Defined in Basement.String.Encoding.UTF32

Methods

showsPrec :: Int -> UTF32_Invalid -> ShowS #

show :: UTF32_Invalid -> String #

showList :: [UTF32_Invalid] -> ShowS #

Show Encoding 
Instance details

Defined in Basement.String

Methods

showsPrec :: Int -> Encoding -> ShowS #

show :: Encoding -> String #

showList :: [Encoding] -> ShowS #

Show String 
Instance details

Defined in Basement.UTF8.Base

Methods

showsPrec :: Int -> String -> ShowS #

show :: String -> String0 #

showList :: [String] -> ShowS #

Show FileSize 
Instance details

Defined in Basement.Types.OffsetSize

Methods

showsPrec :: Int -> FileSize -> ShowS #

show :: FileSize -> String #

showList :: [FileSize] -> ShowS #

Show IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

showsPrec :: Int -> IntSet -> ShowS #

show :: IntSet -> String #

showList :: [IntSet] -> ShowS #

Show XdgDirectory 
Instance details

Defined in System.Directory

Methods

showsPrec :: Int -> XdgDirectory -> ShowS #

show :: XdgDirectory -> String #

showList :: [XdgDirectory] -> ShowS #

Show FileType 
Instance details

Defined in System.Directory.Internal.Common

Methods

showsPrec :: Int -> FileType -> ShowS #

show :: FileType -> String #

showList :: [FileType] -> ShowS #

Show Permissions 
Instance details

Defined in System.Directory.Internal.Common

Methods

showsPrec :: Int -> Permissions -> ShowS #

show :: Permissions -> String #

showList :: [Permissions] -> ShowS #

Show StdStream 
Instance details

Defined in System.Process.Common

Methods

showsPrec :: Int -> StdStream -> ShowS #

show :: StdStream -> String #

showList :: [StdStream] -> ShowS #

Show CmdSpec 
Instance details

Defined in System.Process.Common

Methods

showsPrec :: Int -> CmdSpec -> ShowS #

show :: CmdSpec -> String #

showList :: [CmdSpec] -> ShowS #

Show CreateProcess 
Instance details

Defined in System.Process.Common

Methods

showsPrec :: Int -> CreateProcess -> ShowS #

show :: CreateProcess -> String #

showList :: [CreateProcess] -> ShowS #

Show Extension 
Instance details

Defined in GHC.LanguageExtensions.Type

Methods

showsPrec :: Int -> Extension -> ShowS #

show :: Extension -> String #

showList :: [Extension] -> ShowS #

Show ForeignSrcLang 
Instance details

Defined in GHC.ForeignSrcLang.Type

Methods

showsPrec :: Int -> ForeignSrcLang -> ShowS #

show :: ForeignSrcLang -> String #

showList :: [ForeignSrcLang] -> ShowS #

Show CSVField 
Instance details

Defined in Text.CSV.Lazy.ByteString

Methods

showsPrec :: Int -> CSVField -> ShowS #

show :: CSVField -> String #

showList :: [CSVField] -> ShowS #

Show CSVError 
Instance details

Defined in Text.CSV.Lazy.ByteString

Methods

showsPrec :: Int -> CSVError -> ShowS #

show :: CSVError -> String #

showList :: [CSVError] -> ShowS #

Show TyVarBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> TyVarBndr -> ShowS #

show :: TyVarBndr -> String #

showList :: [TyVarBndr] -> ShowS #

Show LabelPosition 
Instance details

Defined in Plots.Axis.Render

Methods

showsPrec :: Int -> LabelPosition -> ShowS #

show :: LabelPosition -> String #

showList :: [LabelPosition] -> ShowS #

Show Name 
Instance details

Defined in Diagrams.Core.Names

Methods

showsPrec :: Int -> Name -> ShowS #

show :: Name -> String #

showList :: [Name] -> ShowS #

Show TicksAlignment 
Instance details

Defined in Plots.Axis.Ticks

Methods

showsPrec :: Int -> TicksAlignment -> ShowS #

show :: TicksAlignment -> String #

showList :: [TicksAlignment] -> ShowS #

Show AxisLineType 
Instance details

Defined in Plots.Axis.Line

Methods

showsPrec :: Int -> AxisLineType -> ShowS #

show :: AxisLineType -> String #

showList :: [AxisLineType] -> ShowS #

Show Orientation 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Orientation -> ShowS #

show :: Orientation -> String #

showList :: [Orientation] -> ShowS #

Show Placement 
Instance details

Defined in Plots.Types

Methods

showsPrec :: Int -> Placement -> ShowS #

show :: Placement -> String #

showList :: [Placement] -> ShowS #

Show ColourMap 
Instance details

Defined in Plots.Style

Methods

showsPrec :: Int -> ColourMap -> ShowS #

show :: ColourMap -> String #

showList :: [ColourMap] -> ShowS #

Show ScaleMode 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> ScaleMode -> ShowS #

show :: ScaleMode -> String #

showList :: [ScaleMode] -> ShowS #

Show UniformScaleStrategy 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> UniformScaleStrategy -> ShowS #

show :: UniformScaleStrategy -> String #

showList :: [UniformScaleStrategy] -> ShowS #

Show LogScale 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> LogScale -> ShowS #

show :: LogScale -> String #

showList :: [LogScale] -> ShowS #

Show Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

showsPrec :: Int -> Doc -> ShowS #

show :: Doc -> String #

showList :: [Doc] -> ShowS #

Show TextDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> TextDetails -> ShowS #

show :: TextDetails -> String #

showList :: [TextDetails] -> ShowS #

Show Style 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> Style -> ShowS #

show :: Style -> String #

showList :: [Style] -> ShowS #

Show Mode 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> Mode -> ShowS #

show :: Mode -> String #

showList :: [Mode] -> ShowS #

Show ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

showsPrec :: Int -> ByteArray -> ShowS #

show :: ByteArray -> String #

showList :: [ByteArray] -> ShowS #

Show Root 
Instance details

Defined in Filesystem.Path.Internal

Methods

showsPrec :: Int -> Root -> ShowS #

show :: Root -> String #

showList :: [Root] -> ShowS #

Show ModName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> ModName -> ShowS #

show :: ModName -> String #

showList :: [ModName] -> ShowS #

Show PkgName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> PkgName -> ShowS #

show :: PkgName -> String #

showList :: [PkgName] -> ShowS #

Show Module 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Module -> ShowS #

show :: Module -> String #

showList :: [Module] -> ShowS #

Show OccName 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> OccName -> ShowS #

show :: OccName -> String #

showList :: [OccName] -> ShowS #

Show NameFlavour 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> NameFlavour -> ShowS #

show :: NameFlavour -> String #

showList :: [NameFlavour] -> ShowS #

Show NameSpace 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> NameSpace -> ShowS #

show :: NameSpace -> String #

showList :: [NameSpace] -> ShowS #

Show Loc 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Loc -> ShowS #

show :: Loc -> String #

showList :: [Loc] -> ShowS #

Show Info 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Info -> ShowS #

show :: Info -> String #

showList :: [Info] -> ShowS #

Show ModuleInfo 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> ModuleInfo -> ShowS #

show :: ModuleInfo -> String #

showList :: [ModuleInfo] -> ShowS #

Show Fixity 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Fixity -> ShowS #

show :: Fixity -> String #

showList :: [Fixity] -> ShowS #

Show FixityDirection 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> FixityDirection -> ShowS #

show :: FixityDirection -> String #

showList :: [FixityDirection] -> ShowS #

Show Lit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Lit -> ShowS #

show :: Lit -> String #

showList :: [Lit] -> ShowS #

Show Body 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Body -> ShowS #

show :: Body -> String #

showList :: [Body] -> ShowS #

Show Guard 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Guard -> ShowS #

show :: Guard -> String #

showList :: [Guard] -> ShowS #

Show Stmt 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Stmt -> ShowS #

show :: Stmt -> String #

showList :: [Stmt] -> ShowS #

Show Range 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Range -> ShowS #

show :: Range -> String #

showList :: [Range] -> ShowS #

Show DerivClause 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> DerivClause -> ShowS #

show :: DerivClause -> String #

showList :: [DerivClause] -> ShowS #

Show TypeFamilyHead 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> TypeFamilyHead -> ShowS #

show :: TypeFamilyHead -> String #

showList :: [TypeFamilyHead] -> ShowS #

Show TySynEqn 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> TySynEqn -> ShowS #

show :: TySynEqn -> String #

showList :: [TySynEqn] -> ShowS #

Show Foreign 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Foreign -> ShowS #

show :: Foreign -> String #

showList :: [Foreign] -> ShowS #

Show Callconv 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Callconv -> ShowS #

show :: Callconv -> String #

showList :: [Callconv] -> ShowS #

Show Safety 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Safety -> ShowS #

show :: Safety -> String #

showList :: [Safety] -> ShowS #

Show Pragma 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Pragma -> ShowS #

show :: Pragma -> String #

showList :: [Pragma] -> ShowS #

Show Inline 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Inline -> ShowS #

show :: Inline -> String #

showList :: [Inline] -> ShowS #

Show RuleMatch 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> RuleMatch -> ShowS #

show :: RuleMatch -> String #

showList :: [RuleMatch] -> ShowS #

Show Phases 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Phases -> ShowS #

show :: Phases -> String #

showList :: [Phases] -> ShowS #

Show RuleBndr 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> RuleBndr -> ShowS #

show :: RuleBndr -> String #

showList :: [RuleBndr] -> ShowS #

Show AnnTarget 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> AnnTarget -> ShowS #

show :: AnnTarget -> String #

showList :: [AnnTarget] -> ShowS #

Show SourceUnpackedness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> SourceUnpackedness -> ShowS #

show :: SourceUnpackedness -> String #

showList :: [SourceUnpackedness] -> ShowS #

Show SourceStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> SourceStrictness -> ShowS #

show :: SourceStrictness -> String #

showList :: [SourceStrictness] -> ShowS #

Show DecidedStrictness 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> DecidedStrictness -> ShowS #

show :: DecidedStrictness -> String #

showList :: [DecidedStrictness] -> ShowS #

Show Bang 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Bang -> ShowS #

show :: Bang -> String #

showList :: [Bang] -> ShowS #

Show PatSynDir 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> PatSynDir -> ShowS #

show :: PatSynDir -> String #

showList :: [PatSynDir] -> ShowS #

Show PatSynArgs 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> PatSynArgs -> ShowS #

show :: PatSynArgs -> String #

showList :: [PatSynArgs] -> ShowS #

Show FamilyResultSig 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> FamilyResultSig -> ShowS #

show :: FamilyResultSig -> String #

showList :: [FamilyResultSig] -> ShowS #

Show TyLit 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> TyLit -> ShowS #

show :: TyLit -> String #

showList :: [TyLit] -> ShowS #

Show Role 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> Role -> ShowS #

show :: Role -> String #

showList :: [Role] -> ShowS #

Show AnnLookup 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

showsPrec :: Int -> AnnLookup -> ShowS #

show :: AnnLookup -> String #

showList :: [AnnLookup] -> ShowS #

Show DatatypeInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> DatatypeInfo -> ShowS #

show :: DatatypeInfo -> String #

showList :: [DatatypeInfo] -> ShowS #

Show DatatypeVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> DatatypeVariant -> ShowS #

show :: DatatypeVariant -> String #

showList :: [DatatypeVariant] -> ShowS #

Show ConstructorInfo 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> ConstructorInfo -> ShowS #

show :: ConstructorInfo -> String #

showList :: [ConstructorInfo] -> ShowS #

Show ConstructorVariant 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> ConstructorVariant -> ShowS #

show :: ConstructorVariant -> String #

showList :: [ConstructorVariant] -> ShowS #

Show FieldStrictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> FieldStrictness -> ShowS #

show :: FieldStrictness -> String #

showList :: [FieldStrictness] -> ShowS #

Show Unpackedness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> Unpackedness -> ShowS #

show :: Unpackedness -> String #

showList :: [Unpackedness] -> ShowS #

Show Strictness 
Instance details

Defined in Language.Haskell.TH.Datatype

Methods

showsPrec :: Int -> Strictness -> ShowS #

show :: Strictness -> String #

showList :: [Strictness] -> ShowS #

Show ZonedTime 
Instance details

Defined in Data.Time.LocalTime.Internal.ZonedTime

Methods

showsPrec :: Int -> ZonedTime -> ShowS #

show :: ZonedTime -> String #

showList :: [ZonedTime] -> ShowS #

Show TimeOfDay 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeOfDay

Methods

showsPrec :: Int -> TimeOfDay -> ShowS #

show :: TimeOfDay -> String #

showList :: [TimeOfDay] -> ShowS #

Show TimeZone 
Instance details

Defined in Data.Time.LocalTime.Internal.TimeZone

Methods

showsPrec :: Int -> TimeZone -> ShowS #

show :: TimeZone -> String #

showList :: [TimeZone] -> ShowS #

Show NominalDiffTime 
Instance details

Defined in Data.Time.Clock.Internal.NominalDiffTime

Methods

showsPrec :: Int -> NominalDiffTime -> ShowS #

show :: NominalDiffTime -> String #

showList :: [NominalDiffTime] -> ShowS #

Show DiffTime 
Instance details

Defined in Data.Time.Clock.Internal.DiffTime

Methods

showsPrec :: Int -> DiffTime -> ShowS #

show :: DiffTime -> String #

showList :: [DiffTime] -> ShowS #

Show Extractor 
Instance details

Defined in Internal.Element

Methods

showsPrec :: Int -> Extractor -> ShowS #

show :: Extractor -> String #

showList :: [Extractor] -> ShowS #

Show DateFormatSpec 
Instance details

Defined in Data.Time.Format.Parse

Methods

showsPrec :: Int -> DateFormatSpec -> ShowS #

show :: DateFormatSpec -> String #

showList :: [DateFormatSpec] -> ShowS #

Show Padding 
Instance details

Defined in Data.Time.Format.Parse

Methods

showsPrec :: Int -> Padding -> ShowS #

show :: Padding -> String #

showList :: [Padding] -> ShowS #

Show MatrixOrder 
Instance details

Defined in Internal.Matrix

Methods

showsPrec :: Int -> MatrixOrder -> ShowS #

show :: MatrixOrder -> String #

showList :: [MatrixOrder] -> ShowS #

Show Seed 
Instance details

Defined in System.Random.MWC

Methods

showsPrec :: Int -> Seed -> ShowS #

show :: Seed -> String #

showList :: [Seed] -> ShowS #

Show Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

showsPrec :: Int -> Cairo -> ShowS #

show :: Cairo -> String #

showList :: [Cairo] -> ShowS #

Show OutputType 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

showsPrec :: Int -> OutputType -> ShowS #

show :: OutputType -> String #

showList :: [OutputType] -> ShowS #

Show AName 
Instance details

Defined in Diagrams.Core.Names

Methods

showsPrec :: Int -> AName -> ShowS #

show :: AName -> String #

showList :: [AName] -> ShowS #

Show FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

showsPrec :: Int -> FillRule -> ShowS #

show :: FillRule -> String #

showList :: [FillRule] -> ShowS #

Show Points 
Instance details

Defined in Statistics.Sample.KernelDensity.Simple

Methods

showsPrec :: Int -> Points -> ShowS #

show :: Points -> String #

showList :: [Points] -> ShowS #

Show Options 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> Options -> ShowS #

show :: Options -> String #

showList :: [Options] -> ShowS #

Show Value 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> Value -> ShowS #

show :: Value -> String #

showList :: [Value] -> ShowS #

Show JSONPathElement 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> JSONPathElement -> ShowS #

show :: JSONPathElement -> String #

showList :: [JSONPathElement] -> ShowS #

Show Scientific 
Instance details

Defined in Data.Scientific

Methods

showsPrec :: Int -> Scientific -> ShowS #

show :: Scientific -> String #

showList :: [Scientific] -> ShowS #

Show KBNSum 
Instance details

Defined in Numeric.Sum

Methods

showsPrec :: Int -> KBNSum -> ShowS #

show :: KBNSum -> String #

showList :: [KBNSum] -> ShowS #

Show EventVarietyMismatchException 
Instance details

Defined in System.FSNotify.Linux

Methods

showsPrec :: Int -> EventVarietyMismatchException -> ShowS #

show :: EventVarietyMismatchException -> String #

showList :: [EventVarietyMismatchException] -> ShowS #

Show Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

showsPrec :: Int -> Crossings -> ShowS #

show :: Crossings -> String #

showList :: [Crossings] -> ShowS #

Show Annotation 
Instance details

Defined in Diagrams.Core.Types

Methods

showsPrec :: Int -> Annotation -> ShowS #

show :: Annotation -> String #

showList :: [Annotation] -> ShowS #

Show More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

showsPrec :: Int -> More -> ShowS #

show :: More -> String #

showList :: [More] -> ShowS #

Show Pos 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

showsPrec :: Int -> Pos -> ShowS #

show :: Pos -> String #

showList :: [Pos] -> ShowS #

Show DiagramAnimOpts 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

showsPrec :: Int -> DiagramAnimOpts -> ShowS #

show :: DiagramAnimOpts -> String #

showList :: [DiagramAnimOpts] -> ShowS #

Show DiagramMultiOpts 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

showsPrec :: Int -> DiagramMultiOpts -> ShowS #

show :: DiagramMultiOpts -> String #

showList :: [DiagramMultiOpts] -> ShowS #

Show DiagramOpts 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

showsPrec :: Int -> DiagramOpts -> ShowS #

show :: DiagramOpts -> String #

showList :: [DiagramOpts] -> ShowS #

Show FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

showsPrec :: Int -> FontSlant -> ShowS #

show :: FontSlant -> String #

showList :: [FontSlant] -> ShowS #

Show FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

showsPrec :: Int -> FontWeight -> ShowS #

show :: FontWeight -> String #

showList :: [FontWeight] -> ShowS #

Show PixelRGBA8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelRGBA8 -> ShowS #

show :: PixelRGBA8 -> String #

showList :: [PixelRGBA8] -> ShowS #

Show PixelRGB8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelRGB8 -> ShowS #

show :: PixelRGB8 -> String #

showList :: [PixelRGB8] -> ShowS #

Show EmptyFilePathError 
Instance details

Defined in Shelly.Base

Methods

showsPrec :: Int -> EmptyFilePathError -> ShowS #

show :: EmptyFilePathError -> String #

showList :: [EmptyFilePathError] -> ShowS #

Show PixelCMYK16 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelCMYK16 -> ShowS #

show :: PixelCMYK16 -> String #

showList :: [PixelCMYK16] -> ShowS #

Show PixelCMYK8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelCMYK8 -> ShowS #

show :: PixelCMYK8 -> String #

showList :: [PixelCMYK8] -> ShowS #

Show PixelRGB16 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelRGB16 -> ShowS #

show :: PixelRGB16 -> String #

showList :: [PixelRGB16] -> ShowS #

Show PixelRGBA16 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelRGBA16 -> ShowS #

show :: PixelRGBA16 -> String #

showList :: [PixelRGBA16] -> ShowS #

Show PixelYA16 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelYA16 -> ShowS #

show :: PixelYA16 -> String #

showList :: [PixelYA16] -> ShowS #

Show PixelYA8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelYA8 -> ShowS #

show :: PixelYA8 -> String #

showList :: [PixelYA8] -> ShowS #

Show PixelYCbCr8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelYCbCr8 -> ShowS #

show :: PixelYCbCr8 -> String #

showList :: [PixelYCbCr8] -> ShowS #

Show PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelRGBF -> ShowS #

show :: PixelRGBF -> String #

showList :: [PixelRGBF] -> ShowS #

Show PixelYCbCrK8 
Instance details

Defined in Codec.Picture.Types

Methods

showsPrec :: Int -> PixelYCbCrK8 -> ShowS #

show :: PixelYCbCrK8 -> String #

showList :: [PixelYCbCrK8] -> ShowS #

Show LinePass 
Instance details

Defined in Linear.Plucker

Methods

showsPrec :: Int -> LinePass -> ShowS #

show :: LinePass -> String #

showList :: [LinePass] -> ShowS #

Show CompressionLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> CompressionLevel -> ShowS #

show :: CompressionLevel -> String #

showList :: [CompressionLevel] -> ShowS #

Show CompressionStrategy 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> CompressionStrategy -> ShowS #

show :: CompressionStrategy -> String #

showList :: [CompressionStrategy] -> ShowS #

Show DictionaryHash 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> DictionaryHash -> ShowS #

show :: DictionaryHash -> String #

showList :: [DictionaryHash] -> ShowS #

Show Format 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> Format -> ShowS #

show :: Format -> String #

showList :: [Format] -> ShowS #

Show MemoryLevel 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> MemoryLevel -> ShowS #

show :: MemoryLevel -> String #

showList :: [MemoryLevel] -> ShowS #

Show Method 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> Method -> ShowS #

show :: Method -> String #

showList :: [Method] -> ShowS #

Show WindowBits 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

showsPrec :: Int -> WindowBits -> ShowS #

show :: WindowBits -> String #

showList :: [WindowBits] -> ShowS #

Show DotNetTime 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> DotNetTime -> ShowS #

show :: DotNetTime -> String #

showList :: [DotNetTime] -> ShowS #

Show SumEncoding 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> SumEncoding -> ShowS #

show :: SumEncoding -> String #

showList :: [SumEncoding] -> ShowS #

Show KB2Sum 
Instance details

Defined in Numeric.Sum

Methods

showsPrec :: Int -> KB2Sum -> ShowS #

show :: KB2Sum -> String #

showList :: [KB2Sum] -> ShowS #

Show KahanSum 
Instance details

Defined in Numeric.Sum

Methods

showsPrec :: Int -> KahanSum -> ShowS #

show :: KahanSum -> String #

showList :: [KahanSum] -> ShowS #

Show UUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

showsPrec :: Int -> UUID -> ShowS #

show :: UUID -> String #

showList :: [UUID] -> ShowS #

Show UnpackedUUID 
Instance details

Defined in Data.UUID.Types.Internal

Methods

showsPrec :: Int -> UnpackedUUID -> ShowS #

show :: UnpackedUUID -> String #

showList :: [UnpackedUUID] -> ShowS #

Show LogFloat 
Instance details

Defined in Data.Number.LogFloat

Methods

showsPrec :: Int -> LogFloat -> ShowS #

show :: LogFloat -> String #

showList :: [LogFloat] -> ShowS #

Show ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

showsPrec :: Int -> ConstVal -> ShowS #

show :: ConstVal -> String #

showList :: [ConstVal] -> ShowS #

Show CSVState 
Instance details

Defined in Text.CSV.Lazy.ByteString

Methods

showsPrec :: Int -> CSVState -> ShowS #

show :: CSVState -> String #

showList :: [CSVState] -> ShowS #

Show BimapException 
Instance details

Defined in Data.Bimap

Methods

showsPrec :: Int -> BimapException -> ShowS #

show :: BimapException -> String #

showList :: [BimapException] -> ShowS #

Show Color 
Instance details

Defined in Data.List.Extra

Methods

showsPrec :: Int -> Color -> ShowS #

show :: Color -> String #

showList :: [Color] -> ShowS #

Show Type # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Type -> ShowS #

show :: Type -> String #

showList :: [Type] -> ShowS #

Show EEnv # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> EEnv -> ShowS #

show :: EEnv -> String #

showList :: [EEnv] -> ShowS #

Show LVal # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> LVal -> ShowS #

show :: LVal -> String #

showList :: [LVal] -> ShowS #

Show DExpr # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> DExpr -> ShowS #

show :: DExpr -> String #

showList :: [DExpr] -> ShowS #

Show NodeRef # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> NodeRef -> ShowS #

show :: NodeRef -> String #

showList :: [NodeRef] -> ShowS #

Show Id # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> Id -> ShowS #

show :: Id -> String #

showList :: [Id] -> ShowS #

Show SHA1 
Instance details

Defined in Crypto.Hash.SHA1

Methods

showsPrec :: Int -> SHA1 -> ShowS #

show :: SHA1 -> String #

showList :: [SHA1] -> ShowS #

Show Blake2b_160 
Instance details

Defined in Crypto.Hash.Blake2b

Methods

showsPrec :: Int -> Blake2b_160 -> ShowS #

show :: Blake2b_160 -> String #

showList :: [Blake2b_160] -> ShowS #

Show Blake2b_224 
Instance details

Defined in Crypto.Hash.Blake2b

Methods

showsPrec :: Int -> Blake2b_224 -> ShowS #

show :: Blake2b_224 -> String #

showList :: [Blake2b_224] -> ShowS #

Show Blake2b_256 
Instance details

Defined in Crypto.Hash.Blake2b

Methods

showsPrec :: Int -> Blake2b_256 -> ShowS #

show :: Blake2b_256 -> String #

showList :: [Blake2b_256] -> ShowS #

Show Blake2b_384 
Instance details

Defined in Crypto.Hash.Blake2b

Methods

showsPrec :: Int -> Blake2b_384 -> ShowS #

show :: Blake2b_384 -> String #

showList :: [Blake2b_384] -> ShowS #

Show Blake2b_512 
Instance details

Defined in Crypto.Hash.Blake2b

Methods

showsPrec :: Int -> Blake2b_512 -> ShowS #

show :: Blake2b_512 -> String #

showList :: [Blake2b_512] -> ShowS #

Show Blake2bp_512 
Instance details

Defined in Crypto.Hash.Blake2bp

Methods

showsPrec :: Int -> Blake2bp_512 -> ShowS #

show :: Blake2bp_512 -> String #

showList :: [Blake2bp_512] -> ShowS #

Show Blake2s_160 
Instance details

Defined in Crypto.Hash.Blake2s

Methods

showsPrec :: Int -> Blake2s_160 -> ShowS #

show :: Blake2s_160 -> String #

showList :: [Blake2s_160] -> ShowS #

Show Blake2s_224 
Instance details

Defined in Crypto.Hash.Blake2s

Methods

showsPrec :: Int -> Blake2s_224 -> ShowS #

show :: Blake2s_224 -> String #

showList :: [Blake2s_224] -> ShowS #

Show Blake2s_256 
Instance details

Defined in Crypto.Hash.Blake2s

Methods

showsPrec :: Int -> Blake2s_256 -> ShowS #

show :: Blake2s_256 -> String #

showList :: [Blake2s_256] -> ShowS #

Show Blake2sp_224 
Instance details

Defined in Crypto.Hash.Blake2sp

Methods

showsPrec :: Int -> Blake2sp_224 -> ShowS #

show :: Blake2sp_224 -> String #

showList :: [Blake2sp_224] -> ShowS #

Show Blake2sp_256 
Instance details

Defined in Crypto.Hash.Blake2sp

Methods

showsPrec :: Int -> Blake2sp_256 -> ShowS #

show :: Blake2sp_256 -> String #

showList :: [Blake2sp_256] -> ShowS #

Show Keccak_224 
Instance details

Defined in Crypto.Hash.Keccak

Methods

showsPrec :: Int -> Keccak_224 -> ShowS #

show :: Keccak_224 -> String #

showList :: [Keccak_224] -> ShowS #

Show Keccak_256 
Instance details

Defined in Crypto.Hash.Keccak

Methods

showsPrec :: Int -> Keccak_256 -> ShowS #

show :: Keccak_256 -> String #

showList :: [Keccak_256] -> ShowS #

Show Keccak_384 
Instance details

Defined in Crypto.Hash.Keccak

Methods

showsPrec :: Int -> Keccak_384 -> ShowS #

show :: Keccak_384 -> String #

showList :: [Keccak_384] -> ShowS #

Show Keccak_512 
Instance details

Defined in Crypto.Hash.Keccak

Methods

showsPrec :: Int -> Keccak_512 -> ShowS #

show :: Keccak_512 -> String #

showList :: [Keccak_512] -> ShowS #

Show MD2 
Instance details

Defined in Crypto.Hash.MD2

Methods

showsPrec :: Int -> MD2 -> ShowS #

show :: MD2 -> String #

showList :: [MD2] -> ShowS #

Show MD4 
Instance details

Defined in Crypto.Hash.MD4

Methods

showsPrec :: Int -> MD4 -> ShowS #

show :: MD4 -> String #

showList :: [MD4] -> ShowS #

Show MD5 
Instance details

Defined in Crypto.Hash.MD5

Methods

showsPrec :: Int -> MD5 -> ShowS #

show :: MD5 -> String #

showList :: [MD5] -> ShowS #

Show RIPEMD160 
Instance details

Defined in Crypto.Hash.RIPEMD160

Methods

showsPrec :: Int -> RIPEMD160 -> ShowS #

show :: RIPEMD160 -> String #

showList :: [RIPEMD160] -> ShowS #

Show SHA224 
Instance details

Defined in Crypto.Hash.SHA224

Methods

showsPrec :: Int -> SHA224 -> ShowS #

show :: SHA224 -> String #

showList :: [SHA224] -> ShowS #

Show SHA256 
Instance details

Defined in Crypto.Hash.SHA256

Methods

showsPrec :: Int -> SHA256 -> ShowS #

show :: SHA256 -> String #

showList :: [SHA256] -> ShowS #

Show SHA3_224 
Instance details

Defined in Crypto.Hash.SHA3

Methods

showsPrec :: Int -> SHA3_224 -> ShowS #

show :: SHA3_224 -> String #

showList :: [SHA3_224] -> ShowS #

Show SHA3_256 
Instance details

Defined in Crypto.Hash.SHA3

Methods

showsPrec :: Int -> SHA3_256 -> ShowS #

show :: SHA3_256 -> String #

showList :: [SHA3_256] -> ShowS #

Show SHA3_384 
Instance details

Defined in Crypto.Hash.SHA3

Methods

showsPrec :: Int -> SHA3_384 -> ShowS #

show :: SHA3_384 -> String #

showList :: [SHA3_384] -> ShowS #

Show SHA3_512 
Instance details

Defined in Crypto.Hash.SHA3

Methods

showsPrec :: Int -> SHA3_512 -> ShowS #

show :: SHA3_512 -> String #

showList :: [SHA3_512] -> ShowS #

Show SHA384 
Instance details

Defined in Crypto.Hash.SHA384

Methods

showsPrec :: Int -> SHA384 -> ShowS #

show :: SHA384 -> String #

showList :: [SHA384] -> ShowS #

Show SHA512 
Instance details

Defined in Crypto.Hash.SHA512

Methods

showsPrec :: Int -> SHA512 -> ShowS #

show :: SHA512 -> String #

showList :: [SHA512] -> ShowS #

Show SHA512t_224 
Instance details

Defined in Crypto.Hash.SHA512t

Methods

showsPrec :: Int -> SHA512t_224 -> ShowS #

show :: SHA512t_224 -> String #

showList :: [SHA512t_224] -> ShowS #

Show SHA512t_256 
Instance details

Defined in Crypto.Hash.SHA512t

Methods

showsPrec :: Int -> SHA512t_256 -> ShowS #

show :: SHA512t_256 -> String #

showList :: [SHA512t_256] -> ShowS #

Show Skein256_224 
Instance details

Defined in Crypto.Hash.Skein256

Methods

showsPrec :: Int -> Skein256_224 -> ShowS #

show :: Skein256_224 -> String #

showList :: [Skein256_224] -> ShowS #

Show Skein256_256 
Instance details

Defined in Crypto.Hash.Skein256

Methods

showsPrec :: Int -> Skein256_256 -> ShowS #

show :: Skein256_256 -> String #

showList :: [Skein256_256] -> ShowS #

Show Skein512_224 
Instance details

Defined in Crypto.Hash.Skein512

Methods

showsPrec :: Int -> Skein512_224 -> ShowS #

show :: Skein512_224 -> String #

showList :: [Skein512_224] -> ShowS #

Show Skein512_256 
Instance details

Defined in Crypto.Hash.Skein512

Methods

showsPrec :: Int -> Skein512_256 -> ShowS #

show :: Skein512_256 -> String #

showList :: [Skein512_256] -> ShowS #

Show Skein512_384 
Instance details

Defined in Crypto.Hash.Skein512

Methods

showsPrec :: Int -> Skein512_384 -> ShowS #

show :: Skein512_384 -> String #

showList :: [Skein512_384] -> ShowS #

Show Skein512_512 
Instance details

Defined in Crypto.Hash.Skein512

Methods

showsPrec :: Int -> Skein512_512 -> ShowS #

show :: Skein512_512 -> String #

showList :: [Skein512_512] -> ShowS #

Show Tiger 
Instance details

Defined in Crypto.Hash.Tiger

Methods

showsPrec :: Int -> Tiger -> ShowS #

show :: Tiger -> String #

showList :: [Tiger] -> ShowS #

Show Whirlpool 
Instance details

Defined in Crypto.Hash.Whirlpool

Methods

showsPrec :: Int -> Whirlpool -> ShowS #

show :: Whirlpool -> String #

showList :: [Whirlpool] -> ShowS #

Show StanHMCMetric # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCMetric -> ShowS #

show :: StanHMCMetric -> String #

showList :: [StanHMCMetric] -> ShowS #

Show StanHMCEngine # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanHMCEngine -> ShowS #

show :: StanHMCEngine -> String #

showList :: [StanHMCEngine] -> ShowS #

Show StanMethod # 
Instance details

Defined in Language.Stan

Methods

showsPrec :: Int -> StanMethod -> ShowS #

show :: StanMethod -> String #

showList :: [StanMethod] -> ShowS #

Show PyMC3Step # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Step -> ShowS #

show :: PyMC3Step -> String #

showList :: [PyMC3Step] -> ShowS #

Show PyMC3Inference # 
Instance details

Defined in Language.PyMC3

Methods

showsPrec :: Int -> PyMC3Inference -> ShowS #

show :: PyMC3Inference -> String #

showList :: [PyMC3Inference] -> ShowS #

Show a => Show [a]

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> [a] -> ShowS #

show :: [a] -> String #

showList :: [[a]] -> ShowS #

Show a => Show (Maybe a) 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Maybe a -> ShowS #

show :: Maybe a -> String #

showList :: [Maybe a] -> ShowS #

Show a => Show (Ratio a)

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

showsPrec :: Int -> Ratio a -> ShowS #

show :: Ratio a -> String #

showList :: [Ratio a] -> ShowS #

Show (Ptr a)

Since: base-2.1

Instance details

Defined in GHC.Ptr

Methods

showsPrec :: Int -> Ptr a -> ShowS #

show :: Ptr a -> String #

showList :: [Ptr a] -> ShowS #

Show (FunPtr a)

Since: base-2.1

Instance details

Defined in GHC.Ptr

Methods

showsPrec :: Int -> FunPtr a -> ShowS #

show :: FunPtr a -> String #

showList :: [FunPtr a] -> ShowS #

Show p => Show (Par1 p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> Par1 p -> ShowS #

show :: Par1 p -> String #

showList :: [Par1 p] -> ShowS #

Show a => Show (Identity a)

This instance would be equivalent to the derived instances of the - Identity newtype if the runIdentity field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

showsPrec :: Int -> Identity a -> ShowS #

show :: Identity a -> String #

showList :: [Identity a] -> ShowS #

Show a => Show (Grid a) 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

showsPrec :: Int -> Grid a -> ShowS #

show :: Grid a -> String #

showList :: [Grid a] -> ShowS #

Show x => Show (ErrValue x) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrValue x -> ShowS #

show :: ErrValue x -> String #

showList :: [ErrValue x] -> ShowS #

Show a => Show (Limit a) 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

showsPrec :: Int -> Limit a -> ShowS #

show :: Limit a -> String #

showList :: [Limit a] -> ShowS #

Show a => Show (Complex a) 
Instance details

Defined in Data.Complex

Methods

showsPrec :: Int -> Complex a -> ShowS #

show :: Complex a -> String #

showList :: [Complex a] -> ShowS #

Show a => Show (Min a) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> Min a -> ShowS #

show :: Min a -> String #

showList :: [Min a] -> ShowS #

Show a => Show (Max a) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> Max a -> ShowS #

show :: Max a -> String #

showList :: [Max a] -> ShowS #

Show a => Show (First a) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> First a -> ShowS #

show :: First a -> String #

showList :: [First a] -> ShowS #

Show a => Show (Last a) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> Last a -> ShowS #

show :: Last a -> String #

showList :: [Last a] -> ShowS #

Show m => Show (WrappedMonoid m) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> WrappedMonoid m -> ShowS #

show :: WrappedMonoid m -> String #

showList :: [WrappedMonoid m] -> ShowS #

Show a => Show (Option a) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> Option a -> ShowS #

show :: Option a -> String #

showList :: [Option a] -> ShowS #

Show a => Show (ZipList a) 
Instance details

Defined in Control.Applicative

Methods

showsPrec :: Int -> ZipList a -> ShowS #

show :: ZipList a -> String #

showList :: [ZipList a] -> ShowS #

Show a => Show (First a) 
Instance details

Defined in Data.Monoid

Methods

showsPrec :: Int -> First a -> ShowS #

show :: First a -> String #

showList :: [First a] -> ShowS #

Show a => Show (Last a) 
Instance details

Defined in Data.Monoid

Methods

showsPrec :: Int -> Last a -> ShowS #

show :: Last a -> String #

showList :: [Last a] -> ShowS #

Show a => Show (Dual a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Dual a -> ShowS #

show :: Dual a -> String #

showList :: [Dual a] -> ShowS #

Show a => Show (Sum a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Sum a -> ShowS #

show :: Sum a -> String #

showList :: [Sum a] -> ShowS #

Show a => Show (Product a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Product a -> ShowS #

show :: Product a -> String #

showList :: [Product a] -> ShowS #

Show a => Show (Down a)

Since: base-4.7.0.0

Instance details

Defined in Data.Ord

Methods

showsPrec :: Int -> Down a -> ShowS #

show :: Down a -> String #

showList :: [Down a] -> ShowS #

Show a => Show (NonEmpty a) 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> NonEmpty a -> ShowS #

show :: NonEmpty a -> String #

showList :: [NonEmpty a] -> ShowS #

(PrimType ty, Show ty) => Show (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

showsPrec :: Int -> UArray ty -> ShowS #

show :: UArray ty -> String #

showList :: [UArray ty] -> ShowS #

(PrimType ty, Show ty) => Show (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

showsPrec :: Int -> Block ty -> ShowS #

show :: Block ty -> String #

showList :: [Block ty] -> ShowS #

Show a => Show (NonEmpty a) 
Instance details

Defined in Basement.NonEmpty

Methods

showsPrec :: Int -> NonEmpty a -> ShowS #

show :: NonEmpty a -> String #

showList :: [NonEmpty a] -> ShowS #

Show (Offset ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

showsPrec :: Int -> Offset ty -> ShowS #

show :: Offset ty -> String #

showList :: [Offset ty] -> ShowS #

Show (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

showsPrec :: Int -> CountOf ty -> ShowS #

show :: CountOf ty -> String #

showList :: [CountOf ty] -> ShowS #

Show a => Show (Decoder a) 
Instance details

Defined in Data.Binary.Get.Internal

Methods

showsPrec :: Int -> Decoder a -> ShowS #

show :: Decoder a -> String #

showList :: [Decoder a] -> ShowS #

Show a => Show (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

showsPrec :: Int -> IntMap a -> ShowS #

show :: IntMap a -> String #

showList :: [IntMap a] -> ShowS #

Show vertex => Show (SCC vertex)

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

showsPrec :: Int -> SCC vertex -> ShowS #

show :: SCC vertex -> String #

showList :: [SCC vertex] -> ShowS #

Show a => Show (Tree a) 
Instance details

Defined in Data.Tree

Methods

showsPrec :: Int -> Tree a -> ShowS #

show :: Tree a -> String #

showList :: [Tree a] -> ShowS #

Show a => Show (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

showsPrec :: Int -> Seq a -> ShowS #

show :: Seq a -> String #

showList :: [Seq a] -> ShowS #

Show a => Show (ViewL a) 
Instance details

Defined in Data.Sequence.Internal

Methods

showsPrec :: Int -> ViewL a -> ShowS #

show :: ViewL a -> String #

showList :: [ViewL a] -> ShowS #

Show a => Show (ViewR a) 
Instance details

Defined in Data.Sequence.Internal

Methods

showsPrec :: Int -> ViewR a -> ShowS #

show :: ViewR a -> String #

showList :: [ViewR a] -> ShowS #

Show a => Show (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

showsPrec :: Int -> Set a -> ShowS #

show :: Set a -> String #

showList :: [Set a] -> ShowS #

Show a => Show (DList a) 
Instance details

Defined in Data.DList

Methods

showsPrec :: Int -> DList a -> ShowS #

show :: DList a -> String #

showList :: [DList a] -> ShowS #

Show n => Show (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

showsPrec :: Int -> Angle n -> ShowS #

show :: Angle n -> String #

showList :: [Angle n] -> ShowS #

Show a => Show (V3 a) 
Instance details

Defined in Linear.V3

Methods

showsPrec :: Int -> V3 a -> ShowS #

show :: V3 a -> String #

showList :: [V3 a] -> ShowS #

Show a => Show (V2 a) 
Instance details

Defined in Linear.V2

Methods

showsPrec :: Int -> V2 a -> ShowS #

show :: V2 a -> String #

showList :: [V2 a] -> ShowS #

Show n => Show (Extending n) 
Instance details

Defined in Plots.Axis.Scale

Methods

showsPrec :: Int -> Extending n -> ShowS #

show :: Extending n -> String #

showList :: [Extending n] -> ShowS #

Show (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> Doc a -> ShowS #

show :: Doc a -> String #

showList :: [Doc a] -> ShowS #

Show a => Show (AnnotDetails a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> AnnotDetails a -> ShowS #

show :: AnnotDetails a -> String #

showList :: [AnnotDetails a] -> ShowS #

Show a => Show (Span a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

showsPrec :: Int -> Span a -> ShowS #

show :: Span a -> String #

showList :: [Span a] -> ShowS #

Show a => Show (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

showsPrec :: Int -> Array a -> ShowS #

show :: Array a -> String #

showList :: [Array a] -> ShowS #

Show (Rules a) 
Instance details

Defined in Filesystem.Path.Internal

Methods

showsPrec :: Int -> Rules a -> ShowS #

show :: Rules a -> String #

showList :: [Rules a] -> ShowS #

(Show t, Element t) => Show (Herm t) 
Instance details

Defined in Internal.Algorithms

Methods

showsPrec :: Int -> Herm t -> ShowS #

show :: Herm t -> String #

showList :: [Herm t] -> ShowS #

(Show t, Element t) => Show (LDL t) 
Instance details

Defined in Internal.Algorithms

Methods

showsPrec :: Int -> LDL t -> ShowS #

show :: LDL t -> String #

showList :: [LDL t] -> ShowS #

(Show t, Element t) => Show (LU t) 
Instance details

Defined in Internal.Algorithms

Methods

showsPrec :: Int -> LU t -> ShowS #

show :: LU t -> String #

showList :: [LU t] -> ShowS #

(Show a, Storable a) => Show (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

showsPrec :: Int -> Vector a -> ShowS #

show :: Vector a -> String #

showList :: [Vector a] -> ShowS #

Show a => Show (Vector a) 
Instance details

Defined in Data.Vector

Methods

showsPrec :: Int -> Vector a -> ShowS #

show :: Vector a -> String #

showList :: [Vector a] -> ShowS #

Show a => Show (Root a) 
Instance details

Defined in Numeric.RootFinding

Methods

showsPrec :: Int -> Root a -> ShowS #

show :: Root a -> String #

showList :: [Root a] -> ShowS #

(Show a, Prim a) => Show (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

showsPrec :: Int -> Vector a -> ShowS #

show :: Vector a -> String #

showList :: [Vector a] -> ShowS #

Show n => Show (VarInt n) 
Instance details

Defined in Data.Bytes.VarInt

Methods

showsPrec :: Int -> VarInt n -> ShowS #

show :: VarInt n -> String #

showList :: [VarInt n] -> ShowS #

(Floating a, Show a) => Show (Log a) 
Instance details

Defined in Numeric.Log

Methods

showsPrec :: Int -> Log a -> ShowS #

show :: Log a -> String #

showList :: [Log a] -> ShowS #

Show a => Show (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

showsPrec :: Int -> HashSet a -> ShowS #

show :: HashSet a -> String #

showList :: [HashSet a] -> ShowS #

Show t => Show (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

showsPrec :: Int -> TransInv t -> ShowS #

show :: TransInv t -> String #

showList :: [TransInv t] -> ShowS #

(Show (V a (N a)), Show a) => Show (Located a) 
Instance details

Defined in Diagrams.Located

Methods

showsPrec :: Int -> Located a -> ShowS #

show :: Located a -> String #

showList :: [Located a] -> ShowS #

Show n => Show (PolyOrientation n) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

showsPrec :: Int -> PolyOrientation n -> ShowS #

show :: PolyOrientation n -> String #

showList :: [PolyOrientation n] -> ShowS #

Show n => Show (Time n) 
Instance details

Defined in Data.Active

Methods

showsPrec :: Int -> Time n -> ShowS #

show :: Time n -> String #

showList :: [Time n] -> ShowS #

Show a => Show (Interval a) 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

showsPrec :: Int -> Interval a -> ShowS #

show :: Interval a -> String #

showList :: [Interval a] -> ShowS #

Show m => Show (SM m) 
Instance details

Defined in Data.Monoid.MList

Methods

showsPrec :: Int -> SM m -> ShowS #

show :: SM m -> String #

showList :: [SM m] -> ShowS #

Show a => Show (V1 a) 
Instance details

Defined in Linear.V1

Methods

showsPrec :: Int -> V1 a -> ShowS #

show :: V1 a -> String #

showList :: [V1 a] -> ShowS #

Show a => Show (ExitCase a) 
Instance details

Defined in Control.Monad.Catch

Methods

showsPrec :: Int -> ExitCase a -> ShowS #

show :: ExitCase a -> String #

showList :: [ExitCase a] -> ShowS #

Show n => Show (Duration n) 
Instance details

Defined in Data.Active

Methods

showsPrec :: Int -> Duration n -> ShowS #

show :: Duration n -> String #

showList :: [Duration n] -> ShowS #

Show n => Show (Era n) 
Instance details

Defined in Data.Active

Methods

showsPrec :: Int -> Era n -> ShowS #

show :: Era n -> String #

showList :: [Era n] -> ShowS #

Show a => Show (V4 a) 
Instance details

Defined in Linear.V4

Methods

showsPrec :: Int -> V4 a -> ShowS #

show :: V4 a -> String #

showList :: [V4 a] -> ShowS #

Show n => Show (BernsteinPoly n) 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

showsPrec :: Int -> BernsteinPoly n -> ShowS #

show :: BernsteinPoly n -> String #

showList :: [BernsteinPoly n] -> ShowS #

Show a => Show (Digit a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> Digit a -> ShowS #

show :: Digit a -> String #

showList :: [Digit a] -> ShowS #

Show a => Show (Plucker a) 
Instance details

Defined in Linear.Plucker

Methods

showsPrec :: Int -> Plucker a -> ShowS #

show :: Plucker a -> String #

showList :: [Plucker a] -> ShowS #

Show a => Show (Quaternion a) 
Instance details

Defined in Linear.Quaternion

Methods

showsPrec :: Int -> Quaternion a -> ShowS #

show :: Quaternion a -> String #

showList :: [Quaternion a] -> ShowS #

Show (V0 a) 
Instance details

Defined in Linear.V0

Methods

showsPrec :: Int -> V0 a -> ShowS #

show :: V0 a -> String #

showList :: [V0 a] -> ShowS #

Show a => Show (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> IResult a -> ShowS #

show :: IResult a -> String #

showList :: [IResult a] -> ShowS #

Show a => Show (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

showsPrec :: Int -> Result a -> ShowS #

show :: Result a -> String #

showList :: [Result a] -> ShowS #

Show a => Show (RB a) 
Instance details

Defined in Data.List.Extra

Methods

showsPrec :: Int -> RB a -> ShowS #

show :: RB a -> String #

showList :: [RB a] -> ShowS #

Show (TypeOf t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> TypeOf t -> ShowS #

show :: TypeOf t -> String #

showList :: [TypeOf t] -> ShowS #

(Show t, ExprType t) => Show (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> Expression t -> ShowS #

show :: Expression t -> String #

showList :: [Expression t] -> ShowS #

ExprTuple t => Show (P t) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> P t -> ShowS #

show :: P t -> String #

showList :: [P t] -> ShowS #

Show (Blake2b bitlen) 
Instance details

Defined in Crypto.Hash.Blake2

Methods

showsPrec :: Int -> Blake2b bitlen -> ShowS #

show :: Blake2b bitlen -> String #

showList :: [Blake2b bitlen] -> ShowS #

Show (Blake2bp bitlen) 
Instance details

Defined in Crypto.Hash.Blake2

Methods

showsPrec :: Int -> Blake2bp bitlen -> ShowS #

show :: Blake2bp bitlen -> String #

showList :: [Blake2bp bitlen] -> ShowS #

Show (Blake2s bitlen) 
Instance details

Defined in Crypto.Hash.Blake2

Methods

showsPrec :: Int -> Blake2s bitlen -> ShowS #

show :: Blake2s bitlen -> String #

showList :: [Blake2s bitlen] -> ShowS #

Show (Blake2sp bitlen) 
Instance details

Defined in Crypto.Hash.Blake2

Methods

showsPrec :: Int -> Blake2sp bitlen -> ShowS #

show :: Blake2sp bitlen -> String #

showList :: [Blake2sp bitlen] -> ShowS #

Show (Digest a) 
Instance details

Defined in Crypto.Hash.Types

Methods

showsPrec :: Int -> Digest a -> ShowS #

show :: Digest a -> String #

showList :: [Digest a] -> ShowS #

Show (SHAKE128 bitlen) 
Instance details

Defined in Crypto.Hash.SHAKE

Methods

showsPrec :: Int -> SHAKE128 bitlen -> ShowS #

show :: SHAKE128 bitlen -> String #

showList :: [SHAKE128 bitlen] -> ShowS #

Show (SHAKE256 bitlen) 
Instance details

Defined in Crypto.Hash.SHAKE

Methods

showsPrec :: Int -> SHAKE256 bitlen -> ShowS #

show :: SHAKE256 bitlen -> String #

showList :: [SHAKE256 bitlen] -> ShowS #

Show a => Show (Hashed a) 
Instance details

Defined in Data.Hashable.Class

Methods

showsPrec :: Int -> Hashed a -> ShowS #

show :: Hashed a -> String #

showList :: [Hashed a] -> ShowS #

Show a => Show (GraphPart a) 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

showsPrec :: Int -> GraphPart a -> ShowS #

show :: GraphPart a -> String #

showList :: [GraphPart a] -> ShowS #

(ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #

show :: (a -> b -> Expression t) -> String #

showList :: [a -> b -> Expression t] -> ShowS #

(ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> Expression t) -> ShowS #

show :: (a -> Expression t) -> String #

showList :: [a -> Expression t] -> ShowS #

(ExprTuple a, ExprTuple b) => Show (a -> P b) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> (a -> P b) -> ShowS #

show :: (a -> P b) -> String #

showList :: [a -> P b] -> ShowS #

(Show a, Show b) => Show (Either a b) 
Instance details

Defined in Data.Either

Methods

showsPrec :: Int -> Either a b -> ShowS #

show :: Either a b -> String #

showList :: [Either a b] -> ShowS #

Show (V1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> V1 p -> ShowS #

show :: V1 p -> String #

showList :: [V1 p] -> ShowS #

Show (U1 p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> U1 p -> ShowS #

show :: U1 p -> String #

showList :: [U1 p] -> ShowS #

Show (TypeRep a) 
Instance details

Defined in Data.Typeable.Internal

Methods

showsPrec :: Int -> TypeRep a -> ShowS #

show :: TypeRep a -> String #

showList :: [TypeRep a] -> ShowS #

(Show a, Show b) => Show (a, b)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b) -> ShowS #

show :: (a, b) -> String #

showList :: [(a, b)] -> ShowS #

(Show i, Show a) => Show (Level i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

showsPrec :: Int -> Level i a -> ShowS #

show :: Level i a -> String #

showList :: [Level i a] -> ShowS #

(Show x, Show y) => Show (Candle x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Candle

Methods

showsPrec :: Int -> Candle x y -> ShowS #

show :: Candle x y -> String #

showList :: [Candle x y] -> ShowS #

(Show x, Show y) => Show (ErrPoint x y) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.ErrBars

Methods

showsPrec :: Int -> ErrPoint x y -> ShowS #

show :: ErrPoint x y -> String #

showList :: [ErrPoint x y] -> ShowS #

(Show k, Show a) => Show (Map k a) 
Instance details

Defined in Data.Map.Internal

Methods

showsPrec :: Int -> Map k a -> ShowS #

show :: Map k a -> String #

showList :: [Map k a] -> ShowS #

(Ix ix, Show ix, Show e, IArray UArray e) => Show (UArray ix e) 
Instance details

Defined in Data.Array.Base

Methods

showsPrec :: Int -> UArray ix e -> ShowS #

show :: UArray ix e -> String #

showList :: [UArray ix e] -> ShowS #

(Ix a, Show a, Show b) => Show (Array a b)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

showsPrec :: Int -> Array a b -> ShowS #

show :: Array a b -> String #

showList :: [Array a b] -> ShowS #

(Show a, Show b) => Show (Arg a b) 
Instance details

Defined in Data.Semigroup

Methods

showsPrec :: Int -> Arg a b -> ShowS #

show :: Arg a b -> String #

showList :: [Arg a b] -> ShowS #

Show (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

showsPrec :: Int -> Proxy s -> ShowS #

show :: Proxy s -> String #

showList :: [Proxy s] -> ShowS #

(Show1 m, Show a) => Show (MaybeT m a) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

showsPrec :: Int -> MaybeT m a -> ShowS #

show :: MaybeT m a -> String #

showList :: [MaybeT m a] -> ShowS #

(Show a, Show (s a)) => Show (ViewL s a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> ViewL s a -> ShowS #

show :: ViewL s a -> String #

showList :: [ViewL s a] -> ShowS #

(Show a, Show (s a)) => Show (ViewR s a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> ViewR s a -> ShowS #

show :: ViewR s a -> String #

showList :: [ViewR s a] -> ShowS #

Show a => Show (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> FingerTree v a -> ShowS #

show :: FingerTree v a -> String #

showList :: [FingerTree v a] -> ShowS #

Show a => Show (SearchResult v a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> SearchResult v a -> ShowS #

show :: SearchResult v a -> String #

showList :: [SearchResult v a] -> ShowS #

(Show1 m, Show a) => Show (ListT m a) 
Instance details

Defined in Control.Monad.Trans.List

Methods

showsPrec :: Int -> ListT m a -> ShowS #

show :: ListT m a -> String #

showList :: [ListT m a] -> ShowS #

Show (v n) => Show (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

showsPrec :: Int -> Trail v n -> ShowS #

show :: Trail v n -> String #

showList :: [Trail v n] -> ShowS #

Show (v n) => Show (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

showsPrec :: Int -> BoundingBox v n -> ShowS #

show :: BoundingBox v n -> String #

showList :: [BoundingBox v n] -> ShowS #

Show (v n) => Show (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

showsPrec :: Int -> Path v n -> ShowS #

show :: Path v n -> String #

showList :: [Path v n] -> ShowS #

Show (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

showsPrec :: Int -> Style v n -> ShowS #

show :: Style v n -> String #

showList :: [Style v n] -> ShowS #

Show (f a) => Show (Point f a) 
Instance details

Defined in Linear.Affine

Methods

showsPrec :: Int -> Point f a -> ShowS #

show :: Point f a -> String #

showList :: [Point f a] -> ShowS #

Show t => Show (Mod n t) 
Instance details

Defined in Internal.Modular

Methods

showsPrec :: Int -> Mod n t -> ShowS #

show :: Mod n t -> String #

showList :: [Mod n t] -> ShowS #

(Show t, Show b) => Show (MatrixView t b) 
Instance details

Defined in Internal.Util

Methods

showsPrec :: Int -> MatrixView t b -> ShowS #

show :: MatrixView t b -> String #

showList :: [MatrixView t b] -> ShowS #

(Num p, Show p, Show a) => Show (Categorical p a) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

showsPrec :: Int -> Categorical p a -> ShowS #

show :: Categorical p a -> String #

showList :: [Categorical p a] -> ShowS #

(Show k, Show v) => Show (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

showsPrec :: Int -> HashMap k v -> ShowS #

show :: HashMap k v -> String #

showList :: [HashMap k v] -> ShowS #

Show (v n) => Show (SizeSpec v n) 
Instance details

Defined in Diagrams.Size

Methods

showsPrec :: Int -> SizeSpec v n -> ShowS #

show :: SizeSpec v n -> String #

showList :: [SizeSpec v n] -> ShowS #

Show (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Methods

showsPrec :: Int -> Envelope v n -> ShowS #

show :: Envelope v n -> String #

showList :: [Envelope v n] -> ShowS #

Show (Attribute v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

showsPrec :: Int -> Attribute v n -> ShowS #

show :: Attribute v n -> String #

showList :: [Attribute v n] -> ShowS #

Show (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Methods

showsPrec :: Int -> Trace v n -> ShowS #

show :: Trace v n -> String #

showList :: [Trace v n] -> ShowS #

Show (v n) => Show (FixedSegment v n) 
Instance details

Defined in Diagrams.Segment

Methods

showsPrec :: Int -> FixedSegment v n -> ShowS #

show :: FixedSegment v n -> String #

showList :: [FixedSegment v n] -> ShowS #

Show (v n) => Show (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

showsPrec :: Int -> SegTree v n -> ShowS #

show :: SegTree v n -> String #

showList :: [SegTree v n] -> ShowS #

(Show i, Show r) => Show (IResult i r) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

showsPrec :: Int -> IResult i r -> ShowS #

show :: IResult i r -> String #

showList :: [IResult i r] -> ShowS #

(Show1 f, Show a) => Show (Cofree f a) 
Instance details

Defined in Control.Comonad.Cofree

Methods

showsPrec :: Int -> Cofree f a -> ShowS #

show :: Cofree f a -> String #

showList :: [Cofree f a] -> ShowS #

Show (v n) => Show (Direction v n) 
Instance details

Defined in Diagrams.Direction

Methods

showsPrec :: Int -> Direction v n -> ShowS #

show :: Direction v n -> String #

showList :: [Direction v n] -> ShowS #

(Show a, Show b) => Show (a :& b) 
Instance details

Defined in Diagrams.Coordinates

Methods

showsPrec :: Int -> (a :& b) -> ShowS #

show :: (a :& b) -> String #

showList :: [a :& b] -> ShowS #

(Show v, Show a) => Show (Node v a) 
Instance details

Defined in Data.FingerTree

Methods

showsPrec :: Int -> Node v a -> ShowS #

show :: Node v a -> String #

showList :: [Node v a] -> ShowS #

(Show1 f, Show a) => Show (Free f a) 
Instance details

Defined in Control.Monad.Free

Methods

showsPrec :: Int -> Free f a -> ShowS #

show :: Free f a -> String #

showList :: [Free f a] -> ShowS #

Show (f a) => Show (Yoneda f a) 
Instance details

Defined in Data.Functor.Yoneda

Methods

showsPrec :: Int -> Yoneda f a -> ShowS #

show :: Yoneda f a -> String #

showList :: [Yoneda f a] -> ShowS #

(Show a, Show b) => Show (Bimap a b) 
Instance details

Defined in Data.Bimap

Methods

showsPrec :: Int -> Bimap a b -> ShowS #

show :: Bimap a b -> String #

showList :: [Bimap a b] -> ShowS #

Show (f p) => Show (Rec1 f p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> Rec1 f p -> ShowS #

show :: Rec1 f p -> String #

showList :: [Rec1 f p] -> ShowS #

Show (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Char p -> ShowS #

show :: URec Char p -> String #

showList :: [URec Char p] -> ShowS #

Show (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Double p -> ShowS #

show :: URec Double p -> String #

showList :: [URec Double p] -> ShowS #

Show (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Float p -> ShowS #

show :: URec Float p -> String #

showList :: [URec Float p] -> ShowS #

Show (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Int p -> ShowS #

show :: URec Int p -> String #

showList :: [URec Int p] -> ShowS #

Show (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Word p -> ShowS #

show :: URec Word p -> String #

showList :: [URec Word p] -> ShowS #

(Show a, Show b, Show c) => Show (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c) -> ShowS #

show :: (a, b, c) -> String #

showList :: [(a, b, c)] -> ShowS #

Show a => Show (Const a b)

This instance would be equivalent to the derived instances of the - Const newtype if the runConst field were removed

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Const

Methods

showsPrec :: Int -> Const a b -> ShowS #

show :: Const a b -> String #

showList :: [Const a b] -> ShowS #

(Show x, Show y1, Show y2) => Show (LayoutPick x y1 y2) 
Instance details

Defined in Graphics.Rendering.Chart.Layout

Methods

showsPrec :: Int -> LayoutPick x y1 y2 -> ShowS #

show :: LayoutPick x y1 y2 -> String #

showList :: [LayoutPick x y1 y2] -> ShowS #

Show (f a) => Show (Alt f a) 
Instance details

Defined in Data.Semigroup.Internal

Methods

showsPrec :: Int -> Alt f a -> ShowS #

show :: Alt f a -> String #

showList :: [Alt f a] -> ShowS #

Show (a :~: b) 
Instance details

Defined in Data.Type.Equality

Methods

showsPrec :: Int -> (a :~: b) -> ShowS #

show :: (a :~: b) -> String #

showList :: [a :~: b] -> ShowS #

(Show1 f, Show a) => Show (IdentityT f a) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

showsPrec :: Int -> IdentityT f a -> ShowS #

show :: IdentityT f a -> String #

showList :: [IdentityT f a] -> ShowS #

(Show e, Show1 m, Show a) => Show (ExceptT e m a) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

showsPrec :: Int -> ExceptT e m a -> ShowS #

show :: ExceptT e m a -> String #

showList :: [ExceptT e m a] -> ShowS #

(Show e, Show1 m, Show a) => Show (ErrorT e m a) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

showsPrec :: Int -> ErrorT e m a -> ShowS #

show :: ErrorT e m a -> String #

showList :: [ErrorT e m a] -> ShowS #

(Show1 f, Show a) => Show (Backwards f a) 
Instance details

Defined in Control.Applicative.Backwards

Methods

showsPrec :: Int -> Backwards f a -> ShowS #

show :: Backwards f a -> String #

showList :: [Backwards f a] -> ShowS #

(Show w, Show1 m, Show a) => Show (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

showsPrec :: Int -> WriterT w m a -> ShowS #

show :: WriterT w m a -> String #

showList :: [WriterT w m a] -> ShowS #

(Show w, Show1 m, Show a) => Show (WriterT w m a) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

showsPrec :: Int -> WriterT w m a -> ShowS #

show :: WriterT w m a -> String #

showList :: [WriterT w m a] -> ShowS #

Show (p a a) => Show (Join p a) 
Instance details

Defined in Data.Bifunctor.Join

Methods

showsPrec :: Int -> Join p a -> ShowS #

show :: Join p a -> String #

showList :: [Join p a] -> ShowS #

Show b => Show (Tagged s b) 
Instance details

Defined in Data.Tagged

Methods

showsPrec :: Int -> Tagged s b -> ShowS #

show :: Tagged s b -> String #

showList :: [Tagged s b] -> ShowS #

Show (Options Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

showsPrec :: Int -> Options Cairo V2 Double -> ShowS #

show :: Options Cairo V2 Double -> String #

showList :: [Options Cairo V2 Double] -> ShowS #

Show (v n) => Show (Segment c v n) 
Instance details

Defined in Diagrams.Segment

Methods

showsPrec :: Int -> Segment c v n -> ShowS #

show :: Segment c v n -> String #

showList :: [Segment c v n] -> ShowS #

Show (v n) => Show (Trail' l v n) 
Instance details

Defined in Diagrams.Trail

Methods

showsPrec :: Int -> Trail' l v n -> ShowS #

show :: Trail' l v n -> String #

showList :: [Trail' l v n] -> ShowS #

Show (v n) => Show (Offset c v n) 
Instance details

Defined in Diagrams.Segment

Methods

showsPrec :: Int -> Offset c v n -> ShowS #

show :: Offset c v n -> String #

showList :: [Offset c v n] -> ShowS #

Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

showsPrec :: Int -> CofreeT f w a -> ShowS #

show :: CofreeT f w a -> String #

showList :: [CofreeT f w a] -> ShowS #

(Show a, Show (f b)) => Show (CofreeF f a b) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

showsPrec :: Int -> CofreeF f a b -> ShowS #

show :: CofreeF f a b -> String #

showList :: [CofreeF f a b] -> ShowS #

Show (p (Fix p a) a) => Show (Fix p a) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

showsPrec :: Int -> Fix p a -> ShowS #

show :: Fix p a -> String #

showList :: [Fix p a] -> ShowS #

(Show1 f, Show1 m, Show a) => Show (FreeT f m a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

showsPrec :: Int -> FreeT f m a -> ShowS #

show :: FreeT f m a -> String #

showList :: [FreeT f m a] -> ShowS #

(Show a, Show (f b)) => Show (FreeF f a b) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

showsPrec :: Int -> FreeF f a b -> ShowS #

show :: FreeF f a b -> String #

showList :: [FreeF f a b] -> ShowS #

Show a => Show (V n a) 
Instance details

Defined in Linear.V

Methods

showsPrec :: Int -> V n a -> ShowS #

show :: V n a -> String #

showList :: [V n a] -> ShowS #

Show (f (a, b)) => Show (AlongsideLeft f b a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

showsPrec :: Int -> AlongsideLeft f b a -> ShowS #

show :: AlongsideLeft f b a -> String #

showList :: [AlongsideLeft f b a] -> ShowS #

Show (f (a, b)) => Show (AlongsideRight f a b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

showsPrec :: Int -> AlongsideRight f a b -> ShowS #

show :: AlongsideRight f a b -> String #

showList :: [AlongsideRight f a b] -> ShowS #

Show c => Show (K1 i c p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> K1 i c p -> ShowS #

show :: K1 i c p -> String #

showList :: [K1 i c p] -> ShowS #

(Show (f p), Show (g p)) => Show ((f :+: g) p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> (f :+: g) p -> ShowS #

show :: (f :+: g) p -> String #

showList :: [(f :+: g) p] -> ShowS #

(Show (f p), Show (g p)) => Show ((f :*: g) p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> (f :*: g) p -> ShowS #

show :: (f :*: g) p -> String #

showList :: [(f :*: g) p] -> ShowS #

(Show a, Show b, Show c, Show d) => Show (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d) -> ShowS #

show :: (a, b, c, d) -> String #

showList :: [(a, b, c, d)] -> ShowS #

(Show i, Show a) => Show (Magma i t b a) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

showsPrec :: Int -> Magma i t b a -> ShowS #

show :: Magma i t b a -> String #

showList :: [Magma i t b a] -> ShowS #

(Show1 f, Show1 g, Show a) => Show (Product f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

showsPrec :: Int -> Product f g a -> ShowS #

show :: Product f g a -> String #

showList :: [Product f g a] -> ShowS #

(Show1 f, Show1 g, Show a) => Show (Sum f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

showsPrec :: Int -> Sum f g a -> ShowS #

show :: Sum f g a -> String #

showList :: [Sum f g a] -> ShowS #

Show (a :~~: b)

Since: base-4.10.0.0

Instance details

Defined in Data.Type.Equality

Methods

showsPrec :: Int -> (a :~~: b) -> ShowS #

show :: (a :~~: b) -> String #

showList :: [a :~~: b] -> ShowS #

(Show u, Show l, Show d, Show a) => Show (DUALTreeU d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

showsPrec :: Int -> DUALTreeU d u a l -> ShowS #

show :: DUALTreeU d u a l -> String #

showList :: [DUALTreeU d u a l] -> ShowS #

(Show u, Show l, Show d, Show a) => Show (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

showsPrec :: Int -> DUALTree d u a l -> ShowS #

show :: DUALTree d u a l -> String #

showList :: [DUALTree d u a l] -> ShowS #

(Show u, Show l, Show d, Show a) => Show (DUALTreeNE d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

showsPrec :: Int -> DUALTreeNE d u a l -> ShowS #

show :: DUALTreeNE d u a l -> String #

showList :: [DUALTreeNE d u a l] -> ShowS #

Show (f p) => Show (M1 i c f p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> M1 i c f p -> ShowS #

show :: M1 i c f p -> String #

showList :: [M1 i c f p] -> ShowS #

Show (f (g p)) => Show ((f :.: g) p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> (f :.: g) p -> ShowS #

show :: (f :.: g) p -> String #

showList :: [(f :.: g) p] -> ShowS #

(Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e) -> ShowS #

show :: (a, b, c, d, e) -> String #

showList :: [(a, b, c, d, e)] -> ShowS #

(Show1 f, Show1 g, Show a) => Show (Compose f g a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

showsPrec :: Int -> Compose f g a -> ShowS #

show :: Compose f g a -> String #

showList :: [Compose f g a] -> ShowS #

Show (f a) => Show (Clown f a b) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

showsPrec :: Int -> Clown f a b -> ShowS #

show :: Clown f a b -> String #

showList :: [Clown f a b] -> ShowS #

Show (p b a) => Show (Flip p a b) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

showsPrec :: Int -> Flip p a b -> ShowS #

show :: Flip p a b -> String #

showList :: [Flip p a b] -> ShowS #

Show (g b) => Show (Joker g a b) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

showsPrec :: Int -> Joker g a b -> ShowS #

show :: Joker g a b -> String #

showList :: [Joker g a b] -> ShowS #

Show (p a b) => Show (WrappedBifunctor p a b) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

showsPrec :: Int -> WrappedBifunctor p a b -> ShowS #

show :: WrappedBifunctor p a b -> String #

showList :: [WrappedBifunctor p a b] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS #

show :: (a, b, c, d, e, f) -> String #

showList :: [(a, b, c, d, e, f)] -> ShowS #

(Show (f a b), Show (g a b)) => Show (Product f g a b) 
Instance details

Defined in Data.Bifunctor.Product

Methods

showsPrec :: Int -> Product f g a b -> ShowS #

show :: Product f g a b -> String #

showList :: [Product f g a b] -> ShowS #

(Show (p a b), Show (q a b)) => Show (Sum p q a b) 
Instance details

Defined in Data.Bifunctor.Sum

Methods

showsPrec :: Int -> Sum p q a b -> ShowS #

show :: Sum p q a b -> String #

showList :: [Sum p q a b] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS #

show :: (a, b, c, d, e, f, g) -> String #

showList :: [(a, b, c, d, e, f, g)] -> ShowS #

Show (f (p a b)) => Show (Tannen f p a b) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

showsPrec :: Int -> Tannen f p a b -> ShowS #

show :: Tannen f p a b -> String #

showList :: [Tannen f p a b] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS #

show :: (a, b, c, d, e, f, g, h) -> String #

showList :: [(a, b, c, d, e, f, g, h)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i) -> String #

showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS #

Show (p (f a) (g b)) => Show (Biff p f g a b) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

showsPrec :: Int -> Biff p f g a b -> ShowS #

show :: Biff p f g a b -> String #

showList :: [Biff p f g a b] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j, k) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS #

(Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS #

show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String #

showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS #

class Functor f => Applicative (f :: * -> *) where #

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:

As a consequence of these laws, the Functor instance for f will satisfy

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

(which implies that pure and <*> satisfy the applicative functor laws).

Minimal complete definition

pure, ((<*>) | liftA2)

Methods

pure :: a -> f a #

Lift a value.

(<*>) :: f (a -> b) -> f a -> f b infixl 4 #

Sequential application.

A few functors support an implementation of <*> that is more - efficient than the default one.

Instances
Applicative []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> [a] #

(<*>) :: [a -> b] -> [a] -> [b] #

liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] #

(*>) :: [a] -> [b] -> [b] #

(<*) :: [a] -> [b] -> [a] #

Applicative Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> Maybe a #

(<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b #

liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #

(*>) :: Maybe a -> Maybe b -> Maybe b #

(<*) :: Maybe a -> Maybe b -> Maybe a #

Applicative IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> IO a #

(<*>) :: IO (a -> b) -> IO a -> IO b #

liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c #

(*>) :: IO a -> IO b -> IO b #

(<*) :: IO a -> IO b -> IO a #

Applicative Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> Par1 a #

(<*>) :: Par1 (a -> b) -> Par1 a -> Par1 b #

liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c #

(*>) :: Par1 a -> Par1 b -> Par1 b #

(<*) :: Par1 a -> Par1 b -> Par1 a #

Applicative Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

pure :: a -> Q a #

(<*>) :: Q (a -> b) -> Q a -> Q b #

liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c #

(*>) :: Q a -> Q b -> Q b #

(<*) :: Q a -> Q b -> Q a #

Applicative Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

pure :: a -> Identity a #

(<*>) :: Identity (a -> b) -> Identity a -> Identity b #

liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #

(*>) :: Identity a -> Identity b -> Identity b #

(<*) :: Identity a -> Identity b -> Identity a #

Applicative Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

pure :: a -> Complex a #

(<*>) :: Complex (a -> b) -> Complex a -> Complex b #

liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c #

(*>) :: Complex a -> Complex b -> Complex b #

(<*) :: Complex a -> Complex b -> Complex a #

Applicative Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

pure :: a -> Min a #

(<*>) :: Min (a -> b) -> Min a -> Min b #

liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c #

(*>) :: Min a -> Min b -> Min b #

(<*) :: Min a -> Min b -> Min a #

Applicative Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

pure :: a -> Max a #

(<*>) :: Max (a -> b) -> Max a -> Max b #

liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c #

(*>) :: Max a -> Max b -> Max b #

(<*) :: Max a -> Max b -> Max a #

Applicative First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

pure :: a -> First a #

(<*>) :: First (a -> b) -> First a -> First b #

liftA2 :: (a -> b -> c) -> First a -> First b -> First c #

(*>) :: First a -> First b -> First b #

(<*) :: First a -> First b -> First a #

Applicative Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

pure :: a -> Last a #

(<*>) :: Last (a -> b) -> Last a -> Last b #

liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c #

(*>) :: Last a -> Last b -> Last b #

(<*) :: Last a -> Last b -> Last a #

Applicative Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

pure :: a -> Option a #

(<*>) :: Option (a -> b) -> Option a -> Option b #

liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c #

(*>) :: Option a -> Option b -> Option b #

(<*) :: Option a -> Option b -> Option a #

Applicative ZipList
f '<$>' 'ZipList' xs1 '<*>' ... '<*>' 'ZipList' xsN
+ in double quotes, rather than between square brackets.
Instances
 Show Bool
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Bool -> ShowS #
show :: Bool -> String #
showList :: [Bool] -> ShowS #
 Show Char
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Char -> ShowS #
show :: Char -> String #
showList :: [Char] -> ShowS #
 Show Int
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Int -> ShowS #
show :: Int -> String #
showList :: [Int] -> ShowS #
 Show Int8
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
showsPrec :: Int -> Int8 -> ShowS #
show :: Int8 -> String #
showList :: [Int8] -> ShowS #
 Show Int16
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
showsPrec :: Int -> Int16 -> ShowS #
show :: Int16 -> String #
showList :: [Int16] -> ShowS #
 Show Int32
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
showsPrec :: Int -> Int32 -> ShowS #
show :: Int32 -> String #
showList :: [Int32] -> ShowS #
 Show Int64
Since: base-2.1
Instance details
Defined in GHC.Int
 
Methods
showsPrec :: Int -> Int64 -> ShowS #
show :: Int64 -> String #
showList :: [Int64] -> ShowS #
 Show Integer
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Integer -> ShowS #
show :: Integer -> String #
showList :: [Integer] -> ShowS #
 Show Natural
Since: base-4.8.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Natural -> ShowS #
show :: Natural -> String #
showList :: [Natural] -> ShowS #
 Show Ordering
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Ordering -> ShowS #
show :: Ordering -> String #
showList :: [Ordering] -> ShowS #
 Show Word
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Word -> ShowS #
show :: Word -> String #
showList :: [Word] -> ShowS #
 Show Word8
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
showsPrec :: Int -> Word8 -> ShowS #
show :: Word8 -> String #
showList :: [Word8] -> ShowS #
 Show Word16
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
showsPrec :: Int -> Word16 -> ShowS #
show :: Word16 -> String #
showList :: [Word16] -> ShowS #
 Show Word32
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
showsPrec :: Int -> Word32 -> ShowS #
show :: Word32 -> String #
showList :: [Word32] -> ShowS #
 Show Word64
Since: base-2.1
Instance details
Defined in GHC.Word
 
Methods
showsPrec :: Int -> Word64 -> ShowS #
show :: Word64 -> String #
showList :: [Word64] -> ShowS #
 Show RuntimeRep
Since: base-4.11.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> RuntimeRep -> ShowS #
show :: RuntimeRep -> String #
showList :: [RuntimeRep] -> ShowS #
 Show VecCount
Since: base-4.11.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> VecCount -> ShowS #
show :: VecCount -> String #
showList :: [VecCount] -> ShowS #
 Show VecElem
Since: base-4.11.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> VecElem -> ShowS #
show :: VecElem -> String #
showList :: [VecElem] -> ShowS #
 Show CallStack
Since: base-4.9.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> CallStack -> ShowS #
show :: CallStack -> String #
showList :: [CallStack] -> ShowS #
 Show SomeTypeRep
Since: base-4.10.0.0
Instance details
Defined in Data.Typeable.Internal
 
Methods
showsPrec :: Int -> SomeTypeRep -> ShowS #
show :: SomeTypeRep -> String #
showList :: [SomeTypeRep] -> ShowS #
 Show Exp 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Exp -> ShowS #
show :: Exp -> String #
showList :: [Exp] -> ShowS #
 Show Match 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Match -> ShowS #
show :: Match -> String #
showList :: [Match] -> ShowS #
 Show Clause 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Clause -> ShowS #
show :: Clause -> String #
showList :: [Clause] -> ShowS #
 Show Pat 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Pat -> ShowS #
show :: Pat -> String #
showList :: [Pat] -> ShowS #
 Show Type 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Type -> ShowS #
show :: Type -> String #
showList :: [Type] -> ShowS #
 Show Dec 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Dec -> ShowS #
show :: Dec -> String #
showList :: [Dec] -> ShowS #
 Show Name 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Name -> ShowS #
show :: Name -> String #
showList :: [Name] -> ShowS #
 Show FunDep 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> FunDep -> ShowS #
show :: FunDep -> String #
showList :: [FunDep] -> ShowS #
 Show InjectivityAnn 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> InjectivityAnn -> ShowS #
show :: InjectivityAnn -> String #
showList :: [InjectivityAnn] -> ShowS #
 Show Overlap 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Overlap -> ShowS #
show :: Overlap -> String #
showList :: [Overlap] -> ShowS #
 Show ()
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> () -> ShowS #
show :: () -> String #
showList :: [()] -> ShowS #
 Show TyCon
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> TyCon -> ShowS #
show :: TyCon -> String #
showList :: [TyCon] -> ShowS #
 Show Module
Since: base-4.9.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Module -> ShowS #
show :: Module -> String #
showList :: [Module] -> ShowS #
 Show TrName
Since: base-4.9.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> TrName -> ShowS #
show :: TrName -> String #
showList :: [TrName] -> ShowS #
 Show KindRep 
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> KindRep -> ShowS #
show :: KindRep -> String #
showList :: [KindRep] -> ShowS #
 Show TypeLitSort
Since: base-4.11.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> TypeLitSort -> ShowS #
show :: TypeLitSort -> String #
showList :: [TypeLitSort] -> ShowS #
 Show ByteString 
Instance details
Defined in Data.ByteString.Internal
 
Methods
showsPrec :: Int -> ByteString -> ShowS #
show :: ByteString -> String #
showList :: [ByteString] -> ShowS #
 Show PixelYA8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelYA8 -> ShowS #
show :: PixelYA8 -> String #
showList :: [PixelYA8] -> ShowS #
 Show PixelYA16 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelYA16 -> ShowS #
show :: PixelYA16 -> String #
showList :: [PixelYA16] -> ShowS #
 Show PixelRGB8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelRGB8 -> ShowS #
show :: PixelRGB8 -> String #
showList :: [PixelRGB8] -> ShowS #
 Show PixelYCbCrK8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelYCbCrK8 -> ShowS #
show :: PixelYCbCrK8 -> String #
showList :: [PixelYCbCrK8] -> ShowS #
 Show PixelRGB16 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelRGB16 -> ShowS #
show :: PixelRGB16 -> String #
showList :: [PixelRGB16] -> ShowS #
 Show PixelRGBF 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelRGBF -> ShowS #
show :: PixelRGBF -> String #
showList :: [PixelRGBF] -> ShowS #
 Show PixelYCbCr8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelYCbCr8 -> ShowS #
show :: PixelYCbCr8 -> String #
showList :: [PixelYCbCr8] -> ShowS #
 Show PixelCMYK8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelCMYK8 -> ShowS #
show :: PixelCMYK8 -> String #
showList :: [PixelCMYK8] -> ShowS #
 Show PixelCMYK16 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelCMYK16 -> ShowS #
show :: PixelCMYK16 -> String #
showList :: [PixelCMYK16] -> ShowS #
 Show PixelRGBA8 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelRGBA8 -> ShowS #
show :: PixelRGBA8 -> String #
showList :: [PixelRGBA8] -> ShowS #
 Show PixelRGBA16 
Instance details
Defined in Codec.Picture.Types
 
Methods
showsPrec :: Int -> PixelRGBA16 -> ShowS #
show :: PixelRGBA16 -> String #
showList :: [PixelRGBA16] -> ShowS #
 Show Fd 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> Fd -> ShowS #
show :: Fd -> String #
showList :: [Fd] -> ShowS #
 Show CTimer 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CTimer -> ShowS #
show :: CTimer -> String #
showList :: [CTimer] -> ShowS #
 Show CKey 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CKey -> ShowS #
show :: CKey -> String #
showList :: [CKey] -> ShowS #
 Show CId 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CId -> ShowS #
show :: CId -> String #
showList :: [CId] -> ShowS #
 Show CFsFilCnt 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CFsFilCnt -> ShowS #
show :: CFsFilCnt -> String #
showList :: [CFsFilCnt] -> ShowS #
 Show CFsBlkCnt 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CFsBlkCnt -> ShowS #
show :: CFsBlkCnt -> String #
showList :: [CFsBlkCnt] -> ShowS #
 Show CClockId 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CClockId -> ShowS #
show :: CClockId -> String #
showList :: [CClockId] -> ShowS #
 Show CBlkCnt 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CBlkCnt -> ShowS #
show :: CBlkCnt -> String #
showList :: [CBlkCnt] -> ShowS #
 Show CBlkSize 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CBlkSize -> ShowS #
show :: CBlkSize -> String #
showList :: [CBlkSize] -> ShowS #
 Show CRLim 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CRLim -> ShowS #
show :: CRLim -> String #
showList :: [CRLim] -> ShowS #
 Show CTcflag 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CTcflag -> ShowS #
show :: CTcflag -> String #
showList :: [CTcflag] -> ShowS #
 Show CSpeed 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CSpeed -> ShowS #
show :: CSpeed -> String #
showList :: [CSpeed] -> ShowS #
 Show CCc 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CCc -> ShowS #
show :: CCc -> String #
showList :: [CCc] -> ShowS #
 Show CUid 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CUid -> ShowS #
show :: CUid -> String #
showList :: [CUid] -> ShowS #
 Show CNlink 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CNlink -> ShowS #
show :: CNlink -> String #
showList :: [CNlink] -> ShowS #
 Show CGid 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CGid -> ShowS #
show :: CGid -> String #
showList :: [CGid] -> ShowS #
 Show CSsize 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CSsize -> ShowS #
show :: CSsize -> String #
showList :: [CSsize] -> ShowS #
 Show CPid 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CPid -> ShowS #
show :: CPid -> String #
showList :: [CPid] -> ShowS #
 Show COff 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> COff -> ShowS #
show :: COff -> String #
showList :: [COff] -> ShowS #
 Show CMode 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CMode -> ShowS #
show :: CMode -> String #
showList :: [CMode] -> ShowS #
 Show CIno 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CIno -> ShowS #
show :: CIno -> String #
showList :: [CIno] -> ShowS #
 Show CDev 
Instance details
Defined in System.Posix.Types
 
Methods
showsPrec :: Int -> CDev -> ShowS #
show :: CDev -> String #
showList :: [CDev] -> ShowS #
 Show IOMode
Since: base-4.2.0.0
Instance details
Defined in GHC.IO.IOMode
 
Methods
showsPrec :: Int -> IOMode -> ShowS #
show :: IOMode -> String #
showList :: [IOMode] -> ShowS #
 Show StdGen 
Instance details
Defined in System.Random
 
Methods
showsPrec :: Int -> StdGen -> ShowS #
show :: StdGen -> String #
showList :: [StdGen] -> ShowS #
 Show Con 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Con -> ShowS #
show :: Con -> String #
showList :: [Con] -> ShowS #
 Show ByteString 
Instance details
Defined in Data.ByteString.Lazy.Internal
 
Methods
showsPrec :: Int -> ByteString -> ShowS #
show :: ByteString -> String #
showList :: [ByteString] -> ShowS #
 Show Scientific
See formatScientific if you need more control over the rendering.
Instance details
Defined in Data.Scientific
 
Methods
showsPrec :: Int -> Scientific -> ShowS #
show :: Scientific -> String #
showList :: [Scientific] -> ShowS #
 Show JSONPathElement 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> JSONPathElement -> ShowS #
show :: JSONPathElement -> String #
showList :: [JSONPathElement] -> ShowS #
 Show Value 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> Value -> ShowS #
show :: Value -> String #
showList :: [Value] -> ShowS #
 Show DotNetTime 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> DotNetTime -> ShowS #
show :: DotNetTime -> String #
showList :: [DotNetTime] -> ShowS #
 Show Options 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> Options -> ShowS #
show :: Options -> String #
showList :: [Options] -> ShowS #
 Show SumEncoding 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> SumEncoding -> ShowS #
show :: SumEncoding -> String #
showList :: [SumEncoding] -> ShowS #
 Show Handle
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Handle.Types
 
Methods
showsPrec :: Int -> Handle -> ShowS #
show :: Handle -> String #
showList :: [Handle] -> ShowS #
 Show Pos 
Instance details
Defined in Data.Attoparsec.Internal.Types
 
Methods
showsPrec :: Int -> Pos -> ShowS #
show :: Pos -> String #
showList :: [Pos] -> ShowS #
 Show More 
Instance details
Defined in Data.Attoparsec.Internal.Types
 
Methods
showsPrec :: Int -> More -> ShowS #
show :: More -> String #
showList :: [More] -> ShowS #
 Show HandleType
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Handle.Types
 
Methods
showsPrec :: Int -> HandleType -> ShowS #
show :: HandleType -> String #
showList :: [HandleType] -> ShowS #
 Show Void
Since: base-4.8.0.0
Instance details
Defined in Data.Void
 
Methods
showsPrec :: Int -> Void -> ShowS #
show :: Void -> String #
showList :: [Void] -> ShowS #
 Show Version
Since: base-2.1
Instance details
Defined in Data.Version
 
Methods
showsPrec :: Int -> Version -> ShowS #
show :: Version -> String #
showList :: [Version] -> ShowS #
 Show HandlePosn
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Handle
 
Methods
showsPrec :: Int -> HandlePosn -> ShowS #
show :: HandlePosn -> String #
showList :: [HandlePosn] -> ShowS #
 Show PatternMatchFail
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> PatternMatchFail -> ShowS #
show :: PatternMatchFail -> String #
showList :: [PatternMatchFail] -> ShowS #
 Show RecSelError
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> RecSelError -> ShowS #
show :: RecSelError -> String #
showList :: [RecSelError] -> ShowS #
 Show RecConError
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> RecConError -> ShowS #
show :: RecConError -> String #
showList :: [RecConError] -> ShowS #
 Show RecUpdError
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> RecUpdError -> ShowS #
show :: RecUpdError -> String #
showList :: [RecUpdError] -> ShowS #
 Show NoMethodError
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> NoMethodError -> ShowS #
show :: NoMethodError -> String #
showList :: [NoMethodError] -> ShowS #
 Show TypeError
Since: base-4.9.0.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> TypeError -> ShowS #
show :: TypeError -> String #
showList :: [TypeError] -> ShowS #
 Show NonTermination
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> NonTermination -> ShowS #
show :: NonTermination -> String #
showList :: [NonTermination] -> ShowS #
 Show NestedAtomically
Since: base-4.0
Instance details
Defined in Control.Exception.Base
 
Methods
showsPrec :: Int -> NestedAtomically -> ShowS #
show :: NestedAtomically -> String #
showList :: [NestedAtomically] -> ShowS #
 Show BlockedIndefinitelyOnMVar
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> BlockedIndefinitelyOnMVar -> ShowS #
show :: BlockedIndefinitelyOnMVar -> String #
showList :: [BlockedIndefinitelyOnMVar] -> ShowS #
 Show BlockedIndefinitelyOnSTM
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> BlockedIndefinitelyOnSTM -> ShowS #
show :: BlockedIndefinitelyOnSTM -> String #
showList :: [BlockedIndefinitelyOnSTM] -> ShowS #
 Show Deadlock
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> Deadlock -> ShowS #
show :: Deadlock -> String #
showList :: [Deadlock] -> ShowS #
 Show AllocationLimitExceeded
Since: base-4.7.1.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> AllocationLimitExceeded -> ShowS #
show :: AllocationLimitExceeded -> String #
showList :: [AllocationLimitExceeded] -> ShowS #
 Show CompactionFailed
Since: base-4.10.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> CompactionFailed -> ShowS #
show :: CompactionFailed -> String #
showList :: [CompactionFailed] -> ShowS #
 Show AssertionFailed
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> AssertionFailed -> ShowS #
show :: AssertionFailed -> String #
showList :: [AssertionFailed] -> ShowS #
 Show SomeAsyncException
Since: base-4.7.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> SomeAsyncException -> ShowS #
show :: SomeAsyncException -> String #
showList :: [SomeAsyncException] -> ShowS #
 Show AsyncException
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> AsyncException -> ShowS #
show :: AsyncException -> String #
showList :: [AsyncException] -> ShowS #
 Show ArrayException
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> ArrayException -> ShowS #
show :: ArrayException -> String #
showList :: [ArrayException] -> ShowS #
 Show FixIOException
Since: base-4.11.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> FixIOException -> ShowS #
show :: FixIOException -> String #
showList :: [FixIOException] -> ShowS #
 Show ExitCode 
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> ExitCode -> ShowS #
show :: ExitCode -> String #
showList :: [ExitCode] -> ShowS #
 Show IOErrorType
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> IOErrorType -> ShowS #
show :: IOErrorType -> String #
showList :: [IOErrorType] -> ShowS #
 Show BufferMode
Since: base-4.2.0.0
Instance details
Defined in GHC.IO.Handle.Types
 
Methods
showsPrec :: Int -> BufferMode -> ShowS #
show :: BufferMode -> String #
showList :: [BufferMode] -> ShowS #
 Show Newline
Since: base-4.3.0.0
Instance details
Defined in GHC.IO.Handle.Types
 
Methods
showsPrec :: Int -> Newline -> ShowS #
show :: Newline -> String #
showList :: [Newline] -> ShowS #
 Show NewlineMode
Since: base-4.3.0.0
Instance details
Defined in GHC.IO.Handle.Types
 
Methods
showsPrec :: Int -> NewlineMode -> ShowS #
show :: NewlineMode -> String #
showList :: [NewlineMode] -> ShowS #
 Show SeekMode
Since: base-4.2.0.0
Instance details
Defined in GHC.IO.Device
 
Methods
showsPrec :: Int -> SeekMode -> ShowS #
show :: SeekMode -> String #
showList :: [SeekMode] -> ShowS #
 Show TextEncoding
Since: base-4.3.0.0
Instance details
Defined in GHC.IO.Encoding.Types
 
Methods
showsPrec :: Int -> TextEncoding -> ShowS #
show :: TextEncoding -> String #
showList :: [TextEncoding] -> ShowS #
 Show CodingProgress
Since: base-4.4.0.0
Instance details
Defined in GHC.IO.Encoding.Types
 
Methods
showsPrec :: Int -> CodingProgress -> ShowS #
show :: CodingProgress -> String #
showList :: [CodingProgress] -> ShowS #
 Show MaskingState
Since: base-4.3.0.0
Instance details
Defined in GHC.IO
 
Methods
showsPrec :: Int -> MaskingState -> ShowS #
show :: MaskingState -> String #
showList :: [MaskingState] -> ShowS #
 Show IOException
Since: base-4.1.0.0
Instance details
Defined in GHC.IO.Exception
 
Methods
showsPrec :: Int -> IOException -> ShowS #
show :: IOException -> String #
showList :: [IOException] -> ShowS #
 Show ErrorCall
Since: base-4.0.0.0
Instance details
Defined in GHC.Exception
 
Methods
showsPrec :: Int -> ErrorCall -> ShowS #
show :: ErrorCall -> String #
showList :: [ErrorCall] -> ShowS #
 Show ArithException
Since: base-4.0.0.0
Instance details
Defined in GHC.Exception.Type
 
Methods
showsPrec :: Int -> ArithException -> ShowS #
show :: ArithException -> String #
showList :: [ArithException] -> ShowS #
 Show All
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> All -> ShowS #
show :: All -> String #
showList :: [All] -> ShowS #
 Show Any
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> Any -> ShowS #
show :: Any -> String #
showList :: [Any] -> ShowS #
 Show Fixity
Since: base-4.6.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> Fixity -> ShowS #
show :: Fixity -> String #
showList :: [Fixity] -> ShowS #
 Show Associativity
Since: base-4.6.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> Associativity -> ShowS #
show :: Associativity -> String #
showList :: [Associativity] -> ShowS #
 Show SourceUnpackedness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> SourceUnpackedness -> ShowS #
show :: SourceUnpackedness -> String #
showList :: [SourceUnpackedness] -> ShowS #
 Show SourceStrictness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> SourceStrictness -> ShowS #
show :: SourceStrictness -> String #
showList :: [SourceStrictness] -> ShowS #
 Show DecidedStrictness
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> DecidedStrictness -> ShowS #
show :: DecidedStrictness -> String #
showList :: [DecidedStrictness] -> ShowS #
 Show SomeNat
Since: base-4.7.0.0
Instance details
Defined in GHC.TypeNats
 
Methods
showsPrec :: Int -> SomeNat -> ShowS #
show :: SomeNat -> String #
showList :: [SomeNat] -> ShowS #
 Show CChar 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CChar -> ShowS #
show :: CChar -> String #
showList :: [CChar] -> ShowS #
 Show CSChar 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CSChar -> ShowS #
show :: CSChar -> String #
showList :: [CSChar] -> ShowS #
 Show CUChar 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUChar -> ShowS #
show :: CUChar -> String #
showList :: [CUChar] -> ShowS #
 Show CShort 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CShort -> ShowS #
show :: CShort -> String #
showList :: [CShort] -> ShowS #
 Show CUShort 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUShort -> ShowS #
show :: CUShort -> String #
showList :: [CUShort] -> ShowS #
 Show CInt 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CInt -> ShowS #
show :: CInt -> String #
showList :: [CInt] -> ShowS #
 Show CUInt 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUInt -> ShowS #
show :: CUInt -> String #
showList :: [CUInt] -> ShowS #
 Show CLong 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CLong -> ShowS #
show :: CLong -> String #
showList :: [CLong] -> ShowS #
 Show CULong 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CULong -> ShowS #
show :: CULong -> String #
showList :: [CULong] -> ShowS #
 Show CLLong 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CLLong -> ShowS #
show :: CLLong -> String #
showList :: [CLLong] -> ShowS #
 Show CULLong 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CULLong -> ShowS #
show :: CULLong -> String #
showList :: [CULLong] -> ShowS #
 Show CBool 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CBool -> ShowS #
show :: CBool -> String #
showList :: [CBool] -> ShowS #
 Show CFloat 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CFloat -> ShowS #
show :: CFloat -> String #
showList :: [CFloat] -> ShowS #
 Show CDouble 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CDouble -> ShowS #
show :: CDouble -> String #
showList :: [CDouble] -> ShowS #
 Show CPtrdiff 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CPtrdiff -> ShowS #
show :: CPtrdiff -> String #
showList :: [CPtrdiff] -> ShowS #
 Show CSize 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CSize -> ShowS #
show :: CSize -> String #
showList :: [CSize] -> ShowS #
 Show CWchar 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CWchar -> ShowS #
show :: CWchar -> String #
showList :: [CWchar] -> ShowS #
 Show CSigAtomic 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CSigAtomic -> ShowS #
show :: CSigAtomic -> String #
showList :: [CSigAtomic] -> ShowS #
 Show CClock 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CClock -> ShowS #
show :: CClock -> String #
showList :: [CClock] -> ShowS #
 Show CTime 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CTime -> ShowS #
show :: CTime -> String #
showList :: [CTime] -> ShowS #
 Show CUSeconds 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUSeconds -> ShowS #
show :: CUSeconds -> String #
showList :: [CUSeconds] -> ShowS #
 Show CSUSeconds 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CSUSeconds -> ShowS #
show :: CSUSeconds -> String #
showList :: [CSUSeconds] -> ShowS #
 Show CIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CIntPtr -> ShowS #
show :: CIntPtr -> String #
showList :: [CIntPtr] -> ShowS #
 Show CUIntPtr 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUIntPtr -> ShowS #
show :: CUIntPtr -> String #
showList :: [CUIntPtr] -> ShowS #
 Show CIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CIntMax -> ShowS #
show :: CIntMax -> String #
showList :: [CIntMax] -> ShowS #
 Show CUIntMax 
Instance details
Defined in Foreign.C.Types
 
Methods
showsPrec :: Int -> CUIntMax -> ShowS #
show :: CUIntMax -> String #
showList :: [CUIntMax] -> ShowS #
 Show Lexeme
Since: base-2.1
Instance details
Defined in Text.Read.Lex
 
Methods
showsPrec :: Int -> Lexeme -> ShowS #
show :: Lexeme -> String #
showList :: [Lexeme] -> ShowS #
 Show Number
Since: base-4.6.0.0
Instance details
Defined in Text.Read.Lex
 
Methods
showsPrec :: Int -> Number -> ShowS #
show :: Number -> String #
showList :: [Number] -> ShowS #
 Show GeneralCategory
Since: base-2.1
Instance details
Defined in GHC.Unicode
 
Methods
showsPrec :: Int -> GeneralCategory -> ShowS #
show :: GeneralCategory -> String #
showList :: [GeneralCategory] -> ShowS #
 Show SrcLoc
Since: base-4.9.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> SrcLoc -> ShowS #
show :: SrcLoc -> String #
showList :: [SrcLoc] -> ShowS #
 Show SomeException
Since: base-3.0
Instance details
Defined in GHC.Exception.Type
 
Methods
showsPrec :: Int -> SomeException -> ShowS #
show :: SomeException -> String #
showList :: [SomeException] -> ShowS #
 Show ASCII7_Invalid 
Instance details
Defined in Basement.String.Encoding.ASCII7
 
Methods
showsPrec :: Int -> ASCII7_Invalid -> ShowS #
show :: ASCII7_Invalid -> String #
showList :: [ASCII7_Invalid] -> ShowS #
 Show ISO_8859_1_Invalid 
Instance details
Defined in Basement.String.Encoding.ISO_8859_1
 
Methods
showsPrec :: Int -> ISO_8859_1_Invalid -> ShowS #
show :: ISO_8859_1_Invalid -> String #
showList :: [ISO_8859_1_Invalid] -> ShowS #
 Show UTF16_Invalid 
Instance details
Defined in Basement.String.Encoding.UTF16
 
Methods
showsPrec :: Int -> UTF16_Invalid -> ShowS #
show :: UTF16_Invalid -> String #
showList :: [UTF16_Invalid] -> ShowS #
 Show UTF32_Invalid 
Instance details
Defined in Basement.String.Encoding.UTF32
 
Methods
showsPrec :: Int -> UTF32_Invalid -> ShowS #
show :: UTF32_Invalid -> String #
showList :: [UTF32_Invalid] -> ShowS #
 Show Encoding 
Instance details
Defined in Basement.String
 
Methods
showsPrec :: Int -> Encoding -> ShowS #
show :: Encoding -> String #
showList :: [Encoding] -> ShowS #
 Show String 
Instance details
Defined in Basement.UTF8.Base
 
Methods
showsPrec :: Int -> String -> ShowS #
show :: String -> String0 #
showList :: [String] -> ShowS #
 Show FileSize 
Instance details
Defined in Basement.Types.OffsetSize
 
Methods
showsPrec :: Int -> FileSize -> ShowS #
show :: FileSize -> String #
showList :: [FileSize] -> ShowS #
 Show BimapException 
Instance details
Defined in Data.Bimap
 
Methods
showsPrec :: Int -> BimapException -> ShowS #
show :: BimapException -> String #
showList :: [BimapException] -> ShowS #
 Show Quoting 
Instance details
Defined in Data.Csv.Encoding
 
Methods
showsPrec :: Int -> Quoting -> ShowS #
show :: Quoting -> String #
showList :: [Quoting] -> ShowS #
 Show EncodeOptions 
Instance details
Defined in Data.Csv.Encoding
 
Methods
showsPrec :: Int -> EncodeOptions -> ShowS #
show :: EncodeOptions -> String #
showList :: [EncodeOptions] -> ShowS #
 Show Options 
Instance details
Defined in Data.Csv.Conversion
 
Methods
showsPrec :: Int -> Options -> ShowS #
show :: Options -> String #
showList :: [Options] -> ShowS #
 Show IntSet 
Instance details
Defined in Data.IntSet.Internal
 
Methods
showsPrec :: Int -> IntSet -> ShowS #
show :: IntSet -> String #
showList :: [IntSet] -> ShowS #
 Show Whirlpool 
Instance details
Defined in Crypto.Hash.Whirlpool
 
Methods
showsPrec :: Int -> Whirlpool -> ShowS #
show :: Whirlpool -> String #
showList :: [Whirlpool] -> ShowS #
 Show Tiger 
Instance details
Defined in Crypto.Hash.Tiger
 
Methods
showsPrec :: Int -> Tiger -> ShowS #
show :: Tiger -> String #
showList :: [Tiger] -> ShowS #
 Show Skein512_512 
Instance details
Defined in Crypto.Hash.Skein512
 
Methods
showsPrec :: Int -> Skein512_512 -> ShowS #
show :: Skein512_512 -> String #
showList :: [Skein512_512] -> ShowS #
 Show Skein512_384 
Instance details
Defined in Crypto.Hash.Skein512
 
Methods
showsPrec :: Int -> Skein512_384 -> ShowS #
show :: Skein512_384 -> String #
showList :: [Skein512_384] -> ShowS #
 Show Skein512_256 
Instance details
Defined in Crypto.Hash.Skein512
 
Methods
showsPrec :: Int -> Skein512_256 -> ShowS #
show :: Skein512_256 -> String #
showList :: [Skein512_256] -> ShowS #
 Show Skein512_224 
Instance details
Defined in Crypto.Hash.Skein512
 
Methods
showsPrec :: Int -> Skein512_224 -> ShowS #
show :: Skein512_224 -> String #
showList :: [Skein512_224] -> ShowS #
 Show Skein256_256 
Instance details
Defined in Crypto.Hash.Skein256
 
Methods
showsPrec :: Int -> Skein256_256 -> ShowS #
show :: Skein256_256 -> String #
showList :: [Skein256_256] -> ShowS #
 Show Skein256_224 
Instance details
Defined in Crypto.Hash.Skein256
 
Methods
showsPrec :: Int -> Skein256_224 -> ShowS #
show :: Skein256_224 -> String #
showList :: [Skein256_224] -> ShowS #
 Show SHA512 
Instance details
Defined in Crypto.Hash.SHA512
 
Methods
showsPrec :: Int -> SHA512 -> ShowS #
show :: SHA512 -> String #
showList :: [SHA512] -> ShowS #
 Show SHA384 
Instance details
Defined in Crypto.Hash.SHA384
 
Methods
showsPrec :: Int -> SHA384 -> ShowS #
show :: SHA384 -> String #
showList :: [SHA384] -> ShowS #
 Show SHA3_512 
Instance details
Defined in Crypto.Hash.SHA3
 
Methods
showsPrec :: Int -> SHA3_512 -> ShowS #
show :: SHA3_512 -> String #
showList :: [SHA3_512] -> ShowS #
 Show SHA3_384 
Instance details
Defined in Crypto.Hash.SHA3
 
Methods
showsPrec :: Int -> SHA3_384 -> ShowS #
show :: SHA3_384 -> String #
showList :: [SHA3_384] -> ShowS #
 Show SHA3_256 
Instance details
Defined in Crypto.Hash.SHA3
 
Methods
showsPrec :: Int -> SHA3_256 -> ShowS #
show :: SHA3_256 -> String #
showList :: [SHA3_256] -> ShowS #
 Show SHA3_224 
Instance details
Defined in Crypto.Hash.SHA3
 
Methods
showsPrec :: Int -> SHA3_224 -> ShowS #
show :: SHA3_224 -> String #
showList :: [SHA3_224] -> ShowS #
 Show SHA256 
Instance details
Defined in Crypto.Hash.SHA256
 
Methods
showsPrec :: Int -> SHA256 -> ShowS #
show :: SHA256 -> String #
showList :: [SHA256] -> ShowS #
 Show SHA224 
Instance details
Defined in Crypto.Hash.SHA224
 
Methods
showsPrec :: Int -> SHA224 -> ShowS #
show :: SHA224 -> String #
showList :: [SHA224] -> ShowS #
 Show SHA1 
Instance details
Defined in Crypto.Hash.SHA1
 
Methods
showsPrec :: Int -> SHA1 -> ShowS #
show :: SHA1 -> String #
showList :: [SHA1] -> ShowS #
 Show RIPEMD160 
Instance details
Defined in Crypto.Hash.RIPEMD160
 
Methods
showsPrec :: Int -> RIPEMD160 -> ShowS #
show :: RIPEMD160 -> String #
showList :: [RIPEMD160] -> ShowS #
 Show MD5 
Instance details
Defined in Crypto.Hash.MD5
 
Methods
showsPrec :: Int -> MD5 -> ShowS #
show :: MD5 -> String #
showList :: [MD5] -> ShowS #
 Show MD4 
Instance details
Defined in Crypto.Hash.MD4
 
Methods
showsPrec :: Int -> MD4 -> ShowS #
show :: MD4 -> String #
showList :: [MD4] -> ShowS #
 Show MD2 
Instance details
Defined in Crypto.Hash.MD2
 
Methods
showsPrec :: Int -> MD2 -> ShowS #
show :: MD2 -> String #
showList :: [MD2] -> ShowS #
 Show Blake2b_160 
Instance details
Defined in Crypto.Hash.Blake2b
 
Methods
showsPrec :: Int -> Blake2b_160 -> ShowS #
show :: Blake2b_160 -> String #
showList :: [Blake2b_160] -> ShowS #
 Show Blake2b_224 
Instance details
Defined in Crypto.Hash.Blake2b
 
Methods
showsPrec :: Int -> Blake2b_224 -> ShowS #
show :: Blake2b_224 -> String #
showList :: [Blake2b_224] -> ShowS #
 Show Blake2b_256 
Instance details
Defined in Crypto.Hash.Blake2b
 
Methods
showsPrec :: Int -> Blake2b_256 -> ShowS #
show :: Blake2b_256 -> String #
showList :: [Blake2b_256] -> ShowS #
 Show Blake2b_384 
Instance details
Defined in Crypto.Hash.Blake2b
 
Methods
showsPrec :: Int -> Blake2b_384 -> ShowS #
show :: Blake2b_384 -> String #
showList :: [Blake2b_384] -> ShowS #
 Show Blake2b_512 
Instance details
Defined in Crypto.Hash.Blake2b
 
Methods
showsPrec :: Int -> Blake2b_512 -> ShowS #
show :: Blake2b_512 -> String #
showList :: [Blake2b_512] -> ShowS #
 Show Blake2bp_512 
Instance details
Defined in Crypto.Hash.Blake2bp
 
Methods
showsPrec :: Int -> Blake2bp_512 -> ShowS #
show :: Blake2bp_512 -> String #
showList :: [Blake2bp_512] -> ShowS #
 Show Blake2s_160 
Instance details
Defined in Crypto.Hash.Blake2s
 
Methods
showsPrec :: Int -> Blake2s_160 -> ShowS #
show :: Blake2s_160 -> String #
showList :: [Blake2s_160] -> ShowS #
 Show Blake2s_224 
Instance details
Defined in Crypto.Hash.Blake2s
 
Methods
showsPrec :: Int -> Blake2s_224 -> ShowS #
show :: Blake2s_224 -> String #
showList :: [Blake2s_224] -> ShowS #
 Show Blake2s_256 
Instance details
Defined in Crypto.Hash.Blake2s
 
Methods
showsPrec :: Int -> Blake2s_256 -> ShowS #
show :: Blake2s_256 -> String #
showList :: [Blake2s_256] -> ShowS #
 Show Blake2sp_224 
Instance details
Defined in Crypto.Hash.Blake2sp
 
Methods
showsPrec :: Int -> Blake2sp_224 -> ShowS #
show :: Blake2sp_224 -> String #
showList :: [Blake2sp_224] -> ShowS #
 Show Blake2sp_256 
Instance details
Defined in Crypto.Hash.Blake2sp
 
Methods
showsPrec :: Int -> Blake2sp_256 -> ShowS #
show :: Blake2sp_256 -> String #
showList :: [Blake2sp_256] -> ShowS #
 Show Keccak_224 
Instance details
Defined in Crypto.Hash.Keccak
 
Methods
showsPrec :: Int -> Keccak_224 -> ShowS #
show :: Keccak_224 -> String #
showList :: [Keccak_224] -> ShowS #
 Show Keccak_256 
Instance details
Defined in Crypto.Hash.Keccak
 
Methods
showsPrec :: Int -> Keccak_256 -> ShowS #
show :: Keccak_256 -> String #
showList :: [Keccak_256] -> ShowS #
 Show Keccak_384 
Instance details
Defined in Crypto.Hash.Keccak
 
Methods
showsPrec :: Int -> Keccak_384 -> ShowS #
show :: Keccak_384 -> String #
showList :: [Keccak_384] -> ShowS #
 Show Keccak_512 
Instance details
Defined in Crypto.Hash.Keccak
 
Methods
showsPrec :: Int -> Keccak_512 -> ShowS #
show :: Keccak_512 -> String #
showList :: [Keccak_512] -> ShowS #
 Show SHA512t_224 
Instance details
Defined in Crypto.Hash.SHA512t
 
Methods
showsPrec :: Int -> SHA512t_224 -> ShowS #
show :: SHA512t_224 -> String #
showList :: [SHA512t_224] -> ShowS #
 Show SHA512t_256 
Instance details
Defined in Crypto.Hash.SHA512t
 
Methods
showsPrec :: Int -> SHA512t_256 -> ShowS #
show :: SHA512t_256 -> String #
showList :: [SHA512t_256] -> ShowS #
 Show FileType 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
showsPrec :: Int -> FileType -> ShowS #
show :: FileType -> String #
showList :: [FileType] -> ShowS #
 Show Permissions 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
showsPrec :: Int -> Permissions -> ShowS #
show :: Permissions -> String #
showList :: [Permissions] -> ShowS #
 Show XdgDirectory 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
showsPrec :: Int -> XdgDirectory -> ShowS #
show :: XdgDirectory -> String #
showList :: [XdgDirectory] -> ShowS #
 Show XdgDirectoryList 
Instance details
Defined in System.Directory.Internal.Common
 
Methods
showsPrec :: Int -> XdgDirectoryList -> ShowS #
show :: XdgDirectoryList -> String #
showList :: [XdgDirectoryList] -> ShowS #
 Show StdStream 
Instance details
Defined in System.Process.Common
 
Methods
showsPrec :: Int -> StdStream -> ShowS #
show :: StdStream -> String #
showList :: [StdStream] -> ShowS #
 Show CmdSpec 
Instance details
Defined in System.Process.Common
 
Methods
showsPrec :: Int -> CmdSpec -> ShowS #
show :: CmdSpec -> String #
showList :: [CmdSpec] -> ShowS #
 Show CreateProcess 
Instance details
Defined in System.Process.Common
 
Methods
showsPrec :: Int -> CreateProcess -> ShowS #
show :: CreateProcess -> String #
showList :: [CreateProcess] -> ShowS #
 Show Extension 
Instance details
Defined in GHC.LanguageExtensions.Type
 
Methods
showsPrec :: Int -> Extension -> ShowS #
show :: Extension -> String #
showList :: [Extension] -> ShowS #
 Show ForeignSrcLang 
Instance details
Defined in GHC.ForeignSrcLang.Type
 
Methods
showsPrec :: Int -> ForeignSrcLang -> ShowS #
show :: ForeignSrcLang -> String #
showList :: [ForeignSrcLang] -> ShowS #
 Show Extractor 
Instance details
Defined in Internal.Element
 
Methods
showsPrec :: Int -> Extractor -> ShowS #
show :: Extractor -> String #
showList :: [Extractor] -> ShowS #
 Show MatrixOrder 
Instance details
Defined in Internal.Matrix
 
Methods
showsPrec :: Int -> MatrixOrder -> ShowS #
show :: MatrixOrder -> String #
showList :: [MatrixOrder] -> ShowS #
 Show LogFloat 
Instance details
Defined in Data.Number.LogFloat
 
Methods
showsPrec :: Int -> LogFloat -> ShowS #
show :: LogFloat -> String #
showList :: [LogFloat] -> ShowS #
 Show TimeLocale 
Instance details
Defined in System.Locale
 
Methods
showsPrec :: Int -> TimeLocale -> ShowS #
show :: TimeLocale -> String #
showList :: [TimeLocale] -> ShowS #
 Show Doc 
Instance details
Defined in Text.PrettyPrint.HughesPJ
 
Methods
showsPrec :: Int -> Doc -> ShowS #
show :: Doc -> String #
showList :: [Doc] -> ShowS #
 Show TextDetails 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> TextDetails -> ShowS #
show :: TextDetails -> String #
showList :: [TextDetails] -> ShowS #
 Show Style 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> Style -> ShowS #
show :: Style -> String #
showList :: [Style] -> ShowS #
 Show Mode 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> Mode -> ShowS #
show :: Mode -> String #
showList :: [Mode] -> ShowS #
 Show ByteArray
Since: primitive-0.6.3.0
Instance details
Defined in Data.Primitive.ByteArray
 
Methods
showsPrec :: Int -> ByteArray -> ShowS #
show :: ByteArray -> String #
showList :: [ByteArray] -> ShowS #
 Show Addr 
Instance details
Defined in Data.Primitive.Types
 
Methods
showsPrec :: Int -> Addr -> ShowS #
show :: Addr -> String #
showList :: [Addr] -> ShowS #
 Show Root 
Instance details
Defined in Filesystem.Path.Internal
 
Methods
showsPrec :: Int -> Root -> ShowS #
show :: Root -> String #
showList :: [Root] -> ShowS #
 Show ModName 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> ModName -> ShowS #
show :: ModName -> String #
showList :: [ModName] -> ShowS #
 Show PkgName 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> PkgName -> ShowS #
show :: PkgName -> String #
showList :: [PkgName] -> ShowS #
 Show Module 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Module -> ShowS #
show :: Module -> String #
showList :: [Module] -> ShowS #
 Show OccName 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> OccName -> ShowS #
show :: OccName -> String #
showList :: [OccName] -> ShowS #
 Show NameFlavour 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> NameFlavour -> ShowS #
show :: NameFlavour -> String #
showList :: [NameFlavour] -> ShowS #
 Show NameSpace 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> NameSpace -> ShowS #
show :: NameSpace -> String #
showList :: [NameSpace] -> ShowS #
 Show Loc 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Loc -> ShowS #
show :: Loc -> String #
showList :: [Loc] -> ShowS #
 Show Info 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Info -> ShowS #
show :: Info -> String #
showList :: [Info] -> ShowS #
 Show ModuleInfo 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> ModuleInfo -> ShowS #
show :: ModuleInfo -> String #
showList :: [ModuleInfo] -> ShowS #
 Show Fixity 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Fixity -> ShowS #
show :: Fixity -> String #
showList :: [Fixity] -> ShowS #
 Show FixityDirection 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> FixityDirection -> ShowS #
show :: FixityDirection -> String #
showList :: [FixityDirection] -> ShowS #
 Show Lit 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Lit -> ShowS #
show :: Lit -> String #
showList :: [Lit] -> ShowS #
 Show Body 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Body -> ShowS #
show :: Body -> String #
showList :: [Body] -> ShowS #
 Show Guard 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Guard -> ShowS #
show :: Guard -> String #
showList :: [Guard] -> ShowS #
 Show Stmt 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Stmt -> ShowS #
show :: Stmt -> String #
showList :: [Stmt] -> ShowS #
 Show Range 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Range -> ShowS #
show :: Range -> String #
showList :: [Range] -> ShowS #
 Show DerivClause 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> DerivClause -> ShowS #
show :: DerivClause -> String #
showList :: [DerivClause] -> ShowS #
 Show DerivStrategy 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> DerivStrategy -> ShowS #
show :: DerivStrategy -> String #
showList :: [DerivStrategy] -> ShowS #
 Show TypeFamilyHead 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> TypeFamilyHead -> ShowS #
show :: TypeFamilyHead -> String #
showList :: [TypeFamilyHead] -> ShowS #
 Show TySynEqn 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> TySynEqn -> ShowS #
show :: TySynEqn -> String #
showList :: [TySynEqn] -> ShowS #
 Show Foreign 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Foreign -> ShowS #
show :: Foreign -> String #
showList :: [Foreign] -> ShowS #
 Show Callconv 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Callconv -> ShowS #
show :: Callconv -> String #
showList :: [Callconv] -> ShowS #
 Show Safety 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Safety -> ShowS #
show :: Safety -> String #
showList :: [Safety] -> ShowS #
 Show Pragma 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Pragma -> ShowS #
show :: Pragma -> String #
showList :: [Pragma] -> ShowS #
 Show Inline 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Inline -> ShowS #
show :: Inline -> String #
showList :: [Inline] -> ShowS #
 Show RuleMatch 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> RuleMatch -> ShowS #
show :: RuleMatch -> String #
showList :: [RuleMatch] -> ShowS #
 Show Phases 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Phases -> ShowS #
show :: Phases -> String #
showList :: [Phases] -> ShowS #
 Show RuleBndr 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> RuleBndr -> ShowS #
show :: RuleBndr -> String #
showList :: [RuleBndr] -> ShowS #
 Show AnnTarget 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> AnnTarget -> ShowS #
show :: AnnTarget -> String #
showList :: [AnnTarget] -> ShowS #
 Show SourceUnpackedness 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> SourceUnpackedness -> ShowS #
show :: SourceUnpackedness -> String #
showList :: [SourceUnpackedness] -> ShowS #
 Show SourceStrictness 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> SourceStrictness -> ShowS #
show :: SourceStrictness -> String #
showList :: [SourceStrictness] -> ShowS #
 Show DecidedStrictness 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> DecidedStrictness -> ShowS #
show :: DecidedStrictness -> String #
showList :: [DecidedStrictness] -> ShowS #
 Show Bang 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Bang -> ShowS #
show :: Bang -> String #
showList :: [Bang] -> ShowS #
 Show PatSynDir 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> PatSynDir -> ShowS #
show :: PatSynDir -> String #
showList :: [PatSynDir] -> ShowS #
 Show PatSynArgs 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> PatSynArgs -> ShowS #
show :: PatSynArgs -> String #
showList :: [PatSynArgs] -> ShowS #
 Show TyVarBndr 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> TyVarBndr -> ShowS #
show :: TyVarBndr -> String #
showList :: [TyVarBndr] -> ShowS #
 Show FamilyResultSig 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> FamilyResultSig -> ShowS #
show :: FamilyResultSig -> String #
showList :: [FamilyResultSig] -> ShowS #
 Show TyLit 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> TyLit -> ShowS #
show :: TyLit -> String #
showList :: [TyLit] -> ShowS #
 Show Role 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> Role -> ShowS #
show :: Role -> String #
showList :: [Role] -> ShowS #
 Show AnnLookup 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
showsPrec :: Int -> AnnLookup -> ShowS #
show :: AnnLookup -> String #
showList :: [AnnLookup] -> ShowS #
 Show ShortText 
Instance details
Defined in Data.Text.Short.Internal
 
Methods
showsPrec :: Int -> ShortText -> ShowS #
show :: ShortText -> String #
showList :: [ShortText] -> ShowS #
 Show DatatypeInfo 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> DatatypeInfo -> ShowS #
show :: DatatypeInfo -> String #
showList :: [DatatypeInfo] -> ShowS #
 Show DatatypeVariant 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> DatatypeVariant -> ShowS #
show :: DatatypeVariant -> String #
showList :: [DatatypeVariant] -> ShowS #
 Show ConstructorInfo 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> ConstructorInfo -> ShowS #
show :: ConstructorInfo -> String #
showList :: [ConstructorInfo] -> ShowS #
 Show ConstructorVariant 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> ConstructorVariant -> ShowS #
show :: ConstructorVariant -> String #
showList :: [ConstructorVariant] -> ShowS #
 Show FieldStrictness 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> FieldStrictness -> ShowS #
show :: FieldStrictness -> String #
showList :: [FieldStrictness] -> ShowS #
 Show Unpackedness 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> Unpackedness -> ShowS #
show :: Unpackedness -> String #
showList :: [Unpackedness] -> ShowS #
 Show Strictness 
Instance details
Defined in Language.Haskell.TH.Datatype
 
Methods
showsPrec :: Int -> Strictness -> ShowS #
show :: Strictness -> String #
showList :: [Strictness] -> ShowS #
 Show ZonedTime 
Instance details
Defined in Data.Time.LocalTime.Internal.ZonedTime
 
Methods
showsPrec :: Int -> ZonedTime -> ShowS #
show :: ZonedTime -> String #
showList :: [ZonedTime] -> ShowS #
 Show LocalTime 
Instance details
Defined in Data.Time.LocalTime.Internal.LocalTime
 
Methods
showsPrec :: Int -> LocalTime -> ShowS #
show :: LocalTime -> String #
showList :: [LocalTime] -> ShowS #
 Show TimeOfDay 
Instance details
Defined in Data.Time.LocalTime.Internal.TimeOfDay
 
Methods
showsPrec :: Int -> TimeOfDay -> ShowS #
show :: TimeOfDay -> String #
showList :: [TimeOfDay] -> ShowS #
 Show TimeZone 
Instance details
Defined in Data.Time.LocalTime.Internal.TimeZone
 
Methods
showsPrec :: Int -> TimeZone -> ShowS #
show :: TimeZone -> String #
showList :: [TimeZone] -> ShowS #
 Show NominalDiffTime 
Instance details
Defined in Data.Time.Clock.Internal.NominalDiffTime
 
Methods
showsPrec :: Int -> NominalDiffTime -> ShowS #
show :: NominalDiffTime -> String #
showList :: [NominalDiffTime] -> ShowS #
 Show DiffTime 
Instance details
Defined in Data.Time.Clock.Internal.DiffTime
 
Methods
showsPrec :: Int -> DiffTime -> ShowS #
show :: DiffTime -> String #
showList :: [DiffTime] -> ShowS #
 Show UnpackedUUID 
Instance details
Defined in Data.UUID.Types.Internal
 
Methods
showsPrec :: Int -> UnpackedUUID -> ShowS #
show :: UnpackedUUID -> String #
showList :: [UnpackedUUID] -> ShowS #
 Show UUID 
Instance details
Defined in Data.UUID.Types.Internal
 
Methods
showsPrec :: Int -> UUID -> ShowS #
show :: UUID -> String #
showList :: [UUID] -> ShowS #
 Show DictionaryHash 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> DictionaryHash -> ShowS #
show :: DictionaryHash -> String #
showList :: [DictionaryHash] -> ShowS #
 Show Format 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> Format -> ShowS #
show :: Format -> String #
showList :: [Format] -> ShowS #
 Show Method 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> Method -> ShowS #
show :: Method -> String #
showList :: [Method] -> ShowS #
 Show CompressionLevel 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> CompressionLevel -> ShowS #
show :: CompressionLevel -> String #
showList :: [CompressionLevel] -> ShowS #
 Show WindowBits 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> WindowBits -> ShowS #
show :: WindowBits -> String #
showList :: [WindowBits] -> ShowS #
 Show MemoryLevel 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> MemoryLevel -> ShowS #
show :: MemoryLevel -> String #
showList :: [MemoryLevel] -> ShowS #
 Show CompressionStrategy 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
showsPrec :: Int -> CompressionStrategy -> ShowS #
show :: CompressionStrategy -> String #
showList :: [CompressionStrategy] -> ShowS #
 Show DateFormatSpec 
Instance details
Defined in Data.Time.Format.Parse
 
Methods
showsPrec :: Int -> DateFormatSpec -> ShowS #
show :: DateFormatSpec -> String #
showList :: [DateFormatSpec] -> ShowS #
 Show Padding 
Instance details
Defined in Data.Time.Format.Parse
 
Methods
showsPrec :: Int -> Padding -> ShowS #
show :: Padding -> String #
showList :: [Padding] -> ShowS #
 Show NewtonParam 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> NewtonParam -> ShowS #
show :: NewtonParam -> String #
showList :: [NewtonParam] -> ShowS #
 Show NewtonStep 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> NewtonStep -> ShowS #
show :: NewtonStep -> String #
showList :: [NewtonStep] -> ShowS #
 Show RiddersParam 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> RiddersParam -> ShowS #
show :: RiddersParam -> String #
showList :: [RiddersParam] -> ShowS #
 Show RiddersStep 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> RiddersStep -> ShowS #
show :: RiddersStep -> String #
showList :: [RiddersStep] -> ShowS #
 Show Tolerance 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> Tolerance -> ShowS #
show :: Tolerance -> String #
showList :: [Tolerance] -> ShowS #
 Show Seed 
Instance details
Defined in System.Random.MWC
 
Methods
showsPrec :: Int -> Seed -> ShowS #
show :: Seed -> String #
showList :: [Seed] -> ShowS #
 Show ConstVal # 
Instance details
Defined in Data.Expression.Const
 
Methods
showsPrec :: Int -> ConstVal -> ShowS #
show :: ConstVal -> String #
showList :: [ConstVal] -> ShowS #
 Show Color 
Instance details
Defined in Data.List.Extra
 
Methods
showsPrec :: Int -> Color -> ShowS #
show :: Color -> String #
showList :: [Color] -> ShowS #
 Show Type # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> Type -> ShowS #
show :: Type -> String #
showList :: [Type] -> ShowS #
 Show EEnv # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> EEnv -> ShowS #
show :: EEnv -> String #
showList :: [EEnv] -> ShowS #
 Show LVal # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> LVal -> ShowS #
show :: LVal -> String #
showList :: [LVal] -> ShowS #
 Show DExpr # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> DExpr -> ShowS #
show :: DExpr -> String #
showList :: [DExpr] -> ShowS #
 Show NodeRef # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> NodeRef -> ShowS #
show :: NodeRef -> String #
showList :: [NodeRef] -> ShowS #
 Show Id # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> Id -> ShowS #
show :: Id -> String #
showList :: [Id] -> ShowS #
 Show StanHMCMetric # 
Instance details
Defined in Language.Stan
 
Methods
showsPrec :: Int -> StanHMCMetric -> ShowS #
show :: StanHMCMetric -> String #
showList :: [StanHMCMetric] -> ShowS #
 Show StanHMCEngine # 
Instance details
Defined in Language.Stan
 
Methods
showsPrec :: Int -> StanHMCEngine -> ShowS #
show :: StanHMCEngine -> String #
showList :: [StanHMCEngine] -> ShowS #
 Show StanMethod # 
Instance details
Defined in Language.Stan
 
Methods
showsPrec :: Int -> StanMethod -> ShowS #
show :: StanMethod -> String #
showList :: [StanMethod] -> ShowS #
 Show PyMC3Step # 
Instance details
Defined in Language.PyMC3
 
Methods
showsPrec :: Int -> PyMC3Step -> ShowS #
show :: PyMC3Step -> String #
showList :: [PyMC3Step] -> ShowS #
 Show PyMC3Inference # 
Instance details
Defined in Language.PyMC3
 
Methods
showsPrec :: Int -> PyMC3Inference -> ShowS #
show :: PyMC3Inference -> String #
showList :: [PyMC3Inference] -> ShowS #
 Show Cairo 
Instance details
Defined in Diagrams.Backend.Cairo.Internal
 
Methods
showsPrec :: Int -> Cairo -> ShowS #
show :: Cairo -> String #
showList :: [Cairo] -> ShowS #
 Show OutputType 
Instance details
Defined in Diagrams.Backend.Cairo.Internal
 
Methods
showsPrec :: Int -> OutputType -> ShowS #
show :: OutputType -> String #
showList :: [OutputType] -> ShowS #
 Show Annotation 
Instance details
Defined in Diagrams.Core.Types
 
Methods
showsPrec :: Int -> Annotation -> ShowS #
show :: Annotation -> String #
showList :: [Annotation] -> ShowS #
 Show AName 
Instance details
Defined in Diagrams.Core.Names
 
Methods
showsPrec :: Int -> AName -> ShowS #
show :: AName -> String #
showList :: [AName] -> ShowS #
 Show Name 
Instance details
Defined in Diagrams.Core.Names
 
Methods
showsPrec :: Int -> Name -> ShowS #
show :: Name -> String #
showList :: [Name] -> ShowS #
 Show FillRule 
Instance details
Defined in Diagrams.TwoD.Path
 
Methods
showsPrec :: Int -> FillRule -> ShowS #
show :: FillRule -> String #
showList :: [FillRule] -> ShowS #
 Show LogValue 
Instance details
Defined in Graphics.Rendering.Chart.Axis.Floating
 
Methods
showsPrec :: Int -> LogValue -> ShowS #
show :: LogValue -> String #
showList :: [LogValue] -> ShowS #
 Show Percent 
Instance details
Defined in Graphics.Rendering.Chart.Axis.Floating
 
Methods
showsPrec :: Int -> Percent -> ShowS #
show :: Percent -> String #
showList :: [Percent] -> ShowS #
 Show PlotIndex 
Instance details
Defined in Graphics.Rendering.Chart.Axis.Indexed
 
Methods
showsPrec :: Int -> PlotIndex -> ShowS #
show :: PlotIndex -> String #
showList :: [PlotIndex] -> ShowS #
 Show TimeLabelAlignment 
Instance details
Defined in Graphics.Rendering.Chart.Axis.Time
 
Methods
showsPrec :: Int -> TimeLabelAlignment -> ShowS #
show :: TimeLabelAlignment -> String #
showList :: [TimeLabelAlignment] -> ShowS #
 Show FillStyle 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> FillStyle -> ShowS #
show :: FillStyle -> String #
showList :: [FillStyle] -> ShowS #
 Show FontSlant 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> FontSlant -> ShowS #
show :: FontSlant -> String #
showList :: [FontSlant] -> ShowS #
 Show FontStyle 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> FontStyle -> ShowS #
show :: FontStyle -> String #
showList :: [FontStyle] -> ShowS #
 Show FontWeight 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> FontWeight -> ShowS #
show :: FontWeight -> String #
showList :: [FontWeight] -> ShowS #
 Show HTextAnchor 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> HTextAnchor -> ShowS #
show :: HTextAnchor -> String #
showList :: [HTextAnchor] -> ShowS #
 Show LineCap 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> LineCap -> ShowS #
show :: LineCap -> String #
showList :: [LineCap] -> ShowS #
 Show LineJoin 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> LineJoin -> ShowS #
show :: LineJoin -> String #
showList :: [LineJoin] -> ShowS #
 Show LineStyle 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> LineStyle -> ShowS #
show :: LineStyle -> String #
showList :: [LineStyle] -> ShowS #
 Show TextSize 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> TextSize -> ShowS #
show :: TextSize -> String #
showList :: [TextSize] -> ShowS #
 Show VTextAnchor 
Instance details
Defined in Graphics.Rendering.Chart.Backend.Types
 
Methods
showsPrec :: Int -> VTextAnchor -> ShowS #
show :: VTextAnchor -> String #
showList :: [VTextAnchor] -> ShowS #
 Show Matrix 
Instance details
Defined in Graphics.Rendering.Chart.Geometry
 
Methods
showsPrec :: Int -> Matrix -> ShowS #
show :: Matrix -> String #
showList :: [Matrix] -> ShowS #
 Show Point 
Instance details
Defined in Graphics.Rendering.Chart.Geometry
 
Methods
showsPrec :: Int -> Point -> ShowS #
show :: Point -> String #
showList :: [Point] -> ShowS #
 Show Rect 
Instance details
Defined in Graphics.Rendering.Chart.Geometry
 
Methods
showsPrec :: Int -> Rect -> ShowS #
show :: Rect -> String #
showList :: [Rect] -> ShowS #
 Show Vector 
Instance details
Defined in Graphics.Rendering.Chart.Geometry
 
Methods
showsPrec :: Int -> Vector -> ShowS #
show :: Vector -> String #
showList :: [Vector] -> ShowS #
 Show PlotBarsAlignment 
Instance details
Defined in Graphics.Rendering.Chart.Plot.Bars
 
Methods
showsPrec :: Int -> PlotBarsAlignment -> ShowS #
show :: PlotBarsAlignment -> String #
showList :: [PlotBarsAlignment] -> ShowS #
 Show PlotBarsSpacing 
Instance details
Defined in Graphics.Rendering.Chart.Plot.Bars
 
Methods
showsPrec :: Int -> PlotBarsSpacing -> ShowS #
show :: PlotBarsSpacing -> String #
showList :: [PlotBarsSpacing] -> ShowS #
 Show PlotBarsStyle 
Instance details
Defined in Graphics.Rendering.Chart.Plot.Bars
 
Methods
showsPrec :: Int -> PlotBarsStyle -> ShowS #
show :: PlotBarsStyle -> String #
showList :: [PlotBarsStyle] -> ShowS #
 Show DefName 
Instance details
Defined in Control.Lens.Internal.FieldTH
 
Methods
showsPrec :: Int -> DefName -> ShowS #
show :: DefName -> String #
showList :: [DefName] -> ShowS #
 Show LogScale 
Instance details
Defined in Plots.Axis.Scale
 
Methods
showsPrec :: Int -> LogScale -> ShowS #
show :: LogScale -> String #
showList :: [LogScale] -> ShowS #
 Show ScaleMode 
Instance details
Defined in Plots.Axis.Scale
 
Methods
showsPrec :: Int -> ScaleMode -> ShowS #
show :: ScaleMode -> String #
showList :: [ScaleMode] -> ShowS #
 Show UniformScaleStrategy 
Instance details
Defined in Plots.Axis.Scale
 
Methods
showsPrec :: Int -> UniformScaleStrategy -> ShowS #
show :: UniformScaleStrategy -> String #
showList :: [UniformScaleStrategy] -> ShowS #
 Show TicksAlignment 
Instance details
Defined in Plots.Axis.Ticks
 
Methods
showsPrec :: Int -> TicksAlignment -> ShowS #
show :: TicksAlignment -> String #
showList :: [TicksAlignment] -> ShowS #
 Show ColourMap 
Instance details
Defined in Plots.Style
 
Methods
showsPrec :: Int -> ColourMap -> ShowS #
show :: ColourMap -> String #
showList :: [ColourMap] -> ShowS #
 Show NanColours 
Instance details
Defined in Plots.Style
 
Methods
showsPrec :: Int -> NanColours -> ShowS #
show :: NanColours -> String #
showList :: [NanColours] -> ShowS #
 Show Orientation 
Instance details
Defined in Plots.Types
 
Methods
showsPrec :: Int -> Orientation -> ShowS #
show :: Orientation -> String #
showList :: [Orientation] -> ShowS #
 Show Placement 
Instance details
Defined in Plots.Types
 
Methods
showsPrec :: Int -> Placement -> ShowS #
show :: Placement -> String #
showList :: [Placement] -> ShowS #
 Show KBNSum 
Instance details
Defined in Numeric.Sum
 
Methods
showsPrec :: Int -> KBNSum -> ShowS #
show :: KBNSum -> String #
showList :: [KBNSum] -> ShowS #
 Show Points 
Instance details
Defined in Statistics.Sample.KernelDensity.Simple
 
Methods
showsPrec :: Int -> Points -> ShowS #
show :: Points -> String #
showList :: [Points] -> ShowS #
 Show LabelPosition 
Instance details
Defined in Plots.Axis.Render
 
Methods
showsPrec :: Int -> LabelPosition -> ShowS #
show :: LabelPosition -> String #
showList :: [LabelPosition] -> ShowS #
 Show EventVarietyMismatchException 
Instance details
Defined in System.FSNotify.Linux
 
Methods
showsPrec :: Int -> EventVarietyMismatchException -> ShowS #
show :: EventVarietyMismatchException -> String #
showList :: [EventVarietyMismatchException] -> ShowS #
 Show Crossings 
Instance details
Defined in Diagrams.TwoD.Path
 
Methods
showsPrec :: Int -> Crossings -> ShowS #
show :: Crossings -> String #
showList :: [Crossings] -> ShowS #
 Show DiagramAnimOpts 
Instance details
Defined in Diagrams.Backend.CmdLine
 
Methods
showsPrec :: Int -> DiagramAnimOpts -> ShowS #
show :: DiagramAnimOpts -> String #
showList :: [DiagramAnimOpts] -> ShowS #
 Show DiagramMultiOpts 
Instance details
Defined in Diagrams.Backend.CmdLine
 
Methods
showsPrec :: Int -> DiagramMultiOpts -> ShowS #
show :: DiagramMultiOpts -> String #
showList :: [DiagramMultiOpts] -> ShowS #
 Show DiagramOpts 
Instance details
Defined in Diagrams.Backend.CmdLine
 
Methods
showsPrec :: Int -> DiagramOpts -> ShowS #
show :: DiagramOpts -> String #
showList :: [DiagramOpts] -> ShowS #
 Show FontSlant 
Instance details
Defined in Diagrams.TwoD.Text
 
Methods
showsPrec :: Int -> FontSlant -> ShowS #
show :: FontSlant -> String #
showList :: [FontSlant] -> ShowS #
 Show FontWeight 
Instance details
Defined in Diagrams.TwoD.Text
 
Methods
showsPrec :: Int -> FontWeight -> ShowS #
show :: FontWeight -> String #
showList :: [FontWeight] -> ShowS #
 Show AxisLineType 
Instance details
Defined in Plots.Axis.Line
 
Methods
showsPrec :: Int -> AxisLineType -> ShowS #
show :: AxisLineType -> String #
showList :: [AxisLineType] -> ShowS #
 Show EmptyFilePathError 
Instance details
Defined in Shelly.Base
 
Methods
showsPrec :: Int -> EmptyFilePathError -> ShowS #
show :: EmptyFilePathError -> String #
showList :: [EmptyFilePathError] -> ShowS #
 Show LinePass 
Instance details
Defined in Linear.Plucker
 
Methods
showsPrec :: Int -> LinePass -> ShowS #
show :: LinePass -> String #
showList :: [LinePass] -> ShowS #
 Show KB2Sum 
Instance details
Defined in Numeric.Sum
 
Methods
showsPrec :: Int -> KB2Sum -> ShowS #
show :: KB2Sum -> String #
showList :: [KB2Sum] -> ShowS #
 Show KahanSum 
Instance details
Defined in Numeric.Sum
 
Methods
showsPrec :: Int -> KahanSum -> ShowS #
show :: KahanSum -> String #
showList :: [KahanSum] -> ShowS #
 Show a => Show [a]
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> [a] -> ShowS #
show :: [a] -> String #
showList :: [[a]] -> ShowS #
 Show a => Show (Maybe a)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> Maybe a -> ShowS #
show :: Maybe a -> String #
showList :: [Maybe a] -> ShowS #
 Show a => Show (Ratio a)
Since: base-2.0.1
Instance details
Defined in GHC.Real
 
Methods
showsPrec :: Int -> Ratio a -> ShowS #
show :: Ratio a -> String #
showList :: [Ratio a] -> ShowS #
 Show (Ptr a)
Since: base-2.1
Instance details
Defined in GHC.Ptr
 
Methods
showsPrec :: Int -> Ptr a -> ShowS #
show :: Ptr a -> String #
showList :: [Ptr a] -> ShowS #
 Show (FunPtr a)
Since: base-2.1
Instance details
Defined in GHC.Ptr
 
Methods
showsPrec :: Int -> FunPtr a -> ShowS #
show :: FunPtr a -> String #
showList :: [FunPtr a] -> ShowS #
 Show p => Show (Par1 p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> Par1 p -> ShowS #
show :: Par1 p -> String #
showList :: [Par1 p] -> ShowS #
 (Show a, Storable a) => Show (Vector a) 
Instance details
Defined in Data.Vector.Storable
 
Methods
showsPrec :: Int -> Vector a -> ShowS #
show :: Vector a -> String #
showList :: [Vector a] -> ShowS #
 Show a => Show (Only a) 
Instance details
Defined in Data.Tuple.Only
 
Methods
showsPrec :: Int -> Only a -> ShowS #
show :: Only a -> String #
showList :: [Only a] -> ShowS #
 Show a => Show (IResult a) 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> IResult a -> ShowS #
show :: IResult a -> String #
showList :: [IResult a] -> ShowS #
 Show a => Show (Result a) 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
showsPrec :: Int -> Result a -> ShowS #
show :: Result a -> String #
showList :: [Result a] -> ShowS #
 Show a => Show (Complex a)
Since: base-2.1
Instance details
Defined in Data.Complex
 
Methods
showsPrec :: Int -> Complex a -> ShowS #
show :: Complex a -> String #
showList :: [Complex a] -> ShowS #
 Show a => Show (Min a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> Min a -> ShowS #
show :: Min a -> String #
showList :: [Min a] -> ShowS #
 Show a => Show (Max a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> Max a -> ShowS #
show :: Max a -> String #
showList :: [Max a] -> ShowS #
 Show a => Show (First a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> First a -> ShowS #
show :: First a -> String #
showList :: [First a] -> ShowS #
 Show a => Show (Last a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> Last a -> ShowS #
show :: Last a -> String #
showList :: [Last a] -> ShowS #
 Show m => Show (WrappedMonoid m)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> WrappedMonoid m -> ShowS #
show :: WrappedMonoid m -> String #
showList :: [WrappedMonoid m] -> ShowS #
 Show a => Show (Option a)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> Option a -> ShowS #
show :: Option a -> String #
showList :: [Option a] -> ShowS #
 Show a => Show (ZipList a)
Since: base-4.7.0.0
Instance details
Defined in Control.Applicative
 
Methods
showsPrec :: Int -> ZipList a -> ShowS #
show :: ZipList a -> String #
showList :: [ZipList a] -> ShowS #
 Show a => Show (Identity a)
This instance would be equivalent to the derived instances of the
+ Identity newtype if the runIdentity field were removed
Since: base-4.8.0.0
Instance details
Defined in Data.Functor.Identity
 
Methods
showsPrec :: Int -> Identity a -> ShowS #
show :: Identity a -> String #
showList :: [Identity a] -> ShowS #
 Show a => Show (First a)
Since: base-2.1
Instance details
Defined in Data.Monoid
 
Methods
showsPrec :: Int -> First a -> ShowS #
show :: First a -> String #
showList :: [First a] -> ShowS #
 Show a => Show (Last a)
Since: base-2.1
Instance details
Defined in Data.Monoid
 
Methods
showsPrec :: Int -> Last a -> ShowS #
show :: Last a -> String #
showList :: [Last a] -> ShowS #
 Show a => Show (Dual a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> Dual a -> ShowS #
show :: Dual a -> String #
showList :: [Dual a] -> ShowS #
 Show a => Show (Sum a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> Sum a -> ShowS #
show :: Sum a -> String #
showList :: [Sum a] -> ShowS #
 Show a => Show (Product a)
Since: base-2.1
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> Product a -> ShowS #
show :: Product a -> String #
showList :: [Product a] -> ShowS #
 Show a => Show (Down a)
Since: base-4.7.0.0
Instance details
Defined in Data.Ord
 
Methods
showsPrec :: Int -> Down a -> ShowS #
show :: Down a -> String #
showList :: [Down a] -> ShowS #
 Show a => Show (NonEmpty a)
Since: base-4.11.0.0
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> NonEmpty a -> ShowS #
show :: NonEmpty a -> String #
showList :: [NonEmpty a] -> ShowS #
 (PrimType ty, Show ty) => Show (UArray ty) 
Instance details
Defined in Basement.UArray.Base
 
Methods
showsPrec :: Int -> UArray ty -> ShowS #
show :: UArray ty -> String #
showList :: [UArray ty] -> ShowS #
 (PrimType ty, Show ty) => Show (Block ty) 
Instance details
Defined in Basement.Block.Base
 
Methods
showsPrec :: Int -> Block ty -> ShowS #
show :: Block ty -> String #
showList :: [Block ty] -> ShowS #
 Show a => Show (NonEmpty a) 
Instance details
Defined in Basement.NonEmpty
 
Methods
showsPrec :: Int -> NonEmpty a -> ShowS #
show :: NonEmpty a -> String #
showList :: [NonEmpty a] -> ShowS #
 Show (Offset ty) 
Instance details
Defined in Basement.Types.OffsetSize
 
Methods
showsPrec :: Int -> Offset ty -> ShowS #
show :: Offset ty -> String #
showList :: [Offset ty] -> ShowS #
 Show (CountOf ty) 
Instance details
Defined in Basement.Types.OffsetSize
 
Methods
showsPrec :: Int -> CountOf ty -> ShowS #
show :: CountOf ty -> String #
showList :: [CountOf ty] -> ShowS #
 Show (Zn64 n) 
Instance details
Defined in Basement.Bounded
 
Methods
showsPrec :: Int -> Zn64 n -> ShowS #
show :: Zn64 n -> String #
showList :: [Zn64 n] -> ShowS #
 Show (Zn n) 
Instance details
Defined in Basement.Bounded
 
Methods
showsPrec :: Int -> Zn n -> ShowS #
show :: Zn n -> String #
showList :: [Zn n] -> ShowS #
 Show a => Show (Decoder a) 
Instance details
Defined in Data.Binary.Get.Internal
 
Methods
showsPrec :: Int -> Decoder a -> ShowS #
show :: Decoder a -> String #
showList :: [Decoder a] -> ShowS #
 Show n => Show (VarInt n) 
Instance details
Defined in Data.Bytes.VarInt
 
Methods
showsPrec :: Int -> VarInt n -> ShowS #
show :: VarInt n -> String #
showList :: [VarInt n] -> ShowS #
 Show a => Show (IntMap a) 
Instance details
Defined in Data.IntMap.Internal
 
Methods
showsPrec :: Int -> IntMap a -> ShowS #
show :: IntMap a -> String #
showList :: [IntMap a] -> ShowS #
 Show a => Show (Tree a) 
Instance details
Defined in Data.Tree
 
Methods
showsPrec :: Int -> Tree a -> ShowS #
show :: Tree a -> String #
showList :: [Tree a] -> ShowS #
 Show a => Show (Seq a) 
Instance details
Defined in Data.Sequence.Internal
 
Methods
showsPrec :: Int -> Seq a -> ShowS #
show :: Seq a -> String #
showList :: [Seq a] -> ShowS #
 Show a => Show (ViewL a) 
Instance details
Defined in Data.Sequence.Internal
 
Methods
showsPrec :: Int -> ViewL a -> ShowS #
show :: ViewL a -> String #
showList :: [ViewL a] -> ShowS #
 Show a => Show (ViewR a) 
Instance details
Defined in Data.Sequence.Internal
 
Methods
showsPrec :: Int -> ViewR a -> ShowS #
show :: ViewR a -> String #
showList :: [ViewR a] -> ShowS #
 Show a => Show (Set a) 
Instance details
Defined in Data.Set.Internal
 
Methods
showsPrec :: Int -> Set a -> ShowS #
show :: Set a -> String #
showList :: [Set a] -> ShowS #
 Show (Blake2s bitlen) 
Instance details
Defined in Crypto.Hash.Blake2
 
Methods
showsPrec :: Int -> Blake2s bitlen -> ShowS #
show :: Blake2s bitlen -> String #
showList :: [Blake2s bitlen] -> ShowS #
 Show (Blake2b bitlen) 
Instance details
Defined in Crypto.Hash.Blake2
 
Methods
showsPrec :: Int -> Blake2b bitlen -> ShowS #
show :: Blake2b bitlen -> String #
showList :: [Blake2b bitlen] -> ShowS #
 Show (Blake2sp bitlen) 
Instance details
Defined in Crypto.Hash.Blake2
 
Methods
showsPrec :: Int -> Blake2sp bitlen -> ShowS #
show :: Blake2sp bitlen -> String #
showList :: [Blake2sp bitlen] -> ShowS #
 Show (Blake2bp bitlen) 
Instance details
Defined in Crypto.Hash.Blake2
 
Methods
showsPrec :: Int -> Blake2bp bitlen -> ShowS #
show :: Blake2bp bitlen -> String #
showList :: [Blake2bp bitlen] -> ShowS #
 Show (SHAKE128 bitlen) 
Instance details
Defined in Crypto.Hash.SHAKE
 
Methods
showsPrec :: Int -> SHAKE128 bitlen -> ShowS #
show :: SHAKE128 bitlen -> String #
showList :: [SHAKE128 bitlen] -> ShowS #
 Show (SHAKE256 bitlen) 
Instance details
Defined in Crypto.Hash.SHAKE
 
Methods
showsPrec :: Int -> SHAKE256 bitlen -> ShowS #
show :: SHAKE256 bitlen -> String #
showList :: [SHAKE256 bitlen] -> ShowS #
 Show (Digest a) 
Instance details
Defined in Crypto.Hash.Types
 
Methods
showsPrec :: Int -> Digest a -> ShowS #
show :: Digest a -> String #
showList :: [Digest a] -> ShowS #
 Show a => Show (DList a) 
Instance details
Defined in Data.DList
 
Methods
showsPrec :: Int -> DList a -> ShowS #
show :: DList a -> String #
showList :: [DList a] -> ShowS #
 Show a => Show (ExitCase a) 
Instance details
Defined in Control.Monad.Catch
 
Methods
showsPrec :: Int -> ExitCase a -> ShowS #
show :: ExitCase a -> String #
showList :: [ExitCase a] -> ShowS #
 (Generic a, GShow0 (Rep a)) => Show (Generically a) 
Instance details
Defined in Generic.Data.Internal.Generically
 
Methods
showsPrec :: Int -> Generically a -> ShowS #
show :: Generically a -> String #
showList :: [Generically a] -> ShowS #
 Show a => Show (Hashed a) 
Instance details
Defined in Data.Hashable.Class
 
Methods
showsPrec :: Int -> Hashed a -> ShowS #
show :: Hashed a -> String #
showList :: [Hashed a] -> ShowS #
 (Show t, Element t) => Show (LU t) 
Instance details
Defined in Internal.Algorithms
 
Methods
showsPrec :: Int -> LU t -> ShowS #
show :: LU t -> String #
showList :: [LU t] -> ShowS #
 (Show t, Element t) => Show (LDL t) 
Instance details
Defined in Internal.Algorithms
 
Methods
showsPrec :: Int -> LDL t -> ShowS #
show :: LDL t -> String #
showList :: [LDL t] -> ShowS #
 (Show t, Element t) => Show (Herm t) 
Instance details
Defined in Internal.Algorithms
 
Methods
showsPrec :: Int -> Herm t -> ShowS #
show :: Herm t -> String #
showList :: [Herm t] -> ShowS #
 Show a => Show (Interval a) 
Instance details
Defined in Numeric.Interval.Kaucher
 
Methods
showsPrec :: Int -> Interval a -> ShowS #
show :: Interval a -> String #
showList :: [Interval a] -> ShowS #
 Show (Doc a) 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> Doc a -> ShowS #
show :: Doc a -> String #
showList :: [Doc a] -> ShowS #
 Show a => Show (AnnotDetails a) 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> AnnotDetails a -> ShowS #
show :: AnnotDetails a -> String #
showList :: [AnnotDetails a] -> ShowS #
 Show a => Show (Span a) 
Instance details
Defined in Text.PrettyPrint.Annotated.HughesPJ
 
Methods
showsPrec :: Int -> Span a -> ShowS #
show :: Span a -> String #
showList :: [Span a] -> ShowS #
 (Show a, PrimUnlifted a) => Show (UnliftedArray a)
Since: primitive-0.6.4.0
Instance details
Defined in Data.Primitive.UnliftedArray
 
Methods
showsPrec :: Int -> UnliftedArray a -> ShowS #
show :: UnliftedArray a -> String #
showList :: [UnliftedArray a] -> ShowS #
 (Show a, Prim a) => Show (PrimArray a)
Since: primitive-0.6.4.0
Instance details
Defined in Data.Primitive.PrimArray
 
Methods
showsPrec :: Int -> PrimArray a -> ShowS #
show :: PrimArray a -> String #
showList :: [PrimArray a] -> ShowS #
 Show a => Show (SmallArray a) 
Instance details
Defined in Data.Primitive.SmallArray
 
Methods
showsPrec :: Int -> SmallArray a -> ShowS #
show :: SmallArray a -> String #
showList :: [SmallArray a] -> ShowS #
 Show a => Show (Array a) 
Instance details
Defined in Data.Primitive.Array
 
Methods
showsPrec :: Int -> Array a -> ShowS #
show :: Array a -> String #
showList :: [Array a] -> ShowS #
 Show (Rules a) 
Instance details
Defined in Filesystem.Path.Internal
 
Methods
showsPrec :: Int -> Rules a -> ShowS #
show :: Rules a -> String #
showList :: [Rules a] -> ShowS #
 Show a => Show (HashSet a) 
Instance details
Defined in Data.HashSet.Base
 
Methods
showsPrec :: Int -> HashSet a -> ShowS #
show :: HashSet a -> String #
showList :: [HashSet a] -> ShowS #
 (Show a, Prim a) => Show (Vector a) 
Instance details
Defined in Data.Vector.Primitive
 
Methods
showsPrec :: Int -> Vector a -> ShowS #
show :: Vector a -> String #
showList :: [Vector a] -> ShowS #
 Show a => Show (Vector a) 
Instance details
Defined in Data.Vector
 
Methods
showsPrec :: Int -> Vector a -> ShowS #
show :: Vector a -> String #
showList :: [Vector a] -> ShowS #
 Show a => Show (Root a) 
Instance details
Defined in Numeric.RootFinding
 
Methods
showsPrec :: Int -> Root a -> ShowS #
show :: Root a -> String #
showList :: [Root a] -> ShowS #
 (Floating a, Show a) => Show (Log a) 
Instance details
Defined in Numeric.Log
 
Methods
showsPrec :: Int -> Log a -> ShowS #
show :: Log a -> String #
showList :: [Log a] -> ShowS #
 Show a => Show (RB a) 
Instance details
Defined in Data.List.Extra
 
Methods
showsPrec :: Int -> RB a -> ShowS #
show :: RB a -> String #
showList :: [RB a] -> ShowS #
 (Show1 f, Functor f, Constructor (f (FixE f))) => Show (FixE f) # 
Instance details
Defined in Data.Expression.Eval
 
Methods
showsPrec :: Int -> FixE f -> ShowS #
show :: FixE f -> String #
showList :: [FixE f] -> ShowS #
 Show (TypeOf t) # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> TypeOf t -> ShowS #
show :: TypeOf t -> String #
showList :: [TypeOf t] -> ShowS #
 (Show t, ExprType t) => Show (Expression t) # 
Instance details
Defined in Data.Expression.Eval
 
Methods
showsPrec :: Int -> Expression t -> ShowS #
show :: Expression t -> String #
showList :: [Expression t] -> ShowS #
 Show1 f => Show (Fix f) 
Instance details
Defined in Data.Functor.Foldable
 
Methods
showsPrec :: Int -> Fix f -> ShowS #
show :: Fix f -> String #
showList :: [Fix f] -> ShowS #
 (Functor f, Show1 f) => Show (Mu f) 
Instance details
Defined in Data.Functor.Foldable
 
Methods
showsPrec :: Int -> Mu f -> ShowS #
show :: Mu f -> String #
showList :: [Mu f] -> ShowS #
 (Functor f, Show1 f) => Show (Nu f) 
Instance details
Defined in Data.Functor.Foldable
 
Methods
showsPrec :: Int -> Nu f -> ShowS #
show :: Nu f -> String #
showList :: [Nu f] -> ShowS #
 ExprTuple t => Show (P t) # 
Instance details
Defined in Data.Program
 
Methods
showsPrec :: Int -> P t -> ShowS #
show :: P t -> String #
showList :: [P t] -> ShowS #
 Show a => Show (V2 a) 
Instance details
Defined in Linear.V2
 
Methods
showsPrec :: Int -> V2 a -> ShowS #
show :: V2 a -> String #
showList :: [V2 a] -> ShowS #
 Show t => Show (TransInv t) 
Instance details
Defined in Diagrams.Core.Transform
 
Methods
showsPrec :: Int -> TransInv t -> ShowS #
show :: TransInv t -> String #
showList :: [TransInv t] -> ShowS #
 (Show (V a (N a)), Show a) => Show (Located a) 
Instance details
Defined in Diagrams.Located
 
Methods
showsPrec :: Int -> Located a -> ShowS #
show :: Located a -> String #
showList :: [Located a] -> ShowS #
 Show n => Show (PolyOrientation n) 
Instance details
Defined in Diagrams.TwoD.Polygons
 
Methods
showsPrec :: Int -> PolyOrientation n -> ShowS #
show :: PolyOrientation n -> String #
showList :: [PolyOrientation n] -> ShowS #
 Show a => Show (Limit a) 
Instance details
Defined in Graphics.Rendering.Chart.Geometry
 
Methods
showsPrec :: Int -> Limit a -> ShowS #
show :: Limit a -> String #
showList :: [Limit a] -> ShowS #
 Show x => Show (ErrValue x) 
Instance details
Defined in Graphics.Rendering.Chart.Plot.ErrBars
 
Methods
showsPrec :: Int -> ErrValue x -> ShowS #
show :: ErrValue x -> String #
showList :: [ErrValue x] -> ShowS #
 Show a => Show (Grid a) 
Instance details
Defined in Graphics.Rendering.Chart.Grid
 
Methods
showsPrec :: Int -> Grid a -> ShowS #
show :: Grid a -> String #
showList :: [Grid a] -> ShowS #
 Show n => Show (Extending n) 
Instance details
Defined in Plots.Axis.Scale
 
Methods
showsPrec :: Int -> Extending n -> ShowS #
show :: Extending n -> String #
showList :: [Extending n] -> ShowS #
 Show n => Show (Time n) 
Instance details
Defined in Data.Active
 
Methods
showsPrec :: Int -> Time n -> ShowS #
show :: Time n -> String #
showList :: [Time n] -> ShowS #
 Show a => Show (V3 a) 
Instance details
Defined in Linear.V3
 
Methods
showsPrec :: Int -> V3 a -> ShowS #
show :: V3 a -> String #
showList :: [V3 a] -> ShowS #
 Show n => Show (Angle n) 
Instance details
Defined in Diagrams.Angle
 
Methods
showsPrec :: Int -> Angle n -> ShowS #
show :: Angle n -> String #
showList :: [Angle n] -> ShowS #
 Show m => Show (SM m) 
Instance details
Defined in Data.Monoid.MList
 
Methods
showsPrec :: Int -> SM m -> ShowS #
show :: SM m -> String #
showList :: [SM m] -> ShowS #
 Show a => Show (V1 a) 
Instance details
Defined in Linear.V1
 
Methods
showsPrec :: Int -> V1 a -> ShowS #
show :: V1 a -> String #
showList :: [V1 a] -> ShowS #
 Show n => Show (Duration n) 
Instance details
Defined in Data.Active
 
Methods
showsPrec :: Int -> Duration n -> ShowS #
show :: Duration n -> String #
showList :: [Duration n] -> ShowS #
 Show n => Show (Era n) 
Instance details
Defined in Data.Active
 
Methods
showsPrec :: Int -> Era n -> ShowS #
show :: Era n -> String #
showList :: [Era n] -> ShowS #
 Show a => Show (Plucker a) 
Instance details
Defined in Linear.Plucker
 
Methods
showsPrec :: Int -> Plucker a -> ShowS #
show :: Plucker a -> String #
showList :: [Plucker a] -> ShowS #
 Show a => Show (Quaternion a) 
Instance details
Defined in Linear.Quaternion
 
Methods
showsPrec :: Int -> Quaternion a -> ShowS #
show :: Quaternion a -> String #
showList :: [Quaternion a] -> ShowS #
 Show (V0 a) 
Instance details
Defined in Linear.V0
 
Methods
showsPrec :: Int -> V0 a -> ShowS #
show :: V0 a -> String #
showList :: [V0 a] -> ShowS #
 Show a => Show (V4 a) 
Instance details
Defined in Linear.V4
 
Methods
showsPrec :: Int -> V4 a -> ShowS #
show :: V4 a -> String #
showList :: [V4 a] -> ShowS #
 Show n => Show (BernsteinPoly n) 
Instance details
Defined in Diagrams.TwoD.Segment.Bernstein
 
Methods
showsPrec :: Int -> BernsteinPoly n -> ShowS #
show :: BernsteinPoly n -> String #
showList :: [BernsteinPoly n] -> ShowS #
 Show a => Show (Digit a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> Digit a -> ShowS #
show :: Digit a -> String #
showList :: [Digit a] -> ShowS #
 Show a => Show (GraphPart a) 
Instance details
Defined in Diagrams.TwoD.Polygons
 
Methods
showsPrec :: Int -> GraphPart a -> ShowS #
show :: GraphPart a -> String #
showList :: [GraphPart a] -> ShowS #
 (ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #
show :: (a -> b -> Expression t) -> String #
showList :: [a -> b -> Expression t] -> ShowS #
 (ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details
Defined in Data.Expression
 
Methods
showsPrec :: Int -> (a -> Expression t) -> ShowS #
show :: (a -> Expression t) -> String #
showList :: [a -> Expression t] -> ShowS #
 (ExprTuple a, ExprTuple b) => Show (a -> P b) # 
Instance details
Defined in Data.Program
 
Methods
showsPrec :: Int -> (a -> P b) -> ShowS #
show :: (a -> P b) -> String #
showList :: [a -> P b] -> ShowS #
 (Show a, Show b) => Show (Either a b)
Since: base-3.0
Instance details
Defined in Data.Either
 
Methods
showsPrec :: Int -> Either a b -> ShowS #
show :: Either a b -> String #
showList :: [Either a b] -> ShowS #
 Show (V1 p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> V1 p -> ShowS #
show :: V1 p -> String #
showList :: [V1 p] -> ShowS #
 Show (U1 p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> U1 p -> ShowS #
show :: U1 p -> String #
showList :: [U1 p] -> ShowS #
 Show (TypeRep a) 
Instance details
Defined in Data.Typeable.Internal
 
Methods
showsPrec :: Int -> TypeRep a -> ShowS #
show :: TypeRep a -> String #
showList :: [TypeRep a] -> ShowS #
 (Show a, Show b) => Show (a, b)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b) -> ShowS #
show :: (a, b) -> String #
showList :: [(a, b)] -> ShowS #
 (Show k, Show v) => Show (HashMap k v) 
Instance details
Defined in Data.HashMap.Base
 
Methods
showsPrec :: Int -> HashMap k v -> ShowS #
show :: HashMap k v -> String #
showList :: [HashMap k v] -> ShowS #
 (Show k, Show a) => Show (Map k a) 
Instance details
Defined in Data.Map.Internal
 
Methods
showsPrec :: Int -> Map k a -> ShowS #
show :: Map k a -> String #
showList :: [Map k a] -> ShowS #
 (Ix ix, Show ix, Show e, IArray UArray e) => Show (UArray ix e) 
Instance details
Defined in Data.Array.Base
 
Methods
showsPrec :: Int -> UArray ix e -> ShowS #
show :: UArray ix e -> String #
showList :: [UArray ix e] -> ShowS #
 (Ix a, Show a, Show b) => Show (Array a b)
Since: base-2.1
Instance details
Defined in GHC.Arr
 
Methods
showsPrec :: Int -> Array a b -> ShowS #
show :: Array a b -> String #
showList :: [Array a b] -> ShowS #
 (Show i, Show r) => Show (IResult i r) 
Instance details
Defined in Data.Attoparsec.Internal.Types
 
Methods
showsPrec :: Int -> IResult i r -> ShowS #
show :: IResult i r -> String #
showList :: [IResult i r] -> ShowS #
 (Show a, Show b) => Show (Arg a b)
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
showsPrec :: Int -> Arg a b -> ShowS #
show :: Arg a b -> String #
showList :: [Arg a b] -> ShowS #
 Show (Proxy s)
Since: base-4.7.0.0
Instance details
Defined in Data.Proxy
 
Methods
showsPrec :: Int -> Proxy s -> ShowS #
show :: Proxy s -> String #
showList :: [Proxy s] -> ShowS #
 (Show a, Show b) => Show (Bimap a b) 
Instance details
Defined in Data.Bimap
 
Methods
showsPrec :: Int -> Bimap a b -> ShowS #
show :: Bimap a b -> String #
showList :: [Bimap a b] -> ShowS #
 (Show1 m, Show a) => Show (MaybeT m a) 
Instance details
Defined in Control.Monad.Trans.Maybe
 
Methods
showsPrec :: Int -> MaybeT m a -> ShowS #
show :: MaybeT m a -> String #
showList :: [MaybeT m a] -> ShowS #
 (Show a, Show (s a)) => Show (ViewL s a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> ViewL s a -> ShowS #
show :: ViewL s a -> String #
showList :: [ViewL s a] -> ShowS #
 (Show a, Show (s a)) => Show (ViewR s a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> ViewR s a -> ShowS #
show :: ViewR s a -> String #
showList :: [ViewR s a] -> ShowS #
 Show a => Show (FingerTree v a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> FingerTree v a -> ShowS #
show :: FingerTree v a -> String #
showList :: [FingerTree v a] -> ShowS #
 Show a => Show (SearchResult v a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> SearchResult v a -> ShowS #
show :: SearchResult v a -> String #
showList :: [SearchResult v a] -> ShowS #
 (Generic1 f, GShow1 (Rep1 f), Show a) => Show (Generically1 f a) 
Instance details
Defined in Generic.Data.Internal.Generically
 
Methods
showsPrec :: Int -> Generically1 f a -> ShowS #
show :: Generically1 f a -> String #
showList :: [Generically1 f a] -> ShowS #
 Show t => Show (Mod n t) 
Instance details
Defined in Internal.Modular
 
Methods
showsPrec :: Int -> Mod n t -> ShowS #
show :: Mod n t -> String #
showList :: [Mod n t] -> ShowS #
 (Show1 m, Show a) => Show (ListT m a) 
Instance details
Defined in Control.Monad.Trans.List
 
Methods
showsPrec :: Int -> ListT m a -> ShowS #
show :: ListT m a -> String #
showList :: [ListT m a] -> ShowS #
 (Show t, Show b) => Show (MatrixView t b) 
Instance details
Defined in Internal.Util
 
Methods
showsPrec :: Int -> MatrixView t b -> ShowS #
show :: MatrixView t b -> String #
showList :: [MatrixView t b] -> ShowS #
 (Num p, Show p, Show a) => Show (Categorical p a) 
Instance details
Defined in Data.Random.Distribution.Categorical
 
Methods
showsPrec :: Int -> Categorical p a -> ShowS #
show :: Categorical p a -> String #
showList :: [Categorical p a] -> ShowS #
 (Show a, Show b) => Show (ListF a b) 
Instance details
Defined in Data.Functor.Foldable
 
Methods
showsPrec :: Int -> ListF a b -> ShowS #
show :: ListF a b -> String #
showList :: [ListF a b] -> ShowS #
 (Show1 f, Show a) => Show (Cofree f a) 
Instance details
Defined in Control.Comonad.Cofree
 
Methods
showsPrec :: Int -> Cofree f a -> ShowS #
show :: Cofree f a -> String #
showList :: [Cofree f a] -> ShowS #
 (Show1 f, Show a) => Show (Free f a) 
Instance details
Defined in Control.Monad.Free
 
Methods
showsPrec :: Int -> Free f a -> ShowS #
show :: Free f a -> String #
showList :: [Free f a] -> ShowS #
 (Show a, Show b) => Show (NonEmptyF a b) 
Instance details
Defined in Data.Functor.Base
 
Methods
showsPrec :: Int -> NonEmptyF a b -> ShowS #
show :: NonEmptyF a b -> String #
showList :: [NonEmptyF a b] -> ShowS #
 Show (v n) => Show (SizeSpec v n) 
Instance details
Defined in Diagrams.Size
 
Methods
showsPrec :: Int -> SizeSpec v n -> ShowS #
show :: SizeSpec v n -> String #
showList :: [SizeSpec v n] -> ShowS #
 Show (Envelope v n) 
Instance details
Defined in Diagrams.Core.Envelope
 
Methods
showsPrec :: Int -> Envelope v n -> ShowS #
show :: Envelope v n -> String #
showList :: [Envelope v n] -> ShowS #
 Show (Attribute v n) 
Instance details
Defined in Diagrams.Core.Style
 
Methods
showsPrec :: Int -> Attribute v n -> ShowS #
show :: Attribute v n -> String #
showList :: [Attribute v n] -> ShowS #
 Show (Style v n) 
Instance details
Defined in Diagrams.Core.Style
 
Methods
showsPrec :: Int -> Style v n -> ShowS #
show :: Style v n -> String #
showList :: [Style v n] -> ShowS #
 Show (Trace v n) 
Instance details
Defined in Diagrams.Core.Trace
 
Methods
showsPrec :: Int -> Trace v n -> ShowS #
show :: Trace v n -> String #
showList :: [Trace v n] -> ShowS #
 Show (f a) => Show (Point f a) 
Instance details
Defined in Linear.Affine
 
Methods
showsPrec :: Int -> Point f a -> ShowS #
show :: Point f a -> String #
showList :: [Point f a] -> ShowS #
 Show (v n) => Show (Path v n) 
Instance details
Defined in Diagrams.Path
 
Methods
showsPrec :: Int -> Path v n -> ShowS #
show :: Path v n -> String #
showList :: [Path v n] -> ShowS #
 Show (v n) => Show (Trail v n) 
Instance details
Defined in Diagrams.Trail
 
Methods
showsPrec :: Int -> Trail v n -> ShowS #
show :: Trail v n -> String #
showList :: [Trail v n] -> ShowS #
 Show (v n) => Show (FixedSegment v n) 
Instance details
Defined in Diagrams.Segment
 
Methods
showsPrec :: Int -> FixedSegment v n -> ShowS #
show :: FixedSegment v n -> String #
showList :: [FixedSegment v n] -> ShowS #
 (Show x, Show y) => Show (Candle x y) 
Instance details
Defined in Graphics.Rendering.Chart.Plot.Candle
 
Methods
showsPrec :: Int -> Candle x y -> ShowS #
show :: Candle x y -> String #
showList :: [Candle x y] -> ShowS #
 (Show x, Show y) => Show (ErrPoint x y) 
Instance details
Defined in Graphics.Rendering.Chart.Plot.ErrBars
 
Methods
showsPrec :: Int -> ErrPoint x y -> ShowS #
show :: ErrPoint x y -> String #
showList :: [ErrPoint x y] -> ShowS #
 (Show i, Show a) => Show (Level i a) 
Instance details
Defined in Control.Lens.Internal.Level
 
Methods
showsPrec :: Int -> Level i a -> ShowS #
show :: Level i a -> String #
showList :: [Level i a] -> ShowS #
 Show (v n) => Show (SegTree v n) 
Instance details
Defined in Diagrams.Trail
 
Methods
showsPrec :: Int -> SegTree v n -> ShowS #
show :: SegTree v n -> String #
showList :: [SegTree v n] -> ShowS #
 Show (v n) => Show (Direction v n) 
Instance details
Defined in Diagrams.Direction
 
Methods
showsPrec :: Int -> Direction v n -> ShowS #
show :: Direction v n -> String #
showList :: [Direction v n] -> ShowS #
 Show (v n) => Show (BoundingBox v n) 
Instance details
Defined in Diagrams.BoundingBox
 
Methods
showsPrec :: Int -> BoundingBox v n -> ShowS #
show :: BoundingBox v n -> String #
showList :: [BoundingBox v n] -> ShowS #
 (Show a, Show b) => Show (a :& b) 
Instance details
Defined in Diagrams.Coordinates
 
Methods
showsPrec :: Int -> (a :& b) -> ShowS #
show :: (a :& b) -> String #
showList :: [a :& b] -> ShowS #
 (Show v, Show a) => Show (Node v a) 
Instance details
Defined in Data.FingerTree
 
Methods
showsPrec :: Int -> Node v a -> ShowS #
show :: Node v a -> String #
showList :: [Node v a] -> ShowS #
 Show (f a) => Show (Yoneda f a) 
Instance details
Defined in Data.Functor.Yoneda
 
Methods
showsPrec :: Int -> Yoneda f a -> ShowS #
show :: Yoneda f a -> String #
showList :: [Yoneda f a] -> ShowS #
 Show (f p) => Show (Rec1 f p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> Rec1 f p -> ShowS #
show :: Rec1 f p -> String #
showList :: [Rec1 f p] -> ShowS #
 Show (URec Char p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> URec Char p -> ShowS #
show :: URec Char p -> String #
showList :: [URec Char p] -> ShowS #
 Show (URec Double p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> URec Double p -> ShowS #
show :: URec Double p -> String #
showList :: [URec Double p] -> ShowS #
 Show (URec Float p) 
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> URec Float p -> ShowS #
show :: URec Float p -> String #
showList :: [URec Float p] -> ShowS #
 Show (URec Int p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> URec Int p -> ShowS #
show :: URec Int p -> String #
showList :: [URec Int p] -> ShowS #
 Show (URec Word p)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> URec Word p -> ShowS #
show :: URec Word p -> String #
showList :: [URec Word p] -> ShowS #
 (Show a, Show b, Show c) => Show (a, b, c)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c) -> ShowS #
show :: (a, b, c) -> String #
showList :: [(a, b, c)] -> ShowS #
 Show a => Show (Const a b)
This instance would be equivalent to the derived instances of the
+ Const newtype if the runConst field were removed
Since: base-4.8.0.0
Instance details
Defined in Data.Functor.Const
 
Methods
showsPrec :: Int -> Const a b -> ShowS #
show :: Const a b -> String #
showList :: [Const a b] -> ShowS #
 Show (f a) => Show (Ap f a)
Since: base-4.12.0.0
Instance details
Defined in Data.Monoid
 
Methods
showsPrec :: Int -> Ap f a -> ShowS #
show :: Ap f a -> String #
showList :: [Ap f a] -> ShowS #
 Show (f a) => Show (Alt f a)
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
showsPrec :: Int -> Alt f a -> ShowS #
show :: Alt f a -> String #
showList :: [Alt f a] -> ShowS #
 Show (a :~: b)
Since: base-4.7.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
showsPrec :: Int -> (a :~: b) -> ShowS #
show :: (a :~: b) -> String #
showList :: [a :~: b] -> ShowS #
 Show (p a a) => Show (Join p a) 
Instance details
Defined in Data.Bifunctor.Join
 
Methods
showsPrec :: Int -> Join p a -> ShowS #
show :: Join p a -> String #
showList :: [Join p a] -> ShowS #
 Show (p (Fix p a) a) => Show (Fix p a) 
Instance details
Defined in Data.Bifunctor.Fix
 
Methods
showsPrec :: Int -> Fix p a -> ShowS #
show :: Fix p a -> String #
showList :: [Fix p a] -> ShowS #
 (Show1 f, Show a) => Show (IdentityT f a) 
Instance details
Defined in Control.Monad.Trans.Identity
 
Methods
showsPrec :: Int -> IdentityT f a -> ShowS #
show :: IdentityT f a -> String #
showList :: [IdentityT f a] -> ShowS #
 (Show e, Show1 m, Show a) => Show (ExceptT e m a) 
Instance details
Defined in Control.Monad.Trans.Except
 
Methods
showsPrec :: Int -> ExceptT e m a -> ShowS #
show :: ExceptT e m a -> String #
showList :: [ExceptT e m a] -> ShowS #
 (Show w, Show1 m, Show a) => Show (WriterT w m a) 
Instance details
Defined in Control.Monad.Trans.Writer.Lazy
 
Methods
showsPrec :: Int -> WriterT w m a -> ShowS #
show :: WriterT w m a -> String #
showList :: [WriterT w m a] -> ShowS #
 (Show e, Show1 m, Show a) => Show (ErrorT e m a) 
Instance details
Defined in Control.Monad.Trans.Error
 
Methods
showsPrec :: Int -> ErrorT e m a -> ShowS #
show :: ErrorT e m a -> String #
showList :: [ErrorT e m a] -> ShowS #
 (Show w, Show1 m, Show a) => Show (WriterT w m a) 
Instance details
Defined in Control.Monad.Trans.Writer.Strict
 
Methods
showsPrec :: Int -> WriterT w m a -> ShowS #
show :: WriterT w m a -> String #
showList :: [WriterT w m a] -> ShowS #
 Show b => Show (Tagged s b) 
Instance details
Defined in Data.Tagged
 
Methods
showsPrec :: Int -> Tagged s b -> ShowS #
show :: Tagged s b -> String #
showList :: [Tagged s b] -> ShowS #
 (Show1 f, Show a) => Show (Backwards f a) 
Instance details
Defined in Control.Applicative.Backwards
 
Methods
showsPrec :: Int -> Backwards f a -> ShowS #
show :: Backwards f a -> String #
showList :: [Backwards f a] -> ShowS #
 Show (w (CofreeF f a (CofreeT f w a))) => Show (CofreeT f w a) 
Instance details
Defined in Control.Comonad.Trans.Cofree
 
Methods
showsPrec :: Int -> CofreeT f w a -> ShowS #
show :: CofreeT f w a -> String #
showList :: [CofreeT f w a] -> ShowS #
 (Show a, Show (f b)) => Show (CofreeF f a b) 
Instance details
Defined in Control.Comonad.Trans.Cofree
 
Methods
showsPrec :: Int -> CofreeF f a b -> ShowS #
show :: CofreeF f a b -> String #
showList :: [CofreeF f a b] -> ShowS #
 (Show1 f, Show1 m, Show a) => Show (FreeT f m a) 
Instance details
Defined in Control.Monad.Trans.Free
 
Methods
showsPrec :: Int -> FreeT f m a -> ShowS #
show :: FreeT f m a -> String #
showList :: [FreeT f m a] -> ShowS #
 (Show a, Show (f b)) => Show (FreeF f a b) 
Instance details
Defined in Control.Monad.Trans.Free
 
Methods
showsPrec :: Int -> FreeF f a b -> ShowS #
show :: FreeF f a b -> String #
showList :: [FreeF f a b] -> ShowS #
 Show (Options Cairo V2 Double) 
Instance details
Defined in Diagrams.Backend.Cairo.Internal
 
Methods
showsPrec :: Int -> Options Cairo V2 Double -> ShowS #
show :: Options Cairo V2 Double -> String #
showList :: [Options Cairo V2 Double] -> ShowS #
 Show (v n) => Show (Segment c v n) 
Instance details
Defined in Diagrams.Segment
 
Methods
showsPrec :: Int -> Segment c v n -> ShowS #
show :: Segment c v n -> String #
showList :: [Segment c v n] -> ShowS #
 Show (v n) => Show (Trail' l v n) 
Instance details
Defined in Diagrams.Trail
 
Methods
showsPrec :: Int -> Trail' l v n -> ShowS #
show :: Trail' l v n -> String #
showList :: [Trail' l v n] -> ShowS #
 (Show x, Show y1, Show y2) => Show (LayoutPick x y1 y2) 
Instance details
Defined in Graphics.Rendering.Chart.Layout
 
Methods
showsPrec :: Int -> LayoutPick x y1 y2 -> ShowS #
show :: LayoutPick x y1 y2 -> String #
showList :: [LayoutPick x y1 y2] -> ShowS #
 Show (v n) => Show (Offset c v n) 
Instance details
Defined in Diagrams.Segment
 
Methods
showsPrec :: Int -> Offset c v n -> ShowS #
show :: Offset c v n -> String #
showList :: [Offset c v n] -> ShowS #
 Show a => Show (V n a) 
Instance details
Defined in Linear.V
 
Methods
showsPrec :: Int -> V n a -> ShowS #
show :: V n a -> String #
showList :: [V n a] -> ShowS #
 Show (f (a, b)) => Show (AlongsideLeft f b a) 
Instance details
Defined in Control.Lens.Internal.Getter
 
Methods
showsPrec :: Int -> AlongsideLeft f b a -> ShowS #
show :: AlongsideLeft f b a -> String #
showList :: [AlongsideLeft f b a] -> ShowS #
 Show (f (a, b)) => Show (AlongsideRight f a b) 
Instance details
Defined in Control.Lens.Internal.Getter
 
Methods
showsPrec :: Int -> AlongsideRight f a b -> ShowS #
show :: AlongsideRight f a b -> String #
showList :: [AlongsideRight f a b] -> ShowS #
 Show c => Show (K1 i c p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> K1 i c p -> ShowS #
show :: K1 i c p -> String #
showList :: [K1 i c p] -> ShowS #
 (Show (f p), Show (g p)) => Show ((f :+: g) p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> (f :+: g) p -> ShowS #
show :: (f :+: g) p -> String #
showList :: [(f :+: g) p] -> ShowS #
 (Show (f p), Show (g p)) => Show ((f :*: g) p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> (f :*: g) p -> ShowS #
show :: (f :*: g) p -> String #
showList :: [(f :*: g) p] -> ShowS #
 (Show a, Show b, Show c, Show d) => Show (a, b, c, d)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d) -> ShowS #
show :: (a, b, c, d) -> String #
showList :: [(a, b, c, d)] -> ShowS #
 (Show1 f, Show1 g, Show a) => Show (Product f g a)
Since: base-4.9.0.0
Instance details
Defined in Data.Functor.Product
 
Methods
showsPrec :: Int -> Product f g a -> ShowS #
show :: Product f g a -> String #
showList :: [Product f g a] -> ShowS #
 (Show1 f, Show1 g, Show a) => Show (Sum f g a)
Since: base-4.9.0.0
Instance details
Defined in Data.Functor.Sum
 
Methods
showsPrec :: Int -> Sum f g a -> ShowS #
show :: Sum f g a -> String #
showList :: [Sum f g a] -> ShowS #
 Show (a :~~: b)
Since: base-4.10.0.0
Instance details
Defined in Data.Type.Equality
 
Methods
showsPrec :: Int -> (a :~~: b) -> ShowS #
show :: (a :~~: b) -> String #
showList :: [a :~~: b] -> ShowS #
 (Show i, Show a) => Show (Magma i t b a) 
Instance details
Defined in Control.Lens.Internal.Magma
 
Methods
showsPrec :: Int -> Magma i t b a -> ShowS #
show :: Magma i t b a -> String #
showList :: [Magma i t b a] -> ShowS #
 (Show u, Show l, Show d, Show a) => Show (DUALTree d u a l) 
Instance details
Defined in Data.Tree.DUAL.Internal
 
Methods
showsPrec :: Int -> DUALTree d u a l -> ShowS #
show :: DUALTree d u a l -> String #
showList :: [DUALTree d u a l] -> ShowS #
 (Show u, Show l, Show d, Show a) => Show (DUALTreeU d u a l) 
Instance details
Defined in Data.Tree.DUAL.Internal
 
Methods
showsPrec :: Int -> DUALTreeU d u a l -> ShowS #
show :: DUALTreeU d u a l -> String #
showList :: [DUALTreeU d u a l] -> ShowS #
 (Show u, Show l, Show d, Show a) => Show (DUALTreeNE d u a l) 
Instance details
Defined in Data.Tree.DUAL.Internal
 
Methods
showsPrec :: Int -> DUALTreeNE d u a l -> ShowS #
show :: DUALTreeNE d u a l -> String #
showList :: [DUALTreeNE d u a l] -> ShowS #
 Show (f p) => Show (M1 i c f p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> M1 i c f p -> ShowS #
show :: M1 i c f p -> String #
showList :: [M1 i c f p] -> ShowS #
 Show (f (g p)) => Show ((f :.: g) p)
Since: base-4.7.0.0
Instance details
Defined in GHC.Generics
 
Methods
showsPrec :: Int -> (f :.: g) p -> ShowS #
show :: (f :.: g) p -> String #
showList :: [(f :.: g) p] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e) -> ShowS #
show :: (a, b, c, d, e) -> String #
showList :: [(a, b, c, d, e)] -> ShowS #
 (Show1 f, Show1 g, Show a) => Show (Compose f g a)
Since: base-4.9.0.0
Instance details
Defined in Data.Functor.Compose
 
Methods
showsPrec :: Int -> Compose f g a -> ShowS #
show :: Compose f g a -> String #
showList :: [Compose f g a] -> ShowS #
 Show (p a b) => Show (WrappedBifunctor p a b) 
Instance details
Defined in Data.Bifunctor.Wrapped
 
Methods
showsPrec :: Int -> WrappedBifunctor p a b -> ShowS #
show :: WrappedBifunctor p a b -> String #
showList :: [WrappedBifunctor p a b] -> ShowS #
 Show (g b) => Show (Joker g a b) 
Instance details
Defined in Data.Bifunctor.Joker
 
Methods
showsPrec :: Int -> Joker g a b -> ShowS #
show :: Joker g a b -> String #
showList :: [Joker g a b] -> ShowS #
 Show (p b a) => Show (Flip p a b) 
Instance details
Defined in Data.Bifunctor.Flip
 
Methods
showsPrec :: Int -> Flip p a b -> ShowS #
show :: Flip p a b -> String #
showList :: [Flip p a b] -> ShowS #
 Show (f a) => Show (Clown f a b) 
Instance details
Defined in Data.Bifunctor.Clown
 
Methods
showsPrec :: Int -> Clown f a b -> ShowS #
show :: Clown f a b -> String #
showList :: [Clown f a b] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f) -> ShowS #
show :: (a, b, c, d, e, f) -> String #
showList :: [(a, b, c, d, e, f)] -> ShowS #
 (Show (p a b), Show (q a b)) => Show (Sum p q a b) 
Instance details
Defined in Data.Bifunctor.Sum
 
Methods
showsPrec :: Int -> Sum p q a b -> ShowS #
show :: Sum p q a b -> String #
showList :: [Sum p q a b] -> ShowS #
 (Show (f a b), Show (g a b)) => Show (Product f g a b) 
Instance details
Defined in Data.Bifunctor.Product
 
Methods
showsPrec :: Int -> Product f g a b -> ShowS #
show :: Product f g a b -> String #
showList :: [Product f g a b] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g) -> ShowS #
show :: (a, b, c, d, e, f, g) -> String #
showList :: [(a, b, c, d, e, f, g)] -> ShowS #
 Show (f (p a b)) => Show (Tannen f p a b) 
Instance details
Defined in Data.Bifunctor.Tannen
 
Methods
showsPrec :: Int -> Tannen f p a b -> ShowS #
show :: Tannen f p a b -> String #
showList :: [Tannen f p a b] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h) => Show (a, b, c, d, e, f, g, h)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h) -> ShowS #
show :: (a, b, c, d, e, f, g, h) -> String #
showList :: [(a, b, c, d, e, f, g, h)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i) => Show (a, b, c, d, e, f, g, h, i)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i) -> String #
showList :: [(a, b, c, d, e, f, g, h, i)] -> ShowS #
 Show (p (f a) (g b)) => Show (Biff p f g a b) 
Instance details
Defined in Data.Bifunctor.Biff
 
Methods
showsPrec :: Int -> Biff p f g a b -> ShowS #
show :: Biff p f g a b -> String #
showList :: [Biff p f g a b] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j) => Show (a, b, c, d, e, f, g, h, i, j)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k) => Show (a, b, c, d, e, f, g, h, i, j, k)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j, k) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j, k)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l) => Show (a, b, c, d, e, f, g, h, i, j, k, l)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j, k, l) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j, k, l)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] -> ShowS #
 (Show a, Show b, Show c, Show d, Show e, Show f, Show g, Show h, Show i, Show j, Show k, Show l, Show m, Show n, Show o) => Show (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)
Since: base-2.1
Instance details
Defined in GHC.Show
 
Methods
showsPrec :: Int -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> ShowS #
show :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> String #
showList :: [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] -> ShowS #
class Functor f => Applicative (f :: Type -> Type) where #
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:
As a consequence of these laws, the Functor instance for f will satisfy
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
(which implies that pure and <*> satisfy the applicative functor laws).
Minimal complete definition
pure, ((<*>) | liftA2)
Methods
pure :: a -> f a #
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*> that is more
+ efficient than the default one.
Instances
 Applicative []
Since: base-2.1
Instance details
Defined in GHC.Base
 
Methods
pure :: a -> [a] #
(<*>) :: [a -> b] -> [a] -> [b] #
liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] #
(*>) :: [a] -> [b] -> [b] #
(<*) :: [a] -> [b] -> [a] #
 Applicative Maybe
Since: base-2.1
Instance details
Defined in GHC.Base
 
Methods
pure :: a -> Maybe a #
(<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b #
liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #
(*>) :: Maybe a -> Maybe b -> Maybe b #
(<*) :: Maybe a -> Maybe b -> Maybe a #
 Applicative IO
Since: base-2.1
Instance details
Defined in GHC.Base
 
Methods
pure :: a -> IO a #
(<*>) :: IO (a -> b) -> IO a -> IO b #
liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c #
(*>) :: IO a -> IO b -> IO b #
(<*) :: IO a -> IO b -> IO a #
 Applicative Par1
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> Par1 a #
(<*>) :: Par1 (a -> b) -> Par1 a -> Par1 b #
liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c #
(*>) :: Par1 a -> Par1 b -> Par1 b #
(<*) :: Par1 a -> Par1 b -> Par1 a #
 Applicative Q 
Instance details
Defined in Language.Haskell.TH.Syntax
 
Methods
pure :: a -> Q a #
(<*>) :: Q (a -> b) -> Q a -> Q b #
liftA2 :: (a -> b -> c) -> Q a -> Q b -> Q c #
(*>) :: Q a -> Q b -> Q b #
(<*) :: Q a -> Q b -> Q a #
 Applicative IResult 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> IResult a #
(<*>) :: IResult (a -> b) -> IResult a -> IResult b #
liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c #
(*>) :: IResult a -> IResult b -> IResult b #
(<*) :: IResult a -> IResult b -> IResult a #
 Applicative Result 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> Result a #
(<*>) :: Result (a -> b) -> Result a -> Result b #
liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c #
(*>) :: Result a -> Result b -> Result b #
(<*) :: Result a -> Result b -> Result a #
 Applicative Parser 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> Parser a #
(<*>) :: Parser (a -> b) -> Parser a -> Parser b #
liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c #
(*>) :: Parser a -> Parser b -> Parser b #
(<*) :: Parser a -> Parser b -> Parser a #
 Applicative Complex
Since: base-4.9.0.0
Instance details
Defined in Data.Complex
 
Methods
pure :: a -> Complex a #
(<*>) :: Complex (a -> b) -> Complex a -> Complex b #
liftA2 :: (a -> b -> c) -> Complex a -> Complex b -> Complex c #
(*>) :: Complex a -> Complex b -> Complex b #
(<*) :: Complex a -> Complex b -> Complex a #
 Applicative Min
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
pure :: a -> Min a #
(<*>) :: Min (a -> b) -> Min a -> Min b #
liftA2 :: (a -> b -> c) -> Min a -> Min b -> Min c #
(*>) :: Min a -> Min b -> Min b #
(<*) :: Min a -> Min b -> Min a #
 Applicative Max
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
pure :: a -> Max a #
(<*>) :: Max (a -> b) -> Max a -> Max b #
liftA2 :: (a -> b -> c) -> Max a -> Max b -> Max c #
(*>) :: Max a -> Max b -> Max b #
(<*) :: Max a -> Max b -> Max a #
 Applicative First
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
pure :: a -> First a #
(<*>) :: First (a -> b) -> First a -> First b #
liftA2 :: (a -> b -> c) -> First a -> First b -> First c #
(*>) :: First a -> First b -> First b #
(<*) :: First a -> First b -> First a #
 Applicative Last
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
pure :: a -> Last a #
(<*>) :: Last (a -> b) -> Last a -> Last b #
liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c #
(*>) :: Last a -> Last b -> Last b #
(<*) :: Last a -> Last b -> Last a #
 Applicative Option
Since: base-4.9.0.0
Instance details
Defined in Data.Semigroup
 
Methods
pure :: a -> Option a #
(<*>) :: Option (a -> b) -> Option a -> Option b #
liftA2 :: (a -> b -> c) -> Option a -> Option b -> Option c #
(*>) :: Option a -> Option b -> Option b #
(<*) :: Option a -> Option b -> Option a #
 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 Control.Applicative
 
Methods
pure :: a -> ZipList a #
(<*>) :: ZipList (a -> b) -> ZipList a -> ZipList b #
liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c #
(*>) :: ZipList a -> ZipList b -> ZipList b #
(<*) :: ZipList a -> ZipList b -> ZipList a #
 Applicative First 
Instance details
Defined in Data.Monoid
 
Methods
pure :: a -> First a #
(<*>) :: First (a -> b) -> First a -> First b #
liftA2 :: (a -> b -> c) -> First a -> First b -> First c #
(*>) :: First a -> First b -> First b #
(<*) :: First a -> First b -> First a #
 Applicative Last 
Instance details
Defined in Data.Monoid
 
Methods
pure :: a -> Last a #
(<*>) :: Last (a -> b) -> Last a -> Last b #
liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c #
(*>) :: Last a -> Last b -> Last b #
(<*) :: Last a -> Last b -> Last a #
 Applicative Dual
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Dual a #
(<*>) :: Dual (a -> b) -> Dual a -> Dual b #
liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c #
(*>) :: Dual a -> Dual b -> Dual b #
(<*) :: Dual a -> Dual b -> Dual a #
 Applicative Sum
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Sum a #
(<*>) :: Sum (a -> b) -> Sum a -> Sum b #
liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c #
(*>) :: Sum a -> Sum b -> Sum b #
(<*) :: Sum a -> Sum b -> Sum a #
 Applicative Product
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Product a #
(<*>) :: Product (a -> b) -> Product a -> Product b #
liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c #
(*>) :: Product a -> Product b -> Product b #
(<*) :: Product a -> Product b -> Product a #
 Applicative Down
Since: base-4.11.0.0
Instance details
Defined in Data.Ord
 
Methods
pure :: a -> Down a #
(<*>) :: Down (a -> b) -> Down a -> Down b #
liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c #
(*>) :: Down a -> Down b -> Down b #
(<*) :: Down a -> Down b -> Down a #
 Applicative ReadPrec
Since: base-4.6.0.0
Instance details
Defined in Text.ParserCombinators.ReadPrec
 
Methods
pure :: a -> ReadPrec a #
(<*>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b #
liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c #
(*>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #
(<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a #
 Applicative ReadP
Since: base-4.6.0.0
Instance details
Defined in Text.ParserCombinators.ReadP
 
Methods
pure :: a -> ReadP a #
(<*>) :: ReadP (a -> b) -> ReadP a -> ReadP b #
liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c #
(*>) :: ReadP a -> ReadP b -> ReadP b #
(<*) :: ReadP a -> ReadP b -> ReadP a #
 Applicative NonEmpty
Since: base-4.9.0.0
Instance details
Defined in GHC.Base
 
Methods
pure :: a -> NonEmpty a #
(<*>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b #
liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c #
(*>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #
(<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a #
 Applicative PutM 
Instance details
Defined in Data.Binary.Put
 
Methods
pure :: a -> PutM a #
(<*>) :: PutM (a -> b) -> PutM a -> PutM b #
liftA2 :: (a -> b -> c) -> PutM a -> PutM b -> PutM c #
(*>) :: PutM a -> PutM b -> PutM b #
(<*) :: PutM a -> PutM b -> PutM a #
 Applicative Get 
Instance details
Defined in Data.Binary.Get.Internal
 
Methods
pure :: a -> Get a #
(<*>) :: Get (a -> b) -> Get a -> Get b #
liftA2 :: (a -> b -> c) -> Get a -> Get b -> Get c #
(*>) :: Get a -> Get b -> Get b #
(<*) :: Get a -> Get b -> Get a #
 Applicative Put 
Instance details
Defined in Data.ByteString.Builder.Internal
 
Methods
pure :: a -> Put a #
(<*>) :: Put (a -> b) -> Put a -> Put b #
liftA2 :: (a -> b -> c) -> Put a -> Put b -> Put c #
(*>) :: Put a -> Put b -> Put b #
(<*) :: Put a -> Put b -> Put a #
 Applicative Tree 
Instance details
Defined in Data.Tree
 
Methods
pure :: a -> Tree a #
(<*>) :: Tree (a -> b) -> Tree a -> Tree b #
liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c #
(*>) :: Tree a -> Tree b -> Tree b #
(<*) :: Tree a -> Tree b -> Tree a #
 Applicative Seq
Since: containers-0.5.4
Instance details
Defined in Data.Sequence.Internal
 
Methods
pure :: a -> Seq a #
(<*>) :: Seq (a -> b) -> Seq a -> Seq b #
liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c #
(*>) :: Seq a -> Seq b -> Seq b #
(<*) :: Seq a -> Seq b -> Seq a #
 Applicative DList 
Instance details
Defined in Data.DList
 
Methods
pure :: a -> DList a #
(<*>) :: DList (a -> b) -> DList a -> DList b #
liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c #
(*>) :: DList a -> DList b -> DList b #
(<*) :: DList a -> DList b -> DList a #
 Applicative Angle 
Instance details
Defined in Diagrams.Angle
 
Methods
pure :: a -> Angle a #
(<*>) :: Angle (a -> b) -> Angle a -> Angle b #
liftA2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c #
(*>) :: Angle a -> Angle b -> Angle b #
(<*) :: Angle a -> Angle b -> Angle a #
 Applicative V3 
Instance details
Defined in Linear.V3
 
Methods
pure :: a -> V3 a #
(<*>) :: V3 (a -> b) -> V3 a -> V3 b #
liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c #
(*>) :: V3 a -> V3 b -> V3 b #
(<*) :: V3 a -> V3 b -> V3 a #
 Applicative V2 
Instance details
Defined in Linear.V2
 
Methods
pure :: a -> V2 a #
(<*>) :: V2 (a -> b) -> V2 a -> V2 b #
liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c #
(*>) :: V2 a -> V2 b -> V2 b #
(<*) :: V2 a -> V2 b -> V2 a #
 Applicative Polar 
Instance details
Defined in Diagrams.Coordinates.Polar
 
Methods
pure :: a -> Polar a #
(<*>) :: Polar (a -> b) -> Polar a -> Polar b #
liftA2 :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #
(*>) :: Polar a -> Polar b -> Polar b #
(<*) :: Polar a -> Polar b -> Polar a #
 Applicative Array 
Instance details
Defined in Data.Primitive.Array
 
Methods
pure :: a -> Array a #
(<*>) :: Array (a -> b) -> Array a -> Array b #
liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c #
(*>) :: Array a -> Array b -> Array b #
(<*) :: Array a -> Array b -> Array a #
 Applicative Id 
Instance details
Defined in Data.Vector.Fusion.Util
 
Methods
pure :: a -> Id a #
(<*>) :: Id (a -> b) -> Id a -> Id b #
liftA2 :: (a -> b -> c) -> Id a -> Id b -> Id c #
(*>) :: Id a -> Id b -> Id b #
(<*) :: Id a -> Id b -> Id a #
 Applicative P
Since: base-4.5.0.0
Instance details
Defined in Text.ParserCombinators.ReadP
 
Methods
pure :: a -> P a #
(<*>) :: P (a -> b) -> P a -> P b #
liftA2 :: (a -> b -> c) -> P a -> P b -> P c #
(*>) :: P a -> P b -> P b #
(<*) :: P a -> P b -> P a #
 Applicative Box 
Instance details
Defined in Data.Vector.Fusion.Util
 
Methods
pure :: a -> Box a #
(<*>) :: Box (a -> b) -> Box a -> Box b #
liftA2 :: (a -> b -> c) -> Box a -> Box b -> Box c #
(*>) :: Box a -> Box b -> Box b #
(<*) :: Box a -> Box b -> Box a #
 Applicative Vector 
Instance details
Defined in Data.Vector
 
Methods
pure :: a -> Vector a #
(<*>) :: Vector (a -> b) -> Vector a -> Vector b #
liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c #
(*>) :: Vector a -> Vector b -> Vector b #
(<*) :: Vector a -> Vector b -> Vector a #
 Applicative Root 
Instance details
Defined in Numeric.RootFinding
 
Methods
pure :: a -> Root a #
(<*>) :: Root (a -> b) -> Root a -> Root b #
liftA2 :: (a -> b -> c) -> Root a -> Root b -> Root c #
(*>) :: Root a -> Root b -> Root b #
(<*) :: Root a -> Root b -> Root a #
 Applicative Log 
Instance details
Defined in Numeric.Log
 
Methods
pure :: a -> Log a #
(<*>) :: Log (a -> b) -> Log a -> Log b #
liftA2 :: (a -> b -> c) -> Log a -> Log b -> Log c #
(*>) :: Log a -> Log b -> Log b #
(<*) :: Log a -> Log b -> Log a #
 Applicative Parser 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> Parser a #
(<*>) :: Parser (a -> b) -> Parser a -> Parser b #
liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c #
(*>) :: Parser a -> Parser b -> Parser b #
(<*) :: Parser a -> Parser b -> Parser a #
 Applicative Active 
Instance details
Defined in Data.Active
 
Methods
pure :: a -> Active a #
(<*>) :: Active (a -> b) -> Active a -> Active b #
liftA2 :: (a -> b -> c) -> Active a -> Active b -> Active c #
(*>) :: Active a -> Active b -> Active b #
(<*) :: Active a -> Active b -> Active a #
 Applicative Interval 
Instance details
Defined in Numeric.Interval.Kaucher
 
Methods
pure :: a -> Interval a #
(<*>) :: Interval (a -> b) -> Interval a -> Interval b #
liftA2 :: (a -> b -> c) -> Interval a -> Interval b -> Interval c #
(*>) :: Interval a -> Interval b -> Interval b #
(<*) :: Interval a -> Interval b -> Interval a #
 Applicative V1 
Instance details
Defined in Linear.V1
 
Methods
pure :: a -> V1 a #
(<*>) :: V1 (a -> b) -> V1 a -> V1 b #
liftA2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c #
(*>) :: V1 a -> V1 b -> V1 b #
(<*) :: V1 a -> V1 b -> V1 a #
 Applicative Sh 
Instance details
Defined in Shelly.Base
 
Methods
pure :: a -> Sh a #
(<*>) :: Sh (a -> b) -> Sh a -> Sh b #
liftA2 :: (a -> b -> c) -> Sh a -> Sh b -> Sh c #
(*>) :: Sh a -> Sh b -> Sh b #
(<*) :: Sh a -> Sh b -> Sh a #
 Applicative Duration 
Instance details
Defined in Data.Active
 
Methods
pure :: a -> Duration a #
(<*>) :: Duration (a -> b) -> Duration a -> Duration b #
liftA2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c #
(*>) :: Duration a -> Duration b -> Duration b #
(<*) :: Duration a -> Duration b -> Duration a #
 Applicative V4 
Instance details
Defined in Linear.V4
 
Methods
pure :: a -> V4 a #
(<*>) :: V4 (a -> b) -> V4 a -> V4 b #
liftA2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c #
(*>) :: V4 a -> V4 b -> V4 b #
(<*) :: V4 a -> V4 b -> V4 a #
 Applicative Plucker 
Instance details
Defined in Linear.Plucker
 
Methods
pure :: a -> Plucker a #
(<*>) :: Plucker (a -> b) -> Plucker a -> Plucker b #
liftA2 :: (a -> b -> c) -> Plucker a -> Plucker b -> Plucker c #
(*>) :: Plucker a -> Plucker b -> Plucker b #
(<*) :: Plucker a -> Plucker b -> Plucker a #
 Applicative Quaternion 
Instance details
Defined in Linear.Quaternion
 
Methods
pure :: a -> Quaternion a #
(<*>) :: Quaternion (a -> b) -> Quaternion a -> Quaternion b #
liftA2 :: (a -> b -> c) -> Quaternion a -> Quaternion b -> Quaternion c #
(*>) :: Quaternion a -> Quaternion b -> Quaternion b #
(<*) :: Quaternion a -> Quaternion b -> Quaternion a #
 Applicative V0 
Instance details
Defined in Linear.V0
 
Methods
pure :: a -> V0 a #
(<*>) :: V0 (a -> b) -> V0 a -> V0 b #
liftA2 :: (a -> b -> c) -> V0 a -> V0 b -> V0 c #
(*>) :: V0 a -> V0 b -> V0 b #
(<*) :: V0 a -> V0 b -> V0 a #
 Applicative Stream 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
pure :: a -> Stream a #
(<*>) :: Stream (a -> b) -> Stream a -> Stream b #
liftA2 :: (a -> b -> c) -> Stream a -> Stream b -> Stream c #
(*>) :: Stream a -> Stream b -> Stream b #
(<*) :: Stream a -> Stream b -> Stream a #
 Applicative IResult 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> IResult a #
(<*>) :: IResult (a -> b) -> IResult a -> IResult b #
liftA2 :: (a -> b -> c) -> IResult a -> IResult b -> IResult c #
(*>) :: IResult a -> IResult b -> IResult b #
(<*) :: IResult a -> IResult b -> IResult a #
 Applicative Result 
Instance details
Defined in Data.Aeson.Types.Internal
 
Methods
pure :: a -> Result a #
(<*>) :: Result (a -> b) -> Result a -> Result b #
liftA2 :: (a -> b -> c) -> Result a -> Result b -> Result c #
(*>) :: Result a -> Result b -> Result b #
(<*) :: Result a -> Result b -> Result a #
 Applicative P # 
Instance details
Defined in Data.Program
 
Methods
pure :: a -> P a #
(<*>) :: P (a -> b) -> P a -> P b #
liftA2 :: (a -> b -> c) -> P a -> P b -> P c #
(*>) :: P a -> P b -> P b #
(<*) :: P a -> P b -> P a #
 Applicative (Either e)
Since: base-3.0
Instance details
Defined in Data.Either
 
Methods
pure :: a -> Either e a #
(<*>) :: Either e (a -> b) -> Either e a -> Either e b #
liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c #
(*>) :: Either e a -> Either e b -> Either e b #
(<*) :: Either e a -> Either e b -> Either e a #
 Applicative (U1 :: * -> *)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> U1 a #
(<*>) :: U1 (a -> b) -> U1 a -> U1 b #
liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c #
(*>) :: U1 a -> U1 b -> U1 b #
(<*) :: U1 a -> U1 b -> U1 a #
 Monoid a => Applicative ((,) a)
For tuples, the Monoid constraint on a determines
+    = ZipList {getZipList = ["a5","b6b6","c7c7c7"]}
Since: base-2.1
Instance details
Defined in Control.Applicative
 
Methods
pure :: a -> ZipList a #
(<*>) :: ZipList (a -> b) -> ZipList a -> ZipList b #
liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c #
(*>) :: ZipList a -> ZipList b -> ZipList b #
(<*) :: ZipList a -> ZipList b -> ZipList a #
 Applicative Identity
Since: base-4.8.0.0
Instance details
Defined in Data.Functor.Identity
 
Methods
pure :: a -> Identity a #
(<*>) :: Identity (a -> b) -> Identity a -> Identity b #
liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c #
(*>) :: Identity a -> Identity b -> Identity b #
(<*) :: Identity a -> Identity b -> Identity a #
 Applicative First
Since: base-4.8.0.0
Instance details
Defined in Data.Monoid
 
Methods
pure :: a -> First a #
(<*>) :: First (a -> b) -> First a -> First b #
liftA2 :: (a -> b -> c) -> First a -> First b -> First c #
(*>) :: First a -> First b -> First b #
(<*) :: First a -> First b -> First a #
 Applicative Last
Since: base-4.8.0.0
Instance details
Defined in Data.Monoid
 
Methods
pure :: a -> Last a #
(<*>) :: Last (a -> b) -> Last a -> Last b #
liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c #
(*>) :: Last a -> Last b -> Last b #
(<*) :: Last a -> Last b -> Last a #
 Applicative Dual
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Dual a #
(<*>) :: Dual (a -> b) -> Dual a -> Dual b #
liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c #
(*>) :: Dual a -> Dual b -> Dual b #
(<*) :: Dual a -> Dual b -> Dual a #
 Applicative Sum
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Sum a #
(<*>) :: Sum (a -> b) -> Sum a -> Sum b #
liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c #
(*>) :: Sum a -> Sum b -> Sum b #
(<*) :: Sum a -> Sum b -> Sum a #
 Applicative Product
Since: base-4.8.0.0
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Product a #
(<*>) :: Product (a -> b) -> Product a -> Product b #
liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c #
(*>) :: Product a -> Product b -> Product b #
(<*) :: Product a -> Product b -> Product a #
 Applicative Down
Since: base-4.11.0.0
Instance details
Defined in Data.Ord
 
Methods
pure :: a -> Down a #
(<*>) :: Down (a -> b) -> Down a -> Down b #
liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c #
(*>) :: Down a -> Down b -> Down b #
(<*) :: Down a -> Down b -> Down a #
 Applicative ReadPrec
Since: base-4.6.0.0
Instance details
Defined in Text.ParserCombinators.ReadPrec
 
Methods
pure :: a -> ReadPrec a #
(<*>) :: ReadPrec (a -> b) -> ReadPrec a -> ReadPrec b #
liftA2 :: (a -> b -> c) -> ReadPrec a -> ReadPrec b -> ReadPrec c #
(*>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #
(<*) :: ReadPrec a -> ReadPrec b -> ReadPrec a #
 Applicative ReadP
Since: base-4.6.0.0
Instance details
Defined in Text.ParserCombinators.ReadP
 
Methods
pure :: a -> ReadP a #
(<*>) :: ReadP (a -> b) -> ReadP a -> ReadP b #
liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c #
(*>) :: ReadP a -> ReadP b -> ReadP b #
(<*) :: ReadP a -> ReadP b -> ReadP a #
 Applicative NonEmpty
Since: base-4.9.0.0
Instance details
Defined in GHC.Base
 
Methods
pure :: a -> NonEmpty a #
(<*>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b #
liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c #
(*>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #
(<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a #
 Applicative PutM 
Instance details
Defined in Data.Binary.Put
 
Methods
pure :: a -> PutM a #
(<*>) :: PutM (a -> b) -> PutM a -> PutM b #
liftA2 :: (a -> b -> c) -> PutM a -> PutM b -> PutM c #
(*>) :: PutM a -> PutM b -> PutM b #
(<*) :: PutM a -> PutM b -> PutM a #
 Applicative Get 
Instance details
Defined in Data.Binary.Get.Internal
 
Methods
pure :: a -> Get a #
(<*>) :: Get (a -> b) -> Get a -> Get b #
liftA2 :: (a -> b -> c) -> Get a -> Get b -> Get c #
(*>) :: Get a -> Get b -> Get b #
(<*) :: Get a -> Get b -> Get a #
 Applicative Put 
Instance details
Defined in Data.ByteString.Builder.Internal
 
Methods
pure :: a -> Put a #
(<*>) :: Put (a -> b) -> Put a -> Put b #
liftA2 :: (a -> b -> c) -> Put a -> Put b -> Put c #
(*>) :: Put a -> Put b -> Put b #
(<*) :: Put a -> Put b -> Put a #
 Applicative Parser 
Instance details
Defined in Data.Csv.Conversion
 
Methods
pure :: a -> Parser a #
(<*>) :: Parser (a -> b) -> Parser a -> Parser b #
liftA2 :: (a -> b -> c) -> Parser a -> Parser b -> Parser c #
(*>) :: Parser a -> Parser b -> Parser b #
(<*) :: Parser a -> Parser b -> Parser a #
 Applicative Tree 
Instance details
Defined in Data.Tree
 
Methods
pure :: a -> Tree a #
(<*>) :: Tree (a -> b) -> Tree a -> Tree b #
liftA2 :: (a -> b -> c) -> Tree a -> Tree b -> Tree c #
(*>) :: Tree a -> Tree b -> Tree b #
(<*) :: Tree a -> Tree b -> Tree a #
 Applicative Seq
Since: containers-0.5.4
Instance details
Defined in Data.Sequence.Internal
 
Methods
pure :: a -> Seq a #
(<*>) :: Seq (a -> b) -> Seq a -> Seq b #
liftA2 :: (a -> b -> c) -> Seq a -> Seq b -> Seq c #
(*>) :: Seq a -> Seq b -> Seq b #
(<*) :: Seq a -> Seq b -> Seq a #
 Applicative DList 
Instance details
Defined in Data.DList
 
Methods
pure :: a -> DList a #
(<*>) :: DList (a -> b) -> DList a -> DList b #
liftA2 :: (a -> b -> c) -> DList a -> DList b -> DList c #
(*>) :: DList a -> DList b -> DList b #
(<*) :: DList a -> DList b -> DList a #
 Applicative Interval 
Instance details
Defined in Numeric.Interval.Kaucher
 
Methods
pure :: a -> Interval a #
(<*>) :: Interval (a -> b) -> Interval a -> Interval b #
liftA2 :: (a -> b -> c) -> Interval a -> Interval b -> Interval c #
(*>) :: Interval a -> Interval b -> Interval b #
(<*) :: Interval a -> Interval b -> Interval a #
 Applicative SmallArray 
Instance details
Defined in Data.Primitive.SmallArray
 
Methods
pure :: a -> SmallArray a #
(<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b #
liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c #
(*>) :: SmallArray a -> SmallArray b -> SmallArray b #
(<*) :: SmallArray a -> SmallArray b -> SmallArray a #
 Applicative Array 
Instance details
Defined in Data.Primitive.Array
 
Methods
pure :: a -> Array a #
(<*>) :: Array (a -> b) -> Array a -> Array b #
liftA2 :: (a -> b -> c) -> Array a -> Array b -> Array c #
(*>) :: Array a -> Array b -> Array b #
(<*) :: Array a -> Array b -> Array a #
 Applicative Vector 
Instance details
Defined in Data.Vector
 
Methods
pure :: a -> Vector a #
(<*>) :: Vector (a -> b) -> Vector a -> Vector b #
liftA2 :: (a -> b -> c) -> Vector a -> Vector b -> Vector c #
(*>) :: Vector a -> Vector b -> Vector b #
(<*) :: Vector a -> Vector b -> Vector a #
 Applicative Id 
Instance details
Defined in Data.Vector.Fusion.Util
 
Methods
pure :: a -> Id a #
(<*>) :: Id (a -> b) -> Id a -> Id b #
liftA2 :: (a -> b -> c) -> Id a -> Id b -> Id c #
(*>) :: Id a -> Id b -> Id b #
(<*) :: Id a -> Id b -> Id a #
 Applicative Box 
Instance details
Defined in Data.Vector.Fusion.Util
 
Methods
pure :: a -> Box a #
(<*>) :: Box (a -> b) -> Box a -> Box b #
liftA2 :: (a -> b -> c) -> Box a -> Box b -> Box c #
(*>) :: Box a -> Box b -> Box b #
(<*) :: Box a -> Box b -> Box a #
 Applicative Stream 
Instance details
Defined in Codec.Compression.Zlib.Stream
 
Methods
pure :: a -> Stream a #
(<*>) :: Stream (a -> b) -> Stream a -> Stream b #
liftA2 :: (a -> b -> c) -> Stream a -> Stream b -> Stream c #
(*>) :: Stream a -> Stream b -> Stream b #
(<*) :: Stream a -> Stream b -> Stream a #
 Applicative P
Since: base-4.5.0.0
Instance details
Defined in Text.ParserCombinators.ReadP
 
Methods
pure :: a -> P a #
(<*>) :: P (a -> b) -> P a -> P b #
liftA2 :: (a -> b -> c) -> P a -> P b -> P c #
(*>) :: P a -> P b -> P b #
(<*) :: P a -> P b -> P a #
 Applicative Root 
Instance details
Defined in Numeric.RootFinding
 
Methods
pure :: a -> Root a #
(<*>) :: Root (a -> b) -> Root a -> Root b #
liftA2 :: (a -> b -> c) -> Root a -> Root b -> Root c #
(*>) :: Root a -> Root b -> Root b #
(<*) :: Root a -> Root b -> Root a #
 Applicative Log 
Instance details
Defined in Numeric.Log
 
Methods
pure :: a -> Log a #
(<*>) :: Log (a -> b) -> Log a -> Log b #
liftA2 :: (a -> b -> c) -> Log a -> Log b -> Log c #
(*>) :: Log a -> Log b -> Log b #
(<*) :: Log a -> Log b -> Log a #
 Applicative P # 
Instance details
Defined in Data.Program
 
Methods
pure :: a -> P a #
(<*>) :: P (a -> b) -> P a -> P b #
liftA2 :: (a -> b -> c) -> P a -> P b -> P c #
(*>) :: P a -> P b -> P b #
(<*) :: P a -> P b -> P a #
 Applicative V2 
Instance details
Defined in Linear.V2
 
Methods
pure :: a -> V2 a #
(<*>) :: V2 (a -> b) -> V2 a -> V2 b #
liftA2 :: (a -> b -> c) -> V2 a -> V2 b -> V2 c #
(*>) :: V2 a -> V2 b -> V2 b #
(<*) :: V2 a -> V2 b -> V2 a #
 Applicative Polar 
Instance details
Defined in Diagrams.Coordinates.Polar
 
Methods
pure :: a -> Polar a #
(<*>) :: Polar (a -> b) -> Polar a -> Polar b #
liftA2 :: (a -> b -> c) -> Polar a -> Polar b -> Polar c #
(*>) :: Polar a -> Polar b -> Polar b #
(<*) :: Polar a -> Polar b -> Polar a #
 Applicative Active 
Instance details
Defined in Data.Active
 
Methods
pure :: a -> Active a #
(<*>) :: Active (a -> b) -> Active a -> Active b #
liftA2 :: (a -> b -> c) -> Active a -> Active b -> Active c #
(*>) :: Active a -> Active b -> Active b #
(<*) :: Active a -> Active b -> Active a #
 Applicative V3 
Instance details
Defined in Linear.V3
 
Methods
pure :: a -> V3 a #
(<*>) :: V3 (a -> b) -> V3 a -> V3 b #
liftA2 :: (a -> b -> c) -> V3 a -> V3 b -> V3 c #
(*>) :: V3 a -> V3 b -> V3 b #
(<*) :: V3 a -> V3 b -> V3 a #
 Applicative Angle 
Instance details
Defined in Diagrams.Angle
 
Methods
pure :: a -> Angle a #
(<*>) :: Angle (a -> b) -> Angle a -> Angle b #
liftA2 :: (a -> b -> c) -> Angle a -> Angle b -> Angle c #
(*>) :: Angle a -> Angle b -> Angle b #
(<*) :: Angle a -> Angle b -> Angle a #
 Applicative V1 
Instance details
Defined in Linear.V1
 
Methods
pure :: a -> V1 a #
(<*>) :: V1 (a -> b) -> V1 a -> V1 b #
liftA2 :: (a -> b -> c) -> V1 a -> V1 b -> V1 c #
(*>) :: V1 a -> V1 b -> V1 b #
(<*) :: V1 a -> V1 b -> V1 a #
 Applicative Sh 
Instance details
Defined in Shelly.Base
 
Methods
pure :: a -> Sh a #
(<*>) :: Sh (a -> b) -> Sh a -> Sh b #
liftA2 :: (a -> b -> c) -> Sh a -> Sh b -> Sh c #
(*>) :: Sh a -> Sh b -> Sh b #
(<*) :: Sh a -> Sh b -> Sh a #
 Applicative Duration 
Instance details
Defined in Data.Active
 
Methods
pure :: a -> Duration a #
(<*>) :: Duration (a -> b) -> Duration a -> Duration b #
liftA2 :: (a -> b -> c) -> Duration a -> Duration b -> Duration c #
(*>) :: Duration a -> Duration b -> Duration b #
(<*) :: Duration a -> Duration b -> Duration a #
 Applicative Plucker 
Instance details
Defined in Linear.Plucker
 
Methods
pure :: a -> Plucker a #
(<*>) :: Plucker (a -> b) -> Plucker a -> Plucker b #
liftA2 :: (a -> b -> c) -> Plucker a -> Plucker b -> Plucker c #
(*>) :: Plucker a -> Plucker b -> Plucker b #
(<*) :: Plucker a -> Plucker b -> Plucker a #
 Applicative Quaternion 
Instance details
Defined in Linear.Quaternion
 
Methods
pure :: a -> Quaternion a #
(<*>) :: Quaternion (a -> b) -> Quaternion a -> Quaternion b #
liftA2 :: (a -> b -> c) -> Quaternion a -> Quaternion b -> Quaternion c #
(*>) :: Quaternion a -> Quaternion b -> Quaternion b #
(<*) :: Quaternion a -> Quaternion b -> Quaternion a #
 Applicative V0 
Instance details
Defined in Linear.V0
 
Methods
pure :: a -> V0 a #
(<*>) :: V0 (a -> b) -> V0 a -> V0 b #
liftA2 :: (a -> b -> c) -> V0 a -> V0 b -> V0 c #
(*>) :: V0 a -> V0 b -> V0 b #
(<*) :: V0 a -> V0 b -> V0 a #
 Applicative V4 
Instance details
Defined in Linear.V4
 
Methods
pure :: a -> V4 a #
(<*>) :: V4 (a -> b) -> V4 a -> V4 b #
liftA2 :: (a -> b -> c) -> V4 a -> V4 b -> V4 c #
(*>) :: V4 a -> V4 b -> V4 b #
(<*) :: V4 a -> V4 b -> V4 a #
 Applicative (Either e)
Since: base-3.0
Instance details
Defined in Data.Either
 
Methods
pure :: a -> Either e a #
(<*>) :: Either e (a -> b) -> Either e a -> Either e b #
liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c #
(*>) :: Either e a -> Either e b -> Either e b #
(<*) :: Either e a -> Either e b -> Either e a #
 Applicative (U1 :: Type -> Type)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> U1 a #
(<*>) :: U1 (a -> b) -> U1 a -> U1 b #
liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c #
(*>) :: U1 a -> U1 b -> U1 b #
(<*) :: U1 a -> U1 b -> U1 a #
 Monoid a => Applicative ((,) a)
For tuples, the Monoid constraint on a determines
  how the first values merge.
  For example, Strings concatenate:
("hello ", (+15)) <*> ("world!", 2002)
-("hello world!",2017)
Since: base-2.1
Instance details
Defined in GHC.Base
 
Methods
pure :: a0 -> (a, a0) #
(<*>) :: (a, a0 -> b) -> (a, a0) -> (a, b) #
liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) #
(*>) :: (a, a0) -> (a, b) -> (a, b) #
(<*) :: (a, a0) -> (a, b) -> (a, a0) #
 Applicative (ReifiedGetter s) 
Instance details
Defined in Control.Lens.Reified
 
Methods
pure :: a -> ReifiedGetter s a #
(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #
liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c #
(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #
(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #
 Applicative (ReifiedFold s) 
Instance details
Defined in Control.Lens.Reified
 
Methods
pure :: a -> ReifiedFold s a #
(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b #
liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c #
(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #
(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #
 Monad m => Applicative (WrappedMonad m)
Since: base-2.1
Instance details
Defined in Control.Applicative
 
Methods
pure :: a -> WrappedMonad m a #
(<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b #
liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c #
(*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #
(<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a #
 Arrow a => Applicative (ArrowMonad a)
Since: base-4.6.0.0
Instance details
Defined in Control.Arrow
 
Methods
pure :: a0 -> ArrowMonad a a0 #
(<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #
liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c #
(*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #
(<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 #
 Applicative (Proxy :: * -> *)
Since: base-4.7.0.0
Instance details
Defined in Data.Proxy
 
Methods
pure :: a -> Proxy a #
(<*>) :: Proxy (a -> b) -> Proxy a -> Proxy b #
liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c #
(*>) :: Proxy a -> Proxy b -> Proxy b #
(<*) :: Proxy a -> Proxy b -> Proxy a #
 (Functor m, Monad m) => Applicative (MaybeT m) 
Instance details
Defined in Control.Monad.Trans.Maybe
 
Methods
pure :: a -> MaybeT m a #
(<*>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b #
liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c #
(*>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #
(<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a #
 Applicative m => Applicative (ListT m) 
Instance details
Defined in Control.Monad.Trans.List
 
Methods
pure :: a -> ListT m a #
(<*>) :: ListT m (a -> b) -> ListT m a -> ListT m b #
liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c #
(*>) :: ListT m a -> ListT m b -> ListT m b #
(<*) :: ListT m a -> ListT m b -> ListT m a #
 Applicative f => Applicative (Point f) 
Instance details
Defined in Linear.Affine
 
Methods
pure :: a -> Point f a #
(<*>) :: Point f (a -> b) -> Point f a -> Point f b #
liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c #
(*>) :: Point f a -> Point f b -> Point f b #
(<*) :: Point f a -> Point f b -> Point f a #
 Applicative (AbstractArray i) # 
Instance details
Defined in Data.Array.Abstract
 
Methods
pure :: a -> AbstractArray i a #
(<*>) :: AbstractArray i (a -> b) -> AbstractArray i a -> AbstractArray i b #
liftA2 :: (a -> b -> c) -> AbstractArray i a -> AbstractArray i b -> AbstractArray i c #
(*>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #
(<*) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i a #
 Fractional p => Applicative (Categorical p) 
Instance details
Defined in Data.Random.Distribution.Categorical
 
Methods
pure :: a -> Categorical p a #
(<*>) :: Categorical p (a -> b) -> Categorical p a -> Categorical p b #
liftA2 :: (a -> b -> c) -> Categorical p a -> Categorical p b -> Categorical p c #
(*>) :: Categorical p a -> Categorical p b -> Categorical p b #
(<*) :: Categorical p a -> Categorical p b -> Categorical p a #
 Applicative (Measured n) 
Instance details
Defined in Diagrams.Core.Measure
 
Methods
pure :: a -> Measured n a #
(<*>) :: Measured n (a -> b) -> Measured n a -> Measured n b #
liftA2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c #
(*>) :: Measured n a -> Measured n b -> Measured n b #
(<*) :: Measured n a -> Measured n b -> Measured n a #
 Apply f => Applicative (MaybeApply f) 
Instance details
Defined in Data.Functor.Bind.Class
 
Methods
pure :: a -> MaybeApply f a #
(<*>) :: MaybeApply f (a -> b) -> MaybeApply f a -> MaybeApply f b #
liftA2 :: (a -> b -> c) -> MaybeApply f a -> MaybeApply f b -> MaybeApply f c #
(*>) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f b #
(<*) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f a #
 Applicative (Parser i) 
Instance details
Defined in Data.Attoparsec.Internal.Types
 
Methods
pure :: a -> Parser i a #
(<*>) :: Parser i (a -> b) -> Parser i a -> Parser i b #
liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c #
(*>) :: Parser i a -> Parser i b -> Parser i b #
(<*) :: Parser i a -> Parser i b -> Parser i a #
 Representable f => Applicative (Co f) 
Instance details
Defined in Data.Functor.Rep
 
Methods
pure :: a -> Co f a #
(<*>) :: Co f (a -> b) -> Co f a -> Co f b #
liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c #
(*>) :: Co f a -> Co f b -> Co f b #
(<*) :: Co f a -> Co f b -> Co f a #
 Alternative f => Applicative (Cofree f) 
Instance details
Defined in Control.Comonad.Cofree
 
Methods
pure :: a -> Cofree f a #
(<*>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b #
liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c #
(*>) :: Cofree f a -> Cofree f b -> Cofree f b #
(<*) :: Cofree f a -> Cofree f b -> Cofree f a #
 Applicative f => Applicative (WrappedApplicative f) 
Instance details
Defined in Data.Functor.Bind.Class
 
Methods
pure :: a -> WrappedApplicative f a #
(<*>) :: WrappedApplicative f (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #
liftA2 :: (a -> b -> c) -> WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f c #
(*>) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f b #
(<*) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f a #
 Applicative f => Applicative (Indexing f) 
Instance details
Defined in Control.Lens.Internal.Indexed
 
Methods
pure :: a -> Indexing f a #
(<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b #
liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c #
(*>) :: Indexing f a -> Indexing f b -> Indexing f b #
(<*) :: Indexing f a -> Indexing f b -> Indexing f a #
 Applicative (SetM s) 
Instance details
Defined in Data.Graph
 
Methods
pure :: a -> SetM s a #
(<*>) :: SetM s (a -> b) -> SetM s a -> SetM s b #
liftA2 :: (a -> b -> c) -> SetM s a -> SetM s b -> SetM s c #
(*>) :: SetM s a -> SetM s b -> SetM s b #
(<*) :: SetM s a -> SetM s b -> SetM s a #
 Functor f => Applicative (Free f) 
Instance details
Defined in Control.Monad.Free
 
Methods
pure :: a -> Free f a #
(<*>) :: Free f (a -> b) -> Free f a -> Free f b #
liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c #
(*>) :: Free f a -> Free f b -> Free f b #
(<*) :: Free f a -> Free f b -> Free f a #
 Applicative f => Applicative (Yoneda f) 
Instance details
Defined in Data.Functor.Yoneda
 
Methods
pure :: a -> Yoneda f a #
(<*>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b #
liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c #
(*>) :: Yoneda f a -> Yoneda f b -> Yoneda f b #
(<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a #
 Applicative f => Applicative (Indexing64 f) 
Instance details
Defined in Control.Lens.Internal.Indexed
 
Methods
pure :: a -> Indexing64 f a #
(<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b #
liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c #
(*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b #
(<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a #
 (Applicative (Rep p), Representable p) => Applicative (Prep p) 
Instance details
Defined in Data.Profunctor.Rep
 
Methods
pure :: a -> Prep p a #
(<*>) :: Prep p (a -> b) -> Prep p a -> Prep p b #
liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c #
(*>) :: Prep p a -> Prep p b -> Prep p b #
(<*) :: Prep p a -> Prep p b -> Prep p a #
 Applicative f => Applicative (Rec1 f)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> Rec1 f a #
(<*>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b #
liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c #
(*>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #
(<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a #
 Applicative (Indexed i a) 
Instance details
Defined in Control.Lens.Internal.Indexed
 
Methods
pure :: a0 -> Indexed i a a0 #
(<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b #
liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c #
(*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #
(<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #
 Monoid m => Applicative (Const m :: * -> *)
Since: base-2.0.1
Instance details
Defined in Data.Functor.Const
 
Methods
pure :: a -> Const m a #
(<*>) :: Const m (a -> b) -> Const m a -> Const m b #
liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c #
(*>) :: Const m a -> Const m b -> Const m b #
(<*) :: Const m a -> Const m b -> Const m a #
 Arrow a => Applicative (WrappedArrow a b)
Since: base-2.1
Instance details
Defined in Control.Applicative
 
Methods
pure :: a0 -> WrappedArrow a b a0 #
(<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 #
liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c #
(*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 #
(<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #
 Applicative f => Applicative (Alt f) 
Instance details
Defined in Data.Semigroup.Internal
 
Methods
pure :: a -> Alt f a #
(<*>) :: Alt f (a -> b) -> Alt f a -> Alt f b #
liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c #
(*>) :: Alt f a -> Alt f b -> Alt f b #
(<*) :: Alt f a -> Alt f b -> Alt f a #
 Applicative m => Applicative (IdentityT m) 
Instance details
Defined in Control.Monad.Trans.Identity
 
Methods
pure :: a -> IdentityT m a #
(<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b #
liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c #
(*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #
(<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #
 (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 #
(<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b #
liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c #
(*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #
(<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a #
 (Functor m, Monad m) => Applicative (ExceptT e m) 
Instance details
Defined in Control.Monad.Trans.Except
 
Methods
pure :: a -> ExceptT e m a #
(<*>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b #
liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c #
(*>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #
(<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a #
 (Functor m, Monad m) => Applicative (ErrorT e m) 
Instance details
Defined in Control.Monad.Trans.Error
 
Methods
pure :: a -> ErrorT e m a #
(<*>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b #
liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c #
(*>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #
(<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a #
 Applicative f => Applicative (Backwards f)
Apply f-actions in the reverse order.
Instance details
Defined in Control.Applicative.Backwards
 
Methods
pure :: a -> Backwards f a #
(<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b #
liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c #
(*>) :: Backwards f a -> Backwards f b -> Backwards f b #
(<*) :: Backwards f a -> Backwards f b -> Backwards f a #
 (Monoid w, Applicative m) => Applicative (WriterT w m) 
Instance details
Defined in Control.Monad.Trans.Writer.Lazy
 
Methods
pure :: a -> WriterT w m a #
(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b #
liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c #
(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #
(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
 (Functor m, Monad m) => Applicative (StateT s m) 
Instance details
Defined in Control.Monad.Trans.State.Lazy
 
Methods
pure :: a -> StateT s m a #
(<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b #
liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c #
(*>) :: StateT s m a -> StateT s m b -> StateT s m b #
(<*) :: StateT s m a -> StateT s m b -> StateT s m a #
 (Functor m, Monad m) => Applicative (StateT s m) 
Instance details
Defined in Control.Monad.Trans.State.Strict
 
Methods
pure :: a -> StateT s m a #
(<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b #
liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c #
(*>) :: StateT s m a -> StateT s m b -> StateT s m b #
(<*) :: StateT s m a -> StateT s m b -> StateT s m a #
 (Monoid w, Applicative m) => Applicative (WriterT w m) 
Instance details
Defined in Control.Monad.Trans.Writer.Strict
 
Methods
pure :: a -> WriterT w m a #
(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b #
liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c #
(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #
(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #
 Monad m => Applicative (RandT g m) 
Instance details
Defined in Control.Monad.Trans.Random.Lazy
 
Methods
pure :: a -> RandT g m a #
(<*>) :: RandT g m (a -> b) -> RandT g m a -> RandT g m b #
liftA2 :: (a -> b -> c) -> RandT g m a -> RandT g m b -> RandT g m c #
(*>) :: RandT g m a -> RandT g m b -> RandT g m b #
(<*) :: RandT g m a -> RandT g m b -> RandT g m a #
 Biapplicative p => Applicative (Join p) 
Instance details
Defined in Data.Bifunctor.Join
 
Methods
pure :: a -> Join p a #
(<*>) :: Join p (a -> b) -> Join p a -> Join p b #
liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c #
(*>) :: Join p a -> Join p b -> Join p b #
(<*) :: Join p a -> Join p b -> Join p a #
 Applicative (Tagged s) 
Instance details
Defined in Data.Tagged
 
Methods
pure :: a -> Tagged s a #
(<*>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b #
liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c #
(*>) :: Tagged s a -> Tagged s b -> Tagged s b #
(<*) :: Tagged s a -> Tagged s b -> Tagged s a #
 Applicative (Mag a b) 
Instance details
Defined in Data.Biapplicative
 
Methods
pure :: a0 -> Mag a b a0 #
(<*>) :: Mag a b (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #
liftA2 :: (a0 -> b0 -> c) -> Mag a b a0 -> Mag a b b0 -> Mag a b c #
(*>) :: Mag a b a0 -> Mag a b b0 -> Mag a b b0 #
(<*) :: Mag a b a0 -> Mag a b b0 -> Mag a b a0 #
 Applicative (Query v n) 
Instance details
Defined in Diagrams.Core.Query
 
Methods
pure :: a -> Query v n a #
(<*>) :: Query v n (a -> b) -> Query v n a -> Query v n b #
liftA2 :: (a -> b -> c) -> Query v n a -> Query v n b -> Query v n c #
(*>) :: Query v n a -> Query v n b -> Query v n b #
(<*) :: Query v n a -> Query v n b -> Query v n a #
 (Alternative f, Applicative w) => Applicative (CofreeT f w) 
Instance details
Defined in Control.Comonad.Trans.Cofree
 
Methods
pure :: a -> CofreeT f w a #
(<*>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b #
liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c #
(*>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #
(<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a #
 Applicative (Costar f a) 
Instance details
Defined in Data.Profunctor.Types
 
Methods
pure :: a0 -> Costar f a a0 #
(<*>) :: Costar f a (a0 -> b) -> Costar f a a0 -> Costar f a b #
liftA2 :: (a0 -> b -> c) -> Costar f a a0 -> Costar f a b -> Costar f a c #
(*>) :: Costar f a a0 -> Costar f a b -> Costar f a b #
(<*) :: Costar f a a0 -> Costar f a b -> Costar f a a0 #
 Biapplicative p => Applicative (Fix p) 
Instance details
Defined in Data.Bifunctor.Fix
 
Methods
pure :: a -> Fix p a #
(<*>) :: Fix p (a -> b) -> Fix p a -> Fix p b #
liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c #
(*>) :: Fix p a -> Fix p b -> Fix p b #
(<*) :: Fix p a -> Fix p b -> Fix p a #
 (Functor f, Monad m) => Applicative (FreeT f m) 
Instance details
Defined in Control.Monad.Trans.Free
 
Methods
pure :: a -> FreeT f m a #
(<*>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b #
liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c #
(*>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #
(<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a #
 Applicative f => Applicative (Star f a) 
Instance details
Defined in Data.Profunctor.Types
 
Methods
pure :: a0 -> Star f a a0 #
(<*>) :: Star f a (a0 -> b) -> Star f a a0 -> Star f a b #
liftA2 :: (a0 -> b -> c) -> Star f a a0 -> Star f a b -> Star f a c #
(*>) :: Star f a a0 -> Star f a b -> Star f a b #
(<*) :: Star f a a0 -> Star f a b -> Star f a a0 #
 Dim n => Applicative (V n) 
Instance details
Defined in Linear.V
 
Methods
pure :: a -> V n a #
(<*>) :: V n (a -> b) -> V n a -> V n b #
liftA2 :: (a -> b -> c) -> V n a -> V n b -> V n c #
(*>) :: V n a -> V n b -> V n b #
(<*) :: V n a -> V n b -> V n a #
 (Applicative f, Applicative g) => Applicative (Day f g) 
Instance details
Defined in Data.Functor.Day
 
Methods
pure :: a -> Day f g a #
(<*>) :: Day f g (a -> b) -> Day f g a -> Day f g b #
liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c #
(*>) :: Day f g a -> Day f g b -> Day f g b #
(<*) :: Day f g a -> Day f g b -> Day f g a #
 (Profunctor p, Arrow p) => Applicative (Tambara p a) 
Instance details
Defined in Data.Profunctor.Strong
 
Methods
pure :: a0 -> Tambara p a a0 #
(<*>) :: Tambara p a (a0 -> b) -> Tambara p a a0 -> Tambara p a b #
liftA2 :: (a0 -> b -> c) -> Tambara p a a0 -> Tambara p a b -> Tambara p a c #
(*>) :: Tambara p a a0 -> Tambara p a b -> Tambara p a b #
(<*) :: Tambara p a a0 -> Tambara p a b -> Tambara p a a0 #
 Monoid m => Applicative (Holes t m) 
Instance details
Defined in Control.Lens.Traversal
 
Methods
pure :: a -> Holes t m a #
(<*>) :: Holes t m (a -> b) -> Holes t m a -> Holes t m b #
liftA2 :: (a -> b -> c) -> Holes t m a -> Holes t m b -> Holes t m c #
(*>) :: Holes t m a -> Holes t m b -> Holes t m b #
(<*) :: Holes t m a -> Holes t m b -> Holes t m a #
 (Functor g, g ~ h) => Applicative (Curried g h) 
Instance details
Defined in Data.Functor.Day.Curried
 
Methods
pure :: a -> Curried g h a #
(<*>) :: Curried g h (a -> b) -> Curried g h a -> Curried g h b #
liftA2 :: (a -> b -> c) -> Curried g h a -> Curried g h b -> Curried g h c #
(*>) :: Curried g h a -> Curried g h b -> Curried g h b #
(<*) :: Curried g h a -> Curried g h b -> Curried g h a #
 Applicative (Mafic a b) 
Instance details
Defined in Control.Lens.Internal.Magma
 
Methods
pure :: a0 -> Mafic a b a0 #
(<*>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #
liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c #
(*>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0 #
(<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0 #
 Applicative (Flows i b) 
Instance details
Defined in Control.Lens.Internal.Level
 
Methods
pure :: a -> Flows i b a #
(<*>) :: Flows i b (a -> b0) -> Flows i b a -> Flows i b b0 #
liftA2 :: (a -> b0 -> c) -> Flows i b a -> Flows i b b0 -> Flows i b c #
(*>) :: Flows i b a -> Flows i b b0 -> Flows i b b0 #
(<*) :: Flows i b a -> Flows i b b0 -> Flows i b a #
 Applicative ((->) a :: * -> *)
Since: base-2.1
Instance details
Defined in GHC.Base
 
Methods
pure :: a0 -> a -> a0 #
(<*>) :: (a -> a0 -> b) -> (a -> a0) -> a -> b #
liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c #
(*>) :: (a -> a0) -> (a -> b) -> a -> b #
(<*) :: (a -> a0) -> (a -> b) -> a -> a0 #
 (Applicative f, Applicative g) => Applicative (f :*: g)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> (f :*: g) a #
(<*>) :: (f :*: g) (a -> b) -> (f :*: g) a -> (f :*: g) b #
liftA2 :: (a -> b -> c) -> (f :*: g) a -> (f :*: g) b -> (f :*: g) c #
(*>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #
(<*) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) a #
 Applicative (Bazaar p a b) 
Instance details
Defined in Control.Lens.Internal.Bazaar
 
Methods
pure :: a0 -> Bazaar p a b a0 #
(<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #
liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c #
(*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #
(<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #
 (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 #
(<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b #
liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c #
(*>) :: Product f g a -> Product f g b -> Product f g b #
(<*) :: Product f g a -> Product f g b -> Product f g a #
 (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 #
(<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #
liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c #
(*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #
(<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a #
 (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 #
(<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #
liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c #
(*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #
(<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a #
 Applicative m => Applicative (ReaderT r m) 
Instance details
Defined in Control.Monad.Trans.Reader
 
Methods
pure :: a -> ReaderT r m a #
(<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b #
liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c #
(*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #
(<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #
 Applicative (ContT r m) 
Instance details
Defined in Control.Monad.Trans.Cont
 
Methods
pure :: a -> ContT r m a #
(<*>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b #
liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c #
(*>) :: ContT r m a -> ContT r m b -> ContT r m b #
(<*) :: ContT r m a -> ContT r m b -> ContT r m a #
 Applicative (Molten i a b) 
Instance details
Defined in Control.Lens.Internal.Magma
 
Methods
pure :: a0 -> Molten i a b a0 #
(<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #
liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c #
(*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 #
(<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 #
 Applicative f => Applicative (M1 i c f)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> M1 i c f a #
(<*>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b #
liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 #
(*>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #
(<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a #
 (Applicative f, Applicative g) => Applicative (f :.: g)
Since: base-4.9.0.0
Instance details
Defined in GHC.Generics
 
Methods
pure :: a -> (f :.: g) a #
(<*>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b #
liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c #
(*>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b #
(<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #
 (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 #
(<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b #
liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c #
(*>) :: Compose f g a -> Compose f g b -> Compose f g b #
(<*) :: Compose f g a -> Compose f g b -> Compose f g a #
 (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 #
(<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #
liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c #
(*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #
(<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a #
 (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) 
Instance details
Defined in Control.Monad.Trans.RWS.Lazy
 
Methods
pure :: a -> RWST r w s m a #
(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b #
liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c #
(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #
(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
 (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) 
Instance details
Defined in Control.Monad.Trans.RWS.Strict
 
Methods
pure :: a -> RWST r w s m a #
(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b #
liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c #
(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #
(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #
 Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) 
Instance details
Defined in Data.Reflection
 
Methods
pure :: a -> ReflectedApplicative f s a #
(<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #
liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c #
(*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b #
(<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #
 Applicative (BazaarT p g a b) 
Instance details
Defined in Control.Lens.Internal.Bazaar
 
Methods
pure :: a0 -> BazaarT p g a b a0 #
(<*>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #
liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c #
(*>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 #
(<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #
 Applicative (TakingWhile p f a b) 
Instance details
Defined in Control.Lens.Internal.Magma
 
Methods
pure :: a0 -> TakingWhile p f a b a0 #
(<*>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #
liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c #
(*>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 #
(<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #
 Monad state => Applicative (Builder collection mutCollection step state err) 
Instance details
Defined in Basement.MutableBuilder
 
Methods
pure :: a -> Builder collection mutCollection step state err a #
(<*>) :: Builder collection mutCollection step state err (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #
liftA2 :: (a -> b -> c) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err c #
(*>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #
(<*) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #
class Foldable (t :: * -> *) where #
Data structures that can be folded.
For example, given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Foldable Tree where
+("hello world!",2017)
Since: base-2.1
Instance details

Defined in GHC.Base

Methods

pure :: a0 -> (a, a0) #

(<*>) :: (a, a0 -> b) -> (a, a0) -> (a, b) #

liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) #

(*>) :: (a, a0) -> (a, b) -> (a, b) #

(<*) :: (a, a0) -> (a, b) -> (a, a0) #

Applicative (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

pure :: a -> Parser i a #

(<*>) :: Parser i (a -> b) -> Parser i a -> Parser i b #

liftA2 :: (a -> b -> c) -> Parser i a -> Parser i b -> Parser i c #

(*>) :: Parser i a -> Parser i b -> Parser i b #

(<*) :: Parser i a -> Parser i b -> Parser i a #

Monad m => Applicative (WrappedMonad m)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a -> WrappedMonad m a #

(<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b #

liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c #

(*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #

(<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a #

Arrow a => Applicative (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

pure :: a0 -> ArrowMonad a a0 #

(<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #

liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c #

(*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #

(<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 #

Applicative (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

pure :: a -> Proxy a #

(<*>) :: Proxy (a -> b) -> Proxy a -> Proxy b #

liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c #

(*>) :: Proxy a -> Proxy b -> Proxy b #

(<*) :: Proxy a -> Proxy b -> Proxy a #

(Functor m, Monad m) => Applicative (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

pure :: a -> MaybeT m a #

(<*>) :: MaybeT m (a -> b) -> MaybeT m a -> MaybeT m b #

liftA2 :: (a -> b -> c) -> MaybeT m a -> MaybeT m b -> MaybeT m c #

(*>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #

(<*) :: MaybeT m a -> MaybeT m b -> MaybeT m a #

(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

pure :: a -> Generically1 f a #

(<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b #

liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c #

(*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b #

(<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a #

Applicative m => Applicative (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

pure :: a -> ListT m a #

(<*>) :: ListT m (a -> b) -> ListT m a -> ListT m b #

liftA2 :: (a -> b -> c) -> ListT m a -> ListT m b -> ListT m c #

(*>) :: ListT m a -> ListT m b -> ListT m b #

(<*) :: ListT m a -> ListT m b -> ListT m a #

(Applicative (Rep p), Representable p) => Applicative (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

pure :: a -> Prep p a #

(<*>) :: Prep p (a -> b) -> Prep p a -> Prep p b #

liftA2 :: (a -> b -> c) -> Prep p a -> Prep p b -> Prep p c #

(*>) :: Prep p a -> Prep p b -> Prep p b #

(<*) :: Prep p a -> Prep p b -> Prep p a #

Applicative f => Applicative (WrappedApplicative f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

pure :: a -> WrappedApplicative f a #

(<*>) :: WrappedApplicative f (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #

liftA2 :: (a -> b -> c) -> WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f c #

(*>) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f b #

(<*) :: WrappedApplicative f a -> WrappedApplicative f b -> WrappedApplicative f a #

Apply f => Applicative (MaybeApply f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

pure :: a -> MaybeApply f a #

(<*>) :: MaybeApply f (a -> b) -> MaybeApply f a -> MaybeApply f b #

liftA2 :: (a -> b -> c) -> MaybeApply f a -> MaybeApply f b -> MaybeApply f c #

(*>) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f b #

(<*) :: MaybeApply f a -> MaybeApply f b -> MaybeApply f a #

Applicative (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

pure :: a -> AbstractArray i a #

(<*>) :: AbstractArray i (a -> b) -> AbstractArray i a -> AbstractArray i b #

liftA2 :: (a -> b -> c) -> AbstractArray i a -> AbstractArray i b -> AbstractArray i c #

(*>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

(<*) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i a #

Fractional p => Applicative (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

pure :: a -> Categorical p a #

(<*>) :: Categorical p (a -> b) -> Categorical p a -> Categorical p b #

liftA2 :: (a -> b -> c) -> Categorical p a -> Categorical p b -> Categorical p c #

(*>) :: Categorical p a -> Categorical p b -> Categorical p b #

(<*) :: Categorical p a -> Categorical p b -> Categorical p a #

Alternative f => Applicative (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

pure :: a -> Cofree f a #

(<*>) :: Cofree f (a -> b) -> Cofree f a -> Cofree f b #

liftA2 :: (a -> b -> c) -> Cofree f a -> Cofree f b -> Cofree f c #

(*>) :: Cofree f a -> Cofree f b -> Cofree f b #

(<*) :: Cofree f a -> Cofree f b -> Cofree f a #

Functor f => Applicative (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

pure :: a -> Free f a #

(<*>) :: Free f (a -> b) -> Free f a -> Free f b #

liftA2 :: (a -> b -> c) -> Free f a -> Free f b -> Free f c #

(*>) :: Free f a -> Free f b -> Free f b #

(<*) :: Free f a -> Free f b -> Free f a #

Applicative (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

pure :: a -> Measured n a #

(<*>) :: Measured n (a -> b) -> Measured n a -> Measured n b #

liftA2 :: (a -> b -> c) -> Measured n a -> Measured n b -> Measured n c #

(*>) :: Measured n a -> Measured n b -> Measured n b #

(<*) :: Measured n a -> Measured n b -> Measured n a #

Applicative f => Applicative (Point f) 
Instance details

Defined in Linear.Affine

Methods

pure :: a -> Point f a #

(<*>) :: Point f (a -> b) -> Point f a -> Point f b #

liftA2 :: (a -> b -> c) -> Point f a -> Point f b -> Point f c #

(*>) :: Point f a -> Point f b -> Point f b #

(<*) :: Point f a -> Point f b -> Point f a #

Applicative (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedFold s a #

(<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c #

(*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

(<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a #

Applicative (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

pure :: a -> ReifiedGetter s a #

(<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c #

(*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

(<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a #

Representable f => Applicative (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

pure :: a -> Co f a #

(<*>) :: Co f (a -> b) -> Co f a -> Co f b #

liftA2 :: (a -> b -> c) -> Co f a -> Co f b -> Co f c #

(*>) :: Co f a -> Co f b -> Co f b #

(<*) :: Co f a -> Co f b -> Co f a #

Applicative f => Applicative (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a -> Indexing f a #

(<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b #

liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c #

(*>) :: Indexing f a -> Indexing f b -> Indexing f b #

(<*) :: Indexing f a -> Indexing f b -> Indexing f a #

Applicative f => Applicative (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

pure :: a -> Yoneda f a #

(<*>) :: Yoneda f (a -> b) -> Yoneda f a -> Yoneda f b #

liftA2 :: (a -> b -> c) -> Yoneda f a -> Yoneda f b -> Yoneda f c #

(*>) :: Yoneda f a -> Yoneda f b -> Yoneda f b #

(<*) :: Yoneda f a -> Yoneda f b -> Yoneda f a #

Applicative f => Applicative (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a -> Indexing64 f a #

(<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b #

liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c #

(*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b #

(<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a #

Applicative f => Applicative (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> Rec1 f a #

(<*>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b #

liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c #

(*>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #

(<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a #

Monad m => Applicative (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

pure :: a -> RandT g m a #

(<*>) :: RandT g m (a -> b) -> RandT g m a -> RandT g m b #

liftA2 :: (a -> b -> c) -> RandT g m a -> RandT g m b -> RandT g m c #

(*>) :: RandT g m a -> RandT g m b -> RandT g m b #

(<*) :: RandT g m a -> RandT g m b -> RandT g m a #

Arrow a => Applicative (WrappedArrow a b)

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

pure :: a0 -> WrappedArrow a b a0 #

(<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 #

liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c #

(*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 #

(<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #

Monoid m => Applicative (Const m :: Type -> Type)

Since: base-2.0.1

Instance details

Defined in Data.Functor.Const

Methods

pure :: a -> Const m a #

(<*>) :: Const m (a -> b) -> Const m a -> Const m b #

liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c #

(*>) :: Const m a -> Const m b -> Const m b #

(<*) :: Const m a -> Const m b -> Const m a #

Applicative f => Applicative (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

pure :: a -> Ap f a #

(<*>) :: Ap f (a -> b) -> Ap f a -> Ap f b #

liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c #

(*>) :: Ap f a -> Ap f b -> Ap f b #

(<*) :: Ap f a -> Ap f b -> Ap f a #

Applicative f => Applicative (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

pure :: a -> Alt f a #

(<*>) :: Alt f (a -> b) -> Alt f a -> Alt f b #

liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c #

(*>) :: Alt f a -> Alt f b -> Alt f b #

(<*) :: Alt f a -> Alt f b -> Alt f a #

Biapplicative p => Applicative (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

pure :: a -> Join p a #

(<*>) :: Join p (a -> b) -> Join p a -> Join p b #

liftA2 :: (a -> b -> c) -> Join p a -> Join p b -> Join p c #

(*>) :: Join p a -> Join p b -> Join p b #

(<*) :: Join p a -> Join p b -> Join p a #

Biapplicative p => Applicative (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

pure :: a -> Fix p a #

(<*>) :: Fix p (a -> b) -> Fix p a -> Fix p b #

liftA2 :: (a -> b -> c) -> Fix p a -> Fix p b -> Fix p c #

(*>) :: Fix p a -> Fix p b -> Fix p b #

(<*) :: Fix p a -> Fix p b -> Fix p a #

Applicative m => Applicative (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

pure :: a -> IdentityT m a #

(<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b #

liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c #

(*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

(<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #

(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 #

(<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b #

liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c #

(*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #

(<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a #

(Functor m, Monad m) => Applicative (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

pure :: a -> ExceptT e m a #

(<*>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b #

liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c #

(*>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #

(<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a #

(Monoid w, Applicative m) => Applicative (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

pure :: a -> WriterT w m a #

(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b #

liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c #

(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #

(Functor m, Monad m) => Applicative (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

pure :: a -> StateT s m a #

(<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b #

liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c #

(*>) :: StateT s m a -> StateT s m b -> StateT s m b #

(<*) :: StateT s m a -> StateT s m b -> StateT s m a #

Applicative m => Applicative (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

pure :: a -> ReaderT r m a #

(<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b #

liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c #

(*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #

(<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a #

(Functor m, Monad m) => Applicative (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

pure :: a -> ErrorT e m a #

(<*>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b #

liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c #

(*>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #

(<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a #

(Functor m, Monad m) => Applicative (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

pure :: a -> StateT s m a #

(<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b #

liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c #

(*>) :: StateT s m a -> StateT s m b -> StateT s m b #

(<*) :: StateT s m a -> StateT s m b -> StateT s m a #

(Monoid w, Applicative m) => Applicative (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

pure :: a -> WriterT w m a #

(<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b #

liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c #

(*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

(<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a #

(Profunctor p, Arrow p) => Applicative (Tambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

pure :: a0 -> Tambara p a a0 #

(<*>) :: Tambara p a (a0 -> b) -> Tambara p a a0 -> Tambara p a b #

liftA2 :: (a0 -> b -> c) -> Tambara p a a0 -> Tambara p a b -> Tambara p a c #

(*>) :: Tambara p a a0 -> Tambara p a b -> Tambara p a b #

(<*) :: Tambara p a a0 -> Tambara p a b -> Tambara p a a0 #

Applicative f => Applicative (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

pure :: a0 -> Star f a a0 #

(<*>) :: Star f a (a0 -> b) -> Star f a a0 -> Star f a b #

liftA2 :: (a0 -> b -> c) -> Star f a a0 -> Star f a b -> Star f a c #

(*>) :: Star f a a0 -> Star f a b -> Star f a b #

(<*) :: Star f a a0 -> Star f a b -> Star f a a0 #

Applicative (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

pure :: a0 -> Costar f a a0 #

(<*>) :: Costar f a (a0 -> b) -> Costar f a a0 -> Costar f a b #

liftA2 :: (a0 -> b -> c) -> Costar f a a0 -> Costar f a b -> Costar f a c #

(*>) :: Costar f a a0 -> Costar f a b -> Costar f a b #

(<*) :: Costar f a a0 -> Costar f a b -> Costar f a a0 #

Applicative (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

pure :: a -> Tagged s a #

(<*>) :: Tagged s (a -> b) -> Tagged s a -> Tagged s b #

liftA2 :: (a -> b -> c) -> Tagged s a -> Tagged s b -> Tagged s c #

(*>) :: Tagged s a -> Tagged s b -> Tagged s b #

(<*) :: Tagged s a -> Tagged s b -> Tagged s a #

Applicative f => Applicative (Backwards f)

Apply f-actions in the reverse order.

Instance details

Defined in Control.Applicative.Backwards

Methods

pure :: a -> Backwards f a #

(<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b #

liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c #

(*>) :: Backwards f a -> Backwards f b -> Backwards f b #

(<*) :: Backwards f a -> Backwards f b -> Backwards f a #

Applicative (Mag a b) 
Instance details

Defined in Data.Biapplicative

Methods

pure :: a0 -> Mag a b a0 #

(<*>) :: Mag a b (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Mag a b a0 -> Mag a b b0 -> Mag a b c #

(*>) :: Mag a b a0 -> Mag a b b0 -> Mag a b b0 #

(<*) :: Mag a b a0 -> Mag a b b0 -> Mag a b a0 #

(Alternative f, Applicative w) => Applicative (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

pure :: a -> CofreeT f w a #

(<*>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b #

liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c #

(*>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #

(<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a #

(Functor f, Monad m) => Applicative (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

pure :: a -> FreeT f m a #

(<*>) :: FreeT f m (a -> b) -> FreeT f m a -> FreeT f m b #

liftA2 :: (a -> b -> c) -> FreeT f m a -> FreeT f m b -> FreeT f m c #

(*>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #

(<*) :: FreeT f m a -> FreeT f m b -> FreeT f m a #

Applicative (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

pure :: a -> Query v n a #

(<*>) :: Query v n (a -> b) -> Query v n a -> Query v n b #

liftA2 :: (a -> b -> c) -> Query v n a -> Query v n b -> Query v n c #

(*>) :: Query v n a -> Query v n b -> Query v n b #

(<*) :: Query v n a -> Query v n b -> Query v n a #

Applicative (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

pure :: a0 -> Indexed i a a0 #

(<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c #

(*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

(<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 #

Dim n => Applicative (V n) 
Instance details

Defined in Linear.V

Methods

pure :: a -> V n a #

(<*>) :: V n (a -> b) -> V n a -> V n b #

liftA2 :: (a -> b -> c) -> V n a -> V n b -> V n c #

(*>) :: V n a -> V n b -> V n b #

(<*) :: V n a -> V n b -> V n a #

(Applicative f, Applicative g) => Applicative (Day f g) 
Instance details

Defined in Data.Functor.Day

Methods

pure :: a -> Day f g a #

(<*>) :: Day f g (a -> b) -> Day f g a -> Day f g b #

liftA2 :: (a -> b -> c) -> Day f g a -> Day f g b -> Day f g c #

(*>) :: Day f g a -> Day f g b -> Day f g b #

(<*) :: Day f g a -> Day f g b -> Day f g a #

Applicative (Mafic a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> Mafic a b a0 #

(<*>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c #

(*>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0 #

(<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0 #

Applicative (Flows i b) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

pure :: a -> Flows i b a #

(<*>) :: Flows i b (a -> b0) -> Flows i b a -> Flows i b b0 #

liftA2 :: (a -> b0 -> c) -> Flows i b a -> Flows i b b0 -> Flows i b c #

(*>) :: Flows i b a -> Flows i b b0 -> Flows i b b0 #

(<*) :: Flows i b a -> Flows i b b0 -> Flows i b a #

Monoid m => Applicative (Holes t m) 
Instance details

Defined in Control.Lens.Traversal

Methods

pure :: a -> Holes t m a #

(<*>) :: Holes t m (a -> b) -> Holes t m a -> Holes t m b #

liftA2 :: (a -> b -> c) -> Holes t m a -> Holes t m b -> Holes t m c #

(*>) :: Holes t m a -> Holes t m b -> Holes t m b #

(<*) :: Holes t m a -> Holes t m b -> Holes t m a #

(Functor g, g ~ h) => Applicative (Curried g h) 
Instance details

Defined in Data.Functor.Day.Curried

Methods

pure :: a -> Curried g h a #

(<*>) :: Curried g h (a -> b) -> Curried g h a -> Curried g h b #

liftA2 :: (a -> b -> c) -> Curried g h a -> Curried g h b -> Curried g h c #

(*>) :: Curried g h a -> Curried g h b -> Curried g h b #

(<*) :: Curried g h a -> Curried g h b -> Curried g h a #

Applicative ((->) a :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a0 -> a -> a0 #

(<*>) :: (a -> (a0 -> b)) -> (a -> a0) -> a -> b #

liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c #

(*>) :: (a -> a0) -> (a -> b) -> a -> b #

(<*) :: (a -> a0) -> (a -> b) -> a -> a0 #

Monoid c => Applicative (K1 i c :: Type -> Type)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> K1 i c a #

(<*>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b #

liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 #

(*>) :: K1 i c a -> K1 i c b -> K1 i c b #

(<*) :: K1 i c a -> K1 i c b -> K1 i c a #

(Applicative f, Applicative g) => Applicative (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> (f :*: g) a #

(<*>) :: (f :*: g) (a -> b) -> (f :*: g) a -> (f :*: g) b #

liftA2 :: (a -> b -> c) -> (f :*: g) a -> (f :*: g) b -> (f :*: g) c #

(*>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #

(<*) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) a #

(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 #

(<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b #

liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c #

(*>) :: Product f g a -> Product f g b -> Product f g b #

(<*) :: Product f g a -> Product f g b -> Product f g a #

(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 #

(<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #

liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c #

(*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #

(<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a #

(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 #

(<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #

liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c #

(*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #

(<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a #

Applicative (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

pure :: a -> ContT r m a #

(<*>) :: ContT r m (a -> b) -> ContT r m a -> ContT r m b #

liftA2 :: (a -> b -> c) -> ContT r m a -> ContT r m b -> ContT r m c #

(*>) :: ContT r m a -> ContT r m b -> ContT r m b #

(<*) :: ContT r m a -> ContT r m b -> ContT r m a #

Applicative (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> Bazaar p a b a0 #

(<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c #

(*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 #

(<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Applicative (Molten i a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> Molten i a b a0 #

(<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #

liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c #

(*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 #

(<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 #

Applicative f => Applicative (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> M1 i c f a #

(<*>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b #

liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 #

(*>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #

(<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a #

(Applicative f, Applicative g) => Applicative (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

pure :: a -> (f :.: g) a #

(<*>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b #

liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c #

(*>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b #

(<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #

(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 #

(<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b #

liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c #

(*>) :: Compose f g a -> Compose f g b -> Compose f g b #

(<*) :: Compose f g a -> Compose f g b -> Compose f g a #

(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 #

(<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #

liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c #

(*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #

(<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a #

(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

pure :: a -> RWST r w s m a #

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b #

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c #

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #

(Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

pure :: a -> RWST r w s m a #

(<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b #

liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c #

(*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

(<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a #

Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) 
Instance details

Defined in Data.Reflection

Methods

pure :: a -> ReflectedApplicative f s a #

(<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #

liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c #

(*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b #

(<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #

Applicative (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

pure :: a0 -> TakingWhile p f a b a0 #

(<*>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #

liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c #

(*>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 #

(<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

Applicative (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

pure :: a0 -> BazaarT p g a b a0 #

(<*>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #

liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c #

(*>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 #

(<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

Monad state => Applicative (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

pure :: a -> Builder collection mutCollection step state err a #

(<*>) :: Builder collection mutCollection step state err (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #

liftA2 :: (a -> b -> c) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err c #

(*>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #

(<*) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

class Foldable (t :: Type -> Type) where #

Data structures that can be folded.

For example, given a data type

data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)

a suitable instance would be

instance Foldable Tree where
    foldMap f Empty = mempty
    foldMap f (Leaf x) = f x
    foldMap f (Node l k r) = foldMap f l `mappend` f k `mappend` foldMap f r

This is suitable even for abstract types, as the monoid is assumed @@ -246,15 +354,15 @@ foldr f z Empty = z foldr f z (Leaf x) = f x z foldr f z (Node l k r) = foldr f (f k (foldr f z r)) l

Foldable instances are expected to satisfy the following laws:

foldr f z t = appEndo (foldMap (Endo . f) t ) z
foldl f z t = appEndo (getDual (foldMap (Dual . Endo . flip f) t)) z
fold = foldMap id
length = getSum . foldMap (Sum . const  1)

sum, product, maximum, and minimum should all be essentially - equivalent to foldMap forms, such as

sum = getSum . foldMap Sum

but may be less defined.

If the type is also a Functor instance, it should satisfy

foldMap f = fold . fmap f

which implies that

foldMap f . fmap g = foldMap (f . g)

Minimal complete definition

foldMap | foldr

Methods

foldMap :: Monoid m => (a -> m) -> t a -> m #

Map each element of the structure to a monoid, - and combine the results.

foldr1 :: (a -> a -> a) -> t a -> a #

A variant of foldr that has no base case, - and thus may only be applied to non-empty structures.

foldr1 f = foldr1 f . toList

foldl1 :: (a -> a -> a) -> t a -> a #

A variant of foldl that has no base case, - and thus may only be applied to non-empty structures.

foldl1 f = foldl1 f . toList

null :: t a -> Bool #

Test whether the structure is empty. The default implementation is + equivalent to foldMap forms, such as

sum = getSum . foldMap Sum

but may be less defined.

If the type is also a Functor instance, it should satisfy

foldMap f = fold . fmap f

which implies that

foldMap f . fmap g = foldMap (f . g)

Minimal complete definition

foldMap | foldr

Methods

foldMap :: Monoid m => (a -> m) -> t a -> m #

Map each element of the structure to a monoid, + and combine the results.

foldr1 :: (a -> a -> a) -> t a -> a #

A variant of foldr that has no base case, + and thus may only be applied to non-empty structures.

foldr1 f = foldr1 f . toList

foldl1 :: (a -> a -> a) -> t a -> a #

A variant of foldl that has no base case, + and thus may only be applied to non-empty structures.

foldl1 f = foldl1 f . toList

null :: t a -> Bool #

Test whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.

length :: t a -> Int #

Returns the size/length of a finite structure as an Int. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.

elem :: Eq a => a -> t a -> Bool infix 4 #

Does the element occur in the structure?

maximum :: Ord a => t a -> a #

The largest element of a non-empty structure.

minimum :: Ord a => t a -> a #

The least element of a non-empty structure.

sum :: Num a => t a -> a #

The sum function computes the sum of the numbers of a structure.

product :: Num a => t a -> a #

The product function computes the product of the numbers of a - structure.

Instances
Foldable []

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => [m] -> m #

foldMap :: Monoid m => (a -> m) -> [a] -> m #

foldr :: (a -> b -> b) -> b -> [a] -> b #

foldr' :: (a -> b -> b) -> b -> [a] -> b #

foldl :: (b -> a -> b) -> b -> [a] -> b #

foldl' :: (b -> a -> b) -> b -> [a] -> b #

foldr1 :: (a -> a -> a) -> [a] -> a #

foldl1 :: (a -> a -> a) -> [a] -> a #

toList :: [a] -> [a] #

null :: [a] -> Bool #

length :: [a] -> Int #

elem :: Eq a => a -> [a] -> Bool #

maximum :: Ord a => [a] -> a #

minimum :: Ord a => [a] -> a #

sum :: Num a => [a] -> a #

product :: Num a => [a] -> a #

Foldable Maybe

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m #

foldr :: (a -> b -> b) -> b -> Maybe a -> b #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b #

foldl :: (b -> a -> b) -> b -> Maybe a -> b #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b #

foldr1 :: (a -> a -> a) -> Maybe a -> a #

foldl1 :: (a -> a -> a) -> Maybe a -> a #

toList :: Maybe a -> [a] #

null :: Maybe a -> Bool #

length :: Maybe a -> Int #

elem :: Eq a => a -> Maybe a -> Bool #

maximum :: Ord a => Maybe a -> a #

minimum :: Ord a => Maybe a -> a #

sum :: Num a => Maybe a -> a #

product :: Num a => Maybe a -> a #

Foldable Par1 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Par1 m -> m #

foldMap :: Monoid m => (a -> m) -> Par1 a -> m #

foldr :: (a -> b -> b) -> b -> Par1 a -> b #

foldr' :: (a -> b -> b) -> b -> Par1 a -> b #

foldl :: (b -> a -> b) -> b -> Par1 a -> b #

foldl' :: (b -> a -> b) -> b -> Par1 a -> b #

foldr1 :: (a -> a -> a) -> Par1 a -> a #

foldl1 :: (a -> a -> a) -> Par1 a -> a #

toList :: Par1 a -> [a] #

null :: Par1 a -> Bool #

length :: Par1 a -> Int #

elem :: Eq a => a -> Par1 a -> Bool #

maximum :: Ord a => Par1 a -> a #

minimum :: Ord a => Par1 a -> a #

sum :: Num a => Par1 a -> a #

product :: Num a => Par1 a -> a #

Foldable Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m #

foldMap :: Monoid m => (a -> m) -> Identity a -> m #

foldr :: (a -> b -> b) -> b -> Identity a -> b #

foldr' :: (a -> b -> b) -> b -> Identity a -> b #

foldl :: (b -> a -> b) -> b -> Identity a -> b #

foldl' :: (b -> a -> b) -> b -> Identity a -> b #

foldr1 :: (a -> a -> a) -> Identity a -> a #

foldl1 :: (a -> a -> a) -> Identity a -> a #

toList :: Identity a -> [a] #

null :: Identity a -> Bool #

length :: Identity a -> Int #

elem :: Eq a => a -> Identity a -> Bool #

maximum :: Ord a => Identity a -> a #

minimum :: Ord a => Identity a -> a #

sum :: Num a => Identity a -> a #

product :: Num a => Identity a -> a #

Foldable Complex 
Instance details

Defined in Data.Complex

Methods

fold :: Monoid m => Complex m -> m #

foldMap :: Monoid m => (a -> m) -> Complex a -> m #

foldr :: (a -> b -> b) -> b -> Complex a -> b #

foldr' :: (a -> b -> b) -> b -> Complex a -> b #

foldl :: (b -> a -> b) -> b -> Complex a -> b #

foldl' :: (b -> a -> b) -> b -> Complex a -> b #

foldr1 :: (a -> a -> a) -> Complex a -> a #

foldl1 :: (a -> a -> a) -> Complex a -> a #

toList :: Complex a -> [a] #

null :: Complex a -> Bool #

length :: Complex a -> Int #

elem :: Eq a => a -> Complex a -> Bool #

maximum :: Ord a => Complex a -> a #

minimum :: Ord a => Complex a -> a #

sum :: Num a => Complex a -> a #

product :: Num a => Complex a -> a #

Foldable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Min m -> m #

foldMap :: Monoid m => (a -> m) -> Min a -> m #

foldr :: (a -> b -> b) -> b -> Min a -> b #

foldr' :: (a -> b -> b) -> b -> Min a -> b #

foldl :: (b -> a -> b) -> b -> Min a -> b #

foldl' :: (b -> a -> b) -> b -> Min a -> b #

foldr1 :: (a -> a -> a) -> Min a -> a #

foldl1 :: (a -> a -> a) -> Min a -> a #

toList :: Min a -> [a] #

null :: Min a -> Bool #

length :: Min a -> Int #

elem :: Eq a => a -> Min a -> Bool #

maximum :: Ord a => Min a -> a #

minimum :: Ord a => Min a -> a #

sum :: Num a => Min a -> a #

product :: Num a => Min a -> a #

Foldable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Max m -> m #

foldMap :: Monoid m => (a -> m) -> Max a -> m #

foldr :: (a -> b -> b) -> b -> Max a -> b #

foldr' :: (a -> b -> b) -> b -> Max a -> b #

foldl :: (b -> a -> b) -> b -> Max a -> b #

foldl' :: (b -> a -> b) -> b -> Max a -> b #

foldr1 :: (a -> a -> a) -> Max a -> a #

foldl1 :: (a -> a -> a) -> Max a -> a #

toList :: Max a -> [a] #

null :: Max a -> Bool #

length :: Max a -> Int #

elem :: Eq a => a -> Max a -> Bool #

maximum :: Ord a => Max a -> a #

minimum :: Ord a => Max a -> a #

sum :: Num a => Max a -> a #

product :: Num a => Max a -> a #

Foldable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => First m -> m #

foldMap :: Monoid m => (a -> m) -> First a -> m #

foldr :: (a -> b -> b) -> b -> First a -> b #

foldr' :: (a -> b -> b) -> b -> First a -> b #

foldl :: (b -> a -> b) -> b -> First a -> b #

foldl' :: (b -> a -> b) -> b -> First a -> b #

foldr1 :: (a -> a -> a) -> First a -> a #

foldl1 :: (a -> a -> a) -> First a -> a #

toList :: First a -> [a] #

null :: First a -> Bool #

length :: First a -> Int #

elem :: Eq a => a -> First a -> Bool #

maximum :: Ord a => First a -> a #

minimum :: Ord a => First a -> a #

sum :: Num a => First a -> a #

product :: Num a => First a -> a #

Foldable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Last m -> m #

foldMap :: Monoid m => (a -> m) -> Last a -> m #

foldr :: (a -> b -> b) -> b -> Last a -> b #

foldr' :: (a -> b -> b) -> b -> Last a -> b #

foldl :: (b -> a -> b) -> b -> Last a -> b #

foldl' :: (b -> a -> b) -> b -> Last a -> b #

foldr1 :: (a -> a -> a) -> Last a -> a #

foldl1 :: (a -> a -> a) -> Last a -> a #

toList :: Last a -> [a] #

null :: Last a -> Bool #

length :: Last a -> Int #

elem :: Eq a => a -> Last a -> Bool #

maximum :: Ord a => Last a -> a #

minimum :: Ord a => Last a -> a #

sum :: Num a => Last a -> a #

product :: Num a => Last a -> a #

Foldable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Option m -> m #

foldMap :: Monoid m => (a -> m) -> Option a -> m #

foldr :: (a -> b -> b) -> b -> Option a -> b #

foldr' :: (a -> b -> b) -> b -> Option a -> b #

foldl :: (b -> a -> b) -> b -> Option a -> b #

foldl' :: (b -> a -> b) -> b -> Option a -> b #

foldr1 :: (a -> a -> a) -> Option a -> a #

foldl1 :: (a -> a -> a) -> Option a -> a #

toList :: Option a -> [a] #

null :: Option a -> Bool #

length :: Option a -> Int #

elem :: Eq a => a -> Option a -> Bool #

maximum :: Ord a => Option a -> a #

minimum :: Ord a => Option a -> a #

sum :: Num a => Option a -> a #

product :: Num a => Option a -> a #

Foldable ZipList 
Instance details

Defined in Control.Applicative

Methods

fold :: Monoid m => ZipList m -> m #

foldMap :: Monoid m => (a -> m) -> ZipList a -> m #

foldr :: (a -> b -> b) -> b -> ZipList a -> b #

foldr' :: (a -> b -> b) -> b -> ZipList a -> b #

foldl :: (b -> a -> b) -> b -> ZipList a -> b #

foldl' :: (b -> a -> b) -> b -> ZipList a -> b #

foldr1 :: (a -> a -> a) -> ZipList a -> a #

foldl1 :: (a -> a -> a) -> ZipList a -> a #

toList :: ZipList a -> [a] #

null :: ZipList a -> Bool #

length :: ZipList a -> Int #

elem :: Eq a => a -> ZipList a -> Bool #

maximum :: Ord a => ZipList a -> a #

minimum :: Ord a => ZipList a -> a #

sum :: Num a => ZipList a -> a #

product :: Num a => ZipList a -> a #

Foldable First

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => First m -> m #

foldMap :: Monoid m => (a -> m) -> First a -> m #

foldr :: (a -> b -> b) -> b -> First a -> b #

foldr' :: (a -> b -> b) -> b -> First a -> b #

foldl :: (b -> a -> b) -> b -> First a -> b #

foldl' :: (b -> a -> b) -> b -> First a -> b #

foldr1 :: (a -> a -> a) -> First a -> a #

foldl1 :: (a -> a -> a) -> First a -> a #

toList :: First a -> [a] #

null :: First a -> Bool #

length :: First a -> Int #

elem :: Eq a => a -> First a -> Bool #

maximum :: Ord a => First a -> a #

minimum :: Ord a => First a -> a #

sum :: Num a => First a -> a #

product :: Num a => First a -> a #

Foldable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Last m -> m #

foldMap :: Monoid m => (a -> m) -> Last a -> m #

foldr :: (a -> b -> b) -> b -> Last a -> b #

foldr' :: (a -> b -> b) -> b -> Last a -> b #

foldl :: (b -> a -> b) -> b -> Last a -> b #

foldl' :: (b -> a -> b) -> b -> Last a -> b #

foldr1 :: (a -> a -> a) -> Last a -> a #

foldl1 :: (a -> a -> a) -> Last a -> a #

toList :: Last a -> [a] #

null :: Last a -> Bool #

length :: Last a -> Int #

elem :: Eq a => a -> Last a -> Bool #

maximum :: Ord a => Last a -> a #

minimum :: Ord a => Last a -> a #

sum :: Num a => Last a -> a #

product :: Num a => Last a -> a #

Foldable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Dual m -> m #

foldMap :: Monoid m => (a -> m) -> Dual a -> m #

foldr :: (a -> b -> b) -> b -> Dual a -> b #

foldr' :: (a -> b -> b) -> b -> Dual a -> b #

foldl :: (b -> a -> b) -> b -> Dual a -> b #

foldl' :: (b -> a -> b) -> b -> Dual a -> b #

foldr1 :: (a -> a -> a) -> Dual a -> a #

foldl1 :: (a -> a -> a) -> Dual a -> a #

toList :: Dual a -> [a] #

null :: Dual a -> Bool #

length :: Dual a -> Int #

elem :: Eq a => a -> Dual a -> Bool #

maximum :: Ord a => Dual a -> a #

minimum :: Ord a => Dual a -> a #

sum :: Num a => Dual a -> a #

product :: Num a => Dual a -> a #

Foldable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Sum m -> m #

foldMap :: Monoid m => (a -> m) -> Sum a -> m #

foldr :: (a -> b -> b) -> b -> Sum a -> b #

foldr' :: (a -> b -> b) -> b -> Sum a -> b #

foldl :: (b -> a -> b) -> b -> Sum a -> b #

foldl' :: (b -> a -> b) -> b -> Sum a -> b #

foldr1 :: (a -> a -> a) -> Sum a -> a #

foldl1 :: (a -> a -> a) -> Sum a -> a #

toList :: Sum a -> [a] #

null :: Sum a -> Bool #

length :: Sum a -> Int #

elem :: Eq a => a -> Sum a -> Bool #

maximum :: Ord a => Sum a -> a #

minimum :: Ord a => Sum a -> a #

sum :: Num a => Sum a -> a #

product :: Num a => Sum a -> a #

Foldable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Product m -> m #

foldMap :: Monoid m => (a -> m) -> Product a -> m #

foldr :: (a -> b -> b) -> b -> Product a -> b #

foldr' :: (a -> b -> b) -> b -> Product a -> b #

foldl :: (b -> a -> b) -> b -> Product a -> b #

foldl' :: (b -> a -> b) -> b -> Product a -> b #

foldr1 :: (a -> a -> a) -> Product a -> a #

foldl1 :: (a -> a -> a) -> Product a -> a #

toList :: Product a -> [a] #

null :: Product a -> Bool #

length :: Product a -> Int #

elem :: Eq a => a -> Product a -> Bool #

maximum :: Ord a => Product a -> a #

minimum :: Ord a => Product a -> a #

sum :: Num a => Product a -> a #

product :: Num a => Product a -> a #

Foldable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => NonEmpty m -> m #

foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m #

foldr :: (a -> b -> b) -> b -> NonEmpty a -> b #

foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b #

foldl :: (b -> a -> b) -> b -> NonEmpty a -> b #

foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b #

foldr1 :: (a -> a -> a) -> NonEmpty a -> a #

foldl1 :: (a -> a -> a) -> NonEmpty a -> a #

toList :: NonEmpty a -> [a] #

null :: NonEmpty a -> Bool #

length :: NonEmpty a -> Int #

elem :: Eq a => a -> NonEmpty a -> Bool #

maximum :: Ord a => NonEmpty a -> a #

minimum :: Ord a => NonEmpty a -> a #

sum :: Num a => NonEmpty a -> a #

product :: Num a => NonEmpty a -> a #

Foldable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fold :: Monoid m => IntMap m -> m #

foldMap :: Monoid m => (a -> m) -> IntMap a -> m #

foldr :: (a -> b -> b) -> b -> IntMap a -> b #

foldr' :: (a -> b -> b) -> b -> IntMap a -> b #

foldl :: (b -> a -> b) -> b -> IntMap a -> b #

foldl' :: (b -> a -> b) -> b -> IntMap a -> b #

foldr1 :: (a -> a -> a) -> IntMap a -> a #

foldl1 :: (a -> a -> a) -> IntMap a -> a #

toList :: IntMap a -> [a] #

null :: IntMap a -> Bool #

length :: IntMap a -> Int #

elem :: Eq a => a -> IntMap a -> Bool #

maximum :: Ord a => IntMap a -> a #

minimum :: Ord a => IntMap a -> a #

sum :: Num a => IntMap a -> a #

product :: Num a => IntMap a -> a #

Foldable SCC

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

fold :: Monoid m => SCC m -> m #

foldMap :: Monoid m => (a -> m) -> SCC a -> m #

foldr :: (a -> b -> b) -> b -> SCC a -> b #

foldr' :: (a -> b -> b) -> b -> SCC a -> b #

foldl :: (b -> a -> b) -> b -> SCC a -> b #

foldl' :: (b -> a -> b) -> b -> SCC a -> b #

foldr1 :: (a -> a -> a) -> SCC a -> a #

foldl1 :: (a -> a -> a) -> SCC a -> a #

toList :: SCC a -> [a] #

null :: SCC a -> Bool #

length :: SCC a -> Int #

elem :: Eq a => a -> SCC a -> Bool #

maximum :: Ord a => SCC a -> a #

minimum :: Ord a => SCC a -> a #

sum :: Num a => SCC a -> a #

product :: Num a => SCC a -> a #

Foldable Tree 
Instance details

Defined in Data.Tree

Methods

fold :: Monoid m => Tree m -> m #

foldMap :: Monoid m => (a -> m) -> Tree a -> m #

foldr :: (a -> b -> b) -> b -> Tree a -> b #

foldr' :: (a -> b -> b) -> b -> Tree a -> b #

foldl :: (b -> a -> b) -> b -> Tree a -> b #

foldl' :: (b -> a -> b) -> b -> Tree a -> b #

foldr1 :: (a -> a -> a) -> Tree a -> a #

foldl1 :: (a -> a -> a) -> Tree a -> a #

toList :: Tree a -> [a] #

null :: Tree a -> Bool #

length :: Tree a -> Int #

elem :: Eq a => a -> Tree a -> Bool #

maximum :: Ord a => Tree a -> a #

minimum :: Ord a => Tree a -> a #

sum :: Num a => Tree a -> a #

product :: Num a => Tree a -> a #

Foldable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Seq m -> m #

foldMap :: Monoid m => (a -> m) -> Seq a -> m #

foldr :: (a -> b -> b) -> b -> Seq a -> b #

foldr' :: (a -> b -> b) -> b -> Seq a -> b #

foldl :: (b -> a -> b) -> b -> Seq a -> b #

foldl' :: (b -> a -> b) -> b -> Seq a -> b #

foldr1 :: (a -> a -> a) -> Seq a -> a #

foldl1 :: (a -> a -> a) -> Seq a -> a #

toList :: Seq a -> [a] #

null :: Seq a -> Bool #

length :: Seq a -> Int #

elem :: Eq a => a -> Seq a -> Bool #

maximum :: Ord a => Seq a -> a #

minimum :: Ord a => Seq a -> a #

sum :: Num a => Seq a -> a #

product :: Num a => Seq a -> a #

Foldable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => FingerTree m -> m #

foldMap :: Monoid m => (a -> m) -> FingerTree a -> m #

foldr :: (a -> b -> b) -> b -> FingerTree a -> b #

foldr' :: (a -> b -> b) -> b -> FingerTree a -> b #

foldl :: (b -> a -> b) -> b -> FingerTree a -> b #

foldl' :: (b -> a -> b) -> b -> FingerTree a -> b #

foldr1 :: (a -> a -> a) -> FingerTree a -> a #

foldl1 :: (a -> a -> a) -> FingerTree a -> a #

toList :: FingerTree a -> [a] #

null :: FingerTree a -> Bool #

length :: FingerTree a -> Int #

elem :: Eq a => a -> FingerTree a -> Bool #

maximum :: Ord a => FingerTree a -> a #

minimum :: Ord a => FingerTree a -> a #

sum :: Num a => FingerTree a -> a #

product :: Num a => FingerTree a -> a #

Foldable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Digit m -> m #

foldMap :: Monoid m => (a -> m) -> Digit a -> m #

foldr :: (a -> b -> b) -> b -> Digit a -> b #

foldr' :: (a -> b -> b) -> b -> Digit a -> b #

foldl :: (b -> a -> b) -> b -> Digit a -> b #

foldl' :: (b -> a -> b) -> b -> Digit a -> b #

foldr1 :: (a -> a -> a) -> Digit a -> a #

foldl1 :: (a -> a -> a) -> Digit a -> a #

toList :: Digit a -> [a] #

null :: Digit a -> Bool #

length :: Digit a -> Int #

elem :: Eq a => a -> Digit a -> Bool #

maximum :: Ord a => Digit a -> a #

minimum :: Ord a => Digit a -> a #

sum :: Num a => Digit a -> a #

product :: Num a => Digit a -> a #

Foldable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Node m -> m #

foldMap :: Monoid m => (a -> m) -> Node a -> m #

foldr :: (a -> b -> b) -> b -> Node a -> b #

foldr' :: (a -> b -> b) -> b -> Node a -> b #

foldl :: (b -> a -> b) -> b -> Node a -> b #

foldl' :: (b -> a -> b) -> b -> Node a -> b #

foldr1 :: (a -> a -> a) -> Node a -> a #

foldl1 :: (a -> a -> a) -> Node a -> a #

toList :: Node a -> [a] #

null :: Node a -> Bool #

length :: Node a -> Int #

elem :: Eq a => a -> Node a -> Bool #

maximum :: Ord a => Node a -> a #

minimum :: Ord a => Node a -> a #

sum :: Num a => Node a -> a #

product :: Num a => Node a -> a #

Foldable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Elem m -> m #

foldMap :: Monoid m => (a -> m) -> Elem a -> m #

foldr :: (a -> b -> b) -> b -> Elem a -> b #

foldr' :: (a -> b -> b) -> b -> Elem a -> b #

foldl :: (b -> a -> b) -> b -> Elem a -> b #

foldl' :: (b -> a -> b) -> b -> Elem a -> b #

foldr1 :: (a -> a -> a) -> Elem a -> a #

foldl1 :: (a -> a -> a) -> Elem a -> a #

toList :: Elem a -> [a] #

null :: Elem a -> Bool #

length :: Elem a -> Int #

elem :: Eq a => a -> Elem a -> Bool #

maximum :: Ord a => Elem a -> a #

minimum :: Ord a => Elem a -> a #

sum :: Num a => Elem a -> a #

product :: Num a => Elem a -> a #

Foldable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewL m -> m #

foldMap :: Monoid m => (a -> m) -> ViewL a -> m #

foldr :: (a -> b -> b) -> b -> ViewL a -> b #

foldr' :: (a -> b -> b) -> b -> ViewL a -> b #

foldl :: (b -> a -> b) -> b -> ViewL a -> b #

foldl' :: (b -> a -> b) -> b -> ViewL a -> b #

foldr1 :: (a -> a -> a) -> ViewL a -> a #

foldl1 :: (a -> a -> a) -> ViewL a -> a #

toList :: ViewL a -> [a] #

null :: ViewL a -> Bool #

length :: ViewL a -> Int #

elem :: Eq a => a -> ViewL a -> Bool #

maximum :: Ord a => ViewL a -> a #

minimum :: Ord a => ViewL a -> a #

sum :: Num a => ViewL a -> a #

product :: Num a => ViewL a -> a #

Foldable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewR m -> m #

foldMap :: Monoid m => (a -> m) -> ViewR a -> m #

foldr :: (a -> b -> b) -> b -> ViewR a -> b #

foldr' :: (a -> b -> b) -> b -> ViewR a -> b #

foldl :: (b -> a -> b) -> b -> ViewR a -> b #

foldl' :: (b -> a -> b) -> b -> ViewR a -> b #

foldr1 :: (a -> a -> a) -> ViewR a -> a #

foldl1 :: (a -> a -> a) -> ViewR a -> a #

toList :: ViewR a -> [a] #

null :: ViewR a -> Bool #

length :: ViewR a -> Int #

elem :: Eq a => a -> ViewR a -> Bool #

maximum :: Ord a => ViewR a -> a #

minimum :: Ord a => ViewR a -> a #

sum :: Num a => ViewR a -> a #

product :: Num a => ViewR a -> a #

Foldable Set 
Instance details

Defined in Data.Set.Internal

Methods

fold :: Monoid m => Set m -> m #

foldMap :: Monoid m => (a -> m) -> Set a -> m #

foldr :: (a -> b -> b) -> b -> Set a -> b #

foldr' :: (a -> b -> b) -> b -> Set a -> b #

foldl :: (b -> a -> b) -> b -> Set a -> b #

foldl' :: (b -> a -> b) -> b -> Set a -> b #

foldr1 :: (a -> a -> a) -> Set a -> a #

foldl1 :: (a -> a -> a) -> Set a -> a #

toList :: Set a -> [a] #

null :: Set a -> Bool #

length :: Set a -> Int #

elem :: Eq a => a -> Set a -> Bool #

maximum :: Ord a => Set a -> a #

minimum :: Ord a => Set a -> a #

sum :: Num a => Set a -> a #

product :: Num a => Set a -> a #

Foldable DList 
Instance details

Defined in Data.DList

Methods

fold :: Monoid m => DList m -> m #

foldMap :: Monoid m => (a -> m) -> DList a -> m #

foldr :: (a -> b -> b) -> b -> DList a -> b #

foldr' :: (a -> b -> b) -> b -> DList a -> b #

foldl :: (b -> a -> b) -> b -> DList a -> b #

foldl' :: (b -> a -> b) -> b -> DList a -> b #

foldr1 :: (a -> a -> a) -> DList a -> a #

foldl1 :: (a -> a -> a) -> DList a -> a #

toList :: DList a -> [a] #

null :: DList a -> Bool #

length :: DList a -> Int #

elem :: Eq a => a -> DList a -> Bool #

maximum :: Ord a => DList a -> a #

minimum :: Ord a => DList a -> a #

sum :: Num a => DList a -> a #

product :: Num a => DList a -> a #

Foldable V3 
Instance details

Defined in Linear.V3

Methods

fold :: Monoid m => V3 m -> m #

foldMap :: Monoid m => (a -> m) -> V3 a -> m #

foldr :: (a -> b -> b) -> b -> V3 a -> b #

foldr' :: (a -> b -> b) -> b -> V3 a -> b #

foldl :: (b -> a -> b) -> b -> V3 a -> b #

foldl' :: (b -> a -> b) -> b -> V3 a -> b #

foldr1 :: (a -> a -> a) -> V3 a -> a #

foldl1 :: (a -> a -> a) -> V3 a -> a #

toList :: V3 a -> [a] #

null :: V3 a -> Bool #

length :: V3 a -> Int #

elem :: Eq a => a -> V3 a -> Bool #

maximum :: Ord a => V3 a -> a #

minimum :: Ord a => V3 a -> a #

sum :: Num a => V3 a -> a #

product :: Num a => V3 a -> a #

Foldable V2 
Instance details

Defined in Linear.V2

Methods

fold :: Monoid m => V2 m -> m #

foldMap :: Monoid m => (a -> m) -> V2 a -> m #

foldr :: (a -> b -> b) -> b -> V2 a -> b #

foldr' :: (a -> b -> b) -> b -> V2 a -> b #

foldl :: (b -> a -> b) -> b -> V2 a -> b #

foldl' :: (b -> a -> b) -> b -> V2 a -> b #

foldr1 :: (a -> a -> a) -> V2 a -> a #

foldl1 :: (a -> a -> a) -> V2 a -> a #

toList :: V2 a -> [a] #

null :: V2 a -> Bool #

length :: V2 a -> Int #

elem :: Eq a => a -> V2 a -> Bool #

maximum :: Ord a => V2 a -> a #

minimum :: Ord a => V2 a -> a #

sum :: Num a => V2 a -> a #

product :: Num a => V2 a -> a #

Foldable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fold :: Monoid m => Polar m -> m #

foldMap :: Monoid m => (a -> m) -> Polar a -> m #

foldr :: (a -> b -> b) -> b -> Polar a -> b #

foldr' :: (a -> b -> b) -> b -> Polar a -> b #

foldl :: (b -> a -> b) -> b -> Polar a -> b #

foldl' :: (b -> a -> b) -> b -> Polar a -> b #

foldr1 :: (a -> a -> a) -> Polar a -> a #

foldl1 :: (a -> a -> a) -> Polar a -> a #

toList :: Polar a -> [a] #

null :: Polar a -> Bool #

length :: Polar a -> Int #

elem :: Eq a => a -> Polar a -> Bool #

maximum :: Ord a => Polar a -> a #

minimum :: Ord a => Polar a -> a #

sum :: Num a => Polar a -> a #

product :: Num a => Polar a -> a #

Foldable Array 
Instance details

Defined in Data.Primitive.Array

Methods

fold :: Monoid m => Array m -> m #

foldMap :: Monoid m => (a -> m) -> Array a -> m #

foldr :: (a -> b -> b) -> b -> Array a -> b #

foldr' :: (a -> b -> b) -> b -> Array a -> b #

foldl :: (b -> a -> b) -> b -> Array a -> b #

foldl' :: (b -> a -> b) -> b -> Array a -> b #

foldr1 :: (a -> a -> a) -> Array a -> a #

foldl1 :: (a -> a -> a) -> Array a -> a #

toList :: Array a -> [a] #

null :: Array a -> Bool #

length :: Array a -> Int #

elem :: Eq a => a -> Array a -> Bool #

maximum :: Ord a => Array a -> a #

minimum :: Ord a => Array a -> a #

sum :: Num a => Array a -> a #

product :: Num a => Array a -> a #

Foldable Vector 
Instance details

Defined in Data.Vector

Methods

fold :: Monoid m => Vector m -> m #

foldMap :: Monoid m => (a -> m) -> Vector a -> m #

foldr :: (a -> b -> b) -> b -> Vector a -> b #

foldr' :: (a -> b -> b) -> b -> Vector a -> b #

foldl :: (b -> a -> b) -> b -> Vector a -> b #

foldl' :: (b -> a -> b) -> b -> Vector a -> b #

foldr1 :: (a -> a -> a) -> Vector a -> a #

foldl1 :: (a -> a -> a) -> Vector a -> a #

toList :: Vector a -> [a] #

null :: Vector a -> Bool #

length :: Vector a -> Int #

elem :: Eq a => a -> Vector a -> Bool #

maximum :: Ord a => Vector a -> a #

minimum :: Ord a => Vector a -> a #

sum :: Num a => Vector a -> a #

product :: Num a => Vector a -> a #

Foldable Log 
Instance details

Defined in Numeric.Log

Methods

fold :: Monoid m => Log m -> m #

foldMap :: Monoid m => (a -> m) -> Log a -> m #

foldr :: (a -> b -> b) -> b -> Log a -> b #

foldr' :: (a -> b -> b) -> b -> Log a -> b #

foldl :: (b -> a -> b) -> b -> Log a -> b #

foldl' :: (b -> a -> b) -> b -> Log a -> b #

foldr1 :: (a -> a -> a) -> Log a -> a #

foldl1 :: (a -> a -> a) -> Log a -> a #

toList :: Log a -> [a] #

null :: Log a -> Bool #

length :: Log a -> Int #

elem :: Eq a => a -> Log a -> Bool #

maximum :: Ord a => Log a -> a #

minimum :: Ord a => Log a -> a #

sum :: Num a => Log a -> a #

product :: Num a => Log a -> a #

Foldable HashSet 
Instance details

Defined in Data.HashSet

Methods

fold :: Monoid m => HashSet m -> m #

foldMap :: Monoid m => (a -> m) -> HashSet a -> m #

foldr :: (a -> b -> b) -> b -> HashSet a -> b #

foldr' :: (a -> b -> b) -> b -> HashSet a -> b #

foldl :: (b -> a -> b) -> b -> HashSet a -> b #

foldl' :: (b -> a -> b) -> b -> HashSet a -> b #

foldr1 :: (a -> a -> a) -> HashSet a -> a #

foldl1 :: (a -> a -> a) -> HashSet a -> a #

toList :: HashSet a -> [a] #

null :: HashSet a -> Bool #

length :: HashSet a -> Int #

elem :: Eq a => a -> HashSet a -> Bool #

maximum :: Ord a => HashSet a -> a #

minimum :: Ord a => HashSet a -> a #

sum :: Num a => HashSet a -> a #

product :: Num a => HashSet a -> a #

Foldable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fold :: Monoid m => Interval m -> m #

foldMap :: Monoid m => (a -> m) -> Interval a -> m #

foldr :: (a -> b -> b) -> b -> Interval a -> b #

foldr' :: (a -> b -> b) -> b -> Interval a -> b #

foldl :: (b -> a -> b) -> b -> Interval a -> b #

foldl' :: (b -> a -> b) -> b -> Interval a -> b #

foldr1 :: (a -> a -> a) -> Interval a -> a #

foldl1 :: (a -> a -> a) -> Interval a -> a #

toList :: Interval a -> [a] #

null :: Interval a -> Bool #

length :: Interval a -> Int #

elem :: Eq a => a -> Interval a -> Bool #

maximum :: Ord a => Interval a -> a #

minimum :: Ord a => Interval a -> a #

sum :: Num a => Interval a -> a #

product :: Num a => Interval a -> a #

Foldable V1 
Instance details

Defined in Linear.V1

Methods

fold :: Monoid m => V1 m -> m #

foldMap :: Monoid m => (a -> m) -> V1 a -> m #

foldr :: (a -> b -> b) -> b -> V1 a -> b #

foldr' :: (a -> b -> b) -> b -> V1 a -> b #

foldl :: (b -> a -> b) -> b -> V1 a -> b #

foldl' :: (b -> a -> b) -> b -> V1 a -> b #

foldr1 :: (a -> a -> a) -> V1 a -> a #

foldl1 :: (a -> a -> a) -> V1 a -> a #

toList :: V1 a -> [a] #

null :: V1 a -> Bool #

length :: V1 a -> Int #

elem :: Eq a => a -> V1 a -> Bool #

maximum :: Ord a => V1 a -> a #

minimum :: Ord a => V1 a -> a #

sum :: Num a => V1 a -> a #

product :: Num a => V1 a -> a #

Foldable V4 
Instance details

Defined in Linear.V4

Methods

fold :: Monoid m => V4 m -> m #

foldMap :: Monoid m => (a -> m) -> V4 a -> m #

foldr :: (a -> b -> b) -> b -> V4 a -> b #

foldr' :: (a -> b -> b) -> b -> V4 a -> b #

foldl :: (b -> a -> b) -> b -> V4 a -> b #

foldl' :: (b -> a -> b) -> b -> V4 a -> b #

foldr1 :: (a -> a -> a) -> V4 a -> a #

foldl1 :: (a -> a -> a) -> V4 a -> a #

toList :: V4 a -> [a] #

null :: V4 a -> Bool #

length :: V4 a -> Int #

elem :: Eq a => a -> V4 a -> Bool #

maximum :: Ord a => V4 a -> a #

minimum :: Ord a => V4 a -> a #

sum :: Num a => V4 a -> a #

product :: Num a => V4 a -> a #

Foldable Digit 
Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => Digit m -> m #

foldMap :: Monoid m => (a -> m) -> Digit a -> m #

foldr :: (a -> b -> b) -> b -> Digit a -> b #

foldr' :: (a -> b -> b) -> b -> Digit a -> b #

foldl :: (b -> a -> b) -> b -> Digit a -> b #

foldl' :: (b -> a -> b) -> b -> Digit a -> b #

foldr1 :: (a -> a -> a) -> Digit a -> a #

foldl1 :: (a -> a -> a) -> Digit a -> a #

toList :: Digit a -> [a] #

null :: Digit a -> Bool #

length :: Digit a -> Int #

elem :: Eq a => a -> Digit a -> Bool #

maximum :: Ord a => Digit a -> a #

minimum :: Ord a => Digit a -> a #

sum :: Num a => Digit a -> a #

product :: Num a => Digit a -> a #

Foldable Plucker 
Instance details

Defined in Linear.Plucker

Methods

fold :: Monoid m => Plucker m -> m #

foldMap :: Monoid m => (a -> m) -> Plucker a -> m #

foldr :: (a -> b -> b) -> b -> Plucker a -> b #

foldr' :: (a -> b -> b) -> b -> Plucker a -> b #

foldl :: (b -> a -> b) -> b -> Plucker a -> b #

foldl' :: (b -> a -> b) -> b -> Plucker a -> b #

foldr1 :: (a -> a -> a) -> Plucker a -> a #

foldl1 :: (a -> a -> a) -> Plucker a -> a #

toList :: Plucker a -> [a] #

null :: Plucker a -> Bool #

length :: Plucker a -> Int #

elem :: Eq a => a -> Plucker a -> Bool #

maximum :: Ord a => Plucker a -> a #

minimum :: Ord a => Plucker a -> a #

sum :: Num a => Plucker a -> a #

product :: Num a => Plucker a -> a #

Foldable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fold :: Monoid m => Quaternion m -> m #

foldMap :: Monoid m => (a -> m) -> Quaternion a -> m #

foldr :: (a -> b -> b) -> b -> Quaternion a -> b #

foldr' :: (a -> b -> b) -> b -> Quaternion a -> b #

foldl :: (b -> a -> b) -> b -> Quaternion a -> b #

foldl' :: (b -> a -> b) -> b -> Quaternion a -> b #

foldr1 :: (a -> a -> a) -> Quaternion a -> a #

foldl1 :: (a -> a -> a) -> Quaternion a -> a #

toList :: Quaternion a -> [a] #

null :: Quaternion a -> Bool #

length :: Quaternion a -> Int #

elem :: Eq a => a -> Quaternion a -> Bool #

maximum :: Ord a => Quaternion a -> a #

minimum :: Ord a => Quaternion a -> a #

sum :: Num a => Quaternion a -> a #

product :: Num a => Quaternion a -> a #

Foldable V0 
Instance details

Defined in Linear.V0

Methods

fold :: Monoid m => V0 m -> m #

foldMap :: Monoid m => (a -> m) -> V0 a -> m #

foldr :: (a -> b -> b) -> b -> V0 a -> b #

foldr' :: (a -> b -> b) -> b -> V0 a -> b #

foldl :: (b -> a -> b) -> b -> V0 a -> b #

foldl' :: (b -> a -> b) -> b -> V0 a -> b #

foldr1 :: (a -> a -> a) -> V0 a -> a #

foldl1 :: (a -> a -> a) -> V0 a -> a #

toList :: V0 a -> [a] #

null :: V0 a -> Bool #

length :: V0 a -> Int #

elem :: Eq a => a -> V0 a -> Bool #

maximum :: Ord a => V0 a -> a #

minimum :: Ord a => V0 a -> a #

sum :: Num a => V0 a -> a #

product :: Num a => V0 a -> a #

Foldable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => IResult m -> m #

foldMap :: Monoid m => (a -> m) -> IResult a -> m #

foldr :: (a -> b -> b) -> b -> IResult a -> b #

foldr' :: (a -> b -> b) -> b -> IResult a -> b #

foldl :: (b -> a -> b) -> b -> IResult a -> b #

foldl' :: (b -> a -> b) -> b -> IResult a -> b #

foldr1 :: (a -> a -> a) -> IResult a -> a #

foldl1 :: (a -> a -> a) -> IResult a -> a #

toList :: IResult a -> [a] #

null :: IResult a -> Bool #

length :: IResult a -> Int #

elem :: Eq a => a -> IResult a -> Bool #

maximum :: Ord a => IResult a -> a #

minimum :: Ord a => IResult a -> a #

sum :: Num a => IResult a -> a #

product :: Num a => IResult a -> a #

Foldable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => Result m -> m #

foldMap :: Monoid m => (a -> m) -> Result a -> m #

foldr :: (a -> b -> b) -> b -> Result a -> b #

foldr' :: (a -> b -> b) -> b -> Result a -> b #

foldl :: (b -> a -> b) -> b -> Result a -> b #

foldl' :: (b -> a -> b) -> b -> Result a -> b #

foldr1 :: (a -> a -> a) -> Result a -> a #

foldl1 :: (a -> a -> a) -> Result a -> a #

toList :: Result a -> [a] #

null :: Result a -> Bool #

length :: Result a -> Int #

elem :: Eq a => a -> Result a -> Bool #

maximum :: Ord a => Result a -> a #

minimum :: Ord a => Result a -> a #

sum :: Num a => Result a -> a #

product :: Num a => Result a -> a #

Foldable Hashed 
Instance details

Defined in Data.Hashable.Class

Methods

fold :: Monoid m => Hashed m -> m #

foldMap :: Monoid m => (a -> m) -> Hashed a -> m #

foldr :: (a -> b -> b) -> b -> Hashed a -> b #

foldr' :: (a -> b -> b) -> b -> Hashed a -> b #

foldl :: (b -> a -> b) -> b -> Hashed a -> b #

foldl' :: (b -> a -> b) -> b -> Hashed a -> b #

foldr1 :: (a -> a -> a) -> Hashed a -> a #

foldl1 :: (a -> a -> a) -> Hashed a -> a #

toList :: Hashed a -> [a] #

null :: Hashed a -> Bool #

length :: Hashed a -> Int #

elem :: Eq a => a -> Hashed a -> Bool #

maximum :: Ord a => Hashed a -> a #

minimum :: Ord a => Hashed a -> a #

sum :: Num a => Hashed a -> a #

product :: Num a => Hashed a -> a #

Foldable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Either a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

toList :: Either a a0 -> [a0] #

null :: Either a a0 -> Bool #

length :: Either a a0 -> Int #

elem :: Eq a0 => a0 -> Either a a0 -> Bool #

maximum :: Ord a0 => Either a a0 -> a0 #

minimum :: Ord a0 => Either a a0 -> a0 #

sum :: Num a0 => Either a a0 -> a0 #

product :: Num a0 => Either a a0 -> a0 #

Foldable (V1 :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => V1 m -> m #

foldMap :: Monoid m => (a -> m) -> V1 a -> m #

foldr :: (a -> b -> b) -> b -> V1 a -> b #

foldr' :: (a -> b -> b) -> b -> V1 a -> b #

foldl :: (b -> a -> b) -> b -> V1 a -> b #

foldl' :: (b -> a -> b) -> b -> V1 a -> b #

foldr1 :: (a -> a -> a) -> V1 a -> a #

foldl1 :: (a -> a -> a) -> V1 a -> a #

toList :: V1 a -> [a] #

null :: V1 a -> Bool #

length :: V1 a -> Int #

elem :: Eq a => a -> V1 a -> Bool #

maximum :: Ord a => V1 a -> a #

minimum :: Ord a => V1 a -> a #

sum :: Num a => V1 a -> a #

product :: Num a => V1 a -> a #

Foldable (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => U1 m -> m #

foldMap :: Monoid m => (a -> m) -> U1 a -> m #

foldr :: (a -> b -> b) -> b -> U1 a -> b #

foldr' :: (a -> b -> b) -> b -> U1 a -> b #

foldl :: (b -> a -> b) -> b -> U1 a -> b #

foldl' :: (b -> a -> b) -> b -> U1 a -> b #

foldr1 :: (a -> a -> a) -> U1 a -> a #

foldl1 :: (a -> a -> a) -> U1 a -> a #

toList :: U1 a -> [a] #

null :: U1 a -> Bool #

length :: U1 a -> Int #

elem :: Eq a => a -> U1 a -> Bool #

maximum :: Ord a => U1 a -> a #

minimum :: Ord a => U1 a -> a #

sum :: Num a => U1 a -> a #

product :: Num a => U1 a -> a #

Foldable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (a, m) -> m #

foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m #

foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b #

foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b #

foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b #

foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b #

foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 #

toList :: (a, a0) -> [a0] #

null :: (a, a0) -> Bool #

length :: (a, a0) -> Int #

elem :: Eq a0 => a0 -> (a, a0) -> Bool #

maximum :: Ord a0 => (a, a0) -> a0 #

minimum :: Ord a0 => (a, a0) -> a0 #

sum :: Num a0 => (a, a0) -> a0 #

product :: Num a0 => (a, a0) -> a0 #

Foldable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fold :: Monoid m => Level i m -> m #

foldMap :: Monoid m => (a -> m) -> Level i a -> m #

foldr :: (a -> b -> b) -> b -> Level i a -> b #

foldr' :: (a -> b -> b) -> b -> Level i a -> b #

foldl :: (b -> a -> b) -> b -> Level i a -> b #

foldl' :: (b -> a -> b) -> b -> Level i a -> b #

foldr1 :: (a -> a -> a) -> Level i a -> a #

foldl1 :: (a -> a -> a) -> Level i a -> a #

toList :: Level i a -> [a] #

null :: Level i a -> Bool #

length :: Level i a -> Int #

elem :: Eq a => a -> Level i a -> Bool #

maximum :: Ord a => Level i a -> a #

minimum :: Ord a => Level i a -> a #

sum :: Num a => Level i a -> a #

product :: Num a => Level i a -> a #

Foldable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fold :: Monoid m => Map k m -> m #

foldMap :: Monoid m => (a -> m) -> Map k a -> m #

foldr :: (a -> b -> b) -> b -> Map k a -> b #

foldr' :: (a -> b -> b) -> b -> Map k a -> b #

foldl :: (b -> a -> b) -> b -> Map k a -> b #

foldl' :: (b -> a -> b) -> b -> Map k a -> b #

foldr1 :: (a -> a -> a) -> Map k a -> a #

foldl1 :: (a -> a -> a) -> Map k a -> a #

toList :: Map k a -> [a] #

null :: Map k a -> Bool #

length :: Map k a -> Int #

elem :: Eq a => a -> Map k a -> Bool #

maximum :: Ord a => Map k a -> a #

minimum :: Ord a => Map k a -> a #

sum :: Num a => Map k a -> a #

product :: Num a => Map k a -> a #

Foldable (Array i)

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Array i m -> m #

foldMap :: Monoid m => (a -> m) -> Array i a -> m #

foldr :: (a -> b -> b) -> b -> Array i a -> b #

foldr' :: (a -> b -> b) -> b -> Array i a -> b #

foldl :: (b -> a -> b) -> b -> Array i a -> b #

foldl' :: (b -> a -> b) -> b -> Array i a -> b #

foldr1 :: (a -> a -> a) -> Array i a -> a #

foldl1 :: (a -> a -> a) -> Array i a -> a #

toList :: Array i a -> [a] #

null :: Array i a -> Bool #

length :: Array i a -> Int #

elem :: Eq a => a -> Array i a -> Bool #

maximum :: Ord a => Array i a -> a #

minimum :: Ord a => Array i a -> a #

sum :: Num a => Array i a -> a #

product :: Num a => Array i a -> a #

Foldable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Arg a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 #

toList :: Arg a a0 -> [a0] #

null :: Arg a a0 -> Bool #

length :: Arg a a0 -> Int #

elem :: Eq a0 => a0 -> Arg a a0 -> Bool #

maximum :: Ord a0 => Arg a a0 -> a0 #

minimum :: Ord a0 => Arg a a0 -> a0 #

sum :: Num a0 => Arg a a0 -> a0 #

product :: Num a0 => Arg a a0 -> a0 #

Foldable (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Proxy m -> m #

foldMap :: Monoid m => (a -> m) -> Proxy a -> m #

foldr :: (a -> b -> b) -> b -> Proxy a -> b #

foldr' :: (a -> b -> b) -> b -> Proxy a -> b #

foldl :: (b -> a -> b) -> b -> Proxy a -> b #

foldl' :: (b -> a -> b) -> b -> Proxy a -> b #

foldr1 :: (a -> a -> a) -> Proxy a -> a #

foldl1 :: (a -> a -> a) -> Proxy a -> a #

toList :: Proxy a -> [a] #

null :: Proxy a -> Bool #

length :: Proxy a -> Int #

elem :: Eq a => a -> Proxy a -> Bool #

maximum :: Ord a => Proxy a -> a #

minimum :: Ord a => Proxy a -> a #

sum :: Num a => Proxy a -> a #

product :: Num a => Proxy a -> a #

Foldable f => Foldable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fold :: Monoid m => MaybeT f m -> m #

foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m #

foldr :: (a -> b -> b) -> b -> MaybeT f a -> b #

foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b #

foldl :: (b -> a -> b) -> b -> MaybeT f a -> b #

foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b #

foldr1 :: (a -> a -> a) -> MaybeT f a -> a #

foldl1 :: (a -> a -> a) -> MaybeT f a -> a #

toList :: MaybeT f a -> [a] #

null :: MaybeT f a -> Bool #

length :: MaybeT f a -> Int #

elem :: Eq a => a -> MaybeT f a -> Bool #

maximum :: Ord a => MaybeT f a -> a #

minimum :: Ord a => MaybeT f a -> a #

sum :: Num a => MaybeT f a -> a #

product :: Num a => MaybeT f a -> a #

Foldable (FingerTree v)

Elements from left to right.

Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => FingerTree v m -> m #

foldMap :: Monoid m => (a -> m) -> FingerTree v a -> m #

foldr :: (a -> b -> b) -> b -> FingerTree v a -> b #

foldr' :: (a -> b -> b) -> b -> FingerTree v a -> b #

foldl :: (b -> a -> b) -> b -> FingerTree v a -> b #

foldl' :: (b -> a -> b) -> b -> FingerTree v a -> b #

foldr1 :: (a -> a -> a) -> FingerTree v a -> a #

foldl1 :: (a -> a -> a) -> FingerTree v a -> a #

toList :: FingerTree v a -> [a] #

null :: FingerTree v a -> Bool #

length :: FingerTree v a -> Int #

elem :: Eq a => a -> FingerTree v a -> Bool #

maximum :: Ord a => FingerTree v a -> a #

minimum :: Ord a => FingerTree v a -> a #

sum :: Num a => FingerTree v a -> a #

product :: Num a => FingerTree v a -> a #

Foldable f => Foldable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fold :: Monoid m => ListT f m -> m #

foldMap :: Monoid m => (a -> m) -> ListT f a -> m #

foldr :: (a -> b -> b) -> b -> ListT f a -> b #

foldr' :: (a -> b -> b) -> b -> ListT f a -> b #

foldl :: (b -> a -> b) -> b -> ListT f a -> b #

foldl' :: (b -> a -> b) -> b -> ListT f a -> b #

foldr1 :: (a -> a -> a) -> ListT f a -> a #

foldl1 :: (a -> a -> a) -> ListT f a -> a #

toList :: ListT f a -> [a] #

null :: ListT f a -> Bool #

length :: ListT f a -> Int #

elem :: Eq a => a -> ListT f a -> Bool #

maximum :: Ord a => ListT f a -> a #

minimum :: Ord a => ListT f a -> a #

sum :: Num a => ListT f a -> a #

product :: Num a => ListT f a -> a #

Foldable f => Foldable (Point f) 
Instance details

Defined in Linear.Affine

Methods

fold :: Monoid m => Point f m -> m #

foldMap :: Monoid m => (a -> m) -> Point f a -> m #

foldr :: (a -> b -> b) -> b -> Point f a -> b #

foldr' :: (a -> b -> b) -> b -> Point f a -> b #

foldl :: (b -> a -> b) -> b -> Point f a -> b #

foldl' :: (b -> a -> b) -> b -> Point f a -> b #

foldr1 :: (a -> a -> a) -> Point f a -> a #

foldl1 :: (a -> a -> a) -> Point f a -> a #

toList :: Point f a -> [a] #

null :: Point f a -> Bool #

length :: Point f a -> Int #

elem :: Eq a => a -> Point f a -> Bool #

maximum :: Ord a => Point f a -> a #

minimum :: Ord a => Point f a -> a #

sum :: Num a => Point f a -> a #

product :: Num a => Point f a -> a #

Foldable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fold :: Monoid m => Categorical p m -> m #

foldMap :: Monoid m => (a -> m) -> Categorical p a -> m #

foldr :: (a -> b -> b) -> b -> Categorical p a -> b #

foldr' :: (a -> b -> b) -> b -> Categorical p a -> b #

foldl :: (b -> a -> b) -> b -> Categorical p a -> b #

foldl' :: (b -> a -> b) -> b -> Categorical p a -> b #

foldr1 :: (a -> a -> a) -> Categorical p a -> a #

foldl1 :: (a -> a -> a) -> Categorical p a -> a #

toList :: Categorical p a -> [a] #

null :: Categorical p a -> Bool #

length :: Categorical p a -> Int #

elem :: Eq a => a -> Categorical p a -> Bool #

maximum :: Ord a => Categorical p a -> a #

minimum :: Ord a => Categorical p a -> a #

sum :: Num a => Categorical p a -> a #

product :: Num a => Categorical p a -> a #

Foldable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fold :: Monoid m => HashMap k m -> m #

foldMap :: Monoid m => (a -> m) -> HashMap k a -> m #

foldr :: (a -> b -> b) -> b -> HashMap k a -> b #

foldr' :: (a -> b -> b) -> b -> HashMap k a -> b #

foldl :: (b -> a -> b) -> b -> HashMap k a -> b #

foldl' :: (b -> a -> b) -> b -> HashMap k a -> b #

foldr1 :: (a -> a -> a) -> HashMap k a -> a #

foldl1 :: (a -> a -> a) -> HashMap k a -> a #

toList :: HashMap k a -> [a] #

null :: HashMap k a -> Bool #

length :: HashMap k a -> Int #

elem :: Eq a => a -> HashMap k a -> Bool #

maximum :: Ord a => HashMap k a -> a #

minimum :: Ord a => HashMap k a -> a #

sum :: Num a => HashMap k a -> a #

product :: Num a => HashMap k a -> a #

Foldable f => Foldable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fold :: Monoid m => Cofree f m -> m #

foldMap :: Monoid m => (a -> m) -> Cofree f a -> m #

foldr :: (a -> b -> b) -> b -> Cofree f a -> b #

foldr' :: (a -> b -> b) -> b -> Cofree f a -> b #

foldl :: (b -> a -> b) -> b -> Cofree f a -> b #

foldl' :: (b -> a -> b) -> b -> Cofree f a -> b #

foldr1 :: (a -> a -> a) -> Cofree f a -> a #

foldl1 :: (a -> a -> a) -> Cofree f a -> a #

toList :: Cofree f a -> [a] #

null :: Cofree f a -> Bool #

length :: Cofree f a -> Int #

elem :: Eq a => a -> Cofree f a -> Bool #

maximum :: Ord a => Cofree f a -> a #

minimum :: Ord a => Cofree f a -> a #

sum :: Num a => Cofree f a -> a #

product :: Num a => Cofree f a -> a #

Foldable (Node v) 
Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => Node v m -> m #

foldMap :: Monoid m => (a -> m) -> Node v a -> m #

foldr :: (a -> b -> b) -> b -> Node v a -> b #

foldr' :: (a -> b -> b) -> b -> Node v a -> b #

foldl :: (b -> a -> b) -> b -> Node v a -> b #

foldl' :: (b -> a -> b) -> b -> Node v a -> b #

foldr1 :: (a -> a -> a) -> Node v a -> a #

foldl1 :: (a -> a -> a) -> Node v a -> a #

toList :: Node v a -> [a] #

null :: Node v a -> Bool #

length :: Node v a -> Int #

elem :: Eq a => a -> Node v a -> Bool #

maximum :: Ord a => Node v a -> a #

minimum :: Ord a => Node v a -> a #

sum :: Num a => Node v a -> a #

product :: Num a => Node v a -> a #

Foldable f => Foldable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fold :: Monoid m => Free f m -> m #

foldMap :: Monoid m => (a -> m) -> Free f a -> m #

foldr :: (a -> b -> b) -> b -> Free f a -> b #

foldr' :: (a -> b -> b) -> b -> Free f a -> b #

foldl :: (b -> a -> b) -> b -> Free f a -> b #

foldl' :: (b -> a -> b) -> b -> Free f a -> b #

foldr1 :: (a -> a -> a) -> Free f a -> a #

foldl1 :: (a -> a -> a) -> Free f a -> a #

toList :: Free f a -> [a] #

null :: Free f a -> Bool #

length :: Free f a -> Int #

elem :: Eq a => a -> Free f a -> Bool #

maximum :: Ord a => Free f a -> a #

minimum :: Ord a => Free f a -> a #

sum :: Num a => Free f a -> a #

product :: Num a => Free f a -> a #

Foldable f => Foldable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fold :: Monoid m => Yoneda f m -> m #

foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m #

foldr :: (a -> b -> b) -> b -> Yoneda f a -> b #

foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b #

foldl :: (b -> a -> b) -> b -> Yoneda f a -> b #

foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b #

foldr1 :: (a -> a -> a) -> Yoneda f a -> a #

foldl1 :: (a -> a -> a) -> Yoneda f a -> a #

toList :: Yoneda f a -> [a] #

null :: Yoneda f a -> Bool #

length :: Yoneda f a -> Int #

elem :: Eq a => a -> Yoneda f a -> Bool #

maximum :: Ord a => Yoneda f a -> a #

minimum :: Ord a => Yoneda f a -> a #

sum :: Num a => Yoneda f a -> a #

product :: Num a => Yoneda f a -> a #

Foldable f => Foldable (Rec1 f) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Rec1 f m -> m #

foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m #

foldr :: (a -> b -> b) -> b -> Rec1 f a -> b #

foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b #

foldl :: (b -> a -> b) -> b -> Rec1 f a -> b #

foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b #

foldr1 :: (a -> a -> a) -> Rec1 f a -> a #

foldl1 :: (a -> a -> a) -> Rec1 f a -> a #

toList :: Rec1 f a -> [a] #

null :: Rec1 f a -> Bool #

length :: Rec1 f a -> Int #

elem :: Eq a => a -> Rec1 f a -> Bool #

maximum :: Ord a => Rec1 f a -> a #

minimum :: Ord a => Rec1 f a -> a #

sum :: Num a => Rec1 f a -> a #

product :: Num a => Rec1 f a -> a #

Foldable (URec Char :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Char m -> m #

foldMap :: Monoid m => (a -> m) -> URec Char a -> m #

foldr :: (a -> b -> b) -> b -> URec Char a -> b #

foldr' :: (a -> b -> b) -> b -> URec Char a -> b #

foldl :: (b -> a -> b) -> b -> URec Char a -> b #

foldl' :: (b -> a -> b) -> b -> URec Char a -> b #

foldr1 :: (a -> a -> a) -> URec Char a -> a #

foldl1 :: (a -> a -> a) -> URec Char a -> a #

toList :: URec Char a -> [a] #

null :: URec Char a -> Bool #

length :: URec Char a -> Int #

elem :: Eq a => a -> URec Char a -> Bool #

maximum :: Ord a => URec Char a -> a #

minimum :: Ord a => URec Char a -> a #

sum :: Num a => URec Char a -> a #

product :: Num a => URec Char a -> a #

Foldable (URec Double :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Double m -> m #

foldMap :: Monoid m => (a -> m) -> URec Double a -> m #

foldr :: (a -> b -> b) -> b -> URec Double a -> b #

foldr' :: (a -> b -> b) -> b -> URec Double a -> b #

foldl :: (b -> a -> b) -> b -> URec Double a -> b #

foldl' :: (b -> a -> b) -> b -> URec Double a -> b #

foldr1 :: (a -> a -> a) -> URec Double a -> a #

foldl1 :: (a -> a -> a) -> URec Double a -> a #

toList :: URec Double a -> [a] #

null :: URec Double a -> Bool #

length :: URec Double a -> Int #

elem :: Eq a => a -> URec Double a -> Bool #

maximum :: Ord a => URec Double a -> a #

minimum :: Ord a => URec Double a -> a #

sum :: Num a => URec Double a -> a #

product :: Num a => URec Double a -> a #

Foldable (URec Float :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Float m -> m #

foldMap :: Monoid m => (a -> m) -> URec Float a -> m #

foldr :: (a -> b -> b) -> b -> URec Float a -> b #

foldr' :: (a -> b -> b) -> b -> URec Float a -> b #

foldl :: (b -> a -> b) -> b -> URec Float a -> b #

foldl' :: (b -> a -> b) -> b -> URec Float a -> b #

foldr1 :: (a -> a -> a) -> URec Float a -> a #

foldl1 :: (a -> a -> a) -> URec Float a -> a #

toList :: URec Float a -> [a] #

null :: URec Float a -> Bool #

length :: URec Float a -> Int #

elem :: Eq a => a -> URec Float a -> Bool #

maximum :: Ord a => URec Float a -> a #

minimum :: Ord a => URec Float a -> a #

sum :: Num a => URec Float a -> a #

product :: Num a => URec Float a -> a #

Foldable (URec Int :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Int m -> m #

foldMap :: Monoid m => (a -> m) -> URec Int a -> m #

foldr :: (a -> b -> b) -> b -> URec Int a -> b #

foldr' :: (a -> b -> b) -> b -> URec Int a -> b #

foldl :: (b -> a -> b) -> b -> URec Int a -> b #

foldl' :: (b -> a -> b) -> b -> URec Int a -> b #

foldr1 :: (a -> a -> a) -> URec Int a -> a #

foldl1 :: (a -> a -> a) -> URec Int a -> a #

toList :: URec Int a -> [a] #

null :: URec Int a -> Bool #

length :: URec Int a -> Int #

elem :: Eq a => a -> URec Int a -> Bool #

maximum :: Ord a => URec Int a -> a #

minimum :: Ord a => URec Int a -> a #

sum :: Num a => URec Int a -> a #

product :: Num a => URec Int a -> a #

Foldable (URec Word :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Word m -> m #

foldMap :: Monoid m => (a -> m) -> URec Word a -> m #

foldr :: (a -> b -> b) -> b -> URec Word a -> b #

foldr' :: (a -> b -> b) -> b -> URec Word a -> b #

foldl :: (b -> a -> b) -> b -> URec Word a -> b #

foldl' :: (b -> a -> b) -> b -> URec Word a -> b #

foldr1 :: (a -> a -> a) -> URec Word a -> a #

foldl1 :: (a -> a -> a) -> URec Word a -> a #

toList :: URec Word a -> [a] #

null :: URec Word a -> Bool #

length :: URec Word a -> Int #

elem :: Eq a => a -> URec Word a -> Bool #

maximum :: Ord a => URec Word a -> a #

minimum :: Ord a => URec Word a -> a #

sum :: Num a => URec Word a -> a #

product :: Num a => URec Word a -> a #

Foldable (URec (Ptr ()) :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec (Ptr ()) m -> m #

foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m #

foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b #

foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b #

foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b #

foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b #

foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a #

foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a #

toList :: URec (Ptr ()) a -> [a] #

null :: URec (Ptr ()) a -> Bool #

length :: URec (Ptr ()) a -> Int #

elem :: Eq a => a -> URec (Ptr ()) a -> Bool #

maximum :: Ord a => URec (Ptr ()) a -> a #

minimum :: Ord a => URec (Ptr ()) a -> a #

sum :: Num a => URec (Ptr ()) a -> a #

product :: Num a => URec (Ptr ()) a -> a #

Foldable (Const m :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Functor.Const

Methods

fold :: Monoid m0 => Const m m0 -> m0 #

foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 #

foldr :: (a -> b -> b) -> b -> Const m a -> b #

foldr' :: (a -> b -> b) -> b -> Const m a -> b #

foldl :: (b -> a -> b) -> b -> Const m a -> b #

foldl' :: (b -> a -> b) -> b -> Const m a -> b #

foldr1 :: (a -> a -> a) -> Const m a -> a #

foldl1 :: (a -> a -> a) -> Const m a -> a #

toList :: Const m a -> [a] #

null :: Const m a -> Bool #

length :: Const m a -> Int #

elem :: Eq a => a -> Const m a -> Bool #

maximum :: Ord a => Const m a -> a #

minimum :: Ord a => Const m a -> a #

sum :: Num a => Const m a -> a #

product :: Num a => Const m a -> a #

Foldable f => Foldable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fold :: Monoid m => IdentityT f m -> m #

foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m #

foldr :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldl :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldr1 :: (a -> a -> a) -> IdentityT f a -> a #

foldl1 :: (a -> a -> a) -> IdentityT f a -> a #

toList :: IdentityT f a -> [a] #

null :: IdentityT f a -> Bool #

length :: IdentityT f a -> Int #

elem :: Eq a => a -> IdentityT f a -> Bool #

maximum :: Ord a => IdentityT f a -> a #

minimum :: Ord a => IdentityT f a -> a #

sum :: Num a => IdentityT f a -> a #

product :: Num a => IdentityT f a -> a #

Foldable f => Foldable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fold :: Monoid m => ExceptT e f m -> m #

foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m #

foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b #

foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b #

foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b #

foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b #

foldr1 :: (a -> a -> a) -> ExceptT e f a -> a #

foldl1 :: (a -> a -> a) -> ExceptT e f a -> a #

toList :: ExceptT e f a -> [a] #

null :: ExceptT e f a -> Bool #

length :: ExceptT e f a -> Int #

elem :: Eq a => a -> ExceptT e f a -> Bool #

maximum :: Ord a => ExceptT e f a -> a #

minimum :: Ord a => ExceptT e f a -> a #

sum :: Num a => ExceptT e f a -> a #

product :: Num a => ExceptT e f a -> a #

Foldable f => Foldable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fold :: Monoid m => ErrorT e f m -> m #

foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m #

foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b #

foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b #

foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b #

foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b #

foldr1 :: (a -> a -> a) -> ErrorT e f a -> a #

foldl1 :: (a -> a -> a) -> ErrorT e f a -> a #

toList :: ErrorT e f a -> [a] #

null :: ErrorT e f a -> Bool #

length :: ErrorT e f a -> Int #

elem :: Eq a => a -> ErrorT e f a -> Bool #

maximum :: Ord a => ErrorT e f a -> a #

minimum :: Ord a => ErrorT e f a -> a #

sum :: Num a => ErrorT e f a -> a #

product :: Num a => ErrorT e f a -> a #

Foldable f => Foldable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fold :: Monoid m => Backwards f m -> m #

foldMap :: Monoid m => (a -> m) -> Backwards f a -> m #

foldr :: (a -> b -> b) -> b -> Backwards f a -> b #

foldr' :: (a -> b -> b) -> b -> Backwards f a -> b #

foldl :: (b -> a -> b) -> b -> Backwards f a -> b #

foldl' :: (b -> a -> b) -> b -> Backwards f a -> b #

foldr1 :: (a -> a -> a) -> Backwards f a -> a #

foldl1 :: (a -> a -> a) -> Backwards f a -> a #

toList :: Backwards f a -> [a] #

null :: Backwards f a -> Bool #

length :: Backwards f a -> Int #

elem :: Eq a => a -> Backwards f a -> Bool #

maximum :: Ord a => Backwards f a -> a #

minimum :: Ord a => Backwards f a -> a #

sum :: Num a => Backwards f a -> a #

product :: Num a => Backwards f a -> a #

Foldable f => Foldable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fold :: Monoid m => WriterT w f m -> m #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a #

toList :: WriterT w f a -> [a] #

null :: WriterT w f a -> Bool #

length :: WriterT w f a -> Int #

elem :: Eq a => a -> WriterT w f a -> Bool #

maximum :: Ord a => WriterT w f a -> a #

minimum :: Ord a => WriterT w f a -> a #

sum :: Num a => WriterT w f a -> a #

product :: Num a => WriterT w f a -> a #

Foldable f => Foldable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fold :: Monoid m => WriterT w f m -> m #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a #

toList :: WriterT w f a -> [a] #

null :: WriterT w f a -> Bool #

length :: WriterT w f a -> Int #

elem :: Eq a => a -> WriterT w f a -> Bool #

maximum :: Ord a => WriterT w f a -> a #

minimum :: Ord a => WriterT w f a -> a #

sum :: Num a => WriterT w f a -> a #

product :: Num a => WriterT w f a -> a #

Bifoldable p => Foldable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fold :: Monoid m => Join p m -> m #

foldMap :: Monoid m => (a -> m) -> Join p a -> m #

foldr :: (a -> b -> b) -> b -> Join p a -> b #

foldr' :: (a -> b -> b) -> b -> Join p a -> b #

foldl :: (b -> a -> b) -> b -> Join p a -> b #

foldl' :: (b -> a -> b) -> b -> Join p a -> b #

foldr1 :: (a -> a -> a) -> Join p a -> a #

foldl1 :: (a -> a -> a) -> Join p a -> a #

toList :: Join p a -> [a] #

null :: Join p a -> Bool #

length :: Join p a -> Int #

elem :: Eq a => a -> Join p a -> Bool #

maximum :: Ord a => Join p a -> a #

minimum :: Ord a => Join p a -> a #

sum :: Num a => Join p a -> a #

product :: Num a => Join p a -> a #

Foldable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fold :: Monoid m => Tagged s m -> m #

foldMap :: Monoid m => (a -> m) -> Tagged s a -> m #

foldr :: (a -> b -> b) -> b -> Tagged s a -> b #

foldr' :: (a -> b -> b) -> b -> Tagged s a -> b #

foldl :: (b -> a -> b) -> b -> Tagged s a -> b #

foldl' :: (b -> a -> b) -> b -> Tagged s a -> b #

foldr1 :: (a -> a -> a) -> Tagged s a -> a #

foldl1 :: (a -> a -> a) -> Tagged s a -> a #

toList :: Tagged s a -> [a] #

null :: Tagged s a -> Bool #

length :: Tagged s a -> Int #

elem :: Eq a => a -> Tagged s a -> Bool #

maximum :: Ord a => Tagged s a -> a #

minimum :: Ord a => Tagged s a -> a #

sum :: Num a => Tagged s a -> a #

product :: Num a => Tagged s a -> a #

(Foldable f, Foldable w) => Foldable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeT f w m -> m #

foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m #

foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b #

foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b #

foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b #

foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b #

foldr1 :: (a -> a -> a) -> CofreeT f w a -> a #

foldl1 :: (a -> a -> a) -> CofreeT f w a -> a #

toList :: CofreeT f w a -> [a] #

null :: CofreeT f w a -> Bool #

length :: CofreeT f w a -> Int #

elem :: Eq a => a -> CofreeT f w a -> Bool #

maximum :: Ord a => CofreeT f w a -> a #

minimum :: Ord a => CofreeT f w a -> a #

sum :: Num a => CofreeT f w a -> a #

product :: Num a => CofreeT f w a -> a #

Foldable f => Foldable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeF f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 #

toList :: CofreeF f a a0 -> [a0] #

null :: CofreeF f a a0 -> Bool #

length :: CofreeF f a a0 -> Int #

elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool #

maximum :: Ord a0 => CofreeF f a a0 -> a0 #

minimum :: Ord a0 => CofreeF f a a0 -> a0 #

sum :: Num a0 => CofreeF f a a0 -> a0 #

product :: Num a0 => CofreeF f a a0 -> a0 #

Bifoldable p => Foldable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fold :: Monoid m => Fix p m -> m #

foldMap :: Monoid m => (a -> m) -> Fix p a -> m #

foldr :: (a -> b -> b) -> b -> Fix p a -> b #

foldr' :: (a -> b -> b) -> b -> Fix p a -> b #

foldl :: (b -> a -> b) -> b -> Fix p a -> b #

foldl' :: (b -> a -> b) -> b -> Fix p a -> b #

foldr1 :: (a -> a -> a) -> Fix p a -> a #

foldl1 :: (a -> a -> a) -> Fix p a -> a #

toList :: Fix p a -> [a] #

null :: Fix p a -> Bool #

length :: Fix p a -> Int #

elem :: Eq a => a -> Fix p a -> Bool #

maximum :: Ord a => Fix p a -> a #

minimum :: Ord a => Fix p a -> a #

sum :: Num a => Fix p a -> a #

product :: Num a => Fix p a -> a #

Foldable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fold :: Monoid m => Forget r a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Forget r a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Forget r a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Forget r a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Forget r a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Forget r a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Forget r a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Forget r a a0 -> a0 #

toList :: Forget r a a0 -> [a0] #

null :: Forget r a a0 -> Bool #

length :: Forget r a a0 -> Int #

elem :: Eq a0 => a0 -> Forget r a a0 -> Bool #

maximum :: Ord a0 => Forget r a a0 -> a0 #

minimum :: Ord a0 => Forget r a a0 -> a0 #

sum :: Num a0 => Forget r a a0 -> a0 #

product :: Num a0 => Forget r a a0 -> a0 #

(Foldable m, Foldable f) => Foldable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m0 => FreeT f m m0 -> m0 #

foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 #

foldr :: (a -> b -> b) -> b -> FreeT f m a -> b #

foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b #

foldl :: (b -> a -> b) -> b -> FreeT f m a -> b #

foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b #

foldr1 :: (a -> a -> a) -> FreeT f m a -> a #

foldl1 :: (a -> a -> a) -> FreeT f m a -> a #

toList :: FreeT f m a -> [a] #

null :: FreeT f m a -> Bool #

length :: FreeT f m a -> Int #

elem :: Eq a => a -> FreeT f m a -> Bool #

maximum :: Ord a => FreeT f m a -> a #

minimum :: Ord a => FreeT f m a -> a #

sum :: Num a => FreeT f m a -> a #

product :: Num a => FreeT f m a -> a #

Foldable f => Foldable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m => FreeF f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 #

toList :: FreeF f a a0 -> [a0] #

null :: FreeF f a a0 -> Bool #

length :: FreeF f a a0 -> Int #

elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool #

maximum :: Ord a0 => FreeF f a a0 -> a0 #

minimum :: Ord a0 => FreeF f a a0 -> a0 #

sum :: Num a0 => FreeF f a a0 -> a0 #

product :: Num a0 => FreeF f a a0 -> a0 #

Foldable (V n) 
Instance details

Defined in Linear.V

Methods

fold :: Monoid m => V n m -> m #

foldMap :: Monoid m => (a -> m) -> V n a -> m #

foldr :: (a -> b -> b) -> b -> V n a -> b #

foldr' :: (a -> b -> b) -> b -> V n a -> b #

foldl :: (b -> a -> b) -> b -> V n a -> b #

foldl' :: (b -> a -> b) -> b -> V n a -> b #

foldr1 :: (a -> a -> a) -> V n a -> a #

foldl1 :: (a -> a -> a) -> V n a -> a #

toList :: V n a -> [a] #

null :: V n a -> Bool #

length :: V n a -> Int #

elem :: Eq a => a -> V n a -> Bool #

maximum :: Ord a => V n a -> a #

minimum :: Ord a => V n a -> a #

sum :: Num a => V n a -> a #

product :: Num a => V n a -> a #

Foldable f => Foldable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fold :: Monoid m => AlongsideLeft f b m -> m #

foldMap :: Monoid m => (a -> m) -> AlongsideLeft f b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldr1 :: (a -> a -> a) -> AlongsideLeft f b a -> a #

foldl1 :: (a -> a -> a) -> AlongsideLeft f b a -> a #

toList :: AlongsideLeft f b a -> [a] #

null :: AlongsideLeft f b a -> Bool #

length :: AlongsideLeft f b a -> Int #

elem :: Eq a => a -> AlongsideLeft f b a -> Bool #

maximum :: Ord a => AlongsideLeft f b a -> a #

minimum :: Ord a => AlongsideLeft f b a -> a #

sum :: Num a => AlongsideLeft f b a -> a #

product :: Num a => AlongsideLeft f b a -> a #

Foldable f => Foldable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fold :: Monoid m => AlongsideRight f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> AlongsideRight f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 #

toList :: AlongsideRight f a a0 -> [a0] #

null :: AlongsideRight f a a0 -> Bool #

length :: AlongsideRight f a a0 -> Int #

elem :: Eq a0 => a0 -> AlongsideRight f a a0 -> Bool #

maximum :: Ord a0 => AlongsideRight f a a0 -> a0 #

minimum :: Ord a0 => AlongsideRight f a a0 -> a0 #

sum :: Num a0 => AlongsideRight f a a0 -> a0 #

product :: Num a0 => AlongsideRight f a a0 -> a0 #

Foldable (K1 i c :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => K1 i c m -> m #

foldMap :: Monoid m => (a -> m) -> K1 i c a -> m #

foldr :: (a -> b -> b) -> b -> K1 i c a -> b #

foldr' :: (a -> b -> b) -> b -> K1 i c a -> b #

foldl :: (b -> a -> b) -> b -> K1 i c a -> b #

foldl' :: (b -> a -> b) -> b -> K1 i c a -> b #

foldr1 :: (a -> a -> a) -> K1 i c a -> a #

foldl1 :: (a -> a -> a) -> K1 i c a -> a #

toList :: K1 i c a -> [a] #

null :: K1 i c a -> Bool #

length :: K1 i c a -> Int #

elem :: Eq a => a -> K1 i c a -> Bool #

maximum :: Ord a => K1 i c a -> a #

minimum :: Ord a => K1 i c a -> a #

sum :: Num a => K1 i c a -> a #

product :: Num a => K1 i c a -> a #

(Foldable f, Foldable g) => Foldable (f :+: g) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :+: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :+: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :+: g) a -> a #

toList :: (f :+: g) a -> [a] #

null :: (f :+: g) a -> Bool #

length :: (f :+: g) a -> Int #

elem :: Eq a => a -> (f :+: g) a -> Bool #

maximum :: Ord a => (f :+: g) a -> a #

minimum :: Ord a => (f :+: g) a -> a #

sum :: Num a => (f :+: g) a -> a #

product :: Num a => (f :+: g) a -> a #

(Foldable f, Foldable g) => Foldable (f :*: g) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :*: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :*: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :*: g) a -> a #

toList :: (f :*: g) a -> [a] #

null :: (f :*: g) a -> Bool #

length :: (f :*: g) a -> Int #

elem :: Eq a => a -> (f :*: g) a -> Bool #

maximum :: Ord a => (f :*: g) a -> a #

minimum :: Ord a => (f :*: g) a -> a #

sum :: Num a => (f :*: g) a -> a #

product :: Num a => (f :*: g) a -> a #

Foldable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fold :: Monoid m => Magma i t b m -> m #

foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldr1 :: (a -> a -> a) -> Magma i t b a -> a #

foldl1 :: (a -> a -> a) -> Magma i t b a -> a #

toList :: Magma i t b a -> [a] #

null :: Magma i t b a -> Bool #

length :: Magma i t b a -> Int #

elem :: Eq a => a -> Magma i t b a -> Bool #

maximum :: Ord a => Magma i t b a -> a #

minimum :: Ord a => Magma i t b a -> a #

sum :: Num a => Magma i t b a -> a #

product :: Num a => Magma i t b a -> a #

(Foldable f, Foldable g) => Foldable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fold :: Monoid m => Product f g m -> m #

foldMap :: Monoid m => (a -> m) -> Product f g a -> m #

foldr :: (a -> b -> b) -> b -> Product f g a -> b #

foldr' :: (a -> b -> b) -> b -> Product f g a -> b #

foldl :: (b -> a -> b) -> b -> Product f g a -> b #

foldl' :: (b -> a -> b) -> b -> Product f g a -> b #

foldr1 :: (a -> a -> a) -> Product f g a -> a #

foldl1 :: (a -> a -> a) -> Product f g a -> a #

toList :: Product f g a -> [a] #

null :: Product f g a -> Bool #

length :: Product f g a -> Int #

elem :: Eq a => a -> Product f g a -> Bool #

maximum :: Ord a => Product f g a -> a #

minimum :: Ord a => Product f g a -> a #

sum :: Num a => Product f g a -> a #

product :: Num a => Product f g a -> a #

(Foldable f, Foldable g) => Foldable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fold :: Monoid m => Sum f g m -> m #

foldMap :: Monoid m => (a -> m) -> Sum f g a -> m #

foldr :: (a -> b -> b) -> b -> Sum f g a -> b #

foldr' :: (a -> b -> b) -> b -> Sum f g a -> b #

foldl :: (b -> a -> b) -> b -> Sum f g a -> b #

foldl' :: (b -> a -> b) -> b -> Sum f g a -> b #

foldr1 :: (a -> a -> a) -> Sum f g a -> a #

foldl1 :: (a -> a -> a) -> Sum f g a -> a #

toList :: Sum f g a -> [a] #

null :: Sum f g a -> Bool #

length :: Sum f g a -> Int #

elem :: Eq a => a -> Sum f g a -> Bool #

maximum :: Ord a => Sum f g a -> a #

minimum :: Ord a => Sum f g a -> a #

sum :: Num a => Sum f g a -> a #

product :: Num a => Sum f g a -> a #

Foldable f => Foldable (M1 i c f) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => M1 i c f m -> m #

foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m #

foldr :: (a -> b -> b) -> b -> M1 i c f a -> b #

foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b #

foldl :: (b -> a -> b) -> b -> M1 i c f a -> b #

foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b #

foldr1 :: (a -> a -> a) -> M1 i c f a -> a #

foldl1 :: (a -> a -> a) -> M1 i c f a -> a #

toList :: M1 i c f a -> [a] #

null :: M1 i c f a -> Bool #

length :: M1 i c f a -> Int #

elem :: Eq a => a -> M1 i c f a -> Bool #

maximum :: Ord a => M1 i c f a -> a #

minimum :: Ord a => M1 i c f a -> a #

sum :: Num a => M1 i c f a -> a #

product :: Num a => M1 i c f a -> a #

(Foldable f, Foldable g) => Foldable (f :.: g) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :.: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :.: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :.: g) a -> a #

toList :: (f :.: g) a -> [a] #

null :: (f :.: g) a -> Bool #

length :: (f :.: g) a -> Int #

elem :: Eq a => a -> (f :.: g) a -> Bool #

maximum :: Ord a => (f :.: g) a -> a #

minimum :: Ord a => (f :.: g) a -> a #

sum :: Num a => (f :.: g) a -> a #

product :: Num a => (f :.: g) a -> a #

(Foldable f, Foldable g) => Foldable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fold :: Monoid m => Compose f g m -> m #

foldMap :: Monoid m => (a -> m) -> Compose f g a -> m #

foldr :: (a -> b -> b) -> b -> Compose f g a -> b #

foldr' :: (a -> b -> b) -> b -> Compose f g a -> b #

foldl :: (b -> a -> b) -> b -> Compose f g a -> b #

foldl' :: (b -> a -> b) -> b -> Compose f g a -> b #

foldr1 :: (a -> a -> a) -> Compose f g a -> a #

foldl1 :: (a -> a -> a) -> Compose f g a -> a #

toList :: Compose f g a -> [a] #

null :: Compose f g a -> Bool #

length :: Compose f g a -> Int #

elem :: Eq a => a -> Compose f g a -> Bool #

maximum :: Ord a => Compose f g a -> a #

minimum :: Ord a => Compose f g a -> a #

sum :: Num a => Compose f g a -> a #

product :: Num a => Compose f g a -> a #

Foldable (Clown f a :: * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fold :: Monoid m => Clown f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 #

toList :: Clown f a a0 -> [a0] #

null :: Clown f a a0 -> Bool #

length :: Clown f a a0 -> Int #

elem :: Eq a0 => a0 -> Clown f a a0 -> Bool #

maximum :: Ord a0 => Clown f a a0 -> a0 #

minimum :: Ord a0 => Clown f a a0 -> a0 #

sum :: Num a0 => Clown f a a0 -> a0 #

product :: Num a0 => Clown f a a0 -> a0 #

Bifoldable p => Foldable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fold :: Monoid m => Flip p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 #

toList :: Flip p a a0 -> [a0] #

null :: Flip p a a0 -> Bool #

length :: Flip p a a0 -> Int #

elem :: Eq a0 => a0 -> Flip p a a0 -> Bool #

maximum :: Ord a0 => Flip p a a0 -> a0 #

minimum :: Ord a0 => Flip p a a0 -> a0 #

sum :: Num a0 => Flip p a a0 -> a0 #

product :: Num a0 => Flip p a a0 -> a0 #

Foldable g => Foldable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fold :: Monoid m => Joker g a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 #

toList :: Joker g a a0 -> [a0] #

null :: Joker g a a0 -> Bool #

length :: Joker g a a0 -> Int #

elem :: Eq a0 => a0 -> Joker g a a0 -> Bool #

maximum :: Ord a0 => Joker g a a0 -> a0 #

minimum :: Ord a0 => Joker g a a0 -> a0 #

sum :: Num a0 => Joker g a a0 -> a0 #

product :: Num a0 => Joker g a a0 -> a0 #

Bifoldable p => Foldable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fold :: Monoid m => WrappedBifunctor p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 #

toList :: WrappedBifunctor p a a0 -> [a0] #

null :: WrappedBifunctor p a a0 -> Bool #

length :: WrappedBifunctor p a a0 -> Int #

elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool #

maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 #

minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 #

sum :: Num a0 => WrappedBifunctor p a a0 -> a0 #

product :: Num a0 => WrappedBifunctor p a a0 -> a0 #

(Foldable f, Bifoldable p) => Foldable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fold :: Monoid m => Tannen f p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 #

toList :: Tannen f p a a0 -> [a0] #

null :: Tannen f p a a0 -> Bool #

length :: Tannen f p a a0 -> Int #

elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool #

maximum :: Ord a0 => Tannen f p a a0 -> a0 #

minimum :: Ord a0 => Tannen f p a a0 -> a0 #

sum :: Num a0 => Tannen f p a a0 -> a0 #

product :: Num a0 => Tannen f p a a0 -> a0 #

(Bifoldable p, Foldable g) => Foldable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fold :: Monoid m => Biff p f g a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 #

toList :: Biff p f g a a0 -> [a0] #

null :: Biff p f g a a0 -> Bool #

length :: Biff p f g a a0 -> Int #

elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool #

maximum :: Ord a0 => Biff p f g a a0 -> a0 #

minimum :: Ord a0 => Biff p f g a a0 -> a0 #

sum :: Num a0 => Biff p f g a a0 -> a0 #

product :: Num a0 => Biff p f g a a0 -> a0 #

class (Functor t, Foldable t) => Traversable (t :: * -> *) where #

Functors representing data structures that can be traversed from + structure.

Instances
Foldable []

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => [m] -> m #

foldMap :: Monoid m => (a -> m) -> [a] -> m #

foldr :: (a -> b -> b) -> b -> [a] -> b #

foldr' :: (a -> b -> b) -> b -> [a] -> b #

foldl :: (b -> a -> b) -> b -> [a] -> b #

foldl' :: (b -> a -> b) -> b -> [a] -> b #

foldr1 :: (a -> a -> a) -> [a] -> a #

foldl1 :: (a -> a -> a) -> [a] -> a #

toList :: [a] -> [a] #

null :: [a] -> Bool #

length :: [a] -> Int #

elem :: Eq a => a -> [a] -> Bool #

maximum :: Ord a => [a] -> a #

minimum :: Ord a => [a] -> a #

sum :: Num a => [a] -> a #

product :: Num a => [a] -> a #

Foldable Maybe

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m #

foldr :: (a -> b -> b) -> b -> Maybe a -> b #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b #

foldl :: (b -> a -> b) -> b -> Maybe a -> b #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b #

foldr1 :: (a -> a -> a) -> Maybe a -> a #

foldl1 :: (a -> a -> a) -> Maybe a -> a #

toList :: Maybe a -> [a] #

null :: Maybe a -> Bool #

length :: Maybe a -> Int #

elem :: Eq a => a -> Maybe a -> Bool #

maximum :: Ord a => Maybe a -> a #

minimum :: Ord a => Maybe a -> a #

sum :: Num a => Maybe a -> a #

product :: Num a => Maybe a -> a #

Foldable Par1

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Par1 m -> m #

foldMap :: Monoid m => (a -> m) -> Par1 a -> m #

foldr :: (a -> b -> b) -> b -> Par1 a -> b #

foldr' :: (a -> b -> b) -> b -> Par1 a -> b #

foldl :: (b -> a -> b) -> b -> Par1 a -> b #

foldl' :: (b -> a -> b) -> b -> Par1 a -> b #

foldr1 :: (a -> a -> a) -> Par1 a -> a #

foldl1 :: (a -> a -> a) -> Par1 a -> a #

toList :: Par1 a -> [a] #

null :: Par1 a -> Bool #

length :: Par1 a -> Int #

elem :: Eq a => a -> Par1 a -> Bool #

maximum :: Ord a => Par1 a -> a #

minimum :: Ord a => Par1 a -> a #

sum :: Num a => Par1 a -> a #

product :: Num a => Par1 a -> a #

Foldable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => IResult m -> m #

foldMap :: Monoid m => (a -> m) -> IResult a -> m #

foldr :: (a -> b -> b) -> b -> IResult a -> b #

foldr' :: (a -> b -> b) -> b -> IResult a -> b #

foldl :: (b -> a -> b) -> b -> IResult a -> b #

foldl' :: (b -> a -> b) -> b -> IResult a -> b #

foldr1 :: (a -> a -> a) -> IResult a -> a #

foldl1 :: (a -> a -> a) -> IResult a -> a #

toList :: IResult a -> [a] #

null :: IResult a -> Bool #

length :: IResult a -> Int #

elem :: Eq a => a -> IResult a -> Bool #

maximum :: Ord a => IResult a -> a #

minimum :: Ord a => IResult a -> a #

sum :: Num a => IResult a -> a #

product :: Num a => IResult a -> a #

Foldable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fold :: Monoid m => Result m -> m #

foldMap :: Monoid m => (a -> m) -> Result a -> m #

foldr :: (a -> b -> b) -> b -> Result a -> b #

foldr' :: (a -> b -> b) -> b -> Result a -> b #

foldl :: (b -> a -> b) -> b -> Result a -> b #

foldl' :: (b -> a -> b) -> b -> Result a -> b #

foldr1 :: (a -> a -> a) -> Result a -> a #

foldl1 :: (a -> a -> a) -> Result a -> a #

toList :: Result a -> [a] #

null :: Result a -> Bool #

length :: Result a -> Int #

elem :: Eq a => a -> Result a -> Bool #

maximum :: Ord a => Result a -> a #

minimum :: Ord a => Result a -> a #

sum :: Num a => Result a -> a #

product :: Num a => Result a -> a #

Foldable Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

fold :: Monoid m => Complex m -> m #

foldMap :: Monoid m => (a -> m) -> Complex a -> m #

foldr :: (a -> b -> b) -> b -> Complex a -> b #

foldr' :: (a -> b -> b) -> b -> Complex a -> b #

foldl :: (b -> a -> b) -> b -> Complex a -> b #

foldl' :: (b -> a -> b) -> b -> Complex a -> b #

foldr1 :: (a -> a -> a) -> Complex a -> a #

foldl1 :: (a -> a -> a) -> Complex a -> a #

toList :: Complex a -> [a] #

null :: Complex a -> Bool #

length :: Complex a -> Int #

elem :: Eq a => a -> Complex a -> Bool #

maximum :: Ord a => Complex a -> a #

minimum :: Ord a => Complex a -> a #

sum :: Num a => Complex a -> a #

product :: Num a => Complex a -> a #

Foldable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Min m -> m #

foldMap :: Monoid m => (a -> m) -> Min a -> m #

foldr :: (a -> b -> b) -> b -> Min a -> b #

foldr' :: (a -> b -> b) -> b -> Min a -> b #

foldl :: (b -> a -> b) -> b -> Min a -> b #

foldl' :: (b -> a -> b) -> b -> Min a -> b #

foldr1 :: (a -> a -> a) -> Min a -> a #

foldl1 :: (a -> a -> a) -> Min a -> a #

toList :: Min a -> [a] #

null :: Min a -> Bool #

length :: Min a -> Int #

elem :: Eq a => a -> Min a -> Bool #

maximum :: Ord a => Min a -> a #

minimum :: Ord a => Min a -> a #

sum :: Num a => Min a -> a #

product :: Num a => Min a -> a #

Foldable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Max m -> m #

foldMap :: Monoid m => (a -> m) -> Max a -> m #

foldr :: (a -> b -> b) -> b -> Max a -> b #

foldr' :: (a -> b -> b) -> b -> Max a -> b #

foldl :: (b -> a -> b) -> b -> Max a -> b #

foldl' :: (b -> a -> b) -> b -> Max a -> b #

foldr1 :: (a -> a -> a) -> Max a -> a #

foldl1 :: (a -> a -> a) -> Max a -> a #

toList :: Max a -> [a] #

null :: Max a -> Bool #

length :: Max a -> Int #

elem :: Eq a => a -> Max a -> Bool #

maximum :: Ord a => Max a -> a #

minimum :: Ord a => Max a -> a #

sum :: Num a => Max a -> a #

product :: Num a => Max a -> a #

Foldable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => First m -> m #

foldMap :: Monoid m => (a -> m) -> First a -> m #

foldr :: (a -> b -> b) -> b -> First a -> b #

foldr' :: (a -> b -> b) -> b -> First a -> b #

foldl :: (b -> a -> b) -> b -> First a -> b #

foldl' :: (b -> a -> b) -> b -> First a -> b #

foldr1 :: (a -> a -> a) -> First a -> a #

foldl1 :: (a -> a -> a) -> First a -> a #

toList :: First a -> [a] #

null :: First a -> Bool #

length :: First a -> Int #

elem :: Eq a => a -> First a -> Bool #

maximum :: Ord a => First a -> a #

minimum :: Ord a => First a -> a #

sum :: Num a => First a -> a #

product :: Num a => First a -> a #

Foldable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Last m -> m #

foldMap :: Monoid m => (a -> m) -> Last a -> m #

foldr :: (a -> b -> b) -> b -> Last a -> b #

foldr' :: (a -> b -> b) -> b -> Last a -> b #

foldl :: (b -> a -> b) -> b -> Last a -> b #

foldl' :: (b -> a -> b) -> b -> Last a -> b #

foldr1 :: (a -> a -> a) -> Last a -> a #

foldl1 :: (a -> a -> a) -> Last a -> a #

toList :: Last a -> [a] #

null :: Last a -> Bool #

length :: Last a -> Int #

elem :: Eq a => a -> Last a -> Bool #

maximum :: Ord a => Last a -> a #

minimum :: Ord a => Last a -> a #

sum :: Num a => Last a -> a #

product :: Num a => Last a -> a #

Foldable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Option m -> m #

foldMap :: Monoid m => (a -> m) -> Option a -> m #

foldr :: (a -> b -> b) -> b -> Option a -> b #

foldr' :: (a -> b -> b) -> b -> Option a -> b #

foldl :: (b -> a -> b) -> b -> Option a -> b #

foldl' :: (b -> a -> b) -> b -> Option a -> b #

foldr1 :: (a -> a -> a) -> Option a -> a #

foldl1 :: (a -> a -> a) -> Option a -> a #

toList :: Option a -> [a] #

null :: Option a -> Bool #

length :: Option a -> Int #

elem :: Eq a => a -> Option a -> Bool #

maximum :: Ord a => Option a -> a #

minimum :: Ord a => Option a -> a #

sum :: Num a => Option a -> a #

product :: Num a => Option a -> a #

Foldable ZipList

Since: base-4.9.0.0

Instance details

Defined in Control.Applicative

Methods

fold :: Monoid m => ZipList m -> m #

foldMap :: Monoid m => (a -> m) -> ZipList a -> m #

foldr :: (a -> b -> b) -> b -> ZipList a -> b #

foldr' :: (a -> b -> b) -> b -> ZipList a -> b #

foldl :: (b -> a -> b) -> b -> ZipList a -> b #

foldl' :: (b -> a -> b) -> b -> ZipList a -> b #

foldr1 :: (a -> a -> a) -> ZipList a -> a #

foldl1 :: (a -> a -> a) -> ZipList a -> a #

toList :: ZipList a -> [a] #

null :: ZipList a -> Bool #

length :: ZipList a -> Int #

elem :: Eq a => a -> ZipList a -> Bool #

maximum :: Ord a => ZipList a -> a #

minimum :: Ord a => ZipList a -> a #

sum :: Num a => ZipList a -> a #

product :: Num a => ZipList a -> a #

Foldable Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fold :: Monoid m => Identity m -> m #

foldMap :: Monoid m => (a -> m) -> Identity a -> m #

foldr :: (a -> b -> b) -> b -> Identity a -> b #

foldr' :: (a -> b -> b) -> b -> Identity a -> b #

foldl :: (b -> a -> b) -> b -> Identity a -> b #

foldl' :: (b -> a -> b) -> b -> Identity a -> b #

foldr1 :: (a -> a -> a) -> Identity a -> a #

foldl1 :: (a -> a -> a) -> Identity a -> a #

toList :: Identity a -> [a] #

null :: Identity a -> Bool #

length :: Identity a -> Int #

elem :: Eq a => a -> Identity a -> Bool #

maximum :: Ord a => Identity a -> a #

minimum :: Ord a => Identity a -> a #

sum :: Num a => Identity a -> a #

product :: Num a => Identity a -> a #

Foldable First

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => First m -> m #

foldMap :: Monoid m => (a -> m) -> First a -> m #

foldr :: (a -> b -> b) -> b -> First a -> b #

foldr' :: (a -> b -> b) -> b -> First a -> b #

foldl :: (b -> a -> b) -> b -> First a -> b #

foldl' :: (b -> a -> b) -> b -> First a -> b #

foldr1 :: (a -> a -> a) -> First a -> a #

foldl1 :: (a -> a -> a) -> First a -> a #

toList :: First a -> [a] #

null :: First a -> Bool #

length :: First a -> Int #

elem :: Eq a => a -> First a -> Bool #

maximum :: Ord a => First a -> a #

minimum :: Ord a => First a -> a #

sum :: Num a => First a -> a #

product :: Num a => First a -> a #

Foldable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Last m -> m #

foldMap :: Monoid m => (a -> m) -> Last a -> m #

foldr :: (a -> b -> b) -> b -> Last a -> b #

foldr' :: (a -> b -> b) -> b -> Last a -> b #

foldl :: (b -> a -> b) -> b -> Last a -> b #

foldl' :: (b -> a -> b) -> b -> Last a -> b #

foldr1 :: (a -> a -> a) -> Last a -> a #

foldl1 :: (a -> a -> a) -> Last a -> a #

toList :: Last a -> [a] #

null :: Last a -> Bool #

length :: Last a -> Int #

elem :: Eq a => a -> Last a -> Bool #

maximum :: Ord a => Last a -> a #

minimum :: Ord a => Last a -> a #

sum :: Num a => Last a -> a #

product :: Num a => Last a -> a #

Foldable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Dual m -> m #

foldMap :: Monoid m => (a -> m) -> Dual a -> m #

foldr :: (a -> b -> b) -> b -> Dual a -> b #

foldr' :: (a -> b -> b) -> b -> Dual a -> b #

foldl :: (b -> a -> b) -> b -> Dual a -> b #

foldl' :: (b -> a -> b) -> b -> Dual a -> b #

foldr1 :: (a -> a -> a) -> Dual a -> a #

foldl1 :: (a -> a -> a) -> Dual a -> a #

toList :: Dual a -> [a] #

null :: Dual a -> Bool #

length :: Dual a -> Int #

elem :: Eq a => a -> Dual a -> Bool #

maximum :: Ord a => Dual a -> a #

minimum :: Ord a => Dual a -> a #

sum :: Num a => Dual a -> a #

product :: Num a => Dual a -> a #

Foldable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Sum m -> m #

foldMap :: Monoid m => (a -> m) -> Sum a -> m #

foldr :: (a -> b -> b) -> b -> Sum a -> b #

foldr' :: (a -> b -> b) -> b -> Sum a -> b #

foldl :: (b -> a -> b) -> b -> Sum a -> b #

foldl' :: (b -> a -> b) -> b -> Sum a -> b #

foldr1 :: (a -> a -> a) -> Sum a -> a #

foldl1 :: (a -> a -> a) -> Sum a -> a #

toList :: Sum a -> [a] #

null :: Sum a -> Bool #

length :: Sum a -> Int #

elem :: Eq a => a -> Sum a -> Bool #

maximum :: Ord a => Sum a -> a #

minimum :: Ord a => Sum a -> a #

sum :: Num a => Sum a -> a #

product :: Num a => Sum a -> a #

Foldable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Product m -> m #

foldMap :: Monoid m => (a -> m) -> Product a -> m #

foldr :: (a -> b -> b) -> b -> Product a -> b #

foldr' :: (a -> b -> b) -> b -> Product a -> b #

foldl :: (b -> a -> b) -> b -> Product a -> b #

foldl' :: (b -> a -> b) -> b -> Product a -> b #

foldr1 :: (a -> a -> a) -> Product a -> a #

foldl1 :: (a -> a -> a) -> Product a -> a #

toList :: Product a -> [a] #

null :: Product a -> Bool #

length :: Product a -> Int #

elem :: Eq a => a -> Product a -> Bool #

maximum :: Ord a => Product a -> a #

minimum :: Ord a => Product a -> a #

sum :: Num a => Product a -> a #

product :: Num a => Product a -> a #

Foldable Down

Since: base-4.12.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Down m -> m #

foldMap :: Monoid m => (a -> m) -> Down a -> m #

foldr :: (a -> b -> b) -> b -> Down a -> b #

foldr' :: (a -> b -> b) -> b -> Down a -> b #

foldl :: (b -> a -> b) -> b -> Down a -> b #

foldl' :: (b -> a -> b) -> b -> Down a -> b #

foldr1 :: (a -> a -> a) -> Down a -> a #

foldl1 :: (a -> a -> a) -> Down a -> a #

toList :: Down a -> [a] #

null :: Down a -> Bool #

length :: Down a -> Int #

elem :: Eq a => a -> Down a -> Bool #

maximum :: Ord a => Down a -> a #

minimum :: Ord a => Down a -> a #

sum :: Num a => Down a -> a #

product :: Num a => Down a -> a #

Foldable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => NonEmpty m -> m #

foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m #

foldr :: (a -> b -> b) -> b -> NonEmpty a -> b #

foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b #

foldl :: (b -> a -> b) -> b -> NonEmpty a -> b #

foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b #

foldr1 :: (a -> a -> a) -> NonEmpty a -> a #

foldl1 :: (a -> a -> a) -> NonEmpty a -> a #

toList :: NonEmpty a -> [a] #

null :: NonEmpty a -> Bool #

length :: NonEmpty a -> Int #

elem :: Eq a => a -> NonEmpty a -> Bool #

maximum :: Ord a => NonEmpty a -> a #

minimum :: Ord a => NonEmpty a -> a #

sum :: Num a => NonEmpty a -> a #

product :: Num a => NonEmpty a -> a #

Foldable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fold :: Monoid m => IntMap m -> m #

foldMap :: Monoid m => (a -> m) -> IntMap a -> m #

foldr :: (a -> b -> b) -> b -> IntMap a -> b #

foldr' :: (a -> b -> b) -> b -> IntMap a -> b #

foldl :: (b -> a -> b) -> b -> IntMap a -> b #

foldl' :: (b -> a -> b) -> b -> IntMap a -> b #

foldr1 :: (a -> a -> a) -> IntMap a -> a #

foldl1 :: (a -> a -> a) -> IntMap a -> a #

toList :: IntMap a -> [a] #

null :: IntMap a -> Bool #

length :: IntMap a -> Int #

elem :: Eq a => a -> IntMap a -> Bool #

maximum :: Ord a => IntMap a -> a #

minimum :: Ord a => IntMap a -> a #

sum :: Num a => IntMap a -> a #

product :: Num a => IntMap a -> a #

Foldable Tree 
Instance details

Defined in Data.Tree

Methods

fold :: Monoid m => Tree m -> m #

foldMap :: Monoid m => (a -> m) -> Tree a -> m #

foldr :: (a -> b -> b) -> b -> Tree a -> b #

foldr' :: (a -> b -> b) -> b -> Tree a -> b #

foldl :: (b -> a -> b) -> b -> Tree a -> b #

foldl' :: (b -> a -> b) -> b -> Tree a -> b #

foldr1 :: (a -> a -> a) -> Tree a -> a #

foldl1 :: (a -> a -> a) -> Tree a -> a #

toList :: Tree a -> [a] #

null :: Tree a -> Bool #

length :: Tree a -> Int #

elem :: Eq a => a -> Tree a -> Bool #

maximum :: Ord a => Tree a -> a #

minimum :: Ord a => Tree a -> a #

sum :: Num a => Tree a -> a #

product :: Num a => Tree a -> a #

Foldable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Seq m -> m #

foldMap :: Monoid m => (a -> m) -> Seq a -> m #

foldr :: (a -> b -> b) -> b -> Seq a -> b #

foldr' :: (a -> b -> b) -> b -> Seq a -> b #

foldl :: (b -> a -> b) -> b -> Seq a -> b #

foldl' :: (b -> a -> b) -> b -> Seq a -> b #

foldr1 :: (a -> a -> a) -> Seq a -> a #

foldl1 :: (a -> a -> a) -> Seq a -> a #

toList :: Seq a -> [a] #

null :: Seq a -> Bool #

length :: Seq a -> Int #

elem :: Eq a => a -> Seq a -> Bool #

maximum :: Ord a => Seq a -> a #

minimum :: Ord a => Seq a -> a #

sum :: Num a => Seq a -> a #

product :: Num a => Seq a -> a #

Foldable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => FingerTree m -> m #

foldMap :: Monoid m => (a -> m) -> FingerTree a -> m #

foldr :: (a -> b -> b) -> b -> FingerTree a -> b #

foldr' :: (a -> b -> b) -> b -> FingerTree a -> b #

foldl :: (b -> a -> b) -> b -> FingerTree a -> b #

foldl' :: (b -> a -> b) -> b -> FingerTree a -> b #

foldr1 :: (a -> a -> a) -> FingerTree a -> a #

foldl1 :: (a -> a -> a) -> FingerTree a -> a #

toList :: FingerTree a -> [a] #

null :: FingerTree a -> Bool #

length :: FingerTree a -> Int #

elem :: Eq a => a -> FingerTree a -> Bool #

maximum :: Ord a => FingerTree a -> a #

minimum :: Ord a => FingerTree a -> a #

sum :: Num a => FingerTree a -> a #

product :: Num a => FingerTree a -> a #

Foldable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Digit m -> m #

foldMap :: Monoid m => (a -> m) -> Digit a -> m #

foldr :: (a -> b -> b) -> b -> Digit a -> b #

foldr' :: (a -> b -> b) -> b -> Digit a -> b #

foldl :: (b -> a -> b) -> b -> Digit a -> b #

foldl' :: (b -> a -> b) -> b -> Digit a -> b #

foldr1 :: (a -> a -> a) -> Digit a -> a #

foldl1 :: (a -> a -> a) -> Digit a -> a #

toList :: Digit a -> [a] #

null :: Digit a -> Bool #

length :: Digit a -> Int #

elem :: Eq a => a -> Digit a -> Bool #

maximum :: Ord a => Digit a -> a #

minimum :: Ord a => Digit a -> a #

sum :: Num a => Digit a -> a #

product :: Num a => Digit a -> a #

Foldable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Node m -> m #

foldMap :: Monoid m => (a -> m) -> Node a -> m #

foldr :: (a -> b -> b) -> b -> Node a -> b #

foldr' :: (a -> b -> b) -> b -> Node a -> b #

foldl :: (b -> a -> b) -> b -> Node a -> b #

foldl' :: (b -> a -> b) -> b -> Node a -> b #

foldr1 :: (a -> a -> a) -> Node a -> a #

foldl1 :: (a -> a -> a) -> Node a -> a #

toList :: Node a -> [a] #

null :: Node a -> Bool #

length :: Node a -> Int #

elem :: Eq a => a -> Node a -> Bool #

maximum :: Ord a => Node a -> a #

minimum :: Ord a => Node a -> a #

sum :: Num a => Node a -> a #

product :: Num a => Node a -> a #

Foldable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => Elem m -> m #

foldMap :: Monoid m => (a -> m) -> Elem a -> m #

foldr :: (a -> b -> b) -> b -> Elem a -> b #

foldr' :: (a -> b -> b) -> b -> Elem a -> b #

foldl :: (b -> a -> b) -> b -> Elem a -> b #

foldl' :: (b -> a -> b) -> b -> Elem a -> b #

foldr1 :: (a -> a -> a) -> Elem a -> a #

foldl1 :: (a -> a -> a) -> Elem a -> a #

toList :: Elem a -> [a] #

null :: Elem a -> Bool #

length :: Elem a -> Int #

elem :: Eq a => a -> Elem a -> Bool #

maximum :: Ord a => Elem a -> a #

minimum :: Ord a => Elem a -> a #

sum :: Num a => Elem a -> a #

product :: Num a => Elem a -> a #

Foldable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewL m -> m #

foldMap :: Monoid m => (a -> m) -> ViewL a -> m #

foldr :: (a -> b -> b) -> b -> ViewL a -> b #

foldr' :: (a -> b -> b) -> b -> ViewL a -> b #

foldl :: (b -> a -> b) -> b -> ViewL a -> b #

foldl' :: (b -> a -> b) -> b -> ViewL a -> b #

foldr1 :: (a -> a -> a) -> ViewL a -> a #

foldl1 :: (a -> a -> a) -> ViewL a -> a #

toList :: ViewL a -> [a] #

null :: ViewL a -> Bool #

length :: ViewL a -> Int #

elem :: Eq a => a -> ViewL a -> Bool #

maximum :: Ord a => ViewL a -> a #

minimum :: Ord a => ViewL a -> a #

sum :: Num a => ViewL a -> a #

product :: Num a => ViewL a -> a #

Foldable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fold :: Monoid m => ViewR m -> m #

foldMap :: Monoid m => (a -> m) -> ViewR a -> m #

foldr :: (a -> b -> b) -> b -> ViewR a -> b #

foldr' :: (a -> b -> b) -> b -> ViewR a -> b #

foldl :: (b -> a -> b) -> b -> ViewR a -> b #

foldl' :: (b -> a -> b) -> b -> ViewR a -> b #

foldr1 :: (a -> a -> a) -> ViewR a -> a #

foldl1 :: (a -> a -> a) -> ViewR a -> a #

toList :: ViewR a -> [a] #

null :: ViewR a -> Bool #

length :: ViewR a -> Int #

elem :: Eq a => a -> ViewR a -> Bool #

maximum :: Ord a => ViewR a -> a #

minimum :: Ord a => ViewR a -> a #

sum :: Num a => ViewR a -> a #

product :: Num a => ViewR a -> a #

Foldable Set 
Instance details

Defined in Data.Set.Internal

Methods

fold :: Monoid m => Set m -> m #

foldMap :: Monoid m => (a -> m) -> Set a -> m #

foldr :: (a -> b -> b) -> b -> Set a -> b #

foldr' :: (a -> b -> b) -> b -> Set a -> b #

foldl :: (b -> a -> b) -> b -> Set a -> b #

foldl' :: (b -> a -> b) -> b -> Set a -> b #

foldr1 :: (a -> a -> a) -> Set a -> a #

foldl1 :: (a -> a -> a) -> Set a -> a #

toList :: Set a -> [a] #

null :: Set a -> Bool #

length :: Set a -> Int #

elem :: Eq a => a -> Set a -> Bool #

maximum :: Ord a => Set a -> a #

minimum :: Ord a => Set a -> a #

sum :: Num a => Set a -> a #

product :: Num a => Set a -> a #

Foldable DList 
Instance details

Defined in Data.DList

Methods

fold :: Monoid m => DList m -> m #

foldMap :: Monoid m => (a -> m) -> DList a -> m #

foldr :: (a -> b -> b) -> b -> DList a -> b #

foldr' :: (a -> b -> b) -> b -> DList a -> b #

foldl :: (b -> a -> b) -> b -> DList a -> b #

foldl' :: (b -> a -> b) -> b -> DList a -> b #

foldr1 :: (a -> a -> a) -> DList a -> a #

foldl1 :: (a -> a -> a) -> DList a -> a #

toList :: DList a -> [a] #

null :: DList a -> Bool #

length :: DList a -> Int #

elem :: Eq a => a -> DList a -> Bool #

maximum :: Ord a => DList a -> a #

minimum :: Ord a => DList a -> a #

sum :: Num a => DList a -> a #

product :: Num a => DList a -> a #

Foldable Hashed 
Instance details

Defined in Data.Hashable.Class

Methods

fold :: Monoid m => Hashed m -> m #

foldMap :: Monoid m => (a -> m) -> Hashed a -> m #

foldr :: (a -> b -> b) -> b -> Hashed a -> b #

foldr' :: (a -> b -> b) -> b -> Hashed a -> b #

foldl :: (b -> a -> b) -> b -> Hashed a -> b #

foldl' :: (b -> a -> b) -> b -> Hashed a -> b #

foldr1 :: (a -> a -> a) -> Hashed a -> a #

foldl1 :: (a -> a -> a) -> Hashed a -> a #

toList :: Hashed a -> [a] #

null :: Hashed a -> Bool #

length :: Hashed a -> Int #

elem :: Eq a => a -> Hashed a -> Bool #

maximum :: Ord a => Hashed a -> a #

minimum :: Ord a => Hashed a -> a #

sum :: Num a => Hashed a -> a #

product :: Num a => Hashed a -> a #

Foldable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fold :: Monoid m => Interval m -> m #

foldMap :: Monoid m => (a -> m) -> Interval a -> m #

foldr :: (a -> b -> b) -> b -> Interval a -> b #

foldr' :: (a -> b -> b) -> b -> Interval a -> b #

foldl :: (b -> a -> b) -> b -> Interval a -> b #

foldl' :: (b -> a -> b) -> b -> Interval a -> b #

foldr1 :: (a -> a -> a) -> Interval a -> a #

foldl1 :: (a -> a -> a) -> Interval a -> a #

toList :: Interval a -> [a] #

null :: Interval a -> Bool #

length :: Interval a -> Int #

elem :: Eq a => a -> Interval a -> Bool #

maximum :: Ord a => Interval a -> a #

minimum :: Ord a => Interval a -> a #

sum :: Num a => Interval a -> a #

product :: Num a => Interval a -> a #

Foldable SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

fold :: Monoid m => SmallArray m -> m #

foldMap :: Monoid m => (a -> m) -> SmallArray a -> m #

foldr :: (a -> b -> b) -> b -> SmallArray a -> b #

foldr' :: (a -> b -> b) -> b -> SmallArray a -> b #

foldl :: (b -> a -> b) -> b -> SmallArray a -> b #

foldl' :: (b -> a -> b) -> b -> SmallArray a -> b #

foldr1 :: (a -> a -> a) -> SmallArray a -> a #

foldl1 :: (a -> a -> a) -> SmallArray a -> a #

toList :: SmallArray a -> [a] #

null :: SmallArray a -> Bool #

length :: SmallArray a -> Int #

elem :: Eq a => a -> SmallArray a -> Bool #

maximum :: Ord a => SmallArray a -> a #

minimum :: Ord a => SmallArray a -> a #

sum :: Num a => SmallArray a -> a #

product :: Num a => SmallArray a -> a #

Foldable Array 
Instance details

Defined in Data.Primitive.Array

Methods

fold :: Monoid m => Array m -> m #

foldMap :: Monoid m => (a -> m) -> Array a -> m #

foldr :: (a -> b -> b) -> b -> Array a -> b #

foldr' :: (a -> b -> b) -> b -> Array a -> b #

foldl :: (b -> a -> b) -> b -> Array a -> b #

foldl' :: (b -> a -> b) -> b -> Array a -> b #

foldr1 :: (a -> a -> a) -> Array a -> a #

foldl1 :: (a -> a -> a) -> Array a -> a #

toList :: Array a -> [a] #

null :: Array a -> Bool #

length :: Array a -> Int #

elem :: Eq a => a -> Array a -> Bool #

maximum :: Ord a => Array a -> a #

minimum :: Ord a => Array a -> a #

sum :: Num a => Array a -> a #

product :: Num a => Array a -> a #

Foldable HashSet 
Instance details

Defined in Data.HashSet.Base

Methods

fold :: Monoid m => HashSet m -> m #

foldMap :: Monoid m => (a -> m) -> HashSet a -> m #

foldr :: (a -> b -> b) -> b -> HashSet a -> b #

foldr' :: (a -> b -> b) -> b -> HashSet a -> b #

foldl :: (b -> a -> b) -> b -> HashSet a -> b #

foldl' :: (b -> a -> b) -> b -> HashSet a -> b #

foldr1 :: (a -> a -> a) -> HashSet a -> a #

foldl1 :: (a -> a -> a) -> HashSet a -> a #

toList :: HashSet a -> [a] #

null :: HashSet a -> Bool #

length :: HashSet a -> Int #

elem :: Eq a => a -> HashSet a -> Bool #

maximum :: Ord a => HashSet a -> a #

minimum :: Ord a => HashSet a -> a #

sum :: Num a => HashSet a -> a #

product :: Num a => HashSet a -> a #

Foldable Vector 
Instance details

Defined in Data.Vector

Methods

fold :: Monoid m => Vector m -> m #

foldMap :: Monoid m => (a -> m) -> Vector a -> m #

foldr :: (a -> b -> b) -> b -> Vector a -> b #

foldr' :: (a -> b -> b) -> b -> Vector a -> b #

foldl :: (b -> a -> b) -> b -> Vector a -> b #

foldl' :: (b -> a -> b) -> b -> Vector a -> b #

foldr1 :: (a -> a -> a) -> Vector a -> a #

foldl1 :: (a -> a -> a) -> Vector a -> a #

toList :: Vector a -> [a] #

null :: Vector a -> Bool #

length :: Vector a -> Int #

elem :: Eq a => a -> Vector a -> Bool #

maximum :: Ord a => Vector a -> a #

minimum :: Ord a => Vector a -> a #

sum :: Num a => Vector a -> a #

product :: Num a => Vector a -> a #

Foldable Root 
Instance details

Defined in Numeric.RootFinding

Methods

fold :: Monoid m => Root m -> m #

foldMap :: Monoid m => (a -> m) -> Root a -> m #

foldr :: (a -> b -> b) -> b -> Root a -> b #

foldr' :: (a -> b -> b) -> b -> Root a -> b #

foldl :: (b -> a -> b) -> b -> Root a -> b #

foldl' :: (b -> a -> b) -> b -> Root a -> b #

foldr1 :: (a -> a -> a) -> Root a -> a #

foldl1 :: (a -> a -> a) -> Root a -> a #

toList :: Root a -> [a] #

null :: Root a -> Bool #

length :: Root a -> Int #

elem :: Eq a => a -> Root a -> Bool #

maximum :: Ord a => Root a -> a #

minimum :: Ord a => Root a -> a #

sum :: Num a => Root a -> a #

product :: Num a => Root a -> a #

Foldable Log 
Instance details

Defined in Numeric.Log

Methods

fold :: Monoid m => Log m -> m #

foldMap :: Monoid m => (a -> m) -> Log a -> m #

foldr :: (a -> b -> b) -> b -> Log a -> b #

foldr' :: (a -> b -> b) -> b -> Log a -> b #

foldl :: (b -> a -> b) -> b -> Log a -> b #

foldl' :: (b -> a -> b) -> b -> Log a -> b #

foldr1 :: (a -> a -> a) -> Log a -> a #

foldl1 :: (a -> a -> a) -> Log a -> a #

toList :: Log a -> [a] #

null :: Log a -> Bool #

length :: Log a -> Int #

elem :: Eq a => a -> Log a -> Bool #

maximum :: Ord a => Log a -> a #

minimum :: Ord a => Log a -> a #

sum :: Num a => Log a -> a #

product :: Num a => Log a -> a #

Foldable V2 
Instance details

Defined in Linear.V2

Methods

fold :: Monoid m => V2 m -> m #

foldMap :: Monoid m => (a -> m) -> V2 a -> m #

foldr :: (a -> b -> b) -> b -> V2 a -> b #

foldr' :: (a -> b -> b) -> b -> V2 a -> b #

foldl :: (b -> a -> b) -> b -> V2 a -> b #

foldl' :: (b -> a -> b) -> b -> V2 a -> b #

foldr1 :: (a -> a -> a) -> V2 a -> a #

foldl1 :: (a -> a -> a) -> V2 a -> a #

toList :: V2 a -> [a] #

null :: V2 a -> Bool #

length :: V2 a -> Int #

elem :: Eq a => a -> V2 a -> Bool #

maximum :: Ord a => V2 a -> a #

minimum :: Ord a => V2 a -> a #

sum :: Num a => V2 a -> a #

product :: Num a => V2 a -> a #

Foldable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fold :: Monoid m => Polar m -> m #

foldMap :: Monoid m => (a -> m) -> Polar a -> m #

foldr :: (a -> b -> b) -> b -> Polar a -> b #

foldr' :: (a -> b -> b) -> b -> Polar a -> b #

foldl :: (b -> a -> b) -> b -> Polar a -> b #

foldl' :: (b -> a -> b) -> b -> Polar a -> b #

foldr1 :: (a -> a -> a) -> Polar a -> a #

foldl1 :: (a -> a -> a) -> Polar a -> a #

toList :: Polar a -> [a] #

null :: Polar a -> Bool #

length :: Polar a -> Int #

elem :: Eq a => a -> Polar a -> Bool #

maximum :: Ord a => Polar a -> a #

minimum :: Ord a => Polar a -> a #

sum :: Num a => Polar a -> a #

product :: Num a => Polar a -> a #

Foldable V3 
Instance details

Defined in Linear.V3

Methods

fold :: Monoid m => V3 m -> m #

foldMap :: Monoid m => (a -> m) -> V3 a -> m #

foldr :: (a -> b -> b) -> b -> V3 a -> b #

foldr' :: (a -> b -> b) -> b -> V3 a -> b #

foldl :: (b -> a -> b) -> b -> V3 a -> b #

foldl' :: (b -> a -> b) -> b -> V3 a -> b #

foldr1 :: (a -> a -> a) -> V3 a -> a #

foldl1 :: (a -> a -> a) -> V3 a -> a #

toList :: V3 a -> [a] #

null :: V3 a -> Bool #

length :: V3 a -> Int #

elem :: Eq a => a -> V3 a -> Bool #

maximum :: Ord a => V3 a -> a #

minimum :: Ord a => V3 a -> a #

sum :: Num a => V3 a -> a #

product :: Num a => V3 a -> a #

Foldable V1 
Instance details

Defined in Linear.V1

Methods

fold :: Monoid m => V1 m -> m #

foldMap :: Monoid m => (a -> m) -> V1 a -> m #

foldr :: (a -> b -> b) -> b -> V1 a -> b #

foldr' :: (a -> b -> b) -> b -> V1 a -> b #

foldl :: (b -> a -> b) -> b -> V1 a -> b #

foldl' :: (b -> a -> b) -> b -> V1 a -> b #

foldr1 :: (a -> a -> a) -> V1 a -> a #

foldl1 :: (a -> a -> a) -> V1 a -> a #

toList :: V1 a -> [a] #

null :: V1 a -> Bool #

length :: V1 a -> Int #

elem :: Eq a => a -> V1 a -> Bool #

maximum :: Ord a => V1 a -> a #

minimum :: Ord a => V1 a -> a #

sum :: Num a => V1 a -> a #

product :: Num a => V1 a -> a #

Foldable Plucker 
Instance details

Defined in Linear.Plucker

Methods

fold :: Monoid m => Plucker m -> m #

foldMap :: Monoid m => (a -> m) -> Plucker a -> m #

foldr :: (a -> b -> b) -> b -> Plucker a -> b #

foldr' :: (a -> b -> b) -> b -> Plucker a -> b #

foldl :: (b -> a -> b) -> b -> Plucker a -> b #

foldl' :: (b -> a -> b) -> b -> Plucker a -> b #

foldr1 :: (a -> a -> a) -> Plucker a -> a #

foldl1 :: (a -> a -> a) -> Plucker a -> a #

toList :: Plucker a -> [a] #

null :: Plucker a -> Bool #

length :: Plucker a -> Int #

elem :: Eq a => a -> Plucker a -> Bool #

maximum :: Ord a => Plucker a -> a #

minimum :: Ord a => Plucker a -> a #

sum :: Num a => Plucker a -> a #

product :: Num a => Plucker a -> a #

Foldable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fold :: Monoid m => Quaternion m -> m #

foldMap :: Monoid m => (a -> m) -> Quaternion a -> m #

foldr :: (a -> b -> b) -> b -> Quaternion a -> b #

foldr' :: (a -> b -> b) -> b -> Quaternion a -> b #

foldl :: (b -> a -> b) -> b -> Quaternion a -> b #

foldl' :: (b -> a -> b) -> b -> Quaternion a -> b #

foldr1 :: (a -> a -> a) -> Quaternion a -> a #

foldl1 :: (a -> a -> a) -> Quaternion a -> a #

toList :: Quaternion a -> [a] #

null :: Quaternion a -> Bool #

length :: Quaternion a -> Int #

elem :: Eq a => a -> Quaternion a -> Bool #

maximum :: Ord a => Quaternion a -> a #

minimum :: Ord a => Quaternion a -> a #

sum :: Num a => Quaternion a -> a #

product :: Num a => Quaternion a -> a #

Foldable V0 
Instance details

Defined in Linear.V0

Methods

fold :: Monoid m => V0 m -> m #

foldMap :: Monoid m => (a -> m) -> V0 a -> m #

foldr :: (a -> b -> b) -> b -> V0 a -> b #

foldr' :: (a -> b -> b) -> b -> V0 a -> b #

foldl :: (b -> a -> b) -> b -> V0 a -> b #

foldl' :: (b -> a -> b) -> b -> V0 a -> b #

foldr1 :: (a -> a -> a) -> V0 a -> a #

foldl1 :: (a -> a -> a) -> V0 a -> a #

toList :: V0 a -> [a] #

null :: V0 a -> Bool #

length :: V0 a -> Int #

elem :: Eq a => a -> V0 a -> Bool #

maximum :: Ord a => V0 a -> a #

minimum :: Ord a => V0 a -> a #

sum :: Num a => V0 a -> a #

product :: Num a => V0 a -> a #

Foldable V4 
Instance details

Defined in Linear.V4

Methods

fold :: Monoid m => V4 m -> m #

foldMap :: Monoid m => (a -> m) -> V4 a -> m #

foldr :: (a -> b -> b) -> b -> V4 a -> b #

foldr' :: (a -> b -> b) -> b -> V4 a -> b #

foldl :: (b -> a -> b) -> b -> V4 a -> b #

foldl' :: (b -> a -> b) -> b -> V4 a -> b #

foldr1 :: (a -> a -> a) -> V4 a -> a #

foldl1 :: (a -> a -> a) -> V4 a -> a #

toList :: V4 a -> [a] #

null :: V4 a -> Bool #

length :: V4 a -> Int #

elem :: Eq a => a -> V4 a -> Bool #

maximum :: Ord a => V4 a -> a #

minimum :: Ord a => V4 a -> a #

sum :: Num a => V4 a -> a #

product :: Num a => V4 a -> a #

Foldable Digit 
Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => Digit m -> m #

foldMap :: Monoid m => (a -> m) -> Digit a -> m #

foldr :: (a -> b -> b) -> b -> Digit a -> b #

foldr' :: (a -> b -> b) -> b -> Digit a -> b #

foldl :: (b -> a -> b) -> b -> Digit a -> b #

foldl' :: (b -> a -> b) -> b -> Digit a -> b #

foldr1 :: (a -> a -> a) -> Digit a -> a #

foldl1 :: (a -> a -> a) -> Digit a -> a #

toList :: Digit a -> [a] #

null :: Digit a -> Bool #

length :: Digit a -> Int #

elem :: Eq a => a -> Digit a -> Bool #

maximum :: Ord a => Digit a -> a #

minimum :: Ord a => Digit a -> a #

sum :: Num a => Digit a -> a #

product :: Num a => Digit a -> a #

Foldable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Either a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

toList :: Either a a0 -> [a0] #

null :: Either a a0 -> Bool #

length :: Either a a0 -> Int #

elem :: Eq a0 => a0 -> Either a a0 -> Bool #

maximum :: Ord a0 => Either a a0 -> a0 #

minimum :: Ord a0 => Either a a0 -> a0 #

sum :: Num a0 => Either a a0 -> a0 #

product :: Num a0 => Either a a0 -> a0 #

Foldable (V1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => V1 m -> m #

foldMap :: Monoid m => (a -> m) -> V1 a -> m #

foldr :: (a -> b -> b) -> b -> V1 a -> b #

foldr' :: (a -> b -> b) -> b -> V1 a -> b #

foldl :: (b -> a -> b) -> b -> V1 a -> b #

foldl' :: (b -> a -> b) -> b -> V1 a -> b #

foldr1 :: (a -> a -> a) -> V1 a -> a #

foldl1 :: (a -> a -> a) -> V1 a -> a #

toList :: V1 a -> [a] #

null :: V1 a -> Bool #

length :: V1 a -> Int #

elem :: Eq a => a -> V1 a -> Bool #

maximum :: Ord a => V1 a -> a #

minimum :: Ord a => V1 a -> a #

sum :: Num a => V1 a -> a #

product :: Num a => V1 a -> a #

Foldable (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => U1 m -> m #

foldMap :: Monoid m => (a -> m) -> U1 a -> m #

foldr :: (a -> b -> b) -> b -> U1 a -> b #

foldr' :: (a -> b -> b) -> b -> U1 a -> b #

foldl :: (b -> a -> b) -> b -> U1 a -> b #

foldl' :: (b -> a -> b) -> b -> U1 a -> b #

foldr1 :: (a -> a -> a) -> U1 a -> a #

foldl1 :: (a -> a -> a) -> U1 a -> a #

toList :: U1 a -> [a] #

null :: U1 a -> Bool #

length :: U1 a -> Int #

elem :: Eq a => a -> U1 a -> Bool #

maximum :: Ord a => U1 a -> a #

minimum :: Ord a => U1 a -> a #

sum :: Num a => U1 a -> a #

product :: Num a => U1 a -> a #

Foldable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (a, m) -> m #

foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m #

foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b #

foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b #

foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b #

foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b #

foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 #

toList :: (a, a0) -> [a0] #

null :: (a, a0) -> Bool #

length :: (a, a0) -> Int #

elem :: Eq a0 => a0 -> (a, a0) -> Bool #

maximum :: Ord a0 => (a, a0) -> a0 #

minimum :: Ord a0 => (a, a0) -> a0 #

sum :: Num a0 => (a, a0) -> a0 #

product :: Num a0 => (a, a0) -> a0 #

Foldable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fold :: Monoid m => HashMap k m -> m #

foldMap :: Monoid m => (a -> m) -> HashMap k a -> m #

foldr :: (a -> b -> b) -> b -> HashMap k a -> b #

foldr' :: (a -> b -> b) -> b -> HashMap k a -> b #

foldl :: (b -> a -> b) -> b -> HashMap k a -> b #

foldl' :: (b -> a -> b) -> b -> HashMap k a -> b #

foldr1 :: (a -> a -> a) -> HashMap k a -> a #

foldl1 :: (a -> a -> a) -> HashMap k a -> a #

toList :: HashMap k a -> [a] #

null :: HashMap k a -> Bool #

length :: HashMap k a -> Int #

elem :: Eq a => a -> HashMap k a -> Bool #

maximum :: Ord a => HashMap k a -> a #

minimum :: Ord a => HashMap k a -> a #

sum :: Num a => HashMap k a -> a #

product :: Num a => HashMap k a -> a #

Foldable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fold :: Monoid m => Map k m -> m #

foldMap :: Monoid m => (a -> m) -> Map k a -> m #

foldr :: (a -> b -> b) -> b -> Map k a -> b #

foldr' :: (a -> b -> b) -> b -> Map k a -> b #

foldl :: (b -> a -> b) -> b -> Map k a -> b #

foldl' :: (b -> a -> b) -> b -> Map k a -> b #

foldr1 :: (a -> a -> a) -> Map k a -> a #

foldl1 :: (a -> a -> a) -> Map k a -> a #

toList :: Map k a -> [a] #

null :: Map k a -> Bool #

length :: Map k a -> Int #

elem :: Eq a => a -> Map k a -> Bool #

maximum :: Ord a => Map k a -> a #

minimum :: Ord a => Map k a -> a #

sum :: Num a => Map k a -> a #

product :: Num a => Map k a -> a #

Foldable (Array i)

Since: base-4.8.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Array i m -> m #

foldMap :: Monoid m => (a -> m) -> Array i a -> m #

foldr :: (a -> b -> b) -> b -> Array i a -> b #

foldr' :: (a -> b -> b) -> b -> Array i a -> b #

foldl :: (b -> a -> b) -> b -> Array i a -> b #

foldl' :: (b -> a -> b) -> b -> Array i a -> b #

foldr1 :: (a -> a -> a) -> Array i a -> a #

foldl1 :: (a -> a -> a) -> Array i a -> a #

toList :: Array i a -> [a] #

null :: Array i a -> Bool #

length :: Array i a -> Int #

elem :: Eq a => a -> Array i a -> Bool #

maximum :: Ord a => Array i a -> a #

minimum :: Ord a => Array i a -> a #

sum :: Num a => Array i a -> a #

product :: Num a => Array i a -> a #

Foldable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fold :: Monoid m => Arg a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 #

toList :: Arg a a0 -> [a0] #

null :: Arg a a0 -> Bool #

length :: Arg a a0 -> Int #

elem :: Eq a0 => a0 -> Arg a a0 -> Bool #

maximum :: Ord a0 => Arg a a0 -> a0 #

minimum :: Ord a0 => Arg a a0 -> a0 #

sum :: Num a0 => Arg a a0 -> a0 #

product :: Num a0 => Arg a a0 -> a0 #

Foldable (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Proxy m -> m #

foldMap :: Monoid m => (a -> m) -> Proxy a -> m #

foldr :: (a -> b -> b) -> b -> Proxy a -> b #

foldr' :: (a -> b -> b) -> b -> Proxy a -> b #

foldl :: (b -> a -> b) -> b -> Proxy a -> b #

foldl' :: (b -> a -> b) -> b -> Proxy a -> b #

foldr1 :: (a -> a -> a) -> Proxy a -> a #

foldl1 :: (a -> a -> a) -> Proxy a -> a #

toList :: Proxy a -> [a] #

null :: Proxy a -> Bool #

length :: Proxy a -> Int #

elem :: Eq a => a -> Proxy a -> Bool #

maximum :: Ord a => Proxy a -> a #

minimum :: Ord a => Proxy a -> a #

sum :: Num a => Proxy a -> a #

product :: Num a => Proxy a -> a #

Foldable f => Foldable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fold :: Monoid m => MaybeT f m -> m #

foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m #

foldr :: (a -> b -> b) -> b -> MaybeT f a -> b #

foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b #

foldl :: (b -> a -> b) -> b -> MaybeT f a -> b #

foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b #

foldr1 :: (a -> a -> a) -> MaybeT f a -> a #

foldl1 :: (a -> a -> a) -> MaybeT f a -> a #

toList :: MaybeT f a -> [a] #

null :: MaybeT f a -> Bool #

length :: MaybeT f a -> Int #

elem :: Eq a => a -> MaybeT f a -> Bool #

maximum :: Ord a => MaybeT f a -> a #

minimum :: Ord a => MaybeT f a -> a #

sum :: Num a => MaybeT f a -> a #

product :: Num a => MaybeT f a -> a #

Foldable (FingerTree v)

Elements from left to right.

Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => FingerTree v m -> m #

foldMap :: Monoid m => (a -> m) -> FingerTree v a -> m #

foldr :: (a -> b -> b) -> b -> FingerTree v a -> b #

foldr' :: (a -> b -> b) -> b -> FingerTree v a -> b #

foldl :: (b -> a -> b) -> b -> FingerTree v a -> b #

foldl' :: (b -> a -> b) -> b -> FingerTree v a -> b #

foldr1 :: (a -> a -> a) -> FingerTree v a -> a #

foldl1 :: (a -> a -> a) -> FingerTree v a -> a #

toList :: FingerTree v a -> [a] #

null :: FingerTree v a -> Bool #

length :: FingerTree v a -> Int #

elem :: Eq a => a -> FingerTree v a -> Bool #

maximum :: Ord a => FingerTree v a -> a #

minimum :: Ord a => FingerTree v a -> a #

sum :: Num a => FingerTree v a -> a #

product :: Num a => FingerTree v a -> a #

(Generic1 f, Foldable (Rep1 f)) => Foldable (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

fold :: Monoid m => Generically1 f m -> m #

foldMap :: Monoid m => (a -> m) -> Generically1 f a -> m #

foldr :: (a -> b -> b) -> b -> Generically1 f a -> b #

foldr' :: (a -> b -> b) -> b -> Generically1 f a -> b #

foldl :: (b -> a -> b) -> b -> Generically1 f a -> b #

foldl' :: (b -> a -> b) -> b -> Generically1 f a -> b #

foldr1 :: (a -> a -> a) -> Generically1 f a -> a #

foldl1 :: (a -> a -> a) -> Generically1 f a -> a #

toList :: Generically1 f a -> [a] #

null :: Generically1 f a -> Bool #

length :: Generically1 f a -> Int #

elem :: Eq a => a -> Generically1 f a -> Bool #

maximum :: Ord a => Generically1 f a -> a #

minimum :: Ord a => Generically1 f a -> a #

sum :: Num a => Generically1 f a -> a #

product :: Num a => Generically1 f a -> a #

Foldable f => Foldable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fold :: Monoid m => ListT f m -> m #

foldMap :: Monoid m => (a -> m) -> ListT f a -> m #

foldr :: (a -> b -> b) -> b -> ListT f a -> b #

foldr' :: (a -> b -> b) -> b -> ListT f a -> b #

foldl :: (b -> a -> b) -> b -> ListT f a -> b #

foldl' :: (b -> a -> b) -> b -> ListT f a -> b #

foldr1 :: (a -> a -> a) -> ListT f a -> a #

foldl1 :: (a -> a -> a) -> ListT f a -> a #

toList :: ListT f a -> [a] #

null :: ListT f a -> Bool #

length :: ListT f a -> Int #

elem :: Eq a => a -> ListT f a -> Bool #

maximum :: Ord a => ListT f a -> a #

minimum :: Ord a => ListT f a -> a #

sum :: Num a => ListT f a -> a #

product :: Num a => ListT f a -> a #

Foldable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fold :: Monoid m => Categorical p m -> m #

foldMap :: Monoid m => (a -> m) -> Categorical p a -> m #

foldr :: (a -> b -> b) -> b -> Categorical p a -> b #

foldr' :: (a -> b -> b) -> b -> Categorical p a -> b #

foldl :: (b -> a -> b) -> b -> Categorical p a -> b #

foldl' :: (b -> a -> b) -> b -> Categorical p a -> b #

foldr1 :: (a -> a -> a) -> Categorical p a -> a #

foldl1 :: (a -> a -> a) -> Categorical p a -> a #

toList :: Categorical p a -> [a] #

null :: Categorical p a -> Bool #

length :: Categorical p a -> Int #

elem :: Eq a => a -> Categorical p a -> Bool #

maximum :: Ord a => Categorical p a -> a #

minimum :: Ord a => Categorical p a -> a #

sum :: Num a => Categorical p a -> a #

product :: Num a => Categorical p a -> a #

Foldable (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

fold :: Monoid m => ListF a m -> m #

foldMap :: Monoid m => (a0 -> m) -> ListF a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> ListF a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> ListF a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> ListF a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> ListF a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 #

toList :: ListF a a0 -> [a0] #

null :: ListF a a0 -> Bool #

length :: ListF a a0 -> Int #

elem :: Eq a0 => a0 -> ListF a a0 -> Bool #

maximum :: Ord a0 => ListF a a0 -> a0 #

minimum :: Ord a0 => ListF a a0 -> a0 #

sum :: Num a0 => ListF a a0 -> a0 #

product :: Num a0 => ListF a a0 -> a0 #

Foldable f => Foldable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fold :: Monoid m => Cofree f m -> m #

foldMap :: Monoid m => (a -> m) -> Cofree f a -> m #

foldr :: (a -> b -> b) -> b -> Cofree f a -> b #

foldr' :: (a -> b -> b) -> b -> Cofree f a -> b #

foldl :: (b -> a -> b) -> b -> Cofree f a -> b #

foldl' :: (b -> a -> b) -> b -> Cofree f a -> b #

foldr1 :: (a -> a -> a) -> Cofree f a -> a #

foldl1 :: (a -> a -> a) -> Cofree f a -> a #

toList :: Cofree f a -> [a] #

null :: Cofree f a -> Bool #

length :: Cofree f a -> Int #

elem :: Eq a => a -> Cofree f a -> Bool #

maximum :: Ord a => Cofree f a -> a #

minimum :: Ord a => Cofree f a -> a #

sum :: Num a => Cofree f a -> a #

product :: Num a => Cofree f a -> a #

Foldable f => Foldable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fold :: Monoid m => Free f m -> m #

foldMap :: Monoid m => (a -> m) -> Free f a -> m #

foldr :: (a -> b -> b) -> b -> Free f a -> b #

foldr' :: (a -> b -> b) -> b -> Free f a -> b #

foldl :: (b -> a -> b) -> b -> Free f a -> b #

foldl' :: (b -> a -> b) -> b -> Free f a -> b #

foldr1 :: (a -> a -> a) -> Free f a -> a #

foldl1 :: (a -> a -> a) -> Free f a -> a #

toList :: Free f a -> [a] #

null :: Free f a -> Bool #

length :: Free f a -> Int #

elem :: Eq a => a -> Free f a -> Bool #

maximum :: Ord a => Free f a -> a #

minimum :: Ord a => Free f a -> a #

sum :: Num a => Free f a -> a #

product :: Num a => Free f a -> a #

Foldable (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

fold :: Monoid m => NonEmptyF a m -> m #

foldMap :: Monoid m => (a0 -> m) -> NonEmptyF a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 #

toList :: NonEmptyF a a0 -> [a0] #

null :: NonEmptyF a a0 -> Bool #

length :: NonEmptyF a a0 -> Int #

elem :: Eq a0 => a0 -> NonEmptyF a a0 -> Bool #

maximum :: Ord a0 => NonEmptyF a a0 -> a0 #

minimum :: Ord a0 => NonEmptyF a a0 -> a0 #

sum :: Num a0 => NonEmptyF a a0 -> a0 #

product :: Num a0 => NonEmptyF a a0 -> a0 #

Foldable f => Foldable (Point f) 
Instance details

Defined in Linear.Affine

Methods

fold :: Monoid m => Point f m -> m #

foldMap :: Monoid m => (a -> m) -> Point f a -> m #

foldr :: (a -> b -> b) -> b -> Point f a -> b #

foldr' :: (a -> b -> b) -> b -> Point f a -> b #

foldl :: (b -> a -> b) -> b -> Point f a -> b #

foldl' :: (b -> a -> b) -> b -> Point f a -> b #

foldr1 :: (a -> a -> a) -> Point f a -> a #

foldl1 :: (a -> a -> a) -> Point f a -> a #

toList :: Point f a -> [a] #

null :: Point f a -> Bool #

length :: Point f a -> Int #

elem :: Eq a => a -> Point f a -> Bool #

maximum :: Ord a => Point f a -> a #

minimum :: Ord a => Point f a -> a #

sum :: Num a => Point f a -> a #

product :: Num a => Point f a -> a #

Foldable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fold :: Monoid m => Level i m -> m #

foldMap :: Monoid m => (a -> m) -> Level i a -> m #

foldr :: (a -> b -> b) -> b -> Level i a -> b #

foldr' :: (a -> b -> b) -> b -> Level i a -> b #

foldl :: (b -> a -> b) -> b -> Level i a -> b #

foldl' :: (b -> a -> b) -> b -> Level i a -> b #

foldr1 :: (a -> a -> a) -> Level i a -> a #

foldl1 :: (a -> a -> a) -> Level i a -> a #

toList :: Level i a -> [a] #

null :: Level i a -> Bool #

length :: Level i a -> Int #

elem :: Eq a => a -> Level i a -> Bool #

maximum :: Ord a => Level i a -> a #

minimum :: Ord a => Level i a -> a #

sum :: Num a => Level i a -> a #

product :: Num a => Level i a -> a #

Foldable (Node v) 
Instance details

Defined in Data.FingerTree

Methods

fold :: Monoid m => Node v m -> m #

foldMap :: Monoid m => (a -> m) -> Node v a -> m #

foldr :: (a -> b -> b) -> b -> Node v a -> b #

foldr' :: (a -> b -> b) -> b -> Node v a -> b #

foldl :: (b -> a -> b) -> b -> Node v a -> b #

foldl' :: (b -> a -> b) -> b -> Node v a -> b #

foldr1 :: (a -> a -> a) -> Node v a -> a #

foldl1 :: (a -> a -> a) -> Node v a -> a #

toList :: Node v a -> [a] #

null :: Node v a -> Bool #

length :: Node v a -> Int #

elem :: Eq a => a -> Node v a -> Bool #

maximum :: Ord a => Node v a -> a #

minimum :: Ord a => Node v a -> a #

sum :: Num a => Node v a -> a #

product :: Num a => Node v a -> a #

Foldable f => Foldable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fold :: Monoid m => Yoneda f m -> m #

foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m #

foldr :: (a -> b -> b) -> b -> Yoneda f a -> b #

foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b #

foldl :: (b -> a -> b) -> b -> Yoneda f a -> b #

foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b #

foldr1 :: (a -> a -> a) -> Yoneda f a -> a #

foldl1 :: (a -> a -> a) -> Yoneda f a -> a #

toList :: Yoneda f a -> [a] #

null :: Yoneda f a -> Bool #

length :: Yoneda f a -> Int #

elem :: Eq a => a -> Yoneda f a -> Bool #

maximum :: Ord a => Yoneda f a -> a #

minimum :: Ord a => Yoneda f a -> a #

sum :: Num a => Yoneda f a -> a #

product :: Num a => Yoneda f a -> a #

Foldable f => Foldable (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Rec1 f m -> m #

foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m #

foldr :: (a -> b -> b) -> b -> Rec1 f a -> b #

foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b #

foldl :: (b -> a -> b) -> b -> Rec1 f a -> b #

foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b #

foldr1 :: (a -> a -> a) -> Rec1 f a -> a #

foldl1 :: (a -> a -> a) -> Rec1 f a -> a #

toList :: Rec1 f a -> [a] #

null :: Rec1 f a -> Bool #

length :: Rec1 f a -> Int #

elem :: Eq a => a -> Rec1 f a -> Bool #

maximum :: Ord a => Rec1 f a -> a #

minimum :: Ord a => Rec1 f a -> a #

sum :: Num a => Rec1 f a -> a #

product :: Num a => Rec1 f a -> a #

Foldable (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Char m -> m #

foldMap :: Monoid m => (a -> m) -> URec Char a -> m #

foldr :: (a -> b -> b) -> b -> URec Char a -> b #

foldr' :: (a -> b -> b) -> b -> URec Char a -> b #

foldl :: (b -> a -> b) -> b -> URec Char a -> b #

foldl' :: (b -> a -> b) -> b -> URec Char a -> b #

foldr1 :: (a -> a -> a) -> URec Char a -> a #

foldl1 :: (a -> a -> a) -> URec Char a -> a #

toList :: URec Char a -> [a] #

null :: URec Char a -> Bool #

length :: URec Char a -> Int #

elem :: Eq a => a -> URec Char a -> Bool #

maximum :: Ord a => URec Char a -> a #

minimum :: Ord a => URec Char a -> a #

sum :: Num a => URec Char a -> a #

product :: Num a => URec Char a -> a #

Foldable (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Double m -> m #

foldMap :: Monoid m => (a -> m) -> URec Double a -> m #

foldr :: (a -> b -> b) -> b -> URec Double a -> b #

foldr' :: (a -> b -> b) -> b -> URec Double a -> b #

foldl :: (b -> a -> b) -> b -> URec Double a -> b #

foldl' :: (b -> a -> b) -> b -> URec Double a -> b #

foldr1 :: (a -> a -> a) -> URec Double a -> a #

foldl1 :: (a -> a -> a) -> URec Double a -> a #

toList :: URec Double a -> [a] #

null :: URec Double a -> Bool #

length :: URec Double a -> Int #

elem :: Eq a => a -> URec Double a -> Bool #

maximum :: Ord a => URec Double a -> a #

minimum :: Ord a => URec Double a -> a #

sum :: Num a => URec Double a -> a #

product :: Num a => URec Double a -> a #

Foldable (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Float m -> m #

foldMap :: Monoid m => (a -> m) -> URec Float a -> m #

foldr :: (a -> b -> b) -> b -> URec Float a -> b #

foldr' :: (a -> b -> b) -> b -> URec Float a -> b #

foldl :: (b -> a -> b) -> b -> URec Float a -> b #

foldl' :: (b -> a -> b) -> b -> URec Float a -> b #

foldr1 :: (a -> a -> a) -> URec Float a -> a #

foldl1 :: (a -> a -> a) -> URec Float a -> a #

toList :: URec Float a -> [a] #

null :: URec Float a -> Bool #

length :: URec Float a -> Int #

elem :: Eq a => a -> URec Float a -> Bool #

maximum :: Ord a => URec Float a -> a #

minimum :: Ord a => URec Float a -> a #

sum :: Num a => URec Float a -> a #

product :: Num a => URec Float a -> a #

Foldable (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Int m -> m #

foldMap :: Monoid m => (a -> m) -> URec Int a -> m #

foldr :: (a -> b -> b) -> b -> URec Int a -> b #

foldr' :: (a -> b -> b) -> b -> URec Int a -> b #

foldl :: (b -> a -> b) -> b -> URec Int a -> b #

foldl' :: (b -> a -> b) -> b -> URec Int a -> b #

foldr1 :: (a -> a -> a) -> URec Int a -> a #

foldl1 :: (a -> a -> a) -> URec Int a -> a #

toList :: URec Int a -> [a] #

null :: URec Int a -> Bool #

length :: URec Int a -> Int #

elem :: Eq a => a -> URec Int a -> Bool #

maximum :: Ord a => URec Int a -> a #

minimum :: Ord a => URec Int a -> a #

sum :: Num a => URec Int a -> a #

product :: Num a => URec Int a -> a #

Foldable (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Word m -> m #

foldMap :: Monoid m => (a -> m) -> URec Word a -> m #

foldr :: (a -> b -> b) -> b -> URec Word a -> b #

foldr' :: (a -> b -> b) -> b -> URec Word a -> b #

foldl :: (b -> a -> b) -> b -> URec Word a -> b #

foldl' :: (b -> a -> b) -> b -> URec Word a -> b #

foldr1 :: (a -> a -> a) -> URec Word a -> a #

foldl1 :: (a -> a -> a) -> URec Word a -> a #

toList :: URec Word a -> [a] #

null :: URec Word a -> Bool #

length :: URec Word a -> Int #

elem :: Eq a => a -> URec Word a -> Bool #

maximum :: Ord a => URec Word a -> a #

minimum :: Ord a => URec Word a -> a #

sum :: Num a => URec Word a -> a #

product :: Num a => URec Word a -> a #

Foldable (URec (Ptr ()) :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec (Ptr ()) m -> m #

foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m #

foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b #

foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b #

foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b #

foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b #

foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a #

foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a #

toList :: URec (Ptr ()) a -> [a] #

null :: URec (Ptr ()) a -> Bool #

length :: URec (Ptr ()) a -> Int #

elem :: Eq a => a -> URec (Ptr ()) a -> Bool #

maximum :: Ord a => URec (Ptr ()) a -> a #

minimum :: Ord a => URec (Ptr ()) a -> a #

sum :: Num a => URec (Ptr ()) a -> a #

product :: Num a => URec (Ptr ()) a -> a #

Foldable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Functor.Const

Methods

fold :: Monoid m0 => Const m m0 -> m0 #

foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 #

foldr :: (a -> b -> b) -> b -> Const m a -> b #

foldr' :: (a -> b -> b) -> b -> Const m a -> b #

foldl :: (b -> a -> b) -> b -> Const m a -> b #

foldl' :: (b -> a -> b) -> b -> Const m a -> b #

foldr1 :: (a -> a -> a) -> Const m a -> a #

foldl1 :: (a -> a -> a) -> Const m a -> a #

toList :: Const m a -> [a] #

null :: Const m a -> Bool #

length :: Const m a -> Int #

elem :: Eq a => a -> Const m a -> Bool #

maximum :: Ord a => Const m a -> a #

minimum :: Ord a => Const m a -> a #

sum :: Num a => Const m a -> a #

product :: Num a => Const m a -> a #

Foldable f => Foldable (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Ap f m -> m #

foldMap :: Monoid m => (a -> m) -> Ap f a -> m #

foldr :: (a -> b -> b) -> b -> Ap f a -> b #

foldr' :: (a -> b -> b) -> b -> Ap f a -> b #

foldl :: (b -> a -> b) -> b -> Ap f a -> b #

foldl' :: (b -> a -> b) -> b -> Ap f a -> b #

foldr1 :: (a -> a -> a) -> Ap f a -> a #

foldl1 :: (a -> a -> a) -> Ap f a -> a #

toList :: Ap f a -> [a] #

null :: Ap f a -> Bool #

length :: Ap f a -> Int #

elem :: Eq a => a -> Ap f a -> Bool #

maximum :: Ord a => Ap f a -> a #

minimum :: Ord a => Ap f a -> a #

sum :: Num a => Ap f a -> a #

product :: Num a => Ap f a -> a #

Foldable f => Foldable (Alt f)

Since: base-4.12.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Alt f m -> m #

foldMap :: Monoid m => (a -> m) -> Alt f a -> m #

foldr :: (a -> b -> b) -> b -> Alt f a -> b #

foldr' :: (a -> b -> b) -> b -> Alt f a -> b #

foldl :: (b -> a -> b) -> b -> Alt f a -> b #

foldl' :: (b -> a -> b) -> b -> Alt f a -> b #

foldr1 :: (a -> a -> a) -> Alt f a -> a #

foldl1 :: (a -> a -> a) -> Alt f a -> a #

toList :: Alt f a -> [a] #

null :: Alt f a -> Bool #

length :: Alt f a -> Int #

elem :: Eq a => a -> Alt f a -> Bool #

maximum :: Ord a => Alt f a -> a #

minimum :: Ord a => Alt f a -> a #

sum :: Num a => Alt f a -> a #

product :: Num a => Alt f a -> a #

Bifoldable p => Foldable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fold :: Monoid m => Join p m -> m #

foldMap :: Monoid m => (a -> m) -> Join p a -> m #

foldr :: (a -> b -> b) -> b -> Join p a -> b #

foldr' :: (a -> b -> b) -> b -> Join p a -> b #

foldl :: (b -> a -> b) -> b -> Join p a -> b #

foldl' :: (b -> a -> b) -> b -> Join p a -> b #

foldr1 :: (a -> a -> a) -> Join p a -> a #

foldl1 :: (a -> a -> a) -> Join p a -> a #

toList :: Join p a -> [a] #

null :: Join p a -> Bool #

length :: Join p a -> Int #

elem :: Eq a => a -> Join p a -> Bool #

maximum :: Ord a => Join p a -> a #

minimum :: Ord a => Join p a -> a #

sum :: Num a => Join p a -> a #

product :: Num a => Join p a -> a #

Bifoldable p => Foldable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fold :: Monoid m => Fix p m -> m #

foldMap :: Monoid m => (a -> m) -> Fix p a -> m #

foldr :: (a -> b -> b) -> b -> Fix p a -> b #

foldr' :: (a -> b -> b) -> b -> Fix p a -> b #

foldl :: (b -> a -> b) -> b -> Fix p a -> b #

foldl' :: (b -> a -> b) -> b -> Fix p a -> b #

foldr1 :: (a -> a -> a) -> Fix p a -> a #

foldl1 :: (a -> a -> a) -> Fix p a -> a #

toList :: Fix p a -> [a] #

null :: Fix p a -> Bool #

length :: Fix p a -> Int #

elem :: Eq a => a -> Fix p a -> Bool #

maximum :: Ord a => Fix p a -> a #

minimum :: Ord a => Fix p a -> a #

sum :: Num a => Fix p a -> a #

product :: Num a => Fix p a -> a #

Foldable f => Foldable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fold :: Monoid m => IdentityT f m -> m #

foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m #

foldr :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldl :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldr1 :: (a -> a -> a) -> IdentityT f a -> a #

foldl1 :: (a -> a -> a) -> IdentityT f a -> a #

toList :: IdentityT f a -> [a] #

null :: IdentityT f a -> Bool #

length :: IdentityT f a -> Int #

elem :: Eq a => a -> IdentityT f a -> Bool #

maximum :: Ord a => IdentityT f a -> a #

minimum :: Ord a => IdentityT f a -> a #

sum :: Num a => IdentityT f a -> a #

product :: Num a => IdentityT f a -> a #

Foldable f => Foldable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fold :: Monoid m => ExceptT e f m -> m #

foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m #

foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b #

foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b #

foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b #

foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b #

foldr1 :: (a -> a -> a) -> ExceptT e f a -> a #

foldl1 :: (a -> a -> a) -> ExceptT e f a -> a #

toList :: ExceptT e f a -> [a] #

null :: ExceptT e f a -> Bool #

length :: ExceptT e f a -> Int #

elem :: Eq a => a -> ExceptT e f a -> Bool #

maximum :: Ord a => ExceptT e f a -> a #

minimum :: Ord a => ExceptT e f a -> a #

sum :: Num a => ExceptT e f a -> a #

product :: Num a => ExceptT e f a -> a #

Foldable f => Foldable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fold :: Monoid m => WriterT w f m -> m #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a #

toList :: WriterT w f a -> [a] #

null :: WriterT w f a -> Bool #

length :: WriterT w f a -> Int #

elem :: Eq a => a -> WriterT w f a -> Bool #

maximum :: Ord a => WriterT w f a -> a #

minimum :: Ord a => WriterT w f a -> a #

sum :: Num a => WriterT w f a -> a #

product :: Num a => WriterT w f a -> a #

Foldable f => Foldable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fold :: Monoid m => ErrorT e f m -> m #

foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m #

foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b #

foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b #

foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b #

foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b #

foldr1 :: (a -> a -> a) -> ErrorT e f a -> a #

foldl1 :: (a -> a -> a) -> ErrorT e f a -> a #

toList :: ErrorT e f a -> [a] #

null :: ErrorT e f a -> Bool #

length :: ErrorT e f a -> Int #

elem :: Eq a => a -> ErrorT e f a -> Bool #

maximum :: Ord a => ErrorT e f a -> a #

minimum :: Ord a => ErrorT e f a -> a #

sum :: Num a => ErrorT e f a -> a #

product :: Num a => ErrorT e f a -> a #

Foldable f => Foldable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fold :: Monoid m => WriterT w f m -> m #

foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m #

foldr :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b #

foldl :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b #

foldr1 :: (a -> a -> a) -> WriterT w f a -> a #

foldl1 :: (a -> a -> a) -> WriterT w f a -> a #

toList :: WriterT w f a -> [a] #

null :: WriterT w f a -> Bool #

length :: WriterT w f a -> Int #

elem :: Eq a => a -> WriterT w f a -> Bool #

maximum :: Ord a => WriterT w f a -> a #

minimum :: Ord a => WriterT w f a -> a #

sum :: Num a => WriterT w f a -> a #

product :: Num a => WriterT w f a -> a #

Foldable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fold :: Monoid m => Forget r a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Forget r a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Forget r a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Forget r a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Forget r a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Forget r a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Forget r a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Forget r a a0 -> a0 #

toList :: Forget r a a0 -> [a0] #

null :: Forget r a a0 -> Bool #

length :: Forget r a a0 -> Int #

elem :: Eq a0 => a0 -> Forget r a a0 -> Bool #

maximum :: Ord a0 => Forget r a a0 -> a0 #

minimum :: Ord a0 => Forget r a a0 -> a0 #

sum :: Num a0 => Forget r a a0 -> a0 #

product :: Num a0 => Forget r a a0 -> a0 #

Foldable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fold :: Monoid m => Tagged s m -> m #

foldMap :: Monoid m => (a -> m) -> Tagged s a -> m #

foldr :: (a -> b -> b) -> b -> Tagged s a -> b #

foldr' :: (a -> b -> b) -> b -> Tagged s a -> b #

foldl :: (b -> a -> b) -> b -> Tagged s a -> b #

foldl' :: (b -> a -> b) -> b -> Tagged s a -> b #

foldr1 :: (a -> a -> a) -> Tagged s a -> a #

foldl1 :: (a -> a -> a) -> Tagged s a -> a #

toList :: Tagged s a -> [a] #

null :: Tagged s a -> Bool #

length :: Tagged s a -> Int #

elem :: Eq a => a -> Tagged s a -> Bool #

maximum :: Ord a => Tagged s a -> a #

minimum :: Ord a => Tagged s a -> a #

sum :: Num a => Tagged s a -> a #

product :: Num a => Tagged s a -> a #

Foldable f => Foldable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fold :: Monoid m => Backwards f m -> m #

foldMap :: Monoid m => (a -> m) -> Backwards f a -> m #

foldr :: (a -> b -> b) -> b -> Backwards f a -> b #

foldr' :: (a -> b -> b) -> b -> Backwards f a -> b #

foldl :: (b -> a -> b) -> b -> Backwards f a -> b #

foldl' :: (b -> a -> b) -> b -> Backwards f a -> b #

foldr1 :: (a -> a -> a) -> Backwards f a -> a #

foldl1 :: (a -> a -> a) -> Backwards f a -> a #

toList :: Backwards f a -> [a] #

null :: Backwards f a -> Bool #

length :: Backwards f a -> Int #

elem :: Eq a => a -> Backwards f a -> Bool #

maximum :: Ord a => Backwards f a -> a #

minimum :: Ord a => Backwards f a -> a #

sum :: Num a => Backwards f a -> a #

product :: Num a => Backwards f a -> a #

(Foldable f, Foldable w) => Foldable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeT f w m -> m #

foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m #

foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b #

foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b #

foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b #

foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b #

foldr1 :: (a -> a -> a) -> CofreeT f w a -> a #

foldl1 :: (a -> a -> a) -> CofreeT f w a -> a #

toList :: CofreeT f w a -> [a] #

null :: CofreeT f w a -> Bool #

length :: CofreeT f w a -> Int #

elem :: Eq a => a -> CofreeT f w a -> Bool #

maximum :: Ord a => CofreeT f w a -> a #

minimum :: Ord a => CofreeT f w a -> a #

sum :: Num a => CofreeT f w a -> a #

product :: Num a => CofreeT f w a -> a #

Foldable f => Foldable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fold :: Monoid m => CofreeF f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 #

toList :: CofreeF f a a0 -> [a0] #

null :: CofreeF f a a0 -> Bool #

length :: CofreeF f a a0 -> Int #

elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool #

maximum :: Ord a0 => CofreeF f a a0 -> a0 #

minimum :: Ord a0 => CofreeF f a a0 -> a0 #

sum :: Num a0 => CofreeF f a a0 -> a0 #

product :: Num a0 => CofreeF f a a0 -> a0 #

(Foldable m, Foldable f) => Foldable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m0 => FreeT f m m0 -> m0 #

foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 #

foldr :: (a -> b -> b) -> b -> FreeT f m a -> b #

foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b #

foldl :: (b -> a -> b) -> b -> FreeT f m a -> b #

foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b #

foldr1 :: (a -> a -> a) -> FreeT f m a -> a #

foldl1 :: (a -> a -> a) -> FreeT f m a -> a #

toList :: FreeT f m a -> [a] #

null :: FreeT f m a -> Bool #

length :: FreeT f m a -> Int #

elem :: Eq a => a -> FreeT f m a -> Bool #

maximum :: Ord a => FreeT f m a -> a #

minimum :: Ord a => FreeT f m a -> a #

sum :: Num a => FreeT f m a -> a #

product :: Num a => FreeT f m a -> a #

Foldable f => Foldable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fold :: Monoid m => FreeF f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 #

toList :: FreeF f a a0 -> [a0] #

null :: FreeF f a a0 -> Bool #

length :: FreeF f a a0 -> Int #

elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool #

maximum :: Ord a0 => FreeF f a a0 -> a0 #

minimum :: Ord a0 => FreeF f a a0 -> a0 #

sum :: Num a0 => FreeF f a a0 -> a0 #

product :: Num a0 => FreeF f a a0 -> a0 #

Foldable (V n) 
Instance details

Defined in Linear.V

Methods

fold :: Monoid m => V n m -> m #

foldMap :: Monoid m => (a -> m) -> V n a -> m #

foldr :: (a -> b -> b) -> b -> V n a -> b #

foldr' :: (a -> b -> b) -> b -> V n a -> b #

foldl :: (b -> a -> b) -> b -> V n a -> b #

foldl' :: (b -> a -> b) -> b -> V n a -> b #

foldr1 :: (a -> a -> a) -> V n a -> a #

foldl1 :: (a -> a -> a) -> V n a -> a #

toList :: V n a -> [a] #

null :: V n a -> Bool #

length :: V n a -> Int #

elem :: Eq a => a -> V n a -> Bool #

maximum :: Ord a => V n a -> a #

minimum :: Ord a => V n a -> a #

sum :: Num a => V n a -> a #

product :: Num a => V n a -> a #

Foldable f => Foldable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fold :: Monoid m => AlongsideLeft f b m -> m #

foldMap :: Monoid m => (a -> m) -> AlongsideLeft f b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> AlongsideLeft f b a -> b0 #

foldr1 :: (a -> a -> a) -> AlongsideLeft f b a -> a #

foldl1 :: (a -> a -> a) -> AlongsideLeft f b a -> a #

toList :: AlongsideLeft f b a -> [a] #

null :: AlongsideLeft f b a -> Bool #

length :: AlongsideLeft f b a -> Int #

elem :: Eq a => a -> AlongsideLeft f b a -> Bool #

maximum :: Ord a => AlongsideLeft f b a -> a #

minimum :: Ord a => AlongsideLeft f b a -> a #

sum :: Num a => AlongsideLeft f b a -> a #

product :: Num a => AlongsideLeft f b a -> a #

Foldable f => Foldable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fold :: Monoid m => AlongsideRight f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> AlongsideRight f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> AlongsideRight f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> AlongsideRight f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> AlongsideRight f a a0 -> a0 #

toList :: AlongsideRight f a a0 -> [a0] #

null :: AlongsideRight f a a0 -> Bool #

length :: AlongsideRight f a a0 -> Int #

elem :: Eq a0 => a0 -> AlongsideRight f a a0 -> Bool #

maximum :: Ord a0 => AlongsideRight f a a0 -> a0 #

minimum :: Ord a0 => AlongsideRight f a a0 -> a0 #

sum :: Num a0 => AlongsideRight f a a0 -> a0 #

product :: Num a0 => AlongsideRight f a a0 -> a0 #

Foldable (K1 i c :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => K1 i c m -> m #

foldMap :: Monoid m => (a -> m) -> K1 i c a -> m #

foldr :: (a -> b -> b) -> b -> K1 i c a -> b #

foldr' :: (a -> b -> b) -> b -> K1 i c a -> b #

foldl :: (b -> a -> b) -> b -> K1 i c a -> b #

foldl' :: (b -> a -> b) -> b -> K1 i c a -> b #

foldr1 :: (a -> a -> a) -> K1 i c a -> a #

foldl1 :: (a -> a -> a) -> K1 i c a -> a #

toList :: K1 i c a -> [a] #

null :: K1 i c a -> Bool #

length :: K1 i c a -> Int #

elem :: Eq a => a -> K1 i c a -> Bool #

maximum :: Ord a => K1 i c a -> a #

minimum :: Ord a => K1 i c a -> a #

sum :: Num a => K1 i c a -> a #

product :: Num a => K1 i c a -> a #

(Foldable f, Foldable g) => Foldable (f :+: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :+: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :+: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :+: g) a -> a #

toList :: (f :+: g) a -> [a] #

null :: (f :+: g) a -> Bool #

length :: (f :+: g) a -> Int #

elem :: Eq a => a -> (f :+: g) a -> Bool #

maximum :: Ord a => (f :+: g) a -> a #

minimum :: Ord a => (f :+: g) a -> a #

sum :: Num a => (f :+: g) a -> a #

product :: Num a => (f :+: g) a -> a #

(Foldable f, Foldable g) => Foldable (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :*: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :*: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :*: g) a -> a #

toList :: (f :*: g) a -> [a] #

null :: (f :*: g) a -> Bool #

length :: (f :*: g) a -> Int #

elem :: Eq a => a -> (f :*: g) a -> Bool #

maximum :: Ord a => (f :*: g) a -> a #

minimum :: Ord a => (f :*: g) a -> a #

sum :: Num a => (f :*: g) a -> a #

product :: Num a => (f :*: g) a -> a #

(Foldable f, Foldable g) => Foldable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fold :: Monoid m => Product f g m -> m #

foldMap :: Monoid m => (a -> m) -> Product f g a -> m #

foldr :: (a -> b -> b) -> b -> Product f g a -> b #

foldr' :: (a -> b -> b) -> b -> Product f g a -> b #

foldl :: (b -> a -> b) -> b -> Product f g a -> b #

foldl' :: (b -> a -> b) -> b -> Product f g a -> b #

foldr1 :: (a -> a -> a) -> Product f g a -> a #

foldl1 :: (a -> a -> a) -> Product f g a -> a #

toList :: Product f g a -> [a] #

null :: Product f g a -> Bool #

length :: Product f g a -> Int #

elem :: Eq a => a -> Product f g a -> Bool #

maximum :: Ord a => Product f g a -> a #

minimum :: Ord a => Product f g a -> a #

sum :: Num a => Product f g a -> a #

product :: Num a => Product f g a -> a #

(Foldable f, Foldable g) => Foldable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fold :: Monoid m => Sum f g m -> m #

foldMap :: Monoid m => (a -> m) -> Sum f g a -> m #

foldr :: (a -> b -> b) -> b -> Sum f g a -> b #

foldr' :: (a -> b -> b) -> b -> Sum f g a -> b #

foldl :: (b -> a -> b) -> b -> Sum f g a -> b #

foldl' :: (b -> a -> b) -> b -> Sum f g a -> b #

foldr1 :: (a -> a -> a) -> Sum f g a -> a #

foldl1 :: (a -> a -> a) -> Sum f g a -> a #

toList :: Sum f g a -> [a] #

null :: Sum f g a -> Bool #

length :: Sum f g a -> Int #

elem :: Eq a => a -> Sum f g a -> Bool #

maximum :: Ord a => Sum f g a -> a #

minimum :: Ord a => Sum f g a -> a #

sum :: Num a => Sum f g a -> a #

product :: Num a => Sum f g a -> a #

Foldable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fold :: Monoid m => Magma i t b m -> m #

foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m #

foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 #

foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 #

foldr1 :: (a -> a -> a) -> Magma i t b a -> a #

foldl1 :: (a -> a -> a) -> Magma i t b a -> a #

toList :: Magma i t b a -> [a] #

null :: Magma i t b a -> Bool #

length :: Magma i t b a -> Int #

elem :: Eq a => a -> Magma i t b a -> Bool #

maximum :: Ord a => Magma i t b a -> a #

minimum :: Ord a => Magma i t b a -> a #

sum :: Num a => Magma i t b a -> a #

product :: Num a => Magma i t b a -> a #

Foldable f => Foldable (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => M1 i c f m -> m #

foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m #

foldr :: (a -> b -> b) -> b -> M1 i c f a -> b #

foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b #

foldl :: (b -> a -> b) -> b -> M1 i c f a -> b #

foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b #

foldr1 :: (a -> a -> a) -> M1 i c f a -> a #

foldl1 :: (a -> a -> a) -> M1 i c f a -> a #

toList :: M1 i c f a -> [a] #

null :: M1 i c f a -> Bool #

length :: M1 i c f a -> Int #

elem :: Eq a => a -> M1 i c f a -> Bool #

maximum :: Ord a => M1 i c f a -> a #

minimum :: Ord a => M1 i c f a -> a #

sum :: Num a => M1 i c f a -> a #

product :: Num a => M1 i c f a -> a #

(Foldable f, Foldable g) => Foldable (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => (f :.: g) m -> m #

foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m #

foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b #

foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b #

foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b #

foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b #

foldr1 :: (a -> a -> a) -> (f :.: g) a -> a #

foldl1 :: (a -> a -> a) -> (f :.: g) a -> a #

toList :: (f :.: g) a -> [a] #

null :: (f :.: g) a -> Bool #

length :: (f :.: g) a -> Int #

elem :: Eq a => a -> (f :.: g) a -> Bool #

maximum :: Ord a => (f :.: g) a -> a #

minimum :: Ord a => (f :.: g) a -> a #

sum :: Num a => (f :.: g) a -> a #

product :: Num a => (f :.: g) a -> a #

(Foldable f, Foldable g) => Foldable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fold :: Monoid m => Compose f g m -> m #

foldMap :: Monoid m => (a -> m) -> Compose f g a -> m #

foldr :: (a -> b -> b) -> b -> Compose f g a -> b #

foldr' :: (a -> b -> b) -> b -> Compose f g a -> b #

foldl :: (b -> a -> b) -> b -> Compose f g a -> b #

foldl' :: (b -> a -> b) -> b -> Compose f g a -> b #

foldr1 :: (a -> a -> a) -> Compose f g a -> a #

foldl1 :: (a -> a -> a) -> Compose f g a -> a #

toList :: Compose f g a -> [a] #

null :: Compose f g a -> Bool #

length :: Compose f g a -> Int #

elem :: Eq a => a -> Compose f g a -> Bool #

maximum :: Ord a => Compose f g a -> a #

minimum :: Ord a => Compose f g a -> a #

sum :: Num a => Compose f g a -> a #

product :: Num a => Compose f g a -> a #

Bifoldable p => Foldable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fold :: Monoid m => WrappedBifunctor p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 #

toList :: WrappedBifunctor p a a0 -> [a0] #

null :: WrappedBifunctor p a a0 -> Bool #

length :: WrappedBifunctor p a a0 -> Int #

elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool #

maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 #

minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 #

sum :: Num a0 => WrappedBifunctor p a a0 -> a0 #

product :: Num a0 => WrappedBifunctor p a a0 -> a0 #

Foldable g => Foldable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fold :: Monoid m => Joker g a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 #

toList :: Joker g a a0 -> [a0] #

null :: Joker g a a0 -> Bool #

length :: Joker g a a0 -> Int #

elem :: Eq a0 => a0 -> Joker g a a0 -> Bool #

maximum :: Ord a0 => Joker g a a0 -> a0 #

minimum :: Ord a0 => Joker g a a0 -> a0 #

sum :: Num a0 => Joker g a a0 -> a0 #

product :: Num a0 => Joker g a a0 -> a0 #

Bifoldable p => Foldable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fold :: Monoid m => Flip p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 #

toList :: Flip p a a0 -> [a0] #

null :: Flip p a a0 -> Bool #

length :: Flip p a a0 -> Int #

elem :: Eq a0 => a0 -> Flip p a a0 -> Bool #

maximum :: Ord a0 => Flip p a a0 -> a0 #

minimum :: Ord a0 => Flip p a a0 -> a0 #

sum :: Num a0 => Flip p a a0 -> a0 #

product :: Num a0 => Flip p a a0 -> a0 #

Foldable (Clown f a :: Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fold :: Monoid m => Clown f a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 #

toList :: Clown f a a0 -> [a0] #

null :: Clown f a a0 -> Bool #

length :: Clown f a a0 -> Int #

elem :: Eq a0 => a0 -> Clown f a a0 -> Bool #

maximum :: Ord a0 => Clown f a a0 -> a0 #

minimum :: Ord a0 => Clown f a a0 -> a0 #

sum :: Num a0 => Clown f a a0 -> a0 #

product :: Num a0 => Clown f a a0 -> a0 #

(Foldable f, Bifoldable p) => Foldable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fold :: Monoid m => Tannen f p a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 #

toList :: Tannen f p a a0 -> [a0] #

null :: Tannen f p a a0 -> Bool #

length :: Tannen f p a a0 -> Int #

elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool #

maximum :: Ord a0 => Tannen f p a a0 -> a0 #

minimum :: Ord a0 => Tannen f p a a0 -> a0 #

sum :: Num a0 => Tannen f p a a0 -> a0 #

product :: Num a0 => Tannen f p a a0 -> a0 #

(Bifoldable p, Foldable g) => Foldable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fold :: Monoid m => Biff p f g a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 #

toList :: Biff p f g a a0 -> [a0] #

null :: Biff p f g a a0 -> Bool #

length :: Biff p f g a a0 -> Int #

elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool #

maximum :: Ord a0 => Biff p f g a a0 -> a0 #

minimum :: Ord a0 => Biff p f g a a0 -> a0 #

sum :: Num a0 => Biff p f g a a0 -> a0 #

product :: Num a0 => Biff p f g a a0 -> a0 #

class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #

Functors representing data structures that can be traversed from left to right.

A definition of traverse must satisfy the following laws:

naturality
t . traverse f = traverse (t . f) for every applicative transformation t
identity
traverse Identity = Identity
composition
traverse (Compose . fmap g . f) = Compose . fmap (traverse g) . traverse f

A definition of sequenceA must satisfy the following laws:

naturality
t . sequenceA = sequenceA . fmap t for every applicative transformation t
identity
sequenceA . fmap Identity = Identity
composition
sequenceA . fmap Compose = Compose . fmap sequenceA . sequenceA

where an applicative transformation is a function

t :: (Applicative f, Applicative g) => f a -> g a

preserving the Applicative operations, i.e.

and the identity functor Identity and composition of functors Compose @@ -279,62 +387,92 @@ traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r

This is suitable even for abstract types, as the laws for <*> imply a form of associativity.

The superclass instances should satisfy the following:

Minimal complete definition

traverse | sequenceA

Methods

traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #

Map each element of a structure to an action, evaluate these actions + (foldMapDefault).

Minimal complete definition

traverse | sequenceA

Methods

traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #

Map each element of a structure to an action, evaluate these actions from left to right, and collect the results. For a version that ignores - the results see traverse_.

sequenceA :: Applicative f => t (f a) -> f (t a) #

Evaluate each action in the structure from left to right, and - and collect the results. For a version that ignores the results - see sequenceA_.

mapM :: Monad m => (a -> m b) -> t a -> m (t b) #

Map each element of a structure to a monadic action, evaluate + the results see traverse_.

sequenceA :: Applicative f => t (f a) -> f (t a) #

Evaluate each action in the structure from left to right, and + collect the results. For a version that ignores the results + see sequenceA_.

mapM :: Monad m => (a -> m b) -> t a -> m (t b) #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For - a version that ignores the results see mapM_.

sequence :: Monad m => t (m a) -> m (t a) #

Evaluate each monadic action in the structure from left to + a version that ignores the results see mapM_.

sequence :: Monad m => t (m a) -> m (t a) #

Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the - results see sequence_.

Instances
Traversable []

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> [a] -> f [b] #

sequenceA :: Applicative f => [f a] -> f [a] #

mapM :: Monad m => (a -> m b) -> [a] -> m [b] #

sequence :: Monad m => [m a] -> m [a] #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) #

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) #

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

Traversable Par1 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Par1 a -> f (Par1 b) #

sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) #

mapM :: Monad m => (a -> m b) -> Par1 a -> m (Par1 b) #

sequence :: Monad m => Par1 (m a) -> m (Par1 a) #

Traversable Identity 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) #

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) #

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Traversable Complex 
Instance details

Defined in Data.Complex

Methods

traverse :: Applicative f => (a -> f b) -> Complex a -> f (Complex b) #

sequenceA :: Applicative f => Complex (f a) -> f (Complex a) #

mapM :: Monad m => (a -> m b) -> Complex a -> m (Complex b) #

sequence :: Monad m => Complex (m a) -> m (Complex a) #

Traversable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) #

sequenceA :: Applicative f => Min (f a) -> f (Min a) #

mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) #

sequence :: Monad m => Min (m a) -> m (Min a) #

Traversable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) #

sequenceA :: Applicative f => Max (f a) -> f (Max a) #

mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) #

sequence :: Monad m => Max (m a) -> m (Max a) #

Traversable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> First a -> f (First b) #

sequenceA :: Applicative f => First (f a) -> f (First a) #

mapM :: Monad m => (a -> m b) -> First a -> m (First b) #

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) #

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) #

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Option a -> f (Option b) #

sequenceA :: Applicative f => Option (f a) -> f (Option a) #

mapM :: Monad m => (a -> m b) -> Option a -> m (Option b) #

sequence :: Monad m => Option (m a) -> m (Option a) #

Traversable ZipList

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) #

sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) #

mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) #

sequence :: Monad m => ZipList (m a) -> m (ZipList a) #

Traversable First

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> First a -> f (First b) #

sequenceA :: Applicative f => First (f a) -> f (First a) #

mapM :: Monad m => (a -> m b) -> First a -> m (First b) #

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) #

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) #

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) #

sequenceA :: Applicative f => Dual (f a) -> f (Dual a) #

mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) #

sequence :: Monad m => Dual (m a) -> m (Dual a) #

Traversable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) #

sequenceA :: Applicative f => Sum (f a) -> f (Sum a) #

mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) #

sequence :: Monad m => Sum (m a) -> m (Sum a) #

Traversable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) #

sequenceA :: Applicative f => Product (f a) -> f (Product a) #

mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) #

sequence :: Monad m => Product (m a) -> m (Product a) #

Traversable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) #

sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) #

mapM :: Monad m => (a -> m b) -> NonEmpty a -> m (NonEmpty b) #

sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #

Traversable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) #

sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) #

mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) #

sequence :: Monad m => IntMap (m a) -> m (IntMap a) #

Traversable SCC

Since: containers-0.5.9

Instance details

Defined in Data.Graph

Methods

traverse :: Applicative f => (a -> f b) -> SCC a -> f (SCC b) #

sequenceA :: Applicative f => SCC (f a) -> f (SCC a) #

mapM :: Monad m => (a -> m b) -> SCC a -> m (SCC b) #

sequence :: Monad m => SCC (m a) -> m (SCC a) #

Traversable Tree 
Instance details

Defined in Data.Tree

Methods

traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) #

sequenceA :: Applicative f => Tree (f a) -> f (Tree a) #

mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) #

sequence :: Monad m => Tree (m a) -> m (Tree a) #

Traversable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) #

sequenceA :: Applicative f => Seq (f a) -> f (Seq a) #

mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) #

sequence :: Monad m => Seq (m a) -> m (Seq a) #

Traversable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> FingerTree a -> f (FingerTree b) #

sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) #

mapM :: Monad m => (a -> m b) -> FingerTree a -> m (FingerTree b) #

sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #

Traversable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Digit a -> f (Digit b) #

sequenceA :: Applicative f => Digit (f a) -> f (Digit a) #

mapM :: Monad m => (a -> m b) -> Digit a -> m (Digit b) #

sequence :: Monad m => Digit (m a) -> m (Digit a) #

Traversable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) #

sequenceA :: Applicative f => Node (f a) -> f (Node a) #

mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) #

sequence :: Monad m => Node (m a) -> m (Node a) #

Traversable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Elem a -> f (Elem b) #

sequenceA :: Applicative f => Elem (f a) -> f (Elem a) #

mapM :: Monad m => (a -> m b) -> Elem a -> m (Elem b) #

sequence :: Monad m => Elem (m a) -> m (Elem a) #

Traversable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> ViewL a -> f (ViewL b) #

sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) #

mapM :: Monad m => (a -> m b) -> ViewL a -> m (ViewL b) #

sequence :: Monad m => ViewL (m a) -> m (ViewL a) #

Traversable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> ViewR a -> f (ViewR b) #

sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) #

mapM :: Monad m => (a -> m b) -> ViewR a -> m (ViewR b) #

sequence :: Monad m => ViewR (m a) -> m (ViewR a) #

Traversable V3 
Instance details

Defined in Linear.V3

Methods

traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) #

sequenceA :: Applicative f => V3 (f a) -> f (V3 a) #

mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) #

sequence :: Monad m => V3 (m a) -> m (V3 a) #

Traversable V2 
Instance details

Defined in Linear.V2

Methods

traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) #

sequenceA :: Applicative f => V2 (f a) -> f (V2 a) #

mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) #

sequence :: Monad m => V2 (m a) -> m (V2 a) #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

traverse :: Applicative f => (a -> f b) -> Polar a -> f (Polar b) #

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

mapM :: Monad m => (a -> m b) -> Polar a -> m (Polar b) #

sequence :: Monad m => Polar (m a) -> m (Polar a) #

Traversable Array 
Instance details

Defined in Data.Primitive.Array

Methods

traverse :: Applicative f => (a -> f b) -> Array a -> f (Array b) #

sequenceA :: Applicative f => Array (f a) -> f (Array a) #

mapM :: Monad m => (a -> m b) -> Array a -> m (Array b) #

sequence :: Monad m => Array (m a) -> m (Array a) #

Traversable Vector 
Instance details

Defined in Data.Vector

Methods

traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) #

sequenceA :: Applicative f => Vector (f a) -> f (Vector a) #

mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) #

sequence :: Monad m => Vector (m a) -> m (Vector a) #

Traversable Log 
Instance details

Defined in Numeric.Log

Methods

traverse :: Applicative f => (a -> f b) -> Log a -> f (Log b) #

sequenceA :: Applicative f => Log (f a) -> f (Log a) #

mapM :: Monad m => (a -> m b) -> Log a -> m (Log b) #

sequence :: Monad m => Log (m a) -> m (Log a) #

Traversable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

traverse :: Applicative f => (a -> f b) -> Interval a -> f (Interval b) #

sequenceA :: Applicative f => Interval (f a) -> f (Interval a) #

mapM :: Monad m => (a -> m b) -> Interval a -> m (Interval b) #

sequence :: Monad m => Interval (m a) -> m (Interval a) #

Traversable V1 
Instance details

Defined in Linear.V1

Methods

traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) #

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) #

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable V4 
Instance details

Defined in Linear.V4

Methods

traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) #

sequenceA :: Applicative f => V4 (f a) -> f (V4 a) #

mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) #

sequence :: Monad m => V4 (m a) -> m (V4 a) #

Traversable Plucker 
Instance details

Defined in Linear.Plucker

Methods

traverse :: Applicative f => (a -> f b) -> Plucker a -> f (Plucker b) #

sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) #

mapM :: Monad m => (a -> m b) -> Plucker a -> m (Plucker b) #

sequence :: Monad m => Plucker (m a) -> m (Plucker a) #

Traversable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

traverse :: Applicative f => (a -> f b) -> Quaternion a -> f (Quaternion b) #

sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) #

mapM :: Monad m => (a -> m b) -> Quaternion a -> m (Quaternion b) #

sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) #

Traversable V0 
Instance details

Defined in Linear.V0

Methods

traverse :: Applicative f => (a -> f b) -> V0 a -> f (V0 b) #

sequenceA :: Applicative f => V0 (f a) -> f (V0 a) #

mapM :: Monad m => (a -> m b) -> V0 a -> m (V0 b) #

sequence :: Monad m => V0 (m a) -> m (V0 a) #

Traversable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

traverse :: Applicative f => (a -> f b) -> IResult a -> f (IResult b) #

sequenceA :: Applicative f => IResult (f a) -> f (IResult a) #

mapM :: Monad m => (a -> m b) -> IResult a -> m (IResult b) #

sequence :: Monad m => IResult (m a) -> m (IResult a) #

Traversable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Result a -> f (Result b) #

sequenceA :: Applicative f => Result (f a) -> f (Result a) #

mapM :: Monad m => (a -> m b) -> Result a -> m (Result b) #

sequence :: Monad m => Result (m a) -> m (Result a) #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Traversable (V1 :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) #

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) #

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> U1 a -> f (U1 b) #

sequenceA :: Applicative f => U1 (f a) -> f (U1 a) #

mapM :: Monad m => (a -> m b) -> U1 a -> m (U1 b) #

sequence :: Monad m => U1 (m a) -> m (U1 a) #

Traversable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequenceA :: Applicative f => (a, f a0) -> f (a, a0) #

mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) #

sequence :: Monad m => (a, m a0) -> m (a, a0) #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

Traversable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) #

sequenceA :: Applicative f => Map k (f a) -> f (Map k a) #

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) #

sequence :: Monad m => Map k (m a) -> m (Map k a) #

Ix i => Traversable (Array i)

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) #

sequenceA :: Applicative f => Array i (f a) -> f (Array i a) #

mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) #

sequence :: Monad m => Array i (m a) -> m (Array i a) #

Traversable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) #

sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) #

mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) #

sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #

Traversable (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) #

sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) #

mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) #

sequence :: Monad m => Proxy (m a) -> m (Proxy a) #

Traversable f => Traversable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) #

sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) #

mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) #

sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #

Traversable f => Traversable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) #

sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) #

mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) #

sequence :: Monad m => ListT f (m a) -> m (ListT f a) #

Traversable f => Traversable (Point f) 
Instance details

Defined in Linear.Affine

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) #

sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) #

mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) #

sequence :: Monad m => Point f (m a) -> m (Point f a) #

Traversable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

traverse :: Applicative f => (a -> f b) -> Categorical p a -> f (Categorical p b) #

sequenceA :: Applicative f => Categorical p (f a) -> f (Categorical p a) #

mapM :: Monad m => (a -> m b) -> Categorical p a -> m (Categorical p b) #

sequence :: Monad m => Categorical p (m a) -> m (Categorical p a) #

Traversable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) #

sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) #

mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) #

sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #

Traversable f => Traversable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) #

mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) #

sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #

Traversable f => Traversable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) #

mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) #

sequence :: Monad m => Free f (m a) -> m (Free f a) #

Traversable f => Traversable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) #

mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) #

sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #

Traversable f => Traversable (Rec1 f) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) #

mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) #

sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #

Traversable (URec Char :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Traversable (URec Double :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Traversable (URec Float :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Traversable (URec Int :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Traversable (URec Word :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Traversable (URec (Ptr ()) :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) #

sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) #

mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) #

sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #

Traversable (Const m :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Traversable f => Traversable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) #

mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) #

sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #

Traversable f => Traversable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) #

sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) #

mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) #

sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) #

Traversable f => Traversable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) #

sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) #

mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) #

sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #

Traversable f => Traversable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) #

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) #

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Bitraversable p => Traversable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) #

sequenceA :: Applicative f => Join p (f a) -> f (Join p a) #

mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) #

sequence :: Monad m => Join p (m a) -> m (Join p a) #

Traversable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) #

sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) #

mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) #

sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #

(Traversable f, Traversable w) => Traversable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) #

sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) #

mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) #

sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #

Traversable f => Traversable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) #

sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) #

sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #

Bitraversable p => Traversable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) #

sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) #

mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) #

sequence :: Monad m => Fix p (m a) -> m (Fix p a) #

Traversable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

traverse :: Applicative f => (a0 -> f b) -> Forget r a a0 -> f (Forget r a b) #

sequenceA :: Applicative f => Forget r a (f a0) -> f (Forget r a a0) #

mapM :: Monad m => (a0 -> m b) -> Forget r a a0 -> m (Forget r a b) #

sequence :: Monad m => Forget r a (m a0) -> m (Forget r a a0) #

(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) #

sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) #

mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) #

sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #

Traversable f => Traversable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) #

sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) #

sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #

Traversable (V n) 
Instance details

Defined in Linear.V

Methods

traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) #

sequenceA :: Applicative f => V n (f a) -> f (V n a) #

mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) #

sequence :: Monad m => V n (m a) -> m (V n a) #

Traversable f => Traversable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 (AlongsideLeft f b a) #

mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m (AlongsideLeft f b b0) #

sequence :: Monad m => AlongsideLeft f b (m a) -> m (AlongsideLeft f b a) #

Traversable f => Traversable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 (AlongsideRight f a a0) #

mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m (AlongsideRight f a b) #

sequence :: Monad m => AlongsideRight f a (m a0) -> m (AlongsideRight f a a0) #

Traversable (K1 i c :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) #

sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) #

mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) #

sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #

(Traversable f, Traversable g) => Traversable (f :+: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) #

mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) #

sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #

(Traversable f, Traversable g) => Traversable (f :*: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a) #

mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b) #

sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a) #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

(Traversable f, Traversable g) => Traversable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) #

mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) #

sequence :: Monad m => Product f g (m a) -> m (Product f g a) #

(Traversable f, Traversable g) => Traversable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) #

mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) #

sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) #

Traversable f => Traversable (M1 i c f) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) #

mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) #

sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #

(Traversable f, Traversable g) => Traversable (f :.: g) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) #

mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) #

sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #

(Traversable f, Traversable g) => Traversable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) #

mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) #

sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #

Traversable (Clown f a :: * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) #

sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) #

mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) #

sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #

Bitraversable p => Traversable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) #

sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) #

mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) #

sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #

Traversable g => Traversable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) #

mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) #

sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #

Bitraversable p => Traversable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) #

sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) #

mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) #

sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #

(Traversable f, Bitraversable p) => Traversable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) #

sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) #

mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) #

sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #

(Bitraversable p, Traversable g) => Traversable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) #

sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) #

mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) #

sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the associativity law:

Since: base-4.9.0.0

Minimal complete definition

(<>)

Methods

(<>) :: a -> a -> a infixr 6 #

An associative operation.

Instances
Semigroup Ordering

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Ordering -> Ordering -> Ordering #

sconcat :: NonEmpty Ordering -> Ordering #

stimes :: Integral b => b -> Ordering -> Ordering #

Semigroup ()

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: () -> () -> () #

sconcat :: NonEmpty () -> () #

stimes :: Integral b => b -> () -> () #

Semigroup Path

Paths are monoids. After a path is closed you can not append - anything to it anymore. The empty path is open. - Use close to close a path.

Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(<>) :: Path -> Path -> Path #

sconcat :: NonEmpty Path -> Path #

stimes :: Integral b => b -> Path -> Path #

Semigroup ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString #

sconcat :: NonEmpty ByteString -> ByteString #

stimes :: Integral b => b -> ByteString -> ByteString #

Semigroup ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString #

sconcat :: NonEmpty ByteString -> ByteString #

stimes :: Integral b => b -> ByteString -> ByteString #

Semigroup Builder 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(<>) :: Builder -> Builder -> Builder #

sconcat :: NonEmpty Builder -> Builder #

stimes :: Integral b => b -> Builder -> Builder #

Semigroup Void

Since: base-4.9.0.0

Instance details

Defined in Data.Void

Methods

(<>) :: Void -> Void -> Void #

sconcat :: NonEmpty Void -> Void #

stimes :: Integral b => b -> Void -> Void #

Semigroup All

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: All -> All -> All #

sconcat :: NonEmpty All -> All #

stimes :: Integral b => b -> All -> All #

Semigroup Any

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Any -> Any -> Any #

sconcat :: NonEmpty Any -> Any #

stimes :: Integral b => b -> Any -> Any #

Semigroup String 
Instance details

Defined in Basement.UTF8.Base

Methods

(<>) :: String -> String -> String #

sconcat :: NonEmpty String -> String #

stimes :: Integral b => b -> String -> String #

Semigroup IntSet

Since: containers-0.5.7

Instance details

Defined in Data.IntSet.Internal

Methods

(<>) :: IntSet -> IntSet -> IntSet #

sconcat :: NonEmpty IntSet -> IntSet #

stimes :: Integral b => b -> IntSet -> IntSet #

Semigroup Name 
Instance details

Defined in Diagrams.Core.Names

Methods

(<>) :: Name -> Name -> Name #

sconcat :: NonEmpty Name -> Name #

stimes :: Integral b => b -> Name -> Name #

Semigroup Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

(<>) :: Doc -> Doc -> Doc #

sconcat :: NonEmpty Doc -> Doc #

stimes :: Integral b => b -> Doc -> Doc #

Semigroup FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: FillRule -> FillRule -> FillRule #

sconcat :: NonEmpty FillRule -> FillRule #

stimes :: Integral b => b -> FillRule -> FillRule #

Semigroup Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: Crossings -> Crossings -> Crossings #

sconcat :: NonEmpty Crossings -> Crossings #

stimes :: Integral b => b -> Crossings -> Crossings #

Semigroup SegCount 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: SegCount -> SegCount -> SegCount #

sconcat :: NonEmpty SegCount -> SegCount #

stimes :: Integral b => b -> SegCount -> SegCount #

Semigroup More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(<>) :: More -> More -> More #

sconcat :: NonEmpty More -> More #

stimes :: Integral b => b -> More -> More #

Semigroup FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontSlant -> FontSlant -> FontSlant #

sconcat :: NonEmpty FontSlant -> FontSlant #

stimes :: Integral b => b -> FontSlant -> FontSlant #

Semigroup FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontWeight -> FontWeight -> FontWeight #

sconcat :: NonEmpty FontWeight -> FontWeight #

stimes :: Integral b => b -> FontWeight -> FontWeight #

Semigroup Font 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: Font -> Font -> Font #

sconcat :: NonEmpty Font -> Font #

stimes :: Integral b => b -> Font -> Font #

Semigroup ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<>) :: ConstVal -> ConstVal -> ConstVal #

sconcat :: NonEmpty ConstVal -> ConstVal #

stimes :: Integral b => b -> ConstVal -> ConstVal #

Semigroup DExpr # 
Instance details

Defined in Data.Expression

Methods

(<>) :: DExpr -> DExpr -> DExpr #

sconcat :: NonEmpty DExpr -> DExpr #

stimes :: Integral b => b -> DExpr -> DExpr #

Semigroup [a]

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: [a] -> [a] -> [a] #

sconcat :: NonEmpty [a] -> [a] #

stimes :: Integral b => b -> [a] -> [a] #

Semigroup a => Semigroup (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Maybe a -> Maybe a -> Maybe a #

sconcat :: NonEmpty (Maybe a) -> Maybe a #

stimes :: Integral b => b -> Maybe a -> Maybe a #

Semigroup a => Semigroup (IO a)

Since: base-4.10.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: IO a -> IO a -> IO a #

sconcat :: NonEmpty (IO a) -> IO a #

stimes :: Integral b => b -> IO a -> IO a #

Semigroup (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Rightmost a -> Rightmost a -> Rightmost a #

sconcat :: NonEmpty (Rightmost a) -> Rightmost a #

stimes :: Integral b => b -> Rightmost a -> Rightmost a #

Semigroup (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Leftmost a -> Leftmost a -> Leftmost a #

sconcat :: NonEmpty (Leftmost a) -> Leftmost a #

stimes :: Integral b => b -> Leftmost a -> Leftmost a #

Semigroup a => Semigroup (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a #

sconcat :: NonEmpty (Identity a) -> Identity a #

stimes :: Integral b => b -> Identity a -> Identity a #

Num a => Semigroup (AlphaColour a)

AlphaColour forms a monoid with over and transparent.

Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a #

sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a #

stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #

Num a => Semigroup (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: Colour a -> Colour a -> Colour a #

sconcat :: NonEmpty (Colour a) -> Colour a #

stimes :: Integral b => b -> Colour a -> Colour a #

Ord a => Semigroup (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Min a -> Min a -> Min a #

sconcat :: NonEmpty (Min a) -> Min a #

stimes :: Integral b => b -> Min a -> Min a #

Ord a => Semigroup (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Max a -> Max a -> Max a #

sconcat :: NonEmpty (Max a) -> Max a #

stimes :: Integral b => b -> Max a -> Max a #

Semigroup (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: First a -> First a -> First a #

sconcat :: NonEmpty (First a) -> First a #

stimes :: Integral b => b -> First a -> First a #

Semigroup (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Last a -> Last a -> Last a #

sconcat :: NonEmpty (Last a) -> Last a #

stimes :: Integral b => b -> Last a -> Last a #

Monoid m => Semigroup (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m #

stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #

Semigroup a => Semigroup (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Option a -> Option a -> Option a #

sconcat :: NonEmpty (Option a) -> Option a #

stimes :: Integral b => b -> Option a -> Option a #

Semigroup (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: First a -> First a -> First a #

sconcat :: NonEmpty (First a) -> First a #

stimes :: Integral b => b -> First a -> First a #

Semigroup (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: Last a -> Last a -> Last a #

sconcat :: NonEmpty (Last a) -> Last a #

stimes :: Integral b => b -> Last a -> Last a #

Semigroup a => Semigroup (Dual a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Dual a -> Dual a -> Dual a #

sconcat :: NonEmpty (Dual a) -> Dual a #

stimes :: Integral b => b -> Dual a -> Dual a #

Semigroup (Endo a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Endo a -> Endo a -> Endo a #

sconcat :: NonEmpty (Endo a) -> Endo a #

stimes :: Integral b => b -> Endo a -> Endo a #

Num a => Semigroup (Sum a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Sum a -> Sum a -> Sum a #

sconcat :: NonEmpty (Sum a) -> Sum a #

stimes :: Integral b => b -> Sum a -> Sum a #

Num a => Semigroup (Product a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Product a -> Product a -> Product a #

sconcat :: NonEmpty (Product a) -> Product a #

stimes :: Integral b => b -> Product a -> Product a #

Semigroup a => Semigroup (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(<>) :: Down a -> Down a -> Down a #

sconcat :: NonEmpty (Down a) -> Down a #

stimes :: Integral b => b -> Down a -> Down a #

Semigroup (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a #

sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a #

stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #

PrimType ty => Semigroup (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

(<>) :: UArray ty -> UArray ty -> UArray ty #

sconcat :: NonEmpty (UArray ty) -> UArray ty #

stimes :: Integral b => b -> UArray ty -> UArray ty #

PrimType ty => Semigroup (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

(<>) :: Block ty -> Block ty -> Block ty #

sconcat :: NonEmpty (Block ty) -> Block ty #

stimes :: Integral b => b -> Block ty -> Block ty #

Semigroup (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(<>) :: CountOf ty -> CountOf ty -> CountOf ty #

sconcat :: NonEmpty (CountOf ty) -> CountOf ty #

stimes :: Integral b => b -> CountOf ty -> CountOf ty #

Semigroup (PutM ()) 
Instance details

Defined in Data.Binary.Put

Methods

(<>) :: PutM () -> PutM () -> PutM () #

sconcat :: NonEmpty (PutM ()) -> PutM () #

stimes :: Integral b => b -> PutM () -> PutM () #

Semigroup (IntMap a)

Since: containers-0.5.7

Instance details

Defined in Data.IntMap.Internal

Methods

(<>) :: IntMap a -> IntMap a -> IntMap a #

sconcat :: NonEmpty (IntMap a) -> IntMap a #

stimes :: Integral b => b -> IntMap a -> IntMap a #

Semigroup (Seq a)

Since: containers-0.5.7

Instance details

Defined in Data.Sequence.Internal

Methods

(<>) :: Seq a -> Seq a -> Seq a #

sconcat :: NonEmpty (Seq a) -> Seq a #

stimes :: Integral b => b -> Seq a -> Seq a #

Ord a => Semigroup (Set a)

Since: containers-0.5.7

Instance details

Defined in Data.Set.Internal

Methods

(<>) :: Set a -> Set a -> Set a #

sconcat :: NonEmpty (Set a) -> Set a #

stimes :: Integral b => b -> Set a -> Set a #

Semigroup (DList a) 
Instance details

Defined in Data.DList

Methods

(<>) :: DList a -> DList a -> DList a #

sconcat :: NonEmpty (DList a) -> DList a #

stimes :: Integral b => b -> DList a -> DList a #

Num n => Semigroup (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

(<>) :: Angle n -> Angle n -> Angle n #

sconcat :: NonEmpty (Angle n) -> Angle n #

stimes :: Integral b => b -> Angle n -> Angle n #

Semigroup (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(<>) :: Doc a -> Doc a -> Doc a #

sconcat :: NonEmpty (Doc a) -> Doc a #

stimes :: Integral b => b -> Doc a -> Doc a #

Semigroup (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

(<>) :: Array a -> Array a -> Array a #

sconcat :: NonEmpty (Array a) -> Array a #

stimes :: Integral b => b -> Array a -> Array a #

Storable a => Semigroup (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

Semigroup (MergeSet a) 
Instance details

Defined in Data.Set.Internal

Methods

(<>) :: MergeSet a -> MergeSet a -> MergeSet a #

sconcat :: NonEmpty (MergeSet a) -> MergeSet a #

stimes :: Integral b => b -> MergeSet a -> MergeSet a #

Semigroup (Vector a) 
Instance details

Defined in Data.Vector

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

Prim a => Semigroup (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

(Precise a, RealFloat a) => Semigroup (Log a) 
Instance details

Defined in Numeric.Log

Methods

(<>) :: Log a -> Log a -> Log a #

sconcat :: NonEmpty (Log a) -> Log a #

stimes :: Integral b => b -> Log a -> Log a #

(Hashable a, Eq a) => Semigroup (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

(<>) :: HashSet a -> HashSet a -> HashSet a #

sconcat :: NonEmpty (HashSet a) -> HashSet a #

stimes :: Integral b => b -> HashSet a -> HashSet a #

Ord a => Semigroup (SortedList a) 
Instance details

Defined in Diagrams.Core.Trace

Methods

(<>) :: SortedList a -> SortedList a -> SortedList a #

sconcat :: NonEmpty (SortedList a) -> SortedList a #

stimes :: Integral b => b -> SortedList a -> SortedList a #

Semigroup t => Semigroup (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: TransInv t -> TransInv t -> TransInv t #

sconcat :: NonEmpty (TransInv t) -> TransInv t #

stimes :: Integral b => b -> TransInv t -> TransInv t #

Semigroup (Parser a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: Parser a -> Parser a -> Parser a #

sconcat :: NonEmpty (Parser a) -> Parser a #

stimes :: Integral b => b -> Parser a -> Parser a #

Semigroup a => Semigroup (Active a) 
Instance details

Defined in Data.Active

Methods

(<>) :: Active a -> Active a -> Active a #

sconcat :: NonEmpty (Active a) -> Active a #

stimes :: Integral b => b -> Active a -> Active a #

Semigroup a => Semigroup (Dynamic a) 
Instance details

Defined in Data.Active

Methods

(<>) :: Dynamic a -> Dynamic a -> Dynamic a #

sconcat :: NonEmpty (Dynamic a) -> Dynamic a #

stimes :: Integral b => b -> Dynamic a -> Dynamic a #

Semigroup (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: Clip n -> Clip n -> Clip n #

sconcat :: NonEmpty (Clip n) -> Clip n #

stimes :: Integral b => b -> Clip n -> Clip n #

(Num n, Ord n) => Semigroup (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: ArcLength n -> ArcLength n -> ArcLength n #

sconcat :: NonEmpty (ArcLength n) -> ArcLength n #

stimes :: Integral b => b -> ArcLength n -> ArcLength n #

Semigroup (FillTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

(<>) :: FillTexture n -> FillTexture n -> FillTexture n #

sconcat :: NonEmpty (FillTexture n) -> FillTexture n #

stimes :: Integral b => b -> FillTexture n -> FillTexture n #

Semigroup (LineTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

(<>) :: LineTexture n -> LineTexture n -> LineTexture n #

sconcat :: NonEmpty (LineTexture n) -> LineTexture n #

stimes :: Integral b => b -> LineTexture n -> LineTexture n #

Semigroup (FontSize n) 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontSize n -> FontSize n -> FontSize n #

sconcat :: NonEmpty (FontSize n) -> FontSize n #

stimes :: Integral b => b -> FontSize n -> FontSize n #

Semigroup (Comparison a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Comparison a -> Comparison a -> Comparison a #

sconcat :: NonEmpty (Comparison a) -> Comparison a #

stimes :: Integral b => b -> Comparison a -> Comparison a #

Semigroup (Equivalence a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Equivalence a -> Equivalence a -> Equivalence a #

sconcat :: NonEmpty (Equivalence a) -> Equivalence a #

stimes :: Integral b => b -> Equivalence a -> Equivalence a #

Semigroup (Predicate a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Predicate a -> Predicate a -> Predicate a #

sconcat :: NonEmpty (Predicate a) -> Predicate a #

stimes :: Integral b => b -> Predicate a -> Predicate a #

Num n => Semigroup (Duration n) 
Instance details

Defined in Data.Active

Methods

(<>) :: Duration n -> Duration n -> Duration n #

sconcat :: NonEmpty (Duration n) -> Duration n #

stimes :: Integral b => b -> Duration n -> Duration n #

Ord n => Semigroup (Era n) 
Instance details

Defined in Data.Active

Methods

(<>) :: Era n -> Era n -> Era n #

sconcat :: NonEmpty (Era n) -> Era n #

stimes :: Integral b => b -> Era n -> Era n #

Semigroup (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: IResult a -> IResult a -> IResult a #

sconcat :: NonEmpty (IResult a) -> IResult a #

stimes :: Integral b => b -> IResult a -> IResult a #

Semigroup (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: Result a -> Result a -> Result a #

sconcat :: NonEmpty (Result a) -> Result a #

stimes :: Integral b => b -> Result a -> Result a #

Ord a => Semigroup (Max a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Max a -> Max a -> Max a #

sconcat :: NonEmpty (Max a) -> Max a #

stimes :: Integral b => b -> Max a -> Max a #

Ord a => Semigroup (Min a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Min a -> Min a -> Min a #

sconcat :: NonEmpty (Min a) -> Min a #

stimes :: Integral b => b -> Min a -> Min a #

Semigroup (NonEmptyDList a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: NonEmptyDList a -> NonEmptyDList a -> NonEmptyDList a #

sconcat :: NonEmpty (NonEmptyDList a) -> NonEmptyDList a #

stimes :: Integral b => b -> NonEmptyDList a -> NonEmptyDList a #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Semigroup b => Semigroup (a -> b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a -> b) -> (a -> b) -> a -> b #

sconcat :: NonEmpty (a -> b) -> a -> b #

stimes :: Integral b0 => b0 -> (a -> b) -> a -> b #

Semigroup (Either a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Either

Methods

(<>) :: Either a b -> Either a b -> Either a b #

sconcat :: NonEmpty (Either a b) -> Either a b #

stimes :: Integral b0 => b0 -> Either a b -> Either a b #

(Semigroup a, Semigroup b) => Semigroup (a, b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b) -> (a, b) -> (a, b) #

sconcat :: NonEmpty (a, b) -> (a, b) #

stimes :: Integral b0 => b0 -> (a, b) -> (a, b) #

Semigroup (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a #

stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #

Applicative f => Semigroup (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Traversed a f -> Traversed a f -> Traversed a f #

sconcat :: NonEmpty (Traversed a f) -> Traversed a f #

stimes :: Integral b => b -> Traversed a f -> Traversed a f #

Monad m => Semigroup (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m #

sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m #

stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #

Ord k => Semigroup (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

(<>) :: Map k v -> Map k v -> Map k v #

sconcat :: NonEmpty (Map k v) -> Map k v #

stimes :: Integral b => b -> Map k v -> Map k v #

Semigroup (Proxy s)

Since: base-4.9.0.0

Instance details

Defined in Data.Proxy

Methods

(<>) :: Proxy s -> Proxy s -> Proxy s #

sconcat :: NonEmpty (Proxy s) -> Proxy s #

stimes :: Integral b => b -> Proxy s -> Proxy s #

Measured v a => Semigroup (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Methods

(<>) :: FingerTree v a -> FingerTree v a -> FingerTree v a #

sconcat :: NonEmpty (FingerTree v a) -> FingerTree v a #

stimes :: Integral b => b -> FingerTree v a -> FingerTree v a #

(OrderedField n, Metric v) => Semigroup (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: Trail v n -> Trail v n -> Trail v n #

sconcat :: NonEmpty (Trail v n) -> Trail v n #

stimes :: Integral b => b -> Trail v n -> Trail v n #

(Additive v, Num n) => Semigroup (Transformation v n) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: Transformation v n -> Transformation v n -> Transformation v n #

sconcat :: NonEmpty (Transformation v n) -> Transformation v n #

stimes :: Integral b => b -> Transformation v n -> Transformation v n #

(Additive v, Ord n) => Semigroup (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(<>) :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n #

sconcat :: NonEmpty (BoundingBox v n) -> BoundingBox v n #

stimes :: Integral b => b -> BoundingBox v n -> BoundingBox v n #

Semigroup (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

(<>) :: Path v n -> Path v n -> Path v n #

sconcat :: NonEmpty (Path v n) -> Path v n #

stimes :: Integral b => b -> Path v n -> Path v n #

Typeable n => Semigroup (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

(<>) :: Style v n -> Style v n -> Style v n #

sconcat :: NonEmpty (Style v n) -> Style v n #

stimes :: Integral b => b -> Style v n -> Style v n #

(Eq k, Hashable k) => Semigroup (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(<>) :: HashMap k v -> HashMap k v -> HashMap k v #

sconcat :: NonEmpty (HashMap k v) -> HashMap k v #

stimes :: Integral b => b -> HashMap k v -> HashMap k v #

Ord n => Semigroup (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Methods

(<>) :: Envelope v n -> Envelope v n -> Envelope v n #

sconcat :: NonEmpty (Envelope v n) -> Envelope v n #

stimes :: Integral b => b -> Envelope v n -> Envelope v n #

Semigroup a => Semigroup (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(<>) :: Measured n a -> Measured n a -> Measured n a #

sconcat :: NonEmpty (Measured n a) -> Measured n a #

stimes :: Integral b => b -> Measured n a -> Measured n a #

Typeable n => Semigroup (Attribute v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

(<>) :: Attribute v n -> Attribute v n -> Attribute v n #

sconcat :: NonEmpty (Attribute v n) -> Attribute v n #

stimes :: Integral b => b -> Attribute v n -> Attribute v n #

Ord n => Semigroup (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Methods

(<>) :: Trace v n -> Trace v n -> Trace v n #

sconcat :: NonEmpty (Trace v n) -> Trace v n #

stimes :: Integral b => b -> Trace v n -> Trace v n #

Semigroup (a :-: a) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: (a :-: a) -> (a :-: a) -> a :-: a #

sconcat :: NonEmpty (a :-: a) -> a :-: a #

stimes :: Integral b => b -> (a :-: a) -> a :-: a #

(Ord n, Floating n, Metric v) => Semigroup (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: SegTree v n -> SegTree v n -> SegTree v n #

sconcat :: NonEmpty (SegTree v n) -> SegTree v n #

stimes :: Integral b => b -> SegTree v n -> SegTree v n #

(Metric v, OrderedField n) => Semigroup (OffsetEnvelope v n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: OffsetEnvelope v n -> OffsetEnvelope v n -> OffsetEnvelope v n #

sconcat :: NonEmpty (OffsetEnvelope v n) -> OffsetEnvelope v n #

stimes :: Integral b => b -> OffsetEnvelope v n -> OffsetEnvelope v n #

Semigroup (Parser i a) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(<>) :: Parser i a -> Parser i a -> Parser i a #

sconcat :: NonEmpty (Parser i a) -> Parser i a #

stimes :: Integral b => b -> Parser i a -> Parser i a #

Semigroup a => Semigroup (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Op a b -> Op a b -> Op a b #

sconcat :: NonEmpty (Op a b) -> Op a b #

stimes :: Integral b0 => b0 -> Op a b -> Op a b #

Semigroup (f a) => Semigroup (Indexing f a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(<>) :: Indexing f a -> Indexing f a -> Indexing f a #

sconcat :: NonEmpty (Indexing f a) -> Indexing f a #

stimes :: Integral b => b -> Indexing f a -> Indexing f a #

(Additive v, Ord n) => Semigroup (NonEmptyBoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(<>) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n #

sconcat :: NonEmpty (NonEmptyBoundingBox v n) -> NonEmptyBoundingBox v n #

stimes :: Integral b => b -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n #

(Num n, Additive v) => Semigroup (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n #

sconcat :: NonEmpty (TotalOffset v n) -> TotalOffset v n #

stimes :: Integral b => b -> TotalOffset v n -> TotalOffset v n #

(Contravariant f, Applicative f) => Semigroup (Folding f a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Folding f a -> Folding f a -> Folding f a #

sconcat :: NonEmpty (Folding f a) -> Folding f a #

stimes :: Integral b => b -> Folding f a -> Folding f a #

Semigroup (Deepening i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(<>) :: Deepening i a -> Deepening i a -> Deepening i a #

sconcat :: NonEmpty (Deepening i a) -> Deepening i a #

stimes :: Integral b => b -> Deepening i a -> Deepening i a #

Apply f => Semigroup (TraversedF a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: TraversedF a f -> TraversedF a f -> TraversedF a f #

sconcat :: NonEmpty (TraversedF a f) -> TraversedF a f #

stimes :: Integral b => b -> TraversedF a f -> TraversedF a f #

(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) #

sconcat :: NonEmpty (a, b, c) -> (a, b, c) #

stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) #

Semigroup (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a #

stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

Semigroup a => Semigroup (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

(<>) :: Const a b -> Const a b -> Const a b #

sconcat :: NonEmpty (Const a b) -> Const a b #

stimes :: Integral b0 => b0 -> Const a b -> Const a b #

Alternative f => Semigroup (Alt f a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Alt f a -> Alt f a -> Alt f a #

sconcat :: NonEmpty (Alt f a) -> Alt f a #

stimes :: Integral b => b -> Alt f a -> Alt f a #

Semigroup a => Semigroup (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(<>) :: Tagged s a -> Tagged s a -> Tagged s a #

sconcat :: NonEmpty (Tagged s a) -> Tagged s a #

stimes :: Integral b => b -> Tagged s a -> Tagged s a #

Semigroup m => Semigroup (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Methods

(<>) :: Query v n m -> Query v n m -> Query v n m #

sconcat :: NonEmpty (Query v n m) -> Query v n m #

stimes :: Integral b => b -> Query v n m -> Query v n m #

Semigroup (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(<>) :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

sconcat :: NonEmpty (Render Cairo V2 Double) -> Render Cairo V2 Double #

stimes :: Integral b => b -> Render Cairo V2 Double -> Render Cairo V2 Double #

Semigroup (Render NullBackend v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n #

sconcat :: NonEmpty (Render NullBackend v n) -> Render NullBackend v n #

stimes :: Integral b => b -> Render NullBackend v n -> Render NullBackend v n #

(OrderedField n, Metric v) => Semigroup (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n #

sconcat :: NonEmpty (Trail' Line v n) -> Trail' Line v n #

stimes :: Integral b => b -> Trail' Line v n -> Trail' Line v n #

Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s) 
Instance details

Defined in Data.Reflection

Methods

(<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s #

sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s #

stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #

ArrowPlus p => Semigroup (Tambara p a b) 
Instance details

Defined in Data.Profunctor.Strong

Methods

(<>) :: Tambara p a b -> Tambara p a b -> Tambara p a b #

sconcat :: NonEmpty (Tambara p a b) -> Tambara p a b #

stimes :: Integral b0 => b0 -> Tambara p a b -> Tambara p a b #

Semigroup (Deformation v v n) 
Instance details

Defined in Diagrams.Deform

Methods

(<>) :: Deformation v v n -> Deformation v v n -> Deformation v v n #

sconcat :: NonEmpty (Deformation v v n) -> Deformation v v n #

stimes :: Integral b => b -> Deformation v v n -> Deformation v v n #

(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) #

stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) #

(Metric v, OrderedField n, Semigroup m) => Semigroup (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

sconcat :: NonEmpty (QDiagram b v n m) -> QDiagram b v n m #

stimes :: Integral b0 => b0 -> QDiagram b v n m -> QDiagram b v n m #

Semigroup (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m #

sconcat :: NonEmpty (SubMap b v n m) -> SubMap b v n m #

stimes :: Integral b0 => b0 -> SubMap b v n m -> SubMap b v n m #

(Semigroup u, Action d u) => Semigroup (DUALTreeU d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTreeU d u a l -> DUALTreeU d u a l -> DUALTreeU d u a l #

sconcat :: NonEmpty (DUALTreeU d u a l) -> DUALTreeU d u a l #

stimes :: Integral b => b -> DUALTreeU d u a l -> DUALTreeU d u a l #

(Semigroup u, Action d u) => Semigroup (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTree d u a l -> DUALTree d u a l -> DUALTree d u a l #

sconcat :: NonEmpty (DUALTree d u a l) -> DUALTree d u a l #

stimes :: Integral b => b -> DUALTree d u a l -> DUALTree d u a l #

(Action d u, Semigroup u) => Semigroup (DUALTreeNE d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> DUALTreeNE d u a l #

sconcat :: NonEmpty (DUALTreeNE d u a l) -> DUALTreeNE d u a l #

stimes :: Integral b => b -> DUALTreeNE d u a l -> DUALTreeNE d u a l #

(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) #

stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) #

Contravariant g => Semigroup (BazaarT p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<>) :: BazaarT p g a b t -> BazaarT p g a b t -> BazaarT p g a b t #

sconcat :: NonEmpty (BazaarT p g a b t) -> BazaarT p g a b t #

stimes :: Integral b0 => b0 -> BazaarT p g a b t -> BazaarT p g a b t #

Contravariant g => Semigroup (BazaarT1 p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<>) :: BazaarT1 p g a b t -> BazaarT1 p g a b t -> BazaarT1 p g a b t #

sconcat :: NonEmpty (BazaarT1 p g a b t) -> BazaarT1 p g a b t #

stimes :: Integral b0 => b0 -> BazaarT1 p g a b t -> BazaarT1 p g a b t #

class Semigroup a => Monoid a where #

The class of monoids (types with an associative binary operation that - has an identity). Instances should satisfy the following laws:

The method names refer to the monoid of lists under concatenation, + results see sequence_.

Instances
Traversable []

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> [a] -> f [b] #

sequenceA :: Applicative f => [f a] -> f [a] #

mapM :: Monad m => (a -> m b) -> [a] -> m [b] #

sequence :: Monad m => [m a] -> m [a] #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) #

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) #

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

Traversable Par1

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Par1 a -> f (Par1 b) #

sequenceA :: Applicative f => Par1 (f a) -> f (Par1 a) #

mapM :: Monad m => (a -> m b) -> Par1 a -> m (Par1 b) #

sequence :: Monad m => Par1 (m a) -> m (Par1 a) #

Traversable IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

traverse :: Applicative f => (a -> f b) -> IResult a -> f (IResult b) #

sequenceA :: Applicative f => IResult (f a) -> f (IResult a) #

mapM :: Monad m => (a -> m b) -> IResult a -> m (IResult b) #

sequence :: Monad m => IResult (m a) -> m (IResult a) #

Traversable Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Result a -> f (Result b) #

sequenceA :: Applicative f => Result (f a) -> f (Result a) #

mapM :: Monad m => (a -> m b) -> Result a -> m (Result b) #

sequence :: Monad m => Result (m a) -> m (Result a) #

Traversable Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

traverse :: Applicative f => (a -> f b) -> Complex a -> f (Complex b) #

sequenceA :: Applicative f => Complex (f a) -> f (Complex a) #

mapM :: Monad m => (a -> m b) -> Complex a -> m (Complex b) #

sequence :: Monad m => Complex (m a) -> m (Complex a) #

Traversable Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Min a -> f (Min b) #

sequenceA :: Applicative f => Min (f a) -> f (Min a) #

mapM :: Monad m => (a -> m b) -> Min a -> m (Min b) #

sequence :: Monad m => Min (m a) -> m (Min a) #

Traversable Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Max a -> f (Max b) #

sequenceA :: Applicative f => Max (f a) -> f (Max a) #

mapM :: Monad m => (a -> m b) -> Max a -> m (Max b) #

sequence :: Monad m => Max (m a) -> m (Max a) #

Traversable First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> First a -> f (First b) #

sequenceA :: Applicative f => First (f a) -> f (First a) #

mapM :: Monad m => (a -> m b) -> First a -> m (First b) #

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) #

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) #

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a -> f b) -> Option a -> f (Option b) #

sequenceA :: Applicative f => Option (f a) -> f (Option a) #

mapM :: Monad m => (a -> m b) -> Option a -> m (Option b) #

sequence :: Monad m => Option (m a) -> m (Option a) #

Traversable ZipList

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> ZipList a -> f (ZipList b) #

sequenceA :: Applicative f => ZipList (f a) -> f (ZipList a) #

mapM :: Monad m => (a -> m b) -> ZipList a -> m (ZipList b) #

sequence :: Monad m => ZipList (m a) -> m (ZipList a) #

Traversable Identity

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Identity a -> f (Identity b) #

sequenceA :: Applicative f => Identity (f a) -> f (Identity a) #

mapM :: Monad m => (a -> m b) -> Identity a -> m (Identity b) #

sequence :: Monad m => Identity (m a) -> m (Identity a) #

Traversable First

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> First a -> f (First b) #

sequenceA :: Applicative f => First (f a) -> f (First a) #

mapM :: Monad m => (a -> m b) -> First a -> m (First b) #

sequence :: Monad m => First (m a) -> m (First a) #

Traversable Last

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Last a -> f (Last b) #

sequenceA :: Applicative f => Last (f a) -> f (Last a) #

mapM :: Monad m => (a -> m b) -> Last a -> m (Last b) #

sequence :: Monad m => Last (m a) -> m (Last a) #

Traversable Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Dual a -> f (Dual b) #

sequenceA :: Applicative f => Dual (f a) -> f (Dual a) #

mapM :: Monad m => (a -> m b) -> Dual a -> m (Dual b) #

sequence :: Monad m => Dual (m a) -> m (Dual a) #

Traversable Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Sum a -> f (Sum b) #

sequenceA :: Applicative f => Sum (f a) -> f (Sum a) #

mapM :: Monad m => (a -> m b) -> Sum a -> m (Sum b) #

sequence :: Monad m => Sum (m a) -> m (Sum a) #

Traversable Product

Since: base-4.8.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Product a -> f (Product b) #

sequenceA :: Applicative f => Product (f a) -> f (Product a) #

mapM :: Monad m => (a -> m b) -> Product a -> m (Product b) #

sequence :: Monad m => Product (m a) -> m (Product a) #

Traversable Down

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Down a -> f (Down b) #

sequenceA :: Applicative f => Down (f a) -> f (Down a) #

mapM :: Monad m => (a -> m b) -> Down a -> m (Down b) #

sequence :: Monad m => Down (m a) -> m (Down a) #

Traversable NonEmpty

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> NonEmpty a -> f (NonEmpty b) #

sequenceA :: Applicative f => NonEmpty (f a) -> f (NonEmpty a) #

mapM :: Monad m => (a -> m b) -> NonEmpty a -> m (NonEmpty b) #

sequence :: Monad m => NonEmpty (m a) -> m (NonEmpty a) #

Traversable IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

traverse :: Applicative f => (a -> f b) -> IntMap a -> f (IntMap b) #

sequenceA :: Applicative f => IntMap (f a) -> f (IntMap a) #

mapM :: Monad m => (a -> m b) -> IntMap a -> m (IntMap b) #

sequence :: Monad m => IntMap (m a) -> m (IntMap a) #

Traversable Tree 
Instance details

Defined in Data.Tree

Methods

traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b) #

sequenceA :: Applicative f => Tree (f a) -> f (Tree a) #

mapM :: Monad m => (a -> m b) -> Tree a -> m (Tree b) #

sequence :: Monad m => Tree (m a) -> m (Tree a) #

Traversable Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Seq a -> f (Seq b) #

sequenceA :: Applicative f => Seq (f a) -> f (Seq a) #

mapM :: Monad m => (a -> m b) -> Seq a -> m (Seq b) #

sequence :: Monad m => Seq (m a) -> m (Seq a) #

Traversable FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> FingerTree a -> f (FingerTree b) #

sequenceA :: Applicative f => FingerTree (f a) -> f (FingerTree a) #

mapM :: Monad m => (a -> m b) -> FingerTree a -> m (FingerTree b) #

sequence :: Monad m => FingerTree (m a) -> m (FingerTree a) #

Traversable Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Digit a -> f (Digit b) #

sequenceA :: Applicative f => Digit (f a) -> f (Digit a) #

mapM :: Monad m => (a -> m b) -> Digit a -> m (Digit b) #

sequence :: Monad m => Digit (m a) -> m (Digit a) #

Traversable Node 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Node a -> f (Node b) #

sequenceA :: Applicative f => Node (f a) -> f (Node a) #

mapM :: Monad m => (a -> m b) -> Node a -> m (Node b) #

sequence :: Monad m => Node (m a) -> m (Node a) #

Traversable Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Elem a -> f (Elem b) #

sequenceA :: Applicative f => Elem (f a) -> f (Elem a) #

mapM :: Monad m => (a -> m b) -> Elem a -> m (Elem b) #

sequence :: Monad m => Elem (m a) -> m (Elem a) #

Traversable ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> ViewL a -> f (ViewL b) #

sequenceA :: Applicative f => ViewL (f a) -> f (ViewL a) #

mapM :: Monad m => (a -> m b) -> ViewL a -> m (ViewL b) #

sequence :: Monad m => ViewL (m a) -> m (ViewL a) #

Traversable ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

traverse :: Applicative f => (a -> f b) -> ViewR a -> f (ViewR b) #

sequenceA :: Applicative f => ViewR (f a) -> f (ViewR a) #

mapM :: Monad m => (a -> m b) -> ViewR a -> m (ViewR b) #

sequence :: Monad m => ViewR (m a) -> m (ViewR a) #

Traversable Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

traverse :: Applicative f => (a -> f b) -> Interval a -> f (Interval b) #

sequenceA :: Applicative f => Interval (f a) -> f (Interval a) #

mapM :: Monad m => (a -> m b) -> Interval a -> m (Interval b) #

sequence :: Monad m => Interval (m a) -> m (Interval a) #

Traversable SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

traverse :: Applicative f => (a -> f b) -> SmallArray a -> f (SmallArray b) #

sequenceA :: Applicative f => SmallArray (f a) -> f (SmallArray a) #

mapM :: Monad m => (a -> m b) -> SmallArray a -> m (SmallArray b) #

sequence :: Monad m => SmallArray (m a) -> m (SmallArray a) #

Traversable Array 
Instance details

Defined in Data.Primitive.Array

Methods

traverse :: Applicative f => (a -> f b) -> Array a -> f (Array b) #

sequenceA :: Applicative f => Array (f a) -> f (Array a) #

mapM :: Monad m => (a -> m b) -> Array a -> m (Array b) #

sequence :: Monad m => Array (m a) -> m (Array a) #

Traversable Vector 
Instance details

Defined in Data.Vector

Methods

traverse :: Applicative f => (a -> f b) -> Vector a -> f (Vector b) #

sequenceA :: Applicative f => Vector (f a) -> f (Vector a) #

mapM :: Monad m => (a -> m b) -> Vector a -> m (Vector b) #

sequence :: Monad m => Vector (m a) -> m (Vector a) #

Traversable Root 
Instance details

Defined in Numeric.RootFinding

Methods

traverse :: Applicative f => (a -> f b) -> Root a -> f (Root b) #

sequenceA :: Applicative f => Root (f a) -> f (Root a) #

mapM :: Monad m => (a -> m b) -> Root a -> m (Root b) #

sequence :: Monad m => Root (m a) -> m (Root a) #

Traversable Log 
Instance details

Defined in Numeric.Log

Methods

traverse :: Applicative f => (a -> f b) -> Log a -> f (Log b) #

sequenceA :: Applicative f => Log (f a) -> f (Log a) #

mapM :: Monad m => (a -> m b) -> Log a -> m (Log b) #

sequence :: Monad m => Log (m a) -> m (Log a) #

Traversable V2 
Instance details

Defined in Linear.V2

Methods

traverse :: Applicative f => (a -> f b) -> V2 a -> f (V2 b) #

sequenceA :: Applicative f => V2 (f a) -> f (V2 a) #

mapM :: Monad m => (a -> m b) -> V2 a -> m (V2 b) #

sequence :: Monad m => V2 (m a) -> m (V2 a) #

Traversable Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

traverse :: Applicative f => (a -> f b) -> Polar a -> f (Polar b) #

sequenceA :: Applicative f => Polar (f a) -> f (Polar a) #

mapM :: Monad m => (a -> m b) -> Polar a -> m (Polar b) #

sequence :: Monad m => Polar (m a) -> m (Polar a) #

Traversable V3 
Instance details

Defined in Linear.V3

Methods

traverse :: Applicative f => (a -> f b) -> V3 a -> f (V3 b) #

sequenceA :: Applicative f => V3 (f a) -> f (V3 a) #

mapM :: Monad m => (a -> m b) -> V3 a -> m (V3 b) #

sequence :: Monad m => V3 (m a) -> m (V3 a) #

Traversable V1 
Instance details

Defined in Linear.V1

Methods

traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) #

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) #

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable Plucker 
Instance details

Defined in Linear.Plucker

Methods

traverse :: Applicative f => (a -> f b) -> Plucker a -> f (Plucker b) #

sequenceA :: Applicative f => Plucker (f a) -> f (Plucker a) #

mapM :: Monad m => (a -> m b) -> Plucker a -> m (Plucker b) #

sequence :: Monad m => Plucker (m a) -> m (Plucker a) #

Traversable Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

traverse :: Applicative f => (a -> f b) -> Quaternion a -> f (Quaternion b) #

sequenceA :: Applicative f => Quaternion (f a) -> f (Quaternion a) #

mapM :: Monad m => (a -> m b) -> Quaternion a -> m (Quaternion b) #

sequence :: Monad m => Quaternion (m a) -> m (Quaternion a) #

Traversable V0 
Instance details

Defined in Linear.V0

Methods

traverse :: Applicative f => (a -> f b) -> V0 a -> f (V0 b) #

sequenceA :: Applicative f => V0 (f a) -> f (V0 a) #

mapM :: Monad m => (a -> m b) -> V0 a -> m (V0 b) #

sequence :: Monad m => V0 (m a) -> m (V0 a) #

Traversable V4 
Instance details

Defined in Linear.V4

Methods

traverse :: Applicative f => (a -> f b) -> V4 a -> f (V4 b) #

sequenceA :: Applicative f => V4 (f a) -> f (V4 a) #

mapM :: Monad m => (a -> m b) -> V4 a -> m (V4 b) #

sequence :: Monad m => V4 (m a) -> m (V4 a) #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Traversable (V1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> V1 a -> f (V1 b) #

sequenceA :: Applicative f => V1 (f a) -> f (V1 a) #

mapM :: Monad m => (a -> m b) -> V1 a -> m (V1 b) #

sequence :: Monad m => V1 (m a) -> m (V1 a) #

Traversable (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> U1 a -> f (U1 b) #

sequenceA :: Applicative f => U1 (f a) -> f (U1 a) #

mapM :: Monad m => (a -> m b) -> U1 a -> m (U1 b) #

sequence :: Monad m => U1 (m a) -> m (U1 a) #

Traversable ((,) a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> (a, a0) -> f (a, b) #

sequenceA :: Applicative f => (a, f a0) -> f (a, a0) #

mapM :: Monad m => (a0 -> m b) -> (a, a0) -> m (a, b) #

sequence :: Monad m => (a, m a0) -> m (a, a0) #

Traversable (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

traverse :: Applicative f => (a -> f b) -> HashMap k a -> f (HashMap k b) #

sequenceA :: Applicative f => HashMap k (f a) -> f (HashMap k a) #

mapM :: Monad m => (a -> m b) -> HashMap k a -> m (HashMap k b) #

sequence :: Monad m => HashMap k (m a) -> m (HashMap k a) #

Traversable (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

traverse :: Applicative f => (a -> f b) -> Map k a -> f (Map k b) #

sequenceA :: Applicative f => Map k (f a) -> f (Map k a) #

mapM :: Monad m => (a -> m b) -> Map k a -> m (Map k b) #

sequence :: Monad m => Map k (m a) -> m (Map k a) #

Ix i => Traversable (Array i)

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Array i a -> f (Array i b) #

sequenceA :: Applicative f => Array i (f a) -> f (Array i a) #

mapM :: Monad m => (a -> m b) -> Array i a -> m (Array i b) #

sequence :: Monad m => Array i (m a) -> m (Array i a) #

Traversable (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

traverse :: Applicative f => (a0 -> f b) -> Arg a a0 -> f (Arg a b) #

sequenceA :: Applicative f => Arg a (f a0) -> f (Arg a a0) #

mapM :: Monad m => (a0 -> m b) -> Arg a a0 -> m (Arg a b) #

sequence :: Monad m => Arg a (m a0) -> m (Arg a a0) #

Traversable (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) #

sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) #

mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) #

sequence :: Monad m => Proxy (m a) -> m (Proxy a) #

Traversable f => Traversable (MaybeT f) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

traverse :: Applicative f0 => (a -> f0 b) -> MaybeT f a -> f0 (MaybeT f b) #

sequenceA :: Applicative f0 => MaybeT f (f0 a) -> f0 (MaybeT f a) #

mapM :: Monad m => (a -> m b) -> MaybeT f a -> m (MaybeT f b) #

sequence :: Monad m => MaybeT f (m a) -> m (MaybeT f a) #

(Generic1 f, Traversable (Rep1 f)) => Traversable (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Generically1 f a -> f0 (Generically1 f b) #

sequenceA :: Applicative f0 => Generically1 f (f0 a) -> f0 (Generically1 f a) #

mapM :: Monad m => (a -> m b) -> Generically1 f a -> m (Generically1 f b) #

sequence :: Monad m => Generically1 f (m a) -> m (Generically1 f a) #

Traversable f => Traversable (ListT f) 
Instance details

Defined in Control.Monad.Trans.List

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ListT f a -> f0 (ListT f b) #

sequenceA :: Applicative f0 => ListT f (f0 a) -> f0 (ListT f a) #

mapM :: Monad m => (a -> m b) -> ListT f a -> m (ListT f b) #

sequence :: Monad m => ListT f (m a) -> m (ListT f a) #

Traversable (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

traverse :: Applicative f => (a -> f b) -> Categorical p a -> f (Categorical p b) #

sequenceA :: Applicative f => Categorical p (f a) -> f (Categorical p a) #

mapM :: Monad m => (a -> m b) -> Categorical p a -> m (Categorical p b) #

sequence :: Monad m => Categorical p (m a) -> m (Categorical p a) #

Traversable (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

traverse :: Applicative f => (a0 -> f b) -> ListF a a0 -> f (ListF a b) #

sequenceA :: Applicative f => ListF a (f a0) -> f (ListF a a0) #

mapM :: Monad m => (a0 -> m b) -> ListF a a0 -> m (ListF a b) #

sequence :: Monad m => ListF a (m a0) -> m (ListF a a0) #

Traversable f => Traversable (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Cofree f a -> f0 (Cofree f b) #

sequenceA :: Applicative f0 => Cofree f (f0 a) -> f0 (Cofree f a) #

mapM :: Monad m => (a -> m b) -> Cofree f a -> m (Cofree f b) #

sequence :: Monad m => Cofree f (m a) -> m (Cofree f a) #

Traversable f => Traversable (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Free f a -> f0 (Free f b) #

sequenceA :: Applicative f0 => Free f (f0 a) -> f0 (Free f a) #

mapM :: Monad m => (a -> m b) -> Free f a -> m (Free f b) #

sequence :: Monad m => Free f (m a) -> m (Free f a) #

Traversable (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

traverse :: Applicative f => (a0 -> f b) -> NonEmptyF a a0 -> f (NonEmptyF a b) #

sequenceA :: Applicative f => NonEmptyF a (f a0) -> f (NonEmptyF a a0) #

mapM :: Monad m => (a0 -> m b) -> NonEmptyF a a0 -> m (NonEmptyF a b) #

sequence :: Monad m => NonEmptyF a (m a0) -> m (NonEmptyF a a0) #

Traversable f => Traversable (Point f) 
Instance details

Defined in Linear.Affine

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Point f a -> f0 (Point f b) #

sequenceA :: Applicative f0 => Point f (f0 a) -> f0 (Point f a) #

mapM :: Monad m => (a -> m b) -> Point f a -> m (Point f b) #

sequence :: Monad m => Point f (m a) -> m (Point f a) #

Traversable (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

traverse :: Applicative f => (a -> f b) -> Level i a -> f (Level i b) #

sequenceA :: Applicative f => Level i (f a) -> f (Level i a) #

mapM :: Monad m => (a -> m b) -> Level i a -> m (Level i b) #

sequence :: Monad m => Level i (m a) -> m (Level i a) #

Traversable f => Traversable (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Yoneda f a -> f0 (Yoneda f b) #

sequenceA :: Applicative f0 => Yoneda f (f0 a) -> f0 (Yoneda f a) #

mapM :: Monad m => (a -> m b) -> Yoneda f a -> m (Yoneda f b) #

sequence :: Monad m => Yoneda f (m a) -> m (Yoneda f a) #

Traversable f => Traversable (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Rec1 f a -> f0 (Rec1 f b) #

sequenceA :: Applicative f0 => Rec1 f (f0 a) -> f0 (Rec1 f a) #

mapM :: Monad m => (a -> m b) -> Rec1 f a -> m (Rec1 f b) #

sequence :: Monad m => Rec1 f (m a) -> m (Rec1 f a) #

Traversable (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Traversable (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Traversable (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Traversable (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Traversable (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Traversable (URec (Ptr ()) :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) #

sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) #

mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) #

sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) #

Traversable (Const m :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Const m a -> f (Const m b) #

sequenceA :: Applicative f => Const m (f a) -> f (Const m a) #

mapM :: Monad m0 => (a -> m0 b) -> Const m a -> m0 (Const m b) #

sequence :: Monad m0 => Const m (m0 a) -> m0 (Const m a) #

Traversable f => Traversable (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Ap f a -> f0 (Ap f b) #

sequenceA :: Applicative f0 => Ap f (f0 a) -> f0 (Ap f a) #

mapM :: Monad m => (a -> m b) -> Ap f a -> m (Ap f b) #

sequence :: Monad m => Ap f (m a) -> m (Ap f a) #

Traversable f => Traversable (Alt f)

Since: base-4.12.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Alt f a -> f0 (Alt f b) #

sequenceA :: Applicative f0 => Alt f (f0 a) -> f0 (Alt f a) #

mapM :: Monad m => (a -> m b) -> Alt f a -> m (Alt f b) #

sequence :: Monad m => Alt f (m a) -> m (Alt f a) #

Bitraversable p => Traversable (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

traverse :: Applicative f => (a -> f b) -> Join p a -> f (Join p b) #

sequenceA :: Applicative f => Join p (f a) -> f (Join p a) #

mapM :: Monad m => (a -> m b) -> Join p a -> m (Join p b) #

sequence :: Monad m => Join p (m a) -> m (Join p a) #

Bitraversable p => Traversable (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

traverse :: Applicative f => (a -> f b) -> Fix p a -> f (Fix p b) #

sequenceA :: Applicative f => Fix p (f a) -> f (Fix p a) #

mapM :: Monad m => (a -> m b) -> Fix p a -> m (Fix p b) #

sequence :: Monad m => Fix p (m a) -> m (Fix p a) #

Traversable f => Traversable (IdentityT f) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) #

mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) #

sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #

Traversable f => Traversable (ExceptT e f) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ExceptT e f a -> f0 (ExceptT e f b) #

sequenceA :: Applicative f0 => ExceptT e f (f0 a) -> f0 (ExceptT e f a) #

mapM :: Monad m => (a -> m b) -> ExceptT e f a -> m (ExceptT e f b) #

sequence :: Monad m => ExceptT e f (m a) -> m (ExceptT e f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable f => Traversable (ErrorT e f) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

traverse :: Applicative f0 => (a -> f0 b) -> ErrorT e f a -> f0 (ErrorT e f b) #

sequenceA :: Applicative f0 => ErrorT e f (f0 a) -> f0 (ErrorT e f a) #

mapM :: Monad m => (a -> m b) -> ErrorT e f a -> m (ErrorT e f b) #

sequence :: Monad m => ErrorT e f (m a) -> m (ErrorT e f a) #

Traversable f => Traversable (WriterT w f) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

traverse :: Applicative f0 => (a -> f0 b) -> WriterT w f a -> f0 (WriterT w f b) #

sequenceA :: Applicative f0 => WriterT w f (f0 a) -> f0 (WriterT w f a) #

mapM :: Monad m => (a -> m b) -> WriterT w f a -> m (WriterT w f b) #

sequence :: Monad m => WriterT w f (m a) -> m (WriterT w f a) #

Traversable (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

traverse :: Applicative f => (a0 -> f b) -> Forget r a a0 -> f (Forget r a b) #

sequenceA :: Applicative f => Forget r a (f a0) -> f (Forget r a a0) #

mapM :: Monad m => (a0 -> m b) -> Forget r a a0 -> m (Forget r a b) #

sequence :: Monad m => Forget r a (m a0) -> m (Forget r a a0) #

Traversable (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

traverse :: Applicative f => (a -> f b) -> Tagged s a -> f (Tagged s b) #

sequenceA :: Applicative f => Tagged s (f a) -> f (Tagged s a) #

mapM :: Monad m => (a -> m b) -> Tagged s a -> m (Tagged s b) #

sequence :: Monad m => Tagged s (m a) -> m (Tagged s a) #

Traversable f => Traversable (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Backwards f a -> f0 (Backwards f b) #

sequenceA :: Applicative f0 => Backwards f (f0 a) -> f0 (Backwards f a) #

mapM :: Monad m => (a -> m b) -> Backwards f a -> m (Backwards f b) #

sequence :: Monad m => Backwards f (m a) -> m (Backwards f a) #

(Traversable f, Traversable w) => Traversable (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a -> f0 b) -> CofreeT f w a -> f0 (CofreeT f w b) #

sequenceA :: Applicative f0 => CofreeT f w (f0 a) -> f0 (CofreeT f w a) #

mapM :: Monad m => (a -> m b) -> CofreeT f w a -> m (CofreeT f w b) #

sequence :: Monad m => CofreeT f w (m a) -> m (CofreeT f w a) #

Traversable f => Traversable (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> CofreeF f a a0 -> f0 (CofreeF f a b) #

sequenceA :: Applicative f0 => CofreeF f a (f0 a0) -> f0 (CofreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> CofreeF f a a0 -> m (CofreeF f a b) #

sequence :: Monad m => CofreeF f a (m a0) -> m (CofreeF f a a0) #

(Monad m, Traversable m, Traversable f) => Traversable (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a -> f0 b) -> FreeT f m a -> f0 (FreeT f m b) #

sequenceA :: Applicative f0 => FreeT f m (f0 a) -> f0 (FreeT f m a) #

mapM :: Monad m0 => (a -> m0 b) -> FreeT f m a -> m0 (FreeT f m b) #

sequence :: Monad m0 => FreeT f m (m0 a) -> m0 (FreeT f m a) #

Traversable f => Traversable (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> FreeF f a a0 -> f0 (FreeF f a b) #

sequenceA :: Applicative f0 => FreeF f a (f0 a0) -> f0 (FreeF f a a0) #

mapM :: Monad m => (a0 -> m b) -> FreeF f a a0 -> m (FreeF f a b) #

sequence :: Monad m => FreeF f a (m a0) -> m (FreeF f a a0) #

Traversable (V n) 
Instance details

Defined in Linear.V

Methods

traverse :: Applicative f => (a -> f b) -> V n a -> f (V n b) #

sequenceA :: Applicative f => V n (f a) -> f (V n a) #

mapM :: Monad m => (a -> m b) -> V n a -> m (V n b) #

sequence :: Monad m => V n (m a) -> m (V n a) #

Traversable f => Traversable (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a -> f0 b0) -> AlongsideLeft f b a -> f0 (AlongsideLeft f b b0) #

sequenceA :: Applicative f0 => AlongsideLeft f b (f0 a) -> f0 (AlongsideLeft f b a) #

mapM :: Monad m => (a -> m b0) -> AlongsideLeft f b a -> m (AlongsideLeft f b b0) #

sequence :: Monad m => AlongsideLeft f b (m a) -> m (AlongsideLeft f b a) #

Traversable f => Traversable (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> AlongsideRight f a a0 -> f0 (AlongsideRight f a b) #

sequenceA :: Applicative f0 => AlongsideRight f a (f0 a0) -> f0 (AlongsideRight f a a0) #

mapM :: Monad m => (a0 -> m b) -> AlongsideRight f a a0 -> m (AlongsideRight f a b) #

sequence :: Monad m => AlongsideRight f a (m a0) -> m (AlongsideRight f a a0) #

Traversable (K1 i c :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> K1 i c a -> f (K1 i c b) #

sequenceA :: Applicative f => K1 i c (f a) -> f (K1 i c a) #

mapM :: Monad m => (a -> m b) -> K1 i c a -> m (K1 i c b) #

sequence :: Monad m => K1 i c (m a) -> m (K1 i c a) #

(Traversable f, Traversable g) => Traversable (f :+: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

sequenceA :: Applicative f0 => (f :+: g) (f0 a) -> f0 ((f :+: g) a) #

mapM :: Monad m => (a -> m b) -> (f :+: g) a -> m ((f :+: g) b) #

sequence :: Monad m => (f :+: g) (m a) -> m ((f :+: g) a) #

(Traversable f, Traversable g) => Traversable (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

sequenceA :: Applicative f0 => (f :*: g) (f0 a) -> f0 ((f :*: g) a) #

mapM :: Monad m => (a -> m b) -> (f :*: g) a -> m ((f :*: g) b) #

sequence :: Monad m => (f :*: g) (m a) -> m ((f :*: g) a) #

(Traversable f, Traversable g) => Traversable (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Product f g a -> f0 (Product f g b) #

sequenceA :: Applicative f0 => Product f g (f0 a) -> f0 (Product f g a) #

mapM :: Monad m => (a -> m b) -> Product f g a -> m (Product f g b) #

sequence :: Monad m => Product f g (m a) -> m (Product f g a) #

(Traversable f, Traversable g) => Traversable (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

sequenceA :: Applicative f0 => Sum f g (f0 a) -> f0 (Sum f g a) #

mapM :: Monad m => (a -> m b) -> Sum f g a -> m (Sum f g b) #

sequence :: Monad m => Sum f g (m a) -> m (Sum f g a) #

Traversable (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

traverse :: Applicative f => (a -> f b0) -> Magma i t b a -> f (Magma i t b b0) #

sequenceA :: Applicative f => Magma i t b (f a) -> f (Magma i t b a) #

mapM :: Monad m => (a -> m b0) -> Magma i t b a -> m (Magma i t b b0) #

sequence :: Monad m => Magma i t b (m a) -> m (Magma i t b a) #

Traversable f => Traversable (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> M1 i c f a -> f0 (M1 i c f b) #

sequenceA :: Applicative f0 => M1 i c f (f0 a) -> f0 (M1 i c f a) #

mapM :: Monad m => (a -> m b) -> M1 i c f a -> m (M1 i c f b) #

sequence :: Monad m => M1 i c f (m a) -> m (M1 i c f a) #

(Traversable f, Traversable g) => Traversable (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) #

sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) #

mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) #

sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #

(Traversable f, Traversable g) => Traversable (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

traverse :: Applicative f0 => (a -> f0 b) -> Compose f g a -> f0 (Compose f g b) #

sequenceA :: Applicative f0 => Compose f g (f0 a) -> f0 (Compose f g a) #

mapM :: Monad m => (a -> m b) -> Compose f g a -> m (Compose f g b) #

sequence :: Monad m => Compose f g (m a) -> m (Compose f g a) #

Bitraversable p => Traversable (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

traverse :: Applicative f => (a0 -> f b) -> WrappedBifunctor p a a0 -> f (WrappedBifunctor p a b) #

sequenceA :: Applicative f => WrappedBifunctor p a (f a0) -> f (WrappedBifunctor p a a0) #

mapM :: Monad m => (a0 -> m b) -> WrappedBifunctor p a a0 -> m (WrappedBifunctor p a b) #

sequence :: Monad m => WrappedBifunctor p a (m a0) -> m (WrappedBifunctor p a a0) #

Traversable g => Traversable (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

traverse :: Applicative f => (a0 -> f b) -> Joker g a a0 -> f (Joker g a b) #

sequenceA :: Applicative f => Joker g a (f a0) -> f (Joker g a a0) #

mapM :: Monad m => (a0 -> m b) -> Joker g a a0 -> m (Joker g a b) #

sequence :: Monad m => Joker g a (m a0) -> m (Joker g a a0) #

Bitraversable p => Traversable (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

traverse :: Applicative f => (a0 -> f b) -> Flip p a a0 -> f (Flip p a b) #

sequenceA :: Applicative f => Flip p a (f a0) -> f (Flip p a a0) #

mapM :: Monad m => (a0 -> m b) -> Flip p a a0 -> m (Flip p a b) #

sequence :: Monad m => Flip p a (m a0) -> m (Flip p a a0) #

Traversable (Clown f a :: Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Clown f a a0 -> f0 (Clown f a b) #

sequenceA :: Applicative f0 => Clown f a (f0 a0) -> f0 (Clown f a a0) #

mapM :: Monad m => (a0 -> m b) -> Clown f a a0 -> m (Clown f a b) #

sequence :: Monad m => Clown f a (m a0) -> m (Clown f a a0) #

(Traversable f, Bitraversable p) => Traversable (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Tannen f p a a0 -> f0 (Tannen f p a b) #

sequenceA :: Applicative f0 => Tannen f p a (f0 a0) -> f0 (Tannen f p a a0) #

mapM :: Monad m => (a0 -> m b) -> Tannen f p a a0 -> m (Tannen f p a b) #

sequence :: Monad m => Tannen f p a (m a0) -> m (Tannen f p a a0) #

(Bitraversable p, Traversable g) => Traversable (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

traverse :: Applicative f0 => (a0 -> f0 b) -> Biff p f g a a0 -> f0 (Biff p f g a b) #

sequenceA :: Applicative f0 => Biff p f g a (f0 a0) -> f0 (Biff p f g a a0) #

mapM :: Monad m => (a0 -> m b) -> Biff p f g a a0 -> m (Biff p f g a b) #

sequence :: Monad m => Biff p f g a (m a0) -> m (Biff p f g a a0) #

class Semigroup a where #

The class of semigroups (types with an associative binary operation).

Instances should satisfy the associativity law:

Since: base-4.9.0.0

Methods

(<>) :: a -> a -> a infixr 6 #

An associative operation.

Instances
Semigroup Ordering

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Ordering -> Ordering -> Ordering #

sconcat :: NonEmpty Ordering -> Ordering #

stimes :: Integral b => b -> Ordering -> Ordering #

Semigroup ()

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: () -> () -> () #

sconcat :: NonEmpty () -> () #

stimes :: Integral b => b -> () -> () #

Semigroup ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString #

sconcat :: NonEmpty ByteString -> ByteString #

stimes :: Integral b => b -> ByteString -> ByteString #

Semigroup ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

(<>) :: ByteString -> ByteString -> ByteString #

sconcat :: NonEmpty ByteString -> ByteString #

stimes :: Integral b => b -> ByteString -> ByteString #

Semigroup Builder 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(<>) :: Builder -> Builder -> Builder #

sconcat :: NonEmpty Builder -> Builder #

stimes :: Integral b => b -> Builder -> Builder #

Semigroup More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(<>) :: More -> More -> More #

sconcat :: NonEmpty More -> More #

stimes :: Integral b => b -> More -> More #

Semigroup Void

Since: base-4.9.0.0

Instance details

Defined in Data.Void

Methods

(<>) :: Void -> Void -> Void #

sconcat :: NonEmpty Void -> Void #

stimes :: Integral b => b -> Void -> Void #

Semigroup All

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: All -> All -> All #

sconcat :: NonEmpty All -> All #

stimes :: Integral b => b -> All -> All #

Semigroup Any

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Any -> Any -> Any #

sconcat :: NonEmpty Any -> Any #

stimes :: Integral b => b -> Any -> Any #

Semigroup String 
Instance details

Defined in Basement.UTF8.Base

Methods

(<>) :: String -> String -> String #

sconcat :: NonEmpty String -> String #

stimes :: Integral b => b -> String -> String #

Semigroup IntSet

Since: containers-0.5.7

Instance details

Defined in Data.IntSet.Internal

Methods

(<>) :: IntSet -> IntSet -> IntSet #

sconcat :: NonEmpty IntSet -> IntSet #

stimes :: Integral b => b -> IntSet -> IntSet #

Semigroup Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

(<>) :: Doc -> Doc -> Doc #

sconcat :: NonEmpty Doc -> Doc #

stimes :: Integral b => b -> Doc -> Doc #

Semigroup ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

(<>) :: ByteArray -> ByteArray -> ByteArray #

sconcat :: NonEmpty ByteArray -> ByteArray #

stimes :: Integral b => b -> ByteArray -> ByteArray #

Semigroup ShortText 
Instance details

Defined in Data.Text.Short.Internal

Methods

(<>) :: ShortText -> ShortText -> ShortText #

sconcat :: NonEmpty ShortText -> ShortText #

stimes :: Integral b => b -> ShortText -> ShortText #

Semigroup ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<>) :: ConstVal -> ConstVal -> ConstVal #

sconcat :: NonEmpty ConstVal -> ConstVal #

stimes :: Integral b => b -> ConstVal -> ConstVal #

Semigroup DExpr # 
Instance details

Defined in Data.Expression

Methods

(<>) :: DExpr -> DExpr -> DExpr #

sconcat :: NonEmpty DExpr -> DExpr #

stimes :: Integral b => b -> DExpr -> DExpr #

Semigroup Name 
Instance details

Defined in Diagrams.Core.Names

Methods

(<>) :: Name -> Name -> Name #

sconcat :: NonEmpty Name -> Name #

stimes :: Integral b => b -> Name -> Name #

Semigroup FillRule 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: FillRule -> FillRule -> FillRule #

sconcat :: NonEmpty FillRule -> FillRule #

stimes :: Integral b => b -> FillRule -> FillRule #

Semigroup Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

(<>) :: Path -> Path -> Path #

sconcat :: NonEmpty Path -> Path #

stimes :: Integral b => b -> Path -> Path #

Semigroup KBNSum 
Instance details

Defined in Numeric.Sum

Methods

(<>) :: KBNSum -> KBNSum -> KBNSum #

sconcat :: NonEmpty KBNSum -> KBNSum #

stimes :: Integral b => b -> KBNSum -> KBNSum #

Semigroup Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: Crossings -> Crossings -> Crossings #

sconcat :: NonEmpty Crossings -> Crossings #

stimes :: Integral b => b -> Crossings -> Crossings #

Semigroup SegCount 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: SegCount -> SegCount -> SegCount #

sconcat :: NonEmpty SegCount -> SegCount #

stimes :: Integral b => b -> SegCount -> SegCount #

Semigroup FontSlant 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontSlant -> FontSlant -> FontSlant #

sconcat :: NonEmpty FontSlant -> FontSlant #

stimes :: Integral b => b -> FontSlant -> FontSlant #

Semigroup FontWeight 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontWeight -> FontWeight -> FontWeight #

sconcat :: NonEmpty FontWeight -> FontWeight #

stimes :: Integral b => b -> FontWeight -> FontWeight #

Semigroup Font 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: Font -> Font -> Font #

sconcat :: NonEmpty Font -> Font #

stimes :: Integral b => b -> Font -> Font #

Semigroup KB2Sum 
Instance details

Defined in Numeric.Sum

Methods

(<>) :: KB2Sum -> KB2Sum -> KB2Sum #

sconcat :: NonEmpty KB2Sum -> KB2Sum #

stimes :: Integral b => b -> KB2Sum -> KB2Sum #

Semigroup KahanSum 
Instance details

Defined in Numeric.Sum

Methods

(<>) :: KahanSum -> KahanSum -> KahanSum #

sconcat :: NonEmpty KahanSum -> KahanSum #

stimes :: Integral b => b -> KahanSum -> KahanSum #

Semigroup [a]

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: [a] -> [a] -> [a] #

sconcat :: NonEmpty [a] -> [a] #

stimes :: Integral b => b -> [a] -> [a] #

Semigroup a => Semigroup (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Maybe a -> Maybe a -> Maybe a #

sconcat :: NonEmpty (Maybe a) -> Maybe a #

stimes :: Integral b => b -> Maybe a -> Maybe a #

Semigroup a => Semigroup (IO a)

Since: base-4.10.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: IO a -> IO a -> IO a #

sconcat :: NonEmpty (IO a) -> IO a #

stimes :: Integral b => b -> IO a -> IO a #

Semigroup p => Semigroup (Par1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: Par1 p -> Par1 p -> Par1 p #

sconcat :: NonEmpty (Par1 p) -> Par1 p #

stimes :: Integral b => b -> Par1 p -> Par1 p #

Storable a => Semigroup (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

Semigroup (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: IResult a -> IResult a -> IResult a #

sconcat :: NonEmpty (IResult a) -> IResult a #

stimes :: Integral b => b -> IResult a -> IResult a #

Semigroup (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: Result a -> Result a -> Result a #

sconcat :: NonEmpty (Result a) -> Result a #

stimes :: Integral b => b -> Result a -> Result a #

Semigroup (Parser a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(<>) :: Parser a -> Parser a -> Parser a #

sconcat :: NonEmpty (Parser a) -> Parser a #

stimes :: Integral b => b -> Parser a -> Parser a #

Semigroup (Predicate a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Predicate a -> Predicate a -> Predicate a #

sconcat :: NonEmpty (Predicate a) -> Predicate a #

stimes :: Integral b => b -> Predicate a -> Predicate a #

Semigroup (Comparison a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Comparison a -> Comparison a -> Comparison a #

sconcat :: NonEmpty (Comparison a) -> Comparison a #

stimes :: Integral b => b -> Comparison a -> Comparison a #

Semigroup (Equivalence a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Equivalence a -> Equivalence a -> Equivalence a #

sconcat :: NonEmpty (Equivalence a) -> Equivalence a #

stimes :: Integral b => b -> Equivalence a -> Equivalence a #

Ord a => Semigroup (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Min a -> Min a -> Min a #

sconcat :: NonEmpty (Min a) -> Min a #

stimes :: Integral b => b -> Min a -> Min a #

Ord a => Semigroup (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Max a -> Max a -> Max a #

sconcat :: NonEmpty (Max a) -> Max a #

stimes :: Integral b => b -> Max a -> Max a #

Semigroup (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: First a -> First a -> First a #

sconcat :: NonEmpty (First a) -> First a #

stimes :: Integral b => b -> First a -> First a #

Semigroup (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Last a -> Last a -> Last a #

sconcat :: NonEmpty (Last a) -> Last a #

stimes :: Integral b => b -> Last a -> Last a #

Monoid m => Semigroup (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m #

stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m #

Semigroup a => Semigroup (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(<>) :: Option a -> Option a -> Option a #

sconcat :: NonEmpty (Option a) -> Option a #

stimes :: Integral b => b -> Option a -> Option a #

Semigroup a => Semigroup (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(<>) :: Identity a -> Identity a -> Identity a #

sconcat :: NonEmpty (Identity a) -> Identity a #

stimes :: Integral b => b -> Identity a -> Identity a #

Semigroup (First a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: First a -> First a -> First a #

sconcat :: NonEmpty (First a) -> First a #

stimes :: Integral b => b -> First a -> First a #

Semigroup (Last a)

Since: base-4.9.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: Last a -> Last a -> Last a #

sconcat :: NonEmpty (Last a) -> Last a #

stimes :: Integral b => b -> Last a -> Last a #

Semigroup a => Semigroup (Dual a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Dual a -> Dual a -> Dual a #

sconcat :: NonEmpty (Dual a) -> Dual a #

stimes :: Integral b => b -> Dual a -> Dual a #

Semigroup (Endo a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Endo a -> Endo a -> Endo a #

sconcat :: NonEmpty (Endo a) -> Endo a #

stimes :: Integral b => b -> Endo a -> Endo a #

Num a => Semigroup (Sum a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Sum a -> Sum a -> Sum a #

sconcat :: NonEmpty (Sum a) -> Sum a #

stimes :: Integral b => b -> Sum a -> Sum a #

Num a => Semigroup (Product a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Product a -> Product a -> Product a #

sconcat :: NonEmpty (Product a) -> Product a #

stimes :: Integral b => b -> Product a -> Product a #

Semigroup a => Semigroup (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(<>) :: Down a -> Down a -> Down a #

sconcat :: NonEmpty (Down a) -> Down a #

stimes :: Integral b => b -> Down a -> Down a #

Semigroup (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: NonEmpty a -> NonEmpty a -> NonEmpty a #

sconcat :: NonEmpty (NonEmpty a) -> NonEmpty a #

stimes :: Integral b => b -> NonEmpty a -> NonEmpty a #

PrimType ty => Semigroup (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

(<>) :: UArray ty -> UArray ty -> UArray ty #

sconcat :: NonEmpty (UArray ty) -> UArray ty #

stimes :: Integral b => b -> UArray ty -> UArray ty #

PrimType ty => Semigroup (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

(<>) :: Block ty -> Block ty -> Block ty #

sconcat :: NonEmpty (Block ty) -> Block ty #

stimes :: Integral b => b -> Block ty -> Block ty #

Semigroup (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

(<>) :: CountOf ty -> CountOf ty -> CountOf ty #

sconcat :: NonEmpty (CountOf ty) -> CountOf ty #

stimes :: Integral b => b -> CountOf ty -> CountOf ty #

Semigroup (PutM ()) 
Instance details

Defined in Data.Binary.Put

Methods

(<>) :: PutM () -> PutM () -> PutM () #

sconcat :: NonEmpty (PutM ()) -> PutM () #

stimes :: Integral b => b -> PutM () -> PutM () #

Semigroup (Parser a)

Since: cassava-0.5.0.0

Instance details

Defined in Data.Csv.Conversion

Methods

(<>) :: Parser a -> Parser a -> Parser a #

sconcat :: NonEmpty (Parser a) -> Parser a #

stimes :: Integral b => b -> Parser a -> Parser a #

Num a => Semigroup (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: Colour a -> Colour a -> Colour a #

sconcat :: NonEmpty (Colour a) -> Colour a #

stimes :: Integral b => b -> Colour a -> Colour a #

Num a => Semigroup (AlphaColour a)

AlphaColour forms a monoid with over and transparent.

Instance details

Defined in Data.Colour.Internal

Methods

(<>) :: AlphaColour a -> AlphaColour a -> AlphaColour a #

sconcat :: NonEmpty (AlphaColour a) -> AlphaColour a #

stimes :: Integral b => b -> AlphaColour a -> AlphaColour a #

Semigroup (IntMap a)

Since: containers-0.5.7

Instance details

Defined in Data.IntMap.Internal

Methods

(<>) :: IntMap a -> IntMap a -> IntMap a #

sconcat :: NonEmpty (IntMap a) -> IntMap a #

stimes :: Integral b => b -> IntMap a -> IntMap a #

Semigroup (Seq a)

Since: containers-0.5.7

Instance details

Defined in Data.Sequence.Internal

Methods

(<>) :: Seq a -> Seq a -> Seq a #

sconcat :: NonEmpty (Seq a) -> Seq a #

stimes :: Integral b => b -> Seq a -> Seq a #

Ord a => Semigroup (Set a)

Since: containers-0.5.7

Instance details

Defined in Data.Set.Internal

Methods

(<>) :: Set a -> Set a -> Set a #

sconcat :: NonEmpty (Set a) -> Set a #

stimes :: Integral b => b -> Set a -> Set a #

Semigroup (DList a) 
Instance details

Defined in Data.DList

Methods

(<>) :: DList a -> DList a -> DList a #

sconcat :: NonEmpty (DList a) -> DList a #

stimes :: Integral b => b -> DList a -> DList a #

(Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

(<>) :: Generically a -> Generically a -> Generically a #

sconcat :: NonEmpty (Generically a) -> Generically a #

stimes :: Integral b => b -> Generically a -> Generically a #

Semigroup (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

(<>) :: Doc a -> Doc a -> Doc a #

sconcat :: NonEmpty (Doc a) -> Doc a #

stimes :: Integral b => b -> Doc a -> Doc a #

PrimUnlifted a => Semigroup (UnliftedArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.UnliftedArray

Methods

(<>) :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a #

sconcat :: NonEmpty (UnliftedArray a) -> UnliftedArray a #

stimes :: Integral b => b -> UnliftedArray a -> UnliftedArray a #

Semigroup (PrimArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Methods

(<>) :: PrimArray a -> PrimArray a -> PrimArray a #

sconcat :: NonEmpty (PrimArray a) -> PrimArray a #

stimes :: Integral b => b -> PrimArray a -> PrimArray a #

Semigroup (SmallArray a)

Since: primitive-0.6.3.0

Instance details

Defined in Data.Primitive.SmallArray

Methods

(<>) :: SmallArray a -> SmallArray a -> SmallArray a #

sconcat :: NonEmpty (SmallArray a) -> SmallArray a #

stimes :: Integral b => b -> SmallArray a -> SmallArray a #

Semigroup (Array a)

Since: primitive-0.6.3.0

Instance details

Defined in Data.Primitive.Array

Methods

(<>) :: Array a -> Array a -> Array a #

sconcat :: NonEmpty (Array a) -> Array a #

stimes :: Integral b => b -> Array a -> Array a #

(Hashable a, Eq a) => Semigroup (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Methods

(<>) :: HashSet a -> HashSet a -> HashSet a #

sconcat :: NonEmpty (HashSet a) -> HashSet a #

stimes :: Integral b => b -> HashSet a -> HashSet a #

Prim a => Semigroup (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

Semigroup (Vector a) 
Instance details

Defined in Data.Vector

Methods

(<>) :: Vector a -> Vector a -> Vector a #

sconcat :: NonEmpty (Vector a) -> Vector a #

stimes :: Integral b => b -> Vector a -> Vector a #

Semigroup (MergeSet a) 
Instance details

Defined in Data.Set.Internal

Methods

(<>) :: MergeSet a -> MergeSet a -> MergeSet a #

sconcat :: NonEmpty (MergeSet a) -> MergeSet a #

stimes :: Integral b => b -> MergeSet a -> MergeSet a #

(Precise a, RealFloat a) => Semigroup (Log a) 
Instance details

Defined in Numeric.Log

Methods

(<>) :: Log a -> Log a -> Log a #

sconcat :: NonEmpty (Log a) -> Log a #

stimes :: Integral b => b -> Log a -> Log a #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Ord a => Semigroup (SortedList a) 
Instance details

Defined in Diagrams.Core.Trace

Methods

(<>) :: SortedList a -> SortedList a -> SortedList a #

sconcat :: NonEmpty (SortedList a) -> SortedList a #

stimes :: Integral b => b -> SortedList a -> SortedList a #

Semigroup t => Semigroup (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: TransInv t -> TransInv t -> TransInv t #

sconcat :: NonEmpty (TransInv t) -> TransInv t #

stimes :: Integral b => b -> TransInv t -> TransInv t #

Semigroup (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Leftmost a -> Leftmost a -> Leftmost a #

sconcat :: NonEmpty (Leftmost a) -> Leftmost a #

stimes :: Integral b => b -> Leftmost a -> Leftmost a #

Semigroup (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Rightmost a -> Rightmost a -> Rightmost a #

sconcat :: NonEmpty (Rightmost a) -> Rightmost a #

stimes :: Integral b => b -> Rightmost a -> Rightmost a #

Semigroup a => Semigroup (Active a) 
Instance details

Defined in Data.Active

Methods

(<>) :: Active a -> Active a -> Active a #

sconcat :: NonEmpty (Active a) -> Active a #

stimes :: Integral b => b -> Active a -> Active a #

Semigroup a => Semigroup (Dynamic a) 
Instance details

Defined in Data.Active

Methods

(<>) :: Dynamic a -> Dynamic a -> Dynamic a #

sconcat :: NonEmpty (Dynamic a) -> Dynamic a #

stimes :: Integral b => b -> Dynamic a -> Dynamic a #

Semigroup (Clip n) 
Instance details

Defined in Diagrams.TwoD.Path

Methods

(<>) :: Clip n -> Clip n -> Clip n #

sconcat :: NonEmpty (Clip n) -> Clip n #

stimes :: Integral b => b -> Clip n -> Clip n #

(Num n, Ord n) => Semigroup (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: ArcLength n -> ArcLength n -> ArcLength n #

sconcat :: NonEmpty (ArcLength n) -> ArcLength n #

stimes :: Integral b => b -> ArcLength n -> ArcLength n #

Num n => Semigroup (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

(<>) :: Angle n -> Angle n -> Angle n #

sconcat :: NonEmpty (Angle n) -> Angle n #

stimes :: Integral b => b -> Angle n -> Angle n #

Semigroup (FillTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

(<>) :: FillTexture n -> FillTexture n -> FillTexture n #

sconcat :: NonEmpty (FillTexture n) -> FillTexture n #

stimes :: Integral b => b -> FillTexture n -> FillTexture n #

Semigroup (LineTexture n) 
Instance details

Defined in Diagrams.TwoD.Attributes

Methods

(<>) :: LineTexture n -> LineTexture n -> LineTexture n #

sconcat :: NonEmpty (LineTexture n) -> LineTexture n #

stimes :: Integral b => b -> LineTexture n -> LineTexture n #

Semigroup (FontSize n) 
Instance details

Defined in Diagrams.TwoD.Text

Methods

(<>) :: FontSize n -> FontSize n -> FontSize n #

sconcat :: NonEmpty (FontSize n) -> FontSize n #

stimes :: Integral b => b -> FontSize n -> FontSize n #

Num n => Semigroup (Duration n) 
Instance details

Defined in Data.Active

Methods

(<>) :: Duration n -> Duration n -> Duration n #

sconcat :: NonEmpty (Duration n) -> Duration n #

stimes :: Integral b => b -> Duration n -> Duration n #

Ord n => Semigroup (Era n) 
Instance details

Defined in Data.Active

Methods

(<>) :: Era n -> Era n -> Era n #

sconcat :: NonEmpty (Era n) -> Era n #

stimes :: Integral b => b -> Era n -> Era n #

Semigroup (NonEmptyDList a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: NonEmptyDList a -> NonEmptyDList a -> NonEmptyDList a #

sconcat :: NonEmpty (NonEmptyDList a) -> NonEmptyDList a #

stimes :: Integral b => b -> NonEmptyDList a -> NonEmptyDList a #

Ord a => Semigroup (Max a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Max a -> Max a -> Max a #

sconcat :: NonEmpty (Max a) -> Max a #

stimes :: Integral b => b -> Max a -> Max a #

Ord a => Semigroup (Min a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Min a -> Min a -> Min a #

sconcat :: NonEmpty (Min a) -> Min a #

stimes :: Integral b => b -> Min a -> Min a #

Semigroup b => Semigroup (a -> b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a -> b) -> (a -> b) -> a -> b #

sconcat :: NonEmpty (a -> b) -> a -> b #

stimes :: Integral b0 => b0 -> (a -> b) -> a -> b #

Semigroup (Either a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Either

Methods

(<>) :: Either a b -> Either a b -> Either a b #

sconcat :: NonEmpty (Either a b) -> Either a b #

stimes :: Integral b0 => b0 -> Either a b -> Either a b #

Semigroup (V1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: V1 p -> V1 p -> V1 p #

sconcat :: NonEmpty (V1 p) -> V1 p #

stimes :: Integral b => b -> V1 p -> V1 p #

Semigroup (U1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: U1 p -> U1 p -> U1 p #

sconcat :: NonEmpty (U1 p) -> U1 p #

stimes :: Integral b => b -> U1 p -> U1 p #

(Semigroup a, Semigroup b) => Semigroup (a, b)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b) -> (a, b) -> (a, b) #

sconcat :: NonEmpty (a, b) -> (a, b) #

stimes :: Integral b0 => b0 -> (a, b) -> (a, b) #

(Eq k, Hashable k) => Semigroup (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

(<>) :: HashMap k v -> HashMap k v -> HashMap k v #

sconcat :: NonEmpty (HashMap k v) -> HashMap k v #

stimes :: Integral b => b -> HashMap k v -> HashMap k v #

Ord k => Semigroup (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

(<>) :: Map k v -> Map k v -> Map k v #

sconcat :: NonEmpty (Map k v) -> Map k v #

stimes :: Integral b => b -> Map k v -> Map k v #

Semigroup (Parser i a) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(<>) :: Parser i a -> Parser i a -> Parser i a #

sconcat :: NonEmpty (Parser i a) -> Parser i a #

stimes :: Integral b => b -> Parser i a -> Parser i a #

Semigroup a => Semigroup (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

(<>) :: Op a b -> Op a b -> Op a b #

sconcat :: NonEmpty (Op a b) -> Op a b #

stimes :: Integral b0 => b0 -> Op a b -> Op a b #

Semigroup (Proxy s)

Since: base-4.9.0.0

Instance details

Defined in Data.Proxy

Methods

(<>) :: Proxy s -> Proxy s -> Proxy s #

sconcat :: NonEmpty (Proxy s) -> Proxy s #

stimes :: Integral b => b -> Proxy s -> Proxy s #

Measured v a => Semigroup (FingerTree v a) 
Instance details

Defined in Data.FingerTree

Methods

(<>) :: FingerTree v a -> FingerTree v a -> FingerTree v a #

sconcat :: NonEmpty (FingerTree v a) -> FingerTree v a #

stimes :: Integral b => b -> FingerTree v a -> FingerTree v a #

(Additive v, Num n) => Semigroup (Transformation v n) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: Transformation v n -> Transformation v n -> Transformation v n #

sconcat :: NonEmpty (Transformation v n) -> Transformation v n #

stimes :: Integral b => b -> Transformation v n -> Transformation v n #

Ord n => Semigroup (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Methods

(<>) :: Envelope v n -> Envelope v n -> Envelope v n #

sconcat :: NonEmpty (Envelope v n) -> Envelope v n #

stimes :: Integral b => b -> Envelope v n -> Envelope v n #

Semigroup a => Semigroup (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(<>) :: Measured n a -> Measured n a -> Measured n a #

sconcat :: NonEmpty (Measured n a) -> Measured n a #

stimes :: Integral b => b -> Measured n a -> Measured n a #

Typeable n => Semigroup (Attribute v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

(<>) :: Attribute v n -> Attribute v n -> Attribute v n #

sconcat :: NonEmpty (Attribute v n) -> Attribute v n #

stimes :: Integral b => b -> Attribute v n -> Attribute v n #

Typeable n => Semigroup (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

(<>) :: Style v n -> Style v n -> Style v n #

sconcat :: NonEmpty (Style v n) -> Style v n #

stimes :: Integral b => b -> Style v n -> Style v n #

Ord n => Semigroup (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Methods

(<>) :: Trace v n -> Trace v n -> Trace v n #

sconcat :: NonEmpty (Trace v n) -> Trace v n #

stimes :: Integral b => b -> Trace v n -> Trace v n #

Semigroup (a :-: a) 
Instance details

Defined in Diagrams.Core.Transform

Methods

(<>) :: (a :-: a) -> (a :-: a) -> a :-: a #

sconcat :: NonEmpty (a :-: a) -> a :-: a #

stimes :: Integral b => b -> (a :-: a) -> a :-: a #

Semigroup (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

(<>) :: Path v n -> Path v n -> Path v n #

sconcat :: NonEmpty (Path v n) -> Path v n #

stimes :: Integral b => b -> Path v n -> Path v n #

(OrderedField n, Metric v) => Semigroup (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: Trail v n -> Trail v n -> Trail v n #

sconcat :: NonEmpty (Trail v n) -> Trail v n #

stimes :: Integral b => b -> Trail v n -> Trail v n #

Monad m => Semigroup (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Sequenced a m -> Sequenced a m -> Sequenced a m #

sconcat :: NonEmpty (Sequenced a m) -> Sequenced a m #

stimes :: Integral b => b -> Sequenced a m -> Sequenced a m #

Applicative f => Semigroup (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Traversed a f -> Traversed a f -> Traversed a f #

sconcat :: NonEmpty (Traversed a f) -> Traversed a f #

stimes :: Integral b => b -> Traversed a f -> Traversed a f #

Semigroup (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

sconcat :: NonEmpty (ReifiedFold s a) -> ReifiedFold s a #

stimes :: Integral b => b -> ReifiedFold s a -> ReifiedFold s a #

(Ord n, Floating n, Metric v) => Semigroup (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: SegTree v n -> SegTree v n -> SegTree v n #

sconcat :: NonEmpty (SegTree v n) -> SegTree v n #

stimes :: Integral b => b -> SegTree v n -> SegTree v n #

(Metric v, OrderedField n) => Semigroup (OffsetEnvelope v n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: OffsetEnvelope v n -> OffsetEnvelope v n -> OffsetEnvelope v n #

sconcat :: NonEmpty (OffsetEnvelope v n) -> OffsetEnvelope v n #

stimes :: Integral b => b -> OffsetEnvelope v n -> OffsetEnvelope v n #

(Num n, Additive v) => Semigroup (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Methods

(<>) :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n #

sconcat :: NonEmpty (TotalOffset v n) -> TotalOffset v n #

stimes :: Integral b => b -> TotalOffset v n -> TotalOffset v n #

(Additive v, Ord n) => Semigroup (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(<>) :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n #

sconcat :: NonEmpty (BoundingBox v n) -> BoundingBox v n #

stimes :: Integral b => b -> BoundingBox v n -> BoundingBox v n #

Semigroup (f a) => Semigroup (Indexing f a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(<>) :: Indexing f a -> Indexing f a -> Indexing f a #

sconcat :: NonEmpty (Indexing f a) -> Indexing f a #

stimes :: Integral b => b -> Indexing f a -> Indexing f a #

(Additive v, Ord n) => Semigroup (NonEmptyBoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

(<>) :: NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n #

sconcat :: NonEmpty (NonEmptyBoundingBox v n) -> NonEmptyBoundingBox v n #

stimes :: Integral b => b -> NonEmptyBoundingBox v n -> NonEmptyBoundingBox v n #

(Contravariant f, Applicative f) => Semigroup (Folding f a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: Folding f a -> Folding f a -> Folding f a #

sconcat :: NonEmpty (Folding f a) -> Folding f a #

stimes :: Integral b => b -> Folding f a -> Folding f a #

Apply f => Semigroup (TraversedF a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

(<>) :: TraversedF a f -> TraversedF a f -> TraversedF a f #

sconcat :: NonEmpty (TraversedF a f) -> TraversedF a f #

stimes :: Integral b => b -> TraversedF a f -> TraversedF a f #

Semigroup (Deepening i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

(<>) :: Deepening i a -> Deepening i a -> Deepening i a #

sconcat :: NonEmpty (Deepening i a) -> Deepening i a #

stimes :: Integral b => b -> Deepening i a -> Deepening i a #

Semigroup (f p) => Semigroup (Rec1 f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: Rec1 f p -> Rec1 f p -> Rec1 f p #

sconcat :: NonEmpty (Rec1 f p) -> Rec1 f p #

stimes :: Integral b => b -> Rec1 f p -> Rec1 f p #

(Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c) -> (a, b, c) -> (a, b, c) #

sconcat :: NonEmpty (a, b, c) -> (a, b, c) #

stimes :: Integral b0 => b0 -> (a, b, c) -> (a, b, c) #

Semigroup a => Semigroup (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

(<>) :: Const a b -> Const a b -> Const a b #

sconcat :: NonEmpty (Const a b) -> Const a b #

stimes :: Integral b0 => b0 -> Const a b -> Const a b #

(Applicative f, Semigroup a) => Semigroup (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(<>) :: Ap f a -> Ap f a -> Ap f a #

sconcat :: NonEmpty (Ap f a) -> Ap f a #

stimes :: Integral b => b -> Ap f a -> Ap f a #

Alternative f => Semigroup (Alt f a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(<>) :: Alt f a -> Alt f a -> Alt f a #

sconcat :: NonEmpty (Alt f a) -> Alt f a #

stimes :: Integral b => b -> Alt f a -> Alt f a #

ArrowPlus p => Semigroup (Tambara p a b) 
Instance details

Defined in Data.Profunctor.Strong

Methods

(<>) :: Tambara p a b -> Tambara p a b -> Tambara p a b #

sconcat :: NonEmpty (Tambara p a b) -> Tambara p a b #

stimes :: Integral b0 => b0 -> Tambara p a b -> Tambara p a b #

Reifies s (ReifiedMonoid a) => Semigroup (ReflectedMonoid a s) 
Instance details

Defined in Data.Reflection

Methods

(<>) :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s #

sconcat :: NonEmpty (ReflectedMonoid a s) -> ReflectedMonoid a s #

stimes :: Integral b => b -> ReflectedMonoid a s -> ReflectedMonoid a s #

Semigroup a => Semigroup (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

(<>) :: Tagged s a -> Tagged s a -> Tagged s a #

sconcat :: NonEmpty (Tagged s a) -> Tagged s a #

stimes :: Integral b => b -> Tagged s a -> Tagged s a #

Semigroup m => Semigroup (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Methods

(<>) :: Query v n m -> Query v n m -> Query v n m #

sconcat :: NonEmpty (Query v n m) -> Query v n m #

stimes :: Integral b => b -> Query v n m -> Query v n m #

Semigroup (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(<>) :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

sconcat :: NonEmpty (Render Cairo V2 Double) -> Render Cairo V2 Double #

stimes :: Integral b => b -> Render Cairo V2 Double -> Render Cairo V2 Double #

Semigroup (Render NullBackend v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n #

sconcat :: NonEmpty (Render NullBackend v n) -> Render NullBackend v n #

stimes :: Integral b => b -> Render NullBackend v n -> Render NullBackend v n #

(OrderedField n, Metric v) => Semigroup (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

(<>) :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n #

sconcat :: NonEmpty (Trail' Line v n) -> Trail' Line v n #

stimes :: Integral b => b -> Trail' Line v n -> Trail' Line v n #

Semigroup (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

(<>) :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

sconcat :: NonEmpty (ReifiedIndexedFold i s a) -> ReifiedIndexedFold i s a #

stimes :: Integral b => b -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

Semigroup (Deformation v v n) 
Instance details

Defined in Diagrams.Deform

Methods

(<>) :: Deformation v v n -> Deformation v v n -> Deformation v v n #

sconcat :: NonEmpty (Deformation v v n) -> Deformation v v n #

stimes :: Integral b => b -> Deformation v v n -> Deformation v v n #

Semigroup c => Semigroup (K1 i c p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: K1 i c p -> K1 i c p -> K1 i c p #

sconcat :: NonEmpty (K1 i c p) -> K1 i c p #

stimes :: Integral b => b -> K1 i c p -> K1 i c p #

(Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

sconcat :: NonEmpty ((f :*: g) p) -> (f :*: g) p #

stimes :: Integral b => b -> (f :*: g) p -> (f :*: g) p #

(Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

sconcat :: NonEmpty (a, b, c, d) -> (a, b, c, d) #

stimes :: Integral b0 => b0 -> (a, b, c, d) -> (a, b, c, d) #

(Metric v, OrderedField n, Semigroup m) => Semigroup (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

sconcat :: NonEmpty (QDiagram b v n m) -> QDiagram b v n m #

stimes :: Integral b0 => b0 -> QDiagram b v n m -> QDiagram b v n m #

Semigroup (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

(<>) :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m #

sconcat :: NonEmpty (SubMap b v n m) -> SubMap b v n m #

stimes :: Integral b0 => b0 -> SubMap b v n m -> SubMap b v n m #

(Semigroup u, Action d u) => Semigroup (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTree d u a l -> DUALTree d u a l -> DUALTree d u a l #

sconcat :: NonEmpty (DUALTree d u a l) -> DUALTree d u a l #

stimes :: Integral b => b -> DUALTree d u a l -> DUALTree d u a l #

(Semigroup u, Action d u) => Semigroup (DUALTreeU d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTreeU d u a l -> DUALTreeU d u a l -> DUALTreeU d u a l #

sconcat :: NonEmpty (DUALTreeU d u a l) -> DUALTreeU d u a l #

stimes :: Integral b => b -> DUALTreeU d u a l -> DUALTreeU d u a l #

(Action d u, Semigroup u) => Semigroup (DUALTreeNE d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

(<>) :: DUALTreeNE d u a l -> DUALTreeNE d u a l -> DUALTreeNE d u a l #

sconcat :: NonEmpty (DUALTreeNE d u a l) -> DUALTreeNE d u a l #

stimes :: Integral b => b -> DUALTreeNE d u a l -> DUALTreeNE d u a l #

Semigroup (f p) => Semigroup (M1 i c f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: M1 i c f p -> M1 i c f p -> M1 i c f p #

sconcat :: NonEmpty (M1 i c f p) -> M1 i c f p #

stimes :: Integral b => b -> M1 i c f p -> M1 i c f p #

Semigroup (f (g p)) => Semigroup ((f :.: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

(<>) :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

sconcat :: NonEmpty ((f :.: g) p) -> (f :.: g) p #

stimes :: Integral b => b -> (f :.: g) p -> (f :.: g) p #

(Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

sconcat :: NonEmpty (a, b, c, d, e) -> (a, b, c, d, e) #

stimes :: Integral b0 => b0 -> (a, b, c, d, e) -> (a, b, c, d, e) #

Contravariant g => Semigroup (BazaarT p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<>) :: BazaarT p g a b t -> BazaarT p g a b t -> BazaarT p g a b t #

sconcat :: NonEmpty (BazaarT p g a b t) -> BazaarT p g a b t #

stimes :: Integral b0 => b0 -> BazaarT p g a b t -> BazaarT p g a b t #

Contravariant g => Semigroup (BazaarT1 p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

(<>) :: BazaarT1 p g a b t -> BazaarT1 p g a b t -> BazaarT1 p g a b t #

sconcat :: NonEmpty (BazaarT1 p g a b t) -> BazaarT1 p g a b t #

stimes :: Integral b0 => b0 -> BazaarT1 p g a b t -> BazaarT1 p g a b t #

class Semigroup a => Monoid a where #

The class of monoids (types with an associative binary operation that + has an identity). Instances should satisfy the following laws:

The method names refer to the monoid of lists under concatenation, but there are many other instances.

Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product.

NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Minimal complete definition

mempty

Methods

mempty :: a #

Identity of mappend

mappend :: a -> a -> a #

An associative operation

NOTE: This method is redundant and has the default implementation mappend = '(<>)' since base-4.11.0.0.

mconcat :: [a] -> a #

Fold a list using the monoid.

For most types, the default definition for mconcat will be used, but the function is included in the class definition so - that an optimized version can be provided for specific types.

Instances
Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Ordering #

mappend :: Ordering -> Ordering -> Ordering #

mconcat :: [Ordering] -> Ordering #

Monoid ()

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: () #

mappend :: () -> () -> () #

mconcat :: [()] -> () #

Monoid Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

mempty :: Path #

mappend :: Path -> Path -> Path #

mconcat :: [Path] -> Path #

Monoid ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

mempty :: ByteString #

mappend :: ByteString -> ByteString -> ByteString #

mconcat :: [ByteString] -> ByteString #

Monoid ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

mempty :: ByteString #

mappend :: ByteString -> ByteString -> ByteString #

mconcat :: [ByteString] -> ByteString #

Monoid Builder 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

mempty :: Builder #

mappend :: Builder -> Builder -> Builder #

mconcat :: [Builder] -> Builder #

Monoid All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: All #

mappend :: All -> All -> All #

mconcat :: [All] -> All #

Monoid Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Any #

mappend :: Any -> Any -> Any #

mconcat :: [Any] -> Any #

Monoid String 
Instance details

Defined in Basement.UTF8.Base

Methods

mempty :: String #

mappend :: String -> String -> String #

mconcat :: [String] -> String #

Monoid IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

mempty :: IntSet #

mappend :: IntSet -> IntSet -> IntSet #

mconcat :: [IntSet] -> IntSet #

Monoid Name 
Instance details

Defined in Diagrams.Core.Names

Methods

mempty :: Name #

mappend :: Name -> Name -> Name #

mconcat :: [Name] -> Name #

Monoid Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

mempty :: Doc #

mappend :: Doc -> Doc -> Doc #

mconcat :: [Doc] -> Doc #

Monoid Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

mempty :: Crossings #

mappend :: Crossings -> Crossings -> Crossings #

mconcat :: [Crossings] -> Crossings #

Monoid SegCount 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: SegCount #

mappend :: SegCount -> SegCount -> SegCount #

mconcat :: [SegCount] -> SegCount #

Monoid More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: More #

mappend :: More -> More -> More #

mconcat :: [More] -> More #

Monoid [a]

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: [a] #

mappend :: [a] -> [a] -> [a] #

mconcat :: [[a]] -> [a] #

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to + that an optimized version can be provided for specific types.

Instances
Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Ordering #

mappend :: Ordering -> Ordering -> Ordering #

mconcat :: [Ordering] -> Ordering #

Monoid ()

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: () #

mappend :: () -> () -> () #

mconcat :: [()] -> () #

Monoid ByteString 
Instance details

Defined in Data.ByteString.Internal

Methods

mempty :: ByteString #

mappend :: ByteString -> ByteString -> ByteString #

mconcat :: [ByteString] -> ByteString #

Monoid ByteString 
Instance details

Defined in Data.ByteString.Lazy.Internal

Methods

mempty :: ByteString #

mappend :: ByteString -> ByteString -> ByteString #

mconcat :: [ByteString] -> ByteString #

Monoid Builder 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

mempty :: Builder #

mappend :: Builder -> Builder -> Builder #

mconcat :: [Builder] -> Builder #

Monoid More 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: More #

mappend :: More -> More -> More #

mconcat :: [More] -> More #

Monoid All

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: All #

mappend :: All -> All -> All #

mconcat :: [All] -> All #

Monoid Any

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Any #

mappend :: Any -> Any -> Any #

mconcat :: [Any] -> Any #

Monoid String 
Instance details

Defined in Basement.UTF8.Base

Methods

mempty :: String #

mappend :: String -> String -> String #

mconcat :: [String] -> String #

Monoid IntSet 
Instance details

Defined in Data.IntSet.Internal

Methods

mempty :: IntSet #

mappend :: IntSet -> IntSet -> IntSet #

mconcat :: [IntSet] -> IntSet #

Monoid Doc 
Instance details

Defined in Text.PrettyPrint.HughesPJ

Methods

mempty :: Doc #

mappend :: Doc -> Doc -> Doc #

mconcat :: [Doc] -> Doc #

Monoid ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Methods

mempty :: ByteArray #

mappend :: ByteArray -> ByteArray -> ByteArray #

mconcat :: [ByteArray] -> ByteArray #

Monoid ShortText 
Instance details

Defined in Data.Text.Short.Internal

Methods

mempty :: ShortText #

mappend :: ShortText -> ShortText -> ShortText #

mconcat :: [ShortText] -> ShortText #

Monoid Name 
Instance details

Defined in Diagrams.Core.Names

Methods

mempty :: Name #

mappend :: Name -> Name -> Name #

mconcat :: [Name] -> Name #

Monoid Path 
Instance details

Defined in Graphics.Rendering.Chart.Geometry

Methods

mempty :: Path #

mappend :: Path -> Path -> Path #

mconcat :: [Path] -> Path #

Monoid KBNSum 
Instance details

Defined in Numeric.Sum

Methods

mempty :: KBNSum #

mappend :: KBNSum -> KBNSum -> KBNSum #

mconcat :: [KBNSum] -> KBNSum #

Monoid Crossings 
Instance details

Defined in Diagrams.TwoD.Path

Methods

mempty :: Crossings #

mappend :: Crossings -> Crossings -> Crossings #

mconcat :: [Crossings] -> Crossings #

Monoid SegCount 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: SegCount #

mappend :: SegCount -> SegCount -> SegCount #

mconcat :: [SegCount] -> SegCount #

Monoid KB2Sum 
Instance details

Defined in Numeric.Sum

Methods

mempty :: KB2Sum #

mappend :: KB2Sum -> KB2Sum -> KB2Sum #

mconcat :: [KB2Sum] -> KB2Sum #

Monoid KahanSum 
Instance details

Defined in Numeric.Sum

Methods

mempty :: KahanSum #

mappend :: KahanSum -> KahanSum -> KahanSum #

mconcat :: [KahanSum] -> KahanSum #

Monoid [a]

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: [a] #

mappend :: [a] -> [a] -> [a] #

mconcat :: [[a]] -> [a] #

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and e*s = s = s*e for all s ∈ S."

Since 4.11.0: constraint on inner a value generalised from - Monoid to Semigroup.

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mempty :: IO a #

mappend :: IO a -> IO a -> IO a #

mconcat :: [IO a] -> IO a #

Monoid (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Rightmost a #

mappend :: Rightmost a -> Rightmost a -> Rightmost a #

mconcat :: [Rightmost a] -> Rightmost a #

Monoid (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Leftmost a #

mappend :: Leftmost a -> Leftmost a -> Leftmost a #

mconcat :: [Leftmost a] -> Leftmost a #

Monoid a => Monoid (Identity a) 
Instance details

Defined in Data.Functor.Identity

Methods

mempty :: Identity a #

mappend :: Identity a -> Identity a -> Identity a #

mconcat :: [Identity a] -> Identity a #

Num a => Monoid (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: AlphaColour a #

mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a #

mconcat :: [AlphaColour a] -> AlphaColour a #

Num a => Monoid (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: Colour a #

mappend :: Colour a -> Colour a -> Colour a #

mconcat :: [Colour a] -> Colour a #

(Ord a, Bounded a) => Monoid (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

(Ord a, Bounded a) => Monoid (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

Monoid m => Monoid (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: WrappedMonoid m #

mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

mconcat :: [WrappedMonoid m] -> WrappedMonoid m #

Semigroup a => Monoid (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Option a #

mappend :: Option a -> Option a -> Option a #

mconcat :: [Option a] -> Option a #

Monoid (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: First a #

mappend :: First a -> First a -> First a #

mconcat :: [First a] -> First a #

Monoid (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: Last a #

mappend :: Last a -> Last a -> Last a #

mconcat :: [Last a] -> Last a #

Monoid a => Monoid (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Dual a #

mappend :: Dual a -> Dual a -> Dual a #

mconcat :: [Dual a] -> Dual a #

Monoid (Endo a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Endo a #

mappend :: Endo a -> Endo a -> Endo a #

mconcat :: [Endo a] -> Endo a #

Num a => Monoid (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Sum a #

mappend :: Sum a -> Sum a -> Sum a #

mconcat :: [Sum a] -> Sum a #

Num a => Monoid (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Product a #

mappend :: Product a -> Product a -> Product a #

mconcat :: [Product a] -> Product a #

Monoid a => Monoid (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

mempty :: Down a #

mappend :: Down a -> Down a -> Down a #

mconcat :: [Down a] -> Down a #

PrimType ty => Monoid (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

mempty :: UArray ty #

mappend :: UArray ty -> UArray ty -> UArray ty #

mconcat :: [UArray ty] -> UArray ty #

PrimType ty => Monoid (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

mempty :: Block ty #

mappend :: Block ty -> Block ty -> Block ty #

mconcat :: [Block ty] -> Block ty #

Monoid (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

mempty :: CountOf ty #

mappend :: CountOf ty -> CountOf ty -> CountOf ty #

mconcat :: [CountOf ty] -> CountOf ty #

Monoid (PutM ()) 
Instance details

Defined in Data.Binary.Put

Methods

mempty :: PutM () #

mappend :: PutM () -> PutM () -> PutM () #

mconcat :: [PutM ()] -> PutM () #

Monoid (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

mempty :: IntMap a #

mappend :: IntMap a -> IntMap a -> IntMap a #

mconcat :: [IntMap a] -> IntMap a #

Monoid (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

mempty :: Seq a #

mappend :: Seq a -> Seq a -> Seq a #

mconcat :: [Seq a] -> Seq a #

Ord a => Monoid (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: Set a #

mappend :: Set a -> Set a -> Set a #

mconcat :: [Set a] -> Set a #

Monoid (DList a) 
Instance details

Defined in Data.DList

Methods

mempty :: DList a #

mappend :: DList a -> DList a -> DList a #

mconcat :: [DList a] -> DList a #

Num n => Monoid (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

mempty :: Angle n #

mappend :: Angle n -> Angle n -> Angle n #

mconcat :: [Angle n] -> Angle n #

Monoid (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

mempty :: Doc a #

mappend :: Doc a -> Doc a -> Doc a #

mconcat :: [Doc a] -> Doc a #

Monoid (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

mempty :: Array a #

mappend :: Array a -> Array a -> Array a #

mconcat :: [Array a] -> Array a #

Storable a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (MergeSet a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: MergeSet a #

mappend :: MergeSet a -> MergeSet a -> MergeSet a #

mconcat :: [MergeSet a] -> MergeSet a #

Monoid (Vector a) 
Instance details

Defined in Data.Vector

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Prim a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

(Precise a, RealFloat a) => Monoid (Log a) 
Instance details

Defined in Numeric.Log

Methods

mempty :: Log a #

mappend :: Log a -> Log a -> Log a #

mconcat :: [Log a] -> Log a #

(Hashable a, Eq a) => Monoid (HashSet a) 
Instance details

Defined in Data.HashSet

Methods

mempty :: HashSet a #

mappend :: HashSet a -> HashSet a -> HashSet a #

mconcat :: [HashSet a] -> HashSet a #

Ord a => Monoid (SortedList a) 
Instance details

Defined in Diagrams.Core.Trace

Methods

mempty :: SortedList a #

mappend :: SortedList a -> SortedList a -> SortedList a #

mconcat :: [SortedList a] -> SortedList a #

Monoid t => Monoid (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: TransInv t #

mappend :: TransInv t -> TransInv t -> TransInv t #

mconcat :: [TransInv t] -> TransInv t #

Monoid (Parser a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Parser a #

mappend :: Parser a -> Parser a -> Parser a #

mconcat :: [Parser a] -> Parser a #

(Monoid a, Semigroup a) => Monoid (Active a) 
Instance details

Defined in Data.Active

Methods

mempty :: Active a #

mappend :: Active a -> Active a -> Active a #

mconcat :: [Active a] -> Active a #

(Num n, Ord n) => Monoid (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: ArcLength n #

mappend :: ArcLength n -> ArcLength n -> ArcLength n #

mconcat :: [ArcLength n] -> ArcLength n #

Monoid (Comparison a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Comparison a #

mappend :: Comparison a -> Comparison a -> Comparison a #

mconcat :: [Comparison a] -> Comparison a #

Monoid (Equivalence a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Equivalence a #

mappend :: Equivalence a -> Equivalence a -> Equivalence a #

mconcat :: [Equivalence a] -> Equivalence a #

Monoid (Predicate a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Predicate a #

mappend :: Predicate a -> Predicate a -> Predicate a #

mconcat :: [Predicate a] -> Predicate a #

Num n => Monoid (Duration n) 
Instance details

Defined in Data.Active

Methods

mempty :: Duration n #

mappend :: Duration n -> Duration n -> Duration n #

mconcat :: [Duration n] -> Duration n #

Monoid (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: IResult a #

mappend :: IResult a -> IResult a -> IResult a #

mconcat :: [IResult a] -> IResult a #

Monoid (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Result a #

mappend :: Result a -> Result a -> Result a #

mconcat :: [Result a] -> Result a #

Ord a => Monoid (Max a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

Ord a => Monoid (Min a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

Monoid b => Monoid (a -> b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: a -> b #

mappend :: (a -> b) -> (a -> b) -> a -> b #

mconcat :: [a -> b] -> a -> b #

(Monoid a, Monoid b) => Monoid (a, b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b) #

mappend :: (a, b) -> (a, b) -> (a, b) #

mconcat :: [(a, b)] -> (a, b) #

Monoid (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedFold s a #

mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

mconcat :: [ReifiedFold s a] -> ReifiedFold s a #

Applicative f => Monoid (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Traversed a f #

mappend :: Traversed a f -> Traversed a f -> Traversed a f #

mconcat :: [Traversed a f] -> Traversed a f #

Monad m => Monoid (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Sequenced a m #

mappend :: Sequenced a m -> Sequenced a m -> Sequenced a m #

mconcat :: [Sequenced a m] -> Sequenced a m #

Ord k => Monoid (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

mempty :: Map k v #

mappend :: Map k v -> Map k v -> Map k v #

mconcat :: [Map k v] -> Map k v #

Monoid (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

mempty :: Proxy s #

mappend :: Proxy s -> Proxy s -> Proxy s #

mconcat :: [Proxy s] -> Proxy s #

Measured v a => Monoid (FingerTree v a)

empty and ><.

Instance details

Defined in Data.FingerTree

Methods

mempty :: FingerTree v a #

mappend :: FingerTree v a -> FingerTree v a -> FingerTree v a #

mconcat :: [FingerTree v a] -> FingerTree v a #

(Metric v, OrderedField n) => Monoid (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: Trail v n #

mappend :: Trail v n -> Trail v n -> Trail v n #

mconcat :: [Trail v n] -> Trail v n #

(Additive v, Num n) => Monoid (Transformation v n) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: Transformation v n #

mappend :: Transformation v n -> Transformation v n -> Transformation v n #

mconcat :: [Transformation v n] -> Transformation v n #

(Additive v, Ord n) => Monoid (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

mempty :: BoundingBox v n #

mappend :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n #

mconcat :: [BoundingBox v n] -> BoundingBox v n #

Monoid (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

mempty :: Path v n #

mappend :: Path v n -> Path v n -> Path v n #

mconcat :: [Path v n] -> Path v n #

Typeable n => Monoid (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

mempty :: Style v n #

mappend :: Style v n -> Style v n -> Style v n #

mconcat :: [Style v n] -> Style v n #

(Eq k, Hashable k) => Monoid (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

mempty :: HashMap k v #

mappend :: HashMap k v -> HashMap k v -> HashMap k v #

mconcat :: [HashMap k v] -> HashMap k v #

Ord n => Monoid (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Methods

mempty :: Envelope v n #

mappend :: Envelope v n -> Envelope v n -> Envelope v n #

mconcat :: [Envelope v n] -> Envelope v n #

Monoid a => Monoid (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

mempty :: Measured n a #

mappend :: Measured n a -> Measured n a -> Measured n a #

mconcat :: [Measured n a] -> Measured n a #

Ord n => Monoid (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Methods

mempty :: Trace v n #

mappend :: Trace v n -> Trace v n -> Trace v n #

mconcat :: [Trace v n] -> Trace v n #

Monoid (v :-: v) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: v :-: v #

mappend :: (v :-: v) -> (v :-: v) -> v :-: v #

mconcat :: [v :-: v] -> v :-: v #

(Floating n, Ord n, Metric v) => Monoid (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: SegTree v n #

mappend :: SegTree v n -> SegTree v n -> SegTree v n #

mconcat :: [SegTree v n] -> SegTree v n #

Monoid (Parser i a) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: Parser i a #

mappend :: Parser i a -> Parser i a -> Parser i a #

mconcat :: [Parser i a] -> Parser i a #

Monoid a => Monoid (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Op a b #

mappend :: Op a b -> Op a b -> Op a b #

mconcat :: [Op a b] -> Op a b #

Monoid (f a) => Monoid (Indexing f a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

mempty :: Indexing f a #

mappend :: Indexing f a -> Indexing f a -> Indexing f a #

mconcat :: [Indexing f a] -> Indexing f a #

(Num n, Additive v) => Monoid (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: TotalOffset v n #

mappend :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n #

mconcat :: [TotalOffset v n] -> TotalOffset v n #

(Contravariant f, Applicative f) => Monoid (Folding f a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Folding f a #

mappend :: Folding f a -> Folding f a -> Folding f a #

mconcat :: [Folding f a] -> Folding f a #

Monoid (Deepening i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

mempty :: Deepening i a #

mappend :: Deepening i a -> Deepening i a -> Deepening i a #

mconcat :: [Deepening i a] -> Deepening i a #

(Apply f, Applicative f) => Monoid (TraversedF a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: TraversedF a f #

mappend :: TraversedF a f -> TraversedF a f -> TraversedF a f #

mconcat :: [TraversedF a f] -> TraversedF a f #

(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c) #

mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) #

mconcat :: [(a, b, c)] -> (a, b, c) #

Monoid (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedIndexedFold i s a #

mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #

Monoid a => Monoid (Const a b) 
Instance details

Defined in Data.Functor.Const

Methods

mempty :: Const a b #

mappend :: Const a b -> Const a b -> Const a b #

mconcat :: [Const a b] -> Const a b #

Alternative f => Monoid (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Alt f a #

mappend :: Alt f a -> Alt f a -> Alt f a #

mconcat :: [Alt f a] -> Alt f a #

(Semigroup a, Monoid a) => Monoid (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

mempty :: Tagged s a #

mappend :: Tagged s a -> Tagged s a -> Tagged s a #

mconcat :: [Tagged s a] -> Tagged s a #

Monoid m => Monoid (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Methods

mempty :: Query v n m #

mappend :: Query v n m -> Query v n m -> Query v n m #

mconcat :: [Query v n m] -> Query v n m #

Monoid (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

mempty :: Render Cairo V2 Double #

mappend :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

mconcat :: [Render Cairo V2 Double] -> Render Cairo V2 Double #

Monoid (Render NullBackend v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: Render NullBackend v n #

mappend :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n #

mconcat :: [Render NullBackend v n] -> Render NullBackend v n #

(Metric v, OrderedField n) => Monoid (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: Trail' Line v n #

mappend :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n #

mconcat :: [Trail' Line v n] -> Trail' Line v n #

Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) 
Instance details

Defined in Data.Reflection

Methods

mempty :: ReflectedMonoid a s #

mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s #

mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s #

ArrowPlus p => Monoid (Tambara p a b) 
Instance details

Defined in Data.Profunctor.Strong

Methods

mempty :: Tambara p a b #

mappend :: Tambara p a b -> Tambara p a b -> Tambara p a b #

mconcat :: [Tambara p a b] -> Tambara p a b #

Monoid (Deformation v v n) 
Instance details

Defined in Diagrams.Deform

Methods

mempty :: Deformation v v n #

mappend :: Deformation v v n -> Deformation v v n -> Deformation v v n #

mconcat :: [Deformation v v n] -> Deformation v v n #

(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d) #

mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

mconcat :: [(a, b, c, d)] -> (a, b, c, d) #

(Metric v, OrderedField n, Semigroup m) => Monoid (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: QDiagram b v n m #

mappend :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

mconcat :: [QDiagram b v n m] -> QDiagram b v n m #

Monoid (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: SubMap b v n m #

mappend :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m #

mconcat :: [SubMap b v n m] -> SubMap b v n m #

(Semigroup u, Action d u) => Monoid (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

mempty :: DUALTree d u a l #

mappend :: DUALTree d u a l -> DUALTree d u a l -> DUALTree d u a l #

mconcat :: [DUALTree d u a l] -> DUALTree d u a l #

(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d, e) #

mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #

Contravariant g => Monoid (BazaarT p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

mempty :: BazaarT p g a b t #

mappend :: BazaarT p g a b t -> BazaarT p g a b t -> BazaarT p g a b t #

mconcat :: [BazaarT p g a b t] -> BazaarT p g a b t #

data Bool #

Constructors

False 
True 
Instances
IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: * #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Bounded Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Bool #

maxBound :: Bool #

Enum Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Bool -> Bool #

pred :: Bool -> Bool #

toEnum :: Int -> Bool #

fromEnum :: Bool -> Int #

enumFrom :: Bool -> [Bool] #

enumFromThen :: Bool -> Bool -> [Bool] #

enumFromTo :: Bool -> Bool -> [Bool] #

enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #

Eq Bool 
Instance details

Defined in GHC.Classes

Methods

(==) :: Bool -> Bool -> Bool #

(/=) :: Bool -> Bool -> Bool #

Ord Bool 
Instance details

Defined in GHC.Classes

Methods

compare :: Bool -> Bool -> Ordering #

(<) :: Bool -> Bool -> Bool #

(<=) :: Bool -> Bool -> Bool #

(>) :: Bool -> Bool -> Bool #

(>=) :: Bool -> Bool -> Bool #

max :: Bool -> Bool -> Bool #

min :: Bool -> Bool -> Bool #

Read Bool

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Bool #

readList :: ReadS [Bool] #

readPrec :: ReadPrec Bool #

readListPrec :: ReadPrec [Bool] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Show Bool 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Bool -> ShowS #

show :: Bool -> String #

showList :: [Bool] -> ShowS #

Ix Bool

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Bool, Bool) -> [Bool] #

index :: (Bool, Bool) -> Bool -> Int #

unsafeIndex :: (Bool, Bool) -> Bool -> Int

inRange :: (Bool, Bool) -> Bool -> Bool #

rangeSize :: (Bool, Bool) -> Int #

unsafeRangeSize :: (Bool, Bool) -> Int

Generic Bool 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Bool :: * -> * #

Methods

from :: Bool -> Rep Bool x #

to :: Rep Bool x -> Bool #

Lift Bool 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Bool -> Q Exp #

Boolean Bool 
Instance details

Defined in Data.Boolean

Methods

true :: Bool #

false :: Bool #

notB :: Bool -> Bool #

(&&*) :: Bool -> Bool -> Bool #

(||*) :: Bool -> Bool -> Bool #

IfB Bool 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Bool => bool -> Bool -> Bool -> Bool #

EqB Bool 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(/=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

OrdB Bool 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(<=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

Random Bool 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Bool, Bool) -> g -> (Bool, g) #

random :: RandomGen g => g -> (Bool, g) #

randomRs :: RandomGen g => (Bool, Bool) -> g -> [Bool] #

randoms :: RandomGen g => g -> [Bool] #

randomRIO :: (Bool, Bool) -> IO Bool #

randomIO :: IO Bool #

NFData Bool 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Bool -> () #

SingKind Bool

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Associated Types

type DemoteRep Bool :: *

Methods

fromSing :: Sing a -> DemoteRep Bool

Storable Bool

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Bool -> Int #

alignment :: Bool -> Int #

peekElemOff :: Ptr Bool -> Int -> IO Bool #

pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () #

peekByteOff :: Ptr b -> Int -> IO Bool #

pokeByteOff :: Ptr b -> Int -> Bool -> IO () #

peek :: Ptr Bool -> IO Bool #

poke :: Ptr Bool -> Bool -> IO () #

Binary Bool 
Instance details

Defined in Data.Binary.Class

Methods

put :: Bool -> Put #

get :: Get Bool #

putList :: [Bool] -> Put #

Hashable Bool 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Bool -> Int

hash :: Bool -> Int

Unbox Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Bool 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Bool

uniformR :: PrimMonad m => (Bool, Bool) -> Gen (PrimState m) -> m Bool

IsName Bool 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Bool -> Name

ExprType Bool # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Bool #

toConcrete :: ConstVal -> Bool #

fromConcrete :: Bool -> Expression Bool #

constVal :: Bool -> ConstVal #

constExpr :: ConstVal -> Expression Bool #

IArray UArray Bool 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Bool -> (i, i) #

numElements :: Ix i => UArray i Bool -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Bool)] -> UArray i Bool

unsafeAt :: Ix i => UArray i Bool -> Int -> Bool

unsafeReplace :: Ix i => UArray i Bool -> [(Int, Bool)] -> UArray i Bool

unsafeAccum :: Ix i => (Bool -> e' -> Bool) -> UArray i Bool -> [(Int, e')] -> UArray i Bool

unsafeAccumArray :: Ix i => (Bool -> e' -> Bool) -> Bool -> (i, i) -> [(Int, e')] -> UArray i Bool

SingI False

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing False

SingI True

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing True

MVector MVector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Bool -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool

basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool)

basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool)

Vector Vector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool)

basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool)

basicLength :: Vector Bool -> Int

basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool

basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m ()

elemseq :: Vector Bool -> Bool -> b -> b

CDF StdUniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Bool -> Bool -> Double

CDF Uniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Bool -> Bool -> Double

Distribution StdUniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Bool -> RVar Bool

rvarT :: StdUniform Bool -> RVarT n Bool

Distribution Uniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Bool -> RVar Bool

rvarT :: Uniform Bool -> RVarT n Bool

MArray IOUArray Bool IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Bool -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Bool -> IO Int

newArray :: Ix i => (i, i) -> Bool -> IO (IOUArray i Bool) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool)

unsafeRead :: Ix i => IOUArray i Bool -> Int -> IO Bool

unsafeWrite :: Ix i => IOUArray i Bool -> Int -> Bool -> IO ()

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

MArray (STUArray s) Bool (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Bool -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Bool -> ST s Int

newArray :: Ix i => (i, i) -> Bool -> ST s (STUArray s i Bool) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool)

unsafeRead :: Ix i => STUArray s i Bool -> Int -> ST s Bool

unsafeWrite :: Ix i => STUArray s i Bool -> Int -> Bool -> ST s ()

type Rep Bool 
Instance details

Defined in GHC.Generics

type Rep Bool = D1 (MetaData "Bool" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "False" PrefixI False) (U1 :: * -> *) :+: C1 (MetaCons "True" PrefixI False) (U1 :: * -> *))
type BooleanOf Bool 
Instance details

Defined in Data.Boolean

type BooleanOf Bool = Bool
data Sing (a :: Bool) 
Instance details

Defined in GHC.Generics

data Sing (a :: Bool) where
type DemoteRep Bool 
Instance details

Defined in GHC.Generics

type DemoteRep Bool = Bool
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
data Vector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Bool = V_Bool (Vector Word8)
data MVector s Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Bool = MV_Bool (MVector s Word8)

data Char #

The character type Char is an enumeration whose values represent + Monoid to Semigroup.

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mempty :: IO a #

mappend :: IO a -> IO a -> IO a #

mconcat :: [IO a] -> IO a #

Monoid p => Monoid (Par1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: Par1 p #

mappend :: Par1 p -> Par1 p -> Par1 p #

mconcat :: [Par1 p] -> Par1 p #

Storable a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Storable

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (IResult a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: IResult a #

mappend :: IResult a -> IResult a -> IResult a #

mconcat :: [IResult a] -> IResult a #

Monoid (Result a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Result a #

mappend :: Result a -> Result a -> Result a #

mconcat :: [Result a] -> Result a #

Monoid (Parser a) 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mempty :: Parser a #

mappend :: Parser a -> Parser a -> Parser a #

mconcat :: [Parser a] -> Parser a #

Monoid (Predicate a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Predicate a #

mappend :: Predicate a -> Predicate a -> Predicate a #

mconcat :: [Predicate a] -> Predicate a #

Monoid (Comparison a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Comparison a #

mappend :: Comparison a -> Comparison a -> Comparison a #

mconcat :: [Comparison a] -> Comparison a #

Monoid (Equivalence a) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Equivalence a #

mappend :: Equivalence a -> Equivalence a -> Equivalence a #

mconcat :: [Equivalence a] -> Equivalence a #

(Ord a, Bounded a) => Monoid (Min a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

(Ord a, Bounded a) => Monoid (Max a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

Monoid m => Monoid (WrappedMonoid m)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: WrappedMonoid m #

mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m #

mconcat :: [WrappedMonoid m] -> WrappedMonoid m #

Semigroup a => Monoid (Option a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mempty :: Option a #

mappend :: Option a -> Option a -> Option a #

mconcat :: [Option a] -> Option a #

Monoid a => Monoid (Identity a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Identity

Methods

mempty :: Identity a #

mappend :: Identity a -> Identity a -> Identity a #

mconcat :: [Identity a] -> Identity a #

Monoid (First a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: First a #

mappend :: First a -> First a -> First a #

mconcat :: [First a] -> First a #

Monoid (Last a)

Since: base-2.1

Instance details

Defined in Data.Monoid

Methods

mempty :: Last a #

mappend :: Last a -> Last a -> Last a #

mconcat :: [Last a] -> Last a #

Monoid a => Monoid (Dual a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Dual a #

mappend :: Dual a -> Dual a -> Dual a #

mconcat :: [Dual a] -> Dual a #

Monoid (Endo a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Endo a #

mappend :: Endo a -> Endo a -> Endo a #

mconcat :: [Endo a] -> Endo a #

Num a => Monoid (Sum a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Sum a #

mappend :: Sum a -> Sum a -> Sum a #

mconcat :: [Sum a] -> Sum a #

Num a => Monoid (Product a)

Since: base-2.1

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Product a #

mappend :: Product a -> Product a -> Product a #

mconcat :: [Product a] -> Product a #

Monoid a => Monoid (Down a)

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

mempty :: Down a #

mappend :: Down a -> Down a -> Down a #

mconcat :: [Down a] -> Down a #

PrimType ty => Monoid (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Methods

mempty :: UArray ty #

mappend :: UArray ty -> UArray ty -> UArray ty #

mconcat :: [UArray ty] -> UArray ty #

PrimType ty => Monoid (Block ty) 
Instance details

Defined in Basement.Block.Base

Methods

mempty :: Block ty #

mappend :: Block ty -> Block ty -> Block ty #

mconcat :: [Block ty] -> Block ty #

Monoid (CountOf ty) 
Instance details

Defined in Basement.Types.OffsetSize

Methods

mempty :: CountOf ty #

mappend :: CountOf ty -> CountOf ty -> CountOf ty #

mconcat :: [CountOf ty] -> CountOf ty #

Monoid (PutM ()) 
Instance details

Defined in Data.Binary.Put

Methods

mempty :: PutM () #

mappend :: PutM () -> PutM () -> PutM () #

mconcat :: [PutM ()] -> PutM () #

Monoid (Parser a) 
Instance details

Defined in Data.Csv.Conversion

Methods

mempty :: Parser a #

mappend :: Parser a -> Parser a -> Parser a #

mconcat :: [Parser a] -> Parser a #

Num a => Monoid (Colour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: Colour a #

mappend :: Colour a -> Colour a -> Colour a #

mconcat :: [Colour a] -> Colour a #

Num a => Monoid (AlphaColour a) 
Instance details

Defined in Data.Colour.Internal

Methods

mempty :: AlphaColour a #

mappend :: AlphaColour a -> AlphaColour a -> AlphaColour a #

mconcat :: [AlphaColour a] -> AlphaColour a #

Monoid (IntMap a) 
Instance details

Defined in Data.IntMap.Internal

Methods

mempty :: IntMap a #

mappend :: IntMap a -> IntMap a -> IntMap a #

mconcat :: [IntMap a] -> IntMap a #

Monoid (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Methods

mempty :: Seq a #

mappend :: Seq a -> Seq a -> Seq a #

mconcat :: [Seq a] -> Seq a #

Ord a => Monoid (Set a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: Set a #

mappend :: Set a -> Set a -> Set a #

mconcat :: [Set a] -> Set a #

Monoid (DList a) 
Instance details

Defined in Data.DList

Methods

mempty :: DList a #

mappend :: DList a -> DList a -> DList a #

mconcat :: [DList a] -> DList a #

(Generic a, Monoid (Rep a ())) => Monoid (Generically a) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

mempty :: Generically a #

mappend :: Generically a -> Generically a -> Generically a #

mconcat :: [Generically a] -> Generically a #

Monoid (Doc a) 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

mempty :: Doc a #

mappend :: Doc a -> Doc a -> Doc a #

mconcat :: [Doc a] -> Doc a #

PrimUnlifted a => Monoid (UnliftedArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.UnliftedArray

Methods

mempty :: UnliftedArray a #

mappend :: UnliftedArray a -> UnliftedArray a -> UnliftedArray a #

mconcat :: [UnliftedArray a] -> UnliftedArray a #

Monoid (PrimArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Methods

mempty :: PrimArray a #

mappend :: PrimArray a -> PrimArray a -> PrimArray a #

mconcat :: [PrimArray a] -> PrimArray a #

Monoid (SmallArray a) 
Instance details

Defined in Data.Primitive.SmallArray

Methods

mempty :: SmallArray a #

mappend :: SmallArray a -> SmallArray a -> SmallArray a #

mconcat :: [SmallArray a] -> SmallArray a #

Monoid (Array a) 
Instance details

Defined in Data.Primitive.Array

Methods

mempty :: Array a #

mappend :: Array a -> Array a -> Array a #

mconcat :: [Array a] -> Array a #

(Hashable a, Eq a) => Monoid (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Methods

mempty :: HashSet a #

mappend :: HashSet a -> HashSet a -> HashSet a #

mconcat :: [HashSet a] -> HashSet a #

Prim a => Monoid (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (Vector a) 
Instance details

Defined in Data.Vector

Methods

mempty :: Vector a #

mappend :: Vector a -> Vector a -> Vector a #

mconcat :: [Vector a] -> Vector a #

Monoid (MergeSet a) 
Instance details

Defined in Data.Set.Internal

Methods

mempty :: MergeSet a #

mappend :: MergeSet a -> MergeSet a -> MergeSet a #

mconcat :: [MergeSet a] -> MergeSet a #

(Precise a, RealFloat a) => Monoid (Log a) 
Instance details

Defined in Numeric.Log

Methods

mempty :: Log a #

mappend :: Log a -> Log a -> Log a #

mconcat :: [Log a] -> Log a #

Ord a => Monoid (SortedList a) 
Instance details

Defined in Diagrams.Core.Trace

Methods

mempty :: SortedList a #

mappend :: SortedList a -> SortedList a -> SortedList a #

mconcat :: [SortedList a] -> SortedList a #

Monoid t => Monoid (TransInv t) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: TransInv t #

mappend :: TransInv t -> TransInv t -> TransInv t #

mconcat :: [TransInv t] -> TransInv t #

Monoid (Leftmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Leftmost a #

mappend :: Leftmost a -> Leftmost a -> Leftmost a #

mconcat :: [Leftmost a] -> Leftmost a #

Monoid (Rightmost a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Rightmost a #

mappend :: Rightmost a -> Rightmost a -> Rightmost a #

mconcat :: [Rightmost a] -> Rightmost a #

(Monoid a, Semigroup a) => Monoid (Active a) 
Instance details

Defined in Data.Active

Methods

mempty :: Active a #

mappend :: Active a -> Active a -> Active a #

mconcat :: [Active a] -> Active a #

(Num n, Ord n) => Monoid (ArcLength n) 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: ArcLength n #

mappend :: ArcLength n -> ArcLength n -> ArcLength n #

mconcat :: [ArcLength n] -> ArcLength n #

Num n => Monoid (Angle n) 
Instance details

Defined in Diagrams.Angle

Methods

mempty :: Angle n #

mappend :: Angle n -> Angle n -> Angle n #

mconcat :: [Angle n] -> Angle n #

Num n => Monoid (Duration n) 
Instance details

Defined in Data.Active

Methods

mempty :: Duration n #

mappend :: Duration n -> Duration n -> Duration n #

mconcat :: [Duration n] -> Duration n #

Ord a => Monoid (Max a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Max a #

mappend :: Max a -> Max a -> Max a #

mconcat :: [Max a] -> Max a #

Ord a => Monoid (Min a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Min a #

mappend :: Min a -> Min a -> Min a #

mconcat :: [Min a] -> Min a #

Monoid b => Monoid (a -> b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: a -> b #

mappend :: (a -> b) -> (a -> b) -> a -> b #

mconcat :: [a -> b] -> a -> b #

Monoid (U1 p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: U1 p #

mappend :: U1 p -> U1 p -> U1 p #

mconcat :: [U1 p] -> U1 p #

(Monoid a, Monoid b) => Monoid (a, b)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b) #

mappend :: (a, b) -> (a, b) -> (a, b) #

mconcat :: [(a, b)] -> (a, b) #

(Eq k, Hashable k) => Monoid (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Methods

mempty :: HashMap k v #

mappend :: HashMap k v -> HashMap k v -> HashMap k v #

mconcat :: [HashMap k v] -> HashMap k v #

Ord k => Monoid (Map k v) 
Instance details

Defined in Data.Map.Internal

Methods

mempty :: Map k v #

mappend :: Map k v -> Map k v -> Map k v #

mconcat :: [Map k v] -> Map k v #

Monoid (Parser i a) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mempty :: Parser i a #

mappend :: Parser i a -> Parser i a -> Parser i a #

mconcat :: [Parser i a] -> Parser i a #

Monoid a => Monoid (Op a b) 
Instance details

Defined in Data.Functor.Contravariant

Methods

mempty :: Op a b #

mappend :: Op a b -> Op a b -> Op a b #

mconcat :: [Op a b] -> Op a b #

Monoid (Proxy s)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

mempty :: Proxy s #

mappend :: Proxy s -> Proxy s -> Proxy s #

mconcat :: [Proxy s] -> Proxy s #

Measured v a => Monoid (FingerTree v a)

empty and ><.

Instance details

Defined in Data.FingerTree

Methods

mempty :: FingerTree v a #

mappend :: FingerTree v a -> FingerTree v a -> FingerTree v a #

mconcat :: [FingerTree v a] -> FingerTree v a #

(Additive v, Num n) => Monoid (Transformation v n) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: Transformation v n #

mappend :: Transformation v n -> Transformation v n -> Transformation v n #

mconcat :: [Transformation v n] -> Transformation v n #

Ord n => Monoid (Envelope v n) 
Instance details

Defined in Diagrams.Core.Envelope

Methods

mempty :: Envelope v n #

mappend :: Envelope v n -> Envelope v n -> Envelope v n #

mconcat :: [Envelope v n] -> Envelope v n #

Monoid a => Monoid (Measured n a) 
Instance details

Defined in Diagrams.Core.Measure

Methods

mempty :: Measured n a #

mappend :: Measured n a -> Measured n a -> Measured n a #

mconcat :: [Measured n a] -> Measured n a #

Typeable n => Monoid (Style v n) 
Instance details

Defined in Diagrams.Core.Style

Methods

mempty :: Style v n #

mappend :: Style v n -> Style v n -> Style v n #

mconcat :: [Style v n] -> Style v n #

Ord n => Monoid (Trace v n) 
Instance details

Defined in Diagrams.Core.Trace

Methods

mempty :: Trace v n #

mappend :: Trace v n -> Trace v n -> Trace v n #

mconcat :: [Trace v n] -> Trace v n #

Monoid (v :-: v) 
Instance details

Defined in Diagrams.Core.Transform

Methods

mempty :: v :-: v #

mappend :: (v :-: v) -> (v :-: v) -> v :-: v #

mconcat :: [v :-: v] -> v :-: v #

Monoid (Path v n) 
Instance details

Defined in Diagrams.Path

Methods

mempty :: Path v n #

mappend :: Path v n -> Path v n -> Path v n #

mconcat :: [Path v n] -> Path v n #

(Metric v, OrderedField n) => Monoid (Trail v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: Trail v n #

mappend :: Trail v n -> Trail v n -> Trail v n #

mconcat :: [Trail v n] -> Trail v n #

Monad m => Monoid (Sequenced a m) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Sequenced a m #

mappend :: Sequenced a m -> Sequenced a m -> Sequenced a m #

mconcat :: [Sequenced a m] -> Sequenced a m #

Applicative f => Monoid (Traversed a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Traversed a f #

mappend :: Traversed a f -> Traversed a f -> Traversed a f #

mconcat :: [Traversed a f] -> Traversed a f #

Monoid (ReifiedFold s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedFold s a #

mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

mconcat :: [ReifiedFold s a] -> ReifiedFold s a #

(Floating n, Ord n, Metric v) => Monoid (SegTree v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: SegTree v n #

mappend :: SegTree v n -> SegTree v n -> SegTree v n #

mconcat :: [SegTree v n] -> SegTree v n #

(Num n, Additive v) => Monoid (TotalOffset v n) 
Instance details

Defined in Diagrams.Segment

Methods

mempty :: TotalOffset v n #

mappend :: TotalOffset v n -> TotalOffset v n -> TotalOffset v n #

mconcat :: [TotalOffset v n] -> TotalOffset v n #

(Additive v, Ord n) => Monoid (BoundingBox v n) 
Instance details

Defined in Diagrams.BoundingBox

Methods

mempty :: BoundingBox v n #

mappend :: BoundingBox v n -> BoundingBox v n -> BoundingBox v n #

mconcat :: [BoundingBox v n] -> BoundingBox v n #

Monoid (f a) => Monoid (Indexing f a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

mempty :: Indexing f a #

mappend :: Indexing f a -> Indexing f a -> Indexing f a #

mconcat :: [Indexing f a] -> Indexing f a #

(Contravariant f, Applicative f) => Monoid (Folding f a) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: Folding f a #

mappend :: Folding f a -> Folding f a -> Folding f a #

mconcat :: [Folding f a] -> Folding f a #

(Apply f, Applicative f) => Monoid (TraversedF a f) 
Instance details

Defined in Control.Lens.Internal.Fold

Methods

mempty :: TraversedF a f #

mappend :: TraversedF a f -> TraversedF a f -> TraversedF a f #

mconcat :: [TraversedF a f] -> TraversedF a f #

Monoid (Deepening i a) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

mempty :: Deepening i a #

mappend :: Deepening i a -> Deepening i a -> Deepening i a #

mconcat :: [Deepening i a] -> Deepening i a #

Monoid (f p) => Monoid (Rec1 f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: Rec1 f p #

mappend :: Rec1 f p -> Rec1 f p -> Rec1 f p #

mconcat :: [Rec1 f p] -> Rec1 f p #

(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c) #

mappend :: (a, b, c) -> (a, b, c) -> (a, b, c) #

mconcat :: [(a, b, c)] -> (a, b, c) #

Monoid a => Monoid (Const a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Const

Methods

mempty :: Const a b #

mappend :: Const a b -> Const a b -> Const a b #

mconcat :: [Const a b] -> Const a b #

(Applicative f, Monoid a) => Monoid (Ap f a)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

mempty :: Ap f a #

mappend :: Ap f a -> Ap f a -> Ap f a #

mconcat :: [Ap f a] -> Ap f a #

Alternative f => Monoid (Alt f a)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mempty :: Alt f a #

mappend :: Alt f a -> Alt f a -> Alt f a #

mconcat :: [Alt f a] -> Alt f a #

ArrowPlus p => Monoid (Tambara p a b) 
Instance details

Defined in Data.Profunctor.Strong

Methods

mempty :: Tambara p a b #

mappend :: Tambara p a b -> Tambara p a b -> Tambara p a b #

mconcat :: [Tambara p a b] -> Tambara p a b #

Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) 
Instance details

Defined in Data.Reflection

Methods

mempty :: ReflectedMonoid a s #

mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s #

mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s #

(Semigroup a, Monoid a) => Monoid (Tagged s a) 
Instance details

Defined in Data.Tagged

Methods

mempty :: Tagged s a #

mappend :: Tagged s a -> Tagged s a -> Tagged s a #

mconcat :: [Tagged s a] -> Tagged s a #

Monoid m => Monoid (Query v n m) 
Instance details

Defined in Diagrams.Core.Query

Methods

mempty :: Query v n m #

mappend :: Query v n m -> Query v n m -> Query v n m #

mconcat :: [Query v n m] -> Query v n m #

Monoid (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

mempty :: Render Cairo V2 Double #

mappend :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

mconcat :: [Render Cairo V2 Double] -> Render Cairo V2 Double #

Monoid (Render NullBackend v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: Render NullBackend v n #

mappend :: Render NullBackend v n -> Render NullBackend v n -> Render NullBackend v n #

mconcat :: [Render NullBackend v n] -> Render NullBackend v n #

(Metric v, OrderedField n) => Monoid (Trail' Line v n) 
Instance details

Defined in Diagrams.Trail

Methods

mempty :: Trail' Line v n #

mappend :: Trail' Line v n -> Trail' Line v n -> Trail' Line v n #

mconcat :: [Trail' Line v n] -> Trail' Line v n #

Monoid (ReifiedIndexedFold i s a) 
Instance details

Defined in Control.Lens.Reified

Methods

mempty :: ReifiedIndexedFold i s a #

mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a #

mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a #

Monoid (Deformation v v n) 
Instance details

Defined in Diagrams.Deform

Methods

mempty :: Deformation v v n #

mappend :: Deformation v v n -> Deformation v v n -> Deformation v v n #

mconcat :: [Deformation v v n] -> Deformation v v n #

Monoid c => Monoid (K1 i c p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: K1 i c p #

mappend :: K1 i c p -> K1 i c p -> K1 i c p #

mconcat :: [K1 i c p] -> K1 i c p #

(Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: (f :*: g) p #

mappend :: (f :*: g) p -> (f :*: g) p -> (f :*: g) p #

mconcat :: [(f :*: g) p] -> (f :*: g) p #

(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d) #

mappend :: (a, b, c, d) -> (a, b, c, d) -> (a, b, c, d) #

mconcat :: [(a, b, c, d)] -> (a, b, c, d) #

(Metric v, OrderedField n, Semigroup m) => Monoid (QDiagram b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: QDiagram b v n m #

mappend :: QDiagram b v n m -> QDiagram b v n m -> QDiagram b v n m #

mconcat :: [QDiagram b v n m] -> QDiagram b v n m #

Monoid (SubMap b v n m) 
Instance details

Defined in Diagrams.Core.Types

Methods

mempty :: SubMap b v n m #

mappend :: SubMap b v n m -> SubMap b v n m -> SubMap b v n m #

mconcat :: [SubMap b v n m] -> SubMap b v n m #

(Semigroup u, Action d u) => Monoid (DUALTree d u a l) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

mempty :: DUALTree d u a l #

mappend :: DUALTree d u a l -> DUALTree d u a l -> DUALTree d u a l #

mconcat :: [DUALTree d u a l] -> DUALTree d u a l #

Monoid (f p) => Monoid (M1 i c f p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: M1 i c f p #

mappend :: M1 i c f p -> M1 i c f p -> M1 i c f p #

mconcat :: [M1 i c f p] -> M1 i c f p #

Monoid (f (g p)) => Monoid ((f :.: g) p)

Since: base-4.12.0.0

Instance details

Defined in GHC.Generics

Methods

mempty :: (f :.: g) p #

mappend :: (f :.: g) p -> (f :.: g) p -> (f :.: g) p #

mconcat :: [(f :.: g) p] -> (f :.: g) p #

(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: (a, b, c, d, e) #

mappend :: (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

mconcat :: [(a, b, c, d, e)] -> (a, b, c, d, e) #

Contravariant g => Monoid (BazaarT p g a b t) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

mempty :: BazaarT p g a b t #

mappend :: BazaarT p g a b t -> BazaarT p g a b t -> BazaarT p g a b t #

mconcat :: [BazaarT p g a b t] -> BazaarT p g a b t #

data Bool #

Constructors

False 
True 
Instances
IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: Type #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Bounded Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Bool #

maxBound :: Bool #

Enum Bool

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Bool -> Bool #

pred :: Bool -> Bool #

toEnum :: Int -> Bool #

fromEnum :: Bool -> Int #

enumFrom :: Bool -> [Bool] #

enumFromThen :: Bool -> Bool -> [Bool] #

enumFromTo :: Bool -> Bool -> [Bool] #

enumFromThenTo :: Bool -> Bool -> Bool -> [Bool] #

Eq Bool 
Instance details

Defined in GHC.Classes

Methods

(==) :: Bool -> Bool -> Bool #

(/=) :: Bool -> Bool -> Bool #

Ord Bool 
Instance details

Defined in GHC.Classes

Methods

compare :: Bool -> Bool -> Ordering #

(<) :: Bool -> Bool -> Bool #

(<=) :: Bool -> Bool -> Bool #

(>) :: Bool -> Bool -> Bool #

(>=) :: Bool -> Bool -> Bool #

max :: Bool -> Bool -> Bool #

min :: Bool -> Bool -> Bool #

Read Bool

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Bool #

readList :: ReadS [Bool] #

readPrec :: ReadPrec Bool #

readListPrec :: ReadPrec [Bool] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Show Bool

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Bool -> ShowS #

show :: Bool -> String #

showList :: [Bool] -> ShowS #

Ix Bool

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Bool, Bool) -> [Bool] #

index :: (Bool, Bool) -> Bool -> Int #

unsafeIndex :: (Bool, Bool) -> Bool -> Int

inRange :: (Bool, Bool) -> Bool -> Bool #

rangeSize :: (Bool, Bool) -> Int #

unsafeRangeSize :: (Bool, Bool) -> Int

Generic Bool 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Bool :: Type -> Type #

Methods

from :: Bool -> Rep Bool x #

to :: Rep Bool x -> Bool #

Lift Bool 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Bool -> Q Exp #

Boolean Bool 
Instance details

Defined in Data.Boolean

Methods

true :: Bool #

false :: Bool #

notB :: Bool -> Bool #

(&&*) :: Bool -> Bool -> Bool #

(||*) :: Bool -> Bool -> Bool #

IfB Bool 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Bool => bool -> Bool -> Bool -> Bool #

EqB Bool 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(/=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

OrdB Bool 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(<=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

Random Bool 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Bool, Bool) -> g -> (Bool, g) #

random :: RandomGen g => g -> (Bool, g) #

randomRs :: RandomGen g => (Bool, Bool) -> g -> [Bool] #

randoms :: RandomGen g => g -> [Bool] #

randomRIO :: (Bool, Bool) -> IO Bool #

randomIO :: IO Bool #

NFData Bool 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Bool -> () #

Hashable Bool 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Bool -> Int #

hash :: Bool -> Int #

SingKind Bool

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Associated Types

type DemoteRep Bool :: Type

Methods

fromSing :: Sing a -> DemoteRep Bool

Storable Bool

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Bool -> Int #

alignment :: Bool -> Int #

peekElemOff :: Ptr Bool -> Int -> IO Bool #

pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () #

peekByteOff :: Ptr b -> Int -> IO Bool #

pokeByteOff :: Ptr b -> Int -> Bool -> IO () #

peek :: Ptr Bool -> IO Bool #

poke :: Ptr Bool -> Bool -> IO () #

Binary Bool 
Instance details

Defined in Data.Binary.Class

Methods

put :: Bool -> Put #

get :: Get Bool #

putList :: [Bool] -> Put #

Unbox Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Bool 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Bool

uniformR :: PrimMonad m => (Bool, Bool) -> Gen (PrimState m) -> m Bool

ExprType Bool # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Bool #

toConcrete :: ConstVal -> Bool #

fromConcrete :: Bool -> Expression Bool #

constVal :: Bool -> ConstVal #

constExpr :: ConstVal -> Expression Bool #

IsName Bool 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Bool -> Name

IArray UArray Bool 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Bool -> (i, i) #

numElements :: Ix i => UArray i Bool -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Bool)] -> UArray i Bool

unsafeAt :: Ix i => UArray i Bool -> Int -> Bool

unsafeReplace :: Ix i => UArray i Bool -> [(Int, Bool)] -> UArray i Bool

unsafeAccum :: Ix i => (Bool -> e' -> Bool) -> UArray i Bool -> [(Int, e')] -> UArray i Bool

unsafeAccumArray :: Ix i => (Bool -> e' -> Bool) -> Bool -> (i, i) -> [(Int, e')] -> UArray i Bool

SingI False

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing False

SingI True

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing True

Vector Vector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) #

basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) #

basicLength :: Vector Bool -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool #

basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () #

elemseq :: Vector Bool -> Bool -> b -> b #

MVector MVector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Bool -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool #

basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) #

CDF StdUniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Bool -> Bool -> Double

CDF Uniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Bool -> Bool -> Double

Distribution StdUniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Bool -> RVar Bool

rvarT :: StdUniform Bool -> RVarT n Bool

Distribution Uniform Bool 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Bool -> RVar Bool

rvarT :: Uniform Bool -> RVarT n Bool

MArray IOUArray Bool IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Bool -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Bool -> IO Int

newArray :: Ix i => (i, i) -> Bool -> IO (IOUArray i Bool) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool)

unsafeRead :: Ix i => IOUArray i Bool -> Int -> IO Bool

unsafeWrite :: Ix i => IOUArray i Bool -> Int -> Bool -> IO ()

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

MArray (STUArray s) Bool (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Bool -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Bool -> ST s Int

newArray :: Ix i => (i, i) -> Bool -> ST s (STUArray s i Bool) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool)

unsafeRead :: Ix i => STUArray s i Bool -> Int -> ST s Bool

unsafeWrite :: Ix i => STUArray s i Bool -> Int -> Bool -> ST s ()

type Rep Bool

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep Bool = D1 (MetaData "Bool" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "False" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "True" PrefixI False) (U1 :: Type -> Type))
type BooleanOf Bool 
Instance details

Defined in Data.Boolean

type BooleanOf Bool = Bool
data Sing (a :: Bool) 
Instance details

Defined in GHC.Generics

data Sing (a :: Bool) where
type DemoteRep Bool 
Instance details

Defined in GHC.Generics

type DemoteRep Bool = Bool
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
newtype Vector Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Bool = V_Bool (Vector Word8)
newtype MVector s Bool 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Bool = MV_Bool (MVector s Word8)

data Char #

The character type Char is an enumeration whose values represent Unicode (or equivalently ISO/IEC 10646) code points (i.e. characters, see http://www.unicode.org/ for details). This set extends the ISO 8859-1 (Latin-1) character set (the first 256 characters), which is itself an extension of the ASCII character set (the first 128 characters). A character literal in Haskell has type Char.

To convert a Char to or from the corresponding Int value defined -by Unicode, use toEnum and fromEnum from the -Enum class respectively (or equivalently ord and chr).

Instances
Bounded Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Char #

maxBound :: Char #

Enum Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Char -> Char #

pred :: Char -> Char #

toEnum :: Int -> Char #

fromEnum :: Char -> Int #

enumFrom :: Char -> [Char] #

enumFromThen :: Char -> Char -> [Char] #

enumFromTo :: Char -> Char -> [Char] #

enumFromThenTo :: Char -> Char -> Char -> [Char] #

Eq Char 
Instance details

Defined in GHC.Classes

Methods

(==) :: Char -> Char -> Bool #

(/=) :: Char -> Char -> Bool #

Ord Char 
Instance details

Defined in GHC.Classes

Methods

compare :: Char -> Char -> Ordering #

(<) :: Char -> Char -> Bool #

(<=) :: Char -> Char -> Bool #

(>) :: Char -> Char -> Bool #

(>=) :: Char -> Char -> Bool #

max :: Char -> Char -> Char #

min :: Char -> Char -> Char #

Read Char

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Char #

readList :: ReadS [Char] #

readPrec :: ReadPrec Char #

readListPrec :: ReadPrec [Char] #

Show Char

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Char -> ShowS #

show :: Char -> String #

showList :: [Char] -> ShowS #

Ix Char

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Char, Char) -> [Char] #

index :: (Char, Char) -> Char -> Int #

unsafeIndex :: (Char, Char) -> Char -> Int

inRange :: (Char, Char) -> Char -> Bool #

rangeSize :: (Char, Char) -> Int #

unsafeRangeSize :: (Char, Char) -> Int

Lift Char 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Char -> Q Exp #

IfB Char 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Char => bool -> Char -> Char -> Char #

EqB Char 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(/=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

OrdB Char 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(<=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

Random Char 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Char, Char) -> g -> (Char, g) #

random :: RandomGen g => g -> (Char, g) #

randomRs :: RandomGen g => (Char, Char) -> g -> [Char] #

randoms :: RandomGen g => g -> [Char] #

randomRIO :: (Char, Char) -> IO Char #

randomIO :: IO Char #

NFData Char 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Char -> () #

PrintfArg Char

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Char -> FieldFormatter #

parseFormat :: Char -> ModifierParser #

IsChar Char

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

toChar :: Char -> Char #

fromChar :: Char -> Char #

Storable Char

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Char -> Int #

alignment :: Char -> Int #

peekElemOff :: Ptr Char -> Int -> IO Char #

pokeElemOff :: Ptr Char -> Int -> Char -> IO () #

peekByteOff :: Ptr b -> Int -> IO Char #

pokeByteOff :: Ptr b -> Int -> Char -> IO () #

peek :: Ptr Char -> IO Char #

poke :: Ptr Char -> Char -> IO () #

PrimType Char 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Char :: Nat #

Methods

primSizeInBytes :: Proxy Char -> CountOf Word8 #

primShiftToBytes :: Proxy Char -> Int #

primBaUIndex :: ByteArray# -> Offset Char -> Char #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> prim Char #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> Char -> prim () #

primAddrIndex :: Addr# -> Offset Char -> Char #

primAddrRead :: PrimMonad prim => Addr# -> Offset Char -> prim Char #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Char -> Char -> prim () #

PrimMemoryComparable Char 
Instance details

Defined in Basement.PrimType

Subtractive Char 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Char :: * #

Methods

(-) :: Char -> Char -> Difference Char #

Binary Char 
Instance details

Defined in Data.Binary.Class

Methods

put :: Char -> Put #

get :: Get Char #

putList :: [Char] -> Put #

Prim Char 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Char -> Int# #

alignment# :: Char -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Char #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Char#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Char #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Char#) #

writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s #

ErrorList Char 
Instance details

Defined in Control.Monad.Trans.Error

Methods

listMsg :: String -> [Char] #

Hashable Char 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Char -> Int

hash :: Char -> Int

Unbox Char 
Instance details

Defined in Data.Vector.Unboxed.Base

IsName Char 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Char -> Name

Parseable String 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser String

IArray UArray Char 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Char -> (i, i) #

numElements :: Ix i => UArray i Char -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Char)] -> UArray i Char

unsafeAt :: Ix i => UArray i Char -> Int -> Char

unsafeReplace :: Ix i => UArray i Char -> [(Int, Char)] -> UArray i Char

unsafeAccum :: Ix i => (Char -> e' -> Char) -> UArray i Char -> [(Int, e')] -> UArray i Char

unsafeAccumArray :: Ix i => (Char -> e' -> Char) -> Char -> (i, i) -> [(Int, e')] -> UArray i Char

MVector MVector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Char -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char

basicOverlaps :: MVector s Char -> MVector s Char -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Char)

basicInitialize :: PrimMonad m => MVector (PrimState m) Char -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Char -> m (MVector (PrimState m) Char)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Char -> Int -> m Char

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Char -> Int -> Char -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Char -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Char -> Char -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Char -> Int -> m (MVector (PrimState m) Char)

Vector Vector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Char -> m (Vector Char)

basicUnsafeThaw :: PrimMonad m => Vector Char -> m (Mutable Vector (PrimState m) Char)

basicLength :: Vector Char -> Int

basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char

basicUnsafeIndexM :: Monad m => Vector Char -> Int -> m Char

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Char -> Vector Char -> m ()

elemseq :: Vector Char -> Char -> b -> b

CDF StdUniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Char -> Char -> Double

CDF Uniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Char -> Char -> Double

Distribution StdUniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Char -> RVar Char

rvarT :: StdUniform Char -> RVarT n Char

Distribution Uniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Char -> RVar Char

rvarT :: Uniform Char -> RVarT n Char

MArray IOUArray Char IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Char -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Char -> IO Int

newArray :: Ix i => (i, i) -> Char -> IO (IOUArray i Char) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Char)

unsafeRead :: Ix i => IOUArray i Char -> Int -> IO Char

unsafeWrite :: Ix i => IOUArray i Char -> Int -> Char -> IO ()

KnownSymbol n => Reifies (n :: Symbol) String 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy n -> String

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Generic1 (URec Char :: k -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Char) :: k -> * #

Methods

from1 :: URec Char a -> Rep1 (URec Char) a #

to1 :: Rep1 (URec Char) a -> URec Char a #

ToResult [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type Args [(String, QDiagram b v n Any)] :: *

type ResultOf [(String, QDiagram b v n Any)] :: *

Methods

toResult :: [(String, QDiagram b v n Any)] -> Args [(String, QDiagram b v n Any)] -> ResultOf [(String, QDiagram b v n Any)]

MArray (STUArray s) Char (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Char -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Char -> ST s Int

newArray :: Ix i => (i, i) -> Char -> ST s (STUArray s i Char) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Char)

unsafeRead :: Ix i => STUArray s i Char -> Int -> ST s Char

unsafeWrite :: Ix i => STUArray s i Char -> Int -> Char -> ST s ()

Functor (URec Char :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Foldable (URec Char :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Char m -> m #

foldMap :: Monoid m => (a -> m) -> URec Char a -> m #

foldr :: (a -> b -> b) -> b -> URec Char a -> b #

foldr' :: (a -> b -> b) -> b -> URec Char a -> b #

foldl :: (b -> a -> b) -> b -> URec Char a -> b #

foldl' :: (b -> a -> b) -> b -> URec Char a -> b #

foldr1 :: (a -> a -> a) -> URec Char a -> a #

foldl1 :: (a -> a -> a) -> URec Char a -> a #

toList :: URec Char a -> [a] #

null :: URec Char a -> Bool #

length :: URec Char a -> Int #

elem :: Eq a => a -> URec Char a -> Bool #

maximum :: Ord a => URec Char a -> a #

minimum :: Ord a => URec Char a -> a #

sum :: Num a => URec Char a -> a #

product :: Num a => URec Char a -> a #

Traversable (URec Char :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Eq (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Char p -> URec Char p -> Bool #

(/=) :: URec Char p -> URec Char p -> Bool #

Ord (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering #

(<) :: URec Char p -> URec Char p -> Bool #

(<=) :: URec Char p -> URec Char p -> Bool #

(>) :: URec Char p -> URec Char p -> Bool #

(>=) :: URec Char p -> URec Char p -> Bool #

max :: URec Char p -> URec Char p -> URec Char p #

min :: URec Char p -> URec Char p -> URec Char p #

Show (URec Char p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Char p -> ShowS #

show :: URec Char p -> String #

showList :: [URec Char p] -> ShowS #

Generic (URec Char p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Char p) :: * -> * #

Methods

from :: URec Char p -> Rep (URec Char p) x #

to :: Rep (URec Char p) x -> URec Char p #

type BooleanOf Char 
Instance details

Defined in Data.Boolean

type BooleanOf Char = Bool
type PrimSize Char 
Instance details

Defined in Basement.PrimType

type PrimSize Char = 4
type Difference Char 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Char = Int
type NatNumMaxBound Char 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Char = 1114111
data Vector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Char = V_Char (Vector Char)
data URec Char (p :: k)

Used for marking occurrences of Char#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Char (p :: k) = UChar {}
data MVector s Char 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Char = MV_Char (MVector s Char)
type Rep1 (URec Char :: k -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (URec Char :: k -> *) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: k -> *)))
type Args [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

type Args [(String, QDiagram b v n Any)] = ()
type ResultOf [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

type ResultOf [(String, QDiagram b v n Any)] = [(String, QDiagram b v n Any)]
type Rep (URec Char p) 
Instance details

Defined in GHC.Generics

type Rep (URec Char p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: * -> *)))

data Double #

Double-precision floating point numbers. +by Unicode, use toEnum and fromEnum from the +Enum class respectively (or equivalently ord and chr).

Instances
Bounded Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Char #

maxBound :: Char #

Enum Char

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Char -> Char #

pred :: Char -> Char #

toEnum :: Int -> Char #

fromEnum :: Char -> Int #

enumFrom :: Char -> [Char] #

enumFromThen :: Char -> Char -> [Char] #

enumFromTo :: Char -> Char -> [Char] #

enumFromThenTo :: Char -> Char -> Char -> [Char] #

Eq Char 
Instance details

Defined in GHC.Classes

Methods

(==) :: Char -> Char -> Bool #

(/=) :: Char -> Char -> Bool #

Ord Char 
Instance details

Defined in GHC.Classes

Methods

compare :: Char -> Char -> Ordering #

(<) :: Char -> Char -> Bool #

(<=) :: Char -> Char -> Bool #

(>) :: Char -> Char -> Bool #

(>=) :: Char -> Char -> Bool #

max :: Char -> Char -> Char #

min :: Char -> Char -> Char #

Read Char

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Char #

readList :: ReadS [Char] #

readPrec :: ReadPrec Char #

readListPrec :: ReadPrec [Char] #

Show Char

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Char -> ShowS #

show :: Char -> String #

showList :: [Char] -> ShowS #

Ix Char

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Char, Char) -> [Char] #

index :: (Char, Char) -> Char -> Int #

unsafeIndex :: (Char, Char) -> Char -> Int

inRange :: (Char, Char) -> Char -> Bool #

rangeSize :: (Char, Char) -> Int #

unsafeRangeSize :: (Char, Char) -> Int

Lift Char 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Char -> Q Exp #

IfB Char 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Char => bool -> Char -> Char -> Char #

EqB Char 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(/=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

OrdB Char 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(<=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

Random Char 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Char, Char) -> g -> (Char, g) #

random :: RandomGen g => g -> (Char, g) #

randomRs :: RandomGen g => (Char, Char) -> g -> [Char] #

randoms :: RandomGen g => g -> [Char] #

randomRIO :: (Char, Char) -> IO Char #

randomIO :: IO Char #

NFData Char 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Char -> () #

Hashable Char 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Char -> Int #

hash :: Char -> Int #

PrintfArg Char

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Char -> FieldFormatter #

parseFormat :: Char -> ModifierParser #

IsChar Char

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

toChar :: Char -> Char #

fromChar :: Char -> Char #

Storable Char

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Char -> Int #

alignment :: Char -> Int #

peekElemOff :: Ptr Char -> Int -> IO Char #

pokeElemOff :: Ptr Char -> Int -> Char -> IO () #

peekByteOff :: Ptr b -> Int -> IO Char #

pokeByteOff :: Ptr b -> Int -> Char -> IO () #

peek :: Ptr Char -> IO Char #

poke :: Ptr Char -> Char -> IO () #

PrimType Char 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Char :: Nat #

Methods

primSizeInBytes :: Proxy Char -> CountOf Word8 #

primShiftToBytes :: Proxy Char -> Int #

primBaUIndex :: ByteArray# -> Offset Char -> Char #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> prim Char #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Char -> Char -> prim () #

primAddrIndex :: Addr# -> Offset Char -> Char #

primAddrRead :: PrimMonad prim => Addr# -> Offset Char -> prim Char #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Char -> Char -> prim () #

PrimMemoryComparable Char 
Instance details

Defined in Basement.PrimType

Subtractive Char 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Char :: Type #

Methods

(-) :: Char -> Char -> Difference Char #

Binary Char 
Instance details

Defined in Data.Binary.Class

Methods

put :: Char -> Put #

get :: Get Char #

putList :: [Char] -> Put #

FromField Char

Assumes UTF-8 encoding.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Char #

ToField Char

Uses UTF-8 encoding.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Char -> Field #

Prim Char 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Char -> Int# #

alignment# :: Char -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Char #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Char#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Char -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Char -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Char #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Char#) #

writeOffAddr# :: Addr# -> Int# -> Char -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Char -> State# s -> State# s #

ErrorList Char 
Instance details

Defined in Control.Monad.Trans.Error

Methods

listMsg :: String -> [Char] #

Unbox Char 
Instance details

Defined in Data.Vector.Unboxed.Base

IsName Char 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Char -> Name

Parseable String 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser String

IArray UArray Char 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Char -> (i, i) #

numElements :: Ix i => UArray i Char -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Char)] -> UArray i Char

unsafeAt :: Ix i => UArray i Char -> Int -> Char

unsafeReplace :: Ix i => UArray i Char -> [(Int, Char)] -> UArray i Char

unsafeAccum :: Ix i => (Char -> e' -> Char) -> UArray i Char -> [(Int, e')] -> UArray i Char

unsafeAccumArray :: Ix i => (Char -> e' -> Char) -> Char -> (i, i) -> [(Int, e')] -> UArray i Char

Vector Vector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Char -> m (Vector Char) #

basicUnsafeThaw :: PrimMonad m => Vector Char -> m (Mutable Vector (PrimState m) Char) #

basicLength :: Vector Char -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char #

basicUnsafeIndexM :: Monad m => Vector Char -> Int -> m Char #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Char -> Vector Char -> m () #

elemseq :: Vector Char -> Char -> b -> b #

MVector MVector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Char -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Char -> MVector s Char #

basicOverlaps :: MVector s Char -> MVector s Char -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Char) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Char -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Char -> m (MVector (PrimState m) Char) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Char -> Int -> m Char #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Char -> Int -> Char -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Char -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Char -> Char -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Char -> MVector (PrimState m) Char -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Char -> Int -> m (MVector (PrimState m) Char) #

CDF StdUniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Char -> Char -> Double

CDF Uniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Char -> Char -> Double

Distribution StdUniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Char -> RVar Char

rvarT :: StdUniform Char -> RVarT n Char

Distribution Uniform Char 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Char -> RVar Char

rvarT :: Uniform Char -> RVarT n Char

MArray IOUArray Char IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Char -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Char -> IO Int

newArray :: Ix i => (i, i) -> Char -> IO (IOUArray i Char) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Char)

unsafeRead :: Ix i => IOUArray i Char -> Int -> IO Char

unsafeWrite :: Ix i => IOUArray i Char -> Int -> Char -> IO ()

KnownSymbol n => Reifies (n :: Symbol) String 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy n -> String #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Cons Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Cons :: Prism Text Text (Char, Text) (Char, Text) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Snoc Text Text Char Char 
Instance details

Defined in Control.Lens.Cons

Methods

_Snoc :: Prism Text Text (Text, Char) (Text, Char) #

Generic1 (URec Char :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Char) :: k -> Type #

Methods

from1 :: URec Char a -> Rep1 (URec Char) a #

to1 :: Rep1 (URec Char) a -> URec Char a #

FromField [Char]

Assumes UTF-8 encoding. Fails on invalid byte sequences.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser [Char] #

ToField [Char]

Uses UTF-8 encoding.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: [Char] -> Field #

ToResult [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type Args [(String, QDiagram b v n Any)] :: Type

type ResultOf [(String, QDiagram b v n Any)] :: Type

Methods

toResult :: [(String, QDiagram b v n Any)] -> Args [(String, QDiagram b v n Any)] -> ResultOf [(String, QDiagram b v n Any)]

MArray (STUArray s) Char (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Char -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Char -> ST s Int

newArray :: Ix i => (i, i) -> Char -> ST s (STUArray s i Char) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Char)

unsafeRead :: Ix i => STUArray s i Char -> Int -> ST s Char

unsafeWrite :: Ix i => STUArray s i Char -> Int -> Char -> ST s ()

Functor (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Foldable (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Char m -> m #

foldMap :: Monoid m => (a -> m) -> URec Char a -> m #

foldr :: (a -> b -> b) -> b -> URec Char a -> b #

foldr' :: (a -> b -> b) -> b -> URec Char a -> b #

foldl :: (b -> a -> b) -> b -> URec Char a -> b #

foldl' :: (b -> a -> b) -> b -> URec Char a -> b #

foldr1 :: (a -> a -> a) -> URec Char a -> a #

foldl1 :: (a -> a -> a) -> URec Char a -> a #

toList :: URec Char a -> [a] #

null :: URec Char a -> Bool #

length :: URec Char a -> Int #

elem :: Eq a => a -> URec Char a -> Bool #

maximum :: Ord a => URec Char a -> a #

minimum :: Ord a => URec Char a -> a #

sum :: Num a => URec Char a -> a #

product :: Num a => URec Char a -> a #

Traversable (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Char a -> f (URec Char b) #

sequenceA :: Applicative f => URec Char (f a) -> f (URec Char a) #

mapM :: Monad m => (a -> m b) -> URec Char a -> m (URec Char b) #

sequence :: Monad m => URec Char (m a) -> m (URec Char a) #

Eq (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Char p -> URec Char p -> Bool #

(/=) :: URec Char p -> URec Char p -> Bool #

Ord (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Char p -> URec Char p -> Ordering #

(<) :: URec Char p -> URec Char p -> Bool #

(<=) :: URec Char p -> URec Char p -> Bool #

(>) :: URec Char p -> URec Char p -> Bool #

(>=) :: URec Char p -> URec Char p -> Bool #

max :: URec Char p -> URec Char p -> URec Char p #

min :: URec Char p -> URec Char p -> URec Char p #

Show (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Char p -> ShowS #

show :: URec Char p -> String #

showList :: [URec Char p] -> ShowS #

Generic (URec Char p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Char p) :: Type -> Type #

Methods

from :: URec Char p -> Rep (URec Char p) x #

to :: Rep (URec Char p) x -> URec Char p #

type BooleanOf Char 
Instance details

Defined in Data.Boolean

type BooleanOf Char = Bool
type PrimSize Char 
Instance details

Defined in Basement.PrimType

type PrimSize Char = 4
type Difference Char 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Char = Int
type NatNumMaxBound Char 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Char = 1114111
newtype Vector Char 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Char = V_Char (Vector Char)
data URec Char (p :: k)

Used for marking occurrences of Char#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Char (p :: k) = UChar {}
newtype MVector s Char 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Char = MV_Char (MVector s Char)
type Rep1 (URec Char :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Char :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: k -> Type)))
type Args [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

type Args [(String, QDiagram b v n Any)] = ()
type ResultOf [(String, QDiagram b v n Any)] 
Instance details

Defined in Diagrams.Backend.CmdLine

type ResultOf [(String, QDiagram b v n Any)] = [(String, QDiagram b v n Any)]
type Rep (URec Char p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep (URec Char p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UChar" PrefixI True) (S1 (MetaSel (Just "uChar#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UChar :: Type -> Type)))

data Double #

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
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: * #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: * #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

Eq Double 
Instance details

Defined in GHC.Classes

Methods

(==) :: Double -> Double -> Bool #

(/=) :: Double -> Double -> Bool #

Floating Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Double #

exp :: Double -> Double #

log :: Double -> Double #

sqrt :: Double -> Double #

(**) :: Double -> Double -> Double #

logBase :: Double -> Double -> Double #

sin :: Double -> Double #

cos :: Double -> Double #

tan :: Double -> Double #

asin :: Double -> Double #

acos :: Double -> Double #

atan :: Double -> Double #

sinh :: Double -> Double #

cosh :: Double -> Double #

tanh :: Double -> Double #

asinh :: Double -> Double #

acosh :: Double -> Double #

atanh :: Double -> Double #

log1p :: Double -> Double #

expm1 :: Double -> Double #

log1pexp :: Double -> Double #

log1mexp :: Double -> Double #

Ord Double 
Instance details

Defined in GHC.Classes

Methods

compare :: Double -> Double -> Ordering #

(<) :: Double -> Double -> Bool #

(<=) :: Double -> Double -> Bool #

(>) :: Double -> Double -> Bool #

(>=) :: Double -> Double -> Bool #

max :: Double -> Double -> Double #

min :: Double -> Double -> Double #

Read Double

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Double #

readList :: ReadS [Double] #

readPrec :: ReadPrec Double #

readListPrec :: ReadPrec [Double] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

RealFloat Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Double -> Integer #

floatDigits :: Double -> Int #

floatRange :: Double -> (Int, Int) #

decodeFloat :: Double -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Double #

exponent :: Double -> Int #

significand :: Double -> Double #

scaleFloat :: Int -> Double -> Double #

isNaN :: Double -> Bool #

isInfinite :: Double -> Bool #

isDenormalized :: Double -> Bool #

isNegativeZero :: Double -> Bool #

isIEEE :: Double -> Bool #

atan2 :: Double -> Double -> Double #

Lift Double 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Double -> Q Exp #

IfB Double 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Double => bool -> Double -> Double -> Double #

EqB Double 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(/=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

OrdB Double 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(<=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

Default Double 
Instance details

Defined in Data.Default.Class

Methods

def :: Double #

BarsPlotValue Double 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Double #

barsAdd :: Double -> Double -> Double #

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] #

randomRIO :: (Double, Double) -> IO Double #

randomIO :: IO Double #

NFData Double 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Double -> () #

PrintfArg Double

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Double -> FieldFormatter #

parseFormat :: Double -> ModifierParser #

Storable Double

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Double -> Int #

alignment :: Double -> Int #

peekElemOff :: Ptr Double -> Int -> IO Double #

pokeElemOff :: Ptr Double -> Int -> Double -> IO () #

peekByteOff :: Ptr b -> Int -> IO Double #

pokeByteOff :: Ptr b -> Int -> Double -> IO () #

peek :: Ptr Double -> IO Double #

poke :: Ptr Double -> Double -> IO () #

PrimType Double 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Double :: Nat #

Methods

primSizeInBytes :: Proxy Double -> CountOf Word8 #

primShiftToBytes :: Proxy Double -> Int #

primBaUIndex :: ByteArray# -> Offset Double -> Double #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> prim Double #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> Double -> prim () #

primAddrIndex :: Addr# -> Offset Double -> Double #

primAddrRead :: PrimMonad prim => Addr# -> Offset Double -> prim Double #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Double -> Double -> prim () #

Subtractive Double 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Double :: * #

Methods

(-) :: Double -> Double -> Difference Double #

Binary Double 
Instance details

Defined in Data.Binary.Class

Methods

put :: Double -> Put #

get :: Get Double #

putList :: [Double] -> Put #

Prim Double 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Double -> Int# #

alignment# :: Double -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Double #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Double#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Double #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Double#) #

writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s #

Field Double 
Instance details

Defined in Internal.Algorithms

Methods

svd' :: Matrix Double -> (Matrix Double, Vector Double, Matrix Double)

thinSVD' :: Matrix Double -> (Matrix Double, Vector Double, Matrix Double)

sv' :: Matrix Double -> Vector Double

luPacked' :: Matrix Double -> (Matrix Double, [Int])

luSolve' :: (Matrix Double, [Int]) -> Matrix Double -> Matrix Double

mbLinearSolve' :: Matrix Double -> Matrix Double -> Maybe (Matrix Double)

linearSolve' :: Matrix Double -> Matrix Double -> Matrix Double

cholSolve' :: Matrix Double -> Matrix Double -> Matrix Double

triSolve' :: UpLo -> Matrix Double -> Matrix Double -> Matrix Double

triDiagSolve' :: Vector Double -> Vector Double -> Vector Double -> Matrix Double -> Matrix Double

ldlPacked' :: Matrix Double -> (Matrix Double, [Int])

ldlSolve' :: (Matrix Double, [Int]) -> Matrix Double -> Matrix Double

linearSolveSVD' :: Matrix Double -> Matrix Double -> Matrix Double

linearSolveLS' :: Matrix Double -> Matrix Double -> Matrix Double

eig' :: Matrix Double -> (Vector (Complex Double), Matrix (Complex Double))

eigSH'' :: Matrix Double -> (Vector Double, Matrix Double)

eigOnly :: Matrix Double -> Vector (Complex Double)

eigOnlySH :: Matrix Double -> Vector Double

cholSH' :: Matrix Double -> Matrix Double

mbCholSH' :: Matrix Double -> Maybe (Matrix Double)

qr' :: Matrix Double -> (Matrix Double, Vector Double)

qrgr' :: Int -> (Matrix Double, Vector Double) -> Matrix Double

hess' :: Matrix Double -> (Matrix Double, Matrix Double)

schur' :: Matrix Double -> (Matrix Double, Matrix Double)

Element Double 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Double -> Int -> Vector Double

extractR :: MatrixOrder -> Matrix Double -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix Double)

setRect :: Int -> Int -> Matrix Double -> Matrix Double -> IO ()

sortI :: Vector Double -> Vector CInt

sortV :: Vector Double -> Vector Double

compareV :: Vector Double -> Vector Double -> Vector CInt

selectV :: Vector CInt -> Vector Double -> Vector Double -> Vector Double -> Vector Double

remapM :: Matrix CInt -> Matrix CInt -> Matrix Double -> Matrix Double

rowOp :: Int -> Double -> Int -> Int -> Int -> Int -> Matrix Double -> IO ()

gemm :: Vector Double -> Matrix Double -> Matrix Double -> Matrix Double -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector Double -> Vector Double

Convert Double 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf Double) -> c Double

complex :: Complexable c => c Double -> c (ComplexOf Double)

single :: Complexable c => c Double -> c (SingleOf Double)

double :: Complexable c => c Double -> c (DoubleOf Double)

toComplex :: (Complexable c, RealElement Double) => (c Double, c Double) -> c (Complex Double)

fromComplex :: (Complexable c, RealElement Double) => c (Complex Double) -> (c Double, c Double)

Numeric Double 
Instance details

Defined in Internal.Numeric

Product Double 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix Double -> Matrix Double -> Matrix Double

absSum :: Vector Double -> RealOf Double

norm1 :: Vector Double -> RealOf Double

norm2 :: Vector Double -> RealOf Double

normInf :: Vector Double -> RealOf Double

CTrans C 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix C -> Matrix C

CTrans R 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix R -> Matrix R

Hashable Double 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Double -> Int

hash :: Double -> Int

Unbox Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Double 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Double

uniformR :: PrimMonad m => (Double, Double) -> Gen (PrimState m) -> m Double

Precise Double 
Instance details

Defined in Numeric.Log

Methods

log1p :: Double -> Double

expm1 :: Double -> Double

log1pexp :: Double -> Double

log1mexp :: Double -> Double

IsName Double 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Double -> Name

Parseable Double 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser Double

Summation Double 
Instance details

Defined in Numeric.Sum

Methods

zero :: Double

add :: Double -> Double -> Double

sum :: Foldable f => (Double -> Double) -> f Double -> Double

Transfinite Double 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Double #

negativeInfinity :: Double #

notANumber :: Double #

isInfinite :: Double -> Bool

isNaN :: Double -> Bool

PartialOrd Double 
Instance details

Defined in Data.Number.PartialOrd

Methods

cmp :: Double -> Double -> Maybe Ordering

gt :: Double -> Double -> Maybe Bool

ge :: Double -> Double -> Maybe Bool

eq :: Double -> Double -> Maybe Bool

ne :: Double -> Double -> Maybe Bool

le :: Double -> Double -> Maybe Bool

lt :: Double -> Double -> Maybe Bool

maxPO :: Double -> Double -> Maybe Double

minPO :: Double -> Double -> Maybe Double

ExprType Double # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Double #

toConcrete :: ConstVal -> Double #

fromConcrete :: Double -> Expression Double #

constVal :: Double -> ConstVal #

constExpr :: ConstVal -> Expression Double #

IArray UArray Double 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Double -> (i, i) #

numElements :: Ix i => UArray i Double -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Double)] -> UArray i Double

unsafeAt :: Ix i => UArray i Double -> Int -> Double

unsafeReplace :: Ix i => UArray i Double -> [(Int, Double)] -> UArray i Double

unsafeAccum :: Ix i => (Double -> e' -> Double) -> UArray i Double -> [(Int, e')] -> UArray i Double

unsafeAccumArray :: Ix i => (Double -> e' -> Double) -> Double -> (i, i) -> [(Int, e')] -> UArray i Double

Container Vector Double 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector Double -> Vector Double

size' :: Vector Double -> IndexOf Vector

scalar' :: Double -> Vector Double

scale' :: Double -> Vector Double -> Vector Double

addConstant :: Double -> Vector Double -> Vector Double

add' :: Vector Double -> Vector Double -> Vector Double

sub :: Vector Double -> Vector Double -> Vector Double

mul :: Vector Double -> Vector Double -> Vector Double

equal :: Vector Double -> Vector Double -> Bool

cmap' :: Element b => (Double -> b) -> Vector Double -> Vector b

konst' :: Double -> IndexOf Vector -> Vector Double

build' :: IndexOf Vector -> ArgOf Vector Double -> Vector Double

atIndex' :: Vector Double -> IndexOf Vector -> Double

minIndex' :: Vector Double -> IndexOf Vector

maxIndex' :: Vector Double -> IndexOf Vector

minElement' :: Vector Double -> Double

maxElement' :: Vector Double -> Double

sumElements' :: Vector Double -> Double

prodElements' :: Vector Double -> Double

step' :: Vector Double -> Vector Double

ccompare' :: Vector Double -> Vector Double -> Vector I

cselect' :: Vector I -> Vector Double -> Vector Double -> Vector Double -> Vector Double

find' :: (Double -> Bool) -> Vector Double -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Double -> [(IndexOf Vector, Double)] -> Vector Double

accum' :: Vector Double -> (Double -> Double -> Double) -> [(IndexOf Vector, Double)] -> Vector Double

scaleRecip :: Double -> Vector Double -> Vector Double

divide :: Vector Double -> Vector Double -> Vector Double

arctan2' :: Vector Double -> Vector Double -> Vector Double

cmod' :: Double -> Vector Double -> Vector Double

fromInt' :: Vector I -> Vector Double

toInt' :: Vector Double -> Vector I

fromZ' :: Vector Z -> Vector Double

toZ' :: Vector Double -> Vector Z

MVector MVector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Double -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double

basicOverlaps :: MVector s Double -> MVector s Double -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double)

basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Double -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double)

Vector Vector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double)

basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double)

basicLength :: Vector Double -> Int

basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double

basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m ()

elemseq :: Vector Double -> Double -> b -> b

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

Normed Matrix Double 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix Double -> RealOf Double

Normed Vector Double 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector Double -> RealOf Double

CDF StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Double -> Double -> Double

CDF Uniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Double -> Double -> Double

Distribution Normal Double 
Instance details

Defined in Data.Random.Distribution.Normal

Methods

rvar :: Normal Double -> RVar Double

rvarT :: Normal Double -> RVarT n Double

Distribution StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Double -> RVar Double

rvarT :: StdUniform Double -> RVarT n Double

Distribution Uniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Double -> RVar Double

rvarT :: Uniform Double -> RVarT n Double

Distribution Beta Double 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

rvar :: Beta Double -> RVar Double

rvarT :: Beta Double -> RVarT n Double

PDF StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

pdf :: StdUniform Double -> Double -> Double

logPdf :: StdUniform Double -> Double -> Double

PDF Beta Double 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

pdf :: Beta Double -> Double -> Double

logPdf :: Beta Double -> Double -> Double

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

MArray IOUArray Double IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Double -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Double -> IO Int

newArray :: Ix i => (i, i) -> Double -> IO (IOUArray i Double) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Double)

unsafeRead :: Ix i => IOUArray i Double -> Int -> IO Double

unsafeWrite :: Ix i => IOUArray i Double -> Int -> Double -> IO ()

Backend Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Associated Types

data Render Cairo V2 Double :: *

type Result Cairo V2 Double :: *

data Options Cairo V2 Double :: *

Methods

adjustDia :: (Additive V2, Monoid' m, Num Double) => Cairo -> Options Cairo V2 Double -> QDiagram Cairo V2 Double m -> (Options Cairo V2 Double, Transformation V2 Double, QDiagram Cairo V2 Double m)

renderRTree :: Cairo -> Options Cairo V2 Double -> RTree Cairo V2 Double Annotation -> Result Cairo V2 Double

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Each ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (AlphaColour Double) (AlphaColour Double) #

Container Vector (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector (Complex Double) -> Vector (Complex Double)

size' :: Vector (Complex Double) -> IndexOf Vector

scalar' :: Complex Double -> Vector (Complex Double)

scale' :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

addConstant :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

add' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

sub :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

mul :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

equal :: Vector (Complex Double) -> Vector (Complex Double) -> Bool

cmap' :: Element b => (Complex Double -> b) -> Vector (Complex Double) -> Vector b

konst' :: Complex Double -> IndexOf Vector -> Vector (Complex Double)

build' :: IndexOf Vector -> ArgOf Vector (Complex Double) -> Vector (Complex Double)

atIndex' :: Vector (Complex Double) -> IndexOf Vector -> Complex Double

minIndex' :: Vector (Complex Double) -> IndexOf Vector

maxIndex' :: Vector (Complex Double) -> IndexOf Vector

minElement' :: Vector (Complex Double) -> Complex Double

maxElement' :: Vector (Complex Double) -> Complex Double

sumElements' :: Vector (Complex Double) -> Complex Double

prodElements' :: Vector (Complex Double) -> Complex Double

step' :: Vector (Complex Double) -> Vector (Complex Double)

ccompare' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector I

cselect' :: Vector I -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

find' :: (Complex Double -> Bool) -> Vector (Complex Double) -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Complex Double -> [(IndexOf Vector, Complex Double)] -> Vector (Complex Double)

accum' :: Vector (Complex Double) -> (Complex Double -> Complex Double -> Complex Double) -> [(IndexOf Vector, Complex Double)] -> Vector (Complex Double)

scaleRecip :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

divide :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

arctan2' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

cmod' :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

fromInt' :: Vector I -> Vector (Complex Double)

toInt' :: Vector (Complex Double) -> Vector I

fromZ' :: Vector Z -> Vector (Complex Double)

toZ' :: Vector (Complex Double) -> Vector Z

Normed Matrix (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix (Complex Double) -> RealOf (Complex Double)

Normed Vector (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector (Complex Double) -> RealOf (Complex Double)

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Generic1 (URec Double :: k -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Double) :: k -> * #

Methods

from1 :: URec Double a -> Rep1 (URec Double) a #

to1 :: Rep1 (URec Double) a -> URec Double a #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

Field (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

svd' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector Double, Matrix (Complex Double))

thinSVD' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector Double, Matrix (Complex Double))

sv' :: Matrix (Complex Double) -> Vector Double

luPacked' :: Matrix (Complex Double) -> (Matrix (Complex Double), [Int])

luSolve' :: (Matrix (Complex Double), [Int]) -> Matrix (Complex Double) -> Matrix (Complex Double)

mbLinearSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Maybe (Matrix (Complex Double))

linearSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

cholSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

triSolve' :: UpLo -> Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

triDiagSolve' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

ldlPacked' :: Matrix (Complex Double) -> (Matrix (Complex Double), [Int])

ldlSolve' :: (Matrix (Complex Double), [Int]) -> Matrix (Complex Double) -> Matrix (Complex Double)

linearSolveSVD' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

linearSolveLS' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

eig' :: Matrix (Complex Double) -> (Vector (Complex Double), Matrix (Complex Double))

eigSH'' :: Matrix (Complex Double) -> (Vector Double, Matrix (Complex Double))

eigOnly :: Matrix (Complex Double) -> Vector (Complex Double)

eigOnlySH :: Matrix (Complex Double) -> Vector Double

cholSH' :: Matrix (Complex Double) -> Matrix (Complex Double)

mbCholSH' :: Matrix (Complex Double) -> Maybe (Matrix (Complex Double))

qr' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector (Complex Double))

qrgr' :: Int -> (Matrix (Complex Double), Vector (Complex Double)) -> Matrix (Complex Double)

hess' :: Matrix (Complex Double) -> (Matrix (Complex Double), Matrix (Complex Double))

schur' :: Matrix (Complex Double) -> (Matrix (Complex Double), Matrix (Complex Double))

Element (Complex Double) 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Complex Double -> Int -> Vector (Complex Double)

extractR :: MatrixOrder -> Matrix (Complex Double) -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix (Complex Double))

setRect :: Int -> Int -> Matrix (Complex Double) -> Matrix (Complex Double) -> IO ()

sortI :: Vector (Complex Double) -> Vector CInt

sortV :: Vector (Complex Double) -> Vector (Complex Double)

compareV :: Vector (Complex Double) -> Vector (Complex Double) -> Vector CInt

selectV :: Vector CInt -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

remapM :: Matrix CInt -> Matrix CInt -> Matrix (Complex Double) -> Matrix (Complex Double)

rowOp :: Int -> Complex Double -> Int -> Int -> Int -> Int -> Matrix (Complex Double) -> IO ()

gemm :: Vector (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double) -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector (Complex Double) -> Vector (Complex Double)

Convert (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf (Complex Double)) -> c (Complex Double)

complex :: Complexable c => c (Complex Double) -> c (ComplexOf (Complex Double))

single :: Complexable c => c (Complex Double) -> c (SingleOf (Complex Double))

double :: Complexable c => c (Complex Double) -> c (DoubleOf (Complex Double))

toComplex :: (Complexable c, RealElement (Complex Double)) => (c (Complex Double), c (Complex Double)) -> c (Complex (Complex Double))

fromComplex :: (Complexable c, RealElement (Complex Double)) => c (Complex (Complex Double)) -> (c (Complex Double), c (Complex Double))

Numeric (Complex Double) 
Instance details

Defined in Internal.Numeric

Product (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

absSum :: Vector (Complex Double) -> RealOf (Complex Double)

norm1 :: Vector (Complex Double) -> RealOf (Complex Double)

norm2 :: Vector (Complex Double) -> RealOf (Complex Double)

normInf :: Vector (Complex Double) -> RealOf (Complex Double)

Normed (Matrix C) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Matrix C -> R

norm_1 :: Matrix C -> R

norm_2 :: Matrix C -> R

norm_Inf :: Matrix C -> R

Normed (Matrix R) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Matrix R -> R

norm_1 :: Matrix R -> R

norm_2 :: Matrix R -> R

norm_Inf :: Matrix R -> R

Normed (Vector C) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector C -> R

norm_1 :: Vector C -> R

norm_2 :: Vector C -> R

norm_Inf :: Vector C -> R

Normed (Vector R) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector R -> R

norm_1 :: Vector R -> R

norm_2 :: Vector R -> R

norm_Inf :: Vector R -> R

Parseable (AlphaColour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (AlphaColour Double)

Parseable (Colour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (Colour Double)

Indexable (Vector Double) Double 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector Double -> Int -> Double

CDF (Poisson b) Integer => CDF (Poisson b) Double 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Double -> Double -> Double

CDF (Binomial b) Integer => CDF (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Double -> Double -> Double

Distribution (Poisson b) Integer => Distribution (Poisson b) Double 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Double -> RVar Double

rvarT :: Poisson b Double -> RVarT n Double

Distribution (Binomial b) Integer => Distribution (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Double -> RVar Double

rvarT :: Binomial b Double -> RVarT n Double

PDF (Binomial b) Integer => PDF (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Double -> Double -> Double

logPdf :: Binomial b Double -> Double -> Double

Renderable (Text Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Text Double -> Render Cairo (V (Text Double)) (N (Text Double))

MArray (STUArray s) Double (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Double -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Double -> ST s Int

newArray :: Ix i => (i, i) -> Double -> ST s (STUArray s i Double) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Double)

unsafeRead :: Ix i => STUArray s i Double -> Int -> ST s Double

unsafeWrite :: Ix i => STUArray s i Double -> Int -> Double -> ST s ()

Indexable (Vector (Complex Double)) (Complex Double) 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector (Complex Double) -> Int -> Complex Double

Functor (URec Double :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Foldable (URec Double :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Double m -> m #

foldMap :: Monoid m => (a -> m) -> URec Double a -> m #

foldr :: (a -> b -> b) -> b -> URec Double a -> b #

foldr' :: (a -> b -> b) -> b -> URec Double a -> b #

foldl :: (b -> a -> b) -> b -> URec Double a -> b #

foldl' :: (b -> a -> b) -> b -> URec Double a -> b #

foldr1 :: (a -> a -> a) -> URec Double a -> a #

foldl1 :: (a -> a -> a) -> URec Double a -> a #

toList :: URec Double a -> [a] #

null :: URec Double a -> Bool #

length :: URec Double a -> Int #

elem :: Eq a => a -> URec Double a -> Bool #

maximum :: Ord a => URec Double a -> a #

minimum :: Ord a => URec Double a -> a #

sum :: Num a => URec Double a -> a #

product :: Num a => URec Double a -> a #

Traversable (URec Double :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Renderable (Trail V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Trail V2 Double -> Render Cairo (V (Trail V2 Double)) (N (Trail V2 Double))

Renderable (Path V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Path V2 Double -> Render Cairo (V (Path V2 Double)) (N (Path V2 Double))

Renderable (DImage Double Embedded) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> DImage Double Embedded -> Render Cairo (V (DImage Double Embedded)) (N (DImage Double Embedded))

Renderable (DImage Double External) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> DImage Double External -> Render Cairo (V (DImage Double External)) (N (DImage Double External))

Eq (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Double p -> URec Double p -> Bool #

(/=) :: URec Double p -> URec Double p -> Bool #

Ord (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering #

(<) :: URec Double p -> URec Double p -> Bool #

(<=) :: URec Double p -> URec Double p -> Bool #

(>) :: URec Double p -> URec Double p -> Bool #

(>=) :: URec Double p -> URec Double p -> Bool #

max :: URec Double p -> URec Double p -> URec Double p #

min :: URec Double p -> URec Double p -> URec Double p #

Show (URec Double p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Double p -> ShowS #

show :: URec Double p -> String #

showList :: [URec Double p] -> ShowS #

Show (Options Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

showsPrec :: Int -> Options Cairo V2 Double -> ShowS #

show :: Options Cairo V2 Double -> String #

showList :: [Options Cairo V2 Double] -> ShowS #

Generic (URec Double p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Double p) :: * -> * #

Methods

from :: URec Double p -> Rep (URec Double p) x #

to :: Rep (URec Double p) x -> URec Double p #

Semigroup (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(<>) :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

sconcat :: NonEmpty (Render Cairo V2 Double) -> Render Cairo V2 Double #

stimes :: Integral b => b -> Render Cairo V2 Double -> Render Cairo V2 Double #

Monoid (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

mempty :: Render Cairo V2 Double #

mappend :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

mconcat :: [Render Cairo V2 Double] -> Render Cairo V2 Double #

Hashable (Options Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

hashWithSalt :: Int -> Options Cairo V2 Double -> Int

hash :: Options Cairo V2 Double -> Int

Renderable (Segment Closed V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Segment Closed V2 Double -> Render Cairo (V (Segment Closed V2 Double)) (N (Segment Closed V2 Double))

ToPNG (QDiagram Cairo V2 Double Any) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> QDiagram Cairo V2 Double Any -> IO () #

type BooleanOf Double 
Instance details

Defined in Data.Boolean

type BooleanOf Double = Bool
type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type PrimSize Double 
Instance details

Defined in Basement.PrimType

type PrimSize Double = 8
type Difference Double 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Double = Double
data Vector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Double = V_Double (Vector Double)
type DoubleOf Double 
Instance details

Defined in Internal.Numeric

type DoubleOf Double = Double
type RealOf Double 
Instance details

Defined in Internal.Numeric

type RealOf Double = Double
type SingleOf Double 
Instance details

Defined in Internal.Numeric

type SingleOf Double = Float
data URec Double (p :: k)

Used for marking occurrences of Double#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Double (p :: k) = UDouble {}
data MVector s Double 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Double = MV_Double (MVector s Double)
data Options Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

data Options Cairo V2 Double = CairoOptions {}
data Render Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

data Render Cairo V2 Double = C (RenderM ())
type Result Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

type Result Cairo V2 Double = (IO (), Render ())
type Rep1 (URec Double :: k -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (URec Double :: k -> *) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: k -> *)))
type RealOf (Complex Double) 
Instance details

Defined in Internal.Numeric

type RealOf (Complex Double) = Double
type Rep (URec Double p) 
Instance details

Defined in GHC.Generics

type Rep (URec Double p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: * -> *)))

data Float #

Single-precision floating point numbers. + to the IEEE double-precision type.

Instances
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: Type #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: Type #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

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 #

(/=) :: Double -> Double -> Bool #

Floating Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Double #

exp :: Double -> Double #

log :: Double -> Double #

sqrt :: Double -> Double #

(**) :: Double -> Double -> Double #

logBase :: Double -> Double -> Double #

sin :: Double -> Double #

cos :: Double -> Double #

tan :: Double -> Double #

asin :: Double -> Double #

acos :: Double -> Double #

atan :: Double -> Double #

sinh :: Double -> Double #

cosh :: Double -> Double #

tanh :: Double -> Double #

asinh :: Double -> Double #

acosh :: Double -> Double #

atanh :: Double -> Double #

log1p :: Double -> Double #

expm1 :: Double -> Double #

log1pexp :: Double -> Double #

log1mexp :: Double -> Double #

Ord Double

Note that due to the presence of NaN, Double's Ord instance does not + satisfy reflexivity.

>>> 0/0 <= (0/0 :: Double)
+False
+

Also note that, due to the same, Ord's operator interactions are not + respected by Double's instance:

>>> (0/0 :: Double) > 1
+False
+>>> compare (0/0 :: Double) 1
+GT
+
Instance details

Defined in GHC.Classes

Methods

compare :: Double -> Double -> Ordering #

(<) :: Double -> Double -> Bool #

(<=) :: Double -> Double -> Bool #

(>) :: Double -> Double -> Bool #

(>=) :: Double -> Double -> Bool #

max :: Double -> Double -> Double #

min :: Double -> Double -> Double #

Read Double

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Double #

readList :: ReadS [Double] #

readPrec :: ReadPrec Double #

readListPrec :: ReadPrec [Double] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

RealFloat Double

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Double -> Integer #

floatDigits :: Double -> Int #

floatRange :: Double -> (Int, Int) #

decodeFloat :: Double -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Double #

exponent :: Double -> Int #

significand :: Double -> Double #

scaleFloat :: Int -> Double -> Double #

isNaN :: Double -> Bool #

isInfinite :: Double -> Bool #

isDenormalized :: Double -> Bool #

isNegativeZero :: Double -> Bool #

isIEEE :: Double -> Bool #

atan2 :: Double -> Double -> Double #

Lift Double 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Double -> Q Exp #

IfB Double 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Double => bool -> Double -> Double -> Double #

EqB Double 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(/=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

OrdB Double 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(<=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

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] #

randomRIO :: (Double, Double) -> IO Double #

randomIO :: IO Double #

NFData Double 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Double -> () #

Hashable Double 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Double -> Int #

hash :: Double -> Int #

PrintfArg Double

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Double -> FieldFormatter #

parseFormat :: Double -> ModifierParser #

Storable Double

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Double -> Int #

alignment :: Double -> Int #

peekElemOff :: Ptr Double -> Int -> IO Double #

pokeElemOff :: Ptr Double -> Int -> Double -> IO () #

peekByteOff :: Ptr b -> Int -> IO Double #

pokeByteOff :: Ptr b -> Int -> Double -> IO () #

peek :: Ptr Double -> IO Double #

poke :: Ptr Double -> Double -> IO () #

PrimType Double 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Double :: Nat #

Methods

primSizeInBytes :: Proxy Double -> CountOf Word8 #

primShiftToBytes :: Proxy Double -> Int #

primBaUIndex :: ByteArray# -> Offset Double -> Double #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> prim Double #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> Double -> prim () #

primAddrIndex :: Addr# -> Offset Double -> Double #

primAddrRead :: PrimMonad prim => Addr# -> Offset Double -> prim Double #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Double -> Double -> prim () #

Subtractive Double 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Double :: Type #

Methods

(-) :: Double -> Double -> Difference Double #

Binary Double 
Instance details

Defined in Data.Binary.Class

Methods

put :: Double -> Put #

get :: Get Double #

putList :: [Double] -> Put #

FromField Double

Accepts same syntax as rational. Ignores whitespace.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Double #

ToField Double

Uses decimal notation or scientific notation, depending on the + number.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Double -> Field #

Default Double 
Instance details

Defined in Data.Default.Class

Methods

def :: Double #

CTrans R 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix R -> Matrix R

CTrans C 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix C -> Matrix C

Field Double 
Instance details

Defined in Internal.Algorithms

Methods

svd' :: Matrix Double -> (Matrix Double, Vector Double, Matrix Double)

thinSVD' :: Matrix Double -> (Matrix Double, Vector Double, Matrix Double)

sv' :: Matrix Double -> Vector Double

luPacked' :: Matrix Double -> (Matrix Double, [Int])

luSolve' :: (Matrix Double, [Int]) -> Matrix Double -> Matrix Double

mbLinearSolve' :: Matrix Double -> Matrix Double -> Maybe (Matrix Double)

linearSolve' :: Matrix Double -> Matrix Double -> Matrix Double

cholSolve' :: Matrix Double -> Matrix Double -> Matrix Double

triSolve' :: UpLo -> Matrix Double -> Matrix Double -> Matrix Double

triDiagSolve' :: Vector Double -> Vector Double -> Vector Double -> Matrix Double -> Matrix Double

ldlPacked' :: Matrix Double -> (Matrix Double, [Int])

ldlSolve' :: (Matrix Double, [Int]) -> Matrix Double -> Matrix Double

linearSolveSVD' :: Matrix Double -> Matrix Double -> Matrix Double

linearSolveLS' :: Matrix Double -> Matrix Double -> Matrix Double

eig' :: Matrix Double -> (Vector (Complex Double), Matrix (Complex Double))

eigSH'' :: Matrix Double -> (Vector Double, Matrix Double)

eigOnly :: Matrix Double -> Vector (Complex Double)

eigOnlySH :: Matrix Double -> Vector Double

cholSH' :: Matrix Double -> Matrix Double

mbCholSH' :: Matrix Double -> Maybe (Matrix Double)

qr' :: Matrix Double -> (Matrix Double, Vector Double)

qrgr' :: Int -> (Matrix Double, Vector Double) -> Matrix Double

hess' :: Matrix Double -> (Matrix Double, Matrix Double)

schur' :: Matrix Double -> (Matrix Double, Matrix Double)

Numeric Double 
Instance details

Defined in Internal.Numeric

Product Double 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix Double -> Matrix Double -> Matrix Double

absSum :: Vector Double -> RealOf Double

norm1 :: Vector Double -> RealOf Double

norm2 :: Vector Double -> RealOf Double

normInf :: Vector Double -> RealOf Double

Convert Double 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf Double) -> c Double #

complex :: Complexable c => c Double -> c (ComplexOf Double) #

single :: Complexable c => c Double -> c (SingleOf Double) #

double :: Complexable c => c Double -> c (DoubleOf Double) #

toComplex :: (Complexable c, RealElement Double) => (c Double, c Double) -> c (Complex Double) #

fromComplex :: (Complexable c, RealElement Double) => c (Complex Double) -> (c Double, c Double) #

Element Double 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Double -> Int -> Vector Double

extractR :: MatrixOrder -> Matrix Double -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix Double)

setRect :: Int -> Int -> Matrix Double -> Matrix Double -> IO ()

sortI :: Vector Double -> Vector CInt

sortV :: Vector Double -> Vector Double

compareV :: Vector Double -> Vector Double -> Vector CInt

selectV :: Vector CInt -> Vector Double -> Vector Double -> Vector Double -> Vector Double

remapM :: Matrix CInt -> Matrix CInt -> Matrix Double -> Matrix Double

rowOp :: Int -> Double -> Int -> Int -> Int -> Int -> Matrix Double -> IO ()

gemm :: Vector Double -> Matrix Double -> Matrix Double -> Matrix Double -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector Double -> Vector Double

Transfinite Double 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Double #

negativeInfinity :: Double #

notANumber :: Double #

isInfinite :: Double -> Bool #

isNaN :: Double -> Bool #

PartialOrd Double 
Instance details

Defined in Data.Number.PartialOrd

Methods

cmp :: Double -> Double -> Maybe Ordering #

gt :: Double -> Double -> Maybe Bool #

ge :: Double -> Double -> Maybe Bool #

eq :: Double -> Double -> Maybe Bool #

ne :: Double -> Double -> Maybe Bool #

le :: Double -> Double -> Maybe Bool #

lt :: Double -> Double -> Maybe Bool #

maxPO :: Double -> Double -> Maybe Double #

minPO :: Double -> Double -> Maybe Double #

Prim Double 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Double -> Int# #

alignment# :: Double -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Double #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Double#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Double -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Double -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Double #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Double#) #

writeOffAddr# :: Addr# -> Int# -> Double -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Double -> State# s -> State# s #

Unbox Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Double 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Double

uniformR :: PrimMonad m => (Double, Double) -> Gen (PrimState m) -> m Double

Precise Double 
Instance details

Defined in Numeric.Log

Methods

log1p :: Double -> Double

expm1 :: Double -> Double

log1pexp :: Double -> Double

log1mexp :: Double -> Double

ExprType Double # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Double #

toConcrete :: ConstVal -> Double #

fromConcrete :: Double -> Expression Double #

constVal :: Double -> ConstVal #

constExpr :: ConstVal -> Expression Double #

IsName Double 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Double -> Name

BarsPlotValue Double 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Double #

barsAdd :: Double -> Double -> Double #

Parseable Double 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser Double

Summation Double 
Instance details

Defined in Numeric.Sum

Methods

zero :: Double

add :: Double -> Double -> Double

sum :: Foldable f => (Double -> Double) -> f Double -> Double

PlotP Double # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

plotP :: P (Expression Double) -> Int -> String -> IO ChartPlot #

plotP' :: P (Expression Double) -> Int -> String -> IO ChartPlot #

IArray UArray Double 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Double -> (i, i) #

numElements :: Ix i => UArray i Double -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Double)] -> UArray i Double

unsafeAt :: Ix i => UArray i Double -> Int -> Double

unsafeReplace :: Ix i => UArray i Double -> [(Int, Double)] -> UArray i Double

unsafeAccum :: Ix i => (Double -> e' -> Double) -> UArray i Double -> [(Int, e')] -> UArray i Double

unsafeAccumArray :: Ix i => (Double -> e' -> Double) -> Double -> (i, i) -> [(Int, e')] -> UArray i Double

Normed Vector Double 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector Double -> RealOf Double

Normed Matrix Double 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix Double -> RealOf Double

Container Vector Double 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector Double -> Vector Double

size' :: Vector Double -> IndexOf Vector

scalar' :: Double -> Vector Double

scale' :: Double -> Vector Double -> Vector Double

addConstant :: Double -> Vector Double -> Vector Double

add' :: Vector Double -> Vector Double -> Vector Double

sub :: Vector Double -> Vector Double -> Vector Double

mul :: Vector Double -> Vector Double -> Vector Double

equal :: Vector Double -> Vector Double -> Bool

cmap' :: Element b => (Double -> b) -> Vector Double -> Vector b

konst' :: Double -> IndexOf Vector -> Vector Double

build' :: IndexOf Vector -> ArgOf Vector Double -> Vector Double

atIndex' :: Vector Double -> IndexOf Vector -> Double

minIndex' :: Vector Double -> IndexOf Vector

maxIndex' :: Vector Double -> IndexOf Vector

minElement' :: Vector Double -> Double

maxElement' :: Vector Double -> Double

sumElements' :: Vector Double -> Double

prodElements' :: Vector Double -> Double

step' :: Vector Double -> Vector Double

ccompare' :: Vector Double -> Vector Double -> Vector I

cselect' :: Vector I -> Vector Double -> Vector Double -> Vector Double -> Vector Double

find' :: (Double -> Bool) -> Vector Double -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Double -> [(IndexOf Vector, Double)] -> Vector Double

accum' :: Vector Double -> (Double -> Double -> Double) -> [(IndexOf Vector, Double)] -> Vector Double

scaleRecip :: Double -> Vector Double -> Vector Double

divide :: Vector Double -> Vector Double -> Vector Double

arctan2' :: Vector Double -> Vector Double -> Vector Double

cmod' :: Double -> Vector Double -> Vector Double

fromInt' :: Vector I -> Vector Double

toInt' :: Vector Double -> Vector I

fromZ' :: Vector Z -> Vector Double

toZ' :: Vector Double -> Vector Z

Vector Vector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double) #

basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double) #

basicLength :: Vector Double -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double #

basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m () #

elemseq :: Vector Double -> Double -> b -> b #

MVector MVector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Double -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double #

basicOverlaps :: MVector s Double -> MVector s Double -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Double -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double) #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

CDF StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Double -> Double -> Double

CDF Uniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Double -> Double -> Double

Distribution Normal Double 
Instance details

Defined in Data.Random.Distribution.Normal

Methods

rvar :: Normal Double -> RVar Double

rvarT :: Normal Double -> RVarT n Double

Distribution StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Double -> RVar Double

rvarT :: StdUniform Double -> RVarT n Double

Distribution Uniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Double -> RVar Double

rvarT :: Uniform Double -> RVarT n Double

Distribution Beta Double 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

rvar :: Beta Double -> RVar Double

rvarT :: Beta Double -> RVarT n Double

PDF StdUniform Double 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

pdf :: StdUniform Double -> Double -> Double

logPdf :: StdUniform Double -> Double -> Double

PDF Beta Double 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

pdf :: Beta Double -> Double -> Double

logPdf :: Beta Double -> Double -> Double

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

MArray IOUArray Double IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Double -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Double -> IO Int

newArray :: Ix i => (i, i) -> Double -> IO (IOUArray i Double) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Double)

unsafeRead :: Ix i => IOUArray i Double -> Int -> IO Double

unsafeWrite :: Ix i => IOUArray i Double -> Int -> Double -> IO ()

Backend Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Associated Types

data Render Cairo V2 Double :: Type

type Result Cairo V2 Double :: Type

data Options Cairo V2 Double :: Type

Methods

adjustDia :: (Additive V2, Monoid' m, Num Double) => Cairo -> Options Cairo V2 Double -> QDiagram Cairo V2 Double m -> (Options Cairo V2 Double, Transformation V2 Double, QDiagram Cairo V2 Double m)

renderRTree :: Cairo -> Options Cairo V2 Double -> RTree Cairo V2 Double Annotation -> Result Cairo V2 Double

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Each ColourMap ColourMap (Colour Double) (Colour Double) 
Instance details

Defined in Plots.Style

Methods

each :: Traversal ColourMap ColourMap (Colour Double) (Colour Double) #

Normed Vector (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector (Complex Double) -> RealOf (Complex Double)

Normed Matrix (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix (Complex Double) -> RealOf (Complex Double)

Container Vector (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector (Complex Double) -> Vector (Complex Double)

size' :: Vector (Complex Double) -> IndexOf Vector

scalar' :: Complex Double -> Vector (Complex Double)

scale' :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

addConstant :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

add' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

sub :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

mul :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

equal :: Vector (Complex Double) -> Vector (Complex Double) -> Bool

cmap' :: Element b => (Complex Double -> b) -> Vector (Complex Double) -> Vector b

konst' :: Complex Double -> IndexOf Vector -> Vector (Complex Double)

build' :: IndexOf Vector -> ArgOf Vector (Complex Double) -> Vector (Complex Double)

atIndex' :: Vector (Complex Double) -> IndexOf Vector -> Complex Double

minIndex' :: Vector (Complex Double) -> IndexOf Vector

maxIndex' :: Vector (Complex Double) -> IndexOf Vector

minElement' :: Vector (Complex Double) -> Complex Double

maxElement' :: Vector (Complex Double) -> Complex Double

sumElements' :: Vector (Complex Double) -> Complex Double

prodElements' :: Vector (Complex Double) -> Complex Double

step' :: Vector (Complex Double) -> Vector (Complex Double)

ccompare' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector I

cselect' :: Vector I -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

find' :: (Complex Double -> Bool) -> Vector (Complex Double) -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Complex Double -> [(IndexOf Vector, Complex Double)] -> Vector (Complex Double)

accum' :: Vector (Complex Double) -> (Complex Double -> Complex Double -> Complex Double) -> [(IndexOf Vector, Complex Double)] -> Vector (Complex Double)

scaleRecip :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

divide :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

arctan2' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

cmod' :: Complex Double -> Vector (Complex Double) -> Vector (Complex Double)

fromInt' :: Vector I -> Vector (Complex Double)

toInt' :: Vector (Complex Double) -> Vector I

fromZ' :: Vector Z -> Vector (Complex Double)

toZ' :: Vector (Complex Double) -> Vector Z

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Generic1 (URec Double :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Double) :: k -> Type #

Methods

from1 :: URec Double a -> Rep1 (URec Double) a #

to1 :: Rep1 (URec Double) a -> URec Double a #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution Logistic (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Logistic (Double, Double) -> IO Double

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

Normed (Vector R) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector R -> R #

norm_1 :: Vector R -> R #

norm_2 :: Vector R -> R #

norm_Inf :: Vector R -> R #

Normed (Vector C) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector C -> R #

norm_1 :: Vector C -> R #

norm_2 :: Vector C -> R #

norm_Inf :: Vector C -> R #

Normed (Matrix R) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Matrix R -> R #

norm_1 :: Matrix R -> R #

norm_2 :: Matrix R -> R #

norm_Inf :: Matrix R -> R #

Normed (Matrix C) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Matrix C -> R #

norm_1 :: Matrix C -> R #

norm_2 :: Matrix C -> R #

norm_Inf :: Matrix C -> R #

Field (Complex Double) 
Instance details

Defined in Internal.Algorithms

Methods

svd' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector Double, Matrix (Complex Double))

thinSVD' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector Double, Matrix (Complex Double))

sv' :: Matrix (Complex Double) -> Vector Double

luPacked' :: Matrix (Complex Double) -> (Matrix (Complex Double), [Int])

luSolve' :: (Matrix (Complex Double), [Int]) -> Matrix (Complex Double) -> Matrix (Complex Double)

mbLinearSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Maybe (Matrix (Complex Double))

linearSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

cholSolve' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

triSolve' :: UpLo -> Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

triDiagSolve' :: Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

ldlPacked' :: Matrix (Complex Double) -> (Matrix (Complex Double), [Int])

ldlSolve' :: (Matrix (Complex Double), [Int]) -> Matrix (Complex Double) -> Matrix (Complex Double)

linearSolveSVD' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

linearSolveLS' :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

eig' :: Matrix (Complex Double) -> (Vector (Complex Double), Matrix (Complex Double))

eigSH'' :: Matrix (Complex Double) -> (Vector Double, Matrix (Complex Double))

eigOnly :: Matrix (Complex Double) -> Vector (Complex Double)

eigOnlySH :: Matrix (Complex Double) -> Vector Double

cholSH' :: Matrix (Complex Double) -> Matrix (Complex Double)

mbCholSH' :: Matrix (Complex Double) -> Maybe (Matrix (Complex Double))

qr' :: Matrix (Complex Double) -> (Matrix (Complex Double), Vector (Complex Double))

qrgr' :: Int -> (Matrix (Complex Double), Vector (Complex Double)) -> Matrix (Complex Double)

hess' :: Matrix (Complex Double) -> (Matrix (Complex Double), Matrix (Complex Double))

schur' :: Matrix (Complex Double) -> (Matrix (Complex Double), Matrix (Complex Double))

Numeric (Complex Double) 
Instance details

Defined in Internal.Numeric

Product (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double)

absSum :: Vector (Complex Double) -> RealOf (Complex Double)

norm1 :: Vector (Complex Double) -> RealOf (Complex Double)

norm2 :: Vector (Complex Double) -> RealOf (Complex Double)

normInf :: Vector (Complex Double) -> RealOf (Complex Double)

Convert (Complex Double) 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf (Complex Double)) -> c (Complex Double) #

complex :: Complexable c => c (Complex Double) -> c (ComplexOf (Complex Double)) #

single :: Complexable c => c (Complex Double) -> c (SingleOf (Complex Double)) #

double :: Complexable c => c (Complex Double) -> c (DoubleOf (Complex Double)) #

toComplex :: (Complexable c, RealElement (Complex Double)) => (c (Complex Double), c (Complex Double)) -> c (Complex (Complex Double)) #

fromComplex :: (Complexable c, RealElement (Complex Double)) => c (Complex (Complex Double)) -> (c (Complex Double), c (Complex Double)) #

Element (Complex Double) 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Complex Double -> Int -> Vector (Complex Double)

extractR :: MatrixOrder -> Matrix (Complex Double) -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix (Complex Double))

setRect :: Int -> Int -> Matrix (Complex Double) -> Matrix (Complex Double) -> IO ()

sortI :: Vector (Complex Double) -> Vector CInt

sortV :: Vector (Complex Double) -> Vector (Complex Double)

compareV :: Vector (Complex Double) -> Vector (Complex Double) -> Vector CInt

selectV :: Vector CInt -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double) -> Vector (Complex Double)

remapM :: Matrix CInt -> Matrix CInt -> Matrix (Complex Double) -> Matrix (Complex Double)

rowOp :: Int -> Complex Double -> Int -> Int -> Int -> Int -> Matrix (Complex Double) -> IO ()

gemm :: Vector (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double) -> Matrix (Complex Double) -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector (Complex Double) -> Vector (Complex Double)

Parseable (Colour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (Colour Double)

Parseable (AlphaColour Double) 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser (AlphaColour Double)

Indexable (Vector Double) Double 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector Double -> Int -> Double #

CDF (Poisson b) Integer => CDF (Poisson b) Double 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Double -> Double -> Double

CDF (Binomial b) Integer => CDF (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Double -> Double -> Double

Distribution (Poisson b) Integer => Distribution (Poisson b) Double 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Double -> RVar Double

rvarT :: Poisson b Double -> RVarT n Double

Distribution (Binomial b) Integer => Distribution (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Double -> RVar Double

rvarT :: Binomial b Double -> RVarT n Double

PDF (Binomial b) Integer => PDF (Binomial b) Double 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Double -> Double -> Double

logPdf :: Binomial b Double -> Double -> Double

Renderable (Text Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Text Double -> Render Cairo (V (Text Double)) (N (Text Double))

MArray (STUArray s) Double (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Double -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Double -> ST s Int

newArray :: Ix i => (i, i) -> Double -> ST s (STUArray s i Double) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Double)

unsafeRead :: Ix i => STUArray s i Double -> Int -> ST s Double

unsafeWrite :: Ix i => STUArray s i Double -> Int -> Double -> ST s ()

Indexable (Vector (Complex Double)) (Complex Double) 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector (Complex Double) -> Int -> Complex Double #

Functor (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Foldable (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Double m -> m #

foldMap :: Monoid m => (a -> m) -> URec Double a -> m #

foldr :: (a -> b -> b) -> b -> URec Double a -> b #

foldr' :: (a -> b -> b) -> b -> URec Double a -> b #

foldl :: (b -> a -> b) -> b -> URec Double a -> b #

foldl' :: (b -> a -> b) -> b -> URec Double a -> b #

foldr1 :: (a -> a -> a) -> URec Double a -> a #

foldl1 :: (a -> a -> a) -> URec Double a -> a #

toList :: URec Double a -> [a] #

null :: URec Double a -> Bool #

length :: URec Double a -> Int #

elem :: Eq a => a -> URec Double a -> Bool #

maximum :: Ord a => URec Double a -> a #

minimum :: Ord a => URec Double a -> a #

sum :: Num a => URec Double a -> a #

product :: Num a => URec Double a -> a #

Traversable (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Double a -> f (URec Double b) #

sequenceA :: Applicative f => URec Double (f a) -> f (URec Double a) #

mapM :: Monad m => (a -> m b) -> URec Double a -> m (URec Double b) #

sequence :: Monad m => URec Double (m a) -> m (URec Double a) #

Renderable (Path V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Path V2 Double -> Render Cairo (V (Path V2 Double)) (N (Path V2 Double))

Renderable (Trail V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Trail V2 Double -> Render Cairo (V (Trail V2 Double)) (N (Trail V2 Double))

Renderable (DImage Double Embedded) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> DImage Double Embedded -> Render Cairo (V (DImage Double Embedded)) (N (DImage Double Embedded))

Renderable (DImage Double External) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> DImage Double External -> Render Cairo (V (DImage Double External)) (N (DImage Double External))

Eq (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Double p -> URec Double p -> Bool #

(/=) :: URec Double p -> URec Double p -> Bool #

Ord (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Double p -> URec Double p -> Ordering #

(<) :: URec Double p -> URec Double p -> Bool #

(<=) :: URec Double p -> URec Double p -> Bool #

(>) :: URec Double p -> URec Double p -> Bool #

(>=) :: URec Double p -> URec Double p -> Bool #

max :: URec Double p -> URec Double p -> URec Double p #

min :: URec Double p -> URec Double p -> URec Double p #

Show (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Double p -> ShowS #

show :: URec Double p -> String #

showList :: [URec Double p] -> ShowS #

Show (Options Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

showsPrec :: Int -> Options Cairo V2 Double -> ShowS #

show :: Options Cairo V2 Double -> String #

showList :: [Options Cairo V2 Double] -> ShowS #

Generic (URec Double p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Double p) :: Type -> Type #

Methods

from :: URec Double p -> Rep (URec Double p) x #

to :: Rep (URec Double p) x -> URec Double p #

Semigroup (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

(<>) :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

sconcat :: NonEmpty (Render Cairo V2 Double) -> Render Cairo V2 Double #

stimes :: Integral b => b -> Render Cairo V2 Double -> Render Cairo V2 Double #

Monoid (Render Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

mempty :: Render Cairo V2 Double #

mappend :: Render Cairo V2 Double -> Render Cairo V2 Double -> Render Cairo V2 Double #

mconcat :: [Render Cairo V2 Double] -> Render Cairo V2 Double #

Hashable (Options Cairo V2 Double) 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

hashWithSalt :: Int -> Options Cairo V2 Double -> Int #

hash :: Options Cairo V2 Double -> Int #

Renderable (Segment Closed V2 Double) Cairo 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

Methods

render :: Cairo -> Segment Closed V2 Double -> Render Cairo (V (Segment Closed V2 Double)) (N (Segment Closed V2 Double))

ToImage (QDiagram Cairo V2 Double Any) # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

toPNG :: String -> QDiagram Cairo V2 Double Any -> IO () #

toSVG :: String -> QDiagram Cairo V2 Double Any -> IO () #

type BooleanOf Double 
Instance details

Defined in Data.Boolean

type BooleanOf Double = Bool
type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type PrimSize Double 
Instance details

Defined in Basement.PrimType

type PrimSize Double = 8
type Difference Double 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Double = Double
type RealOf Double 
Instance details

Defined in Internal.Numeric

type RealOf Double = Double
type SingleOf Double 
Instance details

Defined in Internal.Numeric

type SingleOf Double = Float
type DoubleOf Double 
Instance details

Defined in Internal.Numeric

type DoubleOf Double = Double
newtype Vector Double 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Double = V_Double (Vector Double)
data URec Double (p :: k)

Used for marking occurrences of Double#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Double (p :: k) = UDouble {}
newtype MVector s Double 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Double = MV_Double (MVector s Double)
data Options Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

data Options Cairo V2 Double = CairoOptions {}
data Render Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

data Render Cairo V2 Double = C (RenderM ())
type Result Cairo V2 Double 
Instance details

Defined in Diagrams.Backend.Cairo.Internal

type Result Cairo V2 Double = (IO (), Render ())
type Rep1 (URec Double :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Double :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: k -> Type)))
type RealOf (Complex Double) 
Instance details

Defined in Internal.Numeric

type RealOf (Complex Double) = Double
type Rep (URec Double p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep (URec Double p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UDouble" PrefixI True) (S1 (MetaSel (Just "uDouble#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UDouble :: Type -> Type)))

data Float #

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
Eq Float 
Instance details

Defined in GHC.Classes

Methods

(==) :: Float -> Float -> Bool #

(/=) :: Float -> Float -> Bool #

Floating Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Float #

exp :: Float -> Float #

log :: Float -> Float #

sqrt :: Float -> Float #

(**) :: Float -> Float -> Float #

logBase :: Float -> Float -> Float #

sin :: Float -> Float #

cos :: Float -> Float #

tan :: Float -> Float #

asin :: Float -> Float #

acos :: Float -> Float #

atan :: Float -> Float #

sinh :: Float -> Float #

cosh :: Float -> Float #

tanh :: Float -> Float #

asinh :: Float -> Float #

acosh :: Float -> Float #

atanh :: Float -> Float #

log1p :: Float -> Float #

expm1 :: Float -> Float #

log1pexp :: Float -> Float #

log1mexp :: Float -> Float #

Ord Float 
Instance details

Defined in GHC.Classes

Methods

compare :: Float -> Float -> Ordering #

(<) :: Float -> Float -> Bool #

(<=) :: Float -> Float -> Bool #

(>) :: Float -> Float -> Bool #

(>=) :: Float -> Float -> Bool #

max :: Float -> Float -> Float #

min :: Float -> Float -> Float #

Read Float

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Float #

readList :: ReadS [Float] #

readPrec :: ReadPrec Float #

readListPrec :: ReadPrec [Float] #

RealFloat Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Float -> Integer #

floatDigits :: Float -> Int #

floatRange :: Float -> (Int, Int) #

decodeFloat :: Float -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Float #

exponent :: Float -> Int #

significand :: Float -> Float #

scaleFloat :: Int -> Float -> Float #

isNaN :: Float -> Bool #

isInfinite :: Float -> Bool #

isDenormalized :: Float -> Bool #

isNegativeZero :: Float -> Bool #

isIEEE :: Float -> Bool #

atan2 :: Float -> Float -> Float #

Lift Float 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Float -> Q Exp #

IfB Float 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Float => bool -> Float -> Float -> Float #

EqB Float 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(/=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

OrdB Float 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(<=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

Default Float 
Instance details

Defined in Data.Default.Class

Methods

def :: Float #

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] #

randomRIO :: (Float, Float) -> IO Float #

randomIO :: IO Float #

NFData Float 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Float -> () #

PrintfArg Float

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Float -> FieldFormatter #

parseFormat :: Float -> ModifierParser #

Storable Float

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Float -> Int #

alignment :: Float -> Int #

peekElemOff :: Ptr Float -> Int -> IO Float #

pokeElemOff :: Ptr Float -> Int -> Float -> IO () #

peekByteOff :: Ptr b -> Int -> IO Float #

pokeByteOff :: Ptr b -> Int -> Float -> IO () #

peek :: Ptr Float -> IO Float #

poke :: Ptr Float -> Float -> IO () #

PrimType Float 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Float :: Nat #

Methods

primSizeInBytes :: Proxy Float -> CountOf Word8 #

primShiftToBytes :: Proxy Float -> Int #

primBaUIndex :: ByteArray# -> Offset Float -> Float #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> prim Float #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> Float -> prim () #

primAddrIndex :: Addr# -> Offset Float -> Float #

primAddrRead :: PrimMonad prim => Addr# -> Offset Float -> prim Float #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Float -> Float -> prim () #

Subtractive Float 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Float :: * #

Methods

(-) :: Float -> Float -> Difference Float #

Binary Float 
Instance details

Defined in Data.Binary.Class

Methods

put :: Float -> Put #

get :: Get Float #

putList :: [Float] -> Put #

Prim Float 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Float -> Int# #

alignment# :: Float -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Float #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Float#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Float #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Float#) #

writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s #

Element Float 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Float -> Int -> Vector Float

extractR :: MatrixOrder -> Matrix Float -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix Float)

setRect :: Int -> Int -> Matrix Float -> Matrix Float -> IO ()

sortI :: Vector Float -> Vector CInt

sortV :: Vector Float -> Vector Float

compareV :: Vector Float -> Vector Float -> Vector CInt

selectV :: Vector CInt -> Vector Float -> Vector Float -> Vector Float -> Vector Float

remapM :: Matrix CInt -> Matrix CInt -> Matrix Float -> Matrix Float

rowOp :: Int -> Float -> Int -> Int -> Int -> Int -> Matrix Float -> IO ()

gemm :: Vector Float -> Matrix Float -> Matrix Float -> Matrix Float -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector Float -> Vector Float

Convert Float 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf Float) -> c Float

complex :: Complexable c => c Float -> c (ComplexOf Float)

single :: Complexable c => c Float -> c (SingleOf Float)

double :: Complexable c => c Float -> c (DoubleOf Float)

toComplex :: (Complexable c, RealElement Float) => (c Float, c Float) -> c (Complex Float)

fromComplex :: (Complexable c, RealElement Float) => c (Complex Float) -> (c Float, c Float)

Numeric Float 
Instance details

Defined in Internal.Numeric

Product Float 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix Float -> Matrix Float -> Matrix Float

absSum :: Vector Float -> RealOf Float

norm1 :: Vector Float -> RealOf Float

norm2 :: Vector Float -> RealOf Float

normInf :: Vector Float -> RealOf Float

CTrans Float 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix Float -> Matrix Float

Hashable Float 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Float -> Int

hash :: Float -> Int

Unbox Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Float 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Float

uniformR :: PrimMonad m => (Float, Float) -> Gen (PrimState m) -> m Float

Precise Float 
Instance details

Defined in Numeric.Log

Methods

log1p :: Float -> Float

expm1 :: Float -> Float

log1pexp :: Float -> Float

log1mexp :: Float -> Float

IsName Float 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Float -> Name

Pixel PixelF 
Instance details

Defined in Codec.Picture.Types

Associated Types

type PixelBaseComponent PixelF :: *

Methods

mixWith :: (Int -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF -> PixelF

mixWithAlpha :: (Int -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> (PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF -> PixelF

pixelOpacity :: PixelF -> PixelBaseComponent PixelF

componentCount :: PixelF -> Int

colorMap :: (PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF

pixelBaseIndex :: Image PixelF -> Int -> Int -> Int

mutablePixelBaseIndex :: MutableImage s PixelF -> Int -> Int -> Int

pixelAt :: Image PixelF -> Int -> Int -> PixelF

readPixel :: PrimMonad m => MutableImage (PrimState m) PixelF -> Int -> Int -> m PixelF

writePixel :: PrimMonad m => MutableImage (PrimState m) PixelF -> Int -> Int -> PixelF -> m ()

unsafePixelAt :: Vector (PixelBaseComponent PixelF) -> Int -> PixelF

unsafeReadPixel :: PrimMonad m => STVector (PrimState m) (PixelBaseComponent PixelF) -> Int -> m PixelF

unsafeWritePixel :: PrimMonad m => STVector (PrimState m) (PixelBaseComponent PixelF) -> Int -> PixelF -> m ()

LumaPlaneExtractable PixelF 
Instance details

Defined in Codec.Picture.Types

Methods

computeLuma :: PixelF -> PixelBaseComponent PixelF

extractLumaPlane :: Image PixelF -> Image (PixelBaseComponent PixelF)

PackeablePixel PixelF 
Instance details

Defined in Codec.Picture.Types

Associated Types

type PackedRepresentation PixelF :: *

Methods

packPixel :: PixelF -> PackedRepresentation PixelF

unpackPixel :: PackedRepresentation PixelF -> PixelF

Transfinite Float 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Float #

negativeInfinity :: Float #

notANumber :: Float #

isInfinite :: Float -> Bool

isNaN :: Float -> Bool

PartialOrd Float 
Instance details

Defined in Data.Number.PartialOrd

Methods

cmp :: Float -> Float -> Maybe Ordering

gt :: Float -> Float -> Maybe Bool

ge :: Float -> Float -> Maybe Bool

eq :: Float -> Float -> Maybe Bool

ne :: Float -> Float -> Maybe Bool

le :: Float -> Float -> Maybe Bool

lt :: Float -> Float -> Maybe Bool

maxPO :: Float -> Float -> Maybe Float

minPO :: Float -> Float -> Maybe Float

IArray UArray Float 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Float -> (i, i) #

numElements :: Ix i => UArray i Float -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Float)] -> UArray i Float

unsafeAt :: Ix i => UArray i Float -> Int -> Float

unsafeReplace :: Ix i => UArray i Float -> [(Int, Float)] -> UArray i Float

unsafeAccum :: Ix i => (Float -> e' -> Float) -> UArray i Float -> [(Int, e')] -> UArray i Float

unsafeAccumArray :: Ix i => (Float -> e' -> Float) -> Float -> (i, i) -> [(Int, e')] -> UArray i Float

Container Vector Float 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector Float -> Vector Float

size' :: Vector Float -> IndexOf Vector

scalar' :: Float -> Vector Float

scale' :: Float -> Vector Float -> Vector Float

addConstant :: Float -> Vector Float -> Vector Float

add' :: Vector Float -> Vector Float -> Vector Float

sub :: Vector Float -> Vector Float -> Vector Float

mul :: Vector Float -> Vector Float -> Vector Float

equal :: Vector Float -> Vector Float -> Bool

cmap' :: Element b => (Float -> b) -> Vector Float -> Vector b

konst' :: Float -> IndexOf Vector -> Vector Float

build' :: IndexOf Vector -> ArgOf Vector Float -> Vector Float

atIndex' :: Vector Float -> IndexOf Vector -> Float

minIndex' :: Vector Float -> IndexOf Vector

maxIndex' :: Vector Float -> IndexOf Vector

minElement' :: Vector Float -> Float

maxElement' :: Vector Float -> Float

sumElements' :: Vector Float -> Float

prodElements' :: Vector Float -> Float

step' :: Vector Float -> Vector Float

ccompare' :: Vector Float -> Vector Float -> Vector I

cselect' :: Vector I -> Vector Float -> Vector Float -> Vector Float -> Vector Float

find' :: (Float -> Bool) -> Vector Float -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Float -> [(IndexOf Vector, Float)] -> Vector Float

accum' :: Vector Float -> (Float -> Float -> Float) -> [(IndexOf Vector, Float)] -> Vector Float

scaleRecip :: Float -> Vector Float -> Vector Float

divide :: Vector Float -> Vector Float -> Vector Float

arctan2' :: Vector Float -> Vector Float -> Vector Float

cmod' :: Float -> Vector Float -> Vector Float

fromInt' :: Vector I -> Vector Float

toInt' :: Vector Float -> Vector I

fromZ' :: Vector Z -> Vector Float

toZ' :: Vector Float -> Vector Z

MVector MVector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Float -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float

basicOverlaps :: MVector s Float -> MVector s Float -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float)

basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Float -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float)

Vector Vector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float)

basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float)

basicLength :: Vector Float -> Int

basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float

basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m ()

elemseq :: Vector Float -> Float -> b -> b

Normed Matrix Float 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix Float -> RealOf Float

Normed Vector Float 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector Float -> RealOf Float

CDF StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Float -> Float -> Double

CDF Uniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Float -> Float -> Double

Distribution Normal Float 
Instance details

Defined in Data.Random.Distribution.Normal

Methods

rvar :: Normal Float -> RVar Float

rvarT :: Normal Float -> RVarT n Float

Distribution StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Float -> RVar Float

rvarT :: StdUniform Float -> RVarT n Float

Distribution Uniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Float -> RVar Float

rvarT :: Uniform Float -> RVarT n Float

Distribution Beta Float 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

rvar :: Beta Float -> RVar Float

rvarT :: Beta Float -> RVarT n Float

PDF StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

pdf :: StdUniform Float -> Float -> Double

logPdf :: StdUniform Float -> Float -> Double

PDF Beta Float 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

pdf :: Beta Float -> Float -> Double

logPdf :: Beta Float -> Float -> Double

ColorConvertible Pixel8 PixelF 
Instance details

Defined in Codec.Picture.Types

Methods

promotePixel :: Pixel8 -> PixelF

promoteImage :: Image Pixel8 -> Image PixelF

ColorConvertible PixelF PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

promotePixel :: PixelF -> PixelRGBF

promoteImage :: Image PixelF -> Image PixelRGBF

MArray IOUArray Float IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Float -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Float -> IO Int

newArray :: Ix i => (i, i) -> Float -> IO (IOUArray i Float) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Float)

unsafeRead :: Ix i => IOUArray i Float -> Int -> IO Float

unsafeWrite :: Ix i => IOUArray i Float -> Int -> Float -> IO ()

Container Vector (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector (Complex Float) -> Vector (Complex Float)

size' :: Vector (Complex Float) -> IndexOf Vector

scalar' :: Complex Float -> Vector (Complex Float)

scale' :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

addConstant :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

add' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

sub :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

mul :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

equal :: Vector (Complex Float) -> Vector (Complex Float) -> Bool

cmap' :: Element b => (Complex Float -> b) -> Vector (Complex Float) -> Vector b

konst' :: Complex Float -> IndexOf Vector -> Vector (Complex Float)

build' :: IndexOf Vector -> ArgOf Vector (Complex Float) -> Vector (Complex Float)

atIndex' :: Vector (Complex Float) -> IndexOf Vector -> Complex Float

minIndex' :: Vector (Complex Float) -> IndexOf Vector

maxIndex' :: Vector (Complex Float) -> IndexOf Vector

minElement' :: Vector (Complex Float) -> Complex Float

maxElement' :: Vector (Complex Float) -> Complex Float

sumElements' :: Vector (Complex Float) -> Complex Float

prodElements' :: Vector (Complex Float) -> Complex Float

step' :: Vector (Complex Float) -> Vector (Complex Float)

ccompare' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector I

cselect' :: Vector I -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

find' :: (Complex Float -> Bool) -> Vector (Complex Float) -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Complex Float -> [(IndexOf Vector, Complex Float)] -> Vector (Complex Float)

accum' :: Vector (Complex Float) -> (Complex Float -> Complex Float -> Complex Float) -> [(IndexOf Vector, Complex Float)] -> Vector (Complex Float)

scaleRecip :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

divide :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

arctan2' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

cmod' :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

fromInt' :: Vector I -> Vector (Complex Float)

toInt' :: Vector (Complex Float) -> Vector I

fromZ' :: Vector Z -> Vector (Complex Float)

toZ' :: Vector (Complex Float) -> Vector Z

Normed Matrix (Complex Float) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix (Complex Float) -> RealOf (Complex Float)

Normed Vector (Complex Float) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector (Complex Float) -> RealOf (Complex Float)

Generic1 (URec Float :: k -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Float) :: k -> * #

Methods

from1 :: URec Float a -> Rep1 (URec Float) a #

to1 :: Rep1 (URec Float) a -> URec Float a #

Element (Complex Float) 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Complex Float -> Int -> Vector (Complex Float)

extractR :: MatrixOrder -> Matrix (Complex Float) -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix (Complex Float))

setRect :: Int -> Int -> Matrix (Complex Float) -> Matrix (Complex Float) -> IO ()

sortI :: Vector (Complex Float) -> Vector CInt

sortV :: Vector (Complex Float) -> Vector (Complex Float)

compareV :: Vector (Complex Float) -> Vector (Complex Float) -> Vector CInt

selectV :: Vector CInt -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

remapM :: Matrix CInt -> Matrix CInt -> Matrix (Complex Float) -> Matrix (Complex Float)

rowOp :: Int -> Complex Float -> Int -> Int -> Int -> Int -> Matrix (Complex Float) -> IO ()

gemm :: Vector (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float) -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector (Complex Float) -> Vector (Complex Float)

Convert (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf (Complex Float)) -> c (Complex Float)

complex :: Complexable c => c (Complex Float) -> c (ComplexOf (Complex Float))

single :: Complexable c => c (Complex Float) -> c (SingleOf (Complex Float))

double :: Complexable c => c (Complex Float) -> c (DoubleOf (Complex Float))

toComplex :: (Complexable c, RealElement (Complex Float)) => (c (Complex Float), c (Complex Float)) -> c (Complex (Complex Float))

fromComplex :: (Complexable c, RealElement (Complex Float)) => c (Complex (Complex Float)) -> (c (Complex Float), c (Complex Float))

Numeric (Complex Float) 
Instance details

Defined in Internal.Numeric

Product (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float)

absSum :: Vector (Complex Float) -> RealOf (Complex Float)

norm1 :: Vector (Complex Float) -> RealOf (Complex Float)

norm2 :: Vector (Complex Float) -> RealOf (Complex Float)

normInf :: Vector (Complex Float) -> RealOf (Complex Float)

Normed (Vector Float) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector Float -> R

norm_1 :: Vector Float -> R

norm_2 :: Vector Float -> R

norm_Inf :: Vector Float -> R

Normed (Vector (Complex Float)) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector (Complex Float) -> R

norm_1 :: Vector (Complex Float) -> R

norm_2 :: Vector (Complex Float) -> R

norm_Inf :: Vector (Complex Float) -> R

CTrans (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix (Complex Float) -> Matrix (Complex Float)

Indexable (Vector Float) Float 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector Float -> Int -> Float

CDF (Poisson b) Integer => CDF (Poisson b) Float 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Float -> Float -> Double

CDF (Binomial b) Integer => CDF (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Float -> Float -> Double

Distribution (Poisson b) Integer => Distribution (Poisson b) Float 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Float -> RVar Float

rvarT :: Poisson b Float -> RVarT n Float

Distribution (Binomial b) Integer => Distribution (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Float -> RVar Float

rvarT :: Binomial b Float -> RVarT n Float

PDF (Binomial b) Integer => PDF (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Float -> Float -> Double

logPdf :: Binomial b Float -> Float -> Double

MArray (STUArray s) Float (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Float -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Float -> ST s Int

newArray :: Ix i => (i, i) -> Float -> ST s (STUArray s i Float) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Float)

unsafeRead :: Ix i => STUArray s i Float -> Int -> ST s Float

unsafeWrite :: Ix i => STUArray s i Float -> Int -> Float -> ST s ()

Indexable (Vector (Complex Float)) (Complex Float) 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector (Complex Float) -> Int -> Complex Float

Functor (URec Float :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Foldable (URec Float :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Float m -> m #

foldMap :: Monoid m => (a -> m) -> URec Float a -> m #

foldr :: (a -> b -> b) -> b -> URec Float a -> b #

foldr' :: (a -> b -> b) -> b -> URec Float a -> b #

foldl :: (b -> a -> b) -> b -> URec Float a -> b #

foldl' :: (b -> a -> b) -> b -> URec Float a -> b #

foldr1 :: (a -> a -> a) -> URec Float a -> a #

foldl1 :: (a -> a -> a) -> URec Float a -> a #

toList :: URec Float a -> [a] #

null :: URec Float a -> Bool #

length :: URec Float a -> Int #

elem :: Eq a => a -> URec Float a -> Bool #

maximum :: Ord a => URec Float a -> a #

minimum :: Ord a => URec Float a -> a #

sum :: Num a => URec Float a -> a #

product :: Num a => URec Float a -> a #

Traversable (URec Float :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Eq (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Float p -> URec Float p -> Bool #

(/=) :: URec Float p -> URec Float p -> Bool #

Ord (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering #

(<) :: URec Float p -> URec Float p -> Bool #

(<=) :: URec Float p -> URec Float p -> Bool #

(>) :: URec Float p -> URec Float p -> Bool #

(>=) :: URec Float p -> URec Float p -> Bool #

max :: URec Float p -> URec Float p -> URec Float p #

min :: URec Float p -> URec Float p -> URec Float p #

Show (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Float p -> ShowS #

show :: URec Float p -> String #

showList :: [URec Float p] -> ShowS #

Generic (URec Float p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Float p) :: * -> * #

Methods

from :: URec Float p -> Rep (URec Float p) x #

to :: Rep (URec Float p) x -> URec Float p #

type BooleanOf Float 
Instance details

Defined in Data.Boolean

type BooleanOf Float = Bool
type PrimSize Float 
Instance details

Defined in Basement.PrimType

type PrimSize Float = 4
type Difference Float 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Float = Float
data Vector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Float = V_Float (Vector Float)
type DoubleOf Float 
Instance details

Defined in Internal.Numeric

type DoubleOf Float = Double
type RealOf Float 
Instance details

Defined in Internal.Numeric

type RealOf Float = Float
type SingleOf Float 
Instance details

Defined in Internal.Numeric

type SingleOf Float = Float
type PixelBaseComponent PixelF 
Instance details

Defined in Codec.Picture.Types

type PixelBaseComponent PixelF = Float
type PackedRepresentation PixelF 
Instance details

Defined in Codec.Picture.Types

type PackedRepresentation PixelF = PixelF
data URec Float (p :: k)

Used for marking occurrences of Float#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Float (p :: k) = UFloat {}
data MVector s Float 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Float = MV_Float (MVector s Float)
type Rep1 (URec Float :: k -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (URec Float :: k -> *) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: k -> *)))
type RealOf (Complex Float) 
Instance details

Defined in Internal.Numeric

type RealOf (Complex Float) = Float
type Rep (URec Float p) 
Instance details

Defined in GHC.Generics

type Rep (URec Float p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: * -> *)))

data Int #

A fixed-precision integer type with at least the range [-2^29 .. 2^29-1]. + to the IEEE single-precision type.

Instances
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 substitutivity:

>>> 0 == (-0 :: Float)
+True
+>>> recip 0 == recip (-0 :: Float)
+False
+
Instance details

Defined in GHC.Classes

Methods

(==) :: Float -> Float -> Bool #

(/=) :: Float -> Float -> Bool #

Floating Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

pi :: Float #

exp :: Float -> Float #

log :: Float -> Float #

sqrt :: Float -> Float #

(**) :: Float -> Float -> Float #

logBase :: Float -> Float -> Float #

sin :: Float -> Float #

cos :: Float -> Float #

tan :: Float -> Float #

asin :: Float -> Float #

acos :: Float -> Float #

atan :: Float -> Float #

sinh :: Float -> Float #

cosh :: Float -> Float #

tanh :: Float -> Float #

asinh :: Float -> Float #

acosh :: Float -> Float #

atanh :: Float -> Float #

log1p :: Float -> Float #

expm1 :: Float -> Float #

log1pexp :: Float -> Float #

log1mexp :: Float -> Float #

Ord Float

Note that due to the presence of NaN, Float's Ord instance does not + satisfy reflexivity.

>>> 0/0 <= (0/0 :: Float)
+False
+

Also note that, due to the same, Ord's operator interactions are not + respected by Float's instance:

>>> (0/0 :: Float) > 1
+False
+>>> compare (0/0 :: Float) 1
+GT
+
Instance details

Defined in GHC.Classes

Methods

compare :: Float -> Float -> Ordering #

(<) :: Float -> Float -> Bool #

(<=) :: Float -> Float -> Bool #

(>) :: Float -> Float -> Bool #

(>=) :: Float -> Float -> Bool #

max :: Float -> Float -> Float #

min :: Float -> Float -> Float #

Read Float

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Float #

readList :: ReadS [Float] #

readPrec :: ReadPrec Float #

readListPrec :: ReadPrec [Float] #

RealFloat Float

Since: base-2.1

Instance details

Defined in GHC.Float

Methods

floatRadix :: Float -> Integer #

floatDigits :: Float -> Int #

floatRange :: Float -> (Int, Int) #

decodeFloat :: Float -> (Integer, Int) #

encodeFloat :: Integer -> Int -> Float #

exponent :: Float -> Int #

significand :: Float -> Float #

scaleFloat :: Int -> Float -> Float #

isNaN :: Float -> Bool #

isInfinite :: Float -> Bool #

isDenormalized :: Float -> Bool #

isNegativeZero :: Float -> Bool #

isIEEE :: Float -> Bool #

atan2 :: Float -> Float -> Float #

Lift Float 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Float -> Q Exp #

IfB Float 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Float => bool -> Float -> Float -> Float #

EqB Float 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(/=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

OrdB Float 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(<=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

TiffSaveable PixelF 
Instance details

Defined in Codec.Picture.Tiff

Methods

colorSpaceOfPixel :: PixelF -> TiffColorspace

extraSampleCodeOfPixel :: PixelF -> Maybe ExtraSample

subSamplingInfo :: PixelF -> Vector Word32

sampleFormat :: PixelF -> [TiffSampleFormat]

Pixel PixelF 
Instance details

Defined in Codec.Picture.Types

Associated Types

type PixelBaseComponent PixelF :: Type #

Methods

mixWith :: (Int -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF -> PixelF #

mixWithAlpha :: (Int -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> (PixelBaseComponent PixelF -> PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF -> PixelF #

pixelOpacity :: PixelF -> PixelBaseComponent PixelF #

componentCount :: PixelF -> Int #

colorMap :: (PixelBaseComponent PixelF -> PixelBaseComponent PixelF) -> PixelF -> PixelF #

pixelBaseIndex :: Image PixelF -> Int -> Int -> Int #

mutablePixelBaseIndex :: MutableImage s PixelF -> Int -> Int -> Int #

pixelAt :: Image PixelF -> Int -> Int -> PixelF #

readPixel :: PrimMonad m => MutableImage (PrimState m) PixelF -> Int -> Int -> m PixelF #

writePixel :: PrimMonad m => MutableImage (PrimState m) PixelF -> Int -> Int -> PixelF -> m () #

unsafePixelAt :: Vector (PixelBaseComponent PixelF) -> Int -> PixelF #

unsafeReadPixel :: PrimMonad m => STVector (PrimState m) (PixelBaseComponent PixelF) -> Int -> m PixelF #

unsafeWritePixel :: PrimMonad m => STVector (PrimState m) (PixelBaseComponent PixelF) -> Int -> PixelF -> m () #

LumaPlaneExtractable PixelF 
Instance details

Defined in Codec.Picture.Types

Methods

computeLuma :: PixelF -> PixelBaseComponent PixelF #

extractLumaPlane :: Image PixelF -> Image (PixelBaseComponent PixelF) #

PackeablePixel PixelF 
Instance details

Defined in Codec.Picture.Types

Associated Types

type PackedRepresentation PixelF :: Type #

Methods

packPixel :: PixelF -> PackedRepresentation PixelF #

unpackPixel :: PackedRepresentation PixelF -> PixelF #

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] #

randomRIO :: (Float, Float) -> IO Float #

randomIO :: IO Float #

NFData Float 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Float -> () #

Hashable Float 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Float -> Int #

hash :: Float -> Int #

PrintfArg Float

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Float -> FieldFormatter #

parseFormat :: Float -> ModifierParser #

Storable Float

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Float -> Int #

alignment :: Float -> Int #

peekElemOff :: Ptr Float -> Int -> IO Float #

pokeElemOff :: Ptr Float -> Int -> Float -> IO () #

peekByteOff :: Ptr b -> Int -> IO Float #

pokeByteOff :: Ptr b -> Int -> Float -> IO () #

peek :: Ptr Float -> IO Float #

poke :: Ptr Float -> Float -> IO () #

PrimType Float 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Float :: Nat #

Methods

primSizeInBytes :: Proxy Float -> CountOf Word8 #

primShiftToBytes :: Proxy Float -> Int #

primBaUIndex :: ByteArray# -> Offset Float -> Float #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> prim Float #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> Float -> prim () #

primAddrIndex :: Addr# -> Offset Float -> Float #

primAddrRead :: PrimMonad prim => Addr# -> Offset Float -> prim Float #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Float -> Float -> prim () #

Subtractive Float 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Float :: Type #

Methods

(-) :: Float -> Float -> Difference Float #

Binary Float 
Instance details

Defined in Data.Binary.Class

Methods

put :: Float -> Put #

get :: Get Float #

putList :: [Float] -> Put #

FromField Float

Accepts same syntax as rational. Ignores whitespace.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Float #

ToField Float

Uses decimal notation or scientific notation, depending on the + number.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Float -> Field #

Default Float 
Instance details

Defined in Data.Default.Class

Methods

def :: Float #

CTrans Float 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix Float -> Matrix Float

Numeric Float 
Instance details

Defined in Internal.Numeric

Product Float 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix Float -> Matrix Float -> Matrix Float

absSum :: Vector Float -> RealOf Float

norm1 :: Vector Float -> RealOf Float

norm2 :: Vector Float -> RealOf Float

normInf :: Vector Float -> RealOf Float

Convert Float 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf Float) -> c Float #

complex :: Complexable c => c Float -> c (ComplexOf Float) #

single :: Complexable c => c Float -> c (SingleOf Float) #

double :: Complexable c => c Float -> c (DoubleOf Float) #

toComplex :: (Complexable c, RealElement Float) => (c Float, c Float) -> c (Complex Float) #

fromComplex :: (Complexable c, RealElement Float) => c (Complex Float) -> (c Float, c Float) #

Element Float 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Float -> Int -> Vector Float

extractR :: MatrixOrder -> Matrix Float -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix Float)

setRect :: Int -> Int -> Matrix Float -> Matrix Float -> IO ()

sortI :: Vector Float -> Vector CInt

sortV :: Vector Float -> Vector Float

compareV :: Vector Float -> Vector Float -> Vector CInt

selectV :: Vector CInt -> Vector Float -> Vector Float -> Vector Float -> Vector Float

remapM :: Matrix CInt -> Matrix CInt -> Matrix Float -> Matrix Float

rowOp :: Int -> Float -> Int -> Int -> Int -> Int -> Matrix Float -> IO ()

gemm :: Vector Float -> Matrix Float -> Matrix Float -> Matrix Float -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector Float -> Vector Float

Transfinite Float 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Float #

negativeInfinity :: Float #

notANumber :: Float #

isInfinite :: Float -> Bool #

isNaN :: Float -> Bool #

PartialOrd Float 
Instance details

Defined in Data.Number.PartialOrd

Methods

cmp :: Float -> Float -> Maybe Ordering #

gt :: Float -> Float -> Maybe Bool #

ge :: Float -> Float -> Maybe Bool #

eq :: Float -> Float -> Maybe Bool #

ne :: Float -> Float -> Maybe Bool #

le :: Float -> Float -> Maybe Bool #

lt :: Float -> Float -> Maybe Bool #

maxPO :: Float -> Float -> Maybe Float #

minPO :: Float -> Float -> Maybe Float #

Prim Float 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Float -> Int# #

alignment# :: Float -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Float #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Float#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Float -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Float -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Float #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Float#) #

writeOffAddr# :: Addr# -> Int# -> Float -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Float -> State# s -> State# s #

Unbox Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Float 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Float

uniformR :: PrimMonad m => (Float, Float) -> Gen (PrimState m) -> m Float

Precise Float 
Instance details

Defined in Numeric.Log

Methods

log1p :: Float -> Float

expm1 :: Float -> Float

log1pexp :: Float -> Float

log1mexp :: Float -> Float

IsName Float 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Float -> Name

Unpackable Float 
Instance details

Defined in Codec.Picture.Tiff

Associated Types

type StorageType Float :: Type

Methods

outAlloc :: Float -> Int -> ST s (STVector s (StorageType Float))

allocTempBuffer :: Float -> STVector s (StorageType Float) -> Int -> ST s (STVector s Word8)

offsetStride :: Float -> Int -> Int -> (Int, Int)

mergeBackTempBuffer :: Float -> Endianness -> STVector s Word8 -> Int -> Int -> Word32 -> Int -> STVector s (StorageType Float) -> ST s ()

ColorConvertible Pixel8 PixelF 
Instance details

Defined in Codec.Picture.Types

Methods

promotePixel :: Pixel8 -> PixelF #

promoteImage :: Image Pixel8 -> Image PixelF #

ColorConvertible PixelF PixelRGBF 
Instance details

Defined in Codec.Picture.Types

Methods

promotePixel :: PixelF -> PixelRGBF #

promoteImage :: Image PixelF -> Image PixelRGBF #

IArray UArray Float 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Float -> (i, i) #

numElements :: Ix i => UArray i Float -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Float)] -> UArray i Float

unsafeAt :: Ix i => UArray i Float -> Int -> Float

unsafeReplace :: Ix i => UArray i Float -> [(Int, Float)] -> UArray i Float

unsafeAccum :: Ix i => (Float -> e' -> Float) -> UArray i Float -> [(Int, e')] -> UArray i Float

unsafeAccumArray :: Ix i => (Float -> e' -> Float) -> Float -> (i, i) -> [(Int, e')] -> UArray i Float

Normed Vector Float 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector Float -> RealOf Float

Normed Matrix Float 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix Float -> RealOf Float

Container Vector Float 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector Float -> Vector Float

size' :: Vector Float -> IndexOf Vector

scalar' :: Float -> Vector Float

scale' :: Float -> Vector Float -> Vector Float

addConstant :: Float -> Vector Float -> Vector Float

add' :: Vector Float -> Vector Float -> Vector Float

sub :: Vector Float -> Vector Float -> Vector Float

mul :: Vector Float -> Vector Float -> Vector Float

equal :: Vector Float -> Vector Float -> Bool

cmap' :: Element b => (Float -> b) -> Vector Float -> Vector b

konst' :: Float -> IndexOf Vector -> Vector Float

build' :: IndexOf Vector -> ArgOf Vector Float -> Vector Float

atIndex' :: Vector Float -> IndexOf Vector -> Float

minIndex' :: Vector Float -> IndexOf Vector

maxIndex' :: Vector Float -> IndexOf Vector

minElement' :: Vector Float -> Float

maxElement' :: Vector Float -> Float

sumElements' :: Vector Float -> Float

prodElements' :: Vector Float -> Float

step' :: Vector Float -> Vector Float

ccompare' :: Vector Float -> Vector Float -> Vector I

cselect' :: Vector I -> Vector Float -> Vector Float -> Vector Float -> Vector Float

find' :: (Float -> Bool) -> Vector Float -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Float -> [(IndexOf Vector, Float)] -> Vector Float

accum' :: Vector Float -> (Float -> Float -> Float) -> [(IndexOf Vector, Float)] -> Vector Float

scaleRecip :: Float -> Vector Float -> Vector Float

divide :: Vector Float -> Vector Float -> Vector Float

arctan2' :: Vector Float -> Vector Float -> Vector Float

cmod' :: Float -> Vector Float -> Vector Float

fromInt' :: Vector I -> Vector Float

toInt' :: Vector Float -> Vector I

fromZ' :: Vector Z -> Vector Float

toZ' :: Vector Float -> Vector Z

Vector Vector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float) #

basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float) #

basicLength :: Vector Float -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float #

basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m () #

elemseq :: Vector Float -> Float -> b -> b #

MVector MVector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Float -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float #

basicOverlaps :: MVector s Float -> MVector s Float -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Float -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float) #

CDF StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Float -> Float -> Double

CDF Uniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Float -> Float -> Double

Distribution Normal Float 
Instance details

Defined in Data.Random.Distribution.Normal

Methods

rvar :: Normal Float -> RVar Float

rvarT :: Normal Float -> RVarT n Float

Distribution StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Float -> RVar Float

rvarT :: StdUniform Float -> RVarT n Float

Distribution Uniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Float -> RVar Float

rvarT :: Uniform Float -> RVarT n Float

Distribution Beta Float 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

rvar :: Beta Float -> RVar Float

rvarT :: Beta Float -> RVarT n Float

PDF StdUniform Float 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

pdf :: StdUniform Float -> Float -> Double

logPdf :: StdUniform Float -> Float -> Double

PDF Beta Float 
Instance details

Defined in Data.Random.Distribution.Beta

Methods

pdf :: Beta Float -> Float -> Double

logPdf :: Beta Float -> Float -> Double

MArray IOUArray Float IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Float -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Float -> IO Int

newArray :: Ix i => (i, i) -> Float -> IO (IOUArray i Float) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Float)

unsafeRead :: Ix i => IOUArray i Float -> Int -> IO Float

unsafeWrite :: Ix i => IOUArray i Float -> Int -> Float -> IO ()

Normed Vector (Complex Float) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Vector (Complex Float) -> RealOf (Complex Float)

Normed Matrix (Complex Float) 
Instance details

Defined in Internal.Algorithms

Methods

pnorm :: NormType -> Matrix (Complex Float) -> RealOf (Complex Float)

Container Vector (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

conj' :: Vector (Complex Float) -> Vector (Complex Float)

size' :: Vector (Complex Float) -> IndexOf Vector

scalar' :: Complex Float -> Vector (Complex Float)

scale' :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

addConstant :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

add' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

sub :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

mul :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

equal :: Vector (Complex Float) -> Vector (Complex Float) -> Bool

cmap' :: Element b => (Complex Float -> b) -> Vector (Complex Float) -> Vector b

konst' :: Complex Float -> IndexOf Vector -> Vector (Complex Float)

build' :: IndexOf Vector -> ArgOf Vector (Complex Float) -> Vector (Complex Float)

atIndex' :: Vector (Complex Float) -> IndexOf Vector -> Complex Float

minIndex' :: Vector (Complex Float) -> IndexOf Vector

maxIndex' :: Vector (Complex Float) -> IndexOf Vector

minElement' :: Vector (Complex Float) -> Complex Float

maxElement' :: Vector (Complex Float) -> Complex Float

sumElements' :: Vector (Complex Float) -> Complex Float

prodElements' :: Vector (Complex Float) -> Complex Float

step' :: Vector (Complex Float) -> Vector (Complex Float)

ccompare' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector I

cselect' :: Vector I -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

find' :: (Complex Float -> Bool) -> Vector (Complex Float) -> [IndexOf Vector]

assoc' :: IndexOf Vector -> Complex Float -> [(IndexOf Vector, Complex Float)] -> Vector (Complex Float)

accum' :: Vector (Complex Float) -> (Complex Float -> Complex Float -> Complex Float) -> [(IndexOf Vector, Complex Float)] -> Vector (Complex Float)

scaleRecip :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

divide :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

arctan2' :: Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

cmod' :: Complex Float -> Vector (Complex Float) -> Vector (Complex Float)

fromInt' :: Vector I -> Vector (Complex Float)

toInt' :: Vector (Complex Float) -> Vector I

fromZ' :: Vector Z -> Vector (Complex Float)

toZ' :: Vector (Complex Float) -> Vector Z

Generic1 (URec Float :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Float) :: k -> Type #

Methods

from1 :: URec Float a -> Rep1 (URec Float) a #

to1 :: Rep1 (URec Float) a -> URec Float a #

CTrans (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

ctrans :: Matrix (Complex Float) -> Matrix (Complex Float)

Normed (Vector Float) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector Float -> R #

norm_1 :: Vector Float -> R #

norm_2 :: Vector Float -> R #

norm_Inf :: Vector Float -> R #

Normed (Vector (Complex Float)) 
Instance details

Defined in Internal.Util

Methods

norm_0 :: Vector (Complex Float) -> R #

norm_1 :: Vector (Complex Float) -> R #

norm_2 :: Vector (Complex Float) -> R #

norm_Inf :: Vector (Complex Float) -> R #

Numeric (Complex Float) 
Instance details

Defined in Internal.Numeric

Product (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

multiply :: Matrix (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float)

absSum :: Vector (Complex Float) -> RealOf (Complex Float)

norm1 :: Vector (Complex Float) -> RealOf (Complex Float)

norm2 :: Vector (Complex Float) -> RealOf (Complex Float)

normInf :: Vector (Complex Float) -> RealOf (Complex Float)

Convert (Complex Float) 
Instance details

Defined in Internal.Numeric

Methods

real :: Complexable c => c (RealOf (Complex Float)) -> c (Complex Float) #

complex :: Complexable c => c (Complex Float) -> c (ComplexOf (Complex Float)) #

single :: Complexable c => c (Complex Float) -> c (SingleOf (Complex Float)) #

double :: Complexable c => c (Complex Float) -> c (DoubleOf (Complex Float)) #

toComplex :: (Complexable c, RealElement (Complex Float)) => (c (Complex Float), c (Complex Float)) -> c (Complex (Complex Float)) #

fromComplex :: (Complexable c, RealElement (Complex Float)) => c (Complex (Complex Float)) -> (c (Complex Float), c (Complex Float)) #

Element (Complex Float) 
Instance details

Defined in Internal.Matrix

Methods

constantD :: Complex Float -> Int -> Vector (Complex Float)

extractR :: MatrixOrder -> Matrix (Complex Float) -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix (Complex Float))

setRect :: Int -> Int -> Matrix (Complex Float) -> Matrix (Complex Float) -> IO ()

sortI :: Vector (Complex Float) -> Vector CInt

sortV :: Vector (Complex Float) -> Vector (Complex Float)

compareV :: Vector (Complex Float) -> Vector (Complex Float) -> Vector CInt

selectV :: Vector CInt -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float) -> Vector (Complex Float)

remapM :: Matrix CInt -> Matrix CInt -> Matrix (Complex Float) -> Matrix (Complex Float)

rowOp :: Int -> Complex Float -> Int -> Int -> Int -> Int -> Matrix (Complex Float) -> IO ()

gemm :: Vector (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float) -> Matrix (Complex Float) -> IO ()

reorderV :: Vector CInt -> Vector CInt -> Vector (Complex Float) -> Vector (Complex Float)

Indexable (Vector Float) Float 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector Float -> Int -> Float #

CDF (Poisson b) Integer => CDF (Poisson b) Float 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Float -> Float -> Double

CDF (Binomial b) Integer => CDF (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Float -> Float -> Double

Distribution (Poisson b) Integer => Distribution (Poisson b) Float 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Float -> RVar Float

rvarT :: Poisson b Float -> RVarT n Float

Distribution (Binomial b) Integer => Distribution (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Float -> RVar Float

rvarT :: Binomial b Float -> RVarT n Float

PDF (Binomial b) Integer => PDF (Binomial b) Float 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Float -> Float -> Double

logPdf :: Binomial b Float -> Float -> Double

MArray (STUArray s) Float (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Float -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Float -> ST s Int

newArray :: Ix i => (i, i) -> Float -> ST s (STUArray s i Float) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Float)

unsafeRead :: Ix i => STUArray s i Float -> Int -> ST s Float

unsafeWrite :: Ix i => STUArray s i Float -> Int -> Float -> ST s ()

Indexable (Vector (Complex Float)) (Complex Float) 
Instance details

Defined in Internal.Util

Methods

(!) :: Vector (Complex Float) -> Int -> Complex Float #

Functor (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Foldable (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Float m -> m #

foldMap :: Monoid m => (a -> m) -> URec Float a -> m #

foldr :: (a -> b -> b) -> b -> URec Float a -> b #

foldr' :: (a -> b -> b) -> b -> URec Float a -> b #

foldl :: (b -> a -> b) -> b -> URec Float a -> b #

foldl' :: (b -> a -> b) -> b -> URec Float a -> b #

foldr1 :: (a -> a -> a) -> URec Float a -> a #

foldl1 :: (a -> a -> a) -> URec Float a -> a #

toList :: URec Float a -> [a] #

null :: URec Float a -> Bool #

length :: URec Float a -> Int #

elem :: Eq a => a -> URec Float a -> Bool #

maximum :: Ord a => URec Float a -> a #

minimum :: Ord a => URec Float a -> a #

sum :: Num a => URec Float a -> a #

product :: Num a => URec Float a -> a #

Traversable (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Float a -> f (URec Float b) #

sequenceA :: Applicative f => URec Float (f a) -> f (URec Float a) #

mapM :: Monad m => (a -> m b) -> URec Float a -> m (URec Float b) #

sequence :: Monad m => URec Float (m a) -> m (URec Float a) #

Eq (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Float p -> URec Float p -> Bool #

(/=) :: URec Float p -> URec Float p -> Bool #

Ord (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Float p -> URec Float p -> Ordering #

(<) :: URec Float p -> URec Float p -> Bool #

(<=) :: URec Float p -> URec Float p -> Bool #

(>) :: URec Float p -> URec Float p -> Bool #

(>=) :: URec Float p -> URec Float p -> Bool #

max :: URec Float p -> URec Float p -> URec Float p #

min :: URec Float p -> URec Float p -> URec Float p #

Show (URec Float p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Float p -> ShowS #

show :: URec Float p -> String #

showList :: [URec Float p] -> ShowS #

Generic (URec Float p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Float p) :: Type -> Type #

Methods

from :: URec Float p -> Rep (URec Float p) x #

to :: Rep (URec Float p) x -> URec Float p #

type BooleanOf Float 
Instance details

Defined in Data.Boolean

type BooleanOf Float = Bool
type PixelBaseComponent PixelF 
Instance details

Defined in Codec.Picture.Types

type PixelBaseComponent PixelF = Float
type PackedRepresentation PixelF 
Instance details

Defined in Codec.Picture.Types

type PackedRepresentation PixelF = PixelF
type PrimSize Float 
Instance details

Defined in Basement.PrimType

type PrimSize Float = 4
type Difference Float 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Float = Float
type RealOf Float 
Instance details

Defined in Internal.Numeric

type RealOf Float = Float
type SingleOf Float 
Instance details

Defined in Internal.Numeric

type SingleOf Float = Float
type DoubleOf Float 
Instance details

Defined in Internal.Numeric

type DoubleOf Float = Double
newtype Vector Float 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Float = V_Float (Vector Float)
type StorageType Float 
Instance details

Defined in Codec.Picture.Tiff

type StorageType Float = Float
data URec Float (p :: k)

Used for marking occurrences of Float#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Float (p :: k) = UFloat {}
newtype MVector s Float 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Float = MV_Float (MVector s Float)
type Rep1 (URec Float :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Float :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: k -> Type)))
type RealOf (Complex Float) 
Instance details

Defined in Internal.Numeric

type RealOf (Complex Float) = Float
type Rep (URec Float p) 
Instance details

Defined in GHC.Generics

type Rep (URec Float p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UFloat" PrefixI True) (S1 (MetaSel (Just "uFloat#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UFloat :: Type -> Type)))

data Int #

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
Bounded Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Int #

maxBound :: Int #

Enum Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Int -> Int #

pred :: Int -> Int #

toEnum :: Int -> Int #

fromEnum :: Int -> Int #

enumFrom :: Int -> [Int] #

enumFromThen :: Int -> Int -> [Int] #

enumFromTo :: Int -> Int -> [Int] #

enumFromThenTo :: Int -> Int -> Int -> [Int] #

Eq Int 
Instance details

Defined in GHC.Classes

Methods

(==) :: Int -> Int -> Bool #

(/=) :: Int -> Int -> Bool #

Integral Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Int -> Int -> Int #

rem :: Int -> Int -> Int #

div :: Int -> Int -> Int #

mod :: Int -> Int -> Int #

quotRem :: Int -> Int -> (Int, Int) #

divMod :: Int -> Int -> (Int, Int) #

toInteger :: Int -> Integer #

Num Int

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Int -> Int -> Int #

(-) :: Int -> Int -> Int #

(*) :: Int -> Int -> Int #

negate :: Int -> Int #

abs :: Int -> Int #

signum :: Int -> Int #

fromInteger :: Integer -> Int #

Ord Int 
Instance details

Defined in GHC.Classes

Methods

compare :: Int -> Int -> Ordering #

(<) :: Int -> Int -> Bool #

(<=) :: Int -> Int -> Bool #

(>) :: Int -> Int -> Bool #

(>=) :: Int -> Int -> Bool #

max :: Int -> Int -> Int #

min :: Int -> Int -> Int #

Read Int

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Int #

readList :: ReadS [Int] #

readPrec :: ReadPrec Int #

readListPrec :: ReadPrec [Int] #

Real Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Int -> Rational #

Show Int

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Int -> ShowS #

show :: Int -> String #

showList :: [Int] -> ShowS #

Ix Int

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Int, Int) -> [Int] #

index :: (Int, Int) -> Int -> Int #

unsafeIndex :: (Int, Int) -> Int -> Int

inRange :: (Int, Int) -> Int -> Bool #

rangeSize :: (Int, Int) -> Int #

unsafeRangeSize :: (Int, Int) -> Int

Lift Int 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Int -> Q Exp #

IfB Int 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Int => bool -> Int -> Int -> Int #

EqB Int 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(/=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

OrdB Int 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(<=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

Default Int 
Instance details

Defined in Data.Default.Class

Methods

def :: Int #

BarsPlotValue Int 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Int #

barsAdd :: Int -> Int -> Int #

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] #

randomRIO :: (Int, Int) -> IO Int #

randomIO :: IO Int #

NFData Int 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Int -> () #

PrintfArg Int

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Int -> FieldFormatter #

parseFormat :: Int -> ModifierParser #

Storable Int

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Int -> Int #

alignment :: Int -> Int #

peekElemOff :: Ptr Int -> Int -> IO Int #

pokeElemOff :: Ptr Int -> Int -> Int -> IO () #

peekByteOff :: Ptr b -> Int -> IO Int #

pokeByteOff :: Ptr b -> Int -> Int -> IO () #

peek :: Ptr Int -> IO Int #

poke :: Ptr Int -> Int -> IO () #

PrimType Int 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Int :: Nat #

Methods

primSizeInBytes :: Proxy Int -> CountOf Word8 #

primShiftToBytes :: Proxy Int -> Int #

primBaUIndex :: ByteArray# -> Offset Int -> Int #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> prim Int #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> Int -> prim () #

primAddrIndex :: Addr# -> Offset Int -> Int #

primAddrRead :: PrimMonad prim => Addr# -> Offset Int -> prim Int #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Int -> Int -> prim () #

PrimMemoryComparable Int 
Instance details

Defined in Basement.PrimType

Subtractive Int 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Int :: * #

Methods

(-) :: Int -> Int -> Difference Int #

Binary Int 
Instance details

Defined in Data.Binary.Class

Methods

put :: Int -> Put #

get :: Get Int #

putList :: [Int] -> Put #

Prim Int 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Int -> Int# #

alignment# :: Int -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Int #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Int #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int#) #

writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s #

Hashable Int 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int -> Int

hash :: Int -> Int

Unbox Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Int 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Int

uniformR :: PrimMonad m => (Int, Int) -> Gen (PrimState m) -> m Int

IsName Int 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Int -> Name

Parseable Int 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser Int

ByteSource Int 
Instance details

Defined in Data.UUID.Types.Internal.Builder

Methods

(/-/) :: ByteSink Int g -> Int -> g

TraverseMin Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: (Indexable Int p, Applicative f) => p v (f v) -> IntMap v -> f (IntMap v) #

TraverseMax Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: (Indexable Int p, Applicative f) => p v (f v) -> IntMap v -> f (IntMap v) #

TraversableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> [a] -> f [b] #

TraversableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> ZipList a -> f (ZipList b) #

TraversableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> NonEmpty a -> f (NonEmpty b) #

TraversableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> IntMap a -> f (IntMap b) #

TraversableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> Seq a -> f (Seq b) #

TraversableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> Vector a -> f (Vector b) #

FunctorWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> [a] -> [b] #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> [a] -> f [b] #

FunctorWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> ZipList a -> ZipList b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> ZipList a -> f (ZipList b) #

FunctorWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> NonEmpty a -> f (NonEmpty b) #

FunctorWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> IntMap a -> IntMap b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> IntMap a -> f (IntMap b) #

FunctorWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Seq a -> Seq b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> Seq a -> f (Seq b) #

FunctorWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Vector a -> Vector b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> Vector a -> f (Vector b) #

FoldableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> [a] -> f [a] #

ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #

FoldableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> ZipList a -> f (ZipList a) #

ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

FoldableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> NonEmpty a -> f (NonEmpty a) #

ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

FoldableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> IntMap a -> f (IntMap a) #

ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

FoldableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> Seq a -> f (Seq a) #

ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #

FoldableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> Vector a -> f (Vector a) #

ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #

IArray UArray Int 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Int -> (i, i) #

numElements :: Ix i => UArray i Int -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Int)] -> UArray i Int

unsafeAt :: Ix i => UArray i Int -> Int -> Int

unsafeReplace :: Ix i => UArray i Int -> [(Int, Int)] -> UArray i Int

unsafeAccum :: Ix i => (Int -> e' -> Int) -> UArray i Int -> [(Int, e')] -> UArray i Int

unsafeAccumArray :: Ix i => (Int -> e' -> Int) -> Int -> (i, i) -> [(Int, e')] -> UArray i Int

MVector MVector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Int -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int

basicOverlaps :: MVector s Int -> MVector s Int -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int)

basicInitialize :: PrimMonad m => MVector (PrimState m) Int -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Int -> m (MVector (PrimState m) Int)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int -> Int -> m Int

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int -> Int -> Int -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Int -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Int -> Int -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int -> Int -> m (MVector (PrimState m) Int)

Vector Vector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int -> m (Vector Int)

basicUnsafeThaw :: PrimMonad m => Vector Int -> m (Mutable Vector (PrimState m) Int)

basicLength :: Vector Int -> Int

basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int

basicUnsafeIndexM :: Monad m => Vector Int -> Int -> m Int

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int -> Vector Int -> m ()

elemseq :: Vector Int -> Int -> b -> b

CDF StdUniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Int -> Int -> Double

CDF Uniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Int -> Int -> Double

Distribution StdUniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Int -> RVar Int

rvarT :: StdUniform Int -> RVarT n Int

Distribution Uniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Int -> RVar Int

rvarT :: Uniform Int -> RVarT n Int

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

MArray IOUArray Int IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int -> IO Int

newArray :: Ix i => (i, i) -> Int -> IO (IOUArray i Int) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int)

unsafeRead :: Ix i => IOUArray i Int -> Int -> IO Int

unsafeWrite :: Ix i => IOUArray i Int -> Int -> Int -> IO ()

Container Vector e => Konst e Int Vector 
Instance details

Defined in Internal.Numeric

Methods

konst :: e -> Int -> Vector e

Generic1 (URec Int :: k -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Int) :: k -> * #

Methods

from1 :: URec Int a -> Rep1 (URec Int) a #

to1 :: Rep1 (URec Int) a -> URec Int a #

TraversableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b) #

itraversed :: (Indexable Int p, Applicative f) => p a (f b) -> V n a -> f (V n b) #

FunctorWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

imap :: (Int -> a -> b) -> V n a -> V n b #

imapped :: (Indexable Int p, Settable f) => p a (f b) -> V n a -> f (V n b) #

FoldableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m #

ifolded :: (Indexable Int p, Contravariant f, Applicative f) => p a (f a) -> V n a -> f (V n a) #

ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b #

(Num e, Container Vector e) => Konst e (Int, Int) Matrix 
Instance details

Defined in Internal.Numeric

Methods

konst :: e -> (Int, Int) -> Matrix e

Container Vector e => Build Int (e -> e) Vector e 
Instance details

Defined in Internal.Container

Methods

build :: Int -> (e -> e) -> Vector e

TraversableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) #

itraversed :: (Indexable [Int] p, Applicative f) => p a (f b) -> Tree a -> f (Tree b) #

FunctorWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([Int] -> a -> b) -> Tree a -> Tree b #

imapped :: (Indexable [Int] p, Settable f) => p a (f b) -> Tree a -> f (Tree b) #

FoldableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m #

ifolded :: (Indexable [Int] p, Contravariant f, Applicative f) => p a (f a) -> Tree a -> f (Tree a) #

ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

(Real b, Distribution (Poisson b) Int) => CDF (Poisson b) Int 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Int -> Int -> Double

(Real b, Distribution (Binomial b) Int) => CDF (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Int -> Int -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Int) b, Distribution (Binomial b) Int) => Distribution (Poisson b) Int 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Int -> RVar Int

rvarT :: Poisson b Int -> RVarT n Int

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Int -> RVar Int

rvarT :: Binomial b Int -> RVarT n Int

(Real b, Distribution (Binomial b) Int) => PDF (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Int -> Int -> Double

logPdf :: Binomial b Int -> Int -> Double

Bizarre (Indexed Int) Mafic 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed Int a (f b) -> Mafic a b t -> f t

Indexable [e] Int e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: [e] -> Int -> e #

bounds :: [e] -> Interval Int #

deleteAt :: [e] -> Int -> [e] #

insertAt :: [e] -> (Int, e) -> [e] #

replaceAt :: [e] -> (Int, e) -> [e] #

deleteIndex :: [e] -> Int -> [e] #

insertIndex :: [e] -> Int -> e -> [e] #

replaceIndex :: [e] -> Int -> e -> [e] #

Reifies Z Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy Z -> Int

MArray (STUArray s) Int (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Int -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Int -> ST s Int

newArray :: Ix i => (i, i) -> Int -> ST s (STUArray s i Int) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Int)

unsafeRead :: Ix i => STUArray s i Int -> Int -> ST s Int

unsafeWrite :: Ix i => STUArray s i Int -> Int -> Int -> ST s ()

Reifies n Int => Reifies (D n :: *) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (D n) -> Int

Reifies n Int => Reifies (PD n :: *) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (PD n) -> Int

Reifies n Int => Reifies (SD n :: *) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (SD n) -> Int

Functor (URec Int :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Foldable (URec Int :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Int m -> m #

foldMap :: Monoid m => (a -> m) -> URec Int a -> m #

foldr :: (a -> b -> b) -> b -> URec Int a -> b #

foldr' :: (a -> b -> b) -> b -> URec Int a -> b #

foldl :: (b -> a -> b) -> b -> URec Int a -> b #

foldl' :: (b -> a -> b) -> b -> URec Int a -> b #

foldr1 :: (a -> a -> a) -> URec Int a -> a #

foldl1 :: (a -> a -> a) -> URec Int a -> a #

toList :: URec Int a -> [a] #

null :: URec Int a -> Bool #

length :: URec Int a -> Int #

elem :: Eq a => a -> URec Int a -> Bool #

maximum :: Ord a => URec Int a -> a #

minimum :: Ord a => URec Int a -> a #

sum :: Num a => URec Int a -> a #

product :: Num a => URec Int a -> a #

Traversable (URec Int :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

Container Matrix e => Build (Int, Int) (e -> e -> e) Matrix e 
Instance details

Defined in Internal.Container

Methods

build :: (Int, Int) -> (e -> e -> e) -> Matrix e

Eq (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Int p -> URec Int p -> Bool #

(/=) :: URec Int p -> URec Int p -> Bool #

Ord (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering #

(<) :: URec Int p -> URec Int p -> Bool #

(<=) :: URec Int p -> URec Int p -> Bool #

(>) :: URec Int p -> URec Int p -> Bool #

(>=) :: URec Int p -> URec Int p -> Bool #

max :: URec Int p -> URec Int p -> URec Int p #

min :: URec Int p -> URec Int p -> URec Int p #

Show (URec Int p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Int p -> ShowS #

show :: URec Int p -> String #

showList :: [URec Int p] -> ShowS #

Generic (URec Int p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Int p) :: * -> * #

Methods

from :: URec Int p -> Rep (URec Int p) x #

to :: Rep (URec Int p) x -> URec Int p #

type BooleanOf Int 
Instance details

Defined in Data.Boolean

type BooleanOf Int = Bool
type PrimSize Int 
Instance details

Defined in Basement.PrimType

type PrimSize Int = 8
type Difference Int 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Int = Int
type NatNumMaxBound Int 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Int = NatNumMaxBound Int64
data Vector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Int = V_Int (Vector Int)
type Unsigned Int 
Instance details

Defined in System.Random.MWC

type Unsigned Int = Word
type Signed Int 
Instance details

Defined in Data.Bytes.Signed

type Signed Int = Int
type Unsigned Int 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Int = Word
data URec Int (p :: k)

Used for marking occurrences of Int#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Int (p :: k) = UInt {}
data MVector s Int 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Int = MV_Int (MVector s Int)
type ByteSink Int g 
Instance details

Defined in Data.UUID.Types.Internal.Builder

type ByteSink Int g = Takes4Bytes g
type Rep1 (URec Int :: k -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (URec Int :: k -> *) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UInt" PrefixI True) (S1 (MetaSel (Just "uInt#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UInt :: k -> *)))
type Rep (URec Int p) 
Instance details

Defined in GHC.Generics

type Rep (URec Int p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UInt" PrefixI True) (S1 (MetaSel (Just "uInt#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UInt :: * -> *)))

data Integer #

Invariant: Jn# and Jp# are used iff value doesn't fit in S#

Useful properties resulting from the invariants:

Instances
IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: * #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

Enum Integer

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Integer -> Integer #

pred :: Integer -> Integer #

toEnum :: Int -> Integer #

fromEnum :: Integer -> Int #

enumFrom :: Integer -> [Integer] #

enumFromThen :: Integer -> Integer -> [Integer] #

enumFromTo :: Integer -> Integer -> [Integer] #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #

Eq Integer 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: Integer -> Integer -> Bool #

(/=) :: Integer -> Integer -> Bool #

Integral Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Integer -> Integer -> Integer #

rem :: Integer -> Integer -> Integer #

div :: Integer -> Integer -> Integer #

mod :: Integer -> Integer -> Integer #

quotRem :: Integer -> Integer -> (Integer, Integer) #

divMod :: Integer -> Integer -> (Integer, Integer) #

toInteger :: Integer -> Integer #

Num Integer

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Integer -> Integer -> Integer #

(-) :: Integer -> Integer -> Integer #

(*) :: Integer -> Integer -> Integer #

negate :: Integer -> Integer #

abs :: Integer -> Integer #

signum :: Integer -> Integer #

fromInteger :: Integer -> Integer #

Ord Integer 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: Integer -> Integer -> Ordering #

(<) :: Integer -> Integer -> Bool #

(<=) :: Integer -> Integer -> Bool #

(>) :: Integer -> Integer -> Bool #

(>=) :: Integer -> Integer -> Bool #

max :: Integer -> Integer -> Integer #

min :: Integer -> Integer -> Integer #

Read Integer

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Integer #

readList :: ReadS [Integer] #

readPrec :: ReadPrec Integer #

readListPrec :: ReadPrec [Integer] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Real Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Integer -> Rational #

Show Integer

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Integer -> ShowS #

show :: Integer -> String #

showList :: [Integer] -> ShowS #

Ix Integer

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Integer, Integer) -> [Integer] #

index :: (Integer, Integer) -> Integer -> Int #

unsafeIndex :: (Integer, Integer) -> Integer -> Int

inRange :: (Integer, Integer) -> Integer -> Bool #

rangeSize :: (Integer, Integer) -> Int #

unsafeRangeSize :: (Integer, Integer) -> Int

Lift Integer 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Integer -> Q Exp #

IfB Integer 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Integer => bool -> Integer -> Integer -> Integer #

EqB Integer 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(/=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

OrdB Integer 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(<=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

Default Integer 
Instance details

Defined in Data.Default.Class

Methods

def :: Integer #

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] #

randomRIO :: (Integer, Integer) -> IO Integer #

randomIO :: IO Integer #

NFData Integer 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Integer -> () #

PrintfArg Integer

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Integer -> FieldFormatter #

parseFormat :: Integer -> ModifierParser #

Subtractive Integer 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Integer :: * #

Methods

(-) :: Integer -> Integer -> Difference Integer #

Binary Integer 
Instance details

Defined in Data.Binary.Class

Methods

put :: Integer -> Put #

get :: Get Integer #

putList :: [Integer] -> Put #

Hashable Integer 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Integer -> Int

hash :: Integer -> Int

IsName Integer 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Integer -> Name

ExprType Integer # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Integer #

toConcrete :: ConstVal -> Integer #

fromConcrete :: Integer -> Expression Integer #

constVal :: Integer -> ConstVal #

constExpr :: ConstVal -> Expression Integer #

CDF Uniform Integer 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Integer -> Integer -> Double

Distribution Uniform Integer 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Integer -> RVar Integer

rvarT :: Uniform Integer -> RVarT n Integer

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

KnownNat n => Reifies (n :: Nat) Integer 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy n -> Integer

Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

ExprType r => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

(Real b, Distribution (Poisson b) Integer) => CDF (Poisson b) Integer 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Integer -> Integer -> Double

(Real b, Distribution (Binomial b) Integer) => CDF (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Integer -> Integer -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Integer) b, Distribution (Binomial b) Integer) => Distribution (Poisson b) Integer 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Integer -> RVar Integer

rvarT :: Poisson b Integer -> RVarT n Integer

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Integer -> RVar Integer

rvarT :: Binomial b Integer -> RVarT n Integer

(Real b, Distribution (Binomial b) Integer) => PDF (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Integer -> Integer -> Double

logPdf :: Binomial b Integer -> Integer -> Double

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

type BooleanOf Integer 
Instance details

Defined in Data.Boolean

type BooleanOf Integer = Bool
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Difference Integer 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Integer = Integer
type Signed Integer 
Instance details

Defined in Data.Bytes.Signed

type Signed Integer = Integer
type Unsigned Integer 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Integer = Integer

data Maybe a #

The Maybe type encapsulates an optional value. A value of type + minBound and maxBound from the Bounded class.

Instances
Bounded Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Int #

maxBound :: Int #

Enum Int

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Int -> Int #

pred :: Int -> Int #

toEnum :: Int -> Int #

fromEnum :: Int -> Int #

enumFrom :: Int -> [Int] #

enumFromThen :: Int -> Int -> [Int] #

enumFromTo :: Int -> Int -> [Int] #

enumFromThenTo :: Int -> Int -> Int -> [Int] #

Eq Int 
Instance details

Defined in GHC.Classes

Methods

(==) :: Int -> Int -> Bool #

(/=) :: Int -> Int -> Bool #

Integral Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Int -> Int -> Int #

rem :: Int -> Int -> Int #

div :: Int -> Int -> Int #

mod :: Int -> Int -> Int #

quotRem :: Int -> Int -> (Int, Int) #

divMod :: Int -> Int -> (Int, Int) #

toInteger :: Int -> Integer #

Num Int

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Int -> Int -> Int #

(-) :: Int -> Int -> Int #

(*) :: Int -> Int -> Int #

negate :: Int -> Int #

abs :: Int -> Int #

signum :: Int -> Int #

fromInteger :: Integer -> Int #

Ord Int 
Instance details

Defined in GHC.Classes

Methods

compare :: Int -> Int -> Ordering #

(<) :: Int -> Int -> Bool #

(<=) :: Int -> Int -> Bool #

(>) :: Int -> Int -> Bool #

(>=) :: Int -> Int -> Bool #

max :: Int -> Int -> Int #

min :: Int -> Int -> Int #

Read Int

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Int #

readList :: ReadS [Int] #

readPrec :: ReadPrec Int #

readListPrec :: ReadPrec [Int] #

Real Int

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Int -> Rational #

Show Int

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Int -> ShowS #

show :: Int -> String #

showList :: [Int] -> ShowS #

Ix Int

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Int, Int) -> [Int] #

index :: (Int, Int) -> Int -> Int #

unsafeIndex :: (Int, Int) -> Int -> Int

inRange :: (Int, Int) -> Int -> Bool #

rangeSize :: (Int, Int) -> Int #

unsafeRangeSize :: (Int, Int) -> Int

Lift Int 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Int -> Q Exp #

IfB Int 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Int => bool -> Int -> Int -> Int #

EqB Int 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(/=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

OrdB Int 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(<=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

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] #

randomRIO :: (Int, Int) -> IO Int #

randomIO :: IO Int #

NFData Int 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Int -> () #

Hashable Int 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Int -> Int #

hash :: Int -> Int #

PrintfArg Int

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Int -> FieldFormatter #

parseFormat :: Int -> ModifierParser #

Storable Int

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Int -> Int #

alignment :: Int -> Int #

peekElemOff :: Ptr Int -> Int -> IO Int #

pokeElemOff :: Ptr Int -> Int -> Int -> IO () #

peekByteOff :: Ptr b -> Int -> IO Int #

pokeByteOff :: Ptr b -> Int -> Int -> IO () #

peek :: Ptr Int -> IO Int #

poke :: Ptr Int -> Int -> IO () #

PrimType Int 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Int :: Nat #

Methods

primSizeInBytes :: Proxy Int -> CountOf Word8 #

primShiftToBytes :: Proxy Int -> Int #

primBaUIndex :: ByteArray# -> Offset Int -> Int #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> prim Int #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Int -> Int -> prim () #

primAddrIndex :: Addr# -> Offset Int -> Int #

primAddrRead :: PrimMonad prim => Addr# -> Offset Int -> prim Int #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Int -> Int -> prim () #

PrimMemoryComparable Int 
Instance details

Defined in Basement.PrimType

Subtractive Int 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Int :: Type #

Methods

(-) :: Int -> Int -> Difference Int #

Binary Int 
Instance details

Defined in Data.Binary.Class

Methods

put :: Int -> Put #

get :: Get Int #

putList :: [Int] -> Put #

FromField Int

Accepts a signed decimal number. Ignores whitespace.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Int #

ToField Int

Uses decimal encoding with optional sign.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Int -> Field #

Default Int 
Instance details

Defined in Data.Default.Class

Methods

def :: Int #

Prim Int 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Int -> Int# #

alignment# :: Int -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Int #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Int#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Int -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Int -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Int #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Int#) #

writeOffAddr# :: Addr# -> Int# -> Int -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Int -> State# s -> State# s #

ByteSource Int 
Instance details

Defined in Data.UUID.Types.Internal.Builder

Methods

(/-/) :: ByteSink Int g -> Int -> g

Unbox Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Int 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Int

uniformR :: PrimMonad m => (Int, Int) -> Gen (PrimState m) -> m Int

IsName Int 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Int -> Name

BarsPlotValue Int 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Bars

Methods

barsReference :: Int #

barsAdd :: Int -> Int -> Int #

Parseable Int 
Instance details

Defined in Diagrams.Backend.CmdLine

Methods

parser :: Parser Int

IArray UArray Int 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Int -> (i, i) #

numElements :: Ix i => UArray i Int -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Int)] -> UArray i Int

unsafeAt :: Ix i => UArray i Int -> Int -> Int

unsafeReplace :: Ix i => UArray i Int -> [(Int, Int)] -> UArray i Int

unsafeAccum :: Ix i => (Int -> e' -> Int) -> UArray i Int -> [(Int, e')] -> UArray i Int

unsafeAccumArray :: Ix i => (Int -> e' -> Int) -> Int -> (i, i) -> [(Int, e')] -> UArray i Int

Vector Vector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Int -> m (Vector Int) #

basicUnsafeThaw :: PrimMonad m => Vector Int -> m (Mutable Vector (PrimState m) Int) #

basicLength :: Vector Int -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int #

basicUnsafeIndexM :: Monad m => Vector Int -> Int -> m Int #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Int -> Vector Int -> m () #

elemseq :: Vector Int -> Int -> b -> b #

MVector MVector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Int -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Int -> MVector s Int #

basicOverlaps :: MVector s Int -> MVector s Int -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Int) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Int -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Int -> m (MVector (PrimState m) Int) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Int -> Int -> m Int #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Int -> Int -> Int -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Int -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Int -> Int -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Int -> MVector (PrimState m) Int -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Int -> Int -> m (MVector (PrimState m) Int) #

CDF StdUniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Int -> Int -> Double

CDF Uniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Int -> Int -> Double

Distribution StdUniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Int -> RVar Int

rvarT :: StdUniform Int -> RVarT n Int

Distribution Uniform Int 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Int -> RVar Int

rvarT :: Uniform Int -> RVarT n Int

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

FoldableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> [a] -> m #

ifolded :: IndexedFold Int [a] a #

ifoldr :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> [a] -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> [a] -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> [a] -> b #

FoldableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> ZipList a -> m #

ifolded :: IndexedFold Int (ZipList a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> ZipList a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> ZipList a -> b #

FoldableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> NonEmpty a -> m #

ifolded :: IndexedFold Int (NonEmpty a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> NonEmpty a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> NonEmpty a -> b #

FoldableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> IntMap a -> m #

ifolded :: IndexedFold Int (IntMap a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> IntMap a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> IntMap a -> b #

FoldableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Seq a -> m #

ifolded :: IndexedFold Int (Seq a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Seq a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Seq a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Seq a -> b #

FoldableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> Vector a -> m #

ifolded :: IndexedFold Int (Vector a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> Vector a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> Vector a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> Vector a -> b #

FunctorWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> [a] -> [b] #

imapped :: IndexedSetter Int [a] [b] a b #

FunctorWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> ZipList a -> ZipList b #

imapped :: IndexedSetter Int (ZipList a) (ZipList b) a b #

FunctorWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> NonEmpty a -> NonEmpty b #

imapped :: IndexedSetter Int (NonEmpty a) (NonEmpty b) a b #

FunctorWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> IntMap a -> IntMap b #

imapped :: IndexedSetter Int (IntMap a) (IntMap b) a b #

FunctorWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Seq a -> Seq b #

imapped :: IndexedSetter Int (Seq a) (Seq b) a b #

FunctorWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Int -> a -> b) -> Vector a -> Vector b #

imapped :: IndexedSetter Int (Vector a) (Vector b) a b #

TraversableWithIndex Int [] 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> [a] -> f [b] #

itraversed :: IndexedTraversal Int [a] [b] a b #

TraversableWithIndex Int ZipList 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> ZipList a -> f (ZipList b) #

itraversed :: IndexedTraversal Int (ZipList a) (ZipList b) a b #

TraversableWithIndex Int NonEmpty 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> NonEmpty a -> f (NonEmpty b) #

itraversed :: IndexedTraversal Int (NonEmpty a) (NonEmpty b) a b #

TraversableWithIndex Int IntMap 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> IntMap a -> f (IntMap b) #

itraversed :: IndexedTraversal Int (IntMap a) (IntMap b) a b #

TraversableWithIndex Int Seq 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Seq a -> f (Seq b) #

itraversed :: IndexedTraversal Int (Seq a) (Seq b) a b #

TraversableWithIndex Int Vector 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> Vector a -> f (Vector b) #

itraversed :: IndexedTraversal Int (Vector a) (Vector b) a b #

TraverseMax Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMax :: IndexedTraversal' Int (IntMap v) v #

TraverseMin Int IntMap 
Instance details

Defined in Control.Lens.Traversal

Methods

traverseMin :: IndexedTraversal' Int (IntMap v) v #

MArray IOUArray Int IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int -> IO Int

newArray :: Ix i => (i, i) -> Int -> IO (IOUArray i Int) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int)

unsafeRead :: Ix i => IOUArray i Int -> Int -> IO Int

unsafeWrite :: Ix i => IOUArray i Int -> Int -> Int -> IO ()

Container Vector e => Konst e Int Vector 
Instance details

Defined in Internal.Numeric

Methods

konst :: e -> Int -> Vector e #

Generic1 (URec Int :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Int) :: k -> Type #

Methods

from1 :: URec Int a -> Rep1 (URec Int) a #

to1 :: Rep1 (URec Int) a -> URec Int a #

FoldableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

ifoldMap :: Monoid m => (Int -> a -> m) -> V n a -> m #

ifolded :: IndexedFold Int (V n a) a #

ifoldr :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl :: (Int -> b -> a -> b) -> b -> V n a -> b #

ifoldr' :: (Int -> a -> b -> b) -> b -> V n a -> b #

ifoldl' :: (Int -> b -> a -> b) -> b -> V n a -> b #

FunctorWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

imap :: (Int -> a -> b) -> V n a -> V n b #

imapped :: IndexedSetter Int (V n a) (V n b) a b #

TraversableWithIndex Int (V n) 
Instance details

Defined in Linear.V

Methods

itraverse :: Applicative f => (Int -> a -> f b) -> V n a -> f (V n b) #

itraversed :: IndexedTraversal Int (V n a) (V n b) a b #

(Num e, Container Vector e) => Konst e (Int, Int) Matrix 
Instance details

Defined in Internal.Numeric

Methods

konst :: e -> (Int, Int) -> Matrix e #

Container Vector e => Build Int (e -> e) Vector e 
Instance details

Defined in Internal.Container

Methods

build :: Int -> (e -> e) -> Vector e #

(Real b, Distribution (Poisson b) Int) => CDF (Poisson b) Int 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Int -> Int -> Double

(Real b, Distribution (Binomial b) Int) => CDF (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Int -> Int -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Int) b, Distribution (Binomial b) Int) => Distribution (Poisson b) Int 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Int -> RVar Int

rvarT :: Poisson b Int -> RVarT n Int

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Int -> RVar Int

rvarT :: Binomial b Int -> RVarT n Int

(Real b, Distribution (Binomial b) Int) => PDF (Binomial b) Int 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Int -> Int -> Double

logPdf :: Binomial b Int -> Int -> Double

FoldableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => ([Int] -> a -> m) -> Tree a -> m #

ifolded :: IndexedFold [Int] (Tree a) a #

ifoldr :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

ifoldr' :: ([Int] -> a -> b -> b) -> b -> Tree a -> b #

ifoldl' :: ([Int] -> b -> a -> b) -> b -> Tree a -> b #

FunctorWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: ([Int] -> a -> b) -> Tree a -> Tree b #

imapped :: IndexedSetter [Int] (Tree a) (Tree b) a b #

TraversableWithIndex [Int] Tree 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => ([Int] -> a -> f b) -> Tree a -> f (Tree b) #

itraversed :: IndexedTraversal [Int] (Tree a) (Tree b) a b #

Bizarre (Indexed Int) Mafic 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

bazaar :: Applicative f => Indexed Int a (f b) -> Mafic a b t -> f t

Reifies Z Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy Z -> Int #

Indexable [e] Int e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: [e] -> Int -> e #

bounds :: [e] -> Interval Int #

deleteAt :: [e] -> Int -> [e] #

insertAt :: [e] -> (Int, e) -> [e] #

replaceAt :: [e] -> (Int, e) -> [e] #

deleteIndex :: [e] -> Int -> [e] #

insertIndex :: [e] -> Int -> e -> [e] #

replaceIndex :: [e] -> Int -> e -> [e] #

MArray (STUArray s) Int (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Int -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Int -> ST s Int

newArray :: Ix i => (i, i) -> Int -> ST s (STUArray s i Int) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Int)

unsafeRead :: Ix i => STUArray s i Int -> Int -> ST s Int

unsafeWrite :: Ix i => STUArray s i Int -> Int -> Int -> ST s ()

Reifies n Int => Reifies (D n :: Type) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (D n) -> Int #

Reifies n Int => Reifies (SD n :: Type) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (SD n) -> Int #

Reifies n Int => Reifies (PD n :: Type) Int 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy (PD n) -> Int #

Functor (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Foldable (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Int m -> m #

foldMap :: Monoid m => (a -> m) -> URec Int a -> m #

foldr :: (a -> b -> b) -> b -> URec Int a -> b #

foldr' :: (a -> b -> b) -> b -> URec Int a -> b #

foldl :: (b -> a -> b) -> b -> URec Int a -> b #

foldl' :: (b -> a -> b) -> b -> URec Int a -> b #

foldr1 :: (a -> a -> a) -> URec Int a -> a #

foldl1 :: (a -> a -> a) -> URec Int a -> a #

toList :: URec Int a -> [a] #

null :: URec Int a -> Bool #

length :: URec Int a -> Int #

elem :: Eq a => a -> URec Int a -> Bool #

maximum :: Ord a => URec Int a -> a #

minimum :: Ord a => URec Int a -> a #

sum :: Num a => URec Int a -> a #

product :: Num a => URec Int a -> a #

Traversable (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Int a -> f (URec Int b) #

sequenceA :: Applicative f => URec Int (f a) -> f (URec Int a) #

mapM :: Monad m => (a -> m b) -> URec Int a -> m (URec Int b) #

sequence :: Monad m => URec Int (m a) -> m (URec Int a) #

Default (PlotHist x Int) 
Instance details

Defined in Graphics.Rendering.Chart.Plot.Histogram

Methods

def :: PlotHist x Int #

Container Matrix e => Build (Int, Int) (e -> e -> e) Matrix e 
Instance details

Defined in Internal.Container

Methods

build :: (Int, Int) -> (e -> e -> e) -> Matrix e #

Eq (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Int p -> URec Int p -> Bool #

(/=) :: URec Int p -> URec Int p -> Bool #

Ord (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Int p -> URec Int p -> Ordering #

(<) :: URec Int p -> URec Int p -> Bool #

(<=) :: URec Int p -> URec Int p -> Bool #

(>) :: URec Int p -> URec Int p -> Bool #

(>=) :: URec Int p -> URec Int p -> Bool #

max :: URec Int p -> URec Int p -> URec Int p #

min :: URec Int p -> URec Int p -> URec Int p #

Show (URec Int p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Int p -> ShowS #

show :: URec Int p -> String #

showList :: [URec Int p] -> ShowS #

Generic (URec Int p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Int p) :: Type -> Type #

Methods

from :: URec Int p -> Rep (URec Int p) x #

to :: Rep (URec Int p) x -> URec Int p #

type BooleanOf Int 
Instance details

Defined in Data.Boolean

type BooleanOf Int = Bool
type PrimSize Int 
Instance details

Defined in Basement.PrimType

type PrimSize Int = 8
type Difference Int 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Int = Int
type NatNumMaxBound Int 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Int = NatNumMaxBound Int64
type Unsigned Int 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Int = Word
type Signed Int 
Instance details

Defined in Data.Bytes.Signed

type Signed Int = Int
newtype Vector Int 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Int = V_Int (Vector Int)
type Unsigned Int 
Instance details

Defined in System.Random.MWC

type Unsigned Int = Word
data URec Int (p :: k)

Used for marking occurrences of Int#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Int (p :: k) = UInt {}
type ByteSink Int g 
Instance details

Defined in Data.UUID.Types.Internal.Builder

type ByteSink Int g = Takes4Bytes g
newtype MVector s Int 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Int = MV_Int (MVector s Int)
type Rep1 (URec Int :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Int :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" 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.Generics

type Rep (URec Int p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UInt" PrefixI True) (S1 (MetaSel (Just "uInt#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UInt :: Type -> Type)))

data Integer #

Invariant: Jn# and Jp# are used iff value doesn't fit in S#

Useful properties resulting from the invariants:

Instances
IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: Type #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

Enum Integer

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Integer -> Integer #

pred :: Integer -> Integer #

toEnum :: Int -> Integer #

fromEnum :: Integer -> Int #

enumFrom :: Integer -> [Integer] #

enumFromThen :: Integer -> Integer -> [Integer] #

enumFromTo :: Integer -> Integer -> [Integer] #

enumFromThenTo :: Integer -> Integer -> Integer -> [Integer] #

Eq Integer 
Instance details

Defined in GHC.Integer.Type

Methods

(==) :: Integer -> Integer -> Bool #

(/=) :: Integer -> Integer -> Bool #

Integral Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

quot :: Integer -> Integer -> Integer #

rem :: Integer -> Integer -> Integer #

div :: Integer -> Integer -> Integer #

mod :: Integer -> Integer -> Integer #

quotRem :: Integer -> Integer -> (Integer, Integer) #

divMod :: Integer -> Integer -> (Integer, Integer) #

toInteger :: Integer -> Integer #

Num Integer

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Integer -> Integer -> Integer #

(-) :: Integer -> Integer -> Integer #

(*) :: Integer -> Integer -> Integer #

negate :: Integer -> Integer #

abs :: Integer -> Integer #

signum :: Integer -> Integer #

fromInteger :: Integer -> Integer #

Ord Integer 
Instance details

Defined in GHC.Integer.Type

Methods

compare :: Integer -> Integer -> Ordering #

(<) :: Integer -> Integer -> Bool #

(<=) :: Integer -> Integer -> Bool #

(>) :: Integer -> Integer -> Bool #

(>=) :: Integer -> Integer -> Bool #

max :: Integer -> Integer -> Integer #

min :: Integer -> Integer -> Integer #

Read Integer

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Integer #

readList :: ReadS [Integer] #

readPrec :: ReadPrec Integer #

readListPrec :: ReadPrec [Integer] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Real Integer

Since: base-2.0.1

Instance details

Defined in GHC.Real

Methods

toRational :: Integer -> Rational #

Show Integer

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Integer -> ShowS #

show :: Integer -> String #

showList :: [Integer] -> ShowS #

Ix Integer

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Integer, Integer) -> [Integer] #

index :: (Integer, Integer) -> Integer -> Int #

unsafeIndex :: (Integer, Integer) -> Integer -> Int

inRange :: (Integer, Integer) -> Integer -> Bool #

rangeSize :: (Integer, Integer) -> Int #

unsafeRangeSize :: (Integer, Integer) -> Int

Lift Integer 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Integer -> Q Exp #

IfB Integer 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Integer => bool -> Integer -> Integer -> Integer #

EqB Integer 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(/=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

OrdB Integer 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(<=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

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] #

randomRIO :: (Integer, Integer) -> IO Integer #

randomIO :: IO Integer #

NFData Integer 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Integer -> () #

Hashable Integer 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Integer -> Int #

hash :: Integer -> Int #

PrintfArg Integer

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Integer -> FieldFormatter #

parseFormat :: Integer -> ModifierParser #

Subtractive Integer 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Integer :: Type #

Methods

(-) :: Integer -> Integer -> Difference Integer #

Binary Integer 
Instance details

Defined in Data.Binary.Class

Methods

put :: Integer -> Put #

get :: Get Integer #

putList :: [Integer] -> Put #

FromField Integer

Accepts a signed decimal number. Ignores whitespace.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Integer #

ToField Integer

Uses decimal encoding with optional sign.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Integer -> Field #

Default Integer 
Instance details

Defined in Data.Default.Class

Methods

def :: Integer #

ExprType Integer # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf Integer #

toConcrete :: ConstVal -> Integer #

fromConcrete :: Integer -> Expression Integer #

constVal :: Integer -> ConstVal #

constExpr :: ConstVal -> Expression Integer #

IsName Integer 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Integer -> Name

PlotP Integer # 
Instance details

Defined in Language.Stochaskell.Plot

Methods

plotP :: P (Expression Integer) -> Int -> String -> IO ChartPlot #

plotP' :: P (Expression Integer) -> Int -> String -> IO ChartPlot #

CDF Uniform Integer 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Integer -> Integer -> Double

Distribution Uniform Integer 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Integer -> RVar Integer

rvarT :: Uniform Integer -> RVarT n Integer

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

KnownNat n => Reifies (n :: Nat) Integer 
Instance details

Defined in Data.Reflection

Methods

reflect :: proxy n -> Integer #

Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

(ExprType r, ExprType f, Show f) => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

(Real b, Distribution (Poisson b) Integer) => CDF (Poisson b) Integer 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Integer -> Integer -> Double

(Real b, Distribution (Binomial b) Integer) => CDF (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Integer -> Integer -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Integer) b, Distribution (Binomial b) Integer) => Distribution (Poisson b) Integer 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Integer -> RVar Integer

rvarT :: Poisson b Integer -> RVarT n Integer

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Integer -> RVar Integer

rvarT :: Binomial b Integer -> RVarT n Integer

(Real b, Distribution (Binomial b) Integer) => PDF (Binomial b) Integer 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Integer -> Integer -> Double

logPdf :: Binomial b Integer -> Integer -> Double

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

type BooleanOf Integer 
Instance details

Defined in Data.Boolean

type BooleanOf Integer = Bool
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Difference Integer 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Integer = Integer
type Unsigned Integer 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Integer = Integer
type Signed Integer 
Instance details

Defined in Data.Bytes.Signed

type Signed Integer = Integer

data Maybe a #

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 + 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 Either type.

Constructors

Nothing 
Just a 
Instances
Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

MonadFix Maybe

Since: base-2.1

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Maybe a) -> Maybe a #

Applicative Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> Maybe a #

(<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b #

liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #

(*>) :: Maybe a -> Maybe b -> Maybe b #

(<*) :: Maybe a -> Maybe b -> Maybe a #

Foldable Maybe

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m #

foldr :: (a -> b -> b) -> b -> Maybe a -> b #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b #

foldl :: (b -> a -> b) -> b -> Maybe a -> b #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b #

foldr1 :: (a -> a -> a) -> Maybe a -> a #

foldl1 :: (a -> a -> a) -> Maybe a -> a #

toList :: Maybe a -> [a] #

null :: Maybe a -> Bool #

length :: Maybe a -> Int #

elem :: Eq a => a -> Maybe a -> Bool #

maximum :: Ord a => Maybe a -> a #

minimum :: Ord a => Maybe a -> a #

sum :: Num a => Maybe a -> a #

product :: Num a => Maybe a -> a #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) #

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) #

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

MonadPlus Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: Maybe a #

mplus :: Maybe a -> Maybe a -> Maybe a #

Alternative Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

empty :: Maybe a #

(<|>) :: Maybe a -> Maybe a -> Maybe a #

some :: Maybe a -> Maybe [a] #

many :: Maybe a -> Maybe [a] #

Eq1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #

Ord1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #

Read1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #

Show1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #

MonadFailure Maybe 
Instance details

Defined in Basement.Monad

Associated Types

type Failure Maybe :: * #

Methods

mFail :: Failure Maybe -> Maybe () #

NFData1 Maybe

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a -> ()) -> Maybe a -> () #

Hashable1 Maybe 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int

Apply Maybe 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Maybe (a -> b) -> Maybe a -> Maybe b

(.>) :: Maybe a -> Maybe b -> Maybe b

(<.) :: Maybe a -> Maybe b -> Maybe a

liftF2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c

Bind Maybe 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Maybe a -> (a -> Maybe b) -> Maybe b

join :: Maybe (Maybe a) -> Maybe a

Additive Maybe 
Instance details

Defined in Linear.Vector

Methods

zero :: Num a => Maybe a

(^+^) :: Num a => Maybe a -> Maybe a -> Maybe a

(^-^) :: Num a => Maybe a -> Maybe a -> Maybe a

lerp :: Num a => a -> Maybe a -> Maybe a -> Maybe a

liftU2 :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a

liftI2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c

Metric Maybe 
Instance details

Defined in Linear.Metric

Methods

dot :: Num a => Maybe a -> Maybe a -> a

quadrance :: Num a => Maybe a -> a

qd :: Num a => Maybe a -> Maybe a -> a

distance :: Floating a => Maybe a -> Maybe a -> a

norm :: Floating a => Maybe a -> a

signorm :: Floating a => Maybe a -> Maybe a

Affine Maybe 
Instance details

Defined in Linear.Affine

Associated Types

type Diff Maybe :: * -> *

Methods

(.-.) :: Num a => Maybe a -> Maybe a -> Diff Maybe a

(.+^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

(.-^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

MonadThrow Maybe 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> Maybe a

TraversableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) #

itraversed :: (Indexable () p, Applicative f) => p a (f b) -> Maybe a -> f (Maybe b) #

FunctorWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Maybe a -> Maybe b #

imapped :: (Indexable () p, Settable f) => p a (f b) -> Maybe a -> f (Maybe b) #

FoldableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m #

ifolded :: (Indexable () p, Contravariant f, Applicative f) => p a (f a) -> Maybe a -> f (Maybe a) #

ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #

MonadBaseControl Maybe Maybe 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM Maybe a :: *

Methods

liftBaseWith :: (RunInBase Maybe Maybe -> Maybe a) -> Maybe a

restoreM :: StM Maybe a -> Maybe a

Eq a => Eq (Maybe a) 
Instance details

Defined in GHC.Base

Methods

(==) :: Maybe a -> Maybe a -> Bool #

(/=) :: Maybe a -> Maybe a -> Bool #

Ord a => Ord (Maybe a) 
Instance details

Defined in GHC.Base

Methods

compare :: Maybe a -> Maybe a -> Ordering #

(<) :: Maybe a -> Maybe a -> Bool #

(<=) :: Maybe a -> Maybe a -> Bool #

(>) :: Maybe a -> Maybe a -> Bool #

(>=) :: Maybe a -> Maybe a -> Bool #

max :: Maybe a -> Maybe a -> Maybe a #

min :: Maybe a -> Maybe a -> Maybe a #

Read a => Read (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Maybe a) #

readList :: ReadS [Maybe a] #

readPrec :: ReadPrec (Maybe a) #

readListPrec :: ReadPrec [Maybe a] #

Show a => Show (Maybe a) 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Maybe a -> ShowS #

show :: Maybe a -> String #

showList :: [Maybe a] -> ShowS #

Generic (Maybe a) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Maybe a) :: * -> * #

Methods

from :: Maybe a -> Rep (Maybe a) x #

to :: Rep (Maybe a) x -> Maybe a #

Semigroup a => Semigroup (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Maybe a -> Maybe a -> Maybe a #

sconcat :: NonEmpty (Maybe a) -> Maybe a #

stimes :: Integral b => b -> Maybe a -> Maybe a #

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to + error monad can be built using the Either type.

Constructors

Nothing 
Just a 
Instances
Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

MonadFix Maybe

Since: base-2.1

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Maybe a) -> Maybe a #

MonadFail Maybe

Since: base-4.9.0.0

Instance details

Defined in Control.Monad.Fail

Methods

fail :: String -> Maybe a #

Applicative Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> Maybe a #

(<*>) :: Maybe (a -> b) -> Maybe a -> Maybe b #

liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #

(*>) :: Maybe a -> Maybe b -> Maybe b #

(<*) :: Maybe a -> Maybe b -> Maybe a #

Foldable Maybe

Since: base-2.1

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Maybe m -> m #

foldMap :: Monoid m => (a -> m) -> Maybe a -> m #

foldr :: (a -> b -> b) -> b -> Maybe a -> b #

foldr' :: (a -> b -> b) -> b -> Maybe a -> b #

foldl :: (b -> a -> b) -> b -> Maybe a -> b #

foldl' :: (b -> a -> b) -> b -> Maybe a -> b #

foldr1 :: (a -> a -> a) -> Maybe a -> a #

foldl1 :: (a -> a -> a) -> Maybe a -> a #

toList :: Maybe a -> [a] #

null :: Maybe a -> Bool #

length :: Maybe a -> Int #

elem :: Eq a => a -> Maybe a -> Bool #

maximum :: Ord a => Maybe a -> a #

minimum :: Ord a => Maybe a -> a #

sum :: Num a => Maybe a -> a #

product :: Num a => Maybe a -> a #

Traversable Maybe

Since: base-2.1

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> Maybe a -> f (Maybe b) #

sequenceA :: Applicative f => Maybe (f a) -> f (Maybe a) #

mapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b) #

sequence :: Monad m => Maybe (m a) -> m (Maybe a) #

MonadPlus Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: Maybe a #

mplus :: Maybe a -> Maybe a -> Maybe a #

Alternative Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

empty :: Maybe a #

(<|>) :: Maybe a -> Maybe a -> Maybe a #

some :: Maybe a -> Maybe [a] #

many :: Maybe a -> Maybe [a] #

Eq1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a -> b -> Bool) -> Maybe a -> Maybe b -> Bool #

Ord1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering #

Read1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] #

Show1 Maybe

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Maybe a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Maybe a] -> ShowS #

MonadFailure Maybe 
Instance details

Defined in Basement.Monad

Associated Types

type Failure Maybe :: Type #

Methods

mFail :: Failure Maybe -> Maybe () #

NFData1 Maybe

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a -> ()) -> Maybe a -> () #

MonadThrow Maybe 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> Maybe a #

Hashable1 Maybe 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a -> Int) -> Int -> Maybe a -> Int #

Apply Maybe 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Maybe (a -> b) -> Maybe a -> Maybe b #

(.>) :: Maybe a -> Maybe b -> Maybe b #

(<.) :: Maybe a -> Maybe b -> Maybe a #

liftF2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c #

Bind Maybe 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Maybe a -> (a -> Maybe b) -> Maybe b #

join :: Maybe (Maybe a) -> Maybe a #

Metric Maybe 
Instance details

Defined in Linear.Metric

Methods

dot :: Num a => Maybe a -> Maybe a -> a

quadrance :: Num a => Maybe a -> a

qd :: Num a => Maybe a -> Maybe a -> a

distance :: Floating a => Maybe a -> Maybe a -> a

norm :: Floating a => Maybe a -> a

signorm :: Floating a => Maybe a -> Maybe a

Additive Maybe 
Instance details

Defined in Linear.Vector

Methods

zero :: Num a => Maybe a

(^+^) :: Num a => Maybe a -> Maybe a -> Maybe a

(^-^) :: Num a => Maybe a -> Maybe a -> Maybe a

lerp :: Num a => a -> Maybe a -> Maybe a -> Maybe a

liftU2 :: (a -> a -> a) -> Maybe a -> Maybe a -> Maybe a

liftI2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c

Affine Maybe 
Instance details

Defined in Linear.Affine

Associated Types

type Diff Maybe :: Type -> Type

Methods

(.-.) :: Num a => Maybe a -> Maybe a -> Diff Maybe a

(.+^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

(.-^) :: Num a => Maybe a -> Diff Maybe a -> Maybe a

MonadBaseControl Maybe Maybe 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM Maybe a :: Type #

Methods

liftBaseWith :: (RunInBase Maybe Maybe -> Maybe a) -> Maybe a #

restoreM :: StM Maybe a -> Maybe a #

FoldableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m #

ifolded :: IndexedFold () (Maybe a) a #

ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b #

ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b #

ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b #

FunctorWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (() -> a -> b) -> Maybe a -> Maybe b #

imapped :: IndexedSetter () (Maybe a) (Maybe b) a b #

TraversableWithIndex () Maybe 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) #

itraversed :: IndexedTraversal () (Maybe a) (Maybe b) a b #

Eq a => Eq (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Maybe

Methods

(==) :: Maybe a -> Maybe a -> Bool #

(/=) :: Maybe a -> Maybe a -> Bool #

Ord a => Ord (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Maybe

Methods

compare :: Maybe a -> Maybe a -> Ordering #

(<) :: Maybe a -> Maybe a -> Bool #

(<=) :: Maybe a -> Maybe a -> Bool #

(>) :: Maybe a -> Maybe a -> Bool #

(>=) :: Maybe a -> Maybe a -> Bool #

max :: Maybe a -> Maybe a -> Maybe a #

min :: Maybe a -> Maybe a -> Maybe a #

Read a => Read (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS (Maybe a) #

readList :: ReadS [Maybe a] #

readPrec :: ReadPrec (Maybe a) #

readListPrec :: ReadPrec [Maybe a] #

Show a => Show (Maybe a)

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Maybe a -> ShowS #

show :: Maybe a -> String #

showList :: [Maybe a] -> ShowS #

Generic (Maybe a) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Maybe a) :: Type -> Type #

Methods

from :: Maybe a -> Rep (Maybe a) x #

to :: Rep (Maybe a) x -> Maybe a #

Semigroup a => Semigroup (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Maybe a -> Maybe a -> Maybe a #

sconcat :: NonEmpty (Maybe a) -> Maybe a #

stimes :: Integral b => b -> Maybe a -> Maybe a #

Semigroup a => Monoid (Maybe a)

Lift a semigroup into Maybe forming a Monoid according to http://en.wikipedia.org/wiki/Monoid: "Any semigroup S may be turned into a monoid simply by adjoining an element e not in S and defining e*e = e and e*s = s = s*e for all s ∈ S."

Since 4.11.0: constraint on inner a value generalised from - Monoid to Semigroup.

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Lift a => Lift (Maybe a) 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Maybe a -> Q Exp #

AsEmpty (Maybe a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Maybe a) () #

Ixed (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #

At (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #

Default (Maybe a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Maybe a #

NFData a => NFData (Maybe a) 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Maybe a -> () #

SingKind a => SingKind (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Associated Types

type DemoteRep (Maybe a) :: *

Methods

fromSing :: Sing a0 -> DemoteRep (Maybe a)

Binary a => Binary (Maybe a) 
Instance details

Defined in Data.Binary.Class

Methods

put :: Maybe a -> Put #

get :: Get (Maybe a) #

putList :: [Maybe a] -> Put #

Hashable a => Hashable (Maybe a) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Maybe a -> Int

hash :: Maybe a -> Int

IsName a => IsName (Maybe a) 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Maybe a -> Name

Generic1 Maybe 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Maybe :: k -> * #

Methods

from1 :: Maybe a -> Rep1 Maybe a #

to1 :: Rep1 Maybe a -> Maybe a #

SingI (Nothing :: Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing Nothing

Each (Maybe a) (Maybe b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Maybe a) (Maybe b) a b #

SingI a2 => SingI (Just a2 :: Maybe a1)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing (Just a2)

type Failure Maybe 
Instance details

Defined in Basement.Monad

type Failure Maybe = ()
type Diff Maybe 
Instance details

Defined in Linear.Affine

type Diff Maybe = Maybe
type StM Maybe a 
Instance details

Defined in Control.Monad.Trans.Control

type StM Maybe a = a
type Rep (Maybe a) 
Instance details

Defined in GHC.Generics

type Rep (Maybe a) = D1 (MetaData "Maybe" "GHC.Base" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: * -> *) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type IxValue (Maybe a) 
Instance details

Defined in Control.Lens.At

type IxValue (Maybe a) = a
type Index (Maybe a) 
Instance details

Defined in Control.Lens.At

type Index (Maybe a) = ()
data Sing (b :: Maybe a) 
Instance details

Defined in GHC.Generics

data Sing (b :: Maybe a) where
type DemoteRep (Maybe a) 
Instance details

Defined in GHC.Generics

type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Rep1 Maybe 
Instance details

Defined in GHC.Generics

type Rep1 Maybe = D1 (MetaData "Maybe" "GHC.Base" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: * -> *) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

data Ordering #

Constructors

LT 
EQ 
GT 
Instances
Bounded Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Ordering #

maxBound :: Ordering #

Enum Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Ordering -> Ordering #

pred :: Ordering -> Ordering #

toEnum :: Int -> Ordering #

fromEnum :: Ordering -> Int #

enumFrom :: Ordering -> [Ordering] #

enumFromThen :: Ordering -> Ordering -> [Ordering] #

enumFromTo :: Ordering -> Ordering -> [Ordering] #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #

Eq Ordering 
Instance details

Defined in GHC.Classes

Methods

(==) :: Ordering -> Ordering -> Bool #

(/=) :: Ordering -> Ordering -> Bool #

Ord Ordering 
Instance details

Defined in GHC.Classes

Methods

compare :: Ordering -> Ordering -> Ordering #

(<) :: Ordering -> Ordering -> Bool #

(<=) :: Ordering -> Ordering -> Bool #

(>) :: Ordering -> Ordering -> Bool #

(>=) :: Ordering -> Ordering -> Bool #

max :: Ordering -> Ordering -> Ordering #

min :: Ordering -> Ordering -> Ordering #

Read Ordering

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Ordering #

readList :: ReadS [Ordering] #

readPrec :: ReadPrec Ordering #

readListPrec :: ReadPrec [Ordering] #

Show Ordering 
Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Ordering -> ShowS #

show :: Ordering -> String #

showList :: [Ordering] -> ShowS #

Ix Ordering

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Ordering, Ordering) -> [Ordering] #

index :: (Ordering, Ordering) -> Ordering -> Int #

unsafeIndex :: (Ordering, Ordering) -> Ordering -> Int

inRange :: (Ordering, Ordering) -> Ordering -> Bool #

rangeSize :: (Ordering, Ordering) -> Int #

unsafeRangeSize :: (Ordering, Ordering) -> Int

Generic Ordering 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Ordering :: * -> * #

Methods

from :: Ordering -> Rep Ordering x #

to :: Rep Ordering x -> Ordering #

Semigroup Ordering

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Ordering -> Ordering -> Ordering #

sconcat :: NonEmpty Ordering -> Ordering #

stimes :: Integral b => b -> Ordering -> Ordering #

Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Ordering #

mappend :: Ordering -> Ordering -> Ordering #

mconcat :: [Ordering] -> Ordering #

AsEmpty Ordering 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Ordering () #

Default Ordering 
Instance details

Defined in Data.Default.Class

Methods

def :: Ordering #

NFData Ordering 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Ordering -> () #

Binary Ordering 
Instance details

Defined in Data.Binary.Class

Methods

put :: Ordering -> Put #

get :: Get Ordering #

putList :: [Ordering] -> Put #

Hashable Ordering 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Ordering -> Int

hash :: Ordering -> Int

CDF StdUniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Ordering -> Ordering -> Double

CDF Uniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Ordering -> Ordering -> Double

Distribution StdUniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Ordering -> RVar Ordering

rvarT :: StdUniform Ordering -> RVarT n Ordering

Distribution Uniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Ordering -> RVar Ordering

rvarT :: Uniform Ordering -> RVarT n Ordering

type Rep Ordering 
Instance details

Defined in GHC.Generics

type Rep Ordering = D1 (MetaData "Ordering" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "LT" PrefixI False) (U1 :: * -> *) :+: (C1 (MetaCons "EQ" PrefixI False) (U1 :: * -> *) :+: C1 (MetaCons "GT" PrefixI False) (U1 :: * -> *)))

type Rational = Ratio Integer #

Arbitrary-precision rational numbers, represented as a ratio of + Monoid to Semigroup.

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Maybe a #

mappend :: Maybe a -> Maybe a -> Maybe a #

mconcat :: [Maybe a] -> Maybe a #

Lift a => Lift (Maybe a) 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Maybe a -> Q Exp #

NFData a => NFData (Maybe a) 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Maybe a -> () #

Hashable a => Hashable (Maybe a) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Maybe a -> Int #

hash :: Maybe a -> Int #

SingKind a => SingKind (Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Associated Types

type DemoteRep (Maybe a) :: Type

Methods

fromSing :: Sing a0 -> DemoteRep (Maybe a)

Binary a => Binary (Maybe a) 
Instance details

Defined in Data.Binary.Class

Methods

put :: Maybe a -> Put #

get :: Get (Maybe a) #

putList :: [Maybe a] -> Put #

FromField a => FromField (Maybe a)

Nothing if the Field is empty, Just otherwise.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser (Maybe a) #

ToField a => ToField (Maybe a)

Nothing is encoded as an empty field.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Maybe a -> Field #

Default (Maybe a) 
Instance details

Defined in Data.Default.Class

Methods

def :: Maybe a #

Corecursive (Maybe a) 
Instance details

Defined in Data.Functor.Foldable

Methods

embed :: Base (Maybe a) (Maybe a) -> Maybe a

ana :: (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a

apo :: (a0 -> Base (Maybe a) (Either (Maybe a) a0)) -> a0 -> Maybe a

postpro :: Recursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a

gpostpro :: (Recursive (Maybe a), Monad m) => (forall b. m (Base (Maybe a) b) -> Base (Maybe a) (m b)) -> (forall c. Base (Maybe a) c -> Base (Maybe a) c) -> (a0 -> Base (Maybe a) (m a0)) -> a0 -> Maybe a

Recursive (Maybe a) 
Instance details

Defined in Data.Functor.Foldable

Methods

project :: Maybe a -> Base (Maybe a) (Maybe a)

cata :: (Base (Maybe a) a0 -> a0) -> Maybe a -> a0

para :: (Base (Maybe a) (Maybe a, a0) -> a0) -> Maybe a -> a0

gpara :: (Corecursive (Maybe a), Comonad w) => (forall b. Base (Maybe a) (w b) -> w (Base (Maybe a) b)) -> (Base (Maybe a) (EnvT (Maybe a) w a0) -> a0) -> Maybe a -> a0

prepro :: Corecursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (Base (Maybe a) a0 -> a0) -> Maybe a -> a0

gprepro :: (Corecursive (Maybe a), Comonad w) => (forall b. Base (Maybe a) (w b) -> w (Base (Maybe a) b)) -> (forall c. Base (Maybe a) c -> Base (Maybe a) c) -> (Base (Maybe a) (w a0) -> a0) -> Maybe a -> a0

IsName a => IsName (Maybe a) 
Instance details

Defined in Diagrams.Core.Names

Methods

toName :: Maybe a -> Name

AsEmpty (Maybe a) 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' (Maybe a) () #

At (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

at :: Index (Maybe a) -> Lens' (Maybe a) (Maybe (IxValue (Maybe a))) #

Ixed (Maybe a) 
Instance details

Defined in Control.Lens.At

Methods

ix :: Index (Maybe a) -> Traversal' (Maybe a) (IxValue (Maybe a)) #

Generic1 Maybe 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 Maybe :: k -> Type #

Methods

from1 :: Maybe a -> Rep1 Maybe a #

to1 :: Rep1 Maybe a -> Maybe a #

SingI (Nothing :: Maybe a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing Nothing

Each (Maybe a) (Maybe b) a b 
Instance details

Defined in Control.Lens.Each

Methods

each :: Traversal (Maybe a) (Maybe b) a b #

SingI a2 => SingI (Just a2 :: Maybe a1)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

sing :: Sing (Just a2)

type Failure Maybe 
Instance details

Defined in Basement.Monad

type Failure Maybe = ()
type Diff Maybe 
Instance details

Defined in Linear.Affine

type Diff Maybe = Maybe
type StM Maybe a 
Instance details

Defined in Control.Monad.Trans.Control

type StM Maybe a = a
type Rep (Maybe a)

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep (Maybe a) = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
data Sing (b :: Maybe a) 
Instance details

Defined in GHC.Generics

data Sing (b :: Maybe a) where
type DemoteRep (Maybe a) 
Instance details

Defined in GHC.Generics

type DemoteRep (Maybe a) = Maybe (DemoteRep a)
type Base (Maybe a) 
Instance details

Defined in Data.Functor.Foldable

type Base (Maybe a) = (Const (Maybe a) :: Type -> Type)
type Index (Maybe a) 
Instance details

Defined in Control.Lens.At

type Index (Maybe a) = ()
type IxValue (Maybe a) 
Instance details

Defined in Control.Lens.At

type IxValue (Maybe a) = a
type Rep1 Maybe

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep1 Maybe = D1 (MetaData "Maybe" "GHC.Maybe" "base" False) (C1 (MetaCons "Nothing" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "Just" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))

data Ordering #

Constructors

LT 
EQ 
GT 
Instances
Bounded Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Ordering #

maxBound :: Ordering #

Enum Ordering

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Ordering -> Ordering #

pred :: Ordering -> Ordering #

toEnum :: Int -> Ordering #

fromEnum :: Ordering -> Int #

enumFrom :: Ordering -> [Ordering] #

enumFromThen :: Ordering -> Ordering -> [Ordering] #

enumFromTo :: Ordering -> Ordering -> [Ordering] #

enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] #

Eq Ordering 
Instance details

Defined in GHC.Classes

Methods

(==) :: Ordering -> Ordering -> Bool #

(/=) :: Ordering -> Ordering -> Bool #

Ord Ordering 
Instance details

Defined in GHC.Classes

Methods

compare :: Ordering -> Ordering -> Ordering #

(<) :: Ordering -> Ordering -> Bool #

(<=) :: Ordering -> Ordering -> Bool #

(>) :: Ordering -> Ordering -> Bool #

(>=) :: Ordering -> Ordering -> Bool #

max :: Ordering -> Ordering -> Ordering #

min :: Ordering -> Ordering -> Ordering #

Read Ordering

Since: base-2.1

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Ordering #

readList :: ReadS [Ordering] #

readPrec :: ReadPrec Ordering #

readListPrec :: ReadPrec [Ordering] #

Show Ordering

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Ordering -> ShowS #

show :: Ordering -> String #

showList :: [Ordering] -> ShowS #

Ix Ordering

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

range :: (Ordering, Ordering) -> [Ordering] #

index :: (Ordering, Ordering) -> Ordering -> Int #

unsafeIndex :: (Ordering, Ordering) -> Ordering -> Int

inRange :: (Ordering, Ordering) -> Ordering -> Bool #

rangeSize :: (Ordering, Ordering) -> Int #

unsafeRangeSize :: (Ordering, Ordering) -> Int

Generic Ordering 
Instance details

Defined in GHC.Generics

Associated Types

type Rep Ordering :: Type -> Type #

Methods

from :: Ordering -> Rep Ordering x #

to :: Rep Ordering x -> Ordering #

Semigroup Ordering

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: Ordering -> Ordering -> Ordering #

sconcat :: NonEmpty Ordering -> Ordering #

stimes :: Integral b => b -> Ordering -> Ordering #

Monoid Ordering

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mempty :: Ordering #

mappend :: Ordering -> Ordering -> Ordering #

mconcat :: [Ordering] -> Ordering #

NFData Ordering 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Ordering -> () #

Hashable Ordering 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Ordering -> Int #

hash :: Ordering -> Int #

Binary Ordering 
Instance details

Defined in Data.Binary.Class

Methods

put :: Ordering -> Put #

get :: Get Ordering #

putList :: [Ordering] -> Put #

Default Ordering 
Instance details

Defined in Data.Default.Class

Methods

def :: Ordering #

AsEmpty Ordering 
Instance details

Defined in Control.Lens.Empty

Methods

_Empty :: Prism' Ordering () #

CDF StdUniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Ordering -> Ordering -> Double

CDF Uniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Ordering -> Ordering -> Double

Distribution StdUniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Ordering -> RVar Ordering

rvarT :: StdUniform Ordering -> RVarT n Ordering

Distribution Uniform Ordering 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Ordering -> RVar Ordering

rvarT :: Uniform Ordering -> RVarT n Ordering

type Rep Ordering

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep Ordering = D1 (MetaData "Ordering" "GHC.Types" "ghc-prim" False) (C1 (MetaCons "LT" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "EQ" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "GT" PrefixI False) (U1 :: Type -> Type)))

type Rational = Ratio Integer #

Arbitrary-precision rational numbers, represented as a ratio of two Integer values. A rational number may be constructed using - the % operator.

data IO a #

A value of type IO a is a computation which, when performed, + the % operator.

data IO a #

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
Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

MonadFix IO

Since: base-2.1

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> IO a) -> IO a #

Applicative IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> IO a #

(<*>) :: IO (a -> b) -> IO a -> IO b #

liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c #

(*>) :: IO a -> IO b -> IO b #

(<*) :: IO a -> IO b -> IO a #

MonadPlus IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mzero :: IO a #

mplus :: IO a -> IO a -> IO a #

MonadIO IO

Since: base-4.9.0.0

Instance details

Defined in Control.Monad.IO.Class

Methods

liftIO :: IO a -> IO a #

Alternative IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

empty :: IO a #

(<|>) :: IO a -> IO a -> IO a #

some :: IO a -> IO [a] #

many :: IO a -> IO [a] #

PrimMonad IO 
Instance details

Defined in Basement.Monad

Associated Types

type PrimState IO :: * #

type PrimVar IO :: * -> * #

Methods

primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #

primThrow :: Exception e => e -> IO a #

unPrimMonad :: IO a -> State# (PrimState IO) -> (#State# (PrimState IO), a#) #

primVarNew :: a -> IO (PrimVar IO a) #

primVarRead :: PrimVar IO a -> IO a #

primVarWrite :: PrimVar IO a -> a -> IO () #

PrimMonad IO 
Instance details

Defined in Control.Monad.Primitive

Associated Types

type PrimState IO :: * #

Methods

primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #

PrimBase IO 
Instance details

Defined in Control.Monad.Primitive

Methods

internal :: IO a -> State# (PrimState IO) -> (#State# (PrimState IO), a#) #

Quasi IO 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

qNewName :: String -> IO Name #

qReport :: Bool -> String -> IO () #

qRecover :: IO a -> IO a -> IO a #

qLookupName :: Bool -> String -> IO (Maybe Name) #

qReify :: Name -> IO Info #

qReifyFixity :: Name -> IO (Maybe Fixity) #

qReifyInstances :: Name -> [Type] -> IO [Dec] #

qReifyRoles :: Name -> IO [Role] #

qReifyAnnotations :: Data a => AnnLookup -> IO [a] #

qReifyModule :: Module -> IO ModuleInfo #

qReifyConStrictness :: Name -> IO [DecidedStrictness] #

qLocation :: IO Loc #

qRunIO :: IO a -> IO a #

qAddDependentFile :: FilePath -> IO () #

qAddTopDecls :: [Dec] -> IO () #

qAddForeignFile :: ForeignSrcLang -> String -> IO () #

qAddModFinalizer :: Q () -> IO () #

qAddCorePlugin :: String -> IO () #

qGetQ :: Typeable a => IO (Maybe a) #

qPutQ :: Typeable a => a -> IO () #

qIsExtEnabled :: Extension -> IO Bool #

qExtsEnabled :: IO [Extension] #

Apply IO 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: IO (a -> b) -> IO a -> IO b

(.>) :: IO a -> IO b -> IO b

(<.) :: IO a -> IO b -> IO a

liftF2 :: (a -> b -> c) -> IO a -> IO b -> IO c

Bind IO 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: IO a -> (a -> IO b) -> IO b

join :: IO (IO a) -> IO a

MonadCatch IO 
Instance details

Defined in Control.Monad.Catch

Methods

catch :: Exception e => IO a -> (e -> IO a) -> IO a

MonadMask IO 
Instance details

Defined in Control.Monad.Catch

Methods

mask :: ((forall a. IO a -> IO a) -> IO b) -> IO b

uninterruptibleMask :: ((forall a. IO a -> IO a) -> IO b) -> IO b

generalBracket :: IO a -> (a -> ExitCase b -> IO c) -> (a -> IO b) -> IO (b, c)

MonadThrow IO 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> IO a

MonadBaseControl IO IO 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM IO a :: *

Methods

liftBaseWith :: (RunInBase IO IO -> IO a) -> IO a

restoreM :: StM IO a -> IO a

MonadBaseControl IO Sh 
Instance details

Defined in Shelly.Base

Associated Types

type StM Sh a :: *

Methods

liftBaseWith :: (RunInBase Sh IO -> IO a) -> Sh a

restoreM :: StM Sh a -> Sh a

MonadBase IO Sh 
Instance details

Defined in Shelly.Base

Methods

liftBase :: IO α -> Sh α

MArray IOUArray Bool IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Bool -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Bool -> IO Int

newArray :: Ix i => (i, i) -> Bool -> IO (IOUArray i Bool) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool)

unsafeRead :: Ix i => IOUArray i Bool -> Int -> IO Bool

unsafeWrite :: Ix i => IOUArray i Bool -> Int -> Bool -> IO ()

MArray IOUArray Char IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Char -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Char -> IO Int

newArray :: Ix i => (i, i) -> Char -> IO (IOUArray i Char) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Char)

unsafeRead :: Ix i => IOUArray i Char -> Int -> IO Char

unsafeWrite :: Ix i => IOUArray i Char -> Int -> Char -> IO ()

MArray IOUArray Double IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Double -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Double -> IO Int

newArray :: Ix i => (i, i) -> Double -> IO (IOUArray i Double) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Double)

unsafeRead :: Ix i => IOUArray i Double -> Int -> IO Double

unsafeWrite :: Ix i => IOUArray i Double -> Int -> Double -> IO ()

MArray IOUArray Float IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Float -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Float -> IO Int

newArray :: Ix i => (i, i) -> Float -> IO (IOUArray i Float) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Float)

unsafeRead :: Ix i => IOUArray i Float -> Int -> IO Float

unsafeWrite :: Ix i => IOUArray i Float -> Int -> Float -> IO ()

MArray IOUArray Int IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int -> IO Int

newArray :: Ix i => (i, i) -> Int -> IO (IOUArray i Int) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int)

unsafeRead :: Ix i => IOUArray i Int -> Int -> IO Int

unsafeWrite :: Ix i => IOUArray i Int -> Int -> Int -> IO ()

MArray IOUArray Int8 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int8 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int8 -> IO Int

newArray :: Ix i => (i, i) -> Int8 -> IO (IOUArray i Int8) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int8) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int8)

unsafeRead :: Ix i => IOUArray i Int8 -> Int -> IO Int8

unsafeWrite :: Ix i => IOUArray i Int8 -> Int -> Int8 -> IO ()

MArray IOUArray Int16 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int16 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int16 -> IO Int

newArray :: Ix i => (i, i) -> Int16 -> IO (IOUArray i Int16) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int16) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int16)

unsafeRead :: Ix i => IOUArray i Int16 -> Int -> IO Int16

unsafeWrite :: Ix i => IOUArray i Int16 -> Int -> Int16 -> IO ()

MArray IOUArray Int32 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int32 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int32 -> IO Int

newArray :: Ix i => (i, i) -> Int32 -> IO (IOUArray i Int32) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int32) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int32)

unsafeRead :: Ix i => IOUArray i Int32 -> Int -> IO Int32

unsafeWrite :: Ix i => IOUArray i Int32 -> Int -> Int32 -> IO ()

MArray IOUArray Int64 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int64 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int64 -> IO Int

newArray :: Ix i => (i, i) -> Int64 -> IO (IOUArray i Int64) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int64) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int64)

unsafeRead :: Ix i => IOUArray i Int64 -> Int -> IO Int64

unsafeWrite :: Ix i => IOUArray i Int64 -> Int -> Int64 -> IO ()

MArray IOUArray Word IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word -> IO Int

newArray :: Ix i => (i, i) -> Word -> IO (IOUArray i Word) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word)

unsafeRead :: Ix i => IOUArray i Word -> Int -> IO Word

unsafeWrite :: Ix i => IOUArray i Word -> Int -> Word -> IO ()

MArray IOUArray Word8 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word8 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word8 -> IO Int

newArray :: Ix i => (i, i) -> Word8 -> IO (IOUArray i Word8) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word8) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word8)

unsafeRead :: Ix i => IOUArray i Word8 -> Int -> IO Word8

unsafeWrite :: Ix i => IOUArray i Word8 -> Int -> Word8 -> IO ()

MArray IOUArray Word16 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word16 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word16 -> IO Int

newArray :: Ix i => (i, i) -> Word16 -> IO (IOUArray i Word16) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word16) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word16)

unsafeRead :: Ix i => IOUArray i Word16 -> Int -> IO Word16

unsafeWrite :: Ix i => IOUArray i Word16 -> Int -> Word16 -> IO ()

MArray IOUArray Word32 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word32 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word32 -> IO Int

newArray :: Ix i => (i, i) -> Word32 -> IO (IOUArray i Word32) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word32) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word32)

unsafeRead :: Ix i => IOUArray i Word32 -> Int -> IO Word32

unsafeWrite :: Ix i => IOUArray i Word32 -> Int -> Word32 -> IO ()

MArray IOUArray Word64 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word64 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word64 -> IO Int

newArray :: Ix i => (i, i) -> Word64 -> IO (IOUArray i Word64) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word64) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word64)

unsafeRead :: Ix i => IOUArray i Word64 -> Int -> IO Word64

unsafeWrite :: Ix i => IOUArray i Word64 -> Int -> Word64 -> IO ()

MArray IOArray e IO 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => IOArray i e -> IO (i, i) #

getNumElements :: Ix i => IOArray i e -> IO Int

newArray :: Ix i => (i, i) -> e -> IO (IOArray i e) #

newArray_ :: Ix i => (i, i) -> IO (IOArray i e) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOArray i e)

unsafeRead :: Ix i => IOArray i e -> Int -> IO e

unsafeWrite :: Ix i => IOArray i e -> Int -> e -> IO ()

Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

MArray IOUArray (StablePtr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (StablePtr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (StablePtr a) -> IO Int

newArray :: Ix i => (i, i) -> StablePtr a -> IO (IOUArray i (StablePtr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (StablePtr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (StablePtr a))

unsafeRead :: Ix i => IOUArray i (StablePtr a) -> Int -> IO (StablePtr a)

unsafeWrite :: Ix i => IOUArray i (StablePtr a) -> Int -> StablePtr a -> IO ()

MArray IOUArray (Ptr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (Ptr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (Ptr a) -> IO Int

newArray :: Ix i => (i, i) -> Ptr a -> IO (IOUArray i (Ptr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (Ptr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (Ptr a))

unsafeRead :: Ix i => IOUArray i (Ptr a) -> Int -> IO (Ptr a)

unsafeWrite :: Ix i => IOUArray i (Ptr a) -> Int -> Ptr a -> IO ()

MArray IOUArray (FunPtr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (FunPtr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (FunPtr a) -> IO Int

newArray :: Ix i => (i, i) -> FunPtr a -> IO (IOUArray i (FunPtr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (FunPtr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (FunPtr a))

unsafeRead :: Ix i => IOUArray i (FunPtr a) -> Int -> IO (FunPtr a)

unsafeWrite :: Ix i => IOUArray i (FunPtr a) -> Int -> FunPtr a -> IO ()

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Semigroup a => Semigroup (IO a)

Since: base-4.10.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: IO a -> IO a -> IO a #

sconcat :: NonEmpty (IO a) -> IO a #

stimes :: Integral b => b -> IO a -> IO a #

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mempty :: IO a #

mappend :: IO a -> IO a -> IO a #

mconcat :: [IO a] -> IO a #

IfB (IO a) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (IO a) => bool -> IO a -> IO a -> IO a #

Default a => Default (IO a) 
Instance details

Defined in Data.Default.Class

Methods

def :: IO a #

a ~ () => PrintfType (IO a)

Since: base-4.7.0.0

Instance details

Defined in Text.Printf

Methods

spr :: String -> [UPrintf] -> IO a

a ~ () => HPrintfType (IO a)

Since: base-4.7.0.0

Instance details

Defined in Text.Printf

Methods

hspr :: Handle -> String -> [UPrintf] -> IO a

Mainable d => Mainable (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type MainOpts (IO d) :: *

Methods

mainArgs :: IO d -> IO (MainOpts (IO d))

mainRender :: MainOpts (IO d) -> IO d -> IO ()

mainWith :: IO d -> IO ()

ToResult d => ToResult (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type Args (IO d) :: *

type ResultOf (IO d) :: *

Methods

toResult :: IO d -> Args (IO d) -> ResultOf (IO d)

type PrimVar IO 
Instance details

Defined in Basement.Monad

type PrimVar IO = IORef
type PrimState IO 
Instance details

Defined in Basement.Monad

type PrimState IO = RealWorld
type PrimState IO 
Instance details

Defined in Control.Monad.Primitive

type PrimState IO = RealWorld
type StM IO a 
Instance details

Defined in Control.Monad.Trans.Control

type StM IO a = a
type BooleanOf (IO a) # 
Instance details

Defined in Util

type BooleanOf (IO a) = Bool
type MainOpts (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type MainOpts (IO d) = MainOpts d
type Args (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type Args (IO d) = Args d
type ResultOf (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type ResultOf (IO d) = IO (ResultOf d)

data Word #

A Word is an unsigned integral type, with the same size as Int.

Instances
Bounded Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Word #

maxBound :: Word #

Enum Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Word -> Word #

pred :: Word -> Word #

toEnum :: Int -> Word #

fromEnum :: Word -> Int #

enumFrom :: Word -> [Word] #

enumFromThen :: Word -> Word -> [Word] #

enumFromTo :: Word -> Word -> [Word] #

enumFromThenTo :: Word -> Word -> Word -> [Word] #

Eq Word 
Instance details

Defined in GHC.Classes

Methods

(==) :: Word -> Word -> Bool #

(/=) :: Word -> Word -> Bool #

Integral Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

quot :: Word -> Word -> Word #

rem :: Word -> Word -> Word #

div :: Word -> Word -> Word #

mod :: Word -> Word -> Word #

quotRem :: Word -> Word -> (Word, Word) #

divMod :: Word -> Word -> (Word, Word) #

toInteger :: Word -> Integer #

Num Word

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Word -> Word -> Word #

(-) :: Word -> Word -> Word #

(*) :: Word -> Word -> Word #

negate :: Word -> Word #

abs :: Word -> Word #

signum :: Word -> Word #

fromInteger :: Integer -> Word #

Ord Word 
Instance details

Defined in GHC.Classes

Methods

compare :: Word -> Word -> Ordering #

(<) :: Word -> Word -> Bool #

(<=) :: Word -> Word -> Bool #

(>) :: Word -> Word -> Bool #

(>=) :: Word -> Word -> Bool #

max :: Word -> Word -> Word #

min :: Word -> Word -> Word #

Read Word

Since: base-4.5.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word #

readList :: ReadS [Word] #

readPrec :: ReadPrec Word #

readListPrec :: ReadPrec [Word] #

Real Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

toRational :: Word -> Rational #

Show Word

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Word -> ShowS #

show :: Word -> String #

showList :: [Word] -> ShowS #

Ix Word

Since: base-4.6.0.0

Instance details

Defined in GHC.Arr

Methods

range :: (Word, Word) -> [Word] #

index :: (Word, Word) -> Word -> Int #

unsafeIndex :: (Word, Word) -> Word -> Int

inRange :: (Word, Word) -> Word -> Bool #

rangeSize :: (Word, Word) -> Int #

unsafeRangeSize :: (Word, Word) -> Int

Lift Word 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Word -> Q Exp #

Default Word 
Instance details

Defined in Data.Default.Class

Methods

def :: Word #

Random Word 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Word, Word) -> g -> (Word, g) #

random :: RandomGen g => g -> (Word, g) #

randomRs :: RandomGen g => (Word, Word) -> g -> [Word] #

randoms :: RandomGen g => g -> [Word] #

randomRIO :: (Word, Word) -> IO Word #

randomIO :: IO Word #

NFData Word 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Word -> () #

PrintfArg Word

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Word -> FieldFormatter #

parseFormat :: Word -> ModifierParser #

Storable Word

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Word -> Int #

alignment :: Word -> Int #

peekElemOff :: Ptr Word -> Int -> IO Word #

pokeElemOff :: Ptr Word -> Int -> Word -> IO () #

peekByteOff :: Ptr b -> Int -> IO Word #

pokeByteOff :: Ptr b -> Int -> Word -> IO () #

peek :: Ptr Word -> IO Word #

poke :: Ptr Word -> Word -> IO () #

PrimType Word 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Word :: Nat #

Methods

primSizeInBytes :: Proxy Word -> CountOf Word8 #

primShiftToBytes :: Proxy Word -> Int #

primBaUIndex :: ByteArray# -> Offset Word -> Word #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> prim Word #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> Word -> prim () #

primAddrIndex :: Addr# -> Offset Word -> Word #

primAddrRead :: PrimMonad prim => Addr# -> Offset Word -> prim Word #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Word -> Word -> prim () #

PrimMemoryComparable Word 
Instance details

Defined in Basement.PrimType

Subtractive Word 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Word :: * #

Methods

(-) :: Word -> Word -> Difference Word #

Binary Word 
Instance details

Defined in Data.Binary.Class

Methods

put :: Word -> Put #

get :: Get Word #

putList :: [Word] -> Put #

Prim Word 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Word -> Int# #

alignment# :: Word -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Word #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Word #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word#) #

writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s #

Hashable Word 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word -> Int

hash :: Word -> Int

Unbox Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Word 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Word

uniformR :: PrimMonad m => (Word, Word) -> Gen (PrimState m) -> m Word

IArray UArray Word 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Word -> (i, i) #

numElements :: Ix i => UArray i Word -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Word)] -> UArray i Word

unsafeAt :: Ix i => UArray i Word -> Int -> Word

unsafeReplace :: Ix i => UArray i Word -> [(Int, Word)] -> UArray i Word

unsafeAccum :: Ix i => (Word -> e' -> Word) -> UArray i Word -> [(Int, e')] -> UArray i Word

unsafeAccumArray :: Ix i => (Word -> e' -> Word) -> Word -> (i, i) -> [(Int, e')] -> UArray i Word

MVector MVector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Word -> Int

basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word

basicOverlaps :: MVector s Word -> MVector s Word -> Bool

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word)

basicInitialize :: PrimMonad m => MVector (PrimState m) Word -> m ()

basicUnsafeReplicate :: PrimMonad m => Int -> Word -> m (MVector (PrimState m) Word)

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word -> Int -> m Word

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word -> Int -> Word -> m ()

basicClear :: PrimMonad m => MVector (PrimState m) Word -> m ()

basicSet :: PrimMonad m => MVector (PrimState m) Word -> Word -> m ()

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m ()

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m ()

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word -> Int -> m (MVector (PrimState m) Word)

Vector Vector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word -> m (Vector Word)

basicUnsafeThaw :: PrimMonad m => Vector Word -> m (Mutable Vector (PrimState m) Word)

basicLength :: Vector Word -> Int

basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word

basicUnsafeIndexM :: Monad m => Vector Word -> Int -> m Word

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word -> Vector Word -> m ()

elemseq :: Vector Word -> Word -> b -> b

CDF StdUniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Word -> Word -> Double

CDF Uniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Word -> Word -> Double

Distribution StdUniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Word -> RVar Word

rvarT :: StdUniform Word -> RVarT n Word

Distribution Uniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Word -> RVar Word

rvarT :: Uniform Word -> RVarT n Word

MArray IOUArray Word IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word -> IO Int

newArray :: Ix i => (i, i) -> Word -> IO (IOUArray i Word) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word)

unsafeRead :: Ix i => IOUArray i Word -> Int -> IO Word

unsafeWrite :: Ix i => IOUArray i Word -> Int -> Word -> IO ()

Generic1 (URec Word :: k -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Word) :: k -> * #

Methods

from1 :: URec Word a -> Rep1 (URec Word) a #

to1 :: Rep1 (URec Word) a -> URec Word a #

(Real b, Distribution (Poisson b) Word) => CDF (Poisson b) Word 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Word -> Word -> Double

(Real b, Distribution (Binomial b) Word) => CDF (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Word -> Word -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Word) b, Distribution (Binomial b) Word) => Distribution (Poisson b) Word 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Word -> RVar Word

rvarT :: Poisson b Word -> RVarT n Word

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Word -> RVar Word

rvarT :: Binomial b Word -> RVarT n Word

(Real b, Distribution (Binomial b) Word) => PDF (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Word -> Word -> Double

logPdf :: Binomial b Word -> Word -> Double

MArray (STUArray s) Word (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Word -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Word -> ST s Int

newArray :: Ix i => (i, i) -> Word -> ST s (STUArray s i Word) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Word)

unsafeRead :: Ix i => STUArray s i Word -> Int -> ST s Word

unsafeWrite :: Ix i => STUArray s i Word -> Int -> Word -> ST s ()

Functor (URec Word :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Foldable (URec Word :: * -> *) 
Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Word m -> m #

foldMap :: Monoid m => (a -> m) -> URec Word a -> m #

foldr :: (a -> b -> b) -> b -> URec Word a -> b #

foldr' :: (a -> b -> b) -> b -> URec Word a -> b #

foldl :: (b -> a -> b) -> b -> URec Word a -> b #

foldl' :: (b -> a -> b) -> b -> URec Word a -> b #

foldr1 :: (a -> a -> a) -> URec Word a -> a #

foldl1 :: (a -> a -> a) -> URec Word a -> a #

toList :: URec Word a -> [a] #

null :: URec Word a -> Bool #

length :: URec Word a -> Int #

elem :: Eq a => a -> URec Word a -> Bool #

maximum :: Ord a => URec Word a -> a #

minimum :: Ord a => URec Word a -> a #

sum :: Num a => URec Word a -> a #

product :: Num a => URec Word a -> a #

Traversable (URec Word :: * -> *) 
Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Eq (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

(==) :: URec Word p -> URec Word p -> Bool #

(/=) :: URec Word p -> URec Word p -> Bool #

Ord (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering #

(<) :: URec Word p -> URec Word p -> Bool #

(<=) :: URec Word p -> URec Word p -> Bool #

(>) :: URec Word p -> URec Word p -> Bool #

(>=) :: URec Word p -> URec Word p -> Bool #

max :: URec Word p -> URec Word p -> URec Word p #

min :: URec Word p -> URec Word p -> URec Word p #

Show (URec Word p) 
Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Word p -> ShowS #

show :: URec Word p -> String #

showList :: [URec Word p] -> ShowS #

Generic (URec Word p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Word p) :: * -> * #

Methods

from :: URec Word p -> Rep (URec Word p) x #

to :: Rep (URec Word p) x -> URec Word p #

type PrimSize Word 
Instance details

Defined in Basement.PrimType

type PrimSize Word = 8
type Difference Word 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Word = Word
type NatNumMaxBound Word 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Word = NatNumMaxBound Word64
data Vector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

data Vector Word = V_Word (Vector Word)
type Unsigned Word 
Instance details

Defined in System.Random.MWC

type Unsigned Word = Word
type Signed Word 
Instance details

Defined in Data.Bytes.Signed

type Signed Word = Int
type Unsigned Word 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Word = Word
data URec Word (p :: k)

Used for marking occurrences of Word#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Word (p :: k) = UWord {}
data MVector s Word 
Instance details

Defined in Data.Vector.Unboxed.Base

data MVector s Word = MV_Word (MVector s Word)
type Rep1 (URec Word :: k -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (URec Word :: k -> *) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: k -> *)))
type Rep (URec Word p) 
Instance details

Defined in GHC.Generics

type Rep (URec Word p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: * -> *)))

data Either a b #

The Either type represents values with two possibilities: a value of +or the >> and >>= operations from the Monad class.

Instances
Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

MonadFix IO

Since: base-2.1

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> IO a) -> IO a #

MonadFail IO

Since: base-4.9.0.0

Instance details

Defined in Control.Monad.Fail

Methods

fail :: String -> IO a #

Applicative IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

pure :: a -> IO a #

(<*>) :: IO (a -> b) -> IO a -> IO b #

liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c #

(*>) :: IO a -> IO b -> IO b #

(<*) :: IO a -> IO b -> IO a #

MonadPlus IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mzero :: IO a #

mplus :: IO a -> IO a -> IO a #

MonadIO IO

Since: base-4.9.0.0

Instance details

Defined in Control.Monad.IO.Class

Methods

liftIO :: IO a -> IO a #

Alternative IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

empty :: IO a #

(<|>) :: IO a -> IO a -> IO a #

some :: IO a -> IO [a] #

many :: IO a -> IO [a] #

PrimMonad IO 
Instance details

Defined in Basement.Monad

Associated Types

type PrimState IO :: Type #

type PrimVar IO :: Type -> Type #

Methods

primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #

primThrow :: Exception e => e -> IO a #

unPrimMonad :: IO a -> State# (PrimState IO) -> (#State# (PrimState IO), a#) #

primVarNew :: a -> IO (PrimVar IO a) #

primVarRead :: PrimVar IO a -> IO a #

primVarWrite :: PrimVar IO a -> a -> IO () #

MonadThrow IO 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e => e -> IO a #

MonadCatch IO 
Instance details

Defined in Control.Monad.Catch

Methods

catch :: Exception e => IO a -> (e -> IO a) -> IO a #

MonadMask IO 
Instance details

Defined in Control.Monad.Catch

Methods

mask :: ((forall a. IO a -> IO a) -> IO b) -> IO b #

uninterruptibleMask :: ((forall a. IO a -> IO a) -> IO b) -> IO b #

generalBracket :: IO a -> (a -> ExitCase b -> IO c) -> (a -> IO b) -> IO (b, c) #

PrimMonad IO 
Instance details

Defined in Control.Monad.Primitive

Associated Types

type PrimState IO :: Type #

Methods

primitive :: (State# (PrimState IO) -> (#State# (PrimState IO), a#)) -> IO a #

PrimBase IO 
Instance details

Defined in Control.Monad.Primitive

Methods

internal :: IO a -> State# (PrimState IO) -> (#State# (PrimState IO), a#) #

Apply IO 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: IO (a -> b) -> IO a -> IO b #

(.>) :: IO a -> IO b -> IO b #

(<.) :: IO a -> IO b -> IO a #

liftF2 :: (a -> b -> c) -> IO a -> IO b -> IO c #

Bind IO 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: IO a -> (a -> IO b) -> IO b #

join :: IO (IO a) -> IO a #

Quasi IO 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

qNewName :: String -> IO Name #

qReport :: Bool -> String -> IO () #

qRecover :: IO a -> IO a -> IO a #

qLookupName :: Bool -> String -> IO (Maybe Name) #

qReify :: Name -> IO Info #

qReifyFixity :: Name -> IO (Maybe Fixity) #

qReifyInstances :: Name -> [Type] -> IO [Dec] #

qReifyRoles :: Name -> IO [Role] #

qReifyAnnotations :: Data a => AnnLookup -> IO [a] #

qReifyModule :: Module -> IO ModuleInfo #

qReifyConStrictness :: Name -> IO [DecidedStrictness] #

qLocation :: IO Loc #

qRunIO :: IO a -> IO a #

qAddDependentFile :: FilePath -> IO () #

qAddTempFile :: String -> IO FilePath #

qAddTopDecls :: [Dec] -> IO () #

qAddForeignFilePath :: ForeignSrcLang -> String -> IO () #

qAddModFinalizer :: Q () -> IO () #

qAddCorePlugin :: String -> IO () #

qGetQ :: Typeable a => IO (Maybe a) #

qPutQ :: Typeable a => a -> IO () #

qIsExtEnabled :: Extension -> IO Bool #

qExtsEnabled :: IO [Extension] #

MonadBase IO Sh 
Instance details

Defined in Shelly.Base

Methods

liftBase :: IO α -> Sh α #

MonadBaseControl IO IO 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM IO a :: Type #

Methods

liftBaseWith :: (RunInBase IO IO -> IO a) -> IO a #

restoreM :: StM IO a -> IO a #

MonadBaseControl IO Sh 
Instance details

Defined in Shelly.Base

Associated Types

type StM Sh a :: Type #

Methods

liftBaseWith :: (RunInBase Sh IO -> IO a) -> Sh a #

restoreM :: StM Sh a -> Sh a #

MArray IOUArray Bool IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Bool -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Bool -> IO Int

newArray :: Ix i => (i, i) -> Bool -> IO (IOUArray i Bool) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Bool)

unsafeRead :: Ix i => IOUArray i Bool -> Int -> IO Bool

unsafeWrite :: Ix i => IOUArray i Bool -> Int -> Bool -> IO ()

MArray IOUArray Char IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Char -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Char -> IO Int

newArray :: Ix i => (i, i) -> Char -> IO (IOUArray i Char) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Char) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Char)

unsafeRead :: Ix i => IOUArray i Char -> Int -> IO Char

unsafeWrite :: Ix i => IOUArray i Char -> Int -> Char -> IO ()

MArray IOUArray Double IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Double -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Double -> IO Int

newArray :: Ix i => (i, i) -> Double -> IO (IOUArray i Double) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Double) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Double)

unsafeRead :: Ix i => IOUArray i Double -> Int -> IO Double

unsafeWrite :: Ix i => IOUArray i Double -> Int -> Double -> IO ()

MArray IOUArray Float IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Float -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Float -> IO Int

newArray :: Ix i => (i, i) -> Float -> IO (IOUArray i Float) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Float) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Float)

unsafeRead :: Ix i => IOUArray i Float -> Int -> IO Float

unsafeWrite :: Ix i => IOUArray i Float -> Int -> Float -> IO ()

MArray IOUArray Int IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int -> IO Int

newArray :: Ix i => (i, i) -> Int -> IO (IOUArray i Int) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int)

unsafeRead :: Ix i => IOUArray i Int -> Int -> IO Int

unsafeWrite :: Ix i => IOUArray i Int -> Int -> Int -> IO ()

MArray IOUArray Int8 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int8 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int8 -> IO Int

newArray :: Ix i => (i, i) -> Int8 -> IO (IOUArray i Int8) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int8) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int8)

unsafeRead :: Ix i => IOUArray i Int8 -> Int -> IO Int8

unsafeWrite :: Ix i => IOUArray i Int8 -> Int -> Int8 -> IO ()

MArray IOUArray Int16 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int16 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int16 -> IO Int

newArray :: Ix i => (i, i) -> Int16 -> IO (IOUArray i Int16) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int16) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int16)

unsafeRead :: Ix i => IOUArray i Int16 -> Int -> IO Int16

unsafeWrite :: Ix i => IOUArray i Int16 -> Int -> Int16 -> IO ()

MArray IOUArray Int32 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int32 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int32 -> IO Int

newArray :: Ix i => (i, i) -> Int32 -> IO (IOUArray i Int32) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int32) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int32)

unsafeRead :: Ix i => IOUArray i Int32 -> Int -> IO Int32

unsafeWrite :: Ix i => IOUArray i Int32 -> Int -> Int32 -> IO ()

MArray IOUArray Int64 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Int64 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Int64 -> IO Int

newArray :: Ix i => (i, i) -> Int64 -> IO (IOUArray i Int64) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Int64) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Int64)

unsafeRead :: Ix i => IOUArray i Int64 -> Int -> IO Int64

unsafeWrite :: Ix i => IOUArray i Int64 -> Int -> Int64 -> IO ()

MArray IOUArray Word IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word -> IO Int

newArray :: Ix i => (i, i) -> Word -> IO (IOUArray i Word) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word)

unsafeRead :: Ix i => IOUArray i Word -> Int -> IO Word

unsafeWrite :: Ix i => IOUArray i Word -> Int -> Word -> IO ()

MArray IOUArray Word8 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word8 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word8 -> IO Int

newArray :: Ix i => (i, i) -> Word8 -> IO (IOUArray i Word8) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word8) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word8)

unsafeRead :: Ix i => IOUArray i Word8 -> Int -> IO Word8

unsafeWrite :: Ix i => IOUArray i Word8 -> Int -> Word8 -> IO ()

MArray IOUArray Word16 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word16 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word16 -> IO Int

newArray :: Ix i => (i, i) -> Word16 -> IO (IOUArray i Word16) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word16) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word16)

unsafeRead :: Ix i => IOUArray i Word16 -> Int -> IO Word16

unsafeWrite :: Ix i => IOUArray i Word16 -> Int -> Word16 -> IO ()

MArray IOUArray Word32 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word32 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word32 -> IO Int

newArray :: Ix i => (i, i) -> Word32 -> IO (IOUArray i Word32) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word32) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word32)

unsafeRead :: Ix i => IOUArray i Word32 -> Int -> IO Word32

unsafeWrite :: Ix i => IOUArray i Word32 -> Int -> Word32 -> IO ()

MArray IOUArray Word64 IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word64 -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word64 -> IO Int

newArray :: Ix i => (i, i) -> Word64 -> IO (IOUArray i Word64) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word64) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word64)

unsafeRead :: Ix i => IOUArray i Word64 -> Int -> IO Word64

unsafeWrite :: Ix i => IOUArray i Word64 -> Int -> Word64 -> IO ()

MArray IOArray e IO 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => IOArray i e -> IO (i, i) #

getNumElements :: Ix i => IOArray i e -> IO Int

newArray :: Ix i => (i, i) -> e -> IO (IOArray i e) #

newArray_ :: Ix i => (i, i) -> IO (IOArray i e) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOArray i e)

unsafeRead :: Ix i => IOArray i e -> Int -> IO e

unsafeWrite :: Ix i => IOArray i e -> Int -> e -> IO ()

Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

MArray IOUArray (StablePtr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (StablePtr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (StablePtr a) -> IO Int

newArray :: Ix i => (i, i) -> StablePtr a -> IO (IOUArray i (StablePtr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (StablePtr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (StablePtr a))

unsafeRead :: Ix i => IOUArray i (StablePtr a) -> Int -> IO (StablePtr a)

unsafeWrite :: Ix i => IOUArray i (StablePtr a) -> Int -> StablePtr a -> IO ()

MArray IOUArray (Ptr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (Ptr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (Ptr a) -> IO Int

newArray :: Ix i => (i, i) -> Ptr a -> IO (IOUArray i (Ptr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (Ptr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (Ptr a))

unsafeRead :: Ix i => IOUArray i (Ptr a) -> Int -> IO (Ptr a)

unsafeWrite :: Ix i => IOUArray i (Ptr a) -> Int -> Ptr a -> IO ()

MArray IOUArray (FunPtr a) IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i (FunPtr a) -> IO (i, i) #

getNumElements :: Ix i => IOUArray i (FunPtr a) -> IO Int

newArray :: Ix i => (i, i) -> FunPtr a -> IO (IOUArray i (FunPtr a)) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i (FunPtr a)) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i (FunPtr a))

unsafeRead :: Ix i => IOUArray i (FunPtr a) -> Int -> IO (FunPtr a)

unsafeWrite :: Ix i => IOUArray i (FunPtr a) -> Int -> FunPtr a -> IO ()

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution Logistic (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Logistic (Double, Double) -> IO Double

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Semigroup a => Semigroup (IO a)

Since: base-4.10.0.0

Instance details

Defined in GHC.Base

Methods

(<>) :: IO a -> IO a -> IO a #

sconcat :: NonEmpty (IO a) -> IO a #

stimes :: Integral b => b -> IO a -> IO a #

Monoid a => Monoid (IO a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mempty :: IO a #

mappend :: IO a -> IO a -> IO a #

mconcat :: [IO a] -> IO a #

IfB (IO a) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (IO a) => bool -> IO a -> IO a -> IO a #

a ~ () => PrintfType (IO a)

Since: base-4.7.0.0

Instance details

Defined in Text.Printf

Methods

spr :: String -> [UPrintf] -> IO a

a ~ () => HPrintfType (IO a)

Since: base-4.7.0.0

Instance details

Defined in Text.Printf

Methods

hspr :: Handle -> String -> [UPrintf] -> IO a

Default a => Default (IO a) 
Instance details

Defined in Data.Default.Class

Methods

def :: IO a #

Mainable d => Mainable (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type MainOpts (IO d) :: Type

Methods

mainArgs :: IO d -> IO (MainOpts (IO d))

mainRender :: MainOpts (IO d) -> IO d -> IO ()

mainWith :: IO d -> IO ()

ToResult d => ToResult (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

Associated Types

type Args (IO d) :: Type

type ResultOf (IO d) :: Type

Methods

toResult :: IO d -> Args (IO d) -> ResultOf (IO d)

type PrimVar IO 
Instance details

Defined in Basement.Monad

type PrimVar IO = IORef
type PrimState IO 
Instance details

Defined in Basement.Monad

type PrimState IO = RealWorld
type PrimState IO 
Instance details

Defined in Control.Monad.Primitive

type PrimState IO = RealWorld
type StM IO a 
Instance details

Defined in Control.Monad.Trans.Control

type StM IO a = a
type BooleanOf (IO a) # 
Instance details

Defined in Util

type BooleanOf (IO a) = Bool
type MainOpts (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type MainOpts (IO d) = MainOpts d
type Args (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type Args (IO d) = Args d
type ResultOf (IO d) 
Instance details

Defined in Diagrams.Backend.CmdLine

type ResultOf (IO d) = IO (ResultOf d)

data Word #

A Word is an unsigned integral type, with the same size as Int.

Instances
Bounded Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

minBound :: Word #

maxBound :: Word #

Enum Word

Since: base-2.1

Instance details

Defined in GHC.Enum

Methods

succ :: Word -> Word #

pred :: Word -> Word #

toEnum :: Int -> Word #

fromEnum :: Word -> Int #

enumFrom :: Word -> [Word] #

enumFromThen :: Word -> Word -> [Word] #

enumFromTo :: Word -> Word -> [Word] #

enumFromThenTo :: Word -> Word -> Word -> [Word] #

Eq Word 
Instance details

Defined in GHC.Classes

Methods

(==) :: Word -> Word -> Bool #

(/=) :: Word -> Word -> Bool #

Integral Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

quot :: Word -> Word -> Word #

rem :: Word -> Word -> Word #

div :: Word -> Word -> Word #

mod :: Word -> Word -> Word #

quotRem :: Word -> Word -> (Word, Word) #

divMod :: Word -> Word -> (Word, Word) #

toInteger :: Word -> Integer #

Num Word

Since: base-2.1

Instance details

Defined in GHC.Num

Methods

(+) :: Word -> Word -> Word #

(-) :: Word -> Word -> Word #

(*) :: Word -> Word -> Word #

negate :: Word -> Word #

abs :: Word -> Word #

signum :: Word -> Word #

fromInteger :: Integer -> Word #

Ord Word 
Instance details

Defined in GHC.Classes

Methods

compare :: Word -> Word -> Ordering #

(<) :: Word -> Word -> Bool #

(<=) :: Word -> Word -> Bool #

(>) :: Word -> Word -> Bool #

(>=) :: Word -> Word -> Bool #

max :: Word -> Word -> Word #

min :: Word -> Word -> Word #

Read Word

Since: base-4.5.0.0

Instance details

Defined in GHC.Read

Methods

readsPrec :: Int -> ReadS Word #

readList :: ReadS [Word] #

readPrec :: ReadPrec Word #

readListPrec :: ReadPrec [Word] #

Real Word

Since: base-2.1

Instance details

Defined in GHC.Real

Methods

toRational :: Word -> Rational #

Show Word

Since: base-2.1

Instance details

Defined in GHC.Show

Methods

showsPrec :: Int -> Word -> ShowS #

show :: Word -> String #

showList :: [Word] -> ShowS #

Ix Word

Since: base-4.6.0.0

Instance details

Defined in GHC.Arr

Methods

range :: (Word, Word) -> [Word] #

index :: (Word, Word) -> Word -> Int #

unsafeIndex :: (Word, Word) -> Word -> Int

inRange :: (Word, Word) -> Word -> Bool #

rangeSize :: (Word, Word) -> Int #

unsafeRangeSize :: (Word, Word) -> Int

Lift Word 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Word -> Q Exp #

Random Word 
Instance details

Defined in System.Random

Methods

randomR :: RandomGen g => (Word, Word) -> g -> (Word, g) #

random :: RandomGen g => g -> (Word, g) #

randomRs :: RandomGen g => (Word, Word) -> g -> [Word] #

randoms :: RandomGen g => g -> [Word] #

randomRIO :: (Word, Word) -> IO Word #

randomIO :: IO Word #

NFData Word 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Word -> () #

Hashable Word 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Word -> Int #

hash :: Word -> Int #

PrintfArg Word

Since: base-2.1

Instance details

Defined in Text.Printf

Methods

formatArg :: Word -> FieldFormatter #

parseFormat :: Word -> ModifierParser #

Storable Word

Since: base-2.1

Instance details

Defined in Foreign.Storable

Methods

sizeOf :: Word -> Int #

alignment :: Word -> Int #

peekElemOff :: Ptr Word -> Int -> IO Word #

pokeElemOff :: Ptr Word -> Int -> Word -> IO () #

peekByteOff :: Ptr b -> Int -> IO Word #

pokeByteOff :: Ptr b -> Int -> Word -> IO () #

peek :: Ptr Word -> IO Word #

poke :: Ptr Word -> Word -> IO () #

PrimType Word 
Instance details

Defined in Basement.PrimType

Associated Types

type PrimSize Word :: Nat #

Methods

primSizeInBytes :: Proxy Word -> CountOf Word8 #

primShiftToBytes :: Proxy Word -> Int #

primBaUIndex :: ByteArray# -> Offset Word -> Word #

primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> prim Word #

primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Word -> Word -> prim () #

primAddrIndex :: Addr# -> Offset Word -> Word #

primAddrRead :: PrimMonad prim => Addr# -> Offset Word -> prim Word #

primAddrWrite :: PrimMonad prim => Addr# -> Offset Word -> Word -> prim () #

PrimMemoryComparable Word 
Instance details

Defined in Basement.PrimType

Subtractive Word 
Instance details

Defined in Basement.Numerical.Subtractive

Associated Types

type Difference Word :: Type #

Methods

(-) :: Word -> Word -> Difference Word #

Binary Word 
Instance details

Defined in Data.Binary.Class

Methods

put :: Word -> Put #

get :: Get Word #

putList :: [Word] -> Put #

FromField Word

Accepts an unsigned decimal number. Ignores whitespace.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser Word #

ToField Word

Uses decimal encoding.

Instance details

Defined in Data.Csv.Conversion

Methods

toField :: Word -> Field #

Default Word 
Instance details

Defined in Data.Default.Class

Methods

def :: Word #

Prim Word 
Instance details

Defined in Data.Primitive.Types

Methods

sizeOf# :: Word -> Int# #

alignment# :: Word -> Int# #

indexByteArray# :: ByteArray# -> Int# -> Word #

readByteArray# :: MutableByteArray# s -> Int# -> State# s -> (#State# s, Word#) #

writeByteArray# :: MutableByteArray# s -> Int# -> Word -> State# s -> State# s #

setByteArray# :: MutableByteArray# s -> Int# -> Int# -> Word -> State# s -> State# s #

indexOffAddr# :: Addr# -> Int# -> Word #

readOffAddr# :: Addr# -> Int# -> State# s -> (#State# s, Word#) #

writeOffAddr# :: Addr# -> Int# -> Word -> State# s -> State# s #

setOffAddr# :: Addr# -> Int# -> Int# -> Word -> State# s -> State# s #

Unbox Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Variate Word 
Instance details

Defined in System.Random.MWC

Methods

uniform :: PrimMonad m => Gen (PrimState m) -> m Word

uniformR :: PrimMonad m => (Word, Word) -> Gen (PrimState m) -> m Word

IArray UArray Word 
Instance details

Defined in Data.Array.Base

Methods

bounds :: Ix i => UArray i Word -> (i, i) #

numElements :: Ix i => UArray i Word -> Int

unsafeArray :: Ix i => (i, i) -> [(Int, Word)] -> UArray i Word

unsafeAt :: Ix i => UArray i Word -> Int -> Word

unsafeReplace :: Ix i => UArray i Word -> [(Int, Word)] -> UArray i Word

unsafeAccum :: Ix i => (Word -> e' -> Word) -> UArray i Word -> [(Int, e')] -> UArray i Word

unsafeAccumArray :: Ix i => (Word -> e' -> Word) -> Word -> (i, i) -> [(Int, e')] -> UArray i Word

Vector Vector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Word -> m (Vector Word) #

basicUnsafeThaw :: PrimMonad m => Vector Word -> m (Mutable Vector (PrimState m) Word) #

basicLength :: Vector Word -> Int #

basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word #

basicUnsafeIndexM :: Monad m => Vector Word -> Int -> m Word #

basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Word -> Vector Word -> m () #

elemseq :: Vector Word -> Word -> b -> b #

MVector MVector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

Methods

basicLength :: MVector s Word -> Int #

basicUnsafeSlice :: Int -> Int -> MVector s Word -> MVector s Word #

basicOverlaps :: MVector s Word -> MVector s Word -> Bool #

basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Word) #

basicInitialize :: PrimMonad m => MVector (PrimState m) Word -> m () #

basicUnsafeReplicate :: PrimMonad m => Int -> Word -> m (MVector (PrimState m) Word) #

basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Word -> Int -> m Word #

basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Word -> Int -> Word -> m () #

basicClear :: PrimMonad m => MVector (PrimState m) Word -> m () #

basicSet :: PrimMonad m => MVector (PrimState m) Word -> Word -> m () #

basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () #

basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Word -> MVector (PrimState m) Word -> m () #

basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Word -> Int -> m (MVector (PrimState m) Word) #

CDF StdUniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: StdUniform Word -> Word -> Double

CDF Uniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

cdf :: Uniform Word -> Word -> Double

Distribution StdUniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: StdUniform Word -> RVar Word

rvarT :: StdUniform Word -> RVarT n Word

Distribution Uniform Word 
Instance details

Defined in Data.Random.Distribution.Uniform

Methods

rvar :: Uniform Word -> RVar Word

rvarT :: Uniform Word -> RVarT n Word

MArray IOUArray Word IO 
Instance details

Defined in Data.Array.IO.Internals

Methods

getBounds :: Ix i => IOUArray i Word -> IO (i, i) #

getNumElements :: Ix i => IOUArray i Word -> IO Int

newArray :: Ix i => (i, i) -> Word -> IO (IOUArray i Word) #

newArray_ :: Ix i => (i, i) -> IO (IOUArray i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> IO (IOUArray i Word)

unsafeRead :: Ix i => IOUArray i Word -> Int -> IO Word

unsafeWrite :: Ix i => IOUArray i Word -> Int -> Word -> IO ()

Generic1 (URec Word :: k -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (URec Word) :: k -> Type #

Methods

from1 :: URec Word a -> Rep1 (URec Word) a #

to1 :: Rep1 (URec Word) a -> URec Word a #

(Real b, Distribution (Poisson b) Word) => CDF (Poisson b) Word 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

cdf :: Poisson b Word -> Word -> Double

(Real b, Distribution (Binomial b) Word) => CDF (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

cdf :: Binomial b Word -> Word -> Double

(RealFloat b, Distribution StdUniform b, Distribution (Erlang Word) b, Distribution (Binomial b) Word) => Distribution (Poisson b) Word 
Instance details

Defined in Data.Random.Distribution.Poisson

Methods

rvar :: Poisson b Word -> RVar Word

rvarT :: Poisson b Word -> RVarT n Word

(Floating b, Ord b, Distribution Beta b, Distribution StdUniform b) => Distribution (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

rvar :: Binomial b Word -> RVar Word

rvarT :: Binomial b Word -> RVarT n Word

(Real b, Distribution (Binomial b) Word) => PDF (Binomial b) Word 
Instance details

Defined in Data.Random.Distribution.Binomial

Methods

pdf :: Binomial b Word -> Word -> Double

logPdf :: Binomial b Word -> Word -> Double

MArray (STUArray s) Word (ST s) 
Instance details

Defined in Data.Array.Base

Methods

getBounds :: Ix i => STUArray s i Word -> ST s (i, i) #

getNumElements :: Ix i => STUArray s i Word -> ST s Int

newArray :: Ix i => (i, i) -> Word -> ST s (STUArray s i Word) #

newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Word) #

unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Word)

unsafeRead :: Ix i => STUArray s i Word -> Int -> ST s Word

unsafeWrite :: Ix i => STUArray s i Word -> Int -> Word -> ST s ()

Functor (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Foldable (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => URec Word m -> m #

foldMap :: Monoid m => (a -> m) -> URec Word a -> m #

foldr :: (a -> b -> b) -> b -> URec Word a -> b #

foldr' :: (a -> b -> b) -> b -> URec Word a -> b #

foldl :: (b -> a -> b) -> b -> URec Word a -> b #

foldl' :: (b -> a -> b) -> b -> URec Word a -> b #

foldr1 :: (a -> a -> a) -> URec Word a -> a #

foldl1 :: (a -> a -> a) -> URec Word a -> a #

toList :: URec Word a -> [a] #

null :: URec Word a -> Bool #

length :: URec Word a -> Int #

elem :: Eq a => a -> URec Word a -> Bool #

maximum :: Ord a => URec Word a -> a #

minimum :: Ord a => URec Word a -> a #

sum :: Num a => URec Word a -> a #

product :: Num a => URec Word a -> a #

Traversable (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a -> f b) -> URec Word a -> f (URec Word b) #

sequenceA :: Applicative f => URec Word (f a) -> f (URec Word a) #

mapM :: Monad m => (a -> m b) -> URec Word a -> m (URec Word b) #

sequence :: Monad m => URec Word (m a) -> m (URec Word a) #

Eq (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(==) :: URec Word p -> URec Word p -> Bool #

(/=) :: URec Word p -> URec Word p -> Bool #

Ord (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

compare :: URec Word p -> URec Word p -> Ordering #

(<) :: URec Word p -> URec Word p -> Bool #

(<=) :: URec Word p -> URec Word p -> Bool #

(>) :: URec Word p -> URec Word p -> Bool #

(>=) :: URec Word p -> URec Word p -> Bool #

max :: URec Word p -> URec Word p -> URec Word p #

min :: URec Word p -> URec Word p -> URec Word p #

Show (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

showsPrec :: Int -> URec Word p -> ShowS #

show :: URec Word p -> String #

showList :: [URec Word p] -> ShowS #

Generic (URec Word p) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (URec Word p) :: Type -> Type #

Methods

from :: URec Word p -> Rep (URec Word p) x #

to :: Rep (URec Word p) x -> URec Word p #

type PrimSize Word 
Instance details

Defined in Basement.PrimType

type PrimSize Word = 8
type Difference Word 
Instance details

Defined in Basement.Numerical.Subtractive

type Difference Word = Word
type NatNumMaxBound Word 
Instance details

Defined in Basement.Nat

type NatNumMaxBound Word = NatNumMaxBound Word64
type Unsigned Word 
Instance details

Defined in Data.Bytes.Signed

type Unsigned Word = Word
type Signed Word 
Instance details

Defined in Data.Bytes.Signed

type Signed Word = Int
newtype Vector Word 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype Vector Word = V_Word (Vector Word)
type Unsigned Word 
Instance details

Defined in System.Random.MWC

type Unsigned Word = Word
data URec Word (p :: k)

Used for marking occurrences of Word#

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

data URec Word (p :: k) = UWord {}
newtype MVector s Word 
Instance details

Defined in Data.Vector.Unboxed.Base

newtype MVector s Word = MV_Word (MVector s Word)
type Rep1 (URec Word :: k -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep1 (URec Word :: k -> Type) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: k -> Type)))
type Rep (URec Word p)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

type Rep (URec Word p) = D1 (MetaData "URec" "GHC.Generics" "base" False) (C1 (MetaCons "UWord" PrefixI True) (S1 (MetaSel (Just "uWord#") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (UWord :: Type -> Type)))

data Either a b #

The Either type represents values with two possibilities: a value of type Either a b is either Left a or Right b.

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 @@ -387,33 +525,13 @@ >>> :} 

>>> parseMultiple
 Left "parse error"
-

Constructors

Left a 
Right b 
Instances
Swapped Either 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: (Profunctor p, Functor f) => p (Either b a) (f (Either d c)) -> p (Either a b) (f (Either c d)) #

Bifunctor Either

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d #

first :: (a -> b) -> Either a c -> Either b c #

second :: (b -> c) -> Either a b -> Either a c #

Bitraversable Either

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) #

Bifoldable Either

Since: base-4.10.0.0

Instance details

Defined in Data.Bifoldable

Methods

bifold :: Monoid m => Either m m -> m #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Either a b -> m #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Either a b -> c #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Either a b -> c #

Eq2 Either

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Either a c -> Either b d -> Bool #

Ord2 Either

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Either a c -> Either b d -> Ordering #

Read2 Either

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 (Either a b) #

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] #

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) #

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] #

Show2 Either

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 -> Either a b -> ShowS #

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Either a b] -> ShowS #

NFData2 Either

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () #

Hashable2 Either 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int

Bitraversable1 Either 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Either a c -> f (Either b d)

bisequence1 :: Apply f => Either (f a) (f b) -> f (Either a b)

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

MonadFix (Either e)

Since: base-4.3.0.0

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Either e a) -> Either e a #

Applicative (Either e)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

pure :: a -> Either e a #

(<*>) :: Either e (a -> b) -> Either e a -> Either e b #

liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c #

(*>) :: Either e a -> Either e b -> Either e b #

(<*) :: Either e a -> Either e b -> Either e a #

Foldable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Either a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

toList :: Either a a0 -> [a0] #

null :: Either a a0 -> Bool #

length :: Either a a0 -> Int #

elem :: Eq a0 => a0 -> Either a a0 -> Bool #

maximum :: Ord a0 => Either a a0 -> a0 #

minimum :: Ord a0 => Either a a0 -> a0 #

sum :: Num a0 => Either a a0 -> a0 #

product :: Num a0 => Either a a0 -> a0 #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Eq a => Eq1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a0 -> b -> Bool) -> Either a a0 -> Either a b -> Bool #

Ord a => Ord1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering #

Read a => Read1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) #

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] #

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) #

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] #

Show a => Show1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Either a a0 -> ShowS #

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Either a a0] -> ShowS #

MonadFailure (Either a) 
Instance details

Defined in Basement.Monad

Associated Types

type Failure (Either a) :: * #

Methods

mFail :: Failure (Either a) -> Either a () #

NFData a => NFData1 (Either a)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a0 -> ()) -> Either a a0 -> () #

Hashable a => Hashable1 (Either a) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int

Apply (Either a) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Either a (a0 -> b) -> Either a a0 -> Either a b

(.>) :: Either a a0 -> Either a b -> Either a b

(<.) :: Either a a0 -> Either a b -> Either a a0

liftF2 :: (a0 -> b -> c) -> Either a a0 -> Either a b -> Either a c

Bind (Either a) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Either a a0 -> (a0 -> Either a b) -> Either a b

join :: Either a (Either a a0) -> Either a a0

e ~ SomeException => MonadCatch (Either e) 
Instance details

Defined in Control.Monad.Catch

Methods

catch :: Exception e0 => Either e a -> (e0 -> Either e a) -> Either e a

e ~ SomeException => MonadMask (Either e) 
Instance details

Defined in Control.Monad.Catch

Methods

mask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b

uninterruptibleMask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b

generalBracket :: Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c)

e ~ SomeException => MonadThrow (Either e) 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e0 => e0 -> Either e a

Generic1 (Either a :: * -> *) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (Either a) :: k -> * #

Methods

from1 :: Either a a0 -> Rep1 (Either a) a0 #

to1 :: Rep1 (Either a) a0 -> Either a a0 #

MonadBaseControl (Either e) (Either e) 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM (Either e) a :: *

Methods

liftBaseWith :: (RunInBase (Either e) (Either e) -> Either e a) -> Either e a

restoreM :: StM (Either e) a -> Either e a

(Eq a, Eq b) => Eq (Either a b) 
Instance details

Defined in Data.Either

Methods

(==) :: Either a b -> Either a b -> Bool #

(/=) :: Either a b -> Either a b -> Bool #

(Ord a, Ord b) => Ord (Either a b) 
Instance details

Defined in Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering #

(<) :: Either a b -> Either a b -> Bool #

(<=) :: Either a b -> Either a b -> Bool #

(>) :: Either a b -> Either a b -> Bool #

(>=) :: Either a b -> Either a b -> Bool #

max :: Either a b -> Either a b -> Either a b #

min :: Either a b -> Either a b -> Either a b #

(Read a, Read b) => Read (Either a b) 
Instance details

Defined in Data.Either

Methods

readsPrec :: Int -> ReadS (Either a b) #

readList :: ReadS [Either a b] #

readPrec :: ReadPrec (Either a b) #

readListPrec :: ReadPrec [Either a b] #

(Show a, Show b) => Show (Either a b) 
Instance details

Defined in Data.Either

Methods

showsPrec :: Int -> Either a b -> ShowS #

show :: Either a b -> String #

showList :: [Either a b] -> ShowS #

Generic (Either a b) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Either a b) :: * -> * #

Methods

from :: Either a b -> Rep (Either a b) x #

to :: Rep (Either a b) x -> Either a b #

Semigroup (Either a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Either

Methods

(<>) :: Either a b -> Either a b -> Either a b #

sconcat :: NonEmpty (Either a b) -> Either a b #

stimes :: Integral b0 => b0 -> Either a b -> Either a b #

(Lift a, Lift b) => Lift (Either a b) 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Either a b -> Q Exp #

(NFData a, NFData b) => NFData (Either a b) 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Either a b -> () #

(Binary a, Binary b) => Binary (Either a b) 
Instance details

Defined in Data.Binary.Class

Methods

put :: Either a b -> Put #

get :: Get (Either a b) #

putList :: [Either a b] -> Put #

(Hashable a, Hashable b) => Hashable (Either a b) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Either a b -> Int

hash :: Either a b -> Int

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> Sum f g a -> f0 (Sum f g b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> Product f g a -> f0 (Product f g b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

itraversed :: (Indexable (Either i j) p, Applicative f0) => p a (f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> Sum f g a -> f0 (Sum f g b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> Product f g a -> f0 (Product f g b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :*: g) a -> (f :*: g) b #

imapped :: (Indexable (Either i j) p, Settable f0) => p a (f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> Sum f g a -> f0 (Sum f g a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> Product f g a -> f0 (Product f g a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> (f :+: g) a -> f0 ((f :+: g) a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m #

ifolded :: (Indexable (Either i j) p, Contravariant f0, Applicative f0) => p a (f0 a) -> (f :*: g) a -> f0 ((f :*: g) a) #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

type Failure (Either a) 
Instance details

Defined in Basement.Monad

type Failure (Either a) = a
type StM (Either e) a 
Instance details

Defined in Control.Monad.Trans.Control

type StM (Either e) a = a
type Rep1 (Either a :: * -> *) 
Instance details

Defined in GHC.Generics

type Rep1 (Either a :: * -> *) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Rep (Either a b) 
Instance details

Defined in GHC.Generics

type Rep (Either a b) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b)))

odd :: Integral a => a -> Bool #

even :: Integral a => a -> Bool #

id :: a -> a #

Identity function.

id x = x

maybe :: b -> (a -> b) -> Maybe a -> b #

The maybe function takes a default value, a function, and a Maybe - value. If the Maybe value is Nothing, the function returns the - default value. Otherwise, it applies the function to the value inside - the Just and returns the result.

Examples

Expand

Basic usage:

>>> maybe False odd (Just 3)
-True
-
>>> maybe False odd Nothing
-False
-

Read an integer from a string using readMaybe. If we succeed, - return twice the integer; that is, apply (*2) to it. If instead - we fail to parse an integer, return 0 by default:

>>> import Text.Read ( readMaybe )
->>> maybe 0 (*2) (readMaybe "5")
-10
->>> maybe 0 (*2) (readMaybe "")
-0
-

Apply show to a Maybe Int. If we have Just n, we want to show - the underlying Int n. But if we have Nothing, we return the - empty string instead of (for example) "Nothing":

>>> maybe "" show (Just 5)
-"5"
->>> maybe "" show Nothing
-""
-

type String = [Char] #

A String is a list of characters. String constants in Haskell are values +

Constructors

Left a 
Right b 
Instances
Bitraversable Either

Since: base-4.10.0.0

Instance details

Defined in Data.Bitraversable

Methods

bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) #

Bifoldable Either

Since: base-4.10.0.0

Instance details

Defined in Data.Bifoldable

Methods

bifold :: Monoid m => Either m m -> m #

bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Either a b -> m #

bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Either a b -> c #

bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Either a b -> c #

Bifunctor Either

Since: base-4.8.0.0

Instance details

Defined in Data.Bifunctor

Methods

bimap :: (a -> b) -> (c -> d) -> Either a c -> Either b d #

first :: (a -> b) -> Either a c -> Either b c #

second :: (b -> c) -> Either a b -> Either a c #

Eq2 Either

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> Either a c -> Either b d -> Bool #

Ord2 Either

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> Either a c -> Either b d -> Ordering #

Read2 Either

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 (Either a b) #

liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] #

liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) #

liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] #

Show2 Either

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 -> Either a b -> ShowS #

liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [Either a b] -> ShowS #

NFData2 Either

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf2 :: (a -> ()) -> (b -> ()) -> Either a b -> () #

Hashable2 Either 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt2 :: (Int -> a -> Int) -> (Int -> b -> Int) -> Int -> Either a b -> Int #

Bitraversable1 Either 
Instance details

Defined in Data.Semigroup.Traversable.Class

Methods

bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Either a c -> f (Either b d) #

bisequence1 :: Apply f => Either (f a) (f b) -> f (Either a b) #

Swapped Either 
Instance details

Defined in Control.Lens.Iso

Methods

swapped :: Iso (Either a b) (Either c d) (Either b a) (Either d c) #

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

MonadFix (Either e)

Since: base-4.3.0.0

Instance details

Defined in Control.Monad.Fix

Methods

mfix :: (a -> Either e a) -> Either e a #

Applicative (Either e)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

pure :: a -> Either e a #

(<*>) :: Either e (a -> b) -> Either e a -> Either e b #

liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c #

(*>) :: Either e a -> Either e b -> Either e b #

(<*) :: Either e a -> Either e b -> Either e a #

Foldable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Foldable

Methods

fold :: Monoid m => Either a m -> m #

foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m #

foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b #

foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b #

foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 #

toList :: Either a a0 -> [a0] #

null :: Either a a0 -> Bool #

length :: Either a a0 -> Int #

elem :: Eq a0 => a0 -> Either a a0 -> Bool #

maximum :: Ord a0 => Either a a0 -> a0 #

minimum :: Ord a0 => Either a a0 -> a0 #

sum :: Num a0 => Either a a0 -> a0 #

product :: Num a0 => Either a a0 -> a0 #

Traversable (Either a)

Since: base-4.7.0.0

Instance details

Defined in Data.Traversable

Methods

traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) #

sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) #

mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) #

sequence :: Monad m => Either a (m a0) -> m (Either a a0) #

Eq a => Eq1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftEq :: (a0 -> b -> Bool) -> Either a a0 -> Either a b -> Bool #

Ord a => Ord1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering #

Read a => Read1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) #

liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] #

liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) #

liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] #

Show a => Show1 (Either a)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Classes

Methods

liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> Either a a0 -> ShowS #

liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [Either a a0] -> ShowS #

MonadFailure (Either a) 
Instance details

Defined in Basement.Monad

Associated Types

type Failure (Either a) :: Type #

Methods

mFail :: Failure (Either a) -> Either a () #

NFData a => NFData1 (Either a)

Since: deepseq-1.4.3.0

Instance details

Defined in Control.DeepSeq

Methods

liftRnf :: (a0 -> ()) -> Either a a0 -> () #

e ~ SomeException => MonadThrow (Either e) 
Instance details

Defined in Control.Monad.Catch

Methods

throwM :: Exception e0 => e0 -> Either e a #

e ~ SomeException => MonadCatch (Either e)

Since: exceptions-0.8.3

Instance details

Defined in Control.Monad.Catch

Methods

catch :: Exception e0 => Either e a -> (e0 -> Either e a) -> Either e a #

e ~ SomeException => MonadMask (Either e)

Since: exceptions-0.8.3

Instance details

Defined in Control.Monad.Catch

Methods

mask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b #

uninterruptibleMask :: ((forall a. Either e a -> Either e a) -> Either e b) -> Either e b #

generalBracket :: Either e a -> (a -> ExitCase b -> Either e c) -> (a -> Either e b) -> Either e (b, c) #

Hashable a => Hashable1 (Either a) 
Instance details

Defined in Data.Hashable.Class

Methods

liftHashWithSalt :: (Int -> a0 -> Int) -> Int -> Either a a0 -> Int #

Apply (Either a) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(<.>) :: Either a (a0 -> b) -> Either a a0 -> Either a b #

(.>) :: Either a a0 -> Either a b -> Either a b #

(<.) :: Either a a0 -> Either a b -> Either a a0 #

liftF2 :: (a0 -> b -> c) -> Either a a0 -> Either a b -> Either a c #

Bind (Either a) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

(>>-) :: Either a a0 -> (a0 -> Either a b) -> Either a b #

join :: Either a (Either a a0) -> Either a a0 #

Generic1 (Either a :: Type -> Type) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep1 (Either a) :: k -> Type #

Methods

from1 :: Either a a0 -> Rep1 (Either a) a0 #

to1 :: Rep1 (Either a) a0 -> Either a a0 #

MonadBaseControl (Either e) (Either e) 
Instance details

Defined in Control.Monad.Trans.Control

Associated Types

type StM (Either e) a :: Type #

Methods

liftBaseWith :: (RunInBase (Either e) (Either e) -> Either e a) -> Either e a #

restoreM :: StM (Either e) a -> Either e a #

(Eq a, Eq b) => Eq (Either a b)

Since: base-2.1

Instance details

Defined in Data.Either

Methods

(==) :: Either a b -> Either a b -> Bool #

(/=) :: Either a b -> Either a b -> Bool #

(Ord a, Ord b) => Ord (Either a b)

Since: base-2.1

Instance details

Defined in Data.Either

Methods

compare :: Either a b -> Either a b -> Ordering #

(<) :: Either a b -> Either a b -> Bool #

(<=) :: Either a b -> Either a b -> Bool #

(>) :: Either a b -> Either a b -> Bool #

(>=) :: Either a b -> Either a b -> Bool #

max :: Either a b -> Either a b -> Either a b #

min :: Either a b -> Either a b -> Either a b #

(Read a, Read b) => Read (Either a b)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

readsPrec :: Int -> ReadS (Either a b) #

readList :: ReadS [Either a b] #

readPrec :: ReadPrec (Either a b) #

readListPrec :: ReadPrec [Either a b] #

(Show a, Show b) => Show (Either a b)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

showsPrec :: Int -> Either a b -> ShowS #

show :: Either a b -> String #

showList :: [Either a b] -> ShowS #

Generic (Either a b) 
Instance details

Defined in GHC.Generics

Associated Types

type Rep (Either a b) :: Type -> Type #

Methods

from :: Either a b -> Rep (Either a b) x #

to :: Rep (Either a b) x -> Either a b #

Semigroup (Either a b)

Since: base-4.9.0.0

Instance details

Defined in Data.Either

Methods

(<>) :: Either a b -> Either a b -> Either a b #

sconcat :: NonEmpty (Either a b) -> Either a b #

stimes :: Integral b0 => b0 -> Either a b -> Either a b #

(Lift a, Lift b) => Lift (Either a b) 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

lift :: Either a b -> Q Exp #

(NFData a, NFData b) => NFData (Either a b) 
Instance details

Defined in Control.DeepSeq

Methods

rnf :: Either a b -> () #

(Hashable a, Hashable b) => Hashable (Either a b) 
Instance details

Defined in Data.Hashable.Class

Methods

hashWithSalt :: Int -> Either a b -> Int #

hash :: Either a b -> Int #

(Binary a, Binary b) => Binary (Either a b) 
Instance details

Defined in Data.Binary.Class

Methods

put :: Either a b -> Put #

get :: Get (Either a b) #

putList :: [Either a b] -> Put #

FromField a => FromField (Either Field a)

Left field if conversion failed, Right otherwise.

Instance details

Defined in Data.Csv.Conversion

Methods

parseField :: Field -> Parser (Either Field a) #

Corecursive (Either a b) 
Instance details

Defined in Data.Functor.Foldable

Methods

embed :: Base (Either a b) (Either a b) -> Either a b

ana :: (a0 -> Base (Either a b) a0) -> a0 -> Either a b

apo :: (a0 -> Base (Either a b) (Either (Either a b) a0)) -> a0 -> Either a b

postpro :: Recursive (Either a b) => (forall b0. Base (Either a b) b0 -> Base (Either a b) b0) -> (a0 -> Base (Either a b) a0) -> a0 -> Either a b

gpostpro :: (Recursive (Either a b), Monad m) => (forall b0. m (Base (Either a b) b0) -> Base (Either a b) (m b0)) -> (forall c. Base (Either a b) c -> Base (Either a b) c) -> (a0 -> Base (Either a b) (m a0)) -> a0 -> Either a b

Recursive (Either a b) 
Instance details

Defined in Data.Functor.Foldable

Methods

project :: Either a b -> Base (Either a b) (Either a b)

cata :: (Base (Either a b) a0 -> a0) -> Either a b -> a0

para :: (Base (Either a b) (Either a b, a0) -> a0) -> Either a b -> a0

gpara :: (Corecursive (Either a b), Comonad w) => (forall b0. Base (Either a b) (w b0) -> w (Base (Either a b) b0)) -> (Base (Either a b) (EnvT (Either a b) w a0) -> a0) -> Either a b -> a0

prepro :: Corecursive (Either a b) => (forall b0. Base (Either a b) b0 -> Base (Either a b) b0) -> (Base (Either a b) a0 -> a0) -> Either a b -> a0

gprepro :: (Corecursive (Either a b), Comonad w) => (forall b0. Base (Either a b) (w b0) -> w (Base (Either a b) b0)) -> (forall c. Base (Either a b) c -> Base (Either a b) c) -> (Base (Either a b) (w a0) -> a0) -> Either a b -> a0

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m #

ifolded :: IndexedFold (Either i j) (Sum f g a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m #

ifolded :: IndexedFold (Either i j) (Product f g a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m #

ifolded :: IndexedFold (Either i j) ((f :+: g) a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b #

(FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m #

ifolded :: IndexedFold (Either i j) ((f :*: g) a) a #

ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b #

ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Sum f g a -> Sum f g b #

imapped :: IndexedSetter (Either i j) (Sum f g a) (Sum f g b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> Product f g a -> Product f g b #

imapped :: IndexedSetter (Either i j) (Product f g a) (Product f g b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :+: g) a -> (f :+: g) b #

imapped :: IndexedSetter (Either i j) ((f :+: g) a) ((f :+: g) b) a b #

(FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

imap :: (Either i j -> a -> b) -> (f :*: g) a -> (f :*: g) b #

imapped :: IndexedSetter (Either i j) ((f :*: g) a) ((f :*: g) b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) #

itraversed :: IndexedTraversal (Either i j) (Sum f g a) (Sum f g b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) #

itraversed :: IndexedTraversal (Either i j) (Product f g a) (Product f g b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) #

itraversed :: IndexedTraversal (Either i j) ((f :+: g) a) ((f :+: g) b) a b #

(TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) 
Instance details

Defined in Control.Lens.Indexed

Methods

itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) #

itraversed :: IndexedTraversal (Either i j) ((f :*: g) a) ((f :*: g) b) a b #

type Failure (Either a) 
Instance details

Defined in Basement.Monad

type Failure (Either a) = a
type StM (Either e) a 
Instance details

Defined in Control.Monad.Trans.Control

type StM (Either e) a = a
type Rep1 (Either a :: Type -> Type)

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep1 (Either a :: Type -> Type) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1))
type Rep (Either a b)

Since: base-4.6.0.0

Instance details

Defined in GHC.Generics

type Rep (Either a b) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b)))
type Base (Either a b) 
Instance details

Defined in Data.Functor.Foldable

type Base (Either a b) = (Const (Either a b) :: Type -> Type)

odd :: Integral a => a -> Bool #

even :: Integral a => a -> Bool #

type String = [Char] #

A String is a list of characters. String constants in Haskell are values of type String.

type ShowS = String -> String #

The shows functions return a function that prepends the output String to an existing String. This allows constant-time - concatenation of results using function composition.

error :: HasCallStack => [Char] -> a #

error stops execution and displays an error message.

writeFile :: FilePath -> String -> IO () #

The computation writeFile file str function writes the string str, + concatenation of results using function composition.

error :: HasCallStack => [Char] -> a #

error stops execution and displays an error message.

writeFile :: FilePath -> String -> IO () #

The computation writeFile file str function writes the string str, to the file file.

readFile :: FilePath -> IO String #

The readFile function reads a file and returns the contents of the file as a string. - The file is read lazily, on demand, as with getContents.

unlines :: [String] -> String #

unlines is an inverse operation to lines. + The file is read lazily, on demand, as with getContents.

id :: a -> a #

Identity function.

id x = x

unlines :: [String] -> String #

unlines is an inverse operation to lines. It joins lines, after appending a terminating newline to each.

>>> unlines ["Hello", "World", "!"]
 "Hello\nWorld\n!\n"

lines :: String -> [String] #

lines breaks a string up into a list of strings at newline @@ -441,22 +559,11 @@ handle which can then be used to operate on the contents of that file.

(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #

Same as >>=, but with the arguments interchanged.

mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m () #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see - mapM.

As of base 4.8.0.0, mapM_ is just traverse_, specialized to + mapM.

As of base 4.8.0.0, mapM_ is just traverse_, specialized to Monad.

sequence_ :: (Foldable t, Monad m) => t (m a) -> m () #

Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the - results see sequence.

As of base 4.8.0.0, sequence_ is just sequenceA_, specialized - to Monad.

either :: (a -> c) -> (b -> c) -> Either a b -> c #

Case analysis for the Either type. - If the value is Left a, apply the first function to a; - if it is Right b, apply the second function to b.

Examples

Expand

We create two values of type Either String Int, one using the - Left constructor and another using the Right constructor. Then - we apply "either" the length function (if we have a String) - or the "times-two" function (if we have an Int):

>>> let s = Left "foo" :: Either String Int
->>> let n = Right 3 :: Either String Int
->>> either length (*2) s
-3
->>> either length (*2) n
-6
-

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #

An infix synonym for fmap.

The name of this operator is an allusion to $. + results see sequence.

As of base 4.8.0.0, sequence_ is just sequenceA_, specialized + to Monad.

(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #

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
@@ -475,7 +582,7 @@

read :: Read a => String -> a #

The read function reads input from a string, which must be completely consumed by the input process. read fails with an error if the parse is unsuccessful, and it is therefore discouraged from being used in - real applications. Use readMaybe or readEither for safe alternatives.

>>> read "123" :: Int
+ real applications. Use readMaybe or readEither for safe alternatives.
>>> read "123" :: Int
 123
 
>>> read "hello" :: Int
 *** Exception: Prelude.read: no parse
@@ -485,18 +592,18 @@
  to a file.  To write a value of any printable type, as with print,
  use the show function to convert the value to a string first.
main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])

getContents :: IO String #

The getContents operation returns all user input as a single string, which is read lazily as it is needed - (same as hGetContents stdin).

getLine :: IO String #

Read a line from the standard input device - (same as hGetLine stdin).

getChar :: IO Char #

Read a character from the standard input device - (same as hGetChar stdin).

putStrLn :: String -> IO () #

The same as putStr, but adds a newline character.

putStr :: String -> IO () #

Write a string to the standard output device - (same as hPutStr stdout).

putChar :: Char -> IO () #

Write a character to the standard output device - (same as hPutChar stdout).

ioError :: IOError -> IO a #

Raise an IOError in the IO monad.

userError :: String -> IOError #

Construct an IOError value with a string describing the error. + (same as hGetContents stdin).

getLine :: IO String #

Read a line from the standard input device + (same as hGetLine stdin).

getChar :: IO Char #

Read a character from the standard input device + (same as hGetChar stdin).

putStrLn :: String -> IO () #

The same as putStr, but adds a newline character.

putStr :: String -> IO () #

Write a string to the standard output device + (same as hPutStr stdout).

putChar :: Char -> IO () #

Write a character to the standard output device + (same as hPutChar stdout).

ioError :: IOError -> IO a #

Raise an IOException in the IO monad.

userError :: String -> IOError #

Construct an IOException value with a string describing the error. The fail method of the IO instance of the Monad class raises a userError, thus:

instance Monad IO where
   ...
-  fail s = ioError (userError s)

type IOError = IOException #

The Haskell 2010 type for exceptions in the IO monad. - Any I/O operation may raise an IOError instead of returning a result. + fail s = ioError (userError s)

type IOError = IOException #

The Haskell 2010 type for exceptions in the IO monad. + Any I/O operation may raise an IOException instead of returning a result. For a more general type of exception, including also those that arise - in pure code, see Exception.

In Haskell 2010, this is an opaque type.

notElem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 #

notElem is the negation of elem.

all :: Foldable t => (a -> Bool) -> t a -> Bool #

Determines whether all elements of the structure satisfy the predicate.

any :: Foldable t => (a -> Bool) -> t a -> Bool #

Determines whether any element of the structure satisfies the predicate.

or :: Foldable t => t Bool -> Bool #

or returns the disjunction of a container of Bools. For the + in pure code, see Exception.

In Haskell 2010, this is an opaque type.

notElem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 #

notElem is the negation of elem.

all :: Foldable t => (a -> Bool) -> t a -> Bool #

Determines whether all elements of the structure satisfy the predicate.

any :: Foldable t => (a -> Bool) -> t a -> Bool #

Determines whether any element of the structure satisfies the predicate.

or :: Foldable t => t Bool -> Bool #

or returns the disjunction of a container of Bools. For the result to be False, the container must be finite; True, however, results from a True value finitely far from the left end.

and :: Foldable t => t Bool -> Bool #

and returns the conjunction of a container of Bools. For the result to be True, the container must be finite; False, however, @@ -507,7 +614,18 @@

words :: String -> [String] #

words breaks a string up into a list of words, which were delimited by white space.

>>> words "Lorem ipsum\ndolor"
 ["Lorem","ipsum","dolor"]
-

reads :: Read a => ReadS a #

equivalent to readsPrec with a precedence of 0.

lex :: ReadS String #

The lex function reads a single lexeme from the input, discarding +

reads :: Read a => ReadS a #

equivalent to readsPrec with a precedence of 0.

either :: (a -> c) -> (b -> c) -> Either a b -> c #

Case analysis for the Either type. + If the value is Left a, apply the first function to a; + if it is Right b, apply the second function to b.

Examples

Expand

We create two values of type Either String Int, one using the + Left constructor and another using the Right constructor. Then + we apply "either" the length function (if we have a String) + or the "times-two" function (if we have an Int):

>>> let s = Left "foo" :: Either String Int
+>>> let n = Right 3 :: Either String Int
+>>> either length (*2) s
+3
+>>> either length (*2) n
+6
+

lex :: ReadS String #

The lex function reads a single lexeme from the input, discarding initial white space, and returning the characters that constitute the lexeme. If the input string contains only white space, lex returns a single successful `lexeme' consisting of the empty string. (Thus @@ -517,7 +635,7 @@ parentheses.

readParen False p parses what p parses, but optionally surrounded with parentheses.

type ReadS a = String -> [(a, String)] #

A parser for a type a, represented as a function that takes a String and returns a list of possible parses as (a,String) pairs.

Note that this kind of backtracking parser is very inefficient; - reading a large structure may be quite slow (cf ReadP).

lcm :: Integral a => a -> a -> a #

lcm x y is the smallest positive integer that both x and y divide.

gcd :: Integral a => a -> a -> a #

gcd x y is the non-negative factor of both x and y of which + reading a large structure may be quite slow (cf ReadP).

lcm :: Integral a => a -> a -> a #

lcm x y is the smallest positive integer that both x and y divide.

gcd :: Integral a => a -> a -> a #

gcd x y is the non-negative factor of both x and y of which every common factor of x and y is also a factor; for example gcd 4 2 = 2, gcd (-4) 6 = 2, gcd 0 4 = 4. gcd 0 0 = 0. (That is, the common divisor that is "greatest" in the divisibility @@ -535,13 +653,13 @@ For example, zipWith (+) is applied to two lists to produce the list of corresponding sums.

zipWith is right-lazy:

zipWith f [] _|_ = []

zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] #

zip3 takes three lists and returns a list of triples, analogous to zip.

(!!) :: [a] -> Int -> a infixl 9 #

List index (subscript) operator, starting from 0. - It is an instance of the more general genericIndex, + It is an instance of the more general genericIndex, which takes an index of any integral type.

lookup :: Eq a => a -> [(a, b)] -> Maybe b #

lookup key assocs looks up a key in an association list.

reverse :: [a] -> [a] #

reverse xs returns the elements of xs in reverse order. xs must be finite.

break :: (a -> Bool) -> [a] -> ([a], [a]) #

break, applied to a predicate p and a list xs, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that do not satisfy p and second element is the remainder of the list:

break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4])
 break (< 9) [1,2,3] == ([],[1,2,3])
-break (> 9) [1,2,3] == ([1,2,3],[])

break p is equivalent to span (not . p).

span :: (a -> Bool) -> [a] -> ([a], [a]) #

span, applied to a predicate p and a list xs, returns a tuple where +break (> 9) [1,2,3] == ([1,2,3],[])

break p is equivalent to span (not . p).

span :: (a -> Bool) -> [a] -> ([a], [a]) #

span, applied to a predicate p and a list xs, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that satisfy p and second element is the remainder of the list:

span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4])
 span (< 9) [1,2,3] == ([1,2,3],[])
@@ -554,21 +672,21 @@
 splitAt 0 [1,2,3] == ([],[1,2,3])
 splitAt (-1) [1,2,3] == ([],[1,2,3])

It is equivalent to (take n xs, drop n xs) when n is not _|_ (splitAt _|_ xs = _|_). - splitAt is an instance of the more general genericSplitAt, + splitAt is an instance of the more general genericSplitAt, in which n may be of any integral type.

drop :: Int -> [a] -> [a] #

drop n xs returns the suffix of xs - after the first n elements, or [] if n > length xs:

drop 6 "Hello World!" == "World!"
+ after the first n elements, or [] if n > length xs:
drop 6 "Hello World!" == "World!"
 drop 3 [1,2,3,4,5] == [4,5]
 drop 3 [1,2] == []
 drop 3 [] == []
 drop (-1) [1,2] == [1,2]
-drop 0 [1,2] == [1,2]
It is an instance of the more general genericDrop,
+drop 0 [1,2] == [1,2]

It is an instance of the more general genericDrop, in which n may be of any integral type.

take :: Int -> [a] -> [a] #

take n, applied to a list xs, returns the prefix of xs - of length n, or xs itself if n > length xs:

take 5 "Hello World!" == "Hello"
+ of length n, or xs itself if n > length xs:
take 5 "Hello World!" == "Hello"
 take 3 [1,2,3,4,5] == [1,2,3]
 take 3 [1,2] == [1,2]
 take 3 [] == []
 take (-1) [1,2] == []
-take 0 [1,2] == []
It is an instance of the more general genericTake,
+take 0 [1,2] == []

It is an instance of the more general genericTake, in which n may be of any integral type.

dropWhile :: (a -> Bool) -> [a] -> [a] #

dropWhile p xs returns the suffix remaining after takeWhile p xs:

dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3]
 dropWhile (< 9) [1,2,3] == []
 dropWhile (< 0) [1,2,3] == [1,2,3]

takeWhile :: (a -> Bool) -> [a] -> [a] #

takeWhile, applied to a predicate p and a list xs, returns the @@ -578,12 +696,32 @@ the infinite repetition of the original list. It is the identity on infinite lists.

replicate :: Int -> a -> [a] #

replicate n x is a list of length n with x the value of every element. - It is an instance of the more general genericReplicate, + It is an instance of the more general genericReplicate, in which n may be of any integral type.

repeat :: a -> [a] #

repeat x is an infinite list, with x the value of every element.

iterate :: (a -> a) -> a -> [a] #

iterate f x returns an infinite list of repeated applications of f to x:

iterate f x == [x, f x, f (f x), ...]

Note that iterate is lazy, potentially leading to thunk build-up if the consumer doesn't force each iterate. See 'iterate\'' for a strict - variant of this function.

scanr1 :: (a -> a -> a) -> [a] -> [a] #

scanr1 is a variant of scanr that has no starting value argument.

scanl1 :: (a -> a -> a) -> [a] -> [a] #

scanl1 is a variant of scanl that has no starting value argument:

scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

init :: [a] -> [a] #

Return all the elements of a list except the last one. - The list must be non-empty.

last :: [a] -> a #

Extract the last element of a list, which must be finite and non-empty.

tail :: [a] -> [a] #

Extract the elements after the head of a list, which must be non-empty.

head :: [a] -> a #

Extract the first element of a list, which must be non-empty.

uncurry :: (a -> b -> c) -> (a, b) -> c #

uncurry converts a curried function to a function on pairs.

Examples

Expand
>>> uncurry (+) (1,2)
+ variant of this function.

scanr1 :: (a -> a -> a) -> [a] -> [a] #

scanr1 is a variant of scanr that has no starting value argument.

scanl1 :: (a -> a -> a) -> [a] -> [a] #

scanl1 is a variant of scanl that has no starting value argument:

scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

init :: [a] -> [a] #

Return all the elements of a list except the last one. + The list must be non-empty.

last :: [a] -> a #

Extract the last element of a list, which must be finite and non-empty.

tail :: [a] -> [a] #

Extract the elements after the head of a list, which must be non-empty.

head :: [a] -> a #

Extract the first element of a list, which must be non-empty.

maybe :: b -> (a -> b) -> Maybe a -> b #

The maybe function takes a default value, a function, and a Maybe + value. If the Maybe value is Nothing, the function returns the + default value. Otherwise, it applies the function to the value inside + the Just and returns the result.

Examples

Expand

Basic usage:

>>> maybe False odd (Just 3)
+True
+
>>> maybe False odd Nothing
+False
+

Read an integer from a string using readMaybe. If we succeed, + return twice the integer; that is, apply (*2) to it. If instead + we fail to parse an integer, return 0 by default:

>>> import Text.Read ( readMaybe )
+>>> maybe 0 (*2) (readMaybe "5")
+10
+>>> maybe 0 (*2) (readMaybe "")
+0
+

Apply show to a Maybe Int. If we have Just n, we want to show + the underlying Int n. But if we have Nothing, we return the + empty string instead of (for example) "Nothing":

>>> maybe "" show (Just 5)
+"5"
+>>> maybe "" show Nothing
+""
+

uncurry :: (a -> b -> c) -> (a, b) -> c #

uncurry converts a curried function to a function on pairs.

Examples

Expand
>>> uncurry (+) (1,2)
 3
 
>>> uncurry ($) (show, 1)
 "1"
@@ -603,36 +741,44 @@
 42
 
>>> map (const 42) [0..3]
 [42,42,42,42]
-

undefined :: HasCallStack => a #

A special case of error. +

undefined :: HasCallStack => a #

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.

errorWithoutStackTrace :: [Char] -> a #

A variant of error that does not produce a stack trace.

Since: base-4.9.0.0

join :: Monad m => m (m a) -> m a #

The join function is the conventional monad join operator. It is used to remove one level of monadic structure, projecting its - bound argument into the outer level.

class Applicative m => Monad (m :: * -> *) where #

The Monad class defines the basic operations over a monad, + bound argument into the outer level.

Examples

Expand

A common use of join is to run an IO computation returned from + an STM transaction, since STM transactions + can't perform IO directly. Recall that

atomically :: STM a -> IO a
+

is used to run STM transactions atomically. So, by + specializing the types of atomically and join to

atomically :: STM (IO b) -> IO (IO b)
+join       :: IO (IO b)  -> IO b
+

we can compose them as

join . atomically :: STM (IO b) -> IO b
+

to run an STM transaction and the IO action it + returns.

class Applicative m => Monad (m :: Type -> Type) where #

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.

Instances of Monad should satisfy the following laws:

Furthermore, the Monad and Applicative operations should relate as follows:

The above laws imply:

and that pure and (<*>) satisfy the applicative functor laws.

The instances of Monad for lists, Maybe and IO -defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 #

Sequentially compose two actions, passing any value produced +monadic expressions.

Instances of Monad should satisfy the following laws:

Furthermore, the Monad and Applicative operations should relate as follows:

The above laws imply:

and that pure and (<*>) satisfy the applicative functor laws.

The instances of Monad for lists, Maybe and IO +defined in the Prelude satisfy these laws.

Minimal complete definition

(>>=)

Methods

(>>=) :: m a -> (a -> m b) -> m b infixl 1 #

Sequentially compose two actions, passing any value produced by the first as an argument to the second.

(>>) :: m a -> m b -> m b infixl 1 #

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 #

Inject a value into the monadic type.

fail :: String -> m a #

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.

As part of the MonadFail proposal (MFP), this function is moved - to its own class MonadFail (see Control.Monad.Fail for more + to its own class MonadFail (see Control.Monad.Fail for more details). The definition here will be removed in a future - release.

Instances
Monad []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: [a] -> (a -> [b]) -> [b] #

(>>) :: [a] -> [b] -> [b] #

return :: a -> [a] #

fail :: String -> [a] #

Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Monad Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b #

(>>) :: Par1 a -> Par1 b -> Par1 b #

return :: a -> Par1 a #

fail :: String -> Par1 a #

Monad Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(>>=) :: Q a -> (a -> Q b) -> Q b #

(>>) :: Q a -> Q b -> Q b #

return :: a -> Q a #

fail :: String -> Q a #

Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Monad Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

(>>=) :: Complex a -> (a -> Complex b) -> Complex b #

(>>) :: Complex a -> Complex b -> Complex b #

return :: a -> Complex a #

fail :: String -> Complex a #

Monad Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Min a -> (a -> Min b) -> Min b #

(>>) :: Min a -> Min b -> Min b #

return :: a -> Min a #

fail :: String -> Min a #

Monad Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Max a -> (a -> Max b) -> Max b #

(>>) :: Max a -> Max b -> Max b #

return :: a -> Max a #

fail :: String -> Max a #

Monad First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Option a -> (a -> Option b) -> Option b #

(>>) :: Option a -> Option b -> Option b #

return :: a -> Option a #

fail :: String -> Option a #

Monad First 
Instance details

Defined in Data.Monoid

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last 
Instance details

Defined in Data.Monoid

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Dual a -> (a -> Dual b) -> Dual b #

(>>) :: Dual a -> Dual b -> Dual b #

return :: a -> Dual a #

fail :: String -> Dual a #

Monad Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Sum a -> (a -> Sum b) -> Sum b #

(>>) :: Sum a -> Sum b -> Sum b #

return :: a -> Sum a #

fail :: String -> Sum a #

Monad Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Product a -> (a -> Product b) -> Product b #

(>>) :: Product a -> Product b -> Product b #

return :: a -> Product a #

fail :: String -> Product a #

Monad Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(>>=) :: Down a -> (a -> Down b) -> Down b #

(>>) :: Down a -> Down b -> Down b #

return :: a -> Down a #

fail :: String -> Down a #

Monad ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

(>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b #

(>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #

return :: a -> ReadPrec a #

fail :: String -> ReadPrec a #

Monad ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b #

(>>) :: ReadP a -> ReadP b -> ReadP b #

return :: a -> ReadP a #

fail :: String -> ReadP a #

Monad NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b #

(>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #

return :: a -> NonEmpty a #

fail :: String -> NonEmpty a #

Monad PutM 
Instance details

Defined in Data.Binary.Put

Methods

(>>=) :: PutM a -> (a -> PutM b) -> PutM b #

(>>) :: PutM a -> PutM b -> PutM b #

return :: a -> PutM a #

fail :: String -> PutM a #

Monad Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

(>>=) :: Get a -> (a -> Get b) -> Get b #

(>>) :: Get a -> Get b -> Get b #

return :: a -> Get a #

fail :: String -> Get a #

Monad Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(>>=) :: Put a -> (a -> Put b) -> Put b #

(>>) :: Put a -> Put b -> Put b #

return :: a -> Put a #

fail :: String -> Put a #

Monad Tree 
Instance details

Defined in Data.Tree

Methods

(>>=) :: Tree a -> (a -> Tree b) -> Tree b #

(>>) :: Tree a -> Tree b -> Tree b #

return :: a -> Tree a #

fail :: String -> Tree a #

Monad Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b #

(>>) :: Seq a -> Seq b -> Seq b #

return :: a -> Seq a #

fail :: String -> Seq a #

Monad DList 
Instance details

Defined in Data.DList

Methods

(>>=) :: DList a -> (a -> DList b) -> DList b #

(>>) :: DList a -> DList b -> DList b #

return :: a -> DList a #

fail :: String -> DList a #

Monad V3 
Instance details

Defined in Linear.V3

Methods

(>>=) :: V3 a -> (a -> V3 b) -> V3 b #

(>>) :: V3 a -> V3 b -> V3 b #

return :: a -> V3 a #

fail :: String -> V3 a #

Monad V2 
Instance details

Defined in Linear.V2

Methods

(>>=) :: V2 a -> (a -> V2 b) -> V2 b #

(>>) :: V2 a -> V2 b -> V2 b #

return :: a -> V2 a #

fail :: String -> V2 a #

Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Monad Array 
Instance details

Defined in Data.Primitive.Array

Methods

(>>=) :: Array a -> (a -> Array b) -> Array b #

(>>) :: Array a -> Array b -> Array b #

return :: a -> Array a #

fail :: String -> Array a #

Monad Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Id a -> (a -> Id b) -> Id b #

(>>) :: Id a -> Id b -> Id b #

return :: a -> Id a #

fail :: String -> Id a #

Monad P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Box a -> (a -> Box b) -> Box b #

(>>) :: Box a -> Box b -> Box b #

return :: a -> Box a #

fail :: String -> Box a #

Monad Vector 
Instance details

Defined in Data.Vector

Methods

(>>=) :: Vector a -> (a -> Vector b) -> Vector b #

(>>) :: Vector a -> Vector b -> Vector b #

return :: a -> Vector a #

fail :: String -> Vector a #

Monad Root 
Instance details

Defined in Numeric.RootFinding

Methods

(>>=) :: Root a -> (a -> Root b) -> Root b #

(>>) :: Root a -> Root b -> Root b #

return :: a -> Root a #

fail :: String -> Root a #

Monad Log 
Instance details

Defined in Numeric.Log

Methods

(>>=) :: Log a -> (a -> Log b) -> Log b #

(>>) :: Log a -> Log b -> Log b #

return :: a -> Log a #

fail :: String -> Log a #

Monad Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(>>=) :: Interval a -> (a -> Interval b) -> Interval b #

(>>) :: Interval a -> Interval b -> Interval b #

return :: a -> Interval a #

fail :: String -> Interval a #

Monad V1 
Instance details

Defined in Linear.V1

Methods

(>>=) :: V1 a -> (a -> V1 b) -> V1 b #

(>>) :: V1 a -> V1 b -> V1 b #

return :: a -> V1 a #

fail :: String -> V1 a #

Monad Sh 
Instance details

Defined in Shelly.Base

Methods

(>>=) :: Sh a -> (a -> Sh b) -> Sh b #

(>>) :: Sh a -> Sh b -> Sh b #

return :: a -> Sh a #

fail :: String -> Sh a #

Monad V4 
Instance details

Defined in Linear.V4

Methods

(>>=) :: V4 a -> (a -> V4 b) -> V4 b #

(>>) :: V4 a -> V4 b -> V4 b #

return :: a -> V4 a #

fail :: String -> V4 a #

Monad Plucker 
Instance details

Defined in Linear.Plucker

Methods

(>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b #

(>>) :: Plucker a -> Plucker b -> Plucker b #

return :: a -> Plucker a #

fail :: String -> Plucker a #

Monad Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

(>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b #

(>>) :: Quaternion a -> Quaternion b -> Quaternion b #

return :: a -> Quaternion a #

fail :: String -> Quaternion a #

Monad V0 
Instance details

Defined in Linear.V0

Methods

(>>=) :: V0 a -> (a -> V0 b) -> V0 b #

(>>) :: V0 a -> V0 b -> V0 b #

return :: a -> V0 a #

fail :: String -> V0 a #

Monad Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(>>=) :: Stream a -> (a -> Stream b) -> Stream b #

(>>) :: Stream a -> Stream b -> Stream b #

return :: a -> Stream a #

fail :: String -> Stream a #

Monad IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: IResult a -> (a -> IResult b) -> IResult b #

(>>) :: IResult a -> IResult b -> IResult b #

return :: a -> IResult a #

fail :: String -> IResult a #

Monad Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Result a -> (a -> Result b) -> Result b #

(>>) :: Result a -> Result b -> Result b #

return :: a -> Result a #

fail :: String -> Result a #

Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Monad (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: U1 a -> (a -> U1 b) -> U1 b #

(>>) :: U1 a -> U1 b -> U1 b #

return :: a -> U1 a #

fail :: String -> U1 a #

Monoid a => Monad ((,) a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) #

(>>) :: (a, a0) -> (a, b) -> (a, b) #

return :: a0 -> (a, a0) #

fail :: String -> (a, a0) #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Monad m => Monad (WrappedMonad m) 
Instance details

Defined in Control.Applicative

Methods

(>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b #

(>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #

return :: a -> WrappedMonad m a #

fail :: String -> WrappedMonad m a #

ArrowApply a => Monad (ArrowMonad a)

Since: base-2.1

Instance details

Defined in Control.Arrow

Methods

(>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b #

(>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #

return :: a0 -> ArrowMonad a a0 #

fail :: String -> ArrowMonad a a0 #

Monad (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b #

(>>) :: Proxy a -> Proxy b -> Proxy b #

return :: a -> Proxy a #

fail :: String -> Proxy a #

Monad m => Monad (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b #

(>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #

return :: a -> MaybeT m a #

fail :: String -> MaybeT m a #

Monad m => Monad (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b #

(>>) :: ListT m a -> ListT m b -> ListT m b #

return :: a -> ListT m a #

fail :: String -> ListT m a #

Monad f => Monad (Point f) 
Instance details

Defined in Linear.Affine

Methods

(>>=) :: Point f a -> (a -> Point f b) -> Point f b #

(>>) :: Point f a -> Point f b -> Point f b #

return :: a -> Point f a #

fail :: String -> Point f a #

Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Fractional p => Monad (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(>>=) :: Categorical p a -> (a -> Categorical p b) -> Categorical p b #

(>>) :: Categorical p a -> Categorical p b -> Categorical p b #

return :: a -> Categorical p a #

fail :: String -> Categorical p a #

Monad (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(>>=) :: Measured n a -> (a -> Measured n b) -> Measured n b #

(>>) :: Measured n a -> Measured n b -> Measured n b #

return :: a -> Measured n a #

fail :: String -> Measured n a #

Monad (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b #

(>>) :: Parser i a -> Parser i b -> Parser i b #

return :: a -> Parser i a #

fail :: String -> Parser i a #

Representable f => Monad (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

(>>=) :: Co f a -> (a -> Co f b) -> Co f b #

(>>) :: Co f a -> Co f b -> Co f b #

return :: a -> Co f a #

fail :: String -> Co f a #

Alternative f => Monad (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b #

(>>) :: Cofree f a -> Cofree f b -> Cofree f b #

return :: a -> Cofree f a #

fail :: String -> Cofree f a #

Monad (SetM s) 
Instance details

Defined in Data.Graph

Methods

(>>=) :: SetM s a -> (a -> SetM s b) -> SetM s b #

(>>) :: SetM s a -> SetM s b -> SetM s b #

return :: a -> SetM s a #

fail :: String -> SetM s a #

Functor f => Monad (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

(>>=) :: Free f a -> (a -> Free f b) -> Free f b #

(>>) :: Free f a -> Free f b -> Free f b #

return :: a -> Free f a #

fail :: String -> Free f a #

Monad m => Monad (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b #

(>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b #

return :: a -> Yoneda m a #

fail :: String -> Yoneda m a #

(Monad (Rep p), Representable p) => Monad (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

(>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b #

(>>) :: Prep p a -> Prep p b -> Prep p b #

return :: a -> Prep p a #

fail :: String -> Prep p a #

Monad f => Monad (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b #

(>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #

return :: a -> Rec1 f a #

fail :: String -> Rec1 f a #

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Monad f => Monad (Alt f) 
Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b #

(>>) :: Alt f a -> Alt f b -> Alt f b #

return :: a -> Alt f a #

fail :: String -> Alt f a #

Monad m => Monad (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #

(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

return :: a -> IdentityT m a #

fail :: String -> IdentityT m a #

(Applicative f, Monad f) => Monad (WhenMissing f x)

Equivalent to ReaderT k (ReaderT x (MaybeT f)).

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

(>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b #

(>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #

return :: a -> WhenMissing f x a #

fail :: String -> WhenMissing f x a #

Monad m => Monad (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b #

(>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #

return :: a -> ExceptT e m a #

fail :: String -> ExceptT e m a #

(Monad m, Error e) => Monad (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b #

(>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #

return :: a -> ErrorT e m a #

fail :: String -> ErrorT e m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

(>>=) :: RandT g m a -> (a -> RandT g m b) -> RandT g m b #

(>>) :: RandT g m a -> RandT g m b -> RandT g m b #

return :: a -> RandT g m a #

fail :: String -> RandT g m a #

Monad (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b #

(>>) :: Tagged s a -> Tagged s b -> Tagged s b #

return :: a -> Tagged s a #

fail :: String -> Tagged s a #

Monad (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

(>>=) :: Query v n a -> (a -> Query v n b) -> Query v n b #

(>>) :: Query v n a -> Query v n b -> Query v n b #

return :: a -> Query v n a #

fail :: String -> Query v n a #

(Alternative f, Monad w) => Monad (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b #

(>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #

return :: a -> CofreeT f w a #

fail :: String -> CofreeT f w a #

Monad (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Costar f a a0 -> (a0 -> Costar f a b) -> Costar f a b #

(>>) :: Costar f a a0 -> Costar f a b -> Costar f a b #

return :: a0 -> Costar f a a0 #

fail :: String -> Costar f a a0 #

(Functor f, Monad m) => Monad (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b #

(>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #

return :: a -> FreeT f m a #

fail :: String -> FreeT f m a #

Monad f => Monad (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Star f a a0 -> (a0 -> Star f a b) -> Star f a b #

(>>) :: Star f a a0 -> Star f a b -> Star f a b #

return :: a0 -> Star f a a0 #

fail :: String -> Star f a a0 #

Dim n => Monad (V n) 
Instance details

Defined in Linear.V

Methods

(>>=) :: V n a -> (a -> V n b) -> V n b #

(>>) :: V n a -> V n b -> V n b #

return :: a -> V n a #

fail :: String -> V n a #

Monad ((->) r :: * -> *)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: (r -> a) -> (a -> r -> b) -> r -> b #

(>>) :: (r -> a) -> (r -> b) -> r -> b #

return :: a -> r -> a #

fail :: String -> r -> a #

(Monad f, Monad g) => Monad (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b #

(>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #

return :: a -> (f :*: g) a #

fail :: String -> (f :*: g) a #

(Monad f, Monad g) => Monad (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b #

(>>) :: Product f g a -> Product f g b -> Product f g b #

return :: a -> Product f g a #

fail :: String -> Product f g a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b #

(>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #

return :: a -> WhenMatched f x y a #

fail :: String -> WhenMatched f x y a #

(Applicative f, Monad f) => Monad (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

(>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b #

(>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #

return :: a -> WhenMissing f k x a #

fail :: String -> WhenMissing f k x a #

Monad m => Monad (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #

(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #

return :: a -> ReaderT r m a #

fail :: String -> ReaderT r m a #

Monad (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

(>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b #

(>>) :: ContT r m a -> ContT r m b -> ContT r m b #

return :: a -> ContT r m a #

fail :: String -> ContT r m a #

Monad f => Monad (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b #

(>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #

return :: a -> M1 i c f a #

fail :: String -> M1 i c f a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b #

(>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #

return :: a -> WhenMatched f k x y a #

fail :: String -> WhenMatched f k x y a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

Monad state => Monad (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

(>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b #

(>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #

return :: a -> Builder collection mutCollection step state err a #

fail :: String -> Builder collection mutCollection step state err a #

class Functor (f :: * -> *) where #

The Functor class is used for types that can be mapped over. + release.

Instances
Monad []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: [a] -> (a -> [b]) -> [b] #

(>>) :: [a] -> [b] -> [b] #

return :: a -> [a] #

fail :: String -> [a] #

Monad Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: Maybe a -> (a -> Maybe b) -> Maybe b #

(>>) :: Maybe a -> Maybe b -> Maybe b #

return :: a -> Maybe a #

fail :: String -> Maybe a #

Monad IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: IO a -> (a -> IO b) -> IO b #

(>>) :: IO a -> IO b -> IO b #

return :: a -> IO a #

fail :: String -> IO a #

Monad Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Par1 a -> (a -> Par1 b) -> Par1 b #

(>>) :: Par1 a -> Par1 b -> Par1 b #

return :: a -> Par1 a #

fail :: String -> Par1 a #

Monad Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

(>>=) :: Q a -> (a -> Q b) -> Q b #

(>>) :: Q a -> Q b -> Q b #

return :: a -> Q a #

fail :: String -> Q a #

Monad IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: IResult a -> (a -> IResult b) -> IResult b #

(>>) :: IResult a -> IResult b -> IResult b #

return :: a -> IResult a #

fail :: String -> IResult a #

Monad Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Result a -> (a -> Result b) -> Result b #

(>>) :: Result a -> Result b -> Result b #

return :: a -> Result a #

fail :: String -> Result a #

Monad Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

(>>=) :: Complex a -> (a -> Complex b) -> Complex b #

(>>) :: Complex a -> Complex b -> Complex b #

return :: a -> Complex a #

fail :: String -> Complex a #

Monad Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Min a -> (a -> Min b) -> Min b #

(>>) :: Min a -> Min b -> Min b #

return :: a -> Min a #

fail :: String -> Min a #

Monad Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Max a -> (a -> Max b) -> Max b #

(>>) :: Max a -> Max b -> Max b #

return :: a -> Max a #

fail :: String -> Max a #

Monad First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

(>>=) :: Option a -> (a -> Option b) -> Option b #

(>>) :: Option a -> Option b -> Option b #

return :: a -> Option a #

fail :: String -> Option a #

Monad Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

(>>=) :: Identity a -> (a -> Identity b) -> Identity b #

(>>) :: Identity a -> Identity b -> Identity b #

return :: a -> Identity a #

fail :: String -> Identity a #

Monad First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: First a -> (a -> First b) -> First b #

(>>) :: First a -> First b -> First b #

return :: a -> First a #

fail :: String -> First a #

Monad Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Last a -> (a -> Last b) -> Last b #

(>>) :: Last a -> Last b -> Last b #

return :: a -> Last a #

fail :: String -> Last a #

Monad Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Dual a -> (a -> Dual b) -> Dual b #

(>>) :: Dual a -> Dual b -> Dual b #

return :: a -> Dual a #

fail :: String -> Dual a #

Monad Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Sum a -> (a -> Sum b) -> Sum b #

(>>) :: Sum a -> Sum b -> Sum b #

return :: a -> Sum a #

fail :: String -> Sum a #

Monad Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Product a -> (a -> Product b) -> Product b #

(>>) :: Product a -> Product b -> Product b #

return :: a -> Product a #

fail :: String -> Product a #

Monad Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

(>>=) :: Down a -> (a -> Down b) -> Down b #

(>>) :: Down a -> Down b -> Down b #

return :: a -> Down a #

fail :: String -> Down a #

Monad ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

(>>=) :: ReadPrec a -> (a -> ReadPrec b) -> ReadPrec b #

(>>) :: ReadPrec a -> ReadPrec b -> ReadPrec b #

return :: a -> ReadPrec a #

fail :: String -> ReadPrec a #

Monad ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: ReadP a -> (a -> ReadP b) -> ReadP b #

(>>) :: ReadP a -> ReadP b -> ReadP b #

return :: a -> ReadP a #

fail :: String -> ReadP a #

Monad NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: NonEmpty a -> (a -> NonEmpty b) -> NonEmpty b #

(>>) :: NonEmpty a -> NonEmpty b -> NonEmpty b #

return :: a -> NonEmpty a #

fail :: String -> NonEmpty a #

Monad PutM 
Instance details

Defined in Data.Binary.Put

Methods

(>>=) :: PutM a -> (a -> PutM b) -> PutM b #

(>>) :: PutM a -> PutM b -> PutM b #

return :: a -> PutM a #

fail :: String -> PutM a #

Monad Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

(>>=) :: Get a -> (a -> Get b) -> Get b #

(>>) :: Get a -> Get b -> Get b #

return :: a -> Get a #

fail :: String -> Get a #

Monad Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

(>>=) :: Put a -> (a -> Put b) -> Put b #

(>>) :: Put a -> Put b -> Put b #

return :: a -> Put a #

fail :: String -> Put a #

Monad Parser 
Instance details

Defined in Data.Csv.Conversion

Methods

(>>=) :: Parser a -> (a -> Parser b) -> Parser b #

(>>) :: Parser a -> Parser b -> Parser b #

return :: a -> Parser a #

fail :: String -> Parser a #

Monad Tree 
Instance details

Defined in Data.Tree

Methods

(>>=) :: Tree a -> (a -> Tree b) -> Tree b #

(>>) :: Tree a -> Tree b -> Tree b #

return :: a -> Tree a #

fail :: String -> Tree a #

Monad Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

(>>=) :: Seq a -> (a -> Seq b) -> Seq b #

(>>) :: Seq a -> Seq b -> Seq b #

return :: a -> Seq a #

fail :: String -> Seq a #

Monad DList 
Instance details

Defined in Data.DList

Methods

(>>=) :: DList a -> (a -> DList b) -> DList b #

(>>) :: DList a -> DList b -> DList b #

return :: a -> DList a #

fail :: String -> DList a #

Monad Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

(>>=) :: Interval a -> (a -> Interval b) -> Interval b #

(>>) :: Interval a -> Interval b -> Interval b #

return :: a -> Interval a #

fail :: String -> Interval a #

Monad SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

(>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b #

(>>) :: SmallArray a -> SmallArray b -> SmallArray b #

return :: a -> SmallArray a #

fail :: String -> SmallArray a #

Monad Array 
Instance details

Defined in Data.Primitive.Array

Methods

(>>=) :: Array a -> (a -> Array b) -> Array b #

(>>) :: Array a -> Array b -> Array b #

return :: a -> Array a #

fail :: String -> Array a #

Monad Vector 
Instance details

Defined in Data.Vector

Methods

(>>=) :: Vector a -> (a -> Vector b) -> Vector b #

(>>) :: Vector a -> Vector b -> Vector b #

return :: a -> Vector a #

fail :: String -> Vector a #

Monad Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Id a -> (a -> Id b) -> Id b #

(>>) :: Id a -> Id b -> Id b #

return :: a -> Id a #

fail :: String -> Id a #

Monad Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

(>>=) :: Box a -> (a -> Box b) -> Box b #

(>>) :: Box a -> Box b -> Box b #

return :: a -> Box a #

fail :: String -> Box a #

Monad Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

(>>=) :: Stream a -> (a -> Stream b) -> Stream b #

(>>) :: Stream a -> Stream b -> Stream b #

return :: a -> Stream a #

fail :: String -> Stream a #

Monad P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad Root 
Instance details

Defined in Numeric.RootFinding

Methods

(>>=) :: Root a -> (a -> Root b) -> Root b #

(>>) :: Root a -> Root b -> Root b #

return :: a -> Root a #

fail :: String -> Root a #

Monad Log 
Instance details

Defined in Numeric.Log

Methods

(>>=) :: Log a -> (a -> Log b) -> Log b #

(>>) :: Log a -> Log b -> Log b #

return :: a -> Log a #

fail :: String -> Log a #

Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Monad V2 
Instance details

Defined in Linear.V2

Methods

(>>=) :: V2 a -> (a -> V2 b) -> V2 b #

(>>) :: V2 a -> V2 b -> V2 b #

return :: a -> V2 a #

fail :: String -> V2 a #

Monad Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

(>>=) :: Polar a -> (a -> Polar b) -> Polar b #

(>>) :: Polar a -> Polar b -> Polar b #

return :: a -> Polar a #

fail :: String -> Polar a #

Monad V3 
Instance details

Defined in Linear.V3

Methods

(>>=) :: V3 a -> (a -> V3 b) -> V3 b #

(>>) :: V3 a -> V3 b -> V3 b #

return :: a -> V3 a #

fail :: String -> V3 a #

Monad V1 
Instance details

Defined in Linear.V1

Methods

(>>=) :: V1 a -> (a -> V1 b) -> V1 b #

(>>) :: V1 a -> V1 b -> V1 b #

return :: a -> V1 a #

fail :: String -> V1 a #

Monad Sh 
Instance details

Defined in Shelly.Base

Methods

(>>=) :: Sh a -> (a -> Sh b) -> Sh b #

(>>) :: Sh a -> Sh b -> Sh b #

return :: a -> Sh a #

fail :: String -> Sh a #

Monad Plucker 
Instance details

Defined in Linear.Plucker

Methods

(>>=) :: Plucker a -> (a -> Plucker b) -> Plucker b #

(>>) :: Plucker a -> Plucker b -> Plucker b #

return :: a -> Plucker a #

fail :: String -> Plucker a #

Monad Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

(>>=) :: Quaternion a -> (a -> Quaternion b) -> Quaternion b #

(>>) :: Quaternion a -> Quaternion b -> Quaternion b #

return :: a -> Quaternion a #

fail :: String -> Quaternion a #

Monad V0 
Instance details

Defined in Linear.V0

Methods

(>>=) :: V0 a -> (a -> V0 b) -> V0 b #

(>>) :: V0 a -> V0 b -> V0 b #

return :: a -> V0 a #

fail :: String -> V0 a #

Monad V4 
Instance details

Defined in Linear.V4

Methods

(>>=) :: V4 a -> (a -> V4 b) -> V4 b #

(>>) :: V4 a -> V4 b -> V4 b #

return :: a -> V4 a #

fail :: String -> V4 a #

Monad (Either e)

Since: base-4.4.0.0

Instance details

Defined in Data.Either

Methods

(>>=) :: Either e a -> (a -> Either e b) -> Either e b #

(>>) :: Either e a -> Either e b -> Either e b #

return :: a -> Either e a #

fail :: String -> Either e a #

Monad (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: U1 a -> (a -> U1 b) -> U1 b #

(>>) :: U1 a -> U1 b -> U1 b #

return :: a -> U1 a #

fail :: String -> U1 a #

Monoid a => Monad ((,) a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

(>>=) :: (a, a0) -> (a0 -> (a, b)) -> (a, b) #

(>>) :: (a, a0) -> (a, b) -> (a, b) #

return :: a0 -> (a, a0) #

fail :: String -> (a, a0) #

Monad (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

(>>=) :: Parser i a -> (a -> Parser i b) -> Parser i b #

(>>) :: Parser i a -> Parser i b -> Parser i b #

return :: a -> Parser i a #

fail :: String -> Parser i a #

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 #

(>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b #

return :: a -> WrappedMonad m a #

fail :: String -> WrappedMonad m a #

ArrowApply a => Monad (ArrowMonad a)

Since: base-2.1

Instance details

Defined in Control.Arrow

Methods

(>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b #

(>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b #

return :: a0 -> ArrowMonad a a0 #

fail :: String -> ArrowMonad a a0 #

Monad (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

(>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b #

(>>) :: Proxy a -> Proxy b -> Proxy b #

return :: a -> Proxy a #

fail :: String -> Proxy a #

Monad m => Monad (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

(>>=) :: MaybeT m a -> (a -> MaybeT m b) -> MaybeT m b #

(>>) :: MaybeT m a -> MaybeT m b -> MaybeT m b #

return :: a -> MaybeT m a #

fail :: String -> MaybeT m a #

Monad m => Monad (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

(>>=) :: ListT m a -> (a -> ListT m b) -> ListT m b #

(>>) :: ListT m a -> ListT m b -> ListT m b #

return :: a -> ListT m a #

fail :: String -> ListT m a #

(Monad (Rep p), Representable p) => Monad (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

(>>=) :: Prep p a -> (a -> Prep p b) -> Prep p b #

(>>) :: Prep p a -> Prep p b -> Prep p b #

return :: a -> Prep p a #

fail :: String -> Prep p a #

Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Fractional p => Monad (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

(>>=) :: Categorical p a -> (a -> Categorical p b) -> Categorical p b #

(>>) :: Categorical p a -> Categorical p b -> Categorical p b #

return :: a -> Categorical p a #

fail :: String -> Categorical p a #

Alternative f => Monad (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

(>>=) :: Cofree f a -> (a -> Cofree f b) -> Cofree f b #

(>>) :: Cofree f a -> Cofree f b -> Cofree f b #

return :: a -> Cofree f a #

fail :: String -> Cofree f a #

Functor f => Monad (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

(>>=) :: Free f a -> (a -> Free f b) -> Free f b #

(>>) :: Free f a -> Free f b -> Free f b #

return :: a -> Free f a #

fail :: String -> Free f a #

Monad (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

(>>=) :: Measured n a -> (a -> Measured n b) -> Measured n b #

(>>) :: Measured n a -> Measured n b -> Measured n b #

return :: a -> Measured n a #

fail :: String -> Measured n a #

Monad f => Monad (Point f) 
Instance details

Defined in Linear.Affine

Methods

(>>=) :: Point f a -> (a -> Point f b) -> Point f b #

(>>) :: Point f a -> Point f b -> Point f b #

return :: a -> Point f a #

fail :: String -> Point f a #

Monad (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b #

(>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b #

return :: a -> ReifiedFold s a #

fail :: String -> ReifiedFold s a #

Monad (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

(>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b #

(>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b #

return :: a -> ReifiedGetter s a #

fail :: String -> ReifiedGetter s a #

Representable f => Monad (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

(>>=) :: Co f a -> (a -> Co f b) -> Co f b #

(>>) :: Co f a -> Co f b -> Co f b #

return :: a -> Co f a #

fail :: String -> Co f a #

Monad m => Monad (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

(>>=) :: Yoneda m a -> (a -> Yoneda m b) -> Yoneda m b #

(>>) :: Yoneda m a -> Yoneda m b -> Yoneda m b #

return :: a -> Yoneda m a #

fail :: String -> Yoneda m a #

Monad f => Monad (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: Rec1 f a -> (a -> Rec1 f b) -> Rec1 f b #

(>>) :: Rec1 f a -> Rec1 f b -> Rec1 f b #

return :: a -> Rec1 f a #

fail :: String -> Rec1 f a #

Monad m => Monad (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

(>>=) :: RandT g m a -> (a -> RandT g m b) -> RandT g m b #

(>>) :: RandT g m a -> RandT g m b -> RandT g m b #

return :: a -> RandT g m a #

fail :: String -> RandT g m a #

Monad f => Monad (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

(>>=) :: Ap f a -> (a -> Ap f b) -> Ap f b #

(>>) :: Ap f a -> Ap f b -> Ap f b #

return :: a -> Ap f a #

fail :: String -> Ap f a #

Monad f => Monad (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

(>>=) :: Alt f a -> (a -> Alt f b) -> Alt f b #

(>>) :: Alt f a -> Alt f b -> Alt f b #

return :: a -> Alt f a #

fail :: String -> Alt f a #

Monad m => Monad (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #

(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

return :: a -> IdentityT m a #

fail :: String -> IdentityT m a #

(Applicative f, Monad f) => Monad (WhenMissing f x)

Equivalent to ReaderT k (ReaderT x (MaybeT f)).

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

(>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b #

(>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b #

return :: a -> WhenMissing f x a #

fail :: String -> WhenMissing f x a #

Monad m => Monad (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

(>>=) :: ExceptT e m a -> (a -> ExceptT e m b) -> ExceptT e m b #

(>>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b #

return :: a -> ExceptT e m a #

fail :: String -> ExceptT e m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

Monad m => Monad (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

(>>=) :: ReaderT r m a -> (a -> ReaderT r m b) -> ReaderT r m b #

(>>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b #

return :: a -> ReaderT r m a #

fail :: String -> ReaderT r m a #

(Monad m, Error e) => Monad (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

(>>=) :: ErrorT e m a -> (a -> ErrorT e m b) -> ErrorT e m b #

(>>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b #

return :: a -> ErrorT e m a #

fail :: String -> ErrorT e m a #

Monad m => Monad (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

(>>=) :: StateT s m a -> (a -> StateT s m b) -> StateT s m b #

(>>) :: StateT s m a -> StateT s m b -> StateT s m b #

return :: a -> StateT s m a #

fail :: String -> StateT s m a #

(Monoid w, Monad m) => Monad (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

(>>=) :: WriterT w m a -> (a -> WriterT w m b) -> WriterT w m b #

(>>) :: WriterT w m a -> WriterT w m b -> WriterT w m b #

return :: a -> WriterT w m a #

fail :: String -> WriterT w m a #

Monad f => Monad (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Star f a a0 -> (a0 -> Star f a b) -> Star f a b #

(>>) :: Star f a a0 -> Star f a b -> Star f a b #

return :: a0 -> Star f a a0 #

fail :: String -> Star f a a0 #

Monad (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

(>>=) :: Costar f a a0 -> (a0 -> Costar f a b) -> Costar f a b #

(>>) :: Costar f a a0 -> Costar f a b -> Costar f a b #

return :: a0 -> Costar f a a0 #

fail :: String -> Costar f a a0 #

Monad (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

(>>=) :: Tagged s a -> (a -> Tagged s b) -> Tagged s b #

(>>) :: Tagged s a -> Tagged s b -> Tagged s b #

return :: a -> Tagged s a #

fail :: String -> Tagged s a #

(Alternative f, Monad w) => Monad (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

(>>=) :: CofreeT f w a -> (a -> CofreeT f w b) -> CofreeT f w b #

(>>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b #

return :: a -> CofreeT f w a #

fail :: String -> CofreeT f w a #

(Functor f, Monad m) => Monad (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

(>>=) :: FreeT f m a -> (a -> FreeT f m b) -> FreeT f m b #

(>>) :: FreeT f m a -> FreeT f m b -> FreeT f m b #

return :: a -> FreeT f m a #

fail :: String -> FreeT f m a #

Monad (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

(>>=) :: Query v n a -> (a -> Query v n b) -> Query v n b #

(>>) :: Query v n a -> Query v n b -> Query v n b #

return :: a -> Query v n a #

fail :: String -> Query v n a #

Monad (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

(>>=) :: Indexed i a a0 -> (a0 -> Indexed i a b) -> Indexed i a b #

(>>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b #

return :: a0 -> Indexed i a a0 #

fail :: String -> Indexed i a a0 #

Dim n => Monad (V n) 
Instance details

Defined in Linear.V

Methods

(>>=) :: V n a -> (a -> V n b) -> V n b #

(>>) :: V n a -> V n b -> V n b #

return :: a -> V n a #

fail :: String -> V n a #

Monad ((->) r :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

(>>=) :: (r -> a) -> (a -> r -> b) -> r -> b #

(>>) :: (r -> a) -> (r -> b) -> r -> b #

return :: a -> r -> a #

fail :: String -> r -> a #

(Monad f, Monad g) => Monad (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: (f :*: g) a -> (a -> (f :*: g) b) -> (f :*: g) b #

(>>) :: (f :*: g) a -> (f :*: g) b -> (f :*: g) b #

return :: a -> (f :*: g) a #

fail :: String -> (f :*: g) a #

(Monad f, Monad g) => Monad (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

(>>=) :: Product f g a -> (a -> Product f g b) -> Product f g b #

(>>) :: Product f g a -> Product f g b -> Product f g b #

return :: a -> Product f g a #

fail :: String -> Product f g a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b #

(>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b #

return :: a -> WhenMatched f x y a #

fail :: String -> WhenMatched f x y a #

(Applicative f, Monad f) => Monad (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

(>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b #

(>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b #

return :: a -> WhenMissing f k x a #

fail :: String -> WhenMissing f k x a #

Monad (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

(>>=) :: ContT r m a -> (a -> ContT r m b) -> ContT r m b #

(>>) :: ContT r m a -> ContT r m b -> ContT r m b #

return :: a -> ContT r m a #

fail :: String -> ContT r m a #

Monad f => Monad (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

(>>=) :: M1 i c f a -> (a -> M1 i c f b) -> M1 i c f b #

(>>) :: M1 i c f a -> M1 i c f b -> M1 i c f b #

return :: a -> M1 i c f a #

fail :: String -> M1 i c f a #

(Monad f, Applicative f) => Monad (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

(>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b #

(>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b #

return :: a -> WhenMatched f k x y a #

fail :: String -> WhenMatched f k x y a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

(Monoid w, Monad m) => Monad (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

(>>=) :: RWST r w s m a -> (a -> RWST r w s m b) -> RWST r w s m b #

(>>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b #

return :: a -> RWST r w s m a #

fail :: String -> RWST r w s m a #

Monad state => Monad (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

(>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b #

(>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b #

return :: a -> Builder collection mutCollection step state err a #

fail :: String -> Builder collection mutCollection step state err a #

class Functor (f :: Type -> Type) where #

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, Maybe and IO -satisfy these laws.

Minimal complete definition

fmap

Methods

fmap :: (a -> b) -> f a -> f b #

Instances
Functor []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> [a] -> [b] #

(<$) :: a -> [b] -> [a] #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

Functor Par1 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Par1 a -> Par1 b #

(<$) :: a -> Par1 b -> Par1 a #

Functor Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

fmap :: (a -> b) -> Q a -> Q b #

(<$) :: a -> Q b -> Q a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

Functor Grid 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

fmap :: (a -> b) -> Grid a -> Grid b #

(<$) :: a -> Grid b -> Grid a #

Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

Functor Complex 
Instance details

Defined in Data.Complex

Methods

fmap :: (a -> b) -> Complex a -> Complex b #

(<$) :: a -> Complex b -> Complex a #

Functor Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Min a -> Min b #

(<$) :: a -> Min b -> Min a #

Functor Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Max a -> Max b #

(<$) :: a -> Max b -> Max a #

Functor First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Option a -> Option b #

(<$) :: a -> Option b -> Option a #

Functor ZipList 
Instance details

Defined in Control.Applicative

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b #

(<$) :: a -> ZipList b -> ZipList a #

Functor Handler

Since: base-4.6.0.0

Instance details

Defined in Control.Exception

Methods

fmap :: (a -> b) -> Handler a -> Handler b #

(<$) :: a -> Handler b -> Handler a #

Functor First 
Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last 
Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Dual a -> Dual b #

(<$) :: a -> Dual b -> Dual a #

Functor Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Sum a -> Sum b #

(<$) :: a -> Sum b -> Sum a #

Functor Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Product a -> Product b #

(<$) :: a -> Product b -> Product a #

Functor Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

fmap :: (a -> b) -> Down a -> Down b #

(<$) :: a -> Down b -> Down a #

Functor ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

fmap :: (a -> b) -> ReadPrec a -> ReadPrec b #

(<$) :: a -> ReadPrec b -> ReadPrec a #

Functor ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> ReadP a -> ReadP b #

(<$) :: a -> ReadP b -> ReadP a #

Functor NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> NonEmpty a -> NonEmpty b #

(<$) :: a -> NonEmpty b -> NonEmpty a #

Functor PutM 
Instance details

Defined in Data.Binary.Put

Methods

fmap :: (a -> b) -> PutM a -> PutM b #

(<$) :: a -> PutM b -> PutM a #

Functor Decoder 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Decoder a -> Decoder b #

(<$) :: a -> Decoder b -> Decoder a #

Functor Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Get a -> Get b #

(<$) :: a -> Get b -> Get a #

Functor Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

fmap :: (a -> b) -> Put a -> Put b #

(<$) :: a -> Put b -> Put a #

Functor IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b #

(<$) :: a -> IntMap b -> IntMap a #

Functor SCC

Since: containers-0.5.4

Instance details

Defined in Data.Graph

Methods

fmap :: (a -> b) -> SCC a -> SCC b #

(<$) :: a -> SCC b -> SCC a #

Functor Tree 
Instance details

Defined in Data.Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b #

(<$) :: a -> Tree b -> Tree a #

Functor Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Seq a -> Seq b #

(<$) :: a -> Seq b -> Seq a #

Functor FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> FingerTree a -> FingerTree b #

(<$) :: a -> FingerTree b -> FingerTree a #

Functor Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Digit a -> Digit b #

(<$) :: a -> Digit b -> Digit a #

Functor Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Node a -> Node b #

(<$) :: a -> Node b -> Node a #

Functor Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Elem a -> Elem b #

(<$) :: a -> Elem b -> Elem a #

Functor ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewL a -> ViewL b #

(<$) :: a -> ViewL b -> ViewL a #

Functor ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewR a -> ViewR b #

(<$) :: a -> ViewR b -> ViewR a #

Functor DList 
Instance details

Defined in Data.DList

Methods

fmap :: (a -> b) -> DList a -> DList b #

(<$) :: a -> DList b -> DList a #

Functor Angle 
Instance details

Defined in Diagrams.Angle

Methods

fmap :: (a -> b) -> Angle a -> Angle b #

(<$) :: a -> Angle b -> Angle a #

Functor V3 
Instance details

Defined in Linear.V3

Methods

fmap :: (a -> b) -> V3 a -> V3 b #

(<$) :: a -> V3 b -> V3 a #

Functor V2 
Instance details

Defined in Linear.V2

Methods

fmap :: (a -> b) -> V2 a -> V2 b #

(<$) :: a -> V2 b -> V2 a #

Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

Functor Doc 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Doc a -> Doc b #

(<$) :: a -> Doc b -> Doc a #

Functor AnnotDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b #

(<$) :: a -> AnnotDetails b -> AnnotDetails a #

Functor Span 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Span a -> Span b #

(<$) :: a -> Span b -> Span a #

Functor Array 
Instance details

Defined in Data.Primitive.Array

Methods

fmap :: (a -> b) -> Array a -> Array b #

(<$) :: a -> Array b -> Array a #

Functor Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Id a -> Id b #

(<$) :: a -> Id b -> Id a #

Functor P 
Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Box a -> Box b #

(<$) :: a -> Box b -> Box a #

Functor Vector 
Instance details

Defined in Data.Vector

Methods

fmap :: (a -> b) -> Vector a -> Vector b #

(<$) :: a -> Vector b -> Vector a #

Functor Root 
Instance details

Defined in Numeric.RootFinding

Methods

fmap :: (a -> b) -> Root a -> Root b #

(<$) :: a -> Root b -> Root a #

Functor Log 
Instance details

Defined in Numeric.Log

Methods

fmap :: (a -> b) -> Log a -> Log b #

(<$) :: a -> Log b -> Log a #

Functor Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor Active 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Active a -> Active b #

(<$) :: a -> Active b -> Active a #

Functor Dynamic 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Dynamic a -> Dynamic b #

(<$) :: a -> Dynamic b -> Dynamic a #

Functor Time 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Time a -> Time b #

(<$) :: a -> Time b -> Time a #

Functor Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fmap :: (a -> b) -> Interval a -> Interval b #

(<$) :: a -> Interval b -> Interval a #

Functor FontSize 
Instance details

Defined in Diagrams.TwoD.Text

Methods

fmap :: (a -> b) -> FontSize a -> FontSize b #

(<$) :: a -> FontSize b -> FontSize a #

Functor V1 
Instance details

Defined in Linear.V1

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor Sh 
Instance details

Defined in Shelly.Base

Methods

fmap :: (a -> b) -> Sh a -> Sh b #

(<$) :: a -> Sh b -> Sh a #

Functor Duration 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Duration a -> Duration b #

(<$) :: a -> Duration b -> Duration a #

Functor V4 
Instance details

Defined in Linear.V4

Methods

fmap :: (a -> b) -> V4 a -> V4 b #

(<$) :: a -> V4 b -> V4 a #

Functor BernsteinPoly 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

fmap :: (a -> b) -> BernsteinPoly a -> BernsteinPoly b #

(<$) :: a -> BernsteinPoly b -> BernsteinPoly a #

Functor Plucker 
Instance details

Defined in Linear.Plucker

Methods

fmap :: (a -> b) -> Plucker a -> Plucker b #

(<$) :: a -> Plucker b -> Plucker a #

Functor Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fmap :: (a -> b) -> Quaternion a -> Quaternion b #

(<$) :: a -> Quaternion b -> Quaternion a #

Functor V0 
Instance details

Defined in Linear.V0

Methods

fmap :: (a -> b) -> V0 a -> V0 b #

(<$) :: a -> V0 b -> V0 a #

Functor Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

fmap :: (a -> b) -> Stream a -> Stream b #

(<$) :: a -> Stream b -> Stream a #

Functor IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> IResult a -> IResult b #

(<$) :: a -> IResult b -> IResult a #

Functor Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Result a -> Result b #

(<$) :: a -> Result b -> Result a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor GraphPart 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

fmap :: (a -> b) -> GraphPart a -> GraphPart b #

(<$) :: a -> GraphPart b -> GraphPart a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

Functor (V1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> U1 a -> U1 b #

(<$) :: a -> U1 b -> U1 a #

Functor ((,) a)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a0 -> b) -> (a, a0) -> (a, b) #

(<$) :: a0 -> (a, b) -> (a, a0) #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Functor (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> Map k a -> Map k b #

(<$) :: a -> Map k b -> Map k a #

Functor (Array i)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

fmap :: (a -> b) -> Array i a -> Array i b #

(<$) :: a -> Array i b -> Array i a #

Functor (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a0 -> b) -> Arg a a0 -> Arg a b #

(<$) :: a0 -> Arg a b -> Arg a a0 #

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 #

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a #

Arrow a => Functor (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #

(<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 #

Functor (Proxy :: * -> *)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

fmap :: (a -> b) -> Proxy a -> Proxy b #

(<$) :: a -> Proxy b -> Proxy a #

Functor m => Functor (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fmap :: (a -> b) -> MaybeT m a -> MaybeT m b #

(<$) :: a -> MaybeT m b -> MaybeT m a #

Functor s => Functor (ViewL s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewL s a -> ViewL s b #

(<$) :: a -> ViewL s b -> ViewL s a #

Functor s => Functor (ViewR s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewR s a -> ViewR s b #

(<$) :: a -> ViewR s b -> ViewR s a #

Functor m => Functor (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b #

(<$) :: a -> ListT m b -> ListT m a #

Functor v => Functor (BoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> BoundingBox v a -> BoundingBox v b #

(<$) :: a -> BoundingBox v b -> BoundingBox v a #

Functor f => Functor (Point f) 
Instance details

Defined in Linear.Affine

Methods

fmap :: (a -> b) -> Point f a -> Point f b #

(<$) :: a -> Point f b -> Point f a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Functor (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fmap :: (a -> b) -> Categorical p a -> Categorical p b #

(<$) :: a -> Categorical p b -> Categorical p a #

Functor (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fmap :: (a -> b) -> HashMap k a -> HashMap k b #

(<$) :: a -> HashMap k b -> HashMap k a #

Functor v => Functor (SizeSpec v) 
Instance details

Defined in Diagrams.Size

Methods

fmap :: (a -> b) -> SizeSpec v a -> SizeSpec v b #

(<$) :: a -> SizeSpec v b -> SizeSpec v a #

Functor (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

fmap :: (a -> b) -> Measured n a -> Measured n b #

(<$) :: a -> Measured n b -> Measured n a #

Functor f => Functor (MaybeApply f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> MaybeApply f a -> MaybeApply f b #

(<$) :: a -> MaybeApply f b -> MaybeApply f a #

Functor (IResult i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> IResult i a -> IResult i b #

(<$) :: a -> IResult i b -> IResult i a #

Functor (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> Parser i a -> Parser i b #

(<$) :: a -> Parser i b -> Parser i a #

Functor f => Functor (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

fmap :: (a -> b) -> Co f a -> Co f b #

(<$) :: a -> Co f b -> Co f a #

Functor f => Functor (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fmap :: (a -> b) -> Cofree f a -> Cofree f b #

(<$) :: a -> Cofree f b -> Cofree f a #

Functor f => Functor (WrappedApplicative f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #

(<$) :: a -> WrappedApplicative f b -> WrappedApplicative f a #

Functor v => Functor (Direction v) 
Instance details

Defined in Diagrams.Direction

Methods

fmap :: (a -> b) -> Direction v a -> Direction v b #

(<$) :: a -> Direction v b -> Direction v a #

Functor f => Functor (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing f a -> Indexing f b #

(<$) :: a -> Indexing f b -> Indexing f a #

Functor v => Functor (NonEmptyBoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> NonEmptyBoundingBox v a -> NonEmptyBoundingBox v b #

(<$) :: a -> NonEmptyBoundingBox v b -> NonEmptyBoundingBox v a #

Functor (SetM s) 
Instance details

Defined in Data.Graph

Methods

fmap :: (a -> b) -> SetM s a -> SetM s b #

(<$) :: a -> SetM s b -> SetM s a #

Functor f => Functor (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fmap :: (a -> b) -> Free f a -> Free f b #

(<$) :: a -> Free f b -> Free f a #

Functor (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fmap :: (a -> b) -> Yoneda f a -> Yoneda f b #

(<$) :: a -> Yoneda f b -> Yoneda f a #

Functor f => Functor (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b #

(<$) :: a -> Indexing64 f b -> Indexing64 f a #

Profunctor p => Functor (Coprep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Coprep p a -> Coprep p b #

(<$) :: a -> Coprep p b -> Coprep p a #

Profunctor p => Functor (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Prep p a -> Prep p b #

(<$) :: a -> Prep p b -> Prep p a #

Monad m => Functor (Handler m) 
Instance details

Defined in Control.Monad.Catch

Methods

fmap :: (a -> b) -> Handler m a -> Handler m b #

(<$) :: a -> Handler m b -> Handler m a #

Functor f => Functor (Rec1 f) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Rec1 f a -> Rec1 f b #

(<$) :: a -> Rec1 f b -> Rec1 f a #

Functor (URec Char :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Functor (URec Double :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Functor (URec Float :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Functor (URec Int :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Functor (URec Word :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Functor (URec (Ptr ()) :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b #

(<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a #

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

(<$) :: a0 -> Context a b b0 -> Context a b a0 #

Functor (Const m :: * -> *)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b #

(<$) :: a -> Const m b -> Const m a #

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 #

(<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #

Functor f => Functor (Alt f) 
Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Alt f a -> Alt f b #

(<$) :: a -> Alt f b -> Alt f a #

Functor m => Functor (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fmap :: (a -> b) -> IdentityT m a -> IdentityT m b #

(<$) :: a -> IdentityT m b -> IdentityT m a #

(Applicative f, Monad f) => Functor (WhenMissing f x)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b #

(<$) :: a -> WhenMissing f x b -> WhenMissing f x a #

Functor m => Functor (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b #

(<$) :: a -> ExceptT e m b -> ExceptT e m a #

Functor m => Functor (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b #

(<$) :: a -> ErrorT e m b -> ErrorT e m a #

Functor f => Functor (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b #

(<$) :: a -> Backwards f b -> Backwards f a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Monad m => Functor (Bundle m v) 
Instance details

Defined in Data.Vector.Fusion.Bundle.Monadic

Methods

fmap :: (a -> b) -> Bundle m v a -> Bundle m v b #

(<$) :: a -> Bundle m v b -> Bundle m v a #

Functor m => Functor (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

fmap :: (a -> b) -> RandT g m a -> RandT g m b #

(<$) :: a -> RandT g m b -> RandT g m a #

Bifunctor p => Functor (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fmap :: (a -> b) -> Join p a -> Join p b #

(<$) :: a -> Join p b -> Join p a #

Functor (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fmap :: (a -> b) -> Tagged s a -> Tagged s b #

(<$) :: a -> Tagged s b -> Tagged s a #

Functor (Mag a b) 
Instance details

Defined in Data.Biapplicative

Methods

fmap :: (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #

(<$) :: a0 -> Mag a b b0 -> Mag a b a0 #

Functor (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

fmap :: (a -> b) -> Query v n a -> Query v n b #

(<$) :: a -> Query v n b -> Query v n a #

Functor v => Functor (Segment c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Segment c v a -> Segment c v b #

(<$) :: a -> Segment c v b -> Segment c v a #

Functor v => Functor (Offset c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Offset c v a -> Offset c v b #

(<$) :: a -> Offset c v b -> Offset c v a #

(Functor f, Functor w) => Functor (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b #

(<$) :: a -> CofreeT f w b -> CofreeT f w a #

Functor f => Functor (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b #

(<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 #

Functor (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Costar f a a0 -> Costar f a b #

(<$) :: a0 -> Costar f a b -> Costar f a a0 #

Bifunctor p => Functor (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fmap :: (a -> b) -> Fix p a -> Fix p b #

(<$) :: a -> Fix p b -> Fix p a #

Functor (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Forget r a a0 -> Forget r a b #

(<$) :: a0 -> Forget r a b -> Forget r a a0 #

(Functor f, Monad m) => Functor (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a -> b) -> FreeT f m a -> FreeT f m b #

(<$) :: a -> FreeT f m b -> FreeT f m a #

Functor f => Functor (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b #

(<$) :: a0 -> FreeF f a b -> FreeF f a a0 #

Functor f => Functor (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Star f a a0 -> Star f a b #

(<$) :: a0 -> Star f a b -> Star f a a0 #

Functor (V n) 
Instance details

Defined in Linear.V

Methods

fmap :: (a -> b) -> V n a -> V n b #

(<$) :: a -> V n b -> V n a #

Functor (Day f g) 
Instance details

Defined in Data.Functor.Day

Methods

fmap :: (a -> b) -> Day f g a -> Day f g b #

(<$) :: a -> Day f g b -> Day f g a #

Functor (CotambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> CotambaraSum p a a0 -> CotambaraSum p a b #

(<$) :: a0 -> CotambaraSum p a b -> CotambaraSum p a a0 #

Profunctor p => Functor (TambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> TambaraSum p a a0 -> TambaraSum p a b #

(<$) :: a0 -> TambaraSum p a b -> TambaraSum p a a0 #

Profunctor p => Functor (Tambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Tambara p a a0 -> Tambara p a b #

(<$) :: a0 -> Tambara p a b -> Tambara p a a0 #

Functor (Holes t m) 
Instance details

Defined in Control.Lens.Traversal

Methods

fmap :: (a -> b) -> Holes t m a -> Holes t m b #

(<$) :: a -> Holes t m b -> Holes t m a #

Functor g => Functor (Curried g h) 
Instance details

Defined in Data.Functor.Day.Curried

Methods

fmap :: (a -> b) -> Curried g h a -> Curried g h b #

(<$) :: a -> Curried g h b -> Curried g h a #

Functor f => Functor (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a -> b0) -> AlongsideLeft f b a -> AlongsideLeft f b b0 #

(<$) :: a -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Functor f => Functor (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b #

(<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 #

Functor (Mafic a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #

(<$) :: a0 -> Mafic a b b0 -> Mafic a b a0 #

Functor (Flows i b) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b0) -> Flows i b a -> Flows i b b0 #

(<$) :: a -> Flows i b b0 -> Flows i b a #

Functor (Cotambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Cotambara p a a0 -> Cotambara p a b #

(<$) :: a0 -> Cotambara p a b -> Cotambara p a a0 #

Functor ((->) r :: * -> *)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> (r -> a) -> r -> b #

(<$) :: a -> (r -> b) -> r -> a #

Functor (K1 i c :: * -> *) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> K1 i c a -> K1 i c b #

(<$) :: a -> K1 i c b -> K1 i c a #

(Functor f, Functor g) => Functor (f :+: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b #

(<$) :: a -> (f :+: g) b -> (f :+: g) a #

(Functor f, Functor g) => Functor (f :*: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b #

(<$) :: a -> (f :*: g) b -> (f :*: g) a #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

(Functor f, Functor g) => Functor (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fmap :: (a -> b) -> Product f g a -> Product f g b #

(<$) :: a -> Product f g b -> Product f g a #

(Functor f, Functor g) => Functor (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fmap :: (a -> b) -> Sum f g a -> Sum f g b #

(<$) :: a -> Sum f g b -> Sum f g a #

Functor f => Functor (WhenMatched f x y)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #

(<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a #

(Applicative f, Monad f) => Functor (WhenMissing f k x)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #

(<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a #

Functor m => Functor (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b #

(<$) :: a -> ReaderT r m b -> ReaderT r m a #

Functor (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

fmap :: (a -> b) -> ContT r m a -> ContT r m b #

(<$) :: a -> ContT r m b -> ContT r m a #

Functor (QDiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiagram b v n a -> QDiagram b v n b0 #

(<$) :: a -> QDiagram b v n b0 -> QDiagram b v n a #

Functor (SubMap b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> SubMap b v n a -> SubMap b v n b0 #

(<$) :: a -> SubMap b v n b0 -> SubMap b v n a #

Functor (Subdiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> Subdiagram b v n a -> Subdiagram b v n b0 #

(<$) :: a -> Subdiagram b v n b0 -> Subdiagram b v n a #

Functor (Exchange a b s) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

fmap :: (a0 -> b0) -> Exchange a b s a0 -> Exchange a b s b0 #

(<$) :: a0 -> Exchange a b s b0 -> Exchange a b s a0 #

Functor (QDiaLeaf b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiaLeaf b v n a -> QDiaLeaf b v n b0 #

(<$) :: a -> QDiaLeaf b v n b0 -> QDiaLeaf b v n a #

Functor (DUALTreeU d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeU d u a a0 -> DUALTreeU d u a b #

(<$) :: a0 -> DUALTreeU d u a b -> DUALTreeU d u a a0 #

Functor (DUALTree d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTree d u a a0 -> DUALTree d u a b #

(<$) :: a0 -> DUALTree d u a b -> DUALTree d u a a0 #

Functor (DUALTreeNE d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeNE d u a a0 -> DUALTreeNE d u a b #

(<$) :: a0 -> DUALTreeNE d u a b -> DUALTreeNE d u a a0 #

Profunctor p => Functor (Procompose p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b #

(<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 #

Profunctor p => Functor (Rift p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b #

(<$) :: a0 -> Rift p q a b -> Rift p q a a0 #

Functor (Pretext p a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Pretext p a b a0 -> Pretext p a b b0 #

(<$) :: a0 -> Pretext p a b b0 -> Pretext p a b a0 #

Functor (Molten i a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #

(<$) :: a0 -> Molten i a b b0 -> Molten i a b a0 #

Functor f => Functor (M1 i c f) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> M1 i c f a -> M1 i c f b #

(<$) :: a -> M1 i c f b -> M1 i c f a #

(Functor f, Functor g) => Functor (f :.: g) 
Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b #

(<$) :: a -> (f :.: g) b -> (f :.: g) a #

(Functor f, Functor g) => Functor (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fmap :: (a -> b) -> Compose f g a -> Compose f g b #

(<$) :: a -> Compose f g b -> Compose f g a #

Functor f => Functor (WhenMatched f k x y)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #

(<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor (Clown f a :: * -> *) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b #

(<$) :: a0 -> Clown f a b -> Clown f a a0 #

Bifunctor p => Functor (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b #

(<$) :: a0 -> Flip p a b -> Flip p a a0 #

Functor g => Functor (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b #

(<$) :: a0 -> Joker g a b -> Joker g a a0 #

Bifunctor p => Functor (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b #

(<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 #

Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) 
Instance details

Defined in Data.Reflection

Methods

fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #

(<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #

Functor (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #

(<$) :: a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

Functor (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT1 p g a b a0 -> BazaarT1 p g a b b0 #

(<$) :: a0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

Functor (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #

(<$) :: a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

Functor (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> PretextT p g a b a0 -> PretextT p g a b b0 #

(<$) :: a0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

Monad state => Functor (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

fmap :: (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #

(<$) :: a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

(Functor f, Bifunctor p) => Functor (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b #

(<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 #

(Bifunctor p, Functor g) => Functor (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b #

(<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 #

mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) #

Map each element of a structure to a monadic action, evaluate +fmap (f . g) == fmap f . fmap g

The instances of Functor for lists, Maybe and IO +satisfy these laws.

Methods

fmap :: (a -> b) -> f a -> f b #

Instances
Functor []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> [a] -> [b] #

(<$) :: a -> [b] -> [a] #

Functor Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> Maybe a -> Maybe b #

(<$) :: a -> Maybe b -> Maybe a #

Functor IO

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> IO a -> IO b #

(<$) :: a -> IO b -> IO a #

Functor Par1

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Par1 a -> Par1 b #

(<$) :: a -> Par1 b -> Par1 a #

Functor Q 
Instance details

Defined in Language.Haskell.TH.Syntax

Methods

fmap :: (a -> b) -> Q a -> Q b #

(<$) :: a -> Q b -> Q a #

Functor Only 
Instance details

Defined in Data.Tuple.Only

Methods

fmap :: (a -> b) -> Only a -> Only b #

(<$) :: a -> Only b -> Only a #

Functor IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> IResult a -> IResult b #

(<$) :: a -> IResult b -> IResult a #

Functor Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Result a -> Result b #

(<$) :: a -> Result b -> Result a #

Functor Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor Complex

Since: base-4.9.0.0

Instance details

Defined in Data.Complex

Methods

fmap :: (a -> b) -> Complex a -> Complex b #

(<$) :: a -> Complex b -> Complex a #

Functor Min

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Min a -> Min b #

(<$) :: a -> Min b -> Min a #

Functor Max

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Max a -> Max b #

(<$) :: a -> Max b -> Max a #

Functor First

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a -> b) -> Option a -> Option b #

(<$) :: a -> Option b -> Option a #

Functor ZipList

Since: base-2.1

Instance details

Defined in Control.Applicative

Methods

fmap :: (a -> b) -> ZipList a -> ZipList b #

(<$) :: a -> ZipList b -> ZipList a #

Functor Identity

Since: base-4.8.0.0

Instance details

Defined in Data.Functor.Identity

Methods

fmap :: (a -> b) -> Identity a -> Identity b #

(<$) :: a -> Identity b -> Identity a #

Functor Handler

Since: base-4.6.0.0

Instance details

Defined in Control.Exception

Methods

fmap :: (a -> b) -> Handler a -> Handler b #

(<$) :: a -> Handler b -> Handler a #

Functor First

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> First a -> First b #

(<$) :: a -> First b -> First a #

Functor Last

Since: base-4.8.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Last a -> Last b #

(<$) :: a -> Last b -> Last a #

Functor Dual

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Dual a -> Dual b #

(<$) :: a -> Dual b -> Dual a #

Functor Sum

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Sum a -> Sum b #

(<$) :: a -> Sum b -> Sum a #

Functor Product

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Product a -> Product b #

(<$) :: a -> Product b -> Product a #

Functor Down

Since: base-4.11.0.0

Instance details

Defined in Data.Ord

Methods

fmap :: (a -> b) -> Down a -> Down b #

(<$) :: a -> Down b -> Down a #

Functor ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

fmap :: (a -> b) -> ReadPrec a -> ReadPrec b #

(<$) :: a -> ReadPrec b -> ReadPrec a #

Functor ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> ReadP a -> ReadP b #

(<$) :: a -> ReadP b -> ReadP a #

Functor NonEmpty

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> NonEmpty a -> NonEmpty b #

(<$) :: a -> NonEmpty b -> NonEmpty a #

Functor PutM 
Instance details

Defined in Data.Binary.Put

Methods

fmap :: (a -> b) -> PutM a -> PutM b #

(<$) :: a -> PutM b -> PutM a #

Functor Decoder 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Decoder a -> Decoder b #

(<$) :: a -> Decoder b -> Decoder a #

Functor Get 
Instance details

Defined in Data.Binary.Get.Internal

Methods

fmap :: (a -> b) -> Get a -> Get b #

(<$) :: a -> Get b -> Get a #

Functor Put 
Instance details

Defined in Data.ByteString.Builder.Internal

Methods

fmap :: (a -> b) -> Put a -> Put b #

(<$) :: a -> Put b -> Put a #

Functor Parser 
Instance details

Defined in Data.Csv.Conversion

Methods

fmap :: (a -> b) -> Parser a -> Parser b #

(<$) :: a -> Parser b -> Parser a #

Functor IntMap 
Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> IntMap a -> IntMap b #

(<$) :: a -> IntMap b -> IntMap a #

Functor Tree 
Instance details

Defined in Data.Tree

Methods

fmap :: (a -> b) -> Tree a -> Tree b #

(<$) :: a -> Tree b -> Tree a #

Functor Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Seq a -> Seq b #

(<$) :: a -> Seq b -> Seq a #

Functor FingerTree 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> FingerTree a -> FingerTree b #

(<$) :: a -> FingerTree b -> FingerTree a #

Functor Digit 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Digit a -> Digit b #

(<$) :: a -> Digit b -> Digit a #

Functor Node 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Node a -> Node b #

(<$) :: a -> Node b -> Node a #

Functor Elem 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> Elem a -> Elem b #

(<$) :: a -> Elem b -> Elem a #

Functor ViewL 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewL a -> ViewL b #

(<$) :: a -> ViewL b -> ViewL a #

Functor ViewR 
Instance details

Defined in Data.Sequence.Internal

Methods

fmap :: (a -> b) -> ViewR a -> ViewR b #

(<$) :: a -> ViewR b -> ViewR a #

Functor DList 
Instance details

Defined in Data.DList

Methods

fmap :: (a -> b) -> DList a -> DList b #

(<$) :: a -> DList b -> DList a #

Functor Interval 
Instance details

Defined in Numeric.Interval.Kaucher

Methods

fmap :: (a -> b) -> Interval a -> Interval b #

(<$) :: a -> Interval b -> Interval a #

Functor Doc 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Doc a -> Doc b #

(<$) :: a -> Doc b -> Doc a #

Functor AnnotDetails 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> AnnotDetails a -> AnnotDetails b #

(<$) :: a -> AnnotDetails b -> AnnotDetails a #

Functor Span 
Instance details

Defined in Text.PrettyPrint.Annotated.HughesPJ

Methods

fmap :: (a -> b) -> Span a -> Span b #

(<$) :: a -> Span b -> Span a #

Functor SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

fmap :: (a -> b) -> SmallArray a -> SmallArray b #

(<$) :: a -> SmallArray b -> SmallArray a #

Functor Array 
Instance details

Defined in Data.Primitive.Array

Methods

fmap :: (a -> b) -> Array a -> Array b #

(<$) :: a -> Array b -> Array a #

Functor Vector 
Instance details

Defined in Data.Vector

Methods

fmap :: (a -> b) -> Vector a -> Vector b #

(<$) :: a -> Vector b -> Vector a #

Functor Id 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Id a -> Id b #

(<$) :: a -> Id b -> Id a #

Functor Box 
Instance details

Defined in Data.Vector.Fusion.Util

Methods

fmap :: (a -> b) -> Box a -> Box b #

(<$) :: a -> Box b -> Box a #

Functor Stream 
Instance details

Defined in Codec.Compression.Zlib.Stream

Methods

fmap :: (a -> b) -> Stream a -> Stream b #

(<$) :: a -> Stream b -> Stream a #

Functor P

Since: base-4.8.0.0

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor Root 
Instance details

Defined in Numeric.RootFinding

Methods

fmap :: (a -> b) -> Root a -> Root b #

(<$) :: a -> Root b -> Root a #

Functor Log 
Instance details

Defined in Numeric.Log

Methods

fmap :: (a -> b) -> Log a -> Log b #

(<$) :: a -> Log b -> Log a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Functor V2 
Instance details

Defined in Linear.V2

Methods

fmap :: (a -> b) -> V2 a -> V2 b #

(<$) :: a -> V2 b -> V2 a #

Functor Renderable 
Instance details

Defined in Graphics.Rendering.Chart.Renderable

Methods

fmap :: (a -> b) -> Renderable a -> Renderable b #

(<$) :: a -> Renderable b -> Renderable a #

Functor Grid 
Instance details

Defined in Graphics.Rendering.Chart.Grid

Methods

fmap :: (a -> b) -> Grid a -> Grid b #

(<$) :: a -> Grid b -> Grid a #

Functor Polar 
Instance details

Defined in Diagrams.Coordinates.Polar

Methods

fmap :: (a -> b) -> Polar a -> Polar b #

(<$) :: a -> Polar b -> Polar a #

Functor Extending 
Instance details

Defined in Plots.Axis.Scale

Methods

fmap :: (a -> b) -> Extending a -> Extending b #

(<$) :: a -> Extending b -> Extending a #

Functor Active 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Active a -> Active b #

(<$) :: a -> Active b -> Active a #

Functor Dynamic 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Dynamic a -> Dynamic b #

(<$) :: a -> Dynamic b -> Dynamic a #

Functor Time 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Time a -> Time b #

(<$) :: a -> Time b -> Time a #

Functor V3 
Instance details

Defined in Linear.V3

Methods

fmap :: (a -> b) -> V3 a -> V3 b #

(<$) :: a -> V3 b -> V3 a #

Functor Angle 
Instance details

Defined in Diagrams.Angle

Methods

fmap :: (a -> b) -> Angle a -> Angle b #

(<$) :: a -> Angle b -> Angle a #

Functor FontSize 
Instance details

Defined in Diagrams.TwoD.Text

Methods

fmap :: (a -> b) -> FontSize a -> FontSize b #

(<$) :: a -> FontSize b -> FontSize a #

Functor V1 
Instance details

Defined in Linear.V1

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor Sh 
Instance details

Defined in Shelly.Base

Methods

fmap :: (a -> b) -> Sh a -> Sh b #

(<$) :: a -> Sh b -> Sh a #

Functor Duration 
Instance details

Defined in Data.Active

Methods

fmap :: (a -> b) -> Duration a -> Duration b #

(<$) :: a -> Duration b -> Duration a #

Functor Plucker 
Instance details

Defined in Linear.Plucker

Methods

fmap :: (a -> b) -> Plucker a -> Plucker b #

(<$) :: a -> Plucker b -> Plucker a #

Functor Quaternion 
Instance details

Defined in Linear.Quaternion

Methods

fmap :: (a -> b) -> Quaternion a -> Quaternion b #

(<$) :: a -> Quaternion b -> Quaternion a #

Functor V0 
Instance details

Defined in Linear.V0

Methods

fmap :: (a -> b) -> V0 a -> V0 b #

(<$) :: a -> V0 b -> V0 a #

Functor V4 
Instance details

Defined in Linear.V4

Methods

fmap :: (a -> b) -> V4 a -> V4 b #

(<$) :: a -> V4 b -> V4 a #

Functor BernsteinPoly 
Instance details

Defined in Diagrams.TwoD.Segment.Bernstein

Methods

fmap :: (a -> b) -> BernsteinPoly a -> BernsteinPoly b #

(<$) :: a -> BernsteinPoly b -> BernsteinPoly a #

Functor GraphPart 
Instance details

Defined in Diagrams.TwoD.Polygons

Methods

fmap :: (a -> b) -> GraphPart a -> GraphPart b #

(<$) :: a -> GraphPart b -> GraphPart a #

Functor (Either a)

Since: base-3.0

Instance details

Defined in Data.Either

Methods

fmap :: (a0 -> b) -> Either a a0 -> Either a b #

(<$) :: a0 -> Either a b -> Either a a0 #

Functor (V1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> V1 a -> V1 b #

(<$) :: a -> V1 b -> V1 a #

Functor (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> U1 a -> U1 b #

(<$) :: a -> U1 b -> U1 a #

Functor ((,) a)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a0 -> b) -> (a, a0) -> (a, b) #

(<$) :: a0 -> (a, b) -> (a, a0) #

Functor (HashMap k) 
Instance details

Defined in Data.HashMap.Base

Methods

fmap :: (a -> b) -> HashMap k a -> HashMap k b #

(<$) :: a -> HashMap k b -> HashMap k a #

Functor (Map k) 
Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> Map k a -> Map k b #

(<$) :: a -> Map k b -> Map k a #

Functor (Array i)

Since: base-2.1

Instance details

Defined in GHC.Arr

Methods

fmap :: (a -> b) -> Array i a -> Array i b #

(<$) :: a -> Array i b -> Array i a #

Functor (IResult i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> IResult i a -> IResult i b #

(<$) :: a -> IResult i b -> IResult i a #

Functor (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

fmap :: (a -> b) -> Parser i a -> Parser i b #

(<$) :: a -> Parser i b -> Parser i a #

Functor (Arg a)

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

fmap :: (a0 -> b) -> Arg a a0 -> Arg a b #

(<$) :: a0 -> Arg a b -> Arg a a0 #

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 #

(<$) :: a -> WrappedMonad m b -> WrappedMonad m a #

Arrow a => Functor (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b #

(<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 #

Functor (Proxy :: Type -> Type)

Since: base-4.7.0.0

Instance details

Defined in Data.Proxy

Methods

fmap :: (a -> b) -> Proxy a -> Proxy b #

(<$) :: a -> Proxy b -> Proxy a #

Functor m => Functor (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

fmap :: (a -> b) -> MaybeT m a -> MaybeT m b #

(<$) :: a -> MaybeT m b -> MaybeT m a #

Monad m => Functor (Handler m) 
Instance details

Defined in Control.Monad.Catch

Methods

fmap :: (a -> b) -> Handler m a -> Handler m b #

(<$) :: a -> Handler m b -> Handler m a #

Functor s => Functor (ViewL s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewL s a -> ViewL s b #

(<$) :: a -> ViewL s b -> ViewL s a #

Functor s => Functor (ViewR s) 
Instance details

Defined in Data.FingerTree

Methods

fmap :: (a -> b) -> ViewR s a -> ViewR s b #

(<$) :: a -> ViewR s b -> ViewR s a #

(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) 
Instance details

Defined in Generic.Data.Internal.Generically

Methods

fmap :: (a -> b) -> Generically1 f a -> Generically1 f b #

(<$) :: a -> Generically1 f b -> Generically1 f a #

Functor m => Functor (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

fmap :: (a -> b) -> ListT m a -> ListT m b #

(<$) :: a -> ListT m b -> ListT m a #

Profunctor p => Functor (Prep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Prep p a -> Prep p b #

(<$) :: a -> Prep p b -> Prep p a #

Profunctor p => Functor (Coprep p) 
Instance details

Defined in Data.Profunctor.Rep

Methods

fmap :: (a -> b) -> Coprep p a -> Coprep p b #

(<$) :: a -> Coprep p b -> Coprep p a #

Functor f => Functor (WrappedApplicative f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> WrappedApplicative f a -> WrappedApplicative f b #

(<$) :: a -> WrappedApplicative f b -> WrappedApplicative f a #

Functor f => Functor (MaybeApply f) 
Instance details

Defined in Data.Functor.Bind.Class

Methods

fmap :: (a -> b) -> MaybeApply f a -> MaybeApply f b #

(<$) :: a -> MaybeApply f b -> MaybeApply f a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Functor (Categorical p) 
Instance details

Defined in Data.Random.Distribution.Categorical

Methods

fmap :: (a -> b) -> Categorical p a -> Categorical p b #

(<$) :: a -> Categorical p b -> Categorical p a #

Functor (ListF a) 
Instance details

Defined in Data.Functor.Foldable

Methods

fmap :: (a0 -> b) -> ListF a a0 -> ListF a b #

(<$) :: a0 -> ListF a b -> ListF a a0 #

Functor f => Functor (Cofree f) 
Instance details

Defined in Control.Comonad.Cofree

Methods

fmap :: (a -> b) -> Cofree f a -> Cofree f b #

(<$) :: a -> Cofree f b -> Cofree f a #

Functor f => Functor (Free f) 
Instance details

Defined in Control.Monad.Free

Methods

fmap :: (a -> b) -> Free f a -> Free f b #

(<$) :: a -> Free f b -> Free f a #

Functor (NonEmptyF a) 
Instance details

Defined in Data.Functor.Base

Methods

fmap :: (a0 -> b) -> NonEmptyF a a0 -> NonEmptyF a b #

(<$) :: a0 -> NonEmptyF a b -> NonEmptyF a a0 #

Functor v => Functor (SizeSpec v) 
Instance details

Defined in Diagrams.Size

Methods

fmap :: (a -> b) -> SizeSpec v a -> SizeSpec v b #

(<$) :: a -> SizeSpec v b -> SizeSpec v a #

Functor (Measured n) 
Instance details

Defined in Diagrams.Core.Measure

Methods

fmap :: (a -> b) -> Measured n a -> Measured n b #

(<$) :: a -> Measured n b -> Measured n a #

Functor f => Functor (Point f) 
Instance details

Defined in Linear.Affine

Methods

fmap :: (a -> b) -> Point f a -> Point f b #

(<$) :: a -> Point f b -> Point f a #

Functor (Level i) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b) -> Level i a -> Level i b #

(<$) :: a -> Level i b -> Level i a #

Functor (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedFold s a -> ReifiedFold s b #

(<$) :: a -> ReifiedFold s b -> ReifiedFold s a #

Functor (ReifiedGetter s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b #

(<$) :: a -> ReifiedGetter s b -> ReifiedGetter s a #

Functor f => Functor (Co f) 
Instance details

Defined in Data.Functor.Rep

Methods

fmap :: (a -> b) -> Co f a -> Co f b #

(<$) :: a -> Co f b -> Co f a #

Functor v => Functor (Direction v) 
Instance details

Defined in Diagrams.Direction

Methods

fmap :: (a -> b) -> Direction v a -> Direction v b #

(<$) :: a -> Direction v b -> Direction v a #

Functor v => Functor (BoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> BoundingBox v a -> BoundingBox v b #

(<$) :: a -> BoundingBox v b -> BoundingBox v a #

Functor f => Functor (Indexing f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing f a -> Indexing f b #

(<$) :: a -> Indexing f b -> Indexing f a #

Functor v => Functor (NonEmptyBoundingBox v) 
Instance details

Defined in Diagrams.BoundingBox

Methods

fmap :: (a -> b) -> NonEmptyBoundingBox v a -> NonEmptyBoundingBox v b #

(<$) :: a -> NonEmptyBoundingBox v b -> NonEmptyBoundingBox v a #

Functor (Yoneda f) 
Instance details

Defined in Data.Functor.Yoneda

Methods

fmap :: (a -> b) -> Yoneda f a -> Yoneda f b #

(<$) :: a -> Yoneda f b -> Yoneda f a #

Functor f => Functor (Indexing64 f) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a -> b) -> Indexing64 f a -> Indexing64 f b #

(<$) :: a -> Indexing64 f b -> Indexing64 f a #

Functor f => Functor (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> Rec1 f a -> Rec1 f b #

(<$) :: a -> Rec1 f b -> Rec1 f a #

Functor (URec Char :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Char a -> URec Char b #

(<$) :: a -> URec Char b -> URec Char a #

Functor (URec Double :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Double a -> URec Double b #

(<$) :: a -> URec Double b -> URec Double a #

Functor (URec Float :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Float a -> URec Float b #

(<$) :: a -> URec Float b -> URec Float a #

Functor (URec Int :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Int a -> URec Int b #

(<$) :: a -> URec Int b -> URec Int a #

Functor (URec Word :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec Word a -> URec Word b #

(<$) :: a -> URec Word b -> URec Word a #

Functor (URec (Ptr ()) :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> URec (Ptr ()) a -> URec (Ptr ()) b #

(<$) :: a -> URec (Ptr ()) b -> URec (Ptr ()) a #

Functor m => Functor (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

fmap :: (a -> b) -> RandT g m a -> RandT g m b #

(<$) :: a -> RandT g m b -> RandT g m a #

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 #

(<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 #

Functor (Const m :: Type -> Type)

Since: base-2.1

Instance details

Defined in Data.Functor.Const

Methods

fmap :: (a -> b) -> Const m a -> Const m b #

(<$) :: a -> Const m b -> Const m a #

Functor f => Functor (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

fmap :: (a -> b) -> Ap f a -> Ap f b #

(<$) :: a -> Ap f b -> Ap f a #

Functor f => Functor (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

fmap :: (a -> b) -> Alt f a -> Alt f b #

(<$) :: a -> Alt f b -> Alt f a #

Bifunctor p => Functor (Join p) 
Instance details

Defined in Data.Bifunctor.Join

Methods

fmap :: (a -> b) -> Join p a -> Join p b #

(<$) :: a -> Join p b -> Join p a #

Bifunctor p => Functor (Fix p) 
Instance details

Defined in Data.Bifunctor.Fix

Methods

fmap :: (a -> b) -> Fix p a -> Fix p b #

(<$) :: a -> Fix p b -> Fix p a #

Functor m => Functor (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

fmap :: (a -> b) -> IdentityT m a -> IdentityT m b #

(<$) :: a -> IdentityT m b -> IdentityT m a #

(Applicative f, Monad f) => Functor (WhenMissing f x)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b #

(<$) :: a -> WhenMissing f x b -> WhenMissing f x a #

Functor m => Functor (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

fmap :: (a -> b) -> ExceptT e m a -> ExceptT e m b #

(<$) :: a -> ExceptT e m b -> ExceptT e m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

fmap :: (a -> b) -> ReaderT r m a -> ReaderT r m b #

(<$) :: a -> ReaderT r m b -> ReaderT r m a #

Functor m => Functor (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b #

(<$) :: a -> ErrorT e m b -> ErrorT e m a #

Functor m => Functor (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b #

(<$) :: a -> StateT s m b -> StateT s m a #

Functor m => Functor (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

fmap :: (a -> b) -> WriterT w m a -> WriterT w m b #

(<$) :: a -> WriterT w m b -> WriterT w m a #

Profunctor p => Functor (TambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> TambaraSum p a a0 -> TambaraSum p a b #

(<$) :: a0 -> TambaraSum p a b -> TambaraSum p a a0 #

Functor (CotambaraSum p a) 
Instance details

Defined in Data.Profunctor.Choice

Methods

fmap :: (a0 -> b) -> CotambaraSum p a a0 -> CotambaraSum p a b #

(<$) :: a0 -> CotambaraSum p a b -> CotambaraSum p a a0 #

Profunctor p => Functor (Tambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Tambara p a a0 -> Tambara p a b #

(<$) :: a0 -> Tambara p a b -> Tambara p a a0 #

Functor (Cotambara p a) 
Instance details

Defined in Data.Profunctor.Strong

Methods

fmap :: (a0 -> b) -> Cotambara p a a0 -> Cotambara p a b #

(<$) :: a0 -> Cotambara p a b -> Cotambara p a a0 #

Functor f => Functor (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Star f a a0 -> Star f a b #

(<$) :: a0 -> Star f a b -> Star f a a0 #

Functor (Costar f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Costar f a a0 -> Costar f a b #

(<$) :: a0 -> Costar f a b -> Costar f a a0 #

Functor (Forget r a) 
Instance details

Defined in Data.Profunctor.Types

Methods

fmap :: (a0 -> b) -> Forget r a a0 -> Forget r a b #

(<$) :: a0 -> Forget r a b -> Forget r a a0 #

Functor (Tagged s) 
Instance details

Defined in Data.Tagged

Methods

fmap :: (a -> b) -> Tagged s a -> Tagged s b #

(<$) :: a -> Tagged s b -> Tagged s a #

Functor f => Functor (Backwards f)

Derived instance.

Instance details

Defined in Control.Applicative.Backwards

Methods

fmap :: (a -> b) -> Backwards f a -> Backwards f b #

(<$) :: a -> Backwards f b -> Backwards f a #

Monad m => Functor (Bundle m v) 
Instance details

Defined in Data.Vector.Fusion.Bundle.Monadic

Methods

fmap :: (a -> b) -> Bundle m v a -> Bundle m v b #

(<$) :: a -> Bundle m v b -> Bundle m v a #

Functor (Mag a b) 
Instance details

Defined in Data.Biapplicative

Methods

fmap :: (a0 -> b0) -> Mag a b a0 -> Mag a b b0 #

(<$) :: a0 -> Mag a b b0 -> Mag a b a0 #

(Functor f, Functor w) => Functor (CofreeT f w) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a -> b) -> CofreeT f w a -> CofreeT f w b #

(<$) :: a -> CofreeT f w b -> CofreeT f w a #

Functor f => Functor (CofreeF f a) 
Instance details

Defined in Control.Comonad.Trans.Cofree

Methods

fmap :: (a0 -> b) -> CofreeF f a a0 -> CofreeF f a b #

(<$) :: a0 -> CofreeF f a b -> CofreeF f a a0 #

(Functor f, Monad m) => Functor (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a -> b) -> FreeT f m a -> FreeT f m b #

(<$) :: a -> FreeT f m b -> FreeT f m a #

Functor f => Functor (FreeF f a) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

fmap :: (a0 -> b) -> FreeF f a a0 -> FreeF f a b #

(<$) :: a0 -> FreeF f a b -> FreeF f a a0 #

Functor (Query v n) 
Instance details

Defined in Diagrams.Core.Query

Methods

fmap :: (a -> b) -> Query v n a -> Query v n b #

(<$) :: a -> Query v n b -> Query v n a #

Functor v => Functor (Segment c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Segment c v a -> Segment c v b #

(<$) :: a -> Segment c v b -> Segment c v a #

Functor (Context a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Context a b a0 -> Context a b b0 #

(<$) :: a0 -> Context a b b0 -> Context a b a0 #

Functor (Indexed i a) 
Instance details

Defined in Control.Lens.Internal.Indexed

Methods

fmap :: (a0 -> b) -> Indexed i a a0 -> Indexed i a b #

(<$) :: a0 -> Indexed i a b -> Indexed i a a0 #

Functor (ReifiedIndexedFold i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s b #

(<$) :: a -> ReifiedIndexedFold i s b -> ReifiedIndexedFold i s a #

Functor (ReifiedIndexedGetter i s) 
Instance details

Defined in Control.Lens.Reified

Methods

fmap :: (a -> b) -> ReifiedIndexedGetter i s a -> ReifiedIndexedGetter i s b #

(<$) :: a -> ReifiedIndexedGetter i s b -> ReifiedIndexedGetter i s a #

Functor v => Functor (Offset c v) 
Instance details

Defined in Diagrams.Segment

Methods

fmap :: (a -> b) -> Offset c v a -> Offset c v b #

(<$) :: a -> Offset c v b -> Offset c v a #

Functor (V n) 
Instance details

Defined in Linear.V

Methods

fmap :: (a -> b) -> V n a -> V n b #

(<$) :: a -> V n b -> V n a #

Functor (Day f g) 
Instance details

Defined in Data.Functor.Day

Methods

fmap :: (a -> b) -> Day f g a -> Day f g b #

(<$) :: a -> Day f g b -> Day f g a #

Functor (Mafic a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 #

(<$) :: a0 -> Mafic a b b0 -> Mafic a b a0 #

Functor f => Functor (AlongsideLeft f b) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a -> b0) -> AlongsideLeft f b a -> AlongsideLeft f b b0 #

(<$) :: a -> AlongsideLeft f b b0 -> AlongsideLeft f b a #

Functor f => Functor (AlongsideRight f a) 
Instance details

Defined in Control.Lens.Internal.Getter

Methods

fmap :: (a0 -> b) -> AlongsideRight f a a0 -> AlongsideRight f a b #

(<$) :: a0 -> AlongsideRight f a b -> AlongsideRight f a a0 #

Functor (Flows i b) 
Instance details

Defined in Control.Lens.Internal.Level

Methods

fmap :: (a -> b0) -> Flows i b a -> Flows i b b0 #

(<$) :: a -> Flows i b b0 -> Flows i b a #

Functor (Holes t m) 
Instance details

Defined in Control.Lens.Traversal

Methods

fmap :: (a -> b) -> Holes t m a -> Holes t m b #

(<$) :: a -> Holes t m b -> Holes t m a #

Functor g => Functor (Curried g h) 
Instance details

Defined in Data.Functor.Day.Curried

Methods

fmap :: (a -> b) -> Curried g h a -> Curried g h b #

(<$) :: a -> Curried g h b -> Curried g h a #

Functor ((->) r :: Type -> Type)

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

fmap :: (a -> b) -> (r -> a) -> r -> b #

(<$) :: a -> (r -> b) -> r -> a #

Functor (K1 i c :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> K1 i c a -> K1 i c b #

(<$) :: a -> K1 i c b -> K1 i c a #

(Functor f, Functor g) => Functor (f :+: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :+: g) a -> (f :+: g) b #

(<$) :: a -> (f :+: g) b -> (f :+: g) a #

(Functor f, Functor g) => Functor (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :*: g) a -> (f :*: g) b #

(<$) :: a -> (f :*: g) b -> (f :*: g) a #

(Functor f, Functor g) => Functor (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

fmap :: (a -> b) -> Product f g a -> Product f g b #

(<$) :: a -> Product f g b -> Product f g a #

(Functor f, Functor g) => Functor (Sum f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Sum

Methods

fmap :: (a -> b) -> Sum f g a -> Sum f g b #

(<$) :: a -> Sum f g b -> Sum f g a #

Functor f => Functor (WhenMatched f x y)

Since: containers-0.5.9

Instance details

Defined in Data.IntMap.Internal

Methods

fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b #

(<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a #

(Applicative f, Monad f) => Functor (WhenMissing f k x)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b #

(<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a #

Functor (ContT r m) 
Instance details

Defined in Control.Monad.Trans.Cont

Methods

fmap :: (a -> b) -> ContT r m a -> ContT r m b #

(<$) :: a -> ContT r m b -> ContT r m a #

Profunctor p => Functor (Procompose p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b #

(<$) :: a0 -> Procompose p q a b -> Procompose p q a a0 #

Profunctor p => Functor (Rift p q a) 
Instance details

Defined in Data.Profunctor.Composition

Methods

fmap :: (a0 -> b) -> Rift p q a a0 -> Rift p q a b #

(<$) :: a0 -> Rift p q a b -> Rift p q a a0 #

Functor (QDiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiagram b v n a -> QDiagram b v n b0 #

(<$) :: a -> QDiagram b v n b0 -> QDiagram b v n a #

Functor (SubMap b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> SubMap b v n a -> SubMap b v n b0 #

(<$) :: a -> SubMap b v n b0 -> SubMap b v n a #

Functor (Subdiagram b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> Subdiagram b v n a -> Subdiagram b v n b0 #

(<$) :: a -> Subdiagram b v n b0 -> Subdiagram b v n a #

Functor (Exchange a b s) 
Instance details

Defined in Control.Lens.Internal.Iso

Methods

fmap :: (a0 -> b0) -> Exchange a b s a0 -> Exchange a b s b0 #

(<$) :: a0 -> Exchange a b s b0 -> Exchange a b s a0 #

Functor (Bazaar p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 #

(<$) :: a0 -> Bazaar p a b b0 -> Bazaar p a b a0 #

Functor (Bazaar1 p a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> Bazaar1 p a b a0 -> Bazaar1 p a b b0 #

(<$) :: a0 -> Bazaar1 p a b b0 -> Bazaar1 p a b a0 #

Functor (Magma i t b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a -> b0) -> Magma i t b a -> Magma i t b b0 #

(<$) :: a -> Magma i t b b0 -> Magma i t b a #

Functor (QDiaLeaf b v n) 
Instance details

Defined in Diagrams.Core.Types

Methods

fmap :: (a -> b0) -> QDiaLeaf b v n a -> QDiaLeaf b v n b0 #

(<$) :: a -> QDiaLeaf b v n b0 -> QDiaLeaf b v n a #

Functor (DUALTree d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTree d u a a0 -> DUALTree d u a b #

(<$) :: a0 -> DUALTree d u a b -> DUALTree d u a a0 #

Functor (DUALTreeU d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeU d u a a0 -> DUALTreeU d u a b #

(<$) :: a0 -> DUALTreeU d u a b -> DUALTreeU d u a a0 #

Functor (DUALTreeNE d u a) 
Instance details

Defined in Data.Tree.DUAL.Internal

Methods

fmap :: (a0 -> b) -> DUALTreeNE d u a a0 -> DUALTreeNE d u a b #

(<$) :: a0 -> DUALTreeNE d u a b -> DUALTreeNE d u a a0 #

Functor (Molten i a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 #

(<$) :: a0 -> Molten i a b b0 -> Molten i a b a0 #

Functor (Pretext p a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> Pretext p a b a0 -> Pretext p a b b0 #

(<$) :: a0 -> Pretext p a b b0 -> Pretext p a b a0 #

Functor f => Functor (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> M1 i c f a -> M1 i c f b #

(<$) :: a -> M1 i c f b -> M1 i c f a #

(Functor f, Functor g) => Functor (f :.: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b #

(<$) :: a -> (f :.: g) b -> (f :.: g) a #

(Functor f, Functor g) => Functor (Compose f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Compose

Methods

fmap :: (a -> b) -> Compose f g a -> Compose f g b #

(<$) :: a -> Compose f g b -> Compose f g a #

Bifunctor p => Functor (WrappedBifunctor p a) 
Instance details

Defined in Data.Bifunctor.Wrapped

Methods

fmap :: (a0 -> b) -> WrappedBifunctor p a a0 -> WrappedBifunctor p a b #

(<$) :: a0 -> WrappedBifunctor p a b -> WrappedBifunctor p a a0 #

Functor g => Functor (Joker g a) 
Instance details

Defined in Data.Bifunctor.Joker

Methods

fmap :: (a0 -> b) -> Joker g a a0 -> Joker g a b #

(<$) :: a0 -> Joker g a b -> Joker g a a0 #

Bifunctor p => Functor (Flip p a) 
Instance details

Defined in Data.Bifunctor.Flip

Methods

fmap :: (a0 -> b) -> Flip p a a0 -> Flip p a b #

(<$) :: a0 -> Flip p a b -> Flip p a a0 #

Functor (Clown f a :: Type -> Type) 
Instance details

Defined in Data.Bifunctor.Clown

Methods

fmap :: (a0 -> b) -> Clown f a a0 -> Clown f a b #

(<$) :: a0 -> Clown f a b -> Clown f a a0 #

Functor f => Functor (WhenMatched f k x y)

Since: containers-0.5.9

Instance details

Defined in Data.Map.Internal

Methods

fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b #

(<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Functor m => Functor (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b #

(<$) :: a -> RWST r w s m b -> RWST r w s m a #

Reifies s (ReifiedApplicative f) => Functor (ReflectedApplicative f s) 
Instance details

Defined in Data.Reflection

Methods

fmap :: (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b #

(<$) :: a -> ReflectedApplicative f s b -> ReflectedApplicative f s a #

Functor (TakingWhile p f a b) 
Instance details

Defined in Control.Lens.Internal.Magma

Methods

fmap :: (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 #

(<$) :: a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 #

Functor (PretextT p g a b) 
Instance details

Defined in Control.Lens.Internal.Context

Methods

fmap :: (a0 -> b0) -> PretextT p g a b a0 -> PretextT p g a b b0 #

(<$) :: a0 -> PretextT p g a b b0 -> PretextT p g a b a0 #

Functor (BazaarT p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 #

(<$) :: a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 #

Functor (BazaarT1 p g a b) 
Instance details

Defined in Control.Lens.Internal.Bazaar

Methods

fmap :: (a0 -> b0) -> BazaarT1 p g a b a0 -> BazaarT1 p g a b b0 #

(<$) :: a0 -> BazaarT1 p g a b b0 -> BazaarT1 p g a b a0 #

Monad state => Functor (Builder collection mutCollection step state err) 
Instance details

Defined in Basement.MutableBuilder

Methods

fmap :: (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b #

(<$) :: a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a #

(Functor f, Bifunctor p) => Functor (Tannen f p a) 
Instance details

Defined in Data.Bifunctor.Tannen

Methods

fmap :: (a0 -> b) -> Tannen f p a a0 -> Tannen f p a b #

(<$) :: a0 -> Tannen f p a b -> Tannen f p a a0 #

(Bifunctor p, Functor g) => Functor (Biff p f g a) 
Instance details

Defined in Data.Bifunctor.Biff

Methods

fmap :: (a0 -> b) -> Biff p f g a a0 -> Biff p f g a b #

(<$) :: a0 -> Biff p f g a b -> Biff p f g a a0 #

mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For - a version that ignores the results see mapM_.

sequence :: (Traversable t, Monad m) => t (m a) -> m (t a) #

Evaluate each monadic action in the structure from left to + a version that ignores the results see mapM_.

sequence :: (Traversable t, Monad m) => t (m a) -> m (t a) #

Evaluate each monadic action in the structure from left to right, and collect the results. For a version that ignores the - results see sequence_.

class (Alternative m, Monad m) => MonadPlus (m :: * -> *) where #

Monads that also support choice and failure.

Methods

mzero :: m a #

The identity of mplus. It should also satisfy the equations

mzero >>= f  =  mzero
-v >> mzero   =  mzero

The default definition is

mzero = empty
-

mplus :: m a -> m a -> m a #

An associative operation. The default definition is

mplus = (<|>)
-
Instances
MonadPlus []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: [a] #

mplus :: [a] -> [a] -> [a] #

MonadPlus Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: Maybe a #

mplus :: Maybe a -> Maybe a -> Maybe a #

MonadPlus IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mzero :: IO a #

mplus :: IO a -> IO a -> IO a #

MonadPlus Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mzero :: Option a #

mplus :: Option a -> Option a -> Option a #

MonadPlus ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

mzero :: ReadPrec a #

mplus :: ReadPrec a -> ReadPrec a -> ReadPrec a #

MonadPlus ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

mzero :: ReadP a #

mplus :: ReadP a -> ReadP a -> ReadP a #

MonadPlus Get

Since: 0.7.1.0

Instance details

Defined in Data.Binary.Get.Internal

Methods

mzero :: Get a #

mplus :: Get a -> Get a -> Get a #

MonadPlus Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

mzero :: Seq a #

mplus :: Seq a -> Seq a -> Seq a #

MonadPlus DList 
Instance details

Defined in Data.DList

Methods

mzero :: DList a #

mplus :: DList a -> DList a -> DList a #

MonadPlus Array 
Instance details

Defined in Data.Primitive.Array

Methods

mzero :: Array a #

mplus :: Array a -> Array a -> Array a #

MonadPlus P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

mzero :: P a #

mplus :: P a -> P a -> P a #

MonadPlus Vector 
Instance details

Defined in Data.Vector

Methods

mzero :: Vector a #

mplus :: Vector a -> Vector a -> Vector a #

MonadPlus Root 
Instance details

Defined in Numeric.RootFinding

Methods

mzero :: Root a #

mplus :: Root a -> Root a -> Root a #

MonadPlus Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: Parser a #

mplus :: Parser a -> Parser a -> Parser a #

MonadPlus IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: IResult a #

mplus :: IResult a -> IResult a -> IResult a #

MonadPlus Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: Result a #

mplus :: Result a -> Result a -> Result a #

MonadPlus (U1 :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: U1 a #

mplus :: U1 a -> U1 a -> U1 a #

MonadPlus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

mzero :: ReifiedFold s a #

mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

(ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

mzero :: ArrowMonad a a0 #

mplus :: ArrowMonad a a0 -> ArrowMonad a a0 -> ArrowMonad a a0 #

MonadPlus (Proxy :: * -> *)

Since: base-4.9.0.0

Instance details

Defined in Data.Proxy

Methods

mzero :: Proxy a #

mplus :: Proxy a -> Proxy a -> Proxy a #

Monad m => MonadPlus (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

mzero :: MaybeT m a #

mplus :: MaybeT m a -> MaybeT m a -> MaybeT m a #

Monad m => MonadPlus (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

mzero :: ListT m a #

mplus :: ListT m a -> ListT m a -> ListT m a #

MonadPlus (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mzero :: Parser i a #

mplus :: Parser i a -> Parser i a -> Parser i a #

(Functor v, MonadPlus v) => MonadPlus (Free v) 
Instance details

Defined in Control.Monad.Free

Methods

mzero :: Free v a #

mplus :: Free v a -> Free v a -> Free v a #

MonadPlus m => MonadPlus (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

mzero :: Yoneda m a #

mplus :: Yoneda m a -> Yoneda m a -> Yoneda m a #

MonadPlus f => MonadPlus (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: Rec1 f a #

mplus :: Rec1 f a -> Rec1 f a -> Rec1 f a #

MonadPlus f => MonadPlus (Alt f) 
Instance details

Defined in Data.Semigroup.Internal

Methods

mzero :: Alt f a #

mplus :: Alt f a -> Alt f a -> Alt f a #

MonadPlus m => MonadPlus (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

mzero :: IdentityT m a #

mplus :: IdentityT m a -> IdentityT m a -> IdentityT m a #

(Monad m, Monoid e) => MonadPlus (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

mzero :: ExceptT e m a #

mplus :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

(Monad m, Error e) => MonadPlus (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

mzero :: ErrorT e m a #

mplus :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

mzero :: WriterT w m a #

mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #

MonadPlus m => MonadPlus (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

mzero :: StateT s m a #

mplus :: StateT s m a -> StateT s m a -> StateT s m a #

MonadPlus m => MonadPlus (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

mzero :: StateT s m a #

mplus :: StateT s m a -> StateT s m a -> StateT s m a #

(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

mzero :: WriterT w m a #

mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #

MonadPlus m => MonadPlus (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

mzero :: RandT g m a #

mplus :: RandT g m a -> RandT g m a -> RandT g m a #

(Functor f, MonadPlus m) => MonadPlus (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

mzero :: FreeT f m a #

mplus :: FreeT f m a -> FreeT f m a -> FreeT f m a #

MonadPlus f => MonadPlus (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

mzero :: Star f a a0 #

mplus :: Star f a a0 -> Star f a a0 -> Star f a a0 #

(MonadPlus f, MonadPlus g) => MonadPlus (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: (f :*: g) a #

mplus :: (f :*: g) a -> (f :*: g) a -> (f :*: g) a #

(MonadPlus f, MonadPlus g) => MonadPlus (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

mzero :: Product f g a #

mplus :: Product f g a -> Product f g a -> Product f g a #

MonadPlus m => MonadPlus (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

mzero :: ReaderT r m a #

mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #

MonadPlus f => MonadPlus (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: M1 i c f a #

mplus :: M1 i c f a -> M1 i c f a -> M1 i c f a #

(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

mzero :: RWST r w s m a #

mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #

(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

mzero :: RWST r w s m a #

mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #

(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #

Same as >>=, but with the arguments interchanged.

when :: Applicative f => Bool -> f () -> f () #

Conditional execution of Applicative expressions. For example,

when debug (putStrLn "Debugging")

will output the string Debugging if the Boolean value debug + results see sequence_.

class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #

Monads that also support choice and failure.

Minimal complete definition

Nothing

Methods

mzero :: m a #

The identity of mplus. It should also satisfy the equations

mzero >>= f  =  mzero
+v >> mzero   =  mzero

The default definition is

mzero = empty
+

mplus :: m a -> m a -> m a #

An associative operation. The default definition is

mplus = (<|>)
+
Instances
MonadPlus []

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: [a] #

mplus :: [a] -> [a] -> [a] #

MonadPlus Maybe

Since: base-2.1

Instance details

Defined in GHC.Base

Methods

mzero :: Maybe a #

mplus :: Maybe a -> Maybe a -> Maybe a #

MonadPlus IO

Since: base-4.9.0.0

Instance details

Defined in GHC.Base

Methods

mzero :: IO a #

mplus :: IO a -> IO a -> IO a #

MonadPlus IResult 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: IResult a #

mplus :: IResult a -> IResult a -> IResult a #

MonadPlus Result 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: Result a #

mplus :: Result a -> Result a -> Result a #

MonadPlus Parser 
Instance details

Defined in Data.Aeson.Types.Internal

Methods

mzero :: Parser a #

mplus :: Parser a -> Parser a -> Parser a #

MonadPlus Option

Since: base-4.9.0.0

Instance details

Defined in Data.Semigroup

Methods

mzero :: Option a #

mplus :: Option a -> Option a -> Option a #

MonadPlus ReadPrec

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadPrec

Methods

mzero :: ReadPrec a #

mplus :: ReadPrec a -> ReadPrec a -> ReadPrec a #

MonadPlus ReadP

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

mzero :: ReadP a #

mplus :: ReadP a -> ReadP a -> ReadP a #

MonadPlus Get

Since: 0.7.1.0

Instance details

Defined in Data.Binary.Get.Internal

Methods

mzero :: Get a #

mplus :: Get a -> Get a -> Get a #

MonadPlus Parser 
Instance details

Defined in Data.Csv.Conversion

Methods

mzero :: Parser a #

mplus :: Parser a -> Parser a -> Parser a #

MonadPlus Seq 
Instance details

Defined in Data.Sequence.Internal

Methods

mzero :: Seq a #

mplus :: Seq a -> Seq a -> Seq a #

MonadPlus DList 
Instance details

Defined in Data.DList

Methods

mzero :: DList a #

mplus :: DList a -> DList a -> DList a #

MonadPlus SmallArray 
Instance details

Defined in Data.Primitive.SmallArray

Methods

mzero :: SmallArray a #

mplus :: SmallArray a -> SmallArray a -> SmallArray a #

MonadPlus Array 
Instance details

Defined in Data.Primitive.Array

Methods

mzero :: Array a #

mplus :: Array a -> Array a -> Array a #

MonadPlus Vector 
Instance details

Defined in Data.Vector

Methods

mzero :: Vector a #

mplus :: Vector a -> Vector a -> Vector a #

MonadPlus P

Since: base-2.1

Instance details

Defined in Text.ParserCombinators.ReadP

Methods

mzero :: P a #

mplus :: P a -> P a -> P a #

MonadPlus Root 
Instance details

Defined in Numeric.RootFinding

Methods

mzero :: Root a #

mplus :: Root a -> Root a -> Root a #

MonadPlus (U1 :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: U1 a #

mplus :: U1 a -> U1 a -> U1 a #

MonadPlus (Parser i) 
Instance details

Defined in Data.Attoparsec.Internal.Types

Methods

mzero :: Parser i a #

mplus :: Parser i a -> Parser i a -> Parser i a #

(ArrowApply a, ArrowPlus a) => MonadPlus (ArrowMonad a)

Since: base-4.6.0.0

Instance details

Defined in Control.Arrow

Methods

mzero :: ArrowMonad a a0 #

mplus :: ArrowMonad a a0 -> ArrowMonad a a0 -> ArrowMonad a a0 #

MonadPlus (Proxy :: Type -> Type)

Since: base-4.9.0.0

Instance details

Defined in Data.Proxy

Methods

mzero :: Proxy a #

mplus :: Proxy a -> Proxy a -> Proxy a #

Monad m => MonadPlus (MaybeT m) 
Instance details

Defined in Control.Monad.Trans.Maybe

Methods

mzero :: MaybeT m a #

mplus :: MaybeT m a -> MaybeT m a -> MaybeT m a #

Monad m => MonadPlus (ListT m) 
Instance details

Defined in Control.Monad.Trans.List

Methods

mzero :: ListT m a #

mplus :: ListT m a -> ListT m a -> ListT m a #

(Functor v, MonadPlus v) => MonadPlus (Free v) 
Instance details

Defined in Control.Monad.Free

Methods

mzero :: Free v a #

mplus :: Free v a -> Free v a -> Free v a #

MonadPlus (ReifiedFold s) 
Instance details

Defined in Control.Lens.Reified

Methods

mzero :: ReifiedFold s a #

mplus :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a #

MonadPlus m => MonadPlus (Yoneda m) 
Instance details

Defined in Data.Functor.Yoneda

Methods

mzero :: Yoneda m a #

mplus :: Yoneda m a -> Yoneda m a -> Yoneda m a #

MonadPlus f => MonadPlus (Rec1 f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: Rec1 f a #

mplus :: Rec1 f a -> Rec1 f a -> Rec1 f a #

MonadPlus m => MonadPlus (RandT g m) 
Instance details

Defined in Control.Monad.Trans.Random.Lazy

Methods

mzero :: RandT g m a #

mplus :: RandT g m a -> RandT g m a -> RandT g m a #

MonadPlus f => MonadPlus (Ap f)

Since: base-4.12.0.0

Instance details

Defined in Data.Monoid

Methods

mzero :: Ap f a #

mplus :: Ap f a -> Ap f a -> Ap f a #

MonadPlus f => MonadPlus (Alt f)

Since: base-4.8.0.0

Instance details

Defined in Data.Semigroup.Internal

Methods

mzero :: Alt f a #

mplus :: Alt f a -> Alt f a -> Alt f a #

MonadPlus m => MonadPlus (IdentityT m) 
Instance details

Defined in Control.Monad.Trans.Identity

Methods

mzero :: IdentityT m a #

mplus :: IdentityT m a -> IdentityT m a -> IdentityT m a #

(Monad m, Monoid e) => MonadPlus (ExceptT e m) 
Instance details

Defined in Control.Monad.Trans.Except

Methods

mzero :: ExceptT e m a #

mplus :: ExceptT e m a -> ExceptT e m a -> ExceptT e m a #

(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Lazy

Methods

mzero :: WriterT w m a #

mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #

MonadPlus m => MonadPlus (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Lazy

Methods

mzero :: StateT s m a #

mplus :: StateT s m a -> StateT s m a -> StateT s m a #

MonadPlus m => MonadPlus (ReaderT r m) 
Instance details

Defined in Control.Monad.Trans.Reader

Methods

mzero :: ReaderT r m a #

mplus :: ReaderT r m a -> ReaderT r m a -> ReaderT r m a #

(Monad m, Error e) => MonadPlus (ErrorT e m) 
Instance details

Defined in Control.Monad.Trans.Error

Methods

mzero :: ErrorT e m a #

mplus :: ErrorT e m a -> ErrorT e m a -> ErrorT e m a #

MonadPlus m => MonadPlus (StateT s m) 
Instance details

Defined in Control.Monad.Trans.State.Strict

Methods

mzero :: StateT s m a #

mplus :: StateT s m a -> StateT s m a -> StateT s m a #

(Monoid w, MonadPlus m) => MonadPlus (WriterT w m) 
Instance details

Defined in Control.Monad.Trans.Writer.Strict

Methods

mzero :: WriterT w m a #

mplus :: WriterT w m a -> WriterT w m a -> WriterT w m a #

MonadPlus f => MonadPlus (Star f a) 
Instance details

Defined in Data.Profunctor.Types

Methods

mzero :: Star f a a0 #

mplus :: Star f a a0 -> Star f a a0 -> Star f a a0 #

(Functor f, MonadPlus m) => MonadPlus (FreeT f m) 
Instance details

Defined in Control.Monad.Trans.Free

Methods

mzero :: FreeT f m a #

mplus :: FreeT f m a -> FreeT f m a -> FreeT f m a #

(MonadPlus f, MonadPlus g) => MonadPlus (f :*: g)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: (f :*: g) a #

mplus :: (f :*: g) a -> (f :*: g) a -> (f :*: g) a #

(MonadPlus f, MonadPlus g) => MonadPlus (Product f g)

Since: base-4.9.0.0

Instance details

Defined in Data.Functor.Product

Methods

mzero :: Product f g a #

mplus :: Product f g a -> Product f g a -> Product f g a #

MonadPlus f => MonadPlus (M1 i c f)

Since: base-4.9.0.0

Instance details

Defined in GHC.Generics

Methods

mzero :: M1 i c f a #

mplus :: M1 i c f a -> M1 i c f a -> M1 i c f a #

(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Lazy

Methods

mzero :: RWST r w s m a #

mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #

(Monoid w, MonadPlus m) => MonadPlus (RWST r w s m) 
Instance details

Defined in Control.Monad.Trans.RWS.Strict

Methods

mzero :: RWST r w s m a #

mplus :: RWST r w s m a -> RWST r w s m a -> RWST r w s m a #

(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #

Same as >>=, but with the arguments interchanged.

when :: Applicative f => Bool -> f () -> f () #

Conditional execution of Applicative expressions. For example,

when debug (putStrLn "Debugging")

will output the string Debugging if the Boolean value debug is True, and otherwise do nothing.

liftM :: Monad m => (a1 -> r) -> m a1 -> m r #

Promote a function to a monad.

liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r #

Promote a function to a monad, scanning the monadic arguments from left to right. For example,

liftM2 (+) [0,1] [0,2] = [0,2,1,3]
 liftM2 (+) (Just 1) Nothing = Nothing

liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r #

Promote a function to a monad, scanning the monadic arguments from @@ -640,7 +786,7 @@ left to right (cf. liftM2).

liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r #

Promote a function to a monad, scanning the monadic arguments from left to right (cf. liftM2).

ap :: Monad m => m (a -> b) -> m a -> m b #

In many situations, the liftM operations can be replaced by uses of ap, which promotes function application.

return f `ap` x1 `ap` ... `ap` xn

is equivalent to

liftMn f x1 x2 ... xn

void :: Functor f => f a -> f () #

void value discards or ignores the result of evaluation, such - as the return value of an IO action.

Examples

Expand

Replace the contents of a Maybe Int with unit:

>>> void Nothing
+ as the return value of an IO action.
Examples
Expand
Replace the contents of a Maybe Int with unit:
>>> void Nothing
 Nothing
 >>> void (Just 3)
 Just ()
@@ -653,7 +799,7 @@
 [(),(),()]
 
Replace the second element of a pair with unit:
>>> void (1,2)
 (1,())
-
Discard the result of an IO action:
>>> mapM print [1,2]
+
Discard the result of an IO action:
>>> mapM print [1,2]
 1
 2
 [(),()]
@@ -663,15 +809,30 @@

mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m () #

Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see - mapM.

As of base 4.8.0.0, mapM_ is just traverse_, specialized to + mapM.

As of base 4.8.0.0, mapM_ is just traverse_, specialized to Monad.

forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m () #

forM_ is mapM_ with its arguments flipped. For a version that - doesn't ignore the results see forM.

As of base 4.8.0.0, forM_ is just for_, specialized to Monad.

sequence_ :: (Foldable t, Monad m) => t (m a) -> m () #

Evaluate each monadic action in the structure from left to right, + doesn't ignore the results see forM.

As of base 4.8.0.0, forM_ is just for_, specialized to Monad.

sequence_ :: (Foldable t, Monad m) => t (m a) -> m () #

Evaluate each monadic action in the structure from left to right, and ignore the results. For a version that doesn't ignore the - results see sequence.

As of base 4.8.0.0, sequence_ is just sequenceA_, specialized + results see sequence.

As of base 4.8.0.0, sequence_ is just sequenceA_, specialized to Monad.

msum :: (Foldable t, MonadPlus m) => t (m a) -> m a #

The sum of a collection of actions, generalizing concat. - As of base 4.8.0.0, msum is just asum, specialized to MonadPlus.

forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #

forM is mapM with its arguments flipped. For a version that - ignores the results see forM_.

filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #

This generalizes the list-based filter function.

(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #

Left-to-right Kleisli composition of monads.

(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c infixr 1 #

Right-to-left Kleisli composition of monads. (>=>), with the arguments flipped.

Note how this operator resembles function composition (.):

(.)   ::            (b ->   c) -> (a ->   b) -> a ->   c
-(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c

forever :: Applicative f => f a -> f b #

forever act repeats the action infinitely.

mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) #

The mapAndUnzipM function maps its first argument over a list, returning + As of base 4.8.0.0, msum is just asum, specialized to MonadPlus.

forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #

forM is mapM with its arguments flipped. For a version that + ignores the results see forM_.

filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #

This generalizes the list-based filter function.

(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #

Left-to-right composition of Kleisli arrows.

(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c infixr 1 #

Right-to-left composition of Kleisli arrows. (>=>), with the arguments + flipped.

Note how this operator resembles function composition (.):

(.)   ::            (b ->   c) -> (a ->   b) -> a ->   c
+(<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c

forever :: Applicative f => f a -> f b #

Repeat an action indefinitely.

Examples

Expand

A common use of forever is to process input from network sockets, + Handles, and channels + (e.g. MVar and + Chan).

For example, here is how we might implement an echo + server, using + forever both to listen for client connections on a network socket + and to echo client input on client connection handles:

echoServer :: Socket -> IO ()
+echoServer socket = forever $ do
+  client <- accept socket
+  forkFinally (echo client) (\_ -> hClose client)
+  where
+    echo :: Handle -> IO ()
+    echo client = forever $
+      hGetLine client >>= hPutStrLn client
+

mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) #

The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state-transforming monad.

zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c] #

The zipWithM function generalizes zipWith to arbitrary applicative functors.

zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m () #

zipWithM_ is the extension of zipWithM which ignores the final result.

foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b #

The foldM function is analogous to foldl, except that its result is encapsulated in a monad. Note that foldM works from left-to-right over @@ -684,30 +845,33 @@ a2 <- f a1 x1 a3 <- f a2 x2 ... - f am xm

If right-to-left evaluation is required, the input list should be reversed.

Note: foldM is the same as foldlM

foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m () #

Like foldM, but discards the result.

replicateM :: Applicative m => Int -> m a -> m [a] #

replicateM n act performs the action n times, - gathering the results.

replicateM_ :: Applicative m => Int -> m a -> m () #

Like replicateM, but discards the result.

unless :: Applicative f => Bool -> f () -> f () #

The reverse of when.

(<$!>) :: Monad m => (a -> b) -> m a -> m b infixl 4 #

Strict version of <$>.

Since: base-4.8.0.0

mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a #

Direct MonadPlus equivalent of filter - filter = (mfilter:: (a -> Bool) -> [a] -> [a] - applicable to any MonadPlus, for example - mfilter odd (Just 1) == Just 1 - mfilter odd (Just 2) == Nothing

type family ConditionOf m #

Instances
type ConditionOf [()] # 
Instance details

Defined in Control.Monad.Guard

type ConditionOf [()] = Bool
type ConditionOf (P ()) # 
Instance details

Defined in Data.Program

type ConditionOf (P ()) = Expression Bool

class Monad m => MonadGuard m where #

Minimal complete definition

guard

Methods

guard :: ConditionOf (m ()) -> m () #

overloaded generalisation of guard

Instances
MonadGuard [] # 
Instance details

Defined in Control.Monad.Guard

Methods

guard :: ConditionOf [()] -> [()] #

MonadGuard P # 
Instance details

Defined in Data.Program

Methods

guard :: ConditionOf (P ()) -> P () #

max :: (IfB a, OrdB a) => a -> a -> a #

min :: (IfB a, OrdB a) => a -> a -> a #

(>=) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(<=) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(>) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(<) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(/=) :: EqB a => a -> a -> BooleanOf a infix 4 #

(==) :: EqB a => a -> a -> BooleanOf a infix 4 #

ifThenElse :: IfB a => BooleanOf a -> a -> a -> a #

not :: Boolean a => a -> a #

(||) :: Boolean a => a -> a -> a infixr 2 #

(&&) :: Boolean a => a -> a -> a infixr 3 #

sort2B :: (IfB a, OrdB a) => (a, a) -> (a, a) #

Variant of min and max using ifB and '(<=*)'

maxB :: (IfB a, OrdB a) => a -> a -> a #

Variant of max using ifB and '(>=*)'

minB :: (IfB a, OrdB a) => a -> a -> a #

Variant of min using ifB and '(<=*)'

caseB :: (IfB b, bool ~ BooleanOf b) => a -> [(a -> bool, b)] -> b -> b #

A generalized version of a case like control structure.

guardedB :: (IfB b, bool ~ BooleanOf b) => bool -> [(bool, b)] -> b -> b #

A generalized replacement for guards and chained ifs.

crop :: (Applicative f, Monoid (f a), IfB a, bool ~ BooleanOf a) => f bool -> f a -> f a #

Generalized cropping, filling in mempty where the test yields false.

cond :: (Applicative f, IfB a, bool ~ BooleanOf a) => f bool -> f a -> f a -> f a #

Point-wise conditional

class Boolean b where #

Generalized boolean class

Minimal complete definition

true, false, notB, (&&*), (||*)

Methods

true :: b #

false :: b #

notB :: b -> b #

(&&*) :: b -> b -> b infixr 3 #

(||*) :: b -> b -> b infixr 2 #

Instances
Boolean Bool 
Instance details

Defined in Data.Boolean

Methods

true :: Bool #

false :: Bool #

notB :: Bool -> Bool #

(&&*) :: Bool -> Bool -> Bool #

(||*) :: Bool -> Bool -> Bool #

Boolean ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

true :: ConstVal #

false :: ConstVal #

notB :: ConstVal -> ConstVal #

(&&*) :: ConstVal -> ConstVal -> ConstVal #

(||*) :: ConstVal -> ConstVal -> ConstVal #

Boolean DExpr # 
Instance details

Defined in Data.Expression

Methods

true :: DExpr #

false :: DExpr #

notB :: DExpr -> DExpr #

(&&*) :: DExpr -> DExpr -> DExpr #

(||*) :: DExpr -> DExpr -> DExpr #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

Boolean bool => Boolean (z -> bool) 
Instance details

Defined in Data.Boolean

Methods

true :: z -> bool #

false :: z -> bool #

notB :: (z -> bool) -> z -> bool #

(&&*) :: (z -> bool) -> (z -> bool) -> z -> bool #

(||*) :: (z -> bool) -> (z -> bool) -> z -> bool #

type family BooleanOf a :: * #

BooleanOf computed the boolean analog of a specific type.

Instances
type BooleanOf Bool 
Instance details

Defined in Data.Boolean

type BooleanOf Bool = Bool
type BooleanOf Char 
Instance details

Defined in Data.Boolean

type BooleanOf Char = Bool
type BooleanOf Double 
Instance details

Defined in Data.Boolean

type BooleanOf Double = Bool
type BooleanOf Float 
Instance details

Defined in Data.Boolean

type BooleanOf Float = Bool
type BooleanOf Int 
Instance details

Defined in Data.Boolean

type BooleanOf Int = Bool
type BooleanOf Integer 
Instance details

Defined in Data.Boolean

type BooleanOf Integer = Bool
type BooleanOf ConstVal # 
Instance details

Defined in Data.Expression.Const

type BooleanOf ConstVal = ConstVal
type BooleanOf DExpr # 
Instance details

Defined in Data.Expression

type BooleanOf DExpr = DExpr
type BooleanOf [a] 
Instance details

Defined in Data.Boolean

type BooleanOf [a] = BooleanOf a
type BooleanOf (IO a) # 
Instance details

Defined in Util

type BooleanOf (IO a) = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool
type BooleanOf (P t) # 
Instance details

Defined in Data.Program

type BooleanOf (P t) = B
type BooleanOf (z -> a) 
Instance details

Defined in Data.Boolean

type BooleanOf (z -> a) = z -> BooleanOf a
type BooleanOf (a, b) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b) = BooleanOf a
type BooleanOf (a, b, c) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b, c) = BooleanOf a
type BooleanOf (a, b, c, d) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b, c, d) = BooleanOf a
type BooleanOf (a, b, c, d, e) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e) = BooleanOf a
type BooleanOf (a, b, c, d, e, f) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g, h) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g, h) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g, h, i) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g, h, i) = BooleanOf a

class Boolean (BooleanOf a) => IfB a where #

Types with conditionals

Minimal complete definition

ifB

Methods

ifB :: bool ~ BooleanOf a => bool -> a -> a -> a #

Instances
IfB Bool 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Bool => bool -> Bool -> Bool -> Bool #

IfB Char 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Char => bool -> Char -> Char -> Char #

IfB Double 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Double => bool -> Double -> Double -> Double #

IfB Float 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Float => bool -> Float -> Float -> Float #

IfB Int 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Int => bool -> Int -> Int -> Int #

IfB Integer 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Integer => bool -> Integer -> Integer -> Integer #

IfB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

ifB :: bool ~ BooleanOf ConstVal => bool -> ConstVal -> ConstVal -> ConstVal #

IfB DExpr # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf DExpr => bool -> DExpr -> DExpr -> DExpr #

(Boolean (BooleanOf a), BooleanOf a ~ Bool) => IfB [a] 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf [a] => bool -> [a] -> [a] -> [a] #

IfB (IO a) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (IO a) => bool -> IO a -> IO a -> IO a #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

(IfB t, BooleanOf t ~ B) => IfB (P t) # 
Instance details

Defined in Data.Program

Methods

ifB :: bool ~ BooleanOf (P t) => bool -> P t -> P t -> P t #

IfB a => IfB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (z -> a) => bool -> (z -> a) -> (z -> a) -> z -> a #

(bool ~ BooleanOf p, bool ~ BooleanOf q, IfB p, IfB q) => IfB (p, q) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q) => bool -> (p, q) -> (p, q) -> (p, q) #

(bool ~ BooleanOf p, bool ~ BooleanOf q, bool ~ BooleanOf r, IfB p, IfB q, IfB r) => IfB (p, q, r) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q, r) => bool -> (p, q, r) -> (p, q, r) -> (p, q, r) #

(bool ~ BooleanOf p, bool ~ BooleanOf q, bool ~ BooleanOf r, bool ~ BooleanOf s, IfB p, IfB q, IfB r, IfB s) => IfB (p, q, r, s) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q, r, s) => bool -> (p, q, r, s) -> (p, q, r, s) -> (p, q, r, s) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e) => IfB (a, b, c, d, e) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e) => bool -> (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f) => IfB (a, b, c, d, e, f) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f) => bool -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g) => IfB (a, b, c, d, e, f, g) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g) => bool -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g, bool ~ BooleanOf h, IfB h) => IfB (a, b, c, d, e, f, g, h) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g, h) => bool -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g, bool ~ BooleanOf h, IfB h, bool ~ BooleanOf i, IfB i) => IfB (a, b, c, d, e, f, g, h, i) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g, h, i) => bool -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

class Boolean (BooleanOf a) => EqB a where #

Types with equality. Minimum definition: '(==*)'.

Minimal complete definition

(==*)

Methods

(==*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(/=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

Instances
EqB Bool 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(/=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

EqB Char 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(/=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

EqB Double 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(/=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

EqB Float 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(/=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

EqB Int 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(/=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

EqB Integer 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(/=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

EqB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(/=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

EqB DExpr # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

(/=*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

EqB a => EqB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(/=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

class Boolean (BooleanOf a) => OrdB a where #

Types with inequality. Minimum definition: '(<*)'.

Minimal complete definition

(<*)

Methods

(<*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(<=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(>*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(>=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

Instances
OrdB Bool 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(<=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

OrdB Char 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(<=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

OrdB Double 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(<=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

OrdB Float 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(<=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

OrdB Int 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(<=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

OrdB Integer 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(<=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

OrdB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(<=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB a => OrdB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(<=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(>*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(>=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(++) :: [a] -> [a] -> [a] infixr 5 #

Append two lists, i.e.,

[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
+  f am xm

If right-to-left evaluation is required, the input list should be reversed.

Note: foldM is the same as foldlM

foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m () #

Like foldM, but discards the result.

replicateM :: Applicative m => Int -> m a -> m [a] #

replicateM n act performs the action n times, + gathering the results.

replicateM_ :: Applicative m => Int -> m a -> m () #

Like replicateM, but discards the result.

unless :: Applicative f => Bool -> f () -> f () #

The reverse of when.

(<$!>) :: Monad m => (a -> b) -> m a -> m b infixl 4 #

Strict version of <$>.

Since: base-4.8.0.0

mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a #

Direct MonadPlus equivalent of filter.

Examples

Expand

The filter function is just mfilter specialized to + the list monad:

filter = ( mfilter :: (a -> Bool) -> [a] -> [a] )
+

An example using mfilter with the Maybe monad:

>>> mfilter odd (Just 1)
+Just 1
+>>> mfilter odd (Just 2)
+Nothing
+

type family ConditionOf m #

Instances
type ConditionOf [()] # 
Instance details

Defined in Control.Monad.Guard

type ConditionOf [()] = Bool
type ConditionOf (P ()) # 
Instance details

Defined in Data.Program

type ConditionOf (P ()) = Expression Bool

class Monad m => MonadGuard m where #

Methods

guard :: ConditionOf (m ()) -> m () #

overloaded generalisation of guard

Instances
MonadGuard [] # 
Instance details

Defined in Control.Monad.Guard

Methods

guard :: ConditionOf [()] -> [()] #

MonadGuard P # 
Instance details

Defined in Data.Program

Methods

guard :: ConditionOf (P ()) -> P () #

max :: (IfB a, OrdB a) => a -> a -> a #

min :: (IfB a, OrdB a) => a -> a -> a #

(>=) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(<=) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(>) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(<) :: OrdB a => a -> a -> BooleanOf a infix 4 #

(/=) :: EqB a => a -> a -> BooleanOf a infix 4 #

(==) :: EqB a => a -> a -> BooleanOf a infix 4 #

ifThenElse :: IfB a => BooleanOf a -> a -> a -> a #

not :: Boolean a => a -> a #

(||) :: Boolean a => a -> a -> a infixr 2 #

(&&) :: Boolean a => a -> a -> a infixr 3 #

sort2B :: (IfB a, OrdB a) => (a, a) -> (a, a) #

Variant of min and max using ifB and '(<=*)'

maxB :: (IfB a, OrdB a) => a -> a -> a #

Variant of max using ifB and '(>=*)'

minB :: (IfB a, OrdB a) => a -> a -> a #

Variant of min using ifB and '(<=*)'

caseB :: (IfB b, bool ~ BooleanOf b) => a -> [(a -> bool, b)] -> b -> b #

A generalized version of a case like control structure.

guardedB :: (IfB b, bool ~ BooleanOf b) => bool -> [(bool, b)] -> b -> b #

A generalized replacement for guards and chained ifs.

crop :: (Applicative f, Monoid (f a), IfB a, bool ~ BooleanOf a) => f bool -> f a -> f a #

Generalized cropping, filling in mempty where the test yields false.

cond :: (Applicative f, IfB a, bool ~ BooleanOf a) => f bool -> f a -> f a -> f a #

Point-wise conditional

class Boolean b where #

Generalized boolean class

Methods

true :: b #

false :: b #

notB :: b -> b #

(&&*) :: b -> b -> b infixr 3 #

(||*) :: b -> b -> b infixr 2 #

Instances
Boolean Bool 
Instance details

Defined in Data.Boolean

Methods

true :: Bool #

false :: Bool #

notB :: Bool -> Bool #

(&&*) :: Bool -> Bool -> Bool #

(||*) :: Bool -> Bool -> Bool #

Boolean ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

true :: ConstVal #

false :: ConstVal #

notB :: ConstVal -> ConstVal #

(&&*) :: ConstVal -> ConstVal -> ConstVal #

(||*) :: ConstVal -> ConstVal -> ConstVal #

Boolean DExpr # 
Instance details

Defined in Data.Expression

Methods

true :: DExpr #

false :: DExpr #

notB :: DExpr -> DExpr #

(&&*) :: DExpr -> DExpr -> DExpr #

(||*) :: DExpr -> DExpr -> DExpr #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

Boolean bool => Boolean (z -> bool) 
Instance details

Defined in Data.Boolean

Methods

true :: z -> bool #

false :: z -> bool #

notB :: (z -> bool) -> z -> bool #

(&&*) :: (z -> bool) -> (z -> bool) -> z -> bool #

(||*) :: (z -> bool) -> (z -> bool) -> z -> bool #

type family BooleanOf a :: Type #

BooleanOf computed the boolean analog of a specific type.

Instances
type BooleanOf Bool 
Instance details

Defined in Data.Boolean

type BooleanOf Bool = Bool
type BooleanOf Char 
Instance details

Defined in Data.Boolean

type BooleanOf Char = Bool
type BooleanOf Double 
Instance details

Defined in Data.Boolean

type BooleanOf Double = Bool
type BooleanOf Float 
Instance details

Defined in Data.Boolean

type BooleanOf Float = Bool
type BooleanOf Int 
Instance details

Defined in Data.Boolean

type BooleanOf Int = Bool
type BooleanOf Integer 
Instance details

Defined in Data.Boolean

type BooleanOf Integer = Bool
type BooleanOf ConstVal # 
Instance details

Defined in Data.Expression.Const

type BooleanOf ConstVal = ConstVal
type BooleanOf DExpr # 
Instance details

Defined in Data.Expression

type BooleanOf DExpr = DExpr
type BooleanOf [a] 
Instance details

Defined in Data.Boolean

type BooleanOf [a] = BooleanOf a
type BooleanOf (IO a) # 
Instance details

Defined in Util

type BooleanOf (IO a) = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool
type BooleanOf (P t) # 
Instance details

Defined in Data.Program

type BooleanOf (P t) = B
type BooleanOf (z -> a) 
Instance details

Defined in Data.Boolean

type BooleanOf (z -> a) = z -> BooleanOf a
type BooleanOf (a, b) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b) = BooleanOf a
type BooleanOf (a, b, c) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b, c) = BooleanOf a
type BooleanOf (a, b, c, d) 
Instance details

Defined in Data.Boolean

type BooleanOf (a, b, c, d) = BooleanOf a
type BooleanOf (a, b, c, d, e) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e) = BooleanOf a
type BooleanOf (a, b, c, d, e, f) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g, h) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g, h) = BooleanOf a
type BooleanOf (a, b, c, d, e, f, g, h, i) # 
Instance details

Defined in Util

type BooleanOf (a, b, c, d, e, f, g, h, i) = BooleanOf a

class Boolean (BooleanOf a) => IfB a where #

Types with conditionals

Methods

ifB :: bool ~ BooleanOf a => bool -> a -> a -> a #

Instances
IfB Bool 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Bool => bool -> Bool -> Bool -> Bool #

IfB Char 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Char => bool -> Char -> Char -> Char #

IfB Double 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Double => bool -> Double -> Double -> Double #

IfB Float 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Float => bool -> Float -> Float -> Float #

IfB Int 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Int => bool -> Int -> Int -> Int #

IfB Integer 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf Integer => bool -> Integer -> Integer -> Integer #

IfB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

ifB :: bool ~ BooleanOf ConstVal => bool -> ConstVal -> ConstVal -> ConstVal #

IfB DExpr # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf DExpr => bool -> DExpr -> DExpr -> DExpr #

(Boolean (BooleanOf a), BooleanOf a ~ Bool) => IfB [a] 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf [a] => bool -> [a] -> [a] -> [a] #

IfB (IO a) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (IO a) => bool -> IO a -> IO a -> IO a #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

(IfB t, BooleanOf t ~ B) => IfB (P t) # 
Instance details

Defined in Data.Program

Methods

ifB :: bool ~ BooleanOf (P t) => bool -> P t -> P t -> P t #

IfB a => IfB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (z -> a) => bool -> (z -> a) -> (z -> a) -> z -> a #

(bool ~ BooleanOf p, bool ~ BooleanOf q, IfB p, IfB q) => IfB (p, q) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q) => bool -> (p, q) -> (p, q) -> (p, q) #

(bool ~ BooleanOf p, bool ~ BooleanOf q, bool ~ BooleanOf r, IfB p, IfB q, IfB r) => IfB (p, q, r) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q, r) => bool -> (p, q, r) -> (p, q, r) -> (p, q, r) #

(bool ~ BooleanOf p, bool ~ BooleanOf q, bool ~ BooleanOf r, bool ~ BooleanOf s, IfB p, IfB q, IfB r, IfB s) => IfB (p, q, r, s) 
Instance details

Defined in Data.Boolean

Methods

ifB :: bool ~ BooleanOf (p, q, r, s) => bool -> (p, q, r, s) -> (p, q, r, s) -> (p, q, r, s) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e) => IfB (a, b, c, d, e) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e) => bool -> (a, b, c, d, e) -> (a, b, c, d, e) -> (a, b, c, d, e) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f) => IfB (a, b, c, d, e, f) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f) => bool -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) -> (a, b, c, d, e, f) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g) => IfB (a, b, c, d, e, f, g) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g) => bool -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g, bool ~ BooleanOf h, IfB h) => IfB (a, b, c, d, e, f, g, h) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g, h) => bool -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) #

(bool ~ BooleanOf a, IfB a, bool ~ BooleanOf b, IfB b, bool ~ BooleanOf c, IfB c, bool ~ BooleanOf d, IfB d, bool ~ BooleanOf e, IfB e, bool ~ BooleanOf f, IfB f, bool ~ BooleanOf g, IfB g, bool ~ BooleanOf h, IfB h, bool ~ BooleanOf i, IfB i) => IfB (a, b, c, d, e, f, g, h, i) # 
Instance details

Defined in Util

Methods

ifB :: bool ~ BooleanOf (a, b, c, d, e, f, g, h, i) => bool -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) #

class Boolean (BooleanOf a) => EqB a where #

Types with equality. Minimum definition: '(==*)'.

Minimal complete definition

(==*)

Methods

(==*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(/=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

Instances
EqB Bool 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(/=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

EqB Char 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(/=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

EqB Double 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(/=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

EqB Float 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(/=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

EqB Int 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(/=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

EqB Integer 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(/=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

EqB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(==*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(/=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

EqB DExpr # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

(/=*) :: bool ~ BooleanOf DExpr => DExpr -> DExpr -> bool #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

EqB a => EqB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

(==*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(/=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

class Boolean (BooleanOf a) => OrdB a where #

Types with inequality. Minimum definition: '(<*)'.

Minimal complete definition

(<*)

Methods

(<*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(<=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(>*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

(>=*) :: bool ~ BooleanOf a => a -> a -> bool infix 4 #

Instances
OrdB Bool 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(<=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

(>=*) :: bool ~ BooleanOf Bool => Bool -> Bool -> bool #

OrdB Char 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(<=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

(>=*) :: bool ~ BooleanOf Char => Char -> Char -> bool #

OrdB Double 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(<=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

(>=*) :: bool ~ BooleanOf Double => Double -> Double -> bool #

OrdB Float 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(<=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

(>=*) :: bool ~ BooleanOf Float => Float -> Float -> bool #

OrdB Int 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(<=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

(>=*) :: bool ~ BooleanOf Int => Int -> Int -> bool #

OrdB Integer 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(<=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

(>=*) :: bool ~ BooleanOf Integer => Integer -> Integer -> bool #

OrdB ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(<=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

(>=*) :: bool ~ BooleanOf ConstVal => ConstVal -> ConstVal -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB a => OrdB (z -> a) 
Instance details

Defined in Data.Boolean

Methods

(<*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(<=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(>*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(>=*) :: bool ~ BooleanOf (z -> a) => (z -> a) -> (z -> a) -> bool #

(++) :: [a] -> [a] -> [a] infixr 5 #

Append two lists, i.e.,

[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn]
 [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]

If the first list is not finite, the result is the first list.

filter :: (a -> Bool) -> [a] -> [a] #

filter, applied to a predicate and a list, returns the list of - those elements that satisfy the predicate; i.e.,

filter p xs = [ x | x <- xs, p x]

zip :: [a] -> [b] -> [(a, b)] #

zip takes two lists and returns a list of corresponding pairs. - If one input list is short, excess elements of the longer list are - discarded.

zip is right-lazy:

zip [] _|_ = []

map :: (a -> b) -> [a] -> [b] #

map f xs is the list obtained by applying f to each element + those elements that satisfy the predicate; i.e.,

filter p xs = [ x | x <- xs, p x]

zip :: [a] -> [b] -> [(a, b)] #

zip takes two lists and returns a list of corresponding pairs.

zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]

If one input list is short, excess elements of the longer list are + discarded:

zip [1] ['a', 'b'] = [(1, 'a')]
+zip [1, 2] ['a'] = [(1, 'a')]

zip is right-lazy:

zip [] _|_ = []
+zip _|_ [] = _|_

map :: (a -> b) -> [a] -> [b] #

map f xs is the list obtained by applying f to each element of xs, i.e.,

map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
 map f [x1, x2, ...] == [f x1, f x2, ...]

foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b #

Left-associative fold of a structure but with strict application of the operator.

This ensures that each step of the fold is forced to weak head normal form before being applied, avoiding the collection of thunks that would otherwise occur. This is often what you want to strictly reduce a finite list to a single, monolithic result (e.g. length).

For a general Foldable structure this should be semantically identical - to,

foldl f z = foldl' f z . toList

length :: Foldable t => t a -> Int #

Returns the size/length of a finite structure as an Int. The + to,

foldl f z = foldl' f z . toList

length :: Foldable t => t a -> Int #

Returns the size/length of a finite structure as an Int. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.

null :: Foldable t => t a -> Bool #

Test whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there - is no general way to do better.

foldl1 :: Foldable t => (a -> a -> a) -> t a -> a #

A variant of foldl that has no base case, - and thus may only be applied to non-empty structures.

foldl1 f = foldl1 f . toList

sum :: (Foldable t, Num a) => t a -> a #

The sum function computes the sum of the numbers of a structure.

product :: (Foldable t, Num a) => t a -> a #

The product function computes the product of the numbers of a - structure.

foldr1 :: Foldable t => (a -> a -> a) -> t a -> a #

A variant of foldr that has no base case, - and thus may only be applied to non-empty structures.

foldr1 f = foldr1 f . toList

maximum :: (Foldable t, Ord a) => t a -> a #

The largest element of a non-empty structure.

minimum :: (Foldable t, Ord a) => t a -> a #

The least element of a non-empty structure.

elem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 #

Does the element occur in the structure?

unlines :: [String] -> String #

unlines is an inverse operation to lines. + is no general way to do better.

foldl1 :: Foldable t => (a -> a -> a) -> t a -> a #

A variant of foldl that has no base case, + and thus may only be applied to non-empty structures.

foldl1 f = foldl1 f . toList

sum :: (Foldable t, Num a) => t a -> a #

The sum function computes the sum of the numbers of a structure.

product :: (Foldable t, Num a) => t a -> a #

The product function computes the product of the numbers of a + structure.

foldr1 :: Foldable t => (a -> a -> a) -> t a -> a #

A variant of foldr that has no base case, + and thus may only be applied to non-empty structures.

foldr1 f = foldr1 f . toList

maximum :: (Foldable t, Ord a) => t a -> a #

The largest element of a non-empty structure.

minimum :: (Foldable t, Ord a) => t a -> a #

The least element of a non-empty structure.

elem :: (Foldable t, Eq a) => a -> t a -> Bool infix 4 #

Does the element occur in the structure?

unlines :: [String] -> String #

unlines is an inverse operation to lines. It joins lines, after appending a terminating newline to each.

>>> unlines ["Hello", "World", "!"]
 "Hello\nWorld\n!\n"

lines :: String -> [String] #

lines breaks a string up into a list of strings at newline @@ -762,12 +926,12 @@

words :: String -> [String] #

words breaks a string up into a list of words, which were delimited by white space.

>>> words "Lorem ipsum\ndolor"
 ["Lorem","ipsum","dolor"]
-

unfoldr :: (b -> Maybe (a, b)) -> b -> [a] #

The unfoldr function is a `dual' to foldr: while foldr +

unfoldr :: (b -> Maybe (a, b)) -> b -> [a] #

The unfoldr function is a `dual' to foldr: while foldr reduces a list to a summary value, unfoldr builds a list from a seed value. The function takes the element and returns Nothing if it is done producing the list or returns Just (a,b), in which case, a is a prepended to the list and b is used as the next - element in a recursive call. For example,

iterate f == unfoldr (\x -> Just (x, f x))

In some cases, unfoldr can undo a foldr operation:

unfoldr f' (foldr f z xs) == xs

if the following holds:

f' (f x y) = Just (x,y)
+ element in a recursive call.  For example,
iterate f == unfoldr (\x -> Just (x, f x))
In some cases, unfoldr can undo a foldr operation:
unfoldr f' (foldr f z xs) == xs
if the following holds:
f' (f x y) = Just (x,y)
 f' z       = Nothing
A simple use of unfoldr:
>>> unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10
 [10,9,8,7,6,5,4,3,2,1]

sortOn :: Ord b => (a -> b) -> [a] -> [a] #

Sort a list by comparing the results of a key function applied to each @@ -825,9 +989,9 @@ accepts any Integral value as the index.

genericSplitAt :: Integral i => i -> [a] -> ([a], [a]) #

The genericSplitAt function is an overloaded version of splitAt, which accepts any Integral value as the position at which to split.

genericDrop :: Integral i => i -> [a] -> [a] #

The genericDrop function is an overloaded version of drop, which accepts any Integral value as the number of elements to drop.

genericTake :: Integral i => i -> [a] -> [a] #

The genericTake function is an overloaded version of take, which - accepts any Integral value as the number of elements to take.

genericLength :: Num i => [a] -> i #

The genericLength function is an overloaded version of length. In + accepts any Integral value as the number of elements to take.

genericLength :: Num i => [a] -> i #

The genericLength function is an overloaded version of length. In particular, instead of returning an Int, it returns any type which is - an instance of Num. It is, however, less efficient than length.

insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] #

The non-overloaded version of insert.

insert :: Ord a => a -> [a] -> [a] #

The insert function takes an element and a list and inserts the + an instance of Num. It is, however, less efficient than length.

insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a] #

The non-overloaded version of insert.

insert :: Ord a => a -> [a] -> [a] #

The insert function takes an element and a list and inserts the element into the list at the first position where it is less than or equal to the next element. In particular, if the list is sorted before the call, the result will also be sorted. @@ -843,7 +1007,7 @@ [[1,4],[2,5],[3,6]]

If some of the rows are shorter than the following rows, their elements are skipped:

>>> transpose [[10,11],[20],[],[30,31,32]]
 [[10,20,30],[11,31],[32]]
-

intercalate :: [a] -> [[a]] -> [a] #

intercalate xs xss is equivalent to (concat (intersperse xs xss)). +

intercalate :: [a] -> [[a]] -> [a] #

intercalate xs xss is equivalent to (concat (intersperse xs xss)). It inserts the list xs in between the lists in xss and concatenates the result.

>>> intercalate ", " ["Lorem", "ipsum", "dolor"]
 "Lorem, ipsum, dolor"
@@ -878,7 +1042,7 @@
 "bnana"

It is a special case of deleteBy, which allows the programmer to supply their own equality test.

nubBy :: (a -> a -> Bool) -> [a] -> [a] #

The nubBy function behaves just like nub, except it uses a - user-supplied equality predicate instead of the overloaded == + user-supplied equality predicate instead of the overloaded == function.

>>> nubBy (\x y -> mod x 3 == mod y 3) [1,2,4,5,6]
 [1,2,6]

nub :: Eq a => [a] -> [a] #

O(n^2). The nub function removes duplicate elements from a list. @@ -909,7 +1073,7 @@ indices of all elements equal to the query element, in ascending order.

>>> elemIndices 'o' "Hello World"
 [4,7]

elemIndex :: Eq a => a -> [a] -> Maybe Int #

The elemIndex function returns the index of the first element - in the given list which is equal (by ==) to the query element, + in the given list which is equal (by ==) to the query element, or Nothing if there is no such element.

>>> elemIndex 4 [0..]
 Just 4

stripPrefix :: Eq a => [a] -> [a] -> Maybe [a] #

The stripPrefix function drops the given prefix from a list. @@ -936,13 +1100,13 @@ For example, zipWith (+) is applied to two lists to produce the list of corresponding sums.

zipWith is right-lazy:

zipWith f [] _|_ = []

zip3 :: [a] -> [b] -> [c] -> [(a, b, c)] #

zip3 takes three lists and returns a list of triples, analogous to zip.

(!!) :: [a] -> Int -> a infixl 9 #

List index (subscript) operator, starting from 0. - It is an instance of the more general genericIndex, + It is an instance of the more general genericIndex, which takes an index of any integral type.

lookup :: Eq a => a -> [(a, b)] -> Maybe b #

lookup key assocs looks up a key in an association list.

reverse :: [a] -> [a] #

reverse xs returns the elements of xs in reverse order. xs must be finite.

break :: (a -> Bool) -> [a] -> ([a], [a]) #

break, applied to a predicate p and a list xs, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that do not satisfy p and second element is the remainder of the list:

break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4])
 break (< 9) [1,2,3] == ([],[1,2,3])
-break (> 9) [1,2,3] == ([1,2,3],[])

break p is equivalent to span (not . p).

span :: (a -> Bool) -> [a] -> ([a], [a]) #

span, applied to a predicate p and a list xs, returns a tuple where +break (> 9) [1,2,3] == ([1,2,3],[])

break p is equivalent to span (not . p).

span :: (a -> Bool) -> [a] -> ([a], [a]) #

span, applied to a predicate p and a list xs, returns a tuple where first element is longest prefix (possibly empty) of xs of elements that satisfy p and second element is the remainder of the list:

span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4])
 span (< 9) [1,2,3] == ([1,2,3],[])
@@ -955,21 +1119,21 @@
 splitAt 0 [1,2,3] == ([],[1,2,3])
 splitAt (-1) [1,2,3] == ([],[1,2,3])

It is equivalent to (take n xs, drop n xs) when n is not _|_ (splitAt _|_ xs = _|_). - splitAt is an instance of the more general genericSplitAt, + splitAt is an instance of the more general genericSplitAt, in which n may be of any integral type.

drop :: Int -> [a] -> [a] #

drop n xs returns the suffix of xs - after the first n elements, or [] if n > length xs:

drop 6 "Hello World!" == "World!"
+ after the first n elements, or [] if n > length xs:
drop 6 "Hello World!" == "World!"
 drop 3 [1,2,3,4,5] == [4,5]
 drop 3 [1,2] == []
 drop 3 [] == []
 drop (-1) [1,2] == [1,2]
-drop 0 [1,2] == [1,2]
It is an instance of the more general genericDrop,
+drop 0 [1,2] == [1,2]

It is an instance of the more general genericDrop, in which n may be of any integral type.

take :: Int -> [a] -> [a] #

take n, applied to a list xs, returns the prefix of xs - of length n, or xs itself if n > length xs:

take 5 "Hello World!" == "Hello"
+ of length n, or xs itself if n > length xs:
take 5 "Hello World!" == "Hello"
 take 3 [1,2,3,4,5] == [1,2,3]
 take 3 [1,2] == [1,2]
 take 3 [] == []
 take (-1) [1,2] == []
-take 0 [1,2] == []
It is an instance of the more general genericTake,
+take 0 [1,2] == []

It is an instance of the more general genericTake, in which n may be of any integral type.

dropWhile :: (a -> Bool) -> [a] -> [a] #

dropWhile p xs returns the suffix remaining after takeWhile p xs:

dropWhile (< 3) [1,2,3,4,5,1,2,3] == [3,4,5,1,2,3]
 dropWhile (< 9) [1,2,3] == []
 dropWhile (< 0) [1,2,3] == [1,2,3]

takeWhile :: (a -> Bool) -> [a] -> [a] #

takeWhile, applied to a predicate p and a list xs, returns the @@ -979,12 +1143,12 @@ the infinite repetition of the original list. It is the identity on infinite lists.

replicate :: Int -> a -> [a] #

replicate n x is a list of length n with x the value of every element. - It is an instance of the more general genericReplicate, + It is an instance of the more general genericReplicate, in which n may be of any integral type.

repeat :: a -> [a] #

repeat x is an infinite list, with x the value of every element.

iterate' :: (a -> a) -> a -> [a] #

'iterate\'' is the strict version of iterate.

It ensures that the result of each application of force to weak head normal form before proceeding.

iterate :: (a -> a) -> a -> [a] #

iterate f x returns an infinite list of repeated applications of f to x:

iterate f x == [x, f x, f (f x), ...]

Note that iterate is lazy, potentially leading to thunk build-up if the consumer doesn't force each iterate. See 'iterate\'' for a strict - variant of this function.

scanr1 :: (a -> a -> a) -> [a] -> [a] #

scanr1 is a variant of scanr that has no starting value argument.

scanl' :: (b -> a -> b) -> b -> [a] -> [b] #

A strictly accumulating version of scanl

scanl1 :: (a -> a -> a) -> [a] -> [a] #

scanl1 is a variant of scanl that has no starting value argument:

scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

foldl1' :: (a -> a -> a) -> [a] -> a #

A strict version of foldl1

init :: [a] -> [a] #

Return all the elements of a list except the last one. + variant of this function.

scanr1 :: (a -> a -> a) -> [a] -> [a] #

scanr1 is a variant of scanr that has no starting value argument.

scanl' :: (b -> a -> b) -> b -> [a] -> [b] #

A strictly accumulating version of scanl

scanl1 :: (a -> a -> a) -> [a] -> [a] #

scanl1 is a variant of scanl that has no starting value argument:

scanl1 f [x1, x2, ...] == [x1, x1 `f` x2, ...]

foldl1' :: (a -> a -> a) -> [a] -> a #

A strict version of foldl1

init :: [a] -> [a] #

Return all the elements of a list except the last one. The list must be non-empty.

last :: [a] -> a #

Extract the last element of a list, which must be finite and non-empty.

tail :: [a] -> [a] #

Extract the elements after the head of a list, which must be non-empty.

uncons :: [a] -> Maybe (a, [a]) #

Decompose a list into its head and tail. If the list is empty, returns Nothing. If the list is non-empty, returns Just (x, xs), - where x is the head of the list and xs its tail.

Since: base-4.8.0.0

head :: [a] -> a #

Extract the first element of a list, which must be non-empty.

module Data.Maybe

module Data.Monoid

\ No newline at end of file + where x is the head of the list and xs its tail.

Since: base-4.8.0.0

head :: [a] -> a #

Extract the first element of a list, which must be non-empty.

module Data.Maybe

module Data.Monoid

\ No newline at end of file diff --git a/docs/doc/Language-Stochaskell.html b/docs/doc/Language-Stochaskell.html index 05c116b..eb7166a 100644 --- a/docs/doc/Language-Stochaskell.html +++ b/docs/doc/Language-Stochaskell.html @@ -1,19 +1,129 @@ -Language.Stochaskell

stochaskell-0.1.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2019
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell

Description

 
Synopsis

Documentation

module Language.Stochaskell.Prelude

Expressions

data Expression t #

Stochaskell expression representation (statically typed)

Instances
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: * #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: * #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: * #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: * #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

ExprType r => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

(Show t, ExprType t) => Show (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> Expression t -> ShowS #

show :: Expression t -> String #

showList :: [Expression t] -> ShowS #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool

isNaN :: Expression t -> Bool

ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

(<\>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #

show :: (a -> b -> Expression t) -> String #

showList :: [a -> b -> Expression t] -> ShowS #

(ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> Expression t) -> ShowS #

show :: (a -> Expression t) -> String #

showList :: [a -> Expression t] -> ShowS #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool

Array manipulation

class Indexable a i e | a -> i e where #

generalised array interface

Minimal complete definition

(!), bounds

Methods

(!) :: a -> i -> e infixl 9 #

see (!)

bounds :: a -> Interval i #

see bounds

deleteAt :: Indexable a i e => a -> i -> a #

a `deleteAt` i -- remove i'th element of array

insertAt :: Indexable a i e => a -> (i, e) -> a #

a `insertAt` (i,e) -- - move a!i and following elements up one, and set a!i = e

replaceAt :: Indexable a i e => a -> (i, e) -> a #

a `replaceAt` (i,e) -- set a!i = e

deleteIndex :: a -> i -> a #

insertIndex :: a -> i -> e -> a #

replaceIndex :: a -> i -> e -> a #

Instances
Indexable DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(!) :: DExpr -> DExpr -> DExpr #

bounds :: DExpr -> Interval DExpr #

deleteAt :: DExpr -> DExpr -> DExpr #

insertAt :: DExpr -> (DExpr, DExpr) -> DExpr #

replaceAt :: DExpr -> (DExpr, DExpr) -> DExpr #

deleteIndex :: DExpr -> DExpr -> DExpr #

insertIndex :: DExpr -> DExpr -> DExpr -> DExpr #

replaceIndex :: DExpr -> DExpr -> DExpr -> DExpr #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

Indexable [e] Int e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: [e] -> Int -> e #

bounds :: [e] -> Interval Int #

deleteAt :: [e] -> Int -> [e] #

insertAt :: [e] -> (Int, e) -> [e] #

replaceAt :: [e] -> (Int, e) -> [e] #

deleteIndex :: [e] -> Int -> [e] #

insertIndex :: [e] -> Int -> e -> [e] #

replaceIndex :: [e] -> Int -> e -> [e] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(IArray UArray e, Ix i) => Indexable (UArray i e) i e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: UArray i e -> i -> e #

bounds :: UArray i e -> Interval i #

deleteAt :: UArray i e -> i -> UArray i e #

insertAt :: UArray i e -> (i, e) -> UArray i e #

replaceAt :: UArray i e -> (i, e) -> UArray i e #

deleteIndex :: UArray i e -> i -> UArray i e #

insertIndex :: UArray i e -> i -> e -> UArray i e #

replaceIndex :: UArray i e -> i -> e -> UArray i e #

Ix i => Indexable (Array i e) i e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: Array i e -> i -> e #

bounds :: Array i e -> Interval i #

deleteAt :: Array i e -> i -> Array i e #

insertAt :: Array i e -> (i, e) -> Array i e #

replaceAt :: Array i e -> (i, e) -> Array i e #

deleteIndex :: Array i e -> i -> Array i e #

insertIndex :: Array i e -> i -> e -> Array i e #

replaceIndex :: Array i e -> i -> e -> Array i e #

Indexable (AbstractArray i e) [i] e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: AbstractArray i e -> [i] -> e #

bounds :: AbstractArray i e -> Interval [i] #

deleteAt :: AbstractArray i e -> [i] -> AbstractArray i e #

insertAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

replaceAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

deleteIndex :: AbstractArray i e -> [i] -> AbstractArray i e #

insertIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

replaceIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

Recursion

foldl :: ExprType b => (Expression b -> Expression a -> Expression b) -> Expression b -> Expression [a] -> Expression b #

Stochaskell equivalent of foldl

foldr :: ExprType b => (Expression a -> Expression b -> Expression b) -> Expression b -> Expression [a] -> Expression b #

Stochaskell equivalent of foldr

scanl :: ExprType b => (Expression b -> Expression a -> Expression b) -> Expression b -> Expression [a] -> Expression [b] #

Stochaskell equivalent of scanl

scanr :: ExprType b => (Expression a -> Expression b -> Expression b) -> Expression b -> Expression [a] -> Expression [b] #

Stochaskell equivalent of scanr

Helpers

constSymbol :: forall t. ExprType t => String -> Expression t #

create a symbol assumed to have a known value

d :: (ExprTuple s, ExprTuple t) => s -> t -> RMat #

automatic differentiation, eg:

(z**2) `d` z

find' :: ExprType e => (Expression e -> B) -> Expression e -> Expression [e] -> Expression e #

find p d v: find leftmost element of v satisfying p, +Language.Stochaskell

stochaskell-1.0.0: A probabilistic programming language

Copyright(c) David A Roberts 2015-2021
LicenseGPL-3
Maintainerd@vidr.cc
Stabilityexperimental
Safe HaskellNone
LanguageHaskell2010

Language.Stochaskell

Description

 
Synopsis

Documentation

module Language.Stochaskell.Prelude

Expressions

data Expression t #

Stochaskell expression representation (statically typed)

Instances
IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: Type #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: Type #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: Type #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: Type #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

Read RMat # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RMat #

readList :: ReadS [RMat] #

readPrec :: ReadPrec RMat #

readListPrec :: ReadPrec [RMat] #

Read ZVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS ZVec #

readList :: ReadS [ZVec] #

readPrec :: ReadPrec ZVec #

readListPrec :: ReadPrec [ZVec] #

Read RVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS RVec #

readList :: ReadS [RVec] #

readPrec :: ReadPrec RVec #

readListPrec :: ReadPrec [RVec] #

Read BVec # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS BVec #

readList :: ReadS [BVec] #

readPrec :: ReadPrec BVec #

readListPrec :: ReadPrec [BVec] #

Read Z # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS Z #

readList :: ReadS [Z] #

readPrec :: ReadPrec Z #

readListPrec :: ReadPrec [Z] #

Read R # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS R #

readList :: ReadS [R] #

readPrec :: ReadPrec R #

readListPrec :: ReadPrec [R] #

Read B # 
Instance details

Defined in Data.Expression.Eval

Methods

readsPrec :: Int -> ReadS B #

readList :: ReadS [B] #

readPrec :: ReadPrec B #

readListPrec :: ReadPrec [B] #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

(ExprType r, ExprType f, Show f) => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

(ExprType t, Enum t) => Enum (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

succ :: Expression t -> Expression t #

pred :: Expression t -> Expression t #

toEnum :: Int -> Expression t #

fromEnum :: Expression t -> Int #

enumFrom :: Expression t -> [Expression t] #

enumFromThen :: Expression t -> Expression t -> [Expression t] #

enumFromTo :: Expression t -> Expression t -> [Expression t] #

enumFromThenTo :: Expression t -> Expression t -> Expression t -> [Expression t] #

Eq t => Eq (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==) :: Expression t -> Expression t -> Bool #

(/=) :: Expression t -> Expression t -> Bool #

(ExprType t, Floating t) => Floating (Expression t) # 
Instance details

Defined in Data.Expression

Methods

pi :: Expression t #

exp :: Expression t -> Expression t #

log :: Expression t -> Expression t #

sqrt :: Expression t -> Expression t #

(**) :: Expression t -> Expression t -> Expression t #

logBase :: Expression t -> Expression t -> Expression t #

sin :: Expression t -> Expression t #

cos :: Expression t -> Expression t #

tan :: Expression t -> Expression t #

asin :: Expression t -> Expression t #

acos :: Expression t -> Expression t #

atan :: Expression t -> Expression t #

sinh :: Expression t -> Expression t #

cosh :: Expression t -> Expression t #

tanh :: Expression t -> Expression t #

asinh :: Expression t -> Expression t #

acosh :: Expression t -> Expression t #

atanh :: Expression t -> Expression t #

log1p :: Expression t -> Expression t #

expm1 :: Expression t -> Expression t #

log1pexp :: Expression t -> Expression t #

log1mexp :: Expression t -> Expression t #

(ExprType t, Fractional t) => Fractional (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(/) :: Expression t -> Expression t -> Expression t #

recip :: Expression t -> Expression t #

fromRational :: Rational -> Expression t #

(ExprType t, Integral t) => Integral (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

quot :: Expression t -> Expression t -> Expression t #

rem :: Expression t -> Expression t -> Expression t #

div :: Expression t -> Expression t -> Expression t #

mod :: Expression t -> Expression t -> Expression t #

quotRem :: Expression t -> Expression t -> (Expression t, Expression t) #

divMod :: Expression t -> Expression t -> (Expression t, Expression t) #

toInteger :: Expression t -> Integer #

(ExprType t, Num t) => Num (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(+) :: Expression t -> Expression t -> Expression t #

(-) :: Expression t -> Expression t -> Expression t #

(*) :: Expression t -> Expression t -> Expression t #

negate :: Expression t -> Expression t #

abs :: Expression t -> Expression t #

signum :: Expression t -> Expression t #

fromInteger :: Integer -> Expression t #

Ord t => Ord (Expression t) # 
Instance details

Defined in Data.Expression

Methods

compare :: Expression t -> Expression t -> Ordering #

(<) :: Expression t -> Expression t -> Bool #

(<=) :: Expression t -> Expression t -> Bool #

(>) :: Expression t -> Expression t -> Bool #

(>=) :: Expression t -> Expression t -> Bool #

max :: Expression t -> Expression t -> Expression t #

min :: Expression t -> Expression t -> Expression t #

(ExprType t, Real t) => Real (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

toRational :: Expression t -> Rational #

(Show t, ExprType t) => Show (Expression t) # 
Instance details

Defined in Data.Expression.Eval

Methods

showsPrec :: Int -> Expression t -> ShowS #

show :: Expression t -> String #

showList :: [Expression t] -> ShowS #

ExprType e => Semigroup (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(<>) :: Expression [[e]] -> Expression [[e]] -> Expression [[e]] #

sconcat :: NonEmpty (Expression [[e]]) -> Expression [[e]] #

stimes :: Integral b => b -> Expression [[e]] -> Expression [[e]] #

Boolean (Expression Bool) # 
Instance details

Defined in Data.Expression

Methods

true :: Expression Bool #

false :: Expression Bool #

notB :: Expression Bool -> Expression Bool #

(&&*) :: Expression Bool -> Expression Bool -> Expression Bool #

(||*) :: Expression Bool -> Expression Bool -> Expression Bool #

IfB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

ifB :: bool ~ BooleanOf (Expression t) => bool -> Expression t -> Expression t -> Expression t #

EqB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(==*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(/=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

OrdB (Expression t) # 
Instance details

Defined in Data.Expression

Methods

(<*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(<=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(>=*) :: bool ~ BooleanOf (Expression t) => Expression t -> Expression t -> bool #

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool #

isNaN :: Expression t -> Bool #

ExprType a => ExprTuple (Expression a) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a) #

fromExprTuple :: Expression a -> [DExpr] #

toExprTuple :: [DExpr] -> Expression a #

fromConstVals :: [ConstVal] -> Expression a #

typesOf :: TypesOf (Expression a) #

ExprType a => ExprType (Expression a) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a) #

toConcrete :: ConstVal -> Expression a #

fromConcrete :: Expression a -> Expression (Expression a) #

constVal :: Expression a -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a) #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(ExprTuple a, ExprTuple b, ExprType t) => Show (a -> b -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> b -> Expression t) -> ShowS #

show :: (a -> b -> Expression t) -> String #

showList :: [a -> b -> Expression t] -> ShowS #

(ExprTuple a, ExprType t) => Show (a -> Expression t) # 
Instance details

Defined in Data.Expression

Methods

showsPrec :: Int -> (a -> Expression t) -> ShowS #

show :: (a -> Expression t) -> String #

showList :: [a -> Expression t] -> ShowS #

(ExprType a, ExprType b) => ExprTuple (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b) #

fromExprTuple :: (Expression a, Expression b) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b) #

typesOf :: TypesOf (Expression a, Expression b) #

(ExprType a, ExprType b) => ExprType (Expression a, Expression b) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b) #

toConcrete :: ConstVal -> (Expression a, Expression b) #

fromConcrete :: (Expression a, Expression b) -> Expression (Expression a, Expression b) #

constVal :: (Expression a, Expression b) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b) #

(ExprType a, ExprType b, ExprType c) => ExprTuple (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c) #

fromExprTuple :: (Expression a, Expression b, Expression c) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c) #

typesOf :: TypesOf (Expression a, Expression b, Expression c) #

ExprType t => GConstructor (K1 i (Expression t) :: Type -> Type) # 
Instance details

Defined in Data.Expression

Methods

gtypeOf :: TypeOf (K1 i (Expression t) p) #

gtags :: Tags (K1 i (Expression t) p) #

gconstruct :: (forall t0. ExprType t0 => a -> Expression t0) -> Tag -> [a] -> K1 i (Expression t) p #

gdeconstruct :: (forall t0. ExprType t0 => Expression t0 -> a) -> K1 i (Expression t) p -> (Tag, [a]) #

(ExprType a, ExprType b, ExprType c) => ExprType (Expression a, Expression b, Expression c) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c) #

fromConcrete :: (Expression a, Expression b, Expression c) -> Expression (Expression a, Expression b, Expression c) #

constVal :: (Expression a, Expression b, Expression c) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprTuple (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d) => ExprType (Expression a, Expression b, Expression c, Expression d) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d) -> Expression (Expression a, Expression b, Expression c, Expression d) #

constVal :: (Expression a, Expression b, Expression c, Expression d) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprTuple (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

tupleSize :: TupleSize (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromExprTuple :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> [DExpr] #

toExprTuple :: [DExpr] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConstVals :: [ConstVal] -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

typesOf :: TypesOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

(ExprType a, ExprType b, ExprType c, ExprType d, ExprType e, ExprType f, ExprType g, ExprType h, ExprType i) => ExprType (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) # 
Instance details

Defined in Data.Expression

Methods

typeOf :: TypeOf (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

toConcrete :: ConstVal -> (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

fromConcrete :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

constVal :: (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) -> ConstVal #

constExpr :: ConstVal -> Expression (Expression a, Expression b, Expression c, Expression d, Expression e, Expression f, Expression g, Expression h, Expression i) #

type Item RMat # 
Instance details

Defined in Data.Expression.Eval

type Item RMat = [Double]
type Item ZVec # 
Instance details

Defined in Data.Expression.Eval

type Item ZVec = Integer
type Item RVec # 
Instance details

Defined in Data.Expression.Eval

type Item RVec = Double
type Item BVec # 
Instance details

Defined in Data.Expression.Eval

type Item BVec = Bool
type BooleanOf (Expression t) # 
Instance details

Defined in Data.Expression

type BooleanOf (Expression t) = Expression Bool

Array manipulation

class Indexable a i e | a -> i e where #

generalised array interface

Minimal complete definition

(!), bounds

Methods

(!) :: a -> i -> e infixl 9 #

see (!)

bounds :: a -> Interval i #

see bounds

deleteAt :: Indexable a i e => a -> i -> a #

a `deleteAt` i -- remove i'th element of array

insertAt :: Indexable a i e => a -> (i, e) -> a #

a `insertAt` (i,e) -- + move a!i and following elements up one, and set a!i = e

replaceAt :: Indexable a i e => a -> (i, e) -> a #

a `replaceAt` (i,e) -- set a!i = e

deleteIndex :: a -> i -> a #

insertIndex :: a -> i -> e -> a #

replaceIndex :: a -> i -> e -> a #

Instances
Indexable DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(!) :: DExpr -> DExpr -> DExpr #

bounds :: DExpr -> Interval DExpr #

deleteAt :: DExpr -> DExpr -> DExpr #

insertAt :: DExpr -> (DExpr, DExpr) -> DExpr #

replaceAt :: DExpr -> (DExpr, DExpr) -> DExpr #

deleteIndex :: DExpr -> DExpr -> DExpr #

insertIndex :: DExpr -> DExpr -> DExpr -> DExpr #

replaceIndex :: DExpr -> DExpr -> DExpr -> DExpr #

Indexable ConstVal [Integer] ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(!) :: ConstVal -> [Integer] -> ConstVal #

bounds :: ConstVal -> Interval [Integer] #

deleteAt :: ConstVal -> [Integer] -> ConstVal #

insertAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

replaceAt :: ConstVal -> ([Integer], ConstVal) -> ConstVal #

deleteIndex :: ConstVal -> [Integer] -> ConstVal #

insertIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

replaceIndex :: ConstVal -> [Integer] -> ConstVal -> ConstVal #

Indexable [e] Int e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: [e] -> Int -> e #

bounds :: [e] -> Interval Int #

deleteAt :: [e] -> Int -> [e] #

insertAt :: [e] -> (Int, e) -> [e] #

replaceAt :: [e] -> (Int, e) -> [e] #

deleteIndex :: [e] -> Int -> [e] #

insertIndex :: [e] -> Int -> e -> [e] #

replaceIndex :: [e] -> Int -> e -> [e] #

Indexable (Expression [e]) (Expression Integer) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(!) :: Expression [e] -> Expression Integer -> Expression e #

bounds :: Expression [e] -> Interval (Expression Integer) #

deleteAt :: Expression [e] -> Expression Integer -> Expression [e] #

insertAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

replaceAt :: Expression [e] -> (Expression Integer, Expression e) -> Expression [e] #

deleteIndex :: Expression [e] -> Expression Integer -> Expression [e] #

insertIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

replaceIndex :: Expression [e] -> Expression Integer -> Expression e -> Expression [e] #

(IArray UArray e, Ix i) => Indexable (UArray i e) i e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: UArray i e -> i -> e #

bounds :: UArray i e -> Interval i #

deleteAt :: UArray i e -> i -> UArray i e #

insertAt :: UArray i e -> (i, e) -> UArray i e #

replaceAt :: UArray i e -> (i, e) -> UArray i e #

deleteIndex :: UArray i e -> i -> UArray i e #

insertIndex :: UArray i e -> i -> e -> UArray i e #

replaceIndex :: UArray i e -> i -> e -> UArray i e #

Ix i => Indexable (Array i e) i e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: Array i e -> i -> e #

bounds :: Array i e -> Interval i #

deleteAt :: Array i e -> i -> Array i e #

insertAt :: Array i e -> (i, e) -> Array i e #

replaceAt :: Array i e -> (i, e) -> Array i e #

deleteIndex :: Array i e -> i -> Array i e #

insertIndex :: Array i e -> i -> e -> Array i e #

replaceIndex :: Array i e -> i -> e -> Array i e #

Indexable (AbstractArray i e) [i] e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: AbstractArray i e -> [i] -> e #

bounds :: AbstractArray i e -> Interval [i] #

deleteAt :: AbstractArray i e -> [i] -> AbstractArray i e #

insertAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

replaceAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

deleteIndex :: AbstractArray i e -> [i] -> AbstractArray i e #

insertIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

replaceIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

Recursion

foldlE :: ExprType b => (Expression b -> Expression a -> Expression b) -> Expression b -> Expression [a] -> Expression b #

Stochaskell equivalent of foldl

foldrE :: ExprType b => (Expression a -> Expression b -> Expression b) -> Expression b -> Expression [a] -> Expression b #

Stochaskell equivalent of foldr

scanlE :: ExprType b => (Expression b -> Expression a -> Expression b) -> Expression b -> Expression [a] -> Expression [b] #

Stochaskell equivalent of scanl

scanrE :: ExprType b => (Expression a -> Expression b -> Expression b) -> Expression b -> Expression [a] -> Expression [b] #

Stochaskell equivalent of scanr

foldE :: forall t f. (Functor f, Constructor (f (FixE f)), ExprTuple t, ExprType (f (FixE f)), ExprType (f t)) => (Expression (f t) -> t) -> FixE' f -> t #

unfoldE :: forall t f. (Functor f, Constructor (f t), ExprTuple t, ExprType (f (FixE f)), ExprType (f t)) => (t -> Expression (f t)) -> t -> FixE' f #

Helpers

constSymbol :: forall t. ExprType t => String -> Expression t #

create a symbol assumed to have a known value

d :: (ExprTuple s, ExprTuple t) => s -> t -> RMat #

automatic differentiation, eg:

(z**2) `d` z

factorial' :: Z -> Z #

logFactorial' :: Z -> R #

find' :: ExprType e => (Expression e -> B) -> Expression e -> Expression [e] -> Expression e #

find p d v: find leftmost element of v satisfying p, else d if no elements satisfy p

findSortedInsertIndex :: R -> RVec -> Z #

given a value and a sorted vector, find the index at which we could - insertAt the value whilst keeping the vector sorted

min' :: Expression a -> Expression a -> Expression a #

minimum of two values

solve :: ExprTuple t => t -> t -> EEnv #

equation solver / transformation inverter

solveP :: ExprTuple t => P t -> t -> EEnv #

solve applied to program outputs

sum' :: (ExprType a, Num a) => Expression [a] -> Expression a #

Stochaskell equivalent of sum

symbol :: forall t. ExprType t => String -> Expression t #

create a symbolic variable

symbols :: ExprType t => String -> [Expression t] #

create a list of (one-letter) symbols

Linear algebra

class InnerProduct v e | v -> e where #

Minimal complete definition

(<.>)

Methods

(<.>) :: v -> v -> e infixr 8 #

generalisation of <.>

Instances
InnerProduct ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<.>) :: ConstVal -> ConstVal -> ConstVal #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

class LinearOperator m v | m -> v, v -> m where #

generalised linear operator interface

Minimal complete definition

(#>), (<#), (<\>), diag, asColumn, asRow

Methods

(#>) :: m -> v -> v infixr 8 #

see #>

(<#) :: v -> m -> v #

see <#

(<\>) :: m -> v -> v infixl 7 #

see <\>

diag :: v -> m #

convert vector to diagonal matrix

asColumn :: v -> m #

convert vector to column

asRow :: v -> m #

convert vector to row

outer :: (LinearOperator m v, Num m) => v -> v -> m #

outer product

Instances
LinearOperator ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(#>) :: ConstVal -> ConstVal -> ConstVal #

(<#) :: ConstVal -> ConstVal -> ConstVal #

(<\>) :: ConstVal -> ConstVal -> ConstVal #

diag :: ConstVal -> ConstVal #

asColumn :: ConstVal -> ConstVal #

asRow :: ConstVal -> ConstVal #

outer :: ConstVal -> ConstVal -> ConstVal #

LinearOperator DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(#>) :: DExpr -> DExpr -> DExpr #

(<#) :: DExpr -> DExpr -> DExpr #

(<\>) :: DExpr -> DExpr -> DExpr #

diag :: DExpr -> DExpr #

asColumn :: DExpr -> DExpr #

asRow :: DExpr -> DExpr #

outer :: DExpr -> DExpr -> DExpr #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

(<\>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

class Matrix m i e | m -> i e where #

generalised matrix interface

Minimal complete definition

matrix, blockMatrix, eye, zeros, matrixRows, matrixCols

Methods

matrix :: AbstractArray i e -> m #

convert from abstract array

blockMatrix :: [[m]] -> m #

create a block matrix

eye :: i -> m #

identity matrix

zeros :: i -> i -> m #

zero matrix

matrixRows :: m -> i #

number of rows

matrixCols :: m -> i #

number of columns

designMatrix :: (Indexable v i e, Num i) => i -> AbstractArray i v -> m #

pack vectors as rows of a matrix

Instances
Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Matrix DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray DExpr DExpr -> DExpr #

blockMatrix :: [[DExpr]] -> DExpr #

eye :: DExpr -> DExpr #

zeros :: DExpr -> DExpr -> DExpr #

matrixRows :: DExpr -> DExpr #

matrixCols :: DExpr -> DExpr #

designMatrix :: (Indexable v DExpr DExpr, Num DExpr) => DExpr -> AbstractArray DExpr v -> DExpr #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

class Scalable a v | v -> a where #

Minimal complete definition

(*>)

Methods

(*>) :: a -> v -> v infixr 7 #

scalar by array multiplication (see *>)

Instances
Scalable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(*>) :: ConstVal -> ConstVal -> ConstVal #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

(IArray UArray e, Num e, Ix i) => Scalable e (UArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(*>) :: e -> UArray i e -> UArray i e #

(Num e, Ix i) => Scalable e (Array i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(*>) :: e -> Array i e -> Array i e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

class SquareMatrix m e | m -> e where #

Minimal complete definition

chol, inv, det, logDet

Methods

chol :: m -> m #

lower-triangular Cholesky decomposition, see chol

inv :: m -> m #

see inv

det :: m -> e #

see det

logDet :: m -> e #

logarithm of the absolute value of the determinant

Instances
SquareMatrix ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

chol :: ConstVal -> ConstVal #

inv :: ConstVal -> ConstVal #

det :: ConstVal -> ConstVal #

logDet :: ConstVal -> ConstVal #

SquareMatrix DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

chol :: DExpr -> DExpr #

inv :: DExpr -> DExpr #

det :: DExpr -> DExpr #

logDet :: DExpr -> DExpr #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

class Transposable m mt | m -> mt, mt -> m where #

Minimal complete definition

tr, tr'

Methods

tr :: m -> mt #

tr' :: m -> mt #

Instances
Transposable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

tr :: ConstVal -> ConstVal #

tr' :: ConstVal -> ConstVal #

Transposable DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

tr :: DExpr -> DExpr #

tr' :: DExpr -> DExpr #

(CTrans t, Container Vector t) => Transposable (Matrix t) (Matrix t) 
Instance details

Defined in Internal.Numeric

Methods

tr :: Matrix t -> Matrix t #

tr' :: Matrix t -> Matrix t #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

class Vector v i e | v -> i e, i e -> v where #

generalised vector interface

Minimal complete definition

vector, blockVector, vectorSize

Methods

vector :: AbstractArray i e -> v #

convert from abstract array

blockVector :: [v] -> v #

see blockMatrix

vectorSize :: v -> i #

number of elements in vector

Instances
Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

Vector DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray DExpr DExpr -> DExpr #

blockVector :: [DExpr] -> DExpr #

vectorSize :: DExpr -> DExpr #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

Types

type B #

Arguments

 = Expression Bool

boolean

type R #

Arguments

 = Expression Double

real

type Z #

Arguments

 = Expression Integer

integer

type BVec #

Arguments

 = Expression [Bool]

boolean vector

type RVec #

Arguments

 = Expression [Double]

real vector

type ZVec #

Arguments

 = Expression [Integer]

integer vector

type BMat #

Arguments

 = Expression [[Bool]]

boolean matrix

type RMat #

Arguments

 = Expression [[Double]]

real matrix

type ZMat #

Arguments

 = Expression [[Integer]]

integer matrix

Type casting

class Cast a b where #

cast a value of one type to another

Minimal complete definition

cast

Methods

cast :: a -> b #

Instances
Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

boolean :: (Eq a, Boolean a, Boolean b) => a -> b #

convert between boolean types (eg. Bool to B)

integer :: (Integral i, Num n) => i -> n #

convert between integer types (eg. Int to Z)

real :: (Real r, Fractional f) => r -> f #

convert between real types (eg. Double to R)

list :: (IsList l, IsList l', Item l ~ Item l') => l -> l' #

convert between list types (eg. [Double] to RVec)

Abstract arrays

type Interval i = (i, i) #

closed interval of integers

data AbstractArray i e #

create abstract arrays with an expression like

[ i + j | i <- 1...rows, j <- 1...cols ]
Instances
Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Applicative (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

pure :: a -> AbstractArray i a #

(<*>) :: AbstractArray i (a -> b) -> AbstractArray i a -> AbstractArray i b #

liftA2 :: (a -> b -> c) -> AbstractArray i a -> AbstractArray i b -> AbstractArray i c #

(*>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

(<*) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i a #

(Ix i, Show i, Eq e) => Eq (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(==) :: AbstractArray i e -> AbstractArray i e -> Bool #

(/=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(Ix i, Show i, Ord e) => Ord (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

compare :: AbstractArray i e -> AbstractArray i e -> Ordering #

(<) :: AbstractArray i e -> AbstractArray i e -> Bool #

(<=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>=) :: AbstractArray i e -> AbstractArray i e -> Bool #

max :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

min :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

Indexable (AbstractArray i e) [i] e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: AbstractArray i e -> [i] -> e #

bounds :: AbstractArray i e -> Interval [i] #

deleteAt :: AbstractArray i e -> [i] -> AbstractArray i e #

insertAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

replaceAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

deleteIndex :: AbstractArray i e -> [i] -> AbstractArray i e #

insertIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

replaceIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

(...) :: a -> a -> AbstractArray a a infix 5 #

create abstract array containing given integer range

Probability distributions

data P t #

Stochaskell probabilistic program intermediate representation

Instances
Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Applicative P # 
Instance details

Defined in Data.Program

Methods

pure :: a -> P a #

(<*>) :: P (a -> b) -> P a -> P b #

liftA2 :: (a -> b -> c) -> P a -> P b -> P c #

(*>) :: P a -> P b -> P b #

(<*) :: P a -> P b -> P a #

MonadGuard P # 
Instance details

Defined in Data.Program

Methods

guard :: ConditionOf (P ()) -> P () #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

ExprType r => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

Eq t => Eq (P t) # 
Instance details

Defined in Data.Program

Methods

(==) :: P t -> P t -> Bool #

(/=) :: P t -> P t -> Bool #

ExprTuple t => Show (P t) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> P t -> ShowS #

show :: P t -> String #

showList :: [P t] -> ShowS #

(IfB t, BooleanOf t ~ B) => IfB (P t) # 
Instance details

Defined in Data.Program

Methods

ifB :: bool ~ BooleanOf (P t) => bool -> P t -> P t -> P t #

(ExprTuple a, ExprTuple b) => Show (a -> P b) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> (a -> P b) -> ShowS #

show :: (a -> P b) -> String #

showList :: [a -> P b] -> ShowS #

type BooleanOf (P t) # 
Instance details

Defined in Data.Program

type BooleanOf (P t) = B
type ConditionOf (P ()) # 
Instance details

Defined in Data.Program

type ConditionOf (P ()) = Expression Bool

class Monad m => Distribution d s m t | d m t -> s #

generalised probability distribution interface

Minimal complete definition

sample

Instances
Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

class Joint m i r f | m -> i where #

Minimal complete definition

joint

Methods

joint :: (AbstractArray i r -> f) -> AbstractArray i (m r) -> m f #

create distribution over arrays as the product of an array of - independent distributions, eg.

joint matrix [ normal i j | i <- 1...m, j <- 1...n ]
Instances
Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

ExprType r => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Primitives

Boolean

data Bernoulli p #

Instances
Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

data Bernoullis p #

Instances
Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

bernoulli :: Distribution Bernoulli s m t => s -> m t #

bernoullis :: Distribution Bernoullis s m t => s -> m t #

bernoulliLogit :: Distribution Bernoulli s m t => s -> m t #

bernoulliLogits :: Distribution Bernoullis s m t => s -> m t #

Discrete

data Geometric a #

Instances
Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

data NegBinomial a #

Instances
Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

data PMF a #

Instances
Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

data Poisson a #

Instances
Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

geometric :: (Distribution Geometric t1 m t2, Num t2) => Integer -> t1 -> m t2 #

negBinomial :: Distribution NegBinomial (a, b) m t => a -> b -> m t #

pmf :: Distribution PMF s m t => s -> m t #

distribution over indices given by vector of probabilities

poisson :: Distribution Poisson s m t => s -> m t #

Continuous

data Beta a #

Instances
Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

data Cauchy a #

Instances
Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

data Gamma a #

Instances
Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

data InvGamma a #

Instances
Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

data Normal a #

Instances
Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

data Normals a #

Instances
Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

data Uniform a #

Instances
Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

data Uniforms a #

Instances
Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

beta :: Distribution Beta (a, b) m t => a -> b -> m t #

cauchy :: Distribution Cauchy (a, b) m t => a -> b -> m t #

gamma :: Distribution Gamma (a, b) m t => a -> b -> m t #

invGamma :: Distribution InvGamma (a, b) m t => a -> b -> m t #

normal :: Distribution Normal (a, b) m t => a -> b -> m t #

normals :: Distribution Normals (a, b) m t => a -> b -> m t #

uniform :: Distribution Uniform (a, b) m t => a -> b -> m t #

uniforms :: Distribution Uniforms (a, b) m t => a -> b -> m t #

Vector

data OrderedSample a #

Instances
ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

data PoissonProcess a #

Instances
Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

orderedSample :: Distribution OrderedSample (a, b) m t => a -> b -> m t #

orderedSample n d gives an ordered vector of n samples from a base - distribution d

poissonProcess :: Distribution PoissonProcess (a, b, c) m t => a -> b -> c -> m t #

Matrix

data LKJ a #

Instances
Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

corrLKJ :: Distribution LKJ (a, b) m t => a -> b -> m t #

Logarithmic probability density functions

lpdf :: (ExprTuple t, Show t) => P t -> t -> R #

compute log pdf of distribution represented by probabilistic program

lpdfAux :: (ExprTuple t, Show t) => P t -> t -> R #

compute joint pdf of primitive random variables within the given program

Primitives

lpdfGamma :: Double -> Double -> Double -> Double #

lpdfNegBinomial :: Integer -> Double -> Double -> Double #

lpdfNormal :: Floating a => a -> a -> a -> a #

lpdfPoisson :: Integer -> Double -> Double #

lpdfUniform :: (Ord p, Floating p) => p -> p -> p -> p #

lpdfDiscreteUniform :: (Floating p, Integral a) => a -> a -> a -> p #

Transformers

mixture :: forall t. ExprTuple t => [(R, P t)] -> P t #

creates a mixture distribution, eg.

mixture [(0.7, uniform 0 1), (0.3, normal 0 1)]

mixture' :: ExprTuple t => [(R, P t)] -> P t #

like mixture, but produces a flattened intermediate representation - that uses a case expression rather than a switch statement

truncated :: Expression t -> Expression t -> P (Expression t) -> P (Expression t) #

truncate distribution to given bounds

Iteration

chain' :: ExprTuple t => Z -> (t -> P t) -> t -> P t #

convenience function for calling chainRange' starting at 1 and ignoring indices

chainRange' :: forall t. ExprTuple t => Interval Z -> (Z -> t -> P t) -> t -> P t #

iterate a Markov chain over the given integer range, eg.

chainRange' (1,10) (\i x -> normal x 1) 0 -- 10-step standard normal random walk from 0

Pre-defined probabilistic programs

lognormal :: (Distribution Normal (a, b1) m b2, Floating b2) => a -> b1 -> m b2 #

log-normal distribution

normalChol :: Z -> RVec -> RMat -> P RVec #

multivariate normal via Cholesky decomposition of covariance matrix

normalsChol :: Z -> Z -> RVec -> RMat -> P RMat #

iid normalChol samples as rows

normalCond :: Z -> (Expression t -> Expression t -> R) -> R -> Expression [t] -> RVec -> Expression t -> P R #

Gaussian process conditioned on observations

Sampling

compileCC :: forall s t. (ExprTuple s, ExprTuple t) => (s -> P t) -> IO (s -> IO t) #

compile probabilistic program to native machine code, via the C++ backend

runCC :: forall s t. (ExprTuple s, ExprTuple t) => (s -> P t) -> s -> IO t #

sample probabilistic program via compileCC

runStep :: forall t. ExprTuple t => (t -> P t) -> t -> IO t #

sample probabilistic program via Stochaskell's interpreter

simulate :: ExprTuple t => P t -> IO t #

like runStep for programs that don't take parameters

Inference

hmcStan :: ExprTuple t => Int -> P t -> IO [t] #

perform Hamiltonian Monte Carlo inference on the given posterior program, - via the Stan code generation backend, returning the given number of samples

see runStan for a more advanced interface

hmcStanInit :: ExprTuple t => Int -> P t -> t -> IO [t] #

like hmcStan but specifying the initial MC state

mh :: (ExprTuple r, Show r) => P r -> (r -> P r) -> r -> IO r #

Metropolis-Hastings inference

mh' :: (ExprType t, ExprTuple t, IfB t, BooleanOf t ~ B, Show t) => P t -> (t -> P t) -> t -> P t #

like mh but returns a Stochaskell probabilistic program that can be - used with compileCC, etc

mhRatio :: (ExprTuple t, Show t) => P t -> (t -> P t) -> t -> t -> R #

compute the M-H acceptance ratio

rjmc :: (ExprTuple t, IfB t, BooleanOf t ~ B, Show t) => P t -> (t -> P t) -> t -> P t #

Reversible Jump Monte Carlo inference

rjmcC :: (Constructor t, Show t) => P (Expression t) -> (t -> P (Expression t)) -> Expression t -> P (Expression t) #

like rjmc but for ADTs that implement the Constructor typeclass

Miscellaneous

binarize :: (forall a. (Num a, EqB a, OrdB a) => a -> BooleanOf a) -> ConstVal -> ConstVal #

map boolean function over elements of array

chain :: Monad m => Int -> (b -> m b) -> b -> m b #

like chain' but for arbitrary monads

chainRange :: (Num i, Monad m) => (Int, Int) -> (i -> x -> m x) -> x -> m x #

like chainRange' but for arbitrary monads

debug :: ExprTuple t => String -> t -> t #

Stochaskell equivalent of trace that runs within generated code

fromRight' :: Either String b -> b #

extract result from an Either value when possible, throw an exception - with the error string otherwise

id' :: Expression a -> Expression a #

identity function (forces root NodeRef to be floated)

interpolate :: (Ord a, Fractional a) => [(a, a)] -> a -> a #

piecewise linear interpolation

iterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a] #

parameter order equal to that of nest

linspace :: (IsList l, e ~ Item l, Fractional e, Integral i) => (e, e) -> i -> l #

evenly spaced points over interval

loop :: Monad m => a -> (a -> m a) -> m () #

infinite loop

mean :: (Foldable t, Fractional a) => t a -> a #

calculate the mean of a set

qfDiag :: RMat -> RVec -> RMat #

\(\mathrm{qfDiag}\ A\ x = x^\top A x\)

readRealMatrix :: FilePath -> Interval Integer -> Interval Integer -> IO ConstVal #

read CSV file into a matrix

selectItems :: [a] -> [Bool] -> [a] #

extract elements of first list where second list contains True

setRandomSeed :: Int -> IO () #

sets the global random seed

Warning: does not yet cover all sources of randomness

silence' :: IO a -> IO a #

prevent console output

slice :: ConstVal -> AbstractArray Integer [Integer] -> ConstVal #

extract the given indices from an array, eg.

diagonal = table `slice` [[i,i] | i <- 1...n]

square :: Num a => a -> a #

convenience function for squaring a value

staircase :: Ord a => [a] -> [a] -> a -> a #

step function

stochaskell :: IO () #

perform initialisation for interactive use

tic :: IO NominalDiffTime #

start a stopwatch

toc :: NominalDiffTime -> IO NominalDiffTime #

read a stopwatch

Re-exports

module Data.Either.Utils

Data.List.Utils

endswith :: Eq a => [a] -> [a] -> Bool #

replace :: Eq a => [a] -> [a] -> [a] -> [a] #

split :: Eq a => [a] -> [a] -> [[a]] #

startswith :: Eq a => [a] -> [a] -> Bool #

addToAL :: Eq key => [(key, elt)] -> key -> elt -> [(key, elt)] #

alwaysElemRIndex :: Eq a => a -> [a] -> Int #

breakList :: ([a] -> Bool) -> [a] -> ([a], [a]) #

contains :: Eq a => [a] -> [a] -> Bool #

countElem :: Eq a => a -> [a] -> Int #

delFromAL :: Eq key => [(key, a)] -> key -> [(key, a)] #

dropWhileList :: ([a] -> Bool) -> [a] -> [a] #

elemRIndex :: Eq a => a -> [a] -> Maybe Int #

fixedWidth :: [Int] -> WholeFunc a [a] #

flipAL :: (Eq key, Eq val) => [(key, val)] -> [(val, [key])] #

genericJoin :: Show a => String -> [a] -> String #

grab :: Int -> State [a] [a] #

hasAny :: Eq a => [a] -> [a] -> Bool #

hasKeyAL :: Eq a => a -> [(a, b)] -> Bool #

keysAL :: [(key, a)] -> [key] #

merge :: Ord a => [a] -> [a] -> [a] #

mergeBy :: (a -> a -> Ordering) -> [a] -> [a] -> [a] #

seqList :: [a] -> [a] #

spanList :: ([a] -> Bool) -> [a] -> ([a], [a]) #

strFromAL :: (Show a, Show b) => [(a, b)] -> String #

strToAL :: (Read a, Read b) => String -> [(a, b)] #

subIndex :: Eq a => [a] -> [a] -> Maybe Int #

takeWhileList :: ([a] -> Bool) -> [a] -> [a] #

uniq :: Eq a => [a] -> [a] #

valuesAL :: [(a, value)] -> [value] #

wholeMap :: WholeFunc a b -> [a] -> [b] #

newtype WholeFunc a b #

Constructors

WholeFunc ([a] -> (WholeFunc a b, [a], [b])) 

Data.Number.Transfinite

class PartialOrd a => Transfinite a where #

Minimal complete definition

infinity, negativeInfinity, notANumber, isInfinite, isNaN

Methods

infinity :: a #

negativeInfinity :: a #

notANumber :: a #

Instances
Transfinite Double 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Double #

negativeInfinity :: Double #

notANumber :: Double #

isInfinite :: Double -> Bool

isNaN :: Double -> Bool

Transfinite Float 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Float #

negativeInfinity :: Float #

notANumber :: Float #

isInfinite :: Float -> Bool

isNaN :: Float -> Bool

Transfinite ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

infinity :: ConstVal #

negativeInfinity :: ConstVal #

notANumber :: ConstVal #

isInfinite :: ConstVal -> Bool

isNaN :: ConstVal -> Bool

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool

isNaN :: Expression t -> Bool

GHC.Exts

class IsList l where #

The IsList class and its methods are intended to be used in - conjunction with the OverloadedLists extension.

Since: base-4.7.0.0

Minimal complete definition

fromList, toList

Associated Types

type Item l :: * #

The Item type function returns the type of items of the structure + insertAt the value whilst keeping the vector sorted

findSortedInsertIndexBound :: Interval Z -> R -> RVec -> Z #

like findSortedInsertIndex but with the given bounds on the index

floor' :: R -> Z #

Stochaskell equivalent of floor

min' :: Expression a -> Expression a -> Expression a #

minimum of two values

solve :: ExprTuple t => t -> t -> EEnv #

equation solver / transformation inverter

solveP :: ExprTuple t => P t -> t -> EEnv #

solve applied to program outputs

sum' :: (ExprType a, Num a) => Expression [a] -> Expression a #

Stochaskell equivalent of sum

symbol :: forall t. ExprType t => String -> Expression t #

create a symbolic variable

symbols :: ExprType t => String -> [Expression t] #

create a list of (one-letter) symbols

Linear algebra

class InnerProduct v e | v -> e where #

Methods

(<.>) :: v -> v -> e infixr 8 #

generalisation of <.>

Instances
InnerProduct ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(<.>) :: ConstVal -> ConstVal -> ConstVal #

InnerProduct (Expression [e]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

(<.>) :: Expression [e] -> Expression [e] -> Expression e #

class LinearOperator m v | m -> v, v -> m where #

generalised linear operator interface

Minimal complete definition

(#>), (<#), diag, asColumn, asRow

Methods

(#>) :: m -> v -> v infixr 8 #

see #>

(<#) :: v -> m -> v #

see <#

diag :: v -> m #

convert vector to diagonal matrix

asColumn :: v -> m #

convert vector to column

asRow :: v -> m #

convert vector to row

outer :: (LinearOperator m v, Semigroup m) => v -> v -> m #

outer product

Instances
LinearOperator ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(#>) :: ConstVal -> ConstVal -> ConstVal #

(<#) :: ConstVal -> ConstVal -> ConstVal #

diag :: ConstVal -> ConstVal #

asColumn :: ConstVal -> ConstVal #

asRow :: ConstVal -> ConstVal #

outer :: ConstVal -> ConstVal -> ConstVal #

LinearOperator DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

(#>) :: DExpr -> DExpr -> DExpr #

(<#) :: DExpr -> DExpr -> DExpr #

diag :: DExpr -> DExpr #

asColumn :: DExpr -> DExpr #

asRow :: DExpr -> DExpr #

outer :: DExpr -> DExpr -> DExpr #

LinearOperator (Expression [[e]]) (Expression [e]) # 
Instance details

Defined in Data.Expression

Methods

(#>) :: Expression [[e]] -> Expression [e] -> Expression [e] #

(<#) :: Expression [e] -> Expression [[e]] -> Expression [e] #

diag :: Expression [e] -> Expression [[e]] #

asColumn :: Expression [e] -> Expression [[e]] #

asRow :: Expression [e] -> Expression [[e]] #

outer :: Expression [e] -> Expression [e] -> Expression [[e]] #

class Matrix m i e | m -> i e where #

generalised matrix interface

Minimal complete definition

matrix, blockMatrix, eye, zeros, matrixRows, matrixCols

Methods

matrix :: AbstractArray i e -> m #

convert from abstract array

blockMatrix :: [[m]] -> m #

create a block matrix

eye :: i -> m #

identity matrix

zeros :: i -> i -> m #

zero matrix

matrixRows :: m -> i #

number of rows

matrixCols :: m -> i #

number of columns

designMatrix :: (Indexable v i e, Num i) => i -> AbstractArray i v -> m #

pack vectors as rows of a matrix

Instances
Matrix ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

matrix :: AbstractArray Integer ConstVal -> ConstVal #

blockMatrix :: [[ConstVal]] -> ConstVal #

eye :: Integer -> ConstVal #

zeros :: Integer -> Integer -> ConstVal #

matrixRows :: ConstVal -> Integer #

matrixCols :: ConstVal -> Integer #

designMatrix :: (Indexable v Integer ConstVal, Num Integer) => Integer -> AbstractArray Integer v -> ConstVal #

Matrix DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray DExpr DExpr -> DExpr #

blockMatrix :: [[DExpr]] -> DExpr #

eye :: DExpr -> DExpr #

zeros :: DExpr -> DExpr -> DExpr #

matrixRows :: DExpr -> DExpr #

matrixCols :: DExpr -> DExpr #

designMatrix :: (Indexable v DExpr DExpr, Num DExpr) => DExpr -> AbstractArray DExpr v -> DExpr #

ExprType e => Matrix (Expression [[e]]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

matrix :: AbstractArray Z (Expression e) -> Expression [[e]] #

blockMatrix :: [[Expression [[e]]]] -> Expression [[e]] #

eye :: Z -> Expression [[e]] #

zeros :: Z -> Z -> Expression [[e]] #

matrixRows :: Expression [[e]] -> Z #

matrixCols :: Expression [[e]] -> Z #

designMatrix :: (Indexable v Z (Expression e), Num Z) => Z -> AbstractArray Z v -> Expression [[e]] #

class Scalable a v | v -> a where #

Methods

(*>) :: a -> v -> v infixr 7 #

scalar by array multiplication (see *>)

Instances
Scalable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

(*>) :: ConstVal -> ConstVal -> ConstVal #

Scalable R RVec # 
Instance details

Defined in Data.Expression

Methods

(*>) :: R -> RVec -> RVec #

(IArray UArray e, Num e, Ix i) => Scalable e (UArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(*>) :: e -> UArray i e -> UArray i e #

(Num e, Ix i) => Scalable e (Array i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(*>) :: e -> Array i e -> Array i e #

ExprType e => Scalable (Expression e) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

(*>) :: Expression e -> Expression [[e]] -> Expression [[e]] #

class SquareMatrix m e | m -> e where #

Methods

chol :: m -> m #

lower-triangular Cholesky decomposition, see chol

inv :: m -> m #

see inv

det :: m -> e #

see det

logDet :: m -> e #

logarithm of the absolute value of the determinant

Instances
SquareMatrix ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

chol :: ConstVal -> ConstVal #

inv :: ConstVal -> ConstVal #

det :: ConstVal -> ConstVal #

logDet :: ConstVal -> ConstVal #

SquareMatrix DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

chol :: DExpr -> DExpr #

inv :: DExpr -> DExpr #

det :: DExpr -> DExpr #

logDet :: DExpr -> DExpr #

SquareMatrix (Expression [[e]]) (Expression e) # 
Instance details

Defined in Data.Expression

Methods

chol :: Expression [[e]] -> Expression [[e]] #

inv :: Expression [[e]] -> Expression [[e]] #

det :: Expression [[e]] -> Expression e #

logDet :: Expression [[e]] -> Expression e #

class Transposable m mt | m -> mt, mt -> m where #

Methods

tr :: m -> mt #

conjugate transpose

tr' :: m -> mt #

transpose

Instances
Transposable ConstVal ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

tr :: ConstVal -> ConstVal #

tr' :: ConstVal -> ConstVal #

Transposable DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

tr :: DExpr -> DExpr #

tr' :: DExpr -> DExpr #

(CTrans t, Container Vector t) => Transposable (Matrix t) (Matrix t) 
Instance details

Defined in Internal.Numeric

Methods

tr :: Matrix t -> Matrix t #

tr' :: Matrix t -> Matrix t #

ExprType e => Transposable (Expression [[e]]) (Expression [[e]]) # 
Instance details

Defined in Data.Expression

Methods

tr :: Expression [[e]] -> Expression [[e]] #

tr' :: Expression [[e]] -> Expression [[e]] #

class Vector v i e | v -> i e, i e -> v where #

generalised vector interface

Methods

vector :: AbstractArray i e -> v #

convert from abstract array

blockVector :: [v] -> v #

see blockMatrix

vectorSize :: v -> i #

number of elements in vector

Instances
Vector ConstVal Integer ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

vector :: AbstractArray Integer ConstVal -> ConstVal #

blockVector :: [ConstVal] -> ConstVal #

vectorSize :: ConstVal -> Integer #

Vector DExpr DExpr DExpr # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray DExpr DExpr -> DExpr #

blockVector :: [DExpr] -> DExpr #

vectorSize :: DExpr -> DExpr #

ExprType e => Vector (Expression [e]) Z (Expression e) # 
Instance details

Defined in Data.Expression

Methods

vector :: AbstractArray Z (Expression e) -> Expression [e] #

blockVector :: [Expression [e]] -> Expression [e] #

vectorSize :: Expression [e] -> Z #

Types

type B #

Arguments

 = Expression Bool

boolean

type R #

Arguments

 = Expression Double

real

type Z #

Arguments

 = Expression Integer

integer

type BVec #

Arguments

 = Expression [Bool]

boolean vector

type RVec #

Arguments

 = Expression [Double]

real vector

type ZVec #

Arguments

 = Expression [Integer]

integer vector

type BMat #

Arguments

 = Expression [[Bool]]

boolean matrix

type RMat #

Arguments

 = Expression [[Double]]

real matrix

type ZMat #

Arguments

 = Expression [[Integer]]

integer matrix

Type casting

class Cast a b where #

cast a value of one type to another

Methods

cast :: a -> b #

Instances
Cast Int R # 
Instance details

Defined in Data.Expression

Methods

cast :: Int -> R #

Cast Z R # 
Instance details

Defined in Data.Expression

Methods

cast :: Z -> R #

ExprType t => Cast t (Expression t) # 
Instance details

Defined in Data.Expression

Methods

cast :: t -> Expression t #

Cast (Expression t) (Expression [[t]]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [[t]] #

Cast (Expression t) (Expression [t]) # 
Instance details

Defined in Data.Expression

Methods

cast :: Expression t -> Expression [t] #

boolean :: (Eq a, Boolean a, Boolean b) => a -> b #

convert between boolean types (eg. Bool to B)

integer :: (Integral i, Num n) => i -> n #

convert between integer types (eg. Int to Z)

real :: (Real r, Fractional f) => r -> f #

convert between real types (eg. Double to R)

list :: (IsList l, IsList l', Item l ~ Item l') => l -> l' #

convert between list types (eg. [Double] to RVec)

Abstract arrays

type Interval i = (i, i) #

closed interval of integers

data AbstractArray i e #

create abstract arrays with an expression like

[ i + j | i <- 1...rows, j <- 1...cols ]
Instances
Monad (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

(>>=) :: AbstractArray i a -> (a -> AbstractArray i b) -> AbstractArray i b #

(>>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

return :: a -> AbstractArray i a #

fail :: String -> AbstractArray i a #

Functor (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

fmap :: (a -> b) -> AbstractArray i a -> AbstractArray i b #

(<$) :: a -> AbstractArray i b -> AbstractArray i a #

Applicative (AbstractArray i) # 
Instance details

Defined in Data.Array.Abstract

Methods

pure :: a -> AbstractArray i a #

(<*>) :: AbstractArray i (a -> b) -> AbstractArray i a -> AbstractArray i b #

liftA2 :: (a -> b -> c) -> AbstractArray i a -> AbstractArray i b -> AbstractArray i c #

(*>) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i b #

(<*) :: AbstractArray i a -> AbstractArray i b -> AbstractArray i a #

(Ix i, Show i, Eq e) => Eq (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

(==) :: AbstractArray i e -> AbstractArray i e -> Bool #

(/=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(Ix i, Show i, Ord e) => Ord (AbstractArray i e) # 
Instance details

Defined in Data.Array.Abstract

Methods

compare :: AbstractArray i e -> AbstractArray i e -> Ordering #

(<) :: AbstractArray i e -> AbstractArray i e -> Bool #

(<=) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>) :: AbstractArray i e -> AbstractArray i e -> Bool #

(>=) :: AbstractArray i e -> AbstractArray i e -> Bool #

max :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

min :: AbstractArray i e -> AbstractArray i e -> AbstractArray i e #

Indexable (AbstractArray i e) [i] e # 
Instance details

Defined in Data.Array.Abstract

Methods

(!) :: AbstractArray i e -> [i] -> e #

bounds :: AbstractArray i e -> Interval [i] #

deleteAt :: AbstractArray i e -> [i] -> AbstractArray i e #

insertAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

replaceAt :: AbstractArray i e -> ([i], e) -> AbstractArray i e #

deleteIndex :: AbstractArray i e -> [i] -> AbstractArray i e #

insertIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

replaceIndex :: AbstractArray i e -> [i] -> e -> AbstractArray i e #

(...) :: a -> a -> AbstractArray a a infix 5 #

create abstract array containing given integer range

Probability distributions

data P t #

Stochaskell probabilistic program intermediate representation

Instances
Monad P # 
Instance details

Defined in Data.Program

Methods

(>>=) :: P a -> (a -> P b) -> P b #

(>>) :: P a -> P b -> P b #

return :: a -> P a #

fail :: String -> P a #

Functor P # 
Instance details

Defined in Data.Program

Methods

fmap :: (a -> b) -> P a -> P b #

(<$) :: a -> P b -> P a #

Applicative P # 
Instance details

Defined in Data.Program

Methods

pure :: a -> P a #

(<*>) :: P (a -> b) -> P a -> P b #

liftA2 :: (a -> b -> c) -> P a -> P b -> P c #

(*>) :: P a -> P b -> P b #

(<*) :: P a -> P b -> P a #

MonadGuard P # 
Instance details

Defined in Data.Program

Methods

guard :: ConditionOf (P ()) -> P () #

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

(ExprType r, ExprType f, Show f) => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

Eq t => Eq (P t) # 
Instance details

Defined in Data.Program

Methods

(==) :: P t -> P t -> Bool #

(/=) :: P t -> P t -> Bool #

ExprTuple t => Show (P t) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> P t -> ShowS #

show :: P t -> String #

showList :: [P t] -> ShowS #

(IfB t, BooleanOf t ~ B) => IfB (P t) # 
Instance details

Defined in Data.Program

Methods

ifB :: bool ~ BooleanOf (P t) => bool -> P t -> P t -> P t #

(ExprTuple a, ExprTuple b) => Show (a -> P b) # 
Instance details

Defined in Data.Program

Methods

showsPrec :: Int -> (a -> P b) -> ShowS #

show :: (a -> P b) -> String #

showList :: [a -> P b] -> ShowS #

type BooleanOf (P t) # 
Instance details

Defined in Data.Program

type BooleanOf (P t) = B
type ConditionOf (P ()) # 
Instance details

Defined in Data.Program

type ConditionOf (P ()) = Expression Bool

class Monad m => Distribution d s m t | d m t -> s #

generalised probability distribution interface

Minimal complete definition

sample

Instances
Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

Distribution Logistic (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Logistic (Double, Double) -> IO Double

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

class Joint m i r f | m -> i where #

Methods

joint :: (AbstractArray i r -> f) -> AbstractArray i (m r) -> m f #

create distribution over arrays as the product of an array of + independent distributions, eg.

joint matrix [ normal i j | i <- 1...m, j <- 1...n ]
Instances
Joint IO Integer e f # 
Instance details

Defined in Data.Array.Abstract

Methods

joint :: (AbstractArray Integer e -> f) -> AbstractArray Integer (IO e) -> IO f #

(ExprType r, ExprType f, Show f) => Joint P Z (Expression r) (Expression f) # 
Instance details

Defined in Data.Program

Methods

joint :: (AbstractArray Z (Expression r) -> Expression f) -> AbstractArray Z (P (Expression r)) -> P (Expression f) #

Primitives

Boolean

data Bernoulli p #

Instances
Distribution Bernoulli Double IO Bool # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Bernoulli Double -> IO Bool

Distribution Bernoulli R P B # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoulli R -> P B

data Bernoullis p #

Instances
Distribution Bernoullis RVec P BVec # 
Instance details

Defined in Data.Program

Methods

sample :: Bernoullis RVec -> P BVec

bernoulli :: Distribution Bernoulli s m t => s -> m t #

bernoullis :: Distribution Bernoullis s m t => s -> m t #

bernoulliLogit :: Distribution Bernoulli s m t => s -> m t #

bernoulliLogits :: Distribution Bernoullis s m t => s -> m t #

Discrete

data Geometric a #

Instances
Distribution Geometric Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Geometric Double -> IO Integer

Distribution Geometric R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Geometric R -> P Z

data NegBinomial a #

Instances
Distribution NegBinomial (Double, Double) IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: NegBinomial (Double, Double) -> IO Integer

Distribution NegBinomial (R, R) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: NegBinomial (R, R) -> P Z

data PMF a #

Instances
Distribution PMF RVec P Z # 
Instance details

Defined in Data.Program

Methods

sample :: PMF RVec -> P Z

Distribution PMF [Double] IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: PMF [Double] -> IO Integer

data Poisson a #

Instances
Distribution Poisson Double IO Integer # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Poisson Double -> IO Integer

Distribution Poisson R P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Poisson R -> P Z

geometric :: (Distribution Geometric t1 m t2, Num t2) => Integer -> t1 -> m t2 #

negBinomial :: Distribution NegBinomial (a, b) m t => a -> b -> m t #

pmf :: Distribution PMF s m t => s -> m t #

distribution over indices given by vector of probabilities

poisson :: Distribution Poisson s m t => s -> m t #

Continuous

data Beta a #

Instances
Distribution Beta (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Beta (Double, Double) -> IO Double

Distribution Beta (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Beta (R, R) -> P R

data Cauchy a #

Instances
Distribution Cauchy (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Cauchy (Double, Double) -> IO Double

Distribution Cauchy (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Cauchy (R, R) -> P R

data Gamma a #

Instances
Distribution Gamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Gamma (Double, Double) -> IO Double

Distribution Gamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Gamma (R, R) -> P R

data InvGamma a #

Instances
Distribution InvGamma (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: InvGamma (Double, Double) -> IO Double

Distribution InvGamma (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: InvGamma (R, R) -> P R

data Logistic a #

Instances
Distribution Logistic (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Logistic (Double, Double) -> IO Double

Distribution Logistic (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Logistic (R, R) -> P R

data Normal a #

Instances
Distribution Normal (Double, Double) IO Double # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Normal (Double, Double) -> IO Double

Distribution Normal (RVec, RMat) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (RVec, RMat) -> P RVec

Distribution Normal (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Normal (R, R) -> P R

data Normals a #

Instances
Distribution Normals (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RMat, RMat) -> P RMat

Distribution Normals (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Normals (RVec, RVec) -> P RVec

data Uniform a #

Instances
Random t => Distribution Uniform (t, t) IO t # 
Instance details

Defined in Data.Random.Distribution.Abstract

Methods

sample :: Uniform (t, t) -> IO t

Distribution Uniform (Z, Z) P Z # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (Z, Z) -> P Z

Distribution Uniform (R, R) P R # 
Instance details

Defined in Data.Program

Methods

sample :: Uniform (R, R) -> P R

data Uniforms a #

Instances
Distribution Uniforms (RMat, RMat) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RMat, RMat) -> P RMat

Distribution Uniforms (RVec, RVec) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: Uniforms (RVec, RVec) -> P RVec

beta :: Distribution Beta (a, b) m t => a -> b -> m t #

cauchy :: Distribution Cauchy (a, b) m t => a -> b -> m t #

gamma :: Distribution Gamma (a, b) m t => a -> b -> m t #

invGamma :: Distribution InvGamma (a, b) m t => a -> b -> m t #

logistic :: Distribution Logistic (a, b) m t => a -> b -> m t #

normal :: Distribution Normal (a, b) m t => a -> b -> m t #

normals :: Distribution Normals (a, b) m t => a -> b -> m t #

uniform :: Distribution Uniform (a, b) m t => a -> b -> m t #

uniforms :: Distribution Uniforms (a, b) m t => a -> b -> m t #

Vector

data OrderedSample a #

Instances
ExprType t => Distribution OrderedSample (Z, P (Expression t)) P (Expression [t]) # 
Instance details

Defined in Data.Program

Methods

sample :: OrderedSample (Z, P (Expression t)) -> P (Expression [t])

data PoissonProcess a #

Instances
Distribution PoissonProcess (R, R -> R, R) P RVec # 
Instance details

Defined in Data.Program

Methods

sample :: PoissonProcess (R, R -> R, R) -> P RVec

orderedSample :: Distribution OrderedSample (a, b) m t => a -> b -> m t #

orderedSample n d gives an ordered vector of n samples from a base + distribution d

poissonProcess :: Distribution PoissonProcess (a, b, c) m t => a -> b -> c -> m t #

Matrix

data LKJ a #

Instances
Distribution LKJ (R, Interval Z) P RMat # 
Instance details

Defined in Data.Program

Methods

sample :: LKJ (R, Interval Z) -> P RMat

corrLKJ :: Distribution LKJ (a, b) m t => a -> b -> m t #

Logarithmic probability density functions

lpdf :: (ExprTuple t, Show t) => P t -> t -> R #

compute log pdf of distribution represented by probabilistic program

lpdfAux :: (ExprTuple t, Show t) => P t -> t -> R #

compute joint pdf of primitive random variables within the given program

lpdfAuxC :: (Constructor t, Show t) => P (Expression t) -> Expression t -> R #

lpdfCond :: (ExprTuple s, ExprTuple t, Show t) => (s -> P t) -> s -> t -> R #

pdf :: (ExprTuple t, Show t) => P t -> t -> R #

density :: ExprTuple t => P t -> t -> LogFloat #

density' :: ExprTuple t => P t -> t -> LogFloat #

Primitives

lpdfGamma :: Double -> Double -> Double -> Double #

lpdfNegBinomial :: Integer -> Double -> Double -> Double #

lpdfNormal :: Floating a => a -> a -> a -> a #

lpdfPoisson :: Integer -> Double -> Double #

lpdfUniform :: (Ord p, Floating p) => p -> p -> p -> p #

lpdfDiscreteUniform :: (Floating p, Integral a) => a -> a -> a -> p #

Transformers

mixture :: forall t. ExprTuple t => [(R, P t)] -> P t #

creates a mixture distribution, eg.

mixture [(0.7, uniform 0 1), (0.3, normal 0 1)]

mixture' :: ExprTuple t => [(R, P t)] -> P t #

like mixture, but produces a flattened intermediate representation + that uses a case expression rather than a switch statement

truncated :: Expression t -> Expression t -> P (Expression t) -> P (Expression t) #

truncate distribution to given bounds

foldP :: forall t f. (Traversable f, Constructor (f (FixE f)), ExprTuple t, ExprType (f (FixE f)), ExprType (f t)) => (Expression (f t) -> P t) -> FixE' f -> P t #

unfoldP :: forall t f. (Traversable f, Constructor (f t), ExprTuple t, ExprType (f (FixE f)), ExprType (f t)) => (t -> P (Expression (f t))) -> t -> P (FixE' f) #

Iteration

chain' :: ExprTuple t => Z -> (t -> P t) -> t -> P t #

convenience function for calling chainRange' starting at 1 and ignoring indices

chainRange' :: forall t. ExprTuple t => Interval Z -> (Z -> t -> P t) -> t -> P t #

iterate a Markov chain over the given integer range, eg.

chainRange' (1,10) (\i x -> normal x 1) 0 -- 10-step standard normal random walk from 0

Pre-defined probabilistic programs

lognormal :: (Distribution Normal (a, b1) m b2, Floating b2) => a -> b1 -> m b2 #

log-normal distribution

normalChol :: Z -> RVec -> RMat -> P RVec #

multivariate normal via Cholesky decomposition of covariance matrix

normalsChol :: Z -> Z -> RVec -> RMat -> P RMat #

iid normalChol samples as rows

normalCond :: Z -> (Expression t -> Expression t -> R) -> R -> Expression [t] -> RVec -> Expression t -> P R #

Gaussian process conditioned on observations

Sampling

compileCC :: forall s t. (ExprTuple s, ExprTuple t) => (s -> P t) -> IO (s -> IO t) #

compile probabilistic program to native machine code, via the C++ backend

runCC :: forall s t. (ExprTuple s, ExprTuple t) => (s -> P t) -> s -> IO t #

sample probabilistic program via compileCC

runStep :: forall t. ExprTuple t => (t -> P t) -> t -> IO t #

sample probabilistic program via Stochaskell's interpreter

simulate :: ExprTuple t => P t -> IO t #

like runStep for programs that don't take parameters

Inference

hmcStan :: ExprTuple t => Int -> P t -> IO [t] #

perform Hamiltonian Monte Carlo inference on the given posterior program, + via the Stan code generation backend, returning the given number of samples

see runStan for a more advanced interface

hmcStanInit :: ExprTuple t => Int -> P t -> t -> IO [t] #

like hmcStan but specifying the initial MC state

rjmc :: (ExprTuple t, IfB t, BooleanOf t ~ B, Show t) => P t -> (t -> P t) -> t -> P t #

Reversible Jump Monte Carlo inference

rjmcC :: (Constructor t, Show t) => P (Expression t) -> (t -> P (Expression t)) -> Expression t -> P (Expression t) #

like rjmc but for ADTs that implement the Constructor typeclass

rjmc1 :: (ExprType t, ExprTuple t, IfB t, BooleanOf t ~ B, Show t) => P t -> (t -> P t) -> t -> P t #

like rjmc but assumes the Jacobian factor is equal to one

rjmc1Ratio :: (ExprTuple t, Show t) => P t -> (t -> P t) -> t -> t -> R #

acceptance ratio for rjmc1

Miscellaneous

binarize :: (forall a. (Num a, EqB a, OrdB a) => a -> BooleanOf a) -> ConstVal -> ConstVal #

map boolean function over elements of array

caseZ :: forall t. ExprTuple t => Z -> [t] -> t #

chain :: Monad m => Int -> (b -> m b) -> b -> m b #

like chain' but for arbitrary monads

chainRange :: (Num i, Monad m) => (Int, Int) -> (i -> x -> m x) -> x -> m x #

like chainRange' but for arbitrary monads

debug :: ExprTuple t => String -> t -> t #

Stochaskell equivalent of trace that runs within generated code

deepseq :: NFData a => a -> b -> b #

deepseq: fully evaluates the first argument, before returning the + second.

The name deepseq is used to illustrate the relationship to seq: + where seq is shallow in the sense that it only evaluates the top + level of its argument, deepseq traverses the entire data structure + evaluating it completely.

deepseq can be useful for forcing pending exceptions, + eradicating space leaks, or forcing lazy I/O to happen. It is + also useful in conjunction with parallel Strategies (see the + parallel package).

There is no guarantee about the ordering of evaluation. The + implementation may evaluate the components of the structure in + any order or in parallel. To impose an actual order on + evaluation, use pseq from Control.Parallel in the + parallel package.

Since: deepseq-1.1.0.0

fromCase :: forall c t. (Constructor c, ExprTuple t) => (c -> t) -> Expr c -> t #

fromCaseP :: forall c t. (Constructor c, ExprTuple t) => (c -> P t) -> Expression c -> P t #

fromCaseP' :: forall c t. (Constructor c, ExprTuple t) => (c -> P t) -> Expression c -> P t #

fromRight' :: Either String b -> b #

extract result from an Either value when possible, throw an exception + with the error string otherwise

interpolate :: (Ord a, Fractional a) => [(a, a)] -> a -> a #

piecewise linear interpolation

iterateLimit :: Monad m => Int -> (a -> m a) -> a -> m [a] #

parameter order equal to that of nest

linspace :: (IsList l, e ~ Item l, Fractional e, Integral i) => (e, e) -> i -> l #

evenly spaced points over interval

logFromLogFloat :: LogFloat -> Double #

Return the log-domain value itself without conversion.

loop :: Monad m => a -> (a -> m a) -> m () #

infinite loop

mean :: (Foldable t, Fractional a) => t a -> a #

calculate the mean of a set

qfDiag :: RMat -> RVec -> RMat #

\(\mathrm{qfDiag}\ A\ x = x^\top A x\)

readRealMatrix :: FilePath -> IO ConstVal #

read CSV file into a matrix

selectItems :: [a] -> [Bool] -> [a] #

extract elements of first list where second list contains True

setRandomSeed :: Int -> IO () #

sets the global random seed

Warning: does not yet cover all sources of randomness

silence' :: IO a -> IO a #

prevent console output

slice :: ConstVal -> AbstractArray Integer [Integer] -> ConstVal #

extract the given indices from an array, eg.

diagonal = table `slice` [[i,i] | i <- 1...n]

square :: Num a => a -> a #

convenience function for squaring a value

staircase :: Ord a => [a] -> [a] -> a -> a #

step function

stochaskell :: IO () #

perform initialisation for interactive use

tic :: IO NominalDiffTime #

start a stopwatch

toc :: NominalDiffTime -> IO NominalDiffTime #

read a stopwatch

vizIR :: ExprTuple t => P t -> IO String #

Re-exports

module Data.Either.Utils

Data.List.Utils

uniq :: Eq a => [a] -> [a] #

Given a list, returns a new list with all duplicate elements removed. +For example:

uniq "Mississippi" -> "Misp"

You should not rely on this function necessarily preserving order, though +the current implementation happens to.

This function is not compatible with infinite lists.

This is presently an alias for Data.List.nub

subIndex :: Eq a => [a] -> [a] -> Maybe Int #

Similar to Data.List.elemIndex. Instead of looking for one element in a +list, this function looks for the first occurance of a sublist in the list, +and returns the index of the first element of that occurance. If there is no +such list, returns Nothing.

If the list to look for is the empty list, will return Just 0 regardless +of the content of the list to search.

Examples:

subIndex "foo" "asdfoobar" -> Just 3
+subIndex "foo" [] -> Nothing
+subIndex "" [] -> Just 0
+subIndex "" "asdf" -> Just 0
+subIndex "test" "asdftestbartest" -> Just 4
+subIndex [(1::Int), 2] [0, 5, 3, 2, 1, 2, 4] -> Just 4

grab :: Int -> State [a] [a] #

Helps you pick out fixed-width components from a list.

Example:

conv :: String -> (String,String)
+conv = runState $
+        do f3 <- grab 3
+           n2 <- grab 2
+           return $ f3 ++ "," ++ n2
+
+main = print $ conv "TestIng"

Prints:

("Tes,tI","ng")

fixedWidth :: [Int] -> WholeFunc a [a] #

A parser designed to process fixed-width input fields. Use it with +wholeMap.

The Int list passed to this function is the list of the field widths desired +from the input. The result is a list of those widths, if possible. If any +of the input remains after processing this list, it is added on as the final +element in the result list. If the input is less than the sum of the requested +widths, then the result list will be short the appropriate number of elements, +and its final element may be shorter than requested.

Examples:

wholeMap (fixedWidth [1, 2, 3]) "1234567890"
+ --> ["1","23","456","7890"]
+wholeMap (fixedWidth (repeat 2)) "123456789"
+ --> ["12","34","56","78","9"]
+wholeMap (fixedWidth []) "123456789"
+ --> ["123456789"]
+wholeMap (fixedWidth [5, 3, 6, 1]) "Hello, This is a test."
+ --> ["Hello",", T","his is"," ","a test."]

wholeMap :: WholeFunc a b -> [a] -> [b] #

This is an enhanced version of the concatMap or map functions in +Data.List.

Unlike those functions, this one:

  • Can consume a varying number of elements from the input list during + each iteration
  • Can arbitrarily decide when to stop processing data
  • Can return a varying number of elements to insert into the output list
  • Can actually switch processing functions mid-stream
  • Is not even restricted to processing the input list intact

The function used by wholeMap, of type WholeFunc, is repeatedly called +with the input list. The function returns three things: the function +to call for the next iteration (if any), what remains of the input list, +and the list of output elements generated during this iteration. The return +value of wholeMap is the concatenation of the output element lists from +all iterations.

Processing stops when the remaining input list is empty. An example +of a WholeFunc is fixedWidth.

seqList :: [a] -> [a] #

Forces the evaluation of the entire list.

alwaysElemRIndex :: Eq a => a -> [a] -> Int #

Like elemRIndex, but returns -1 if there is nothing +found.

elemRIndex :: Eq a => a -> [a] -> Maybe Int #

Returns the rightmost index of the given element in the +given list.

countElem :: Eq a => a -> [a] -> Int #

Returns a count of the number of times the given element occured in the +given list.

strToAL :: (Read a, Read b) => String -> [(a, b)] #

The inverse of strFromAL, this function reads a string and outputs the +appropriate association list.

Like strFromAL, this is designed to work with [(String, String)] association +lists but may also work with other objects with simple representations.

strFromAL :: (Show a, Show b) => [(a, b)] -> String #

Converts an association list to a string. The string will have +one pair per line, with the key and value both represented as a Haskell string.

This function is designed to work with [(String, String)] association lists, +but may work with other types as well.

flipAL :: (Eq key, Eq val) => [(key, val)] -> [(val, [key])] #

Flips an association list. Converts (key1, val), (key2, val) pairs +to (val, [key1, key2]).

hasKeyAL :: Eq a => a -> [(a, b)] -> Bool #

Indicates whether or not the given key is in the AL.

valuesAL :: [(a, value)] -> [value] #

Returns the values the comprise the (key, value) pairs of the given +AL.

Same as:

map snd

keysAL :: [(key, a)] -> [key] #

Returns the keys that comprise the (key, value) pairs of the given AL.

Same as:

map fst

delFromAL :: Eq key => [(key, a)] -> key -> [(key, a)] #

Removes all (key, value) pairs from the given list where the key +matches the given one.

addToAL :: Eq key => [(key, elt)] -> key -> elt -> [(key, elt)] #

Adds the specified (key, value) pair to the given list, removing any +existing pair with the same key already present.

contains :: Eq a => [a] -> [a] -> Bool #

Returns true if the given parameter is a sublist of the given list; +false otherwise.

Example:

contains "Haskell" "I really like Haskell." -> True
+contains "Haskell" "OCaml is great." -> False

This function was submitted to GHC and was applied as +isInfixOf. This function therefore is deprecated and will +be removed in future versions.

genericJoin :: Show a => String -> [a] -> String #

Like join, but works with a list of anything showable, converting +it to a String.

Examples:

genericJoin ", " [1, 2, 3, 4] -> "1, 2, 3, 4"
+genericJoin "|" ["foo", "bar", "baz"] -> "\"foo\"|\"bar\"|\"baz\""

replace :: Eq a => [a] -> [a] -> [a] -> [a] #

Given a list and a replacement list, replaces each occurance of the search +list with the replacement list in the operation list.

Example:

replace "," "." "127,0,0,1" -> "127.0.0.1"

This could logically be thought of as:

replace old new l = join new . split old $ l

split :: Eq a => [a] -> [a] -> [[a]] #

Given a delimiter and a list (or string), split into components.

Example:

split "," "foo,bar,,baz," -> ["foo", "bar", "", "baz", ""]
split "ba" ",foo,bar,,baz," -> [",foo,","r,,","z,"]

breakList :: ([a] -> Bool) -> [a] -> ([a], [a]) #

Similar to Data.List.break, but performs the test on the entire remaining +list instead of just one element.

spanList :: ([a] -> Bool) -> [a] -> ([a], [a]) #

Similar to Data.List.span, but performs the test on the entire remaining +list instead of just one element.

spanList p xs is the same as (takeWhileList p xs, dropWhileList p xs)

dropWhileList :: ([a] -> Bool) -> [a] -> [a] #

Similar to Data.List.dropWhile, drops elements while the func is true. +The function is given the remainder of the list to examine.

takeWhileList :: ([a] -> Bool) -> [a] -> [a] #

Similar to Data.List.takeWhile, takes elements while the func is true. +The function is given the remainder of the list to examine.

hasAny #

Arguments

:: Eq a 
=> [a]

List of elements to look for

-> [a]

List to search

-> Bool

Result

Returns true if the given list contains any of the elements in the search +list.

endswith :: Eq a => [a] -> [a] -> Bool #

Returns true if the given list ends with the specified elements; +false otherwise. (This is an alias for "Data.List.isSuffixOf".)

Example:

endswith "lo" "Hello" -> True

startswith :: Eq a => [a] -> [a] -> Bool #

Returns true if the given list starts with the specified elements; +false otherwise. (This is an alias for "Data.List.isPrefixOf".)

Example:

startswith "He" "Hello" -> True

mergeBy :: (a -> a -> Ordering) -> [a] -> [a] -> [a] #

Merge two sorted lists using into a single, sorted whole, +allowing the programmer to specify the comparison function.

QuickCheck test property:

prop_mergeBy xs ys = + mergeBy cmp (sortBy cmp xs) (sortBy cmp ys) == sortBy cmp (xs ++ ys) + where types = xs :: [ (Int, Int) ] + cmp (x1,_) (x2,_) = compare x1 x2

merge :: Ord a => [a] -> [a] -> [a] #

Merge two sorted lists into a single, sorted whole.

Example:

merge [1,3,5] [1,2,4,6] -> [1,1,2,3,4,5,6]

QuickCheck test property:

prop_merge xs ys = + merge (sort xs) (sort ys) == sort (xs ++ ys) + where types = xs :: [Int]

newtype WholeFunc a b #

The type used for functions for wholeMap. See wholeMap for details.

Constructors

WholeFunc ([a] -> (WholeFunc a b, [a], [b])) 

Data.Number.Transfinite

class PartialOrd a => Transfinite a where #

Many numbers are not Bounded yet, even though they can + represent arbitrarily large values, they are not necessarily + able to represent transfinite values such as infinity itself. + This class is for types which are capable of representing such + values. Notably, this class does not require the type to be + Fractional nor Floating since integral types could also have + representations for transfinite values. By popular demand the + Num restriction has been lifted as well, due to complications + of defining Show or Eq for some types.

In particular, this class extends the ordered projection to have + a maximum value infinity and a minimum value negativeInfinity, + as well as an exceptional value notANumber. All the natural + laws regarding infinity and negativeInfinity should pertain. + (Some of these are discussed below.)

Hugs (September 2006) has buggy Prelude definitions for + isNaN and isInfinite on Float and Double. + This module provides correct definitions, so long as Hugs.RealFloat + is compiled correctly.

Minimal complete definition

infinity, negativeInfinity, notANumber, isInfinite, isNaN

Methods

infinity :: a #

A transfinite value which is greater than all finite values. + Adding or subtracting any finite value is a no-op. As is + multiplying by any non-zero positive value (including + infinity), and dividing by any positive finite value. Also + obeys the law negate infinity = negativeInfinity with all + appropriate ramifications.

negativeInfinity :: a #

A transfinite value which is less than all finite values. + Obeys all the same laws as infinity with the appropriate + changes for the sign difference.

notANumber :: a #

An exceptional transfinite value for dealing with undefined + results when manipulating infinite values. The following + operations must return notANumber, where inf is any value + which isInfinite:

  • infinity + negativeInfinity
  • negativeInfinity + infinity
  • infinity - infinity
  • negativeInfinity - negativeInfinity
  • inf * 0
  • 0 * inf
  • inf / inf
  • inf `div` inf
  • 0 / 0
  • 0 `div` 0

Additionally, any mathematical operations on notANumber + must also return notANumber, and any equality or ordering + comparison on notANumber must return False (violating + the law of the excluded middle, often assumed but not required + for Eq; thus, eq and ne are preferred over (==) and + (/=)). Since it returns false for equality, there may be + more than one machine representation of this value.

Instances
Transfinite Double 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Double #

negativeInfinity :: Double #

notANumber :: Double #

isInfinite :: Double -> Bool #

isNaN :: Double -> Bool #

Transfinite Float 
Instance details

Defined in Data.Number.Transfinite

Methods

infinity :: Float #

negativeInfinity :: Float #

notANumber :: Float #

isInfinite :: Float -> Bool #

isNaN :: Float -> Bool #

Transfinite ConstVal # 
Instance details

Defined in Data.Expression.Const

Methods

infinity :: ConstVal #

negativeInfinity :: ConstVal #

notANumber :: ConstVal #

isInfinite :: ConstVal -> Bool #

isNaN :: ConstVal -> Bool #

(Ord t, ExprType t) => Transfinite (Expression t) # 
Instance details

Defined in Data.Expression

Methods

infinity :: Expression t #

negativeInfinity :: Expression t #

notANumber :: Expression t #

isInfinite :: Expression t -> Bool #

isNaN :: Expression t -> Bool #

GHC.Exts

class IsList l where #

The IsList class and its methods are intended to be used in + conjunction with the OverloadedLists extension.

Since: base-4.7.0.0

Minimal complete definition

fromList, toList

Associated Types

type Item l :: Type #

The Item type function returns the type of items of the structure l.

Methods

fromList :: [Item l] -> l #

The fromList function constructs the structure l from the given list of Item l

fromListN :: Int -> [Item l] -> l #

The fromListN function takes the input list's length as a hint. Its behaviour should be equivalent to fromList. The hint can be used to construct the structure l more efficiently compared to fromList. If the given hint does not equal to the input list's length the behaviour of fromListN is not specified.

toList :: l -> [Item l] #

The toList function extracts a list of Item l from the structure l. - It should satisfy fromList . toList = id.

Instances
IsList CallStack

Be aware that 'fromList . toList = id' only for unfrozen CallStacks, - since toList removes frozenness information.

Since: base-4.9.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item CallStack :: * #

Methods

fromList :: [Item CallStack] -> CallStack #

fromListN :: Int -> [Item CallStack] -> CallStack #

toList :: CallStack -> [Item CallStack] #

IsList Version

Since: base-4.8.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item Version :: * #

Methods

fromList :: [Item Version] -> Version #

fromListN :: Int -> [Item Version] -> Version #

toList :: Version -> [Item Version] #

IsList String 
Instance details

Defined in Basement.UTF8.Base

Associated Types

type Item String :: * #

Methods

fromList :: [Item String] -> String #

fromListN :: Int -> [Item String] -> String #

toList :: String -> [Item String] #

IsList IntSet

Since: containers-0.5.6.2

Instance details

Defined in Data.IntSet.Internal

Associated Types

type Item IntSet :: * #

Methods

fromList :: [Item IntSet] -> IntSet #

fromListN :: Int -> [Item IntSet] -> IntSet #

toList :: IntSet -> [Item IntSet] #

IsList ByteArray 
Instance details

Defined in Data.Primitive.ByteArray

Associated Types

type Item ByteArray :: * #

Methods

fromList :: [Item ByteArray] -> ByteArray #

fromListN :: Int -> [Item ByteArray] -> ByteArray #

toList :: ByteArray -> [Item ByteArray] #

IsList ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Item ConstVal :: * #

Methods

fromList :: [Item ConstVal] -> ConstVal #

fromListN :: Int -> [Item ConstVal] -> ConstVal #

toList :: ConstVal -> [Item ConstVal] #

IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: * #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: * #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: * #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: * #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

IsList [a]

Since: base-4.7.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item [a] :: * #

Methods

fromList :: [Item [a]] -> [a] #

fromListN :: Int -> [Item [a]] -> [a] #

toList :: [a] -> [Item [a]] #

IsList (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item (NonEmpty a) :: * #

Methods

fromList :: [Item (NonEmpty a)] -> NonEmpty a #

fromListN :: Int -> [Item (NonEmpty a)] -> NonEmpty a #

toList :: NonEmpty a -> [Item (NonEmpty a)] #

PrimType ty => IsList (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Associated Types

type Item (UArray ty) :: * #

Methods

fromList :: [Item (UArray ty)] -> UArray ty #

fromListN :: Int -> [Item (UArray ty)] -> UArray ty #

toList :: UArray ty -> [Item (UArray ty)] #

PrimType ty => IsList (Block ty) 
Instance details

Defined in Basement.Block.Base

Associated Types

type Item (Block ty) :: * #

Methods

fromList :: [Item (Block ty)] -> Block ty #

fromListN :: Int -> [Item (Block ty)] -> Block ty #

toList :: Block ty -> [Item (Block ty)] #

IsList c => IsList (NonEmpty c) 
Instance details

Defined in Basement.NonEmpty

Associated Types

type Item (NonEmpty c) :: * #

Methods

fromList :: [Item (NonEmpty c)] -> NonEmpty c #

fromListN :: Int -> [Item (NonEmpty c)] -> NonEmpty c #

toList :: NonEmpty c -> [Item (NonEmpty c)] #

IsList (IntMap a)

Since: containers-0.5.6.2

Instance details

Defined in Data.IntMap.Internal

Associated Types

type Item (IntMap a) :: * #

Methods

fromList :: [Item (IntMap a)] -> IntMap a #

fromListN :: Int -> [Item (IntMap a)] -> IntMap a #

toList :: IntMap a -> [Item (IntMap a)] #

IsList (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Item (Seq a) :: * #

Methods

fromList :: [Item (Seq a)] -> Seq a #

fromListN :: Int -> [Item (Seq a)] -> Seq a #

toList :: Seq a -> [Item (Seq a)] #

Ord a => IsList (Set a)

Since: containers-0.5.6.2

Instance details

Defined in Data.Set.Internal

Associated Types

type Item (Set a) :: * #

Methods

fromList :: [Item (Set a)] -> Set a #

fromListN :: Int -> [Item (Set a)] -> Set a #

toList :: Set a -> [Item (Set a)] #

IsList (DList a) 
Instance details

Defined in Data.DList

Associated Types

type Item (DList a) :: * #

Methods

fromList :: [Item (DList a)] -> DList a #

fromListN :: Int -> [Item (DList a)] -> DList a #

toList :: DList a -> [Item (DList a)] #

IsList (Array a) 
Instance details

Defined in Data.Primitive.Array

Associated Types

type Item (Array a) :: * #

Methods

fromList :: [Item (Array a)] -> Array a #

fromListN :: Int -> [Item (Array a)] -> Array a #

toList :: Array a -> [Item (Array a)] #

Storable a => IsList (Vector a) 
Instance details

Defined in Data.Vector.Storable

Associated Types

type Item (Vector a) :: * #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

IsList (Vector a) 
Instance details

Defined in Data.Vector

Associated Types

type Item (Vector a) :: * #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

Prim a => IsList (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Associated Types

type Item (Vector a) :: * #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

(Eq a, Hashable a) => IsList (HashSet a) 
Instance details

Defined in Data.HashSet

Associated Types

type Item (HashSet a) :: * #

Methods

fromList :: [Item (HashSet a)] -> HashSet a #

fromListN :: Int -> [Item (HashSet a)] -> HashSet a #

toList :: HashSet a -> [Item (HashSet a)] #

Ord k => IsList (Map k v)

Since: containers-0.5.6.2

Instance details

Defined in Data.Map.Internal

Associated Types

type Item (Map k v) :: * #

Methods

fromList :: [Item (Map k v)] -> Map k v #

fromListN :: Int -> [Item (Map k v)] -> Map k v #

toList :: Map k v -> [Item (Map k v)] #

(Eq k, Hashable k) => IsList (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Associated Types

type Item (HashMap k v) :: * #

Methods

fromList :: [Item (HashMap k v)] -> HashMap k v #

fromListN :: Int -> [Item (HashMap k v)] -> HashMap k v #

toList :: HashMap k v -> [Item (HashMap k v)] #

\ No newline at end of file + It should satisfy fromList . toList = id.

Instances
IsList CallStack

Be aware that 'fromList . toList = id' only for unfrozen CallStacks, + since toList removes frozenness information.

Since: base-4.9.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item CallStack :: Type #

Methods

fromList :: [Item CallStack] -> CallStack #

fromListN :: Int -> [Item CallStack] -> CallStack #

toList :: CallStack -> [Item CallStack] #

IsList Version

Since: base-4.8.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item Version :: Type #

Methods

fromList :: [Item Version] -> Version #

fromListN :: Int -> [Item Version] -> Version #

toList :: Version -> [Item Version] #

IsList String 
Instance details

Defined in Basement.UTF8.Base

Associated Types

type Item String :: Type #

Methods

fromList :: [Item String] -> String #

fromListN :: Int -> [Item String] -> String #

toList :: String -> [Item String] #

IsList IntSet

Since: containers-0.5.6.2

Instance details

Defined in Data.IntSet.Internal

Associated Types

type Item IntSet :: Type #

Methods

fromList :: [Item IntSet] -> IntSet #

fromListN :: Int -> [Item IntSet] -> IntSet #

toList :: IntSet -> [Item IntSet] #

IsList ByteArray

Since: primitive-0.6.3.0

Instance details

Defined in Data.Primitive.ByteArray

Associated Types

type Item ByteArray :: Type #

Methods

fromList :: [Item ByteArray] -> ByteArray #

fromListN :: Int -> [Item ByteArray] -> ByteArray #

toList :: ByteArray -> [Item ByteArray] #

IsList ShortText

Note: Surrogate pairs ([U+D800 .. U+DFFF]) character literals are replaced by U+FFFD.

Since: text-short-0.1.2

Instance details

Defined in Data.Text.Short.Internal

Associated Types

type Item ShortText :: Type #

Methods

fromList :: [Item ShortText] -> ShortText #

fromListN :: Int -> [Item ShortText] -> ShortText #

toList :: ShortText -> [Item ShortText] #

IsList ConstVal # 
Instance details

Defined in Data.Expression.Const

Associated Types

type Item ConstVal :: Type #

Methods

fromList :: [Item ConstVal] -> ConstVal #

fromListN :: Int -> [Item ConstVal] -> ConstVal #

toList :: ConstVal -> [Item ConstVal] #

IsList RMat # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RMat :: Type #

Methods

fromList :: [Item RMat] -> RMat #

fromListN :: Int -> [Item RMat] -> RMat #

toList :: RMat -> [Item RMat] #

IsList ZVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item ZVec :: Type #

Methods

fromList :: [Item ZVec] -> ZVec #

fromListN :: Int -> [Item ZVec] -> ZVec #

toList :: ZVec -> [Item ZVec] #

IsList RVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item RVec :: Type #

Methods

fromList :: [Item RVec] -> RVec #

fromListN :: Int -> [Item RVec] -> RVec #

toList :: RVec -> [Item RVec] #

IsList BVec # 
Instance details

Defined in Data.Expression.Eval

Associated Types

type Item BVec :: Type #

Methods

fromList :: [Item BVec] -> BVec #

fromListN :: Int -> [Item BVec] -> BVec #

toList :: BVec -> [Item BVec] #

IsList [a]

Since: base-4.7.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item [a] :: Type #

Methods

fromList :: [Item [a]] -> [a] #

fromListN :: Int -> [Item [a]] -> [a] #

toList :: [a] -> [Item [a]] #

Storable a => IsList (Vector a) 
Instance details

Defined in Data.Vector.Storable

Associated Types

type Item (Vector a) :: Type #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

IsList (NonEmpty a)

Since: base-4.9.0.0

Instance details

Defined in GHC.Exts

Associated Types

type Item (NonEmpty a) :: Type #

Methods

fromList :: [Item (NonEmpty a)] -> NonEmpty a #

fromListN :: Int -> [Item (NonEmpty a)] -> NonEmpty a #

toList :: NonEmpty a -> [Item (NonEmpty a)] #

PrimType ty => IsList (UArray ty) 
Instance details

Defined in Basement.UArray.Base

Associated Types

type Item (UArray ty) :: Type #

Methods

fromList :: [Item (UArray ty)] -> UArray ty #

fromListN :: Int -> [Item (UArray ty)] -> UArray ty #

toList :: UArray ty -> [Item (UArray ty)] #

PrimType ty => IsList (Block ty) 
Instance details

Defined in Basement.Block.Base

Associated Types

type Item (Block ty) :: Type #

Methods

fromList :: [Item (Block ty)] -> Block ty #

fromListN :: Int -> [Item (Block ty)] -> Block ty #

toList :: Block ty -> [Item (Block ty)] #

IsList c => IsList (NonEmpty c) 
Instance details

Defined in Basement.NonEmpty

Associated Types

type Item (NonEmpty c) :: Type #

Methods

fromList :: [Item (NonEmpty c)] -> NonEmpty c #

fromListN :: Int -> [Item (NonEmpty c)] -> NonEmpty c #

toList :: NonEmpty c -> [Item (NonEmpty c)] #

IsList (IntMap a)

Since: containers-0.5.6.2

Instance details

Defined in Data.IntMap.Internal

Associated Types

type Item (IntMap a) :: Type #

Methods

fromList :: [Item (IntMap a)] -> IntMap a #

fromListN :: Int -> [Item (IntMap a)] -> IntMap a #

toList :: IntMap a -> [Item (IntMap a)] #

IsList (Seq a) 
Instance details

Defined in Data.Sequence.Internal

Associated Types

type Item (Seq a) :: Type #

Methods

fromList :: [Item (Seq a)] -> Seq a #

fromListN :: Int -> [Item (Seq a)] -> Seq a #

toList :: Seq a -> [Item (Seq a)] #

Ord a => IsList (Set a)

Since: containers-0.5.6.2

Instance details

Defined in Data.Set.Internal

Associated Types

type Item (Set a) :: Type #

Methods

fromList :: [Item (Set a)] -> Set a #

fromListN :: Int -> [Item (Set a)] -> Set a #

toList :: Set a -> [Item (Set a)] #

IsList (DList a) 
Instance details

Defined in Data.DList

Associated Types

type Item (DList a) :: Type #

Methods

fromList :: [Item (DList a)] -> DList a #

fromListN :: Int -> [Item (DList a)] -> DList a #

toList :: DList a -> [Item (DList a)] #

PrimUnlifted a => IsList (UnliftedArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.UnliftedArray

Associated Types

type Item (UnliftedArray a) :: Type #

Methods

fromList :: [Item (UnliftedArray a)] -> UnliftedArray a #

fromListN :: Int -> [Item (UnliftedArray a)] -> UnliftedArray a #

toList :: UnliftedArray a -> [Item (UnliftedArray a)] #

Prim a => IsList (PrimArray a)

Since: primitive-0.6.4.0

Instance details

Defined in Data.Primitive.PrimArray

Associated Types

type Item (PrimArray a) :: Type #

Methods

fromList :: [Item (PrimArray a)] -> PrimArray a #

fromListN :: Int -> [Item (PrimArray a)] -> PrimArray a #

toList :: PrimArray a -> [Item (PrimArray a)] #

IsList (SmallArray a) 
Instance details

Defined in Data.Primitive.SmallArray

Associated Types

type Item (SmallArray a) :: Type #

Methods

fromList :: [Item (SmallArray a)] -> SmallArray a #

fromListN :: Int -> [Item (SmallArray a)] -> SmallArray a #

toList :: SmallArray a -> [Item (SmallArray a)] #

IsList (Array a) 
Instance details

Defined in Data.Primitive.Array

Associated Types

type Item (Array a) :: Type #

Methods

fromList :: [Item (Array a)] -> Array a #

fromListN :: Int -> [Item (Array a)] -> Array a #

toList :: Array a -> [Item (Array a)] #

(Eq a, Hashable a) => IsList (HashSet a) 
Instance details

Defined in Data.HashSet.Base

Associated Types

type Item (HashSet a) :: Type #

Methods

fromList :: [Item (HashSet a)] -> HashSet a #

fromListN :: Int -> [Item (HashSet a)] -> HashSet a #

toList :: HashSet a -> [Item (HashSet a)] #

Prim a => IsList (Vector a) 
Instance details

Defined in Data.Vector.Primitive

Associated Types

type Item (Vector a) :: Type #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

IsList (Vector a) 
Instance details

Defined in Data.Vector

Associated Types

type Item (Vector a) :: Type #

Methods

fromList :: [Item (Vector a)] -> Vector a #

fromListN :: Int -> [Item (Vector a)] -> Vector a #

toList :: Vector a -> [Item (Vector a)] #

(Eq k, Hashable k) => IsList (HashMap k v) 
Instance details

Defined in Data.HashMap.Base

Associated Types

type Item (HashMap k v) :: Type #

Methods

fromList :: [Item (HashMap k v)] -> HashMap k v #

fromListN :: Int -> [Item (HashMap k v)] -> HashMap k v #

toList :: HashMap k v -> [Item (HashMap k v)] #

Ord k => IsList (Map k v)

Since: containers-0.5.6.2

Instance details

Defined in Data.Map.Internal

Associated Types

type Item (Map k v) :: Type #

Methods

fromList :: [Item (Map k v)] -> Map k v #

fromListN :: Int -> [Item (Map k v)] -> Map k v #

toList :: Map k v -> [Item (Map k v)] #

\ No newline at end of file diff --git a/docs/doc/doc-index-124.html b/docs/doc/doc-index-124.html index 1003a70..3d72e35 100644 --- a/docs/doc/doc-index-124.html +++ b/docs/doc/doc-index-124.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - |)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - |)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-33.html b/docs/doc/doc-index-33.html index 446ebb2..9882efb 100644 --- a/docs/doc/doc-index-33.html +++ b/docs/doc/doc-index-33.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - !)

stochaskell-0.1.0: A probabilistic programming language

Index - !

!Language.Stochaskell
!!Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - !)

stochaskell-1.0.0: A probabilistic programming language

Index - !

!Language.Stochaskell
!!Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-35.html b/docs/doc/doc-index-35.html index 81dbf67..b98ab47 100644 --- a/docs/doc/doc-index-35.html +++ b/docs/doc/doc-index-35.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - #)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - #)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-36.html b/docs/doc/doc-index-36.html index 8075d57..4b6389c 100644 --- a/docs/doc/doc-index-36.html +++ b/docs/doc/doc-index-36.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - $)

stochaskell-0.1.0: A probabilistic programming language

Index - $

$Language.Stochaskell.Prelude, Language.Stochaskell
$!Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - $)

stochaskell-1.0.0: A probabilistic programming language

Index - $

$Language.Stochaskell.Prelude, Language.Stochaskell
$!Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-37.html b/docs/doc/doc-index-37.html index 1d6a5e5..34597ae 100644 --- a/docs/doc/doc-index-37.html +++ b/docs/doc/doc-index-37.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - %)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - %)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-38.html b/docs/doc/doc-index-38.html index 1cd2df1..ab86960 100644 --- a/docs/doc/doc-index-38.html +++ b/docs/doc/doc-index-38.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - &)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - &)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-42.html b/docs/doc/doc-index-42.html index 66f1a8d..8e2e6a2 100644 --- a/docs/doc/doc-index-42.html +++ b/docs/doc/doc-index-42.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - *)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - *)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-43.html b/docs/doc/doc-index-43.html index faa9a6e..7887675 100644 --- a/docs/doc/doc-index-43.html +++ b/docs/doc/doc-index-43.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - +)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - +)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-45.html b/docs/doc/doc-index-45.html index 161023c..caf6a8b 100644 --- a/docs/doc/doc-index-45.html +++ b/docs/doc/doc-index-45.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - -)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - -)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-46.html b/docs/doc/doc-index-46.html index 8c668e2..bce6d8f 100644 --- a/docs/doc/doc-index-46.html +++ b/docs/doc/doc-index-46.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - .)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - .)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-47.html b/docs/doc/doc-index-47.html index 4eff102..b4c9fa4 100644 --- a/docs/doc/doc-index-47.html +++ b/docs/doc/doc-index-47.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - /)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - /)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-58.html b/docs/doc/doc-index-58.html index eacb121..f184191 100644 --- a/docs/doc/doc-index-58.html +++ b/docs/doc/doc-index-58.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - :)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - :)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-60.html b/docs/doc/doc-index-60.html index 5c234dd..aab2c38 100644 --- a/docs/doc/doc-index-60.html +++ b/docs/doc/doc-index-60.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - <)

stochaskell-0.1.0: A probabilistic programming language

Index - <

<Language.Stochaskell.Prelude, Language.Stochaskell
<#Language.Stochaskell
<#%=Language.Stochaskell.Plot
<#%~Language.Stochaskell.Plot
<#=Language.Stochaskell.Plot
<#~Language.Stochaskell.Plot
<$Language.Stochaskell.Prelude, Language.Stochaskell
<$!>Language.Stochaskell.Prelude, Language.Stochaskell
<$>Language.Stochaskell.Prelude, Language.Stochaskell
<%=Language.Stochaskell.Plot
<%@=Language.Stochaskell.Plot
<%@~Language.Stochaskell.Plot
<%~Language.Stochaskell.Plot
<&&=Language.Stochaskell.Plot
<&&~Language.Stochaskell.Plot
<&>Language.Stochaskell.Plot
<*Language.Stochaskell.Prelude, Language.Stochaskell
<**=Language.Stochaskell.Plot
<**~Language.Stochaskell.Plot
<*=Language.Stochaskell.Plot
<*>Language.Stochaskell.Prelude, Language.Stochaskell
<*~Language.Stochaskell.Plot
<+=Language.Stochaskell.Plot
<+~Language.Stochaskell.Plot
<-=Language.Stochaskell.Plot
<-~Language.Stochaskell.Plot
<.Language.Stochaskell.Plot
<.=Language.Stochaskell.Plot
<.> 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell
<.~Language.Stochaskell.Plot
<//=Language.Stochaskell.Plot
<//~Language.Stochaskell.Plot
<<%=Language.Stochaskell.Plot
<<%@=Language.Stochaskell.Plot
<<%@~Language.Stochaskell.Plot
<<%~Language.Stochaskell.Plot
<<&&=Language.Stochaskell.Plot
<<&&~Language.Stochaskell.Plot
<<**=Language.Stochaskell.Plot
<<**~Language.Stochaskell.Plot
<<*=Language.Stochaskell.Plot
<<*~Language.Stochaskell.Plot
<<+=Language.Stochaskell.Plot
<<+~Language.Stochaskell.Plot
<<-=Language.Stochaskell.Plot
<<-~Language.Stochaskell.Plot
<<.=Language.Stochaskell.Plot
<<.~Language.Stochaskell.Plot
<<//=Language.Stochaskell.Plot
<<//~Language.Stochaskell.Plot
<<<>=Language.Stochaskell.Plot
<<<>~Language.Stochaskell.Plot
<<>=Language.Stochaskell.Plot
<<>~Language.Stochaskell.Plot
<<?=Language.Stochaskell.Plot
<<?~Language.Stochaskell.Plot
<<^=Language.Stochaskell.Plot
<<^^=Language.Stochaskell.Plot
<<^^~Language.Stochaskell.Plot
<<^~Language.Stochaskell.Plot
<<||=Language.Stochaskell.Plot
<<||~Language.Stochaskell.Plot
<<~Language.Stochaskell.Plot
<=Language.Stochaskell.Prelude, Language.Stochaskell
<=*Language.Stochaskell.Prelude, Language.Stochaskell
<=<Language.Stochaskell.Prelude, Language.Stochaskell
<>Language.Stochaskell.Prelude, Language.Stochaskell
<>=Language.Stochaskell.Plot
<>~Language.Stochaskell.Plot
<?=Language.Stochaskell.Plot
<?~Language.Stochaskell.Plot
<\>Language.Stochaskell
<^=Language.Stochaskell.Plot
<^^=Language.Stochaskell.Plot
<^^~Language.Stochaskell.Plot
<^~Language.Stochaskell.Plot
<|Language.Stochaskell.Plot
<||=Language.Stochaskell.Plot
<||~Language.Stochaskell.Plot
<~Language.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - <)

stochaskell-1.0.0: A probabilistic programming language

Index - <

<Language.Stochaskell.Prelude, Language.Stochaskell
<#Language.Stochaskell
<#%=Language.Stochaskell.Plot
<#%~Language.Stochaskell.Plot
<#=Language.Stochaskell.Plot
<#~Language.Stochaskell.Plot
<$Language.Stochaskell.Prelude, Language.Stochaskell
<$!>Language.Stochaskell.Prelude, Language.Stochaskell
<$>Language.Stochaskell.Prelude, Language.Stochaskell
<%=Language.Stochaskell.Plot
<%@=Language.Stochaskell.Plot
<%@~Language.Stochaskell.Plot
<%~Language.Stochaskell.Plot
<&&=Language.Stochaskell.Plot
<&&~Language.Stochaskell.Plot
<&>Language.Stochaskell.Plot
<*Language.Stochaskell.Prelude, Language.Stochaskell
<**=Language.Stochaskell.Plot
<**~Language.Stochaskell.Plot
<*=Language.Stochaskell.Plot
<*>Language.Stochaskell.Prelude, Language.Stochaskell
<*~Language.Stochaskell.Plot
<+=Language.Stochaskell.Plot
<+~Language.Stochaskell.Plot
<-=Language.Stochaskell.Plot
<-~Language.Stochaskell.Plot
<.Language.Stochaskell.Plot
<.=Language.Stochaskell.Plot
<.> 
1 (Function)Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
<.~Language.Stochaskell.Plot
<//=Language.Stochaskell.Plot
<//~Language.Stochaskell.Plot
<<%=Language.Stochaskell.Plot
<<%@=Language.Stochaskell.Plot
<<%@~Language.Stochaskell.Plot
<<%~Language.Stochaskell.Plot
<<&&=Language.Stochaskell.Plot
<<&&~Language.Stochaskell.Plot
<<**=Language.Stochaskell.Plot
<<**~Language.Stochaskell.Plot
<<*=Language.Stochaskell.Plot
<<*~Language.Stochaskell.Plot
<<+=Language.Stochaskell.Plot
<<+~Language.Stochaskell.Plot
<<-=Language.Stochaskell.Plot
<<-~Language.Stochaskell.Plot
<<.=Language.Stochaskell.Plot
<<.~Language.Stochaskell.Plot
<<//=Language.Stochaskell.Plot
<<//~Language.Stochaskell.Plot
<<<>=Language.Stochaskell.Plot
<<<>~Language.Stochaskell.Plot
<<>=Language.Stochaskell.Plot
<<>~Language.Stochaskell.Plot
<<?=Language.Stochaskell.Plot
<<?~Language.Stochaskell.Plot
<<^=Language.Stochaskell.Plot
<<^^=Language.Stochaskell.Plot
<<^^~Language.Stochaskell.Plot
<<^~Language.Stochaskell.Plot
<<||=Language.Stochaskell.Plot
<<||~Language.Stochaskell.Plot
<<~Language.Stochaskell.Plot
<=Language.Stochaskell.Prelude, Language.Stochaskell
<=*Language.Stochaskell.Prelude, Language.Stochaskell
<=<Language.Stochaskell.Prelude, Language.Stochaskell
<>Language.Stochaskell.Prelude, Language.Stochaskell
<>=Language.Stochaskell.Plot
<>~Language.Stochaskell.Plot
<?=Language.Stochaskell.Plot
<?~Language.Stochaskell.Plot
<^=Language.Stochaskell.Plot
<^^=Language.Stochaskell.Plot
<^^~Language.Stochaskell.Plot
<^~Language.Stochaskell.Plot
<|Language.Stochaskell.Plot
<||=Language.Stochaskell.Plot
<||~Language.Stochaskell.Plot
<~Language.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-61.html b/docs/doc/doc-index-61.html index 6783e68..e9975d1 100644 --- a/docs/doc/doc-index-61.html +++ b/docs/doc/doc-index-61.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - =)

stochaskell-0.1.0: A probabilistic programming language

Index - =

=<<Language.Stochaskell.Prelude, Language.Stochaskell
==Language.Stochaskell.Prelude, Language.Stochaskell
==*Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - =)

stochaskell-1.0.0: A probabilistic programming language

Index - =

=<<Language.Stochaskell.Prelude, Language.Stochaskell
==Language.Stochaskell.Prelude, Language.Stochaskell
==*Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-62.html b/docs/doc/doc-index-62.html index d460cbc..731ba43 100644 --- a/docs/doc/doc-index-62.html +++ b/docs/doc/doc-index-62.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - >)

stochaskell-0.1.0: A probabilistic programming language

Index - >

>Language.Stochaskell.Prelude, Language.Stochaskell
>$Language.Stochaskell.Plot
>*Language.Stochaskell.Prelude, Language.Stochaskell
>=Language.Stochaskell.Prelude, Language.Stochaskell
>=*Language.Stochaskell.Prelude, Language.Stochaskell
>=>Language.Stochaskell.Prelude, Language.Stochaskell
>>Language.Stochaskell.Prelude, Language.Stochaskell
>>=Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - >)

stochaskell-1.0.0: A probabilistic programming language

Index - >

>Language.Stochaskell.Prelude, Language.Stochaskell
>$Language.Stochaskell.Plot
>*Language.Stochaskell.Prelude, Language.Stochaskell
>=Language.Stochaskell.Prelude, Language.Stochaskell
>=*Language.Stochaskell.Prelude, Language.Stochaskell
>=>Language.Stochaskell.Prelude, Language.Stochaskell
>>Language.Stochaskell.Prelude, Language.Stochaskell
>>=Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-63.html b/docs/doc/doc-index-63.html index 50e5313..50f6afc 100644 --- a/docs/doc/doc-index-63.html +++ b/docs/doc/doc-index-63.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - ?)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - ?)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-92.html b/docs/doc/doc-index-92.html index 0d82072..0821636 100644 --- a/docs/doc/doc-index-92.html +++ b/docs/doc/doc-index-92.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - \)

stochaskell-0.1.0: A probabilistic programming language

Index - \

\\Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - \)

stochaskell-1.0.0: A probabilistic programming language

Index - \

\\Language.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-94.html b/docs/doc/doc-index-94.html index 5d631ff..2591379 100644 --- a/docs/doc/doc-index-94.html +++ b/docs/doc/doc-index-94.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - ^)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - ^)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-95.html b/docs/doc/doc-index-95.html index a624f67..6107ef1 100644 --- a/docs/doc/doc-index-95.html +++ b/docs/doc/doc-index-95.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - _)

stochaskell-0.1.0: A probabilistic programming language

Index - _

_1Language.Stochaskell.Plot
_1'Language.Stochaskell.Plot
_10Language.Stochaskell.Plot
_10'Language.Stochaskell.Plot
_11Language.Stochaskell.Plot
_11'Language.Stochaskell.Plot
_12Language.Stochaskell.Plot
_12'Language.Stochaskell.Plot
_13Language.Stochaskell.Plot
_13'Language.Stochaskell.Plot
_14Language.Stochaskell.Plot
_14'Language.Stochaskell.Plot
_15Language.Stochaskell.Plot
_15'Language.Stochaskell.Plot
_16Language.Stochaskell.Plot
_16'Language.Stochaskell.Plot
_17Language.Stochaskell.Plot
_17'Language.Stochaskell.Plot
_18Language.Stochaskell.Plot
_18'Language.Stochaskell.Plot
_19Language.Stochaskell.Plot
_19'Language.Stochaskell.Plot
_2Language.Stochaskell.Plot
_2'Language.Stochaskell.Plot
_3Language.Stochaskell.Plot
_3'Language.Stochaskell.Plot
_4Language.Stochaskell.Plot
_4'Language.Stochaskell.Plot
_5Language.Stochaskell.Plot
_5'Language.Stochaskell.Plot
_6Language.Stochaskell.Plot
_6'Language.Stochaskell.Plot
_7Language.Stochaskell.Plot
_7'Language.Stochaskell.Plot
_8Language.Stochaskell.Plot
_8'Language.Stochaskell.Plot
_9Language.Stochaskell.Plot
_9'Language.Stochaskell.Plot
_area_spots_4d_linethickLanguage.Stochaskell.Plot
_area_spots_4d_max_radiusLanguage.Stochaskell.Plot
_area_spots_4d_opacityLanguage.Stochaskell.Plot
_area_spots_4d_paletteLanguage.Stochaskell.Plot
_area_spots_4d_titleLanguage.Stochaskell.Plot
_area_spots_4d_valuesLanguage.Stochaskell.Plot
_area_spots_fillcolourLanguage.Stochaskell.Plot
_area_spots_linecolourLanguage.Stochaskell.Plot
_area_spots_linethickLanguage.Stochaskell.Plot
_area_spots_max_radiusLanguage.Stochaskell.Plot
_area_spots_opacityLanguage.Stochaskell.Plot
_area_spots_titleLanguage.Stochaskell.Plot
_area_spots_valuesLanguage.Stochaskell.Plot
_axis_gridLanguage.Stochaskell.Plot
_axis_grid_styleLanguage.Stochaskell.Plot
_axis_labelsLanguage.Stochaskell.Plot
_axis_label_gapLanguage.Stochaskell.Plot
_axis_label_styleLanguage.Stochaskell.Plot
_axis_line_styleLanguage.Stochaskell.Plot
_axis_show_labelsLanguage.Stochaskell.Plot
_axis_show_lineLanguage.Stochaskell.Plot
_axis_show_ticksLanguage.Stochaskell.Plot
_axis_ticksLanguage.Stochaskell.Plot
_axis_tropweivLanguage.Stochaskell.Plot
_axis_viewportLanguage.Stochaskell.Plot
_axis_visibilityLanguage.Stochaskell.Plot
_azimuthLanguage.Stochaskell.Plot
_ConsLanguage.Stochaskell.Plot
_DynamicPlotLanguage.Stochaskell.Plot
_EmptyLanguage.Stochaskell.Plot
_fill_colorLanguage.Stochaskell.Plot
_font_colorLanguage.Stochaskell.Plot
_font_nameLanguage.Stochaskell.Plot
_font_sizeLanguage.Stochaskell.Plot
_font_slantLanguage.Stochaskell.Plot
_font_weightLanguage.Stochaskell.Plot
_GWrapped'Language.Stochaskell.Plot
_headLanguage.Stochaskell.Plot
_initLanguage.Stochaskell.Plot
_JustLanguage.Stochaskell.Plot
_lastLanguage.Stochaskell.Plot
_laxis_generateLanguage.Stochaskell.Plot
_laxis_overrideLanguage.Stochaskell.Plot
_laxis_reverseLanguage.Stochaskell.Plot
_laxis_styleLanguage.Stochaskell.Plot
_laxis_titleLanguage.Stochaskell.Plot
_laxis_title_styleLanguage.Stochaskell.Plot
_layoutlr_backgroundLanguage.Stochaskell.Plot
_layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_grid_lastLanguage.Stochaskell.Plot
_layoutlr_left_axisLanguage.Stochaskell.Plot
_layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_legendLanguage.Stochaskell.Plot
_layoutlr_marginLanguage.Stochaskell.Plot
_layoutlr_plotsLanguage.Stochaskell.Plot
_layoutlr_plot_backgroundLanguage.Stochaskell.Plot
_layoutlr_right_axisLanguage.Stochaskell.Plot
_layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_titleLanguage.Stochaskell.Plot
_layoutlr_title_styleLanguage.Stochaskell.Plot
_layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_x_axisLanguage.Stochaskell.Plot
_layout_backgroundLanguage.Stochaskell.Plot
_layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layout_grid_lastLanguage.Stochaskell.Plot
_layout_left_axis_visibilityLanguage.Stochaskell.Plot
_layout_legendLanguage.Stochaskell.Plot
_layout_marginLanguage.Stochaskell.Plot
_layout_plotsLanguage.Stochaskell.Plot
_layout_plot_backgroundLanguage.Stochaskell.Plot
_layout_right_axis_visibilityLanguage.Stochaskell.Plot
_layout_titleLanguage.Stochaskell.Plot
_layout_title_styleLanguage.Stochaskell.Plot
_layout_top_axis_visibilityLanguage.Stochaskell.Plot
_layout_x_axisLanguage.Stochaskell.Plot
_layout_y_axisLanguage.Stochaskell.Plot
_la_labelfLanguage.Stochaskell.Plot
_la_nLabelsLanguage.Stochaskell.Plot
_la_nTicksLanguage.Stochaskell.Plot
_LeftLanguage.Stochaskell.Plot
_legend_label_styleLanguage.Stochaskell.Plot
_legend_marginLanguage.Stochaskell.Plot
_legend_orientationLanguage.Stochaskell.Plot
_legend_plot_sizeLanguage.Stochaskell.Plot
_legend_positionLanguage.Stochaskell.Plot
_line_capLanguage.Stochaskell.Plot
_line_colorLanguage.Stochaskell.Plot
_line_dashesLanguage.Stochaskell.Plot
_line_joinLanguage.Stochaskell.Plot
_line_widthLanguage.Stochaskell.Plot
_loga_labelfLanguage.Stochaskell.Plot
_NothingLanguage.Stochaskell.Plot
_pie_backgroundLanguage.Stochaskell.Plot
_pie_colorsLanguage.Stochaskell.Plot
_pie_dataLanguage.Stochaskell.Plot
_pie_label_line_styleLanguage.Stochaskell.Plot
_pie_label_styleLanguage.Stochaskell.Plot
_pie_marginLanguage.Stochaskell.Plot
_pie_plotLanguage.Stochaskell.Plot
_pie_start_angleLanguage.Stochaskell.Plot
_pie_titleLanguage.Stochaskell.Plot
_pie_title_styleLanguage.Stochaskell.Plot
_pitem_labelLanguage.Stochaskell.Plot
_pitem_offsetLanguage.Stochaskell.Plot
_pitem_valueLanguage.Stochaskell.Plot
_plot_all_pointsLanguage.Stochaskell.Plot
_plot_annotation_angleLanguage.Stochaskell.Plot
_plot_annotation_backgroundLanguage.Stochaskell.Plot
_plot_annotation_hanchorLanguage.Stochaskell.Plot
_plot_annotation_styleLanguage.Stochaskell.Plot
_plot_annotation_valuesLanguage.Stochaskell.Plot
_plot_annotation_vanchorLanguage.Stochaskell.Plot
_plot_bars_alignmentLanguage.Stochaskell.Plot
_plot_bars_item_stylesLanguage.Stochaskell.Plot
_plot_bars_referenceLanguage.Stochaskell.Plot
_plot_bars_singleton_widthLanguage.Stochaskell.Plot
_plot_bars_spacingLanguage.Stochaskell.Plot
_plot_bars_styleLanguage.Stochaskell.Plot
_plot_bars_titlesLanguage.Stochaskell.Plot
_plot_bars_valuesLanguage.Stochaskell.Plot
_plot_candle_centreLanguage.Stochaskell.Plot
_plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
_plot_candle_fillLanguage.Stochaskell.Plot
_plot_candle_line_styleLanguage.Stochaskell.Plot
_plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
_plot_candle_tick_lengthLanguage.Stochaskell.Plot
_plot_candle_titleLanguage.Stochaskell.Plot
_plot_candle_valuesLanguage.Stochaskell.Plot
_plot_candle_widthLanguage.Stochaskell.Plot
_plot_errbars_line_styleLanguage.Stochaskell.Plot
_plot_errbars_overhangLanguage.Stochaskell.Plot
_plot_errbars_tick_lengthLanguage.Stochaskell.Plot
_plot_errbars_titleLanguage.Stochaskell.Plot
_plot_errbars_valuesLanguage.Stochaskell.Plot
_plot_fillbetween_styleLanguage.Stochaskell.Plot
_plot_fillbetween_titleLanguage.Stochaskell.Plot
_plot_fillbetween_valuesLanguage.Stochaskell.Plot
_plot_hidden_x_valuesLanguage.Stochaskell.Plot
_plot_hidden_y_valuesLanguage.Stochaskell.Plot
_plot_hist_binsLanguage.Stochaskell.Plot
_plot_hist_drop_linesLanguage.Stochaskell.Plot
_plot_hist_fill_styleLanguage.Stochaskell.Plot
_plot_hist_line_styleLanguage.Stochaskell.Plot
_plot_hist_norm_funcLanguage.Stochaskell.Plot
_plot_hist_no_zerosLanguage.Stochaskell.Plot
_plot_hist_rangeLanguage.Stochaskell.Plot
_plot_hist_titleLanguage.Stochaskell.Plot
_plot_hist_valuesLanguage.Stochaskell.Plot
_plot_legendLanguage.Stochaskell.Plot
_plot_lines_limit_valuesLanguage.Stochaskell.Plot
_plot_lines_styleLanguage.Stochaskell.Plot
_plot_lines_titleLanguage.Stochaskell.Plot
_plot_lines_valuesLanguage.Stochaskell.Plot
_plot_points_styleLanguage.Stochaskell.Plot
_plot_points_titleLanguage.Stochaskell.Plot
_plot_points_valuesLanguage.Stochaskell.Plot
_plot_renderLanguage.Stochaskell.Plot
_plot_vectors_gridLanguage.Stochaskell.Plot
_plot_vectors_mapfLanguage.Stochaskell.Plot
_plot_vectors_scaleLanguage.Stochaskell.Plot
_plot_vectors_styleLanguage.Stochaskell.Plot
_plot_vectors_titleLanguage.Stochaskell.Plot
_plot_vectors_valuesLanguage.Stochaskell.Plot
_point_border_colorLanguage.Stochaskell.Plot
_point_border_widthLanguage.Stochaskell.Plot
_point_colorLanguage.Stochaskell.Plot
_point_radiusLanguage.Stochaskell.Plot
_point_shapeLanguage.Stochaskell.Plot
_polarLanguage.Stochaskell.Plot
_rLanguage.Stochaskell.Plot
_radialLanguage.Stochaskell.Plot
_rect_cornerStyleLanguage.Stochaskell.Plot
_rect_fillStyleLanguage.Stochaskell.Plot
_rect_lineStyleLanguage.Stochaskell.Plot
_rect_minsizeLanguage.Stochaskell.Plot
_RightLanguage.Stochaskell.Plot
_ShowLanguage.Stochaskell.Plot
_slayouts_compress_legendLanguage.Stochaskell.Plot
_slayouts_layoutsLanguage.Stochaskell.Plot
_SnocLanguage.Stochaskell.Plot
_specBoundsLanguage.Stochaskell.Plot
_specColourMapLanguage.Stochaskell.Plot
_specScaleLanguage.Stochaskell.Plot
_specTransLanguage.Stochaskell.Plot
_tailLanguage.Stochaskell.Plot
_UnwrappedLanguage.Stochaskell.Plot
_Unwrapped'Language.Stochaskell.Plot
_UnwrappingLanguage.Stochaskell.Plot
_Unwrapping'Language.Stochaskell.Plot
_vector_head_styleLanguage.Stochaskell.Plot
_vector_line_styleLanguage.Stochaskell.Plot
_VoidLanguage.Stochaskell.Plot
_WrappedLanguage.Stochaskell.Plot
_Wrapped'Language.Stochaskell.Plot
_WrappingLanguage.Stochaskell.Plot
_Wrapping'Language.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - _)

stochaskell-1.0.0: A probabilistic programming language

Index - _

_1Language.Stochaskell.Plot
_1'Language.Stochaskell.Plot
_10Language.Stochaskell.Plot
_10'Language.Stochaskell.Plot
_11Language.Stochaskell.Plot
_11'Language.Stochaskell.Plot
_12Language.Stochaskell.Plot
_12'Language.Stochaskell.Plot
_13Language.Stochaskell.Plot
_13'Language.Stochaskell.Plot
_14Language.Stochaskell.Plot
_14'Language.Stochaskell.Plot
_15Language.Stochaskell.Plot
_15'Language.Stochaskell.Plot
_16Language.Stochaskell.Plot
_16'Language.Stochaskell.Plot
_17Language.Stochaskell.Plot
_17'Language.Stochaskell.Plot
_18Language.Stochaskell.Plot
_18'Language.Stochaskell.Plot
_19Language.Stochaskell.Plot
_19'Language.Stochaskell.Plot
_2Language.Stochaskell.Plot
_2'Language.Stochaskell.Plot
_3Language.Stochaskell.Plot
_3'Language.Stochaskell.Plot
_4Language.Stochaskell.Plot
_4'Language.Stochaskell.Plot
_5Language.Stochaskell.Plot
_5'Language.Stochaskell.Plot
_6Language.Stochaskell.Plot
_6'Language.Stochaskell.Plot
_7Language.Stochaskell.Plot
_7'Language.Stochaskell.Plot
_8Language.Stochaskell.Plot
_8'Language.Stochaskell.Plot
_9Language.Stochaskell.Plot
_9'Language.Stochaskell.Plot
_area_spots_4d_linethickLanguage.Stochaskell.Plot
_area_spots_4d_max_radiusLanguage.Stochaskell.Plot
_area_spots_4d_opacityLanguage.Stochaskell.Plot
_area_spots_4d_paletteLanguage.Stochaskell.Plot
_area_spots_4d_titleLanguage.Stochaskell.Plot
_area_spots_4d_valuesLanguage.Stochaskell.Plot
_area_spots_fillcolourLanguage.Stochaskell.Plot
_area_spots_linecolourLanguage.Stochaskell.Plot
_area_spots_linethickLanguage.Stochaskell.Plot
_area_spots_max_radiusLanguage.Stochaskell.Plot
_area_spots_opacityLanguage.Stochaskell.Plot
_area_spots_titleLanguage.Stochaskell.Plot
_area_spots_valuesLanguage.Stochaskell.Plot
_axis_gridLanguage.Stochaskell.Plot
_axis_grid_styleLanguage.Stochaskell.Plot
_axis_labelsLanguage.Stochaskell.Plot
_axis_label_gapLanguage.Stochaskell.Plot
_axis_label_styleLanguage.Stochaskell.Plot
_axis_line_styleLanguage.Stochaskell.Plot
_axis_show_labelsLanguage.Stochaskell.Plot
_axis_show_lineLanguage.Stochaskell.Plot
_axis_show_ticksLanguage.Stochaskell.Plot
_axis_ticksLanguage.Stochaskell.Plot
_axis_tropweivLanguage.Stochaskell.Plot
_axis_viewportLanguage.Stochaskell.Plot
_axis_visibilityLanguage.Stochaskell.Plot
_azimuthLanguage.Stochaskell.Plot
_ConsLanguage.Stochaskell.Plot
_DynamicPlotLanguage.Stochaskell.Plot
_EmptyLanguage.Stochaskell.Plot
_fill_colorLanguage.Stochaskell.Plot
_font_colorLanguage.Stochaskell.Plot
_font_nameLanguage.Stochaskell.Plot
_font_sizeLanguage.Stochaskell.Plot
_font_slantLanguage.Stochaskell.Plot
_font_weightLanguage.Stochaskell.Plot
_GWrapped'Language.Stochaskell.Plot
_headLanguage.Stochaskell.Plot
_initLanguage.Stochaskell.Plot
_JustLanguage.Stochaskell.Plot
_lastLanguage.Stochaskell.Plot
_laxis_generateLanguage.Stochaskell.Plot
_laxis_overrideLanguage.Stochaskell.Plot
_laxis_reverseLanguage.Stochaskell.Plot
_laxis_styleLanguage.Stochaskell.Plot
_laxis_titleLanguage.Stochaskell.Plot
_laxis_title_styleLanguage.Stochaskell.Plot
_layoutlr_backgroundLanguage.Stochaskell.Plot
_layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_grid_lastLanguage.Stochaskell.Plot
_layoutlr_left_axisLanguage.Stochaskell.Plot
_layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_legendLanguage.Stochaskell.Plot
_layoutlr_marginLanguage.Stochaskell.Plot
_layoutlr_plotsLanguage.Stochaskell.Plot
_layoutlr_plot_backgroundLanguage.Stochaskell.Plot
_layoutlr_right_axisLanguage.Stochaskell.Plot
_layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_titleLanguage.Stochaskell.Plot
_layoutlr_title_styleLanguage.Stochaskell.Plot
_layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_x_axisLanguage.Stochaskell.Plot
_layout_backgroundLanguage.Stochaskell.Plot
_layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layout_grid_lastLanguage.Stochaskell.Plot
_layout_left_axis_visibilityLanguage.Stochaskell.Plot
_layout_legendLanguage.Stochaskell.Plot
_layout_marginLanguage.Stochaskell.Plot
_layout_plotsLanguage.Stochaskell.Plot
_layout_plot_backgroundLanguage.Stochaskell.Plot
_layout_right_axis_visibilityLanguage.Stochaskell.Plot
_layout_titleLanguage.Stochaskell.Plot
_layout_title_styleLanguage.Stochaskell.Plot
_layout_top_axis_visibilityLanguage.Stochaskell.Plot
_layout_x_axisLanguage.Stochaskell.Plot
_layout_y_axisLanguage.Stochaskell.Plot
_la_labelfLanguage.Stochaskell.Plot
_la_nLabelsLanguage.Stochaskell.Plot
_la_nTicksLanguage.Stochaskell.Plot
_LeftLanguage.Stochaskell.Plot
_legend_label_styleLanguage.Stochaskell.Plot
_legend_marginLanguage.Stochaskell.Plot
_legend_orientationLanguage.Stochaskell.Plot
_legend_plot_sizeLanguage.Stochaskell.Plot
_legend_positionLanguage.Stochaskell.Plot
_line_capLanguage.Stochaskell.Plot
_line_colorLanguage.Stochaskell.Plot
_line_dashesLanguage.Stochaskell.Plot
_line_joinLanguage.Stochaskell.Plot
_line_widthLanguage.Stochaskell.Plot
_loga_labelfLanguage.Stochaskell.Plot
_NothingLanguage.Stochaskell.Plot
_pie_backgroundLanguage.Stochaskell.Plot
_pie_colorsLanguage.Stochaskell.Plot
_pie_dataLanguage.Stochaskell.Plot
_pie_label_line_styleLanguage.Stochaskell.Plot
_pie_label_styleLanguage.Stochaskell.Plot
_pie_marginLanguage.Stochaskell.Plot
_pie_plotLanguage.Stochaskell.Plot
_pie_start_angleLanguage.Stochaskell.Plot
_pie_titleLanguage.Stochaskell.Plot
_pie_title_styleLanguage.Stochaskell.Plot
_pitem_labelLanguage.Stochaskell.Plot
_pitem_offsetLanguage.Stochaskell.Plot
_pitem_valueLanguage.Stochaskell.Plot
_plot_all_pointsLanguage.Stochaskell.Plot
_plot_annotation_angleLanguage.Stochaskell.Plot
_plot_annotation_backgroundLanguage.Stochaskell.Plot
_plot_annotation_hanchorLanguage.Stochaskell.Plot
_plot_annotation_styleLanguage.Stochaskell.Plot
_plot_annotation_valuesLanguage.Stochaskell.Plot
_plot_annotation_vanchorLanguage.Stochaskell.Plot
_plot_bars_alignmentLanguage.Stochaskell.Plot
_plot_bars_item_stylesLanguage.Stochaskell.Plot
_plot_bars_referenceLanguage.Stochaskell.Plot
_plot_bars_singleton_widthLanguage.Stochaskell.Plot
_plot_bars_spacingLanguage.Stochaskell.Plot
_plot_bars_styleLanguage.Stochaskell.Plot
_plot_bars_titlesLanguage.Stochaskell.Plot
_plot_bars_valuesLanguage.Stochaskell.Plot
_plot_candle_centreLanguage.Stochaskell.Plot
_plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
_plot_candle_fillLanguage.Stochaskell.Plot
_plot_candle_line_styleLanguage.Stochaskell.Plot
_plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
_plot_candle_tick_lengthLanguage.Stochaskell.Plot
_plot_candle_titleLanguage.Stochaskell.Plot
_plot_candle_valuesLanguage.Stochaskell.Plot
_plot_candle_widthLanguage.Stochaskell.Plot
_plot_errbars_line_styleLanguage.Stochaskell.Plot
_plot_errbars_overhangLanguage.Stochaskell.Plot
_plot_errbars_tick_lengthLanguage.Stochaskell.Plot
_plot_errbars_titleLanguage.Stochaskell.Plot
_plot_errbars_valuesLanguage.Stochaskell.Plot
_plot_fillbetween_styleLanguage.Stochaskell.Plot
_plot_fillbetween_titleLanguage.Stochaskell.Plot
_plot_fillbetween_valuesLanguage.Stochaskell.Plot
_plot_hidden_x_valuesLanguage.Stochaskell.Plot
_plot_hidden_y_valuesLanguage.Stochaskell.Plot
_plot_hist_binsLanguage.Stochaskell.Plot
_plot_hist_drop_linesLanguage.Stochaskell.Plot
_plot_hist_fill_styleLanguage.Stochaskell.Plot
_plot_hist_line_styleLanguage.Stochaskell.Plot
_plot_hist_norm_funcLanguage.Stochaskell.Plot
_plot_hist_no_zerosLanguage.Stochaskell.Plot
_plot_hist_rangeLanguage.Stochaskell.Plot
_plot_hist_titleLanguage.Stochaskell.Plot
_plot_hist_valuesLanguage.Stochaskell.Plot
_plot_legendLanguage.Stochaskell.Plot
_plot_lines_limit_valuesLanguage.Stochaskell.Plot
_plot_lines_styleLanguage.Stochaskell.Plot
_plot_lines_titleLanguage.Stochaskell.Plot
_plot_lines_valuesLanguage.Stochaskell.Plot
_plot_points_styleLanguage.Stochaskell.Plot
_plot_points_titleLanguage.Stochaskell.Plot
_plot_points_valuesLanguage.Stochaskell.Plot
_plot_renderLanguage.Stochaskell.Plot
_plot_vectors_gridLanguage.Stochaskell.Plot
_plot_vectors_mapfLanguage.Stochaskell.Plot
_plot_vectors_scaleLanguage.Stochaskell.Plot
_plot_vectors_styleLanguage.Stochaskell.Plot
_plot_vectors_titleLanguage.Stochaskell.Plot
_plot_vectors_valuesLanguage.Stochaskell.Plot
_point_border_colorLanguage.Stochaskell.Plot
_point_border_widthLanguage.Stochaskell.Plot
_point_colorLanguage.Stochaskell.Plot
_point_radiusLanguage.Stochaskell.Plot
_point_shapeLanguage.Stochaskell.Plot
_polarLanguage.Stochaskell.Plot
_rLanguage.Stochaskell.Plot
_radialLanguage.Stochaskell.Plot
_rect_cornerStyleLanguage.Stochaskell.Plot
_rect_fillStyleLanguage.Stochaskell.Plot
_rect_lineStyleLanguage.Stochaskell.Plot
_rect_minsizeLanguage.Stochaskell.Plot
_RightLanguage.Stochaskell.Plot
_ShowLanguage.Stochaskell.Plot
_slayouts_compress_legendLanguage.Stochaskell.Plot
_slayouts_layoutsLanguage.Stochaskell.Plot
_SnocLanguage.Stochaskell.Plot
_specBoundsLanguage.Stochaskell.Plot
_specColourMapLanguage.Stochaskell.Plot
_specScaleLanguage.Stochaskell.Plot
_specTransLanguage.Stochaskell.Plot
_tailLanguage.Stochaskell.Plot
_UnwrappedLanguage.Stochaskell.Plot
_Unwrapped'Language.Stochaskell.Plot
_UnwrappingLanguage.Stochaskell.Plot
_Unwrapping'Language.Stochaskell.Plot
_vector_head_styleLanguage.Stochaskell.Plot
_vector_line_styleLanguage.Stochaskell.Plot
_VoidLanguage.Stochaskell.Plot
_WrappedLanguage.Stochaskell.Plot
_Wrapped'Language.Stochaskell.Plot
_WrappingLanguage.Stochaskell.Plot
_Wrapping'Language.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-A.html b/docs/doc/doc-index-A.html index eea6680..de58658 100644 --- a/docs/doc/doc-index-A.html +++ b/docs/doc/doc-index-A.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - A)

stochaskell-0.1.0: A probabilistic programming language

Index - A

abbreviatedFieldsLanguage.Stochaskell.Plot
abbreviatedNamerLanguage.Stochaskell.Plot
aboveLanguage.Stochaskell.Plot
aboveNLanguage.Stochaskell.Plot
aboveWideLanguage.Stochaskell.Plot
absLanguage.Stochaskell.Prelude, Language.Stochaskell
AbsoluteExtendLanguage.Stochaskell.Plot
AbstractArrayLanguage.Stochaskell
AccessingLanguage.Stochaskell.Plot
acosLanguage.Stochaskell.Prelude, Language.Stochaskell
acoshLanguage.Stochaskell.Prelude, Language.Stochaskell
adaptEngagedLanguage.Stan
addColourBarLanguage.Stochaskell.Plot
addIndexesLanguage.Stochaskell.Plot
addLegendEntryLanguage.Stochaskell.Plot
addMarginsLanguage.Stochaskell.Plot
addPlotLanguage.Stochaskell.Plot
addPlotableLanguage.Stochaskell.Plot
addPlotable'Language.Stochaskell.Plot
addToALLanguage.Stochaskell
adjointLanguage.Stochaskell.Plot
afCoordAlignFnLanguage.Stochaskell.Plot
affineComboLanguage.Stochaskell.Plot
AffineSpaceLanguage.Stochaskell.Plot
afPointAlignFnLanguage.Stochaskell.Plot
alaLanguage.Stochaskell.Plot
alafLanguage.Stochaskell.Plot
ALensLanguage.Stochaskell.Plot
ALens'Language.Stochaskell.Plot
aliceblueLanguage.Stochaskell.Plot
alignFillPathLanguage.Stochaskell.Plot
alignFillPointLanguage.Stochaskell.Plot
alignFillPointsLanguage.Stochaskell.Plot
AlignmentFnLanguage.Stochaskell.Plot
AlignmentFns 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
alignPathLanguage.Stochaskell.Plot
alignStrokePathLanguage.Stochaskell.Plot
alignStrokePointLanguage.Stochaskell.Plot
alignStrokePointsLanguage.Stochaskell.Plot
All 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
allLanguage.Stochaskell.Prelude, Language.Stochaskell
allOfLanguage.Stochaskell.Plot
alongsideLanguage.Stochaskell.Plot
alphaChannelLanguage.Stochaskell.Plot
AlphaColourLanguage.Stochaskell.Plot
alphaColourConvertLanguage.Stochaskell.Plot
alphaColourMapLanguage.Stochaskell.Plot
Alt 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
alwaysElemRIndexLanguage.Stochaskell
andLanguage.Stochaskell.Prelude, Language.Stochaskell
andOfLanguage.Stochaskell.Plot
AnEqualityLanguage.Stochaskell.Plot
AnEquality'Language.Stochaskell.Plot
AnIndexedLensLanguage.Stochaskell.Plot
AnIndexedLens'Language.Stochaskell.Plot
AnIndexedSetterLanguage.Stochaskell.Plot
AnIndexedSetter'Language.Stochaskell.Plot
AnIndexedTraversalLanguage.Stochaskell.Plot
AnIndexedTraversal'Language.Stochaskell.Plot
AnIndexedTraversal1Language.Stochaskell.Plot
AnIndexedTraversal1'Language.Stochaskell.Plot
AnIsoLanguage.Stochaskell.Plot
AnIso'Language.Stochaskell.Plot
anonLanguage.Stochaskell.Plot
antiquewhiteLanguage.Stochaskell.Plot
Any 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
anyLanguage.Stochaskell.Prelude, Language.Stochaskell
anyOfLanguage.Stochaskell.Plot
apLanguage.Stochaskell.Prelude, Language.Stochaskell
appendFileLanguage.Stochaskell.Prelude, Language.Stochaskell
appEndoLanguage.Stochaskell.Prelude, Language.Stochaskell
ApplicativeLanguage.Stochaskell.Prelude, Language.Stochaskell
applyAreaStyleLanguage.Stochaskell.Plot
applyLineStyleLanguage.Stochaskell.Plot
applyMarkerStyleLanguage.Stochaskell.Plot
applyTextStyleLanguage.Stochaskell.Plot
APrismLanguage.Stochaskell.Plot
APrism'Language.Stochaskell.Plot
aquaLanguage.Stochaskell.Plot
aquamarineLanguage.Stochaskell.Plot
ArcLanguage.Stochaskell.Plot
arcLanguage.Stochaskell.Plot
arc'Language.Stochaskell.Plot
ArcNegLanguage.Stochaskell.Plot
arcNegLanguage.Stochaskell.Plot
arcNeg'Language.Stochaskell.Plot
AreaSpots 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
AreaSpots4D 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
areaStyleLanguage.Stochaskell.Plot
areaStyleFunctionLanguage.Stochaskell.Plot
area_spots_4d_linethickLanguage.Stochaskell.Plot
area_spots_4d_max_radiusLanguage.Stochaskell.Plot
area_spots_4d_opacityLanguage.Stochaskell.Plot
area_spots_4d_paletteLanguage.Stochaskell.Plot
area_spots_4d_titleLanguage.Stochaskell.Plot
area_spots_4d_valuesLanguage.Stochaskell.Plot
area_spots_fillcolourLanguage.Stochaskell.Plot
area_spots_linecolourLanguage.Stochaskell.Plot
area_spots_linethickLanguage.Stochaskell.Plot
area_spots_max_radiusLanguage.Stochaskell.Plot
area_spots_opacityLanguage.Stochaskell.Plot
area_spots_titleLanguage.Stochaskell.Plot
area_spots_valuesLanguage.Stochaskell.Plot
AReviewLanguage.Stochaskell.Plot
argumentLanguage.Stochaskell.Plot
ArrayTLanguage.Stochaskell.Expression
arrowsLanguage.Stochaskell.Plot
AsLanguage.Stochaskell.Plot
asColumnLanguage.Stochaskell
AsEmptyLanguage.Stochaskell.Plot
ASetterLanguage.Stochaskell.Plot
ASetter'Language.Stochaskell.Plot
asideLanguage.Stochaskell.Plot
asinLanguage.Stochaskell.Prelude, Language.Stochaskell
asIndexLanguage.Stochaskell.Plot
asinhLanguage.Stochaskell.Prelude, Language.Stochaskell
asRowLanguage.Stochaskell
assignLanguage.Stochaskell.Plot
assignALanguage.Stochaskell.Plot
asteriskLanguage.Stochaskell.Plot
asTypeOfLanguage.Stochaskell.Prelude, Language.Stochaskell
asumOfLanguage.Stochaskell.Plot
AtLanguage.Stochaskell.Plot
atLanguage.Stochaskell.Plot
atanLanguage.Stochaskell.Prelude, Language.Stochaskell
atan2Language.Stochaskell.Prelude, Language.Stochaskell
atanhLanguage.Stochaskell.Prelude, Language.Stochaskell
atMajorTicksLanguage.Stochaskell.Plot
atopLanguage.Stochaskell.Plot
ATraversalLanguage.Stochaskell.Plot
ATraversal'Language.Stochaskell.Plot
ATraversal1Language.Stochaskell.Plot
ATraversal1'Language.Stochaskell.Plot
auLanguage.Stochaskell.Plot
aufLanguage.Stochaskell.Plot
autoAxisLanguage.Stochaskell.Plot
autoIndexAxisLanguage.Stochaskell.Plot
AutoScaleLanguage.Stochaskell.Plot
autoScaledAxisLanguage.Stochaskell.Plot
autoScaledIntAxisLanguage.Stochaskell.Plot
autoScaledLogAxisLanguage.Stochaskell.Plot
autoStepsLanguage.Stochaskell.Plot
AutoTickLanguage.Stochaskell.Plot
autoTicksLanguage.Stochaskell.Plot
autoTimeValueAxisLanguage.Stochaskell.Plot
AutoUniformScaleLanguage.Stochaskell.Plot
axesLanguage.Stochaskell.Plot
AxisLanguage.Stochaskell.Plot
axisColourMapLanguage.Stochaskell.Plot
AxisData 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisExtendLanguage.Stochaskell.Plot
AxisFnLanguage.Stochaskell.Plot
axisGridAtBigTicksLanguage.Stochaskell.Plot
axisGridAtLabelsLanguage.Stochaskell.Plot
axisGridAtTicksLanguage.Stochaskell.Plot
axisGridHideLanguage.Stochaskell.Plot
AxisLabelLanguage.Stochaskell.Plot
axisLabelLanguage.Stochaskell.Plot
axisLabelGapLanguage.Stochaskell.Plot
AxisLabelPlacementLanguage.Stochaskell.Plot
axisLabelPlacementLanguage.Stochaskell.Plot
AxisLabelPositionLanguage.Stochaskell.Plot
axisLabelPositionLanguage.Stochaskell.Plot
axisLabelsOverrideLanguage.Stochaskell.Plot
axisLabelStyleLanguage.Stochaskell.Plot
axisLabelTextLanguage.Stochaskell.Plot
axisLabelTextFunctionLanguage.Stochaskell.Plot
axisOverhangLanguage.Stochaskell.Plot
axisPlotsLanguage.Stochaskell.Plot
AxisScalingLanguage.Stochaskell.Plot
axisScalingLanguage.Stochaskell.Plot
axisSizeLanguage.Stochaskell.Plot
AxisSpec 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisStyleLanguage.Stochaskell.Plot
axisStylesLanguage.Stochaskell.Plot
AxisT 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisToRenderableLanguage.Stochaskell.Plot
AxisVisibility 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axis_gridLanguage.Stochaskell.Plot
axis_grid_styleLanguage.Stochaskell.Plot
axis_labelsLanguage.Stochaskell.Plot
axis_label_gapLanguage.Stochaskell.Plot
axis_label_styleLanguage.Stochaskell.Plot
axis_line_styleLanguage.Stochaskell.Plot
axis_show_labelsLanguage.Stochaskell.Plot
axis_show_lineLanguage.Stochaskell.Plot
axis_show_ticksLanguage.Stochaskell.Plot
axis_ticksLanguage.Stochaskell.Plot
axis_tropweivLanguage.Stochaskell.Plot
axis_viewportLanguage.Stochaskell.Plot
axis_visibilityLanguage.Stochaskell.Plot
azureLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - A)

stochaskell-1.0.0: A probabilistic programming language

Index - A

abbreviatedFieldsLanguage.Stochaskell.Plot
abbreviatedNamerLanguage.Stochaskell.Plot
aboveLanguage.Stochaskell.Plot
aboveNLanguage.Stochaskell.Plot
aboveWideLanguage.Stochaskell.Plot
absLanguage.Stochaskell.Prelude, Language.Stochaskell
AbsoluteExtendLanguage.Stochaskell.Plot
AbstractArrayLanguage.Stochaskell
AccessingLanguage.Stochaskell.Plot
acosLanguage.Stochaskell.Prelude, Language.Stochaskell
acoshLanguage.Stochaskell.Prelude, Language.Stochaskell
adaptEngagedLanguage.Stan
addColourBarLanguage.Stochaskell.Plot
addIndexesLanguage.Stochaskell.Plot
addLegendEntryLanguage.Stochaskell.Plot
addMarginsLanguage.Stochaskell.Plot
addPlotLanguage.Stochaskell.Plot
addPlotableLanguage.Stochaskell.Plot
addPlotable'Language.Stochaskell.Plot
addToALLanguage.Stochaskell
adjointLanguage.Stochaskell.Plot
afCoordAlignFnLanguage.Stochaskell.Plot
affineComboLanguage.Stochaskell.Plot
AffineSpaceLanguage.Stochaskell.Plot
afPointAlignFnLanguage.Stochaskell.Plot
alaLanguage.Stochaskell.Plot
alafLanguage.Stochaskell.Plot
ALensLanguage.Stochaskell.Plot
ALens'Language.Stochaskell.Plot
aliceblueLanguage.Stochaskell.Plot
alignFillPathLanguage.Stochaskell.Plot
alignFillPointLanguage.Stochaskell.Plot
alignFillPointsLanguage.Stochaskell.Plot
AlignmentFnLanguage.Stochaskell.Plot
AlignmentFns 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
alignPathLanguage.Stochaskell.Plot
alignStrokePathLanguage.Stochaskell.Plot
alignStrokePointLanguage.Stochaskell.Plot
alignStrokePointsLanguage.Stochaskell.Plot
All 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
allLanguage.Stochaskell.Prelude, Language.Stochaskell
allOfLanguage.Stochaskell.Plot
alongsideLanguage.Stochaskell.Plot
alphaChannelLanguage.Stochaskell.Plot
AlphaColourLanguage.Stochaskell.Plot
alphaColourConvertLanguage.Stochaskell.Plot
Alt 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
alwaysElemRIndexLanguage.Stochaskell
andLanguage.Stochaskell.Prelude, Language.Stochaskell
andOfLanguage.Stochaskell.Plot
AnEqualityLanguage.Stochaskell.Plot
AnEquality'Language.Stochaskell.Plot
AnIndexedLensLanguage.Stochaskell.Plot
AnIndexedLens'Language.Stochaskell.Plot
AnIndexedSetterLanguage.Stochaskell.Plot
AnIndexedSetter'Language.Stochaskell.Plot
AnIndexedTraversalLanguage.Stochaskell.Plot
AnIndexedTraversal'Language.Stochaskell.Plot
AnIndexedTraversal1Language.Stochaskell.Plot
AnIndexedTraversal1'Language.Stochaskell.Plot
AnIsoLanguage.Stochaskell.Plot
AnIso'Language.Stochaskell.Plot
anonLanguage.Stochaskell.Plot
antiquewhiteLanguage.Stochaskell.Plot
Any 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
anyLanguage.Stochaskell.Prelude, Language.Stochaskell
anyOfLanguage.Stochaskell.Plot
Ap 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
apLanguage.Stochaskell.Prelude, Language.Stochaskell
appendFileLanguage.Stochaskell.Prelude, Language.Stochaskell
appEndoLanguage.Stochaskell.Prelude, Language.Stochaskell
ApplicativeLanguage.Stochaskell.Prelude, Language.Stochaskell
applyAreaStyleLanguage.Stochaskell.Plot
applyLineStyleLanguage.Stochaskell.Plot
applyMarkerStyleLanguage.Stochaskell.Plot
applyTextStyleLanguage.Stochaskell.Plot
APrismLanguage.Stochaskell.Plot
APrism'Language.Stochaskell.Plot
aquaLanguage.Stochaskell.Plot
aquamarineLanguage.Stochaskell.Plot
ArcLanguage.Stochaskell.Plot
arcLanguage.Stochaskell.Plot
arc'Language.Stochaskell.Plot
ArcNegLanguage.Stochaskell.Plot
arcNegLanguage.Stochaskell.Plot
arcNeg'Language.Stochaskell.Plot
AreaSpots 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
AreaSpots4D 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
areaStyleLanguage.Stochaskell.Plot
areaStyleFunctionLanguage.Stochaskell.Plot
area_spots_4d_linethickLanguage.Stochaskell.Plot
area_spots_4d_max_radiusLanguage.Stochaskell.Plot
area_spots_4d_opacityLanguage.Stochaskell.Plot
area_spots_4d_paletteLanguage.Stochaskell.Plot
area_spots_4d_titleLanguage.Stochaskell.Plot
area_spots_4d_valuesLanguage.Stochaskell.Plot
area_spots_fillcolourLanguage.Stochaskell.Plot
area_spots_linecolourLanguage.Stochaskell.Plot
area_spots_linethickLanguage.Stochaskell.Plot
area_spots_max_radiusLanguage.Stochaskell.Plot
area_spots_opacityLanguage.Stochaskell.Plot
area_spots_titleLanguage.Stochaskell.Plot
area_spots_valuesLanguage.Stochaskell.Plot
AReviewLanguage.Stochaskell.Plot
argumentLanguage.Stochaskell.Plot
ArrayTLanguage.Stochaskell.Expression
arrowsLanguage.Stochaskell.Plot
AsLanguage.Stochaskell.Plot
asColumnLanguage.Stochaskell
AsEmptyLanguage.Stochaskell.Plot
ASetterLanguage.Stochaskell.Plot
ASetter'Language.Stochaskell.Plot
asideLanguage.Stochaskell.Plot
asinLanguage.Stochaskell.Prelude, Language.Stochaskell
asIndexLanguage.Stochaskell.Plot
asinhLanguage.Stochaskell.Prelude, Language.Stochaskell
asRowLanguage.Stochaskell
assignLanguage.Stochaskell.Plot
assignALanguage.Stochaskell.Plot
asteriskLanguage.Stochaskell.Plot
asTypeOfLanguage.Stochaskell.Prelude, Language.Stochaskell
asumOfLanguage.Stochaskell.Plot
AtLanguage.Stochaskell.Plot
atLanguage.Stochaskell.Plot
atanLanguage.Stochaskell.Prelude, Language.Stochaskell
atan2Language.Stochaskell.Prelude, Language.Stochaskell
atanhLanguage.Stochaskell.Prelude, Language.Stochaskell
atMajorTicksLanguage.Stochaskell.Plot
atopLanguage.Stochaskell.Plot
ATraversalLanguage.Stochaskell.Plot
ATraversal'Language.Stochaskell.Plot
ATraversal1Language.Stochaskell.Plot
ATraversal1'Language.Stochaskell.Plot
auLanguage.Stochaskell.Plot
aufLanguage.Stochaskell.Plot
autoAxisLanguage.Stochaskell.Plot
autoIndexAxisLanguage.Stochaskell.Plot
AutoScaleLanguage.Stochaskell.Plot
autoScaledAxisLanguage.Stochaskell.Plot
autoScaledIntAxisLanguage.Stochaskell.Plot
autoScaledLogAxisLanguage.Stochaskell.Plot
autoStepsLanguage.Stochaskell.Plot
AutoTickLanguage.Stochaskell.Plot
autoTicksLanguage.Stochaskell.Plot
autoTimeValueAxisLanguage.Stochaskell.Plot
AutoUniformScaleLanguage.Stochaskell.Plot
axesLanguage.Stochaskell.Plot
AxisLanguage.Stochaskell.Plot
axisColourMapLanguage.Stochaskell.Plot
AxisData 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisExtendLanguage.Stochaskell.Plot
AxisFnLanguage.Stochaskell.Plot
axisGridAtBigTicksLanguage.Stochaskell.Plot
axisGridAtLabelsLanguage.Stochaskell.Plot
axisGridAtTicksLanguage.Stochaskell.Plot
axisGridHideLanguage.Stochaskell.Plot
AxisLabelLanguage.Stochaskell.Plot
axisLabelLanguage.Stochaskell.Plot
axisLabelGapLanguage.Stochaskell.Plot
AxisLabelPlacementLanguage.Stochaskell.Plot
axisLabelPlacementLanguage.Stochaskell.Plot
AxisLabelPositionLanguage.Stochaskell.Plot
axisLabelPositionLanguage.Stochaskell.Plot
axisLabelsOverrideLanguage.Stochaskell.Plot
axisLabelStyleLanguage.Stochaskell.Plot
axisLabelTextLanguage.Stochaskell.Plot
axisLabelTextFunctionLanguage.Stochaskell.Plot
axisOverhangLanguage.Stochaskell.Plot
axisPlotsLanguage.Stochaskell.Plot
AxisScalingLanguage.Stochaskell.Plot
axisScalingLanguage.Stochaskell.Plot
axisSizeLanguage.Stochaskell.Plot
AxisSpec 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisStyleLanguage.Stochaskell.Plot
axisStylesLanguage.Stochaskell.Plot
AxisT 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisToRenderableLanguage.Stochaskell.Plot
AxisVisibility 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axis_gridLanguage.Stochaskell.Plot
axis_grid_styleLanguage.Stochaskell.Plot
axis_labelsLanguage.Stochaskell.Plot
axis_label_gapLanguage.Stochaskell.Plot
axis_label_styleLanguage.Stochaskell.Plot
axis_line_styleLanguage.Stochaskell.Plot
axis_show_labelsLanguage.Stochaskell.Plot
axis_show_lineLanguage.Stochaskell.Plot
axis_show_ticksLanguage.Stochaskell.Plot
axis_ticksLanguage.Stochaskell.Plot
axis_tropweivLanguage.Stochaskell.Plot
axis_viewportLanguage.Stochaskell.Plot
axis_visibilityLanguage.Stochaskell.Plot
azureLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-All.html b/docs/doc/doc-index-All.html index a033b3a..e6f2fa2 100644 --- a/docs/doc/doc-index-All.html +++ b/docs/doc/doc-index-All.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index)

stochaskell-0.1.0: A probabilistic programming language

Index

!Language.Stochaskell
!!Language.Stochaskell.Prelude, Language.Stochaskell
#Language.Stochaskell.Plot
#%%=Language.Stochaskell.Plot
#%%~Language.Stochaskell.Plot
#%=Language.Stochaskell.Plot
#%~Language.Stochaskell.Plot
#=Language.Stochaskell.Plot
#>Language.Stochaskell
#~Language.Stochaskell.Plot
$Language.Stochaskell.Prelude, Language.Stochaskell
$!Language.Stochaskell.Prelude, Language.Stochaskell
%%=Language.Stochaskell.Plot
%%@=Language.Stochaskell.Plot
%%@~Language.Stochaskell.Plot
%%~Language.Stochaskell.Plot
%=Language.Stochaskell.Plot
%@=Language.Stochaskell.Plot
%@~Language.Stochaskell.Plot
%~Language.Stochaskell.Plot
&Language.Stochaskell.Plot
&&Language.Stochaskell.Prelude, Language.Stochaskell
&&*Language.Stochaskell.Prelude, Language.Stochaskell
&&=Language.Stochaskell.Plot
&&~Language.Stochaskell.Plot
&=Language.Stochaskell.Plot
&~Language.Stochaskell.Plot
&~~Language.Stochaskell.Plot
*Language.Stochaskell.Prelude, Language.Stochaskell
**Language.Stochaskell.Prelude, Language.Stochaskell
**=Language.Stochaskell.Plot
**~Language.Stochaskell.Plot
*=Language.Stochaskell.Plot
*>Language.Stochaskell
*~Language.Stochaskell.Plot
+Language.Stochaskell.Prelude, Language.Stochaskell
++Language.Stochaskell.Prelude, Language.Stochaskell
+=Language.Stochaskell.Plot
+~Language.Stochaskell.Plot
-Language.Stochaskell.Prelude, Language.Stochaskell
-=Language.Stochaskell.Plot
-~Language.Stochaskell.Plot
.Language.Stochaskell.Prelude, Language.Stochaskell
...Language.Stochaskell
./.Language.Stochaskell.Plot
.=Language.Stochaskell.Plot
.>Language.Stochaskell.Plot
.@=Language.Stochaskell.Plot
.@~Language.Stochaskell.Plot
.|.Language.Stochaskell.Plot
.~Language.Stochaskell.Plot
/Language.Stochaskell.Prelude, Language.Stochaskell
//=Language.Stochaskell.Plot
//~Language.Stochaskell.Plot
/=Language.Stochaskell.Prelude, Language.Stochaskell
/=*Language.Stochaskell.Prelude, Language.Stochaskell
:<Language.Stochaskell.Plot
:>Language.Stochaskell.Plot
<Language.Stochaskell.Prelude, Language.Stochaskell
<#Language.Stochaskell
<#%=Language.Stochaskell.Plot
<#%~Language.Stochaskell.Plot
<#=Language.Stochaskell.Plot
<#~Language.Stochaskell.Plot
<$Language.Stochaskell.Prelude, Language.Stochaskell
<$!>Language.Stochaskell.Prelude, Language.Stochaskell
<$>Language.Stochaskell.Prelude, Language.Stochaskell
<%=Language.Stochaskell.Plot
<%@=Language.Stochaskell.Plot
<%@~Language.Stochaskell.Plot
<%~Language.Stochaskell.Plot
<&&=Language.Stochaskell.Plot
<&&~Language.Stochaskell.Plot
<&>Language.Stochaskell.Plot
<*Language.Stochaskell.Prelude, Language.Stochaskell
<**=Language.Stochaskell.Plot
<**~Language.Stochaskell.Plot
<*=Language.Stochaskell.Plot
<*>Language.Stochaskell.Prelude, Language.Stochaskell
<*~Language.Stochaskell.Plot
<+=Language.Stochaskell.Plot
<+~Language.Stochaskell.Plot
<-=Language.Stochaskell.Plot
<-~Language.Stochaskell.Plot
<.Language.Stochaskell.Plot
<.=Language.Stochaskell.Plot
<.> 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell
<.~Language.Stochaskell.Plot
<//=Language.Stochaskell.Plot
<//~Language.Stochaskell.Plot
<<%=Language.Stochaskell.Plot
<<%@=Language.Stochaskell.Plot
<<%@~Language.Stochaskell.Plot
<<%~Language.Stochaskell.Plot
<<&&=Language.Stochaskell.Plot
<<&&~Language.Stochaskell.Plot
<<**=Language.Stochaskell.Plot
<<**~Language.Stochaskell.Plot
<<*=Language.Stochaskell.Plot
<<*~Language.Stochaskell.Plot
<<+=Language.Stochaskell.Plot
<<+~Language.Stochaskell.Plot
<<-=Language.Stochaskell.Plot
<<-~Language.Stochaskell.Plot
<<.=Language.Stochaskell.Plot
<<.~Language.Stochaskell.Plot
<<//=Language.Stochaskell.Plot
<<//~Language.Stochaskell.Plot
<<<>=Language.Stochaskell.Plot
<<<>~Language.Stochaskell.Plot
<<>=Language.Stochaskell.Plot
<<>~Language.Stochaskell.Plot
<<?=Language.Stochaskell.Plot
<<?~Language.Stochaskell.Plot
<<^=Language.Stochaskell.Plot
<<^^=Language.Stochaskell.Plot
<<^^~Language.Stochaskell.Plot
<<^~Language.Stochaskell.Plot
<<||=Language.Stochaskell.Plot
<<||~Language.Stochaskell.Plot
<<~Language.Stochaskell.Plot
<=Language.Stochaskell.Prelude, Language.Stochaskell
<=*Language.Stochaskell.Prelude, Language.Stochaskell
<=<Language.Stochaskell.Prelude, Language.Stochaskell
<>Language.Stochaskell.Prelude, Language.Stochaskell
<>=Language.Stochaskell.Plot
<>~Language.Stochaskell.Plot
<?=Language.Stochaskell.Plot
<?~Language.Stochaskell.Plot
<\>Language.Stochaskell
<^=Language.Stochaskell.Plot
<^^=Language.Stochaskell.Plot
<^^~Language.Stochaskell.Plot
<^~Language.Stochaskell.Plot
<|Language.Stochaskell.Plot
<||=Language.Stochaskell.Plot
<||~Language.Stochaskell.Plot
<~Language.Stochaskell.Plot
=<<Language.Stochaskell.Prelude, Language.Stochaskell
==Language.Stochaskell.Prelude, Language.Stochaskell
==*Language.Stochaskell.Prelude, Language.Stochaskell
>Language.Stochaskell.Prelude, Language.Stochaskell
>$Language.Stochaskell.Plot
>*Language.Stochaskell.Prelude, Language.Stochaskell
>=Language.Stochaskell.Prelude, Language.Stochaskell
>=*Language.Stochaskell.Prelude, Language.Stochaskell
>=>Language.Stochaskell.Prelude, Language.Stochaskell
>>Language.Stochaskell.Prelude, Language.Stochaskell
>>=Language.Stochaskell.Prelude, Language.Stochaskell
?=Language.Stochaskell.Plot
??Language.Stochaskell.Plot
?~Language.Stochaskell.Plot
abbreviatedFieldsLanguage.Stochaskell.Plot
abbreviatedNamerLanguage.Stochaskell.Plot
aboveLanguage.Stochaskell.Plot
aboveNLanguage.Stochaskell.Plot
aboveWideLanguage.Stochaskell.Plot
absLanguage.Stochaskell.Prelude, Language.Stochaskell
AbsoluteExtendLanguage.Stochaskell.Plot
AbstractArrayLanguage.Stochaskell
AccessingLanguage.Stochaskell.Plot
acosLanguage.Stochaskell.Prelude, Language.Stochaskell
acoshLanguage.Stochaskell.Prelude, Language.Stochaskell
adaptEngagedLanguage.Stan
addColourBarLanguage.Stochaskell.Plot
addIndexesLanguage.Stochaskell.Plot
addLegendEntryLanguage.Stochaskell.Plot
addMarginsLanguage.Stochaskell.Plot
addPlotLanguage.Stochaskell.Plot
addPlotableLanguage.Stochaskell.Plot
addPlotable'Language.Stochaskell.Plot
addToALLanguage.Stochaskell
adjointLanguage.Stochaskell.Plot
afCoordAlignFnLanguage.Stochaskell.Plot
affineComboLanguage.Stochaskell.Plot
AffineSpaceLanguage.Stochaskell.Plot
afPointAlignFnLanguage.Stochaskell.Plot
alaLanguage.Stochaskell.Plot
alafLanguage.Stochaskell.Plot
ALensLanguage.Stochaskell.Plot
ALens'Language.Stochaskell.Plot
aliceblueLanguage.Stochaskell.Plot
alignFillPathLanguage.Stochaskell.Plot
alignFillPointLanguage.Stochaskell.Plot
alignFillPointsLanguage.Stochaskell.Plot
AlignmentFnLanguage.Stochaskell.Plot
AlignmentFns 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
alignPathLanguage.Stochaskell.Plot
alignStrokePathLanguage.Stochaskell.Plot
alignStrokePointLanguage.Stochaskell.Plot
alignStrokePointsLanguage.Stochaskell.Plot
All 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
allLanguage.Stochaskell.Prelude, Language.Stochaskell
allOfLanguage.Stochaskell.Plot
alongsideLanguage.Stochaskell.Plot
alphaChannelLanguage.Stochaskell.Plot
AlphaColourLanguage.Stochaskell.Plot
alphaColourConvertLanguage.Stochaskell.Plot
alphaColourMapLanguage.Stochaskell.Plot
Alt 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
alwaysElemRIndexLanguage.Stochaskell
andLanguage.Stochaskell.Prelude, Language.Stochaskell
andOfLanguage.Stochaskell.Plot
AnEqualityLanguage.Stochaskell.Plot
AnEquality'Language.Stochaskell.Plot
AnIndexedLensLanguage.Stochaskell.Plot
AnIndexedLens'Language.Stochaskell.Plot
AnIndexedSetterLanguage.Stochaskell.Plot
AnIndexedSetter'Language.Stochaskell.Plot
AnIndexedTraversalLanguage.Stochaskell.Plot
AnIndexedTraversal'Language.Stochaskell.Plot
AnIndexedTraversal1Language.Stochaskell.Plot
AnIndexedTraversal1'Language.Stochaskell.Plot
AnIsoLanguage.Stochaskell.Plot
AnIso'Language.Stochaskell.Plot
anonLanguage.Stochaskell.Plot
antiquewhiteLanguage.Stochaskell.Plot
Any 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
anyLanguage.Stochaskell.Prelude, Language.Stochaskell
anyOfLanguage.Stochaskell.Plot
apLanguage.Stochaskell.Prelude, Language.Stochaskell
appendFileLanguage.Stochaskell.Prelude, Language.Stochaskell
appEndoLanguage.Stochaskell.Prelude, Language.Stochaskell
ApplicativeLanguage.Stochaskell.Prelude, Language.Stochaskell
applyAreaStyleLanguage.Stochaskell.Plot
applyLineStyleLanguage.Stochaskell.Plot
applyMarkerStyleLanguage.Stochaskell.Plot
applyTextStyleLanguage.Stochaskell.Plot
APrismLanguage.Stochaskell.Plot
APrism'Language.Stochaskell.Plot
aquaLanguage.Stochaskell.Plot
aquamarineLanguage.Stochaskell.Plot
ArcLanguage.Stochaskell.Plot
arcLanguage.Stochaskell.Plot
arc'Language.Stochaskell.Plot
ArcNegLanguage.Stochaskell.Plot
arcNegLanguage.Stochaskell.Plot
arcNeg'Language.Stochaskell.Plot
AreaSpots 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
AreaSpots4D 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
areaStyleLanguage.Stochaskell.Plot
areaStyleFunctionLanguage.Stochaskell.Plot
area_spots_4d_linethickLanguage.Stochaskell.Plot
area_spots_4d_max_radiusLanguage.Stochaskell.Plot
area_spots_4d_opacityLanguage.Stochaskell.Plot
area_spots_4d_paletteLanguage.Stochaskell.Plot
area_spots_4d_titleLanguage.Stochaskell.Plot
area_spots_4d_valuesLanguage.Stochaskell.Plot
area_spots_fillcolourLanguage.Stochaskell.Plot
area_spots_linecolourLanguage.Stochaskell.Plot
area_spots_linethickLanguage.Stochaskell.Plot
area_spots_max_radiusLanguage.Stochaskell.Plot
area_spots_opacityLanguage.Stochaskell.Plot
area_spots_titleLanguage.Stochaskell.Plot
area_spots_valuesLanguage.Stochaskell.Plot
AReviewLanguage.Stochaskell.Plot
argumentLanguage.Stochaskell.Plot
ArrayTLanguage.Stochaskell.Expression
arrowsLanguage.Stochaskell.Plot
AsLanguage.Stochaskell.Plot
asColumnLanguage.Stochaskell
AsEmptyLanguage.Stochaskell.Plot
ASetterLanguage.Stochaskell.Plot
ASetter'Language.Stochaskell.Plot
asideLanguage.Stochaskell.Plot
asinLanguage.Stochaskell.Prelude, Language.Stochaskell
asIndexLanguage.Stochaskell.Plot
asinhLanguage.Stochaskell.Prelude, Language.Stochaskell
asRowLanguage.Stochaskell
assignLanguage.Stochaskell.Plot
assignALanguage.Stochaskell.Plot
asteriskLanguage.Stochaskell.Plot
asTypeOfLanguage.Stochaskell.Prelude, Language.Stochaskell
asumOfLanguage.Stochaskell.Plot
AtLanguage.Stochaskell.Plot
atLanguage.Stochaskell.Plot
atanLanguage.Stochaskell.Prelude, Language.Stochaskell
atan2Language.Stochaskell.Prelude, Language.Stochaskell
atanhLanguage.Stochaskell.Prelude, Language.Stochaskell
atMajorTicksLanguage.Stochaskell.Plot
atopLanguage.Stochaskell.Plot
ATraversalLanguage.Stochaskell.Plot
ATraversal'Language.Stochaskell.Plot
ATraversal1Language.Stochaskell.Plot
ATraversal1'Language.Stochaskell.Plot
auLanguage.Stochaskell.Plot
aufLanguage.Stochaskell.Plot
autoAxisLanguage.Stochaskell.Plot
autoIndexAxisLanguage.Stochaskell.Plot
AutoScaleLanguage.Stochaskell.Plot
autoScaledAxisLanguage.Stochaskell.Plot
autoScaledIntAxisLanguage.Stochaskell.Plot
autoScaledLogAxisLanguage.Stochaskell.Plot
autoStepsLanguage.Stochaskell.Plot
AutoTickLanguage.Stochaskell.Plot
autoTicksLanguage.Stochaskell.Plot
autoTimeValueAxisLanguage.Stochaskell.Plot
AutoUniformScaleLanguage.Stochaskell.Plot
axesLanguage.Stochaskell.Plot
AxisLanguage.Stochaskell.Plot
axisColourMapLanguage.Stochaskell.Plot
AxisData 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisExtendLanguage.Stochaskell.Plot
AxisFnLanguage.Stochaskell.Plot
axisGridAtBigTicksLanguage.Stochaskell.Plot
axisGridAtLabelsLanguage.Stochaskell.Plot
axisGridAtTicksLanguage.Stochaskell.Plot
axisGridHideLanguage.Stochaskell.Plot
AxisLabelLanguage.Stochaskell.Plot
axisLabelLanguage.Stochaskell.Plot
axisLabelGapLanguage.Stochaskell.Plot
AxisLabelPlacementLanguage.Stochaskell.Plot
axisLabelPlacementLanguage.Stochaskell.Plot
AxisLabelPositionLanguage.Stochaskell.Plot
axisLabelPositionLanguage.Stochaskell.Plot
axisLabelsOverrideLanguage.Stochaskell.Plot
axisLabelStyleLanguage.Stochaskell.Plot
axisLabelTextLanguage.Stochaskell.Plot
axisLabelTextFunctionLanguage.Stochaskell.Plot
axisOverhangLanguage.Stochaskell.Plot
axisPlotsLanguage.Stochaskell.Plot
AxisScalingLanguage.Stochaskell.Plot
axisScalingLanguage.Stochaskell.Plot
axisSizeLanguage.Stochaskell.Plot
AxisSpec 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisStyleLanguage.Stochaskell.Plot
axisStylesLanguage.Stochaskell.Plot
AxisT 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axisToRenderableLanguage.Stochaskell.Plot
AxisVisibility 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
axis_gridLanguage.Stochaskell.Plot
axis_grid_styleLanguage.Stochaskell.Plot
axis_labelsLanguage.Stochaskell.Plot
axis_label_gapLanguage.Stochaskell.Plot
axis_label_styleLanguage.Stochaskell.Plot
axis_line_styleLanguage.Stochaskell.Plot
axis_show_labelsLanguage.Stochaskell.Plot
axis_show_lineLanguage.Stochaskell.Plot
axis_show_ticksLanguage.Stochaskell.Plot
axis_ticksLanguage.Stochaskell.Plot
axis_tropweivLanguage.Stochaskell.Plot
axis_viewportLanguage.Stochaskell.Plot
axis_visibilityLanguage.Stochaskell.Plot
azureLanguage.Stochaskell.Plot
BLanguage.Stochaskell
BackendProgramLanguage.Stochaskell.Plot
backwardsLanguage.Stochaskell.Plot
BarLayoutLanguage.Stochaskell.Plot
barLayoutLanguage.Stochaskell.Plot
BarPlotLanguage.Stochaskell.Plot
barPlotLanguage.Stochaskell.Plot
barPlot'Language.Stochaskell.Plot
barsLanguage.Stochaskell.Plot
barsAddLanguage.Stochaskell.Plot
BarsCenteredLanguage.Stochaskell.Plot
BarsClusteredLanguage.Stochaskell.Plot
BarsFixGapLanguage.Stochaskell.Plot
BarsFixWidthLanguage.Stochaskell.Plot
BarsLeftLanguage.Stochaskell.Plot
barSpacingLanguage.Stochaskell.Plot
BarsPlotValueLanguage.Stochaskell.Plot
barsReferenceLanguage.Stochaskell.Plot
BarsRightLanguage.Stochaskell.Plot
BarsStackedLanguage.Stochaskell.Plot
barStartLanguage.Stochaskell.Plot
barWidthLanguage.Stochaskell.Plot
BaseSpaceLanguage.Stochaskell.Plot
Bazaar 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Bazaar'Language.Stochaskell.Plot
Bazaar1 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Bazaar1'Language.Stochaskell.Plot
beigeLanguage.Stochaskell.Plot
belowLanguage.Stochaskell.Plot
BernoulliLanguage.Stochaskell
bernoulliLanguage.Stochaskell
bernoulliLogitLanguage.Stochaskell
bernoulliLogitsLanguage.Stochaskell
BernoullisLanguage.Stochaskell
bernoullisLanguage.Stochaskell
besideLanguage.Stochaskell.Plot
besideNLanguage.Stochaskell.Plot
besideTallLanguage.Stochaskell.Plot
BetaLanguage.Stochaskell
betaLanguage.Stochaskell
BetweenTicksLanguage.Stochaskell.Plot
BifunctorLanguage.Stochaskell.Plot
bimapLanguage.Stochaskell.Plot
bimappingLanguage.Stochaskell.Plot
binarizeLanguage.Stochaskell
binRangeLanguage.Stochaskell.Plot
bisqueLanguage.Stochaskell.Plot
bitmapAlignmentFnsLanguage.Stochaskell.Plot
blackLanguage.Stochaskell.Plot
blackAndWhiteLanguage.Stochaskell.Plot
blanchedalmondLanguage.Stochaskell.Plot
blendLanguage.Stochaskell.Plot
blockMatrixLanguage.Stochaskell
blockVectorLanguage.Stochaskell
blueLanguage.Stochaskell.Plot
bluevioletLanguage.Stochaskell.Plot
BMatLanguage.Stochaskell
BoolLanguage.Stochaskell.Prelude, Language.Stochaskell
BooleanLanguage.Stochaskell.Prelude, Language.Stochaskell
booleanLanguage.Stochaskell
BooleanOfLanguage.Stochaskell.Prelude, Language.Stochaskell
boolTLanguage.Stochaskell.Expression
bothLanguage.Stochaskell.Plot
both1Language.Stochaskell.Plot
bothTicksLanguage.Stochaskell.Plot
bottomLanguage.Stochaskell.Plot
bottomLeftLanguage.Stochaskell.Plot
bottomRightLanguage.Stochaskell.Plot
BoundedLanguage.Stochaskell.Prelude, Language.Stochaskell
boundMaxLanguage.Stochaskell.Plot
boundMinLanguage.Stochaskell.Plot
boundsLanguage.Stochaskell
breakLanguage.Stochaskell.Prelude, Language.Stochaskell
breakListLanguage.Stochaskell
brownLanguage.Stochaskell.Plot
BubbleOptionsLanguage.Stochaskell.Plot
bubbleOptionsLanguage.Stochaskell.Plot
bubblePlotLanguage.Stochaskell.Plot
bubblePlot'Language.Stochaskell.Plot
bubblePlotOfLanguage.Stochaskell.Plot
bubblePlotOf'Language.Stochaskell.Plot
bubbleStyleLanguage.Stochaskell.Plot
bubbleTransformLanguage.Stochaskell.Plot
buildPlotsLanguage.Stochaskell.Plot
burlywoodLanguage.Stochaskell.Plot
BVecLanguage.Stochaskell
cadetblueLanguage.Stochaskell.Plot
calculateBoundsLanguage.Stochaskell.Plot
calculateScalingLanguage.Stochaskell.Plot
camelCaseFieldsLanguage.Stochaskell.Plot
camelCaseNamerLanguage.Stochaskell.Plot
Candle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
candle_closeLanguage.Stochaskell.Plot
candle_highLanguage.Stochaskell.Plot
candle_lowLanguage.Stochaskell.Plot
candle_midLanguage.Stochaskell.Plot
candle_openLanguage.Stochaskell.Plot
candle_xLanguage.Stochaskell.Plot
caseBLanguage.Stochaskell.Prelude, Language.Stochaskell
CastLanguage.Stochaskell
castLanguage.Stochaskell
catMaybesLanguage.Stochaskell.Prelude, Language.Stochaskell
CauchyLanguage.Stochaskell
cauchyLanguage.Stochaskell
cdfLanguage.Stochaskell.Plot
ceilingLanguage.Stochaskell.Prelude, Language.Stochaskell
censoringLanguage.Stochaskell.Plot
centerTicksLanguage.Stochaskell.Plot
centreTicksLanguage.Stochaskell.Plot
chainLanguage.Stochaskell
chain'Language.Stochaskell
chainRangeLanguage.Stochaskell
chainRange'Language.Stochaskell
ChangeHorizontalLimitsLanguage.Stochaskell.Plot
ChangeVerticalLimitsLanguage.Stochaskell.Plot
CharLanguage.Stochaskell.Prelude, Language.Stochaskell
chartreuseLanguage.Stochaskell.Plot
childrenLanguage.Stochaskell.Plot
chocolateLanguage.Stochaskell.Plot
ChoiceLanguage.Stochaskell.Plot
cholLanguage.Stochaskell
choosingLanguage.Stochaskell.Plot
chosenLanguage.Stochaskell.Plot
CircleLanguage.Stochaskell.Plot
classUnderscoreNoPrefixFieldsLanguage.Stochaskell.Plot
classUnderscoreNoPrefixNamerLanguage.Stochaskell.Plot
ClassyNamerLanguage.Stochaskell.Plot
classyRulesLanguage.Stochaskell.Plot
classyRules_Language.Stochaskell.Plot
clipPlotLanguage.Stochaskell.Plot
cloneIndexedLensLanguage.Stochaskell.Plot
cloneIndexedSetterLanguage.Stochaskell.Plot
cloneIndexedTraversalLanguage.Stochaskell.Plot
cloneIndexedTraversal1Language.Stochaskell.Plot
cloneIndexPreservingLensLanguage.Stochaskell.Plot
cloneIndexPreservingSetterLanguage.Stochaskell.Plot
cloneIndexPreservingTraversalLanguage.Stochaskell.Plot
cloneIndexPreservingTraversal1Language.Stochaskell.Plot
cloneIsoLanguage.Stochaskell.Plot
cloneLensLanguage.Stochaskell.Plot
clonePrismLanguage.Stochaskell.Plot
cloneSetterLanguage.Stochaskell.Plot
cloneTraversalLanguage.Stochaskell.Plot
cloneTraversal1Language.Stochaskell.Plot
CloseLanguage.Stochaskell.Plot
closeLanguage.Stochaskell.Plot
cmTraverseLanguage.Stochaskell.Plot
coercedLanguage.Stochaskell.Plot
colorsLanguage.Stochaskell.Plot
ColourLanguage.Stochaskell.Plot
ColourBarLanguage.Stochaskell.Plot
colourBarLanguage.Stochaskell.Plot
colourBarDrawLanguage.Stochaskell.Plot
colourBarGapLanguage.Stochaskell.Plot
colourBarLengthFunctionLanguage.Stochaskell.Plot
colourBarRangeLanguage.Stochaskell.Plot
colourBarStyleLanguage.Stochaskell.Plot
colourBarWidthLanguage.Stochaskell.Plot
colourConvertLanguage.Stochaskell.Plot
colourListLanguage.Stochaskell.Plot
ColourMapLanguage.Stochaskell.Plot
colourMapLanguage.Stochaskell.Plot
ColourOpsLanguage.Stochaskell.Plot
colours1Language.Stochaskell.Plot
colours2Language.Stochaskell.Plot
compareLanguage.Stochaskell.Prelude, Language.Stochaskell
compileCCLanguage.Stochaskell
composOpFoldLanguage.Stochaskell.Plot
computedHistogramLanguage.Stochaskell.Plot
concatLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapOfLanguage.Stochaskell.Plot
concatOfLanguage.Stochaskell.Plot
condLanguage.Stochaskell.Prelude, Language.Stochaskell
ConditionOfLanguage.Stochaskell.Prelude, Language.Stochaskell
confusingLanguage.Stochaskell.Plot
ConjoinedLanguage.Stochaskell.Plot
conjoinedLanguage.Stochaskell.Plot
connectingLineLanguage.Stochaskell.Plot
ConsLanguage.Stochaskell.Plot
consLanguage.Stochaskell.Plot
Const 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
constLanguage.Stochaskell.Prelude, Language.Stochaskell
constExprLanguage.Stochaskell.Expression
constructLanguage.Stochaskell.Expression
ConstructorLanguage.Stochaskell.Expression
constSymbolLanguage.Stochaskell
ConstValLanguage.Stochaskell.Expression
constValLanguage.Stochaskell.Expression
ContainsLanguage.Stochaskell.Plot
contains 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell
Context 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Context'Language.Stochaskell.Plot
contextsLanguage.Stochaskell.Plot
contextsOfLanguage.Stochaskell.Plot
contextsOnLanguage.Stochaskell.Plot
contextsOnOfLanguage.Stochaskell.Plot
contramapLanguage.Stochaskell.Plot
contramappedLanguage.Stochaskell.Plot
contramappingLanguage.Stochaskell.Plot
ContravariantLanguage.Stochaskell.Plot
coralLanguage.Stochaskell.Plot
cornflowerblueLanguage.Stochaskell.Plot
cornsilkLanguage.Stochaskell.Plot
corrLKJLanguage.Stochaskell
cosLanguage.Stochaskell.Prelude, Language.Stochaskell
coshLanguage.Stochaskell.Prelude, Language.Stochaskell
cosmosLanguage.Stochaskell.Plot
cosmosOfLanguage.Stochaskell.Plot
cosmosOnLanguage.Stochaskell.Plot
cosmosOnOfLanguage.Stochaskell.Plot
countLanguage.Stochaskell.Plot
countDensityLanguage.Stochaskell.Plot
countElemLanguage.Stochaskell
createClassLanguage.Stochaskell.Plot
crimsonLanguage.Stochaskell.Plot
cropLanguage.Stochaskell.Prelude, Language.Stochaskell
crossShapeLanguage.Stochaskell.Plot
CStateLanguage.Stochaskell.Plot
cumilativeLanguage.Stochaskell.Plot
currentPlotsLanguage.Stochaskell.Plot
curriedLanguage.Stochaskell.Plot
curryLanguage.Stochaskell.Prelude, Language.Stochaskell
CustomLegendPicLanguage.Stochaskell.Plot
cyanLanguage.Stochaskell.Plot
cycleLanguage.Stochaskell.Prelude, Language.Stochaskell
cycledLanguage.Stochaskell.Plot
dLanguage.Stochaskell
darkblueLanguage.Stochaskell.Plot
darkcyanLanguage.Stochaskell.Plot
darkenLanguage.Stochaskell.Plot
darkgoldenrodLanguage.Stochaskell.Plot
darkgrayLanguage.Stochaskell.Plot
darkgreenLanguage.Stochaskell.Plot
darkgreyLanguage.Stochaskell.Plot
darkkhakiLanguage.Stochaskell.Plot
darkmagentaLanguage.Stochaskell.Plot
darkolivegreenLanguage.Stochaskell.Plot
darkorangeLanguage.Stochaskell.Plot
darkorchidLanguage.Stochaskell.Plot
darkredLanguage.Stochaskell.Plot
darksalmonLanguage.Stochaskell.Plot
darkseagreenLanguage.Stochaskell.Plot
darkslateblueLanguage.Stochaskell.Plot
darkslategrayLanguage.Stochaskell.Plot
darkslategreyLanguage.Stochaskell.Plot
darkturquoiseLanguage.Stochaskell.Plot
darkvioletLanguage.Stochaskell.Plot
dashedLineLanguage.Stochaskell.Plot
daysLanguage.Stochaskell.Plot
debugLanguage.Stochaskell
declareClassyLanguage.Stochaskell.Plot
declareClassyForLanguage.Stochaskell.Plot
declareFieldsLanguage.Stochaskell.Plot
declareLensesLanguage.Stochaskell.Plot
declareLensesForLanguage.Stochaskell.Plot
declareLensesWithLanguage.Stochaskell.Plot
declarePrismsLanguage.Stochaskell.Plot
declareWrappedLanguage.Stochaskell.Plot
decodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
deconstructLanguage.Stochaskell.Expression
deepLanguage.Stochaskell.Plot
deepOfLanguage.Stochaskell.Plot
deeppinkLanguage.Stochaskell.Plot
deepskyblueLanguage.Stochaskell.Plot
defLanguage.Stochaskell.Plot
DefaultLanguage.Stochaskell.Plot
defaultAxisLineStyleLanguage.Stochaskell.Plot
defaultColorSeqLanguage.Stochaskell.Plot
defaultFieldRulesLanguage.Stochaskell.Plot
defaultFloatPlotHistLanguage.Stochaskell.Plot
defaultGridLineStyleLanguage.Stochaskell.Plot
defaultIntAxisLanguage.Stochaskell.Plot
DefaultLegendPicLanguage.Stochaskell.Plot
defaultNormedPlotHistLanguage.Stochaskell.Plot
defaultPlotHistLanguage.Stochaskell.Plot
defaultPlotLineStyleLanguage.Stochaskell.Plot
defaultPyMC3InferenceLanguage.PyMC3
defaultStanMethodLanguage.Stan
defColourBarLanguage.Stochaskell.Plot
defLegendPicLanguage.Stochaskell.Plot
DefNameLanguage.Stochaskell.Plot
deleteLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteAtLanguage.Stochaskell
deleteByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteFirstsByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteIndexLanguage.Stochaskell
delFromALLanguage.Stochaskell
designMatrixLanguage.Stochaskell
detLanguage.Stochaskell
devoidLanguage.Stochaskell.Plot
DExprLanguage.Stochaskell.Expression
diagLanguage.Stochaskell
diamondLanguage.Stochaskell.Plot
dimapLanguage.Stochaskell.Plot
dimappingLanguage.Stochaskell.Plot
dimgrayLanguage.Stochaskell.Plot
dimgreyLanguage.Stochaskell.Plot
displayLanguage.Stochaskell.Plot
dissolveLanguage.Stochaskell.Plot
distribLanguage.Stochaskell.Plot
DistributionLanguage.Stochaskell
divLanguage.Stochaskell.Prelude, Language.Stochaskell
divModLanguage.Stochaskell.Prelude, Language.Stochaskell
dodgerblueLanguage.Stochaskell.Plot
DoubleLanguage.Stochaskell.Prelude, Language.Stochaskell
doubleFromTimeValueLanguage.Stochaskell.Plot
drawLegendLanguage.Stochaskell.Plot
drawPointLanguage.Stochaskell.Plot
drawRectangleLanguage.Stochaskell.Plot
drawTextLanguage.Stochaskell.Plot
drawTextALanguage.Stochaskell.Plot
drawTextRLanguage.Stochaskell.Plot
drawTextsRLanguage.Stochaskell.Plot
drawTitleLanguage.Stochaskell.Plot
dropLanguage.Stochaskell.Prelude, Language.Stochaskell
droppingLanguage.Stochaskell.Plot
droppingWhileLanguage.Stochaskell.Plot
dropWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileEndLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileListLanguage.Stochaskell
Dual 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
DynamicPlot 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
dynamicPlotLanguage.Stochaskell.Plot
dynamicPlotModsLanguage.Stochaskell.Plot
EachLanguage.Stochaskell.Plot
eachLanguage.Stochaskell.Plot
ECLanguage.Stochaskell.Plot
edProgramLanguage.Edward
EEnvLanguage.Stochaskell.Expression
EitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherToMonadErrorLanguage.Stochaskell
elemLanguage.Stochaskell.Prelude, Language.Stochaskell
elementLanguage.Stochaskell.Plot
elementOfLanguage.Stochaskell.Plot
elementsLanguage.Stochaskell.Plot
elementsOfLanguage.Stochaskell.Plot
elemIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndexOfLanguage.Stochaskell.Plot
elemIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndicesOfLanguage.Stochaskell.Plot
elemOfLanguage.Stochaskell.Plot
elemRIndexLanguage.Stochaskell
embedRenderableLanguage.Stochaskell.Plot
EmptyLanguage.Stochaskell.Plot
emptyLanguage.Stochaskell.Plot
emptyGridLineFunctionLanguage.Stochaskell.Plot
emptyRenderableLanguage.Stochaskell.Plot
encodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
EndLanguage.Stochaskell.Plot
Endo 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
endswithLanguage.Stochaskell
EnumLanguage.Stochaskell.Prelude, Language.Stochaskell
enumLanguage.Stochaskell.Plot
enumFromLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenToLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromToLanguage.Stochaskell.Prelude, Language.Stochaskell
EnvLanguage.Stochaskell.Expression
ep_xLanguage.Stochaskell.Plot
ep_yLanguage.Stochaskell.Plot
EQLanguage.Stochaskell.Prelude, Language.Stochaskell
EqLanguage.Stochaskell.Prelude, Language.Stochaskell
EqBLanguage.Stochaskell.Prelude, Language.Stochaskell
EqualityLanguage.Stochaskell.Plot
Equality'Language.Stochaskell.Plot
erLanguage.Stochaskell.Plot
eraseLanguage.Stochaskell.Expression
errorLanguage.Stochaskell.Prelude, Language.Stochaskell
errorWithoutStackTraceLanguage.Stochaskell.Prelude, Language.Stochaskell
ErrPoint 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
ErrValue 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
ethetaLanguage.Stochaskell.Plot
EvalLanguage.Stochaskell.Expression
eval'Language.Stochaskell.Expression
eval_Language.Stochaskell.Expression
evenLanguage.Stochaskell.Prelude, Language.Stochaskell
ev_bestLanguage.Stochaskell.Plot
ev_highLanguage.Stochaskell.Plot
ev_lowLanguage.Stochaskell.Plot
execECLanguage.Stochaskell.Plot
exesLanguage.Stochaskell.Plot
expLanguage.Stochaskell.Prelude, Language.Stochaskell
exponentLanguage.Stochaskell.Prelude, Language.Stochaskell
ExprLanguage.Stochaskell.Expression
Expression 
1 (Type/Class)Language.Stochaskell.Expression, Language.Stochaskell
2 (Data Constructor)Language.Stochaskell.Expression
ExprTupleLanguage.Stochaskell.Expression
ExprTypeLanguage.Stochaskell.Expression
ExtendingLanguage.Stochaskell.Plot
eyeLanguage.Stochaskell
E_BottomLanguage.Stochaskell.Plot
E_LeftLanguage.Stochaskell.Plot
E_RightLanguage.Stochaskell.Plot
E_TopLanguage.Stochaskell.Plot
eθLanguage.Stochaskell.Plot
fadedColoursLanguage.Stochaskell.Plot
failLanguage.Stochaskell.Prelude, Language.Stochaskell
failingLanguage.Stochaskell.Plot
failoverLanguage.Stochaskell.Plot
FalseLanguage.Stochaskell.Prelude, Language.Stochaskell
falseLanguage.Stochaskell.Prelude, Language.Stochaskell
Field1Language.Stochaskell.Plot
Field10Language.Stochaskell.Plot
Field11Language.Stochaskell.Plot
Field12Language.Stochaskell.Plot
Field13Language.Stochaskell.Plot
Field14Language.Stochaskell.Plot
Field15Language.Stochaskell.Plot
Field16Language.Stochaskell.Plot
Field17Language.Stochaskell.Plot
Field18Language.Stochaskell.Plot
Field19Language.Stochaskell.Plot
Field2Language.Stochaskell.Plot
Field3Language.Stochaskell.Plot
Field4Language.Stochaskell.Plot
Field5Language.Stochaskell.Plot
Field6Language.Stochaskell.Plot
Field7Language.Stochaskell.Plot
Field8Language.Stochaskell.Plot
Field9Language.Stochaskell.Plot
FieldNamerLanguage.Stochaskell.Plot
FilePathLanguage.Stochaskell.Prelude, Language.Stochaskell
fillBackgroundLanguage.Stochaskell.Plot
filledCirclesLanguage.Stochaskell.Plot
filledPolygonLanguage.Stochaskell.Plot
fillPathLanguage.Stochaskell.Plot
fillPointPathLanguage.Stochaskell.Plot
FillStyleLanguage.Stochaskell.Plot
FillStyleSolidLanguage.Stochaskell.Plot
fill_colorLanguage.Stochaskell.Plot
filterLanguage.Stochaskell.Prelude, Language.Stochaskell
filteredLanguage.Stochaskell.Plot
filterMLanguage.Stochaskell.Prelude, Language.Stochaskell
finalPlotsLanguage.Stochaskell.Plot
findLanguage.Stochaskell.Prelude, Language.Stochaskell
find'Language.Stochaskell
findIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndexOfLanguage.Stochaskell.Plot
findIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndicesOfLanguage.Stochaskell.Plot
findMOfLanguage.Stochaskell.Plot
findOfLanguage.Stochaskell.Plot
findSortedInsertIndexLanguage.Stochaskell
firebrickLanguage.Stochaskell.Plot
First 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
first1OfLanguage.Stochaskell.Plot
firstingLanguage.Stochaskell.Plot
firstOfLanguage.Stochaskell.Plot
fixedWidthLanguage.Stochaskell
flipLanguage.Stochaskell.Prelude, Language.Stochaskell
flipALLanguage.Stochaskell
flippedLanguage.Stochaskell.Plot
FloatLanguage.Stochaskell.Prelude, Language.Stochaskell
floatDigitsLanguage.Stochaskell.Prelude, Language.Stochaskell
FloatingLanguage.Stochaskell.Prelude, Language.Stochaskell
floatingBarPlotLanguage.Stochaskell.Plot
floatRadixLanguage.Stochaskell.Prelude, Language.Stochaskell
floatRangeLanguage.Stochaskell.Prelude, Language.Stochaskell
floorLanguage.Stochaskell.Prelude, Language.Stochaskell
floralwhiteLanguage.Stochaskell.Plot
fmapLanguage.Stochaskell.Prelude, Language.Stochaskell
Fold 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Fold1Language.Stochaskell.Plot
FoldableLanguage.Stochaskell.Prelude, Language.Stochaskell
FoldableWithIndexLanguage.Stochaskell.Plot
foldByLanguage.Stochaskell.Plot
foldByOfLanguage.Stochaskell.Plot
foldedLanguage.Stochaskell.Plot
folded64Language.Stochaskell.Plot
foldingLanguage.Stochaskell.Plot
foldlLanguage.Stochaskell
foldl'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1Language.Stochaskell.Prelude, Language.Stochaskell
foldl1'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1OfLanguage.Stochaskell.Plot
foldl1Of'Language.Stochaskell.Plot
foldlMOfLanguage.Stochaskell.Plot
foldlOfLanguage.Stochaskell.Plot
foldlOf'Language.Stochaskell.Plot
foldMLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapByLanguage.Stochaskell.Plot
foldMapByOfLanguage.Stochaskell.Plot
foldMapOfLanguage.Stochaskell.Plot
foldM_Language.Stochaskell.Prelude, Language.Stochaskell
foldOfLanguage.Stochaskell.Plot
foldPathLanguage.Stochaskell.Plot
foldrLanguage.Stochaskell
foldr1Language.Stochaskell.Prelude, Language.Stochaskell
foldr1OfLanguage.Stochaskell.Plot
foldr1Of'Language.Stochaskell.Plot
foldringLanguage.Stochaskell.Plot
foldrMOfLanguage.Stochaskell.Plot
foldrOfLanguage.Stochaskell.Plot
foldrOf'Language.Stochaskell.Plot
FontSlantLanguage.Stochaskell.Plot
FontSlantItalicLanguage.Stochaskell.Plot
FontSlantNormalLanguage.Stochaskell.Plot
FontSlantObliqueLanguage.Stochaskell.Plot
FontStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
FontWeightLanguage.Stochaskell.Plot
FontWeightBoldLanguage.Stochaskell.Plot
FontWeightNormalLanguage.Stochaskell.Plot
font_colorLanguage.Stochaskell.Plot
font_nameLanguage.Stochaskell.Plot
font_sizeLanguage.Stochaskell.Plot
font_slantLanguage.Stochaskell.Plot
font_weightLanguage.Stochaskell.Plot
for1Of_Language.Stochaskell.Plot
forceEitherLanguage.Stochaskell
forceEitherMsgLanguage.Stochaskell
forestgreenLanguage.Stochaskell.Plot
foreverLanguage.Stochaskell.Prelude, Language.Stochaskell
forMLanguage.Stochaskell.Prelude, Language.Stochaskell
forMOfLanguage.Stochaskell.Plot
forMOf_Language.Stochaskell.Plot
forM_Language.Stochaskell.Prelude, Language.Stochaskell
forOfLanguage.Stochaskell.Plot
forOf_Language.Stochaskell.Plot
FractionalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLanguage.Stochaskell.Plot
fromConcreteLanguage.Stochaskell.Expression
fromConcreteCLanguage.Stochaskell.Expression
fromConstValsLanguage.Stochaskell.Expression
fromEitherLanguage.Stochaskell
fromEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
fromEqLanguage.Stochaskell.Plot
fromExprTupleLanguage.Stochaskell.Expression
fromIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
fromIntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
fromJustLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLeftLanguage.Stochaskell
fromListLanguage.Stochaskell
fromListNLanguage.Stochaskell
fromMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRightLanguage.Stochaskell
fromRight'Language.Stochaskell
fromValueLanguage.Stochaskell.Plot
fstLanguage.Stochaskell.Prelude, Language.Stochaskell
fuchsiaLanguage.Stochaskell.Plot
fullOverlayOverLanguage.Stochaskell.Plot
fullOverlayUnderLanguage.Stochaskell.Plot
FunctorLanguage.Stochaskell.Prelude, Language.Stochaskell
FunctorWithIndexLanguage.Stochaskell.Plot
fusingLanguage.Stochaskell.Plot
gainsboroLanguage.Stochaskell.Plot
GammaLanguage.Stochaskell
gammaLanguage.Stochaskell
gapLanguage.Stochaskell.Plot
gapDirectionLanguage.Stochaskell.Plot
gcdLanguage.Stochaskell.Prelude, Language.Stochaskell
generateLazyPatternsLanguage.Stochaskell.Plot
generateSignaturesLanguage.Stochaskell.Plot
generateUpdateableOpticsLanguage.Stochaskell.Plot
genericDropLanguage.Stochaskell.Prelude, Language.Stochaskell
genericIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
genericJoinLanguage.Stochaskell
genericLengthLanguage.Stochaskell.Prelude, Language.Stochaskell
genericReplicateLanguage.Stochaskell.Prelude, Language.Stochaskell
genericSplitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
genericTakeLanguage.Stochaskell.Prelude, Language.Stochaskell
GeometricLanguage.Stochaskell
geometricLanguage.Stochaskell
getAllLanguage.Stochaskell.Prelude, Language.Stochaskell
getAltLanguage.Stochaskell.Prelude, Language.Stochaskell
getAnyLanguage.Stochaskell.Prelude, Language.Stochaskell
getCharLanguage.Stochaskell.Prelude, Language.Stochaskell
getConstLanguage.Stochaskell.Plot
getContentsLanguage.Stochaskell.Prelude, Language.Stochaskell
getCoordAlignFnLanguage.Stochaskell.Plot
getDualLanguage.Stochaskell.Prelude, Language.Stochaskell
getFirstLanguage.Stochaskell.Prelude, Language.Stochaskell
getLastLanguage.Stochaskell.Prelude, Language.Stochaskell
getLineLanguage.Stochaskell.Prelude, Language.Stochaskell
getPointAlignFnLanguage.Stochaskell.Plot
getProductLanguage.Stochaskell.Prelude, Language.Stochaskell
getSumLanguage.Stochaskell.Prelude, Language.Stochaskell
Getter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
GettingLanguage.Stochaskell.Plot
gettingLanguage.Stochaskell.Plot
ghostwhiteLanguage.Stochaskell.Plot
goldLanguage.Stochaskell.Plot
goldenrodLanguage.Stochaskell.Plot
gplateLanguage.Stochaskell.Plot
GPlatedLanguage.Stochaskell.Plot
grabLanguage.Stochaskell
gradientColourBarLanguage.Stochaskell.Plot
grayLanguage.Stochaskell.Plot
greenLanguage.Stochaskell.Plot
greenyellowLanguage.Stochaskell.Plot
greyLanguage.Stochaskell.Plot
greysLanguage.Stochaskell.Plot
GridLanguage.Stochaskell.Plot
GridLineFunctionLanguage.Stochaskell.Plot
GridLinesLanguage.Stochaskell.Plot
gridLinesLanguage.Stochaskell.Plot
gridLinesStyleLanguage.Stochaskell.Plot
gridLinesVisibleLanguage.Stochaskell.Plot
gridToRenderableLanguage.Stochaskell.Plot
groupLanguage.Stochaskell.Prelude, Language.Stochaskell
groupByLanguage.Stochaskell.Prelude, Language.Stochaskell
groupedBarsLanguage.Stochaskell.Plot
groupedBars'Language.Stochaskell.Plot
gscatterOptionsLanguage.Stochaskell.Plot
gscatterOptionsForLanguage.Stochaskell.Plot
gscatterPlotLanguage.Stochaskell.Plot
GTLanguage.Stochaskell.Prelude, Language.Stochaskell
guardLanguage.Stochaskell.Prelude, Language.Stochaskell
guardedBLanguage.Stochaskell.Prelude, Language.Stochaskell
HamiltonianMCLanguage.PyMC3
hasLanguage.Stochaskell.Plot
hasAnyLanguage.Stochaskell
HasAxisLabelLanguage.Stochaskell.Plot
HasAxisScalingLanguage.Stochaskell.Plot
HasAxisStyleLanguage.Stochaskell.Plot
HasBarLayoutLanguage.Stochaskell.Plot
HasColourBarLanguage.Stochaskell.Plot
HasConnectingLineLanguage.Stochaskell.Plot
HasGapLanguage.Stochaskell.Plot
HasGridLinesLanguage.Stochaskell.Plot
HasHeatMapLanguage.Stochaskell.Plot
HasHistogramOptionsLanguage.Stochaskell.Plot
hasKeyALLanguage.Stochaskell
HasLegendLanguage.Stochaskell.Plot
HasMajorGridLinesLanguage.Stochaskell.Plot
HasMajorTicksLanguage.Stochaskell.Plot
HasMinorGridLinesLanguage.Stochaskell.Plot
HasMinorTicksLanguage.Stochaskell.Plot
hasn'tLanguage.Stochaskell.Plot
HasOrientationLanguage.Stochaskell.Plot
HasPlacementLanguage.Stochaskell.Plot
HasPlotOptionsLanguage.Stochaskell.Plot
HasPlotStyleLanguage.Stochaskell.Plot
HasRLanguage.Stochaskell.Plot
HasScatterOptionsLanguage.Stochaskell.Plot
HasTickLabelsLanguage.Stochaskell.Plot
HasTicksLanguage.Stochaskell.Plot
HasTitleLanguage.Stochaskell.Plot
HasVisibilityLanguage.Stochaskell.Plot
HasWedgeLanguage.Stochaskell.Plot
HasXLanguage.Stochaskell.Plot
HasYLanguage.Stochaskell.Plot
headLanguage.Stochaskell.Prelude, Language.Stochaskell
heatImageLanguage.Stochaskell.Plot
HeatMapLanguage.Stochaskell.Plot
heatMapLanguage.Stochaskell.Plot
heatMap'Language.Stochaskell.Plot
heatMapCentreLanguage.Stochaskell.Plot
heatMapExtentLanguage.Stochaskell.Plot
heatMapGridStyleLanguage.Stochaskell.Plot
heatMapGridVisibleLanguage.Stochaskell.Plot
heatMapIndexedLanguage.Stochaskell.Plot
heatMapIndexed'Language.Stochaskell.Plot
heatMapLimitsLanguage.Stochaskell.Plot
heatMapOptionsLanguage.Stochaskell.Plot
heatMapRenderLanguage.Stochaskell.Plot
heatMapSizeLanguage.Stochaskell.Plot
heatMapStartLanguage.Stochaskell.Plot
HeatMatrixLanguage.Stochaskell.Plot
heightLanguage.Stochaskell.Plot
hiddenLanguage.Stochaskell.Plot
hideLanguage.Stochaskell.Plot
hideGridLinesLanguage.Stochaskell.Plot
hideTicksLanguage.Stochaskell.Plot
HistogramOptionsLanguage.Stochaskell.Plot
histogramOptionsLanguage.Stochaskell.Plot
HistogramPlotLanguage.Stochaskell.Plot
histogramPlotLanguage.Stochaskell.Plot
histogramPlot'Language.Stochaskell.Plot
histogramPlotOfLanguage.Stochaskell.Plot
histogramPlotOf'Language.Stochaskell.Plot
histToPlotLanguage.Stochaskell.Plot
hlinePlotLanguage.Stochaskell.Plot
hmcEdwardLanguage.Edward
hmcEngineLanguage.Stan
hmcMetricLanguage.Stan
hmcStanLanguage.Stan, Language.Stochaskell
hmcStanInitLanguage.Stan, Language.Stochaskell
hmcStepSizeLanguage.Stan
hmcStepSizeJitterLanguage.Stan
hmPointsLanguage.Stochaskell.Plot
hmSizeLanguage.Stochaskell.Plot
holesLanguage.Stochaskell.Plot
holesOfLanguage.Stochaskell.Plot
holesOnLanguage.Stochaskell.Plot
holesOnOfLanguage.Stochaskell.Plot
hollowCirclesLanguage.Stochaskell.Plot
hollowPolygonLanguage.Stochaskell.Plot
honeydewLanguage.Stochaskell.Plot
HorizontalLanguage.Stochaskell.Plot
horizontalLanguage.Stochaskell.Plot
hotpinkLanguage.Stochaskell.Plot
HTA_CentreLanguage.Stochaskell.Plot
HTA_LeftLanguage.Stochaskell.Plot
HTA_RightLanguage.Stochaskell.Plot
HTextAnchorLanguage.Stochaskell.Plot
iallLanguage.Stochaskell.Plot
iallOfLanguage.Stochaskell.Plot
ianyLanguage.Stochaskell.Plot
ianyOfLanguage.Stochaskell.Plot
iatLanguage.Stochaskell.Plot
icensoringLanguage.Stochaskell.Plot
icomposeLanguage.Stochaskell.Plot
iconcatMapLanguage.Stochaskell.Plot
iconcatMapOfLanguage.Stochaskell.Plot
icontainsLanguage.Stochaskell.Plot
IdLanguage.Stochaskell.Expression
idLanguage.Stochaskell.Prelude, Language.Stochaskell
id'Language.Stochaskell
Identical 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Identity 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
identityLanguage.Stochaskell.Plot
idroppingWhileLanguage.Stochaskell.Plot
ifailoverLanguage.Stochaskell.Plot
IfBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifilteredLanguage.Stochaskell.Plot
ifindLanguage.Stochaskell.Plot
ifindMOfLanguage.Stochaskell.Plot
ifindOfLanguage.Stochaskell.Plot
ifoldedLanguage.Stochaskell.Plot
ifoldingLanguage.Stochaskell.Plot
ifoldlLanguage.Stochaskell.Plot
ifoldl'Language.Stochaskell.Plot
ifoldlMLanguage.Stochaskell.Plot
ifoldlMOfLanguage.Stochaskell.Plot
ifoldlOfLanguage.Stochaskell.Plot
ifoldlOf'Language.Stochaskell.Plot
ifoldMapLanguage.Stochaskell.Plot
ifoldMapByLanguage.Stochaskell.Plot
ifoldMapByOfLanguage.Stochaskell.Plot
ifoldMapOfLanguage.Stochaskell.Plot
ifoldrLanguage.Stochaskell.Plot
ifoldr'Language.Stochaskell.Plot
ifoldringLanguage.Stochaskell.Plot
ifoldrMLanguage.Stochaskell.Plot
ifoldrMOfLanguage.Stochaskell.Plot
ifoldrOfLanguage.Stochaskell.Plot
ifoldrOf'Language.Stochaskell.Plot
iforLanguage.Stochaskell.Plot
iforMLanguage.Stochaskell.Plot
iforMOfLanguage.Stochaskell.Plot
iforMOf_Language.Stochaskell.Plot
iforM_Language.Stochaskell.Plot
iforOfLanguage.Stochaskell.Plot
iforOf_Language.Stochaskell.Plot
ifor_Language.Stochaskell.Plot
ifThenElseLanguage.Stochaskell.Prelude, Language.Stochaskell
ignoredLanguage.Stochaskell.Plot
iixLanguage.Stochaskell.Plot
ilensLanguage.Stochaskell.Plot
ilevelsLanguage.Stochaskell.Plot
ilikeLanguage.Stochaskell.Plot
ilisteningLanguage.Stochaskell.Plot
ilisteningsLanguage.Stochaskell.Plot
ilociLanguage.Stochaskell.Plot
imagmaLanguage.Stochaskell.Plot
imapLanguage.Stochaskell.Plot
imapAccumLLanguage.Stochaskell.Plot
imapAccumLOfLanguage.Stochaskell.Plot
imapAccumRLanguage.Stochaskell.Plot
imapAccumROfLanguage.Stochaskell.Plot
imapMLanguage.Stochaskell.Plot
imapMOfLanguage.Stochaskell.Plot
imapMOf_Language.Stochaskell.Plot
imapM_Language.Stochaskell.Plot
imapOfLanguage.Stochaskell.Plot
imappedLanguage.Stochaskell.Plot
imodifyingLanguage.Stochaskell.Plot
IndexLanguage.Stochaskell.Plot
indexLanguage.Stochaskell.Plot
Indexable 
1 (Type/Class)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell
Indexed 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
indexedLanguage.Stochaskell.Plot
IndexedFold 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedFold1Language.Stochaskell.Plot
IndexedGetter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedGettingLanguage.Stochaskell.Plot
IndexedLens 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedLens'Language.Stochaskell.Plot
IndexedLensLikeLanguage.Stochaskell.Plot
IndexedLensLike'Language.Stochaskell.Plot
IndexedSetter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedSetter'Language.Stochaskell.Plot
IndexedTraversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedTraversal'Language.Stochaskell.Plot
IndexedTraversal1Language.Stochaskell.Plot
IndexedTraversal1'Language.Stochaskell.Plot
indexingLanguage.Stochaskell.Plot
indexing64Language.Stochaskell.Plot
IndexPreservingFoldLanguage.Stochaskell.Plot
IndexPreservingFold1Language.Stochaskell.Plot
IndexPreservingGetterLanguage.Stochaskell.Plot
IndexPreservingLensLanguage.Stochaskell.Plot
IndexPreservingLens'Language.Stochaskell.Plot
IndexPreservingSetterLanguage.Stochaskell.Plot
IndexPreservingSetter'Language.Stochaskell.Plot
IndexPreservingTraversalLanguage.Stochaskell.Plot
IndexPreservingTraversal'Language.Stochaskell.Plot
IndexPreservingTraversal1Language.Stochaskell.Plot
IndexPreservingTraversal1'Language.Stochaskell.Plot
indianredLanguage.Stochaskell.Plot
indicesLanguage.Stochaskell.Plot
indigoLanguage.Stochaskell.Plot
infernoLanguage.Stochaskell.Plot
infinityLanguage.Stochaskell
initLanguage.Stochaskell.Prelude, Language.Stochaskell
initsLanguage.Stochaskell.Prelude, Language.Stochaskell
InnerProductLanguage.Stochaskell
inoneLanguage.Stochaskell.Plot
inoneOfLanguage.Stochaskell.Plot
insertLanguage.Stochaskell.Prelude, Language.Stochaskell
insertAtLanguage.Stochaskell
insertByLanguage.Stochaskell.Prelude, Language.Stochaskell
insertIndexLanguage.Stochaskell
insideLanguage.Stochaskell.Plot
InsideAxisLabelLanguage.Stochaskell.Plot
insideTicksLanguage.Stochaskell.Plot
IntLanguage.Stochaskell.Prelude, Language.Stochaskell
IntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
integerLanguage.Stochaskell
IntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
interactLanguage.Stochaskell.Prelude, Language.Stochaskell
intercalateLanguage.Stochaskell.Prelude, Language.Stochaskell
interpolateLanguage.Stochaskell
interpPolarLanguage.Stochaskell.Plot
intersectLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectByLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectRectLanguage.Stochaskell.Plot
intersperseLanguage.Stochaskell.Prelude, Language.Stochaskell
IntervalLanguage.Stochaskell
IntTLanguage.Stochaskell.Expression
intTimeLanguage.Stan
invLanguage.Stochaskell
invertLanguage.Stochaskell.Plot
InvGammaLanguage.Stochaskell
invGammaLanguage.Stochaskell
invLinMapLanguage.Stochaskell.Plot
invmapLanguage.Stochaskell.Plot
involutedLanguage.Stochaskell.Plot
IOLanguage.Stochaskell.Prelude, Language.Stochaskell
IOErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioverLanguage.Stochaskell.Plot
ipartsOfLanguage.Stochaskell.Plot
ipartsOf'Language.Stochaskell.Plot
ipassingLanguage.Stochaskell.Plot
iplensLanguage.Stochaskell.Plot
ipreLanguage.Stochaskell.Plot
ipreuseLanguage.Stochaskell.Plot
ipreusesLanguage.Stochaskell.Plot
ipreviewLanguage.Stochaskell.Plot
ipreviewsLanguage.Stochaskell.Plot
isDenormalizedLanguage.Stochaskell.Prelude, Language.Stochaskell
isetLanguage.Stochaskell.Plot
isetsLanguage.Stochaskell.Plot
isIEEELanguage.Stochaskell.Prelude, Language.Stochaskell
isInfiniteLanguage.Stochaskell.Prelude, Language.Stochaskell
isInfixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isJustLanguage.Stochaskell.Prelude, Language.Stochaskell
IsListLanguage.Stochaskell
isn'tLanguage.Stochaskell.Plot
isNaNLanguage.Stochaskell.Prelude, Language.Stochaskell
isNegativeZeroLanguage.Stochaskell.Prelude, Language.Stochaskell
isNothingLanguage.Stochaskell.Prelude, Language.Stochaskell
Iso 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
isoLanguage.Stochaskell.Plot
Iso'Language.Stochaskell.Plot
isPrefixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSubsequenceOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSuffixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
itakingWhileLanguage.Stochaskell.Plot
ItemLanguage.Stochaskell
iterateLanguage.Stochaskell.Prelude, Language.Stochaskell
iterate'Language.Stochaskell.Prelude, Language.Stochaskell
iteratedLanguage.Stochaskell.Plot
iterateLimitLanguage.Stochaskell
itoLanguage.Stochaskell.Plot
itoListLanguage.Stochaskell.Plot
itoListOfLanguage.Stochaskell.Plot
itraverseLanguage.Stochaskell.Plot
itraverseByLanguage.Stochaskell.Plot
itraverseByOfLanguage.Stochaskell.Plot
itraversedLanguage.Stochaskell.Plot
itraverseOfLanguage.Stochaskell.Plot
itraverseOf_Language.Stochaskell.Plot
itraverse_Language.Stochaskell.Plot
iunsafePartsOfLanguage.Stochaskell.Plot
iunsafePartsOf'Language.Stochaskell.Plot
iuseLanguage.Stochaskell.Plot
iusesLanguage.Stochaskell.Plot
iviewLanguage.Stochaskell.Plot
iviewsLanguage.Stochaskell.Plot
ivoryLanguage.Stochaskell.Plot
ixLanguage.Stochaskell.Plot
ixAtLanguage.Stochaskell.Plot
ixColourLanguage.Stochaskell.Plot
IxedLanguage.Stochaskell.Plot
IxValueLanguage.Stochaskell.Plot
joinLanguage.Stochaskell.Prelude, Language.Stochaskell
joinPlotLanguage.Stochaskell.Plot
JointLanguage.Stochaskell
jointLanguage.Stochaskell
JustLanguage.Stochaskell.Prelude, Language.Stochaskell
kdeLanguage.Stochaskell.Plot
kdeplotLanguage.Stochaskell.Plot
keyLanguage.Stochaskell.Plot
keysALLanguage.Stochaskell
khakiLanguage.Stochaskell.Plot
labelLanguage.Stochaskell.Plot
labelBarsLanguage.Stochaskell.Plot
Last 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
lastLanguage.Stochaskell.Prelude, Language.Stochaskell
last1OfLanguage.Stochaskell.Plot
lastOfLanguage.Stochaskell.Plot
lavenderLanguage.Stochaskell.Plot
lavenderblushLanguage.Stochaskell.Plot
lawngreenLanguage.Stochaskell.Plot
laxis_generateLanguage.Stochaskell.Plot
laxis_overrideLanguage.Stochaskell.Plot
laxis_reverseLanguage.Stochaskell.Plot
laxis_styleLanguage.Stochaskell.Plot
laxis_titleLanguage.Stochaskell.Plot
laxis_title_styleLanguage.Stochaskell.Plot
Layout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
LayoutAxis 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
LayoutLR 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
layoutLRToGridLanguage.Stochaskell.Plot
layoutLRToRenderableLanguage.Stochaskell.Plot
layoutlr_all_font_stylesLanguage.Stochaskell.Plot
layoutlr_axes_stylesLanguage.Stochaskell.Plot
layoutlr_axes_title_stylesLanguage.Stochaskell.Plot
layoutlr_backgroundLanguage.Stochaskell.Plot
layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_foregroundLanguage.Stochaskell.Plot
layoutlr_grid_lastLanguage.Stochaskell.Plot
layoutlr_left_axisLanguage.Stochaskell.Plot
layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_legendLanguage.Stochaskell.Plot
layoutlr_marginLanguage.Stochaskell.Plot
layoutlr_plotsLanguage.Stochaskell.Plot
layoutlr_plot_backgroundLanguage.Stochaskell.Plot
layoutlr_right_axisLanguage.Stochaskell.Plot
layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_titleLanguage.Stochaskell.Plot
layoutlr_title_styleLanguage.Stochaskell.Plot
layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_x_axisLanguage.Stochaskell.Plot
LayoutPickLanguage.Stochaskell.Plot
LayoutPick_LegendLanguage.Stochaskell.Plot
LayoutPick_PlotAreaLanguage.Stochaskell.Plot
LayoutPick_TitleLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisTitleLanguage.Stochaskell.Plot
LayoutPick_XTopAxisLanguage.Stochaskell.Plot
LayoutPick_XTopAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YRightAxisLanguage.Stochaskell.Plot
LayoutPick_YRightAxisTitleLanguage.Stochaskell.Plot
layoutToGridLanguage.Stochaskell.Plot
layoutToRenderableLanguage.Stochaskell.Plot
layout_all_font_stylesLanguage.Stochaskell.Plot
layout_axes_stylesLanguage.Stochaskell.Plot
layout_axes_title_stylesLanguage.Stochaskell.Plot
layout_backgroundLanguage.Stochaskell.Plot
layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
layout_foregroundLanguage.Stochaskell.Plot
layout_grid_lastLanguage.Stochaskell.Plot
layout_left_axis_visibilityLanguage.Stochaskell.Plot
layout_legendLanguage.Stochaskell.Plot
layout_marginLanguage.Stochaskell.Plot
layout_plotsLanguage.Stochaskell.Plot
layout_plot_backgroundLanguage.Stochaskell.Plot
layout_right_axis_visibilityLanguage.Stochaskell.Plot
layout_titleLanguage.Stochaskell.Plot
layout_title_styleLanguage.Stochaskell.Plot
layout_top_axis_visibilityLanguage.Stochaskell.Plot
layout_x_axisLanguage.Stochaskell.Plot
layout_y_axisLanguage.Stochaskell.Plot
LazyLanguage.Stochaskell.Plot
lazyLanguage.Stochaskell.Plot
la_labelfLanguage.Stochaskell.Plot
la_nLabelsLanguage.Stochaskell.Plot
la_nTicksLanguage.Stochaskell.Plot
lcmLanguage.Stochaskell.Prelude, Language.Stochaskell
LeftLanguage.Stochaskell.Prelude, Language.Stochaskell
leftLanguage.Stochaskell.Plot
left'Language.Stochaskell.Plot
leftAboveLanguage.Stochaskell.Plot
leftBelowLanguage.Stochaskell.Plot
leftBottomLanguage.Stochaskell.Plot
leftMidLanguage.Stochaskell.Plot
LeftmostLanguage.Stochaskell.Plot
leftTopLanguage.Stochaskell.Plot
legendLanguage.Stochaskell.Plot
LegendAboveLanguage.Stochaskell.Plot
LegendBelowLanguage.Stochaskell.Plot
legendEntriesLanguage.Stochaskell.Plot
LegendEntryLanguage.Stochaskell.Plot
legendGapLanguage.Stochaskell.Plot
LegendLeftLanguage.Stochaskell.Plot
LegendOrientationLanguage.Stochaskell.Plot
legendOrientationLanguage.Stochaskell.Plot
LegendPicLanguage.Stochaskell.Plot
legendPictureLanguage.Stochaskell.Plot
legendPlacementLanguage.Stochaskell.Plot
LegendPositionLanguage.Stochaskell.Plot
legendPrecedenceLanguage.Stochaskell.Plot
LegendRightLanguage.Stochaskell.Plot
legendSpacingLanguage.Stochaskell.Plot
LegendStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
legendStyleLanguage.Stochaskell.Plot
legendTextLanguage.Stochaskell.Plot
legendTextFunctionLanguage.Stochaskell.Plot
legendTextStyleLanguage.Stochaskell.Plot
legendTextWidthLanguage.Stochaskell.Plot
legendToRenderableLanguage.Stochaskell.Plot
legend_label_styleLanguage.Stochaskell.Plot
legend_marginLanguage.Stochaskell.Plot
legend_orientationLanguage.Stochaskell.Plot
legend_plot_sizeLanguage.Stochaskell.Plot
legend_positionLanguage.Stochaskell.Plot
lemonchiffonLanguage.Stochaskell.Plot
lengthLanguage.Stochaskell.Prelude, Language.Stochaskell
lengthOfLanguage.Stochaskell.Plot
Lens 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lensLanguage.Stochaskell.Plot
Lens'Language.Stochaskell.Plot
lensClassLanguage.Stochaskell.Plot
lensFieldLanguage.Stochaskell.Plot
LensLikeLanguage.Stochaskell.Plot
LensLike'Language.Stochaskell.Plot
LensRulesLanguage.Stochaskell.Plot
lensRulesLanguage.Stochaskell.Plot
lensRulesForLanguage.Stochaskell.Plot
LevelLanguage.Stochaskell.Plot
levelsLanguage.Stochaskell.Plot
lexLanguage.Stochaskell.Prelude, Language.Stochaskell
liftCStateLanguage.Stochaskell.Plot
liftECLanguage.Stochaskell.Plot
liftedLanguage.Stochaskell.Plot
liftMLanguage.Stochaskell.Prelude, Language.Stochaskell
liftM2Language.Stochaskell.Prelude, Language.Stochaskell
liftM3Language.Stochaskell.Prelude, Language.Stochaskell
liftM4Language.Stochaskell.Prelude, Language.Stochaskell
liftM5Language.Stochaskell.Prelude, Language.Stochaskell
lightblueLanguage.Stochaskell.Plot
lightcoralLanguage.Stochaskell.Plot
lightcyanLanguage.Stochaskell.Plot
lightgoldenrodyellowLanguage.Stochaskell.Plot
lightgrayLanguage.Stochaskell.Plot
lightgreenLanguage.Stochaskell.Plot
lightgreyLanguage.Stochaskell.Plot
lightpinkLanguage.Stochaskell.Plot
lightsalmonLanguage.Stochaskell.Plot
lightseagreenLanguage.Stochaskell.Plot
lightskyblueLanguage.Stochaskell.Plot
lightslategrayLanguage.Stochaskell.Plot
lightslategreyLanguage.Stochaskell.Plot
lightsteelblueLanguage.Stochaskell.Plot
lightyellowLanguage.Stochaskell.Plot
likeLanguage.Stochaskell.Plot
limeLanguage.Stochaskell.Plot
limegreenLanguage.Stochaskell.Plot
LimitLanguage.Stochaskell.Plot
lineLanguage.Stochaskell.Plot
LinearAxisLanguage.Stochaskell.Plot
LinearAxisParams 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
linearMajorTicksLanguage.Stochaskell.Plot
LinearOperatorLanguage.Stochaskell
LineCapLanguage.Stochaskell.Plot
LineCapButtLanguage.Stochaskell.Plot
LineCapRoundLanguage.Stochaskell.Plot
LineCapSquareLanguage.Stochaskell.Plot
linedLanguage.Stochaskell.Plot
LineJoinLanguage.Stochaskell.Plot
LineJoinBevelLanguage.Stochaskell.Plot
LineJoinMiterLanguage.Stochaskell.Plot
LineJoinRoundLanguage.Stochaskell.Plot
lineMarkersLanguage.Stochaskell.Plot
linenLanguage.Stochaskell.Plot
linePlotLanguage.Stochaskell.Plot
linePlot'Language.Stochaskell.Plot
linesLanguage.Stochaskell.Prelude, Language.Stochaskell
LineStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lineStyleLanguage.Stochaskell.Plot
lineStyleFunctionLanguage.Stochaskell.Plot
LineToLanguage.Stochaskell.Plot
lineToLanguage.Stochaskell.Plot
lineTo'Language.Stochaskell.Plot
line_capLanguage.Stochaskell.Plot
line_colorLanguage.Stochaskell.Plot
line_dashesLanguage.Stochaskell.Plot
line_joinLanguage.Stochaskell.Plot
line_widthLanguage.Stochaskell.Plot
linMapLanguage.Stochaskell.Plot
linspaceLanguage.Stochaskell
ListLanguage.Stochaskell.Plot
listLanguage.Stochaskell
listeningLanguage.Stochaskell.Plot
listeningsLanguage.Stochaskell.Plot
listToMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
LKJLanguage.Stochaskell
lmapLanguage.Stochaskell.Plot
lmappingLanguage.Stochaskell.Plot
LMaxLanguage.Stochaskell.Plot
LMinLanguage.Stochaskell.Plot
lociLanguage.Stochaskell.Plot
LOColsLanguage.Stochaskell.Plot
locusLanguage.Stochaskell.Plot
logLanguage.Stochaskell.Prelude, Language.Stochaskell
LogAxisLanguage.Stochaskell.Plot
LogAxisParams 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
loga_labelfLanguage.Stochaskell.Plot
logBaseLanguage.Stochaskell.Prelude, Language.Stochaskell
logDeformLanguage.Stochaskell.Plot
logDetLanguage.Stochaskell
logMajorTicksLanguage.Stochaskell.Plot
lognormalLanguage.Stochaskell
logNumberLanguage.Stochaskell.Plot
logPointLanguage.Stochaskell.Plot
LogScaleLanguage.Stochaskell.Plot
logScaleLanguage.Stochaskell.Plot
LogValue 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lookingupNamerLanguage.Stochaskell.Plot
lookupLanguage.Stochaskell.Prelude, Language.Stochaskell
lookupOfLanguage.Stochaskell.Plot
loopLanguage.Stochaskell
LORowsLanguage.Stochaskell.Plot
LowerAxisLabelLanguage.Stochaskell.Plot
lpdfLanguage.Stochaskell
lpdfAuxLanguage.Stochaskell
lpdfDiscreteUniformLanguage.Stochaskell
lpdfGammaLanguage.Stochaskell
lpdfNegBinomialLanguage.Stochaskell
lpdfNormalLanguage.Stochaskell
lpdfPoissonLanguage.Stochaskell
lpdfUniformLanguage.Stochaskell
LTLanguage.Stochaskell.Prelude, Language.Stochaskell
LValLanguage.Stochaskell.Expression
LValueLanguage.Stochaskell.Plot
LVarLanguage.Stochaskell.Expression
magentaLanguage.Stochaskell.Plot
MagmaLanguage.Stochaskell.Plot
MagnifiedLanguage.Stochaskell.Plot
MagnifyLanguage.Stochaskell.Plot
magnifyLanguage.Stochaskell.Plot
MajorGridLinesLanguage.Stochaskell.Plot
majorGridLinesLanguage.Stochaskell.Plot
majorGridLinesFunctionLanguage.Stochaskell.Plot
majorGridLinesStyleLanguage.Stochaskell.Plot
majorTickPositionsLanguage.Stochaskell.Plot
MajorTicksLanguage.Stochaskell.Plot
majorTicksLanguage.Stochaskell.Plot
majorTicksAlignmentLanguage.Stochaskell.Plot
majorTicksFunctionLanguage.Stochaskell.Plot
majorTicksHelperLanguage.Stochaskell.Plot
majorTicksLengthLanguage.Stochaskell.Plot
majorTicksStyleLanguage.Stochaskell.Plot
makeAxisLanguage.Stochaskell.Plot
makeAxis'Language.Stochaskell.Plot
makeClassyLanguage.Stochaskell.Plot
makeClassyForLanguage.Stochaskell.Plot
makeClassyPrismsLanguage.Stochaskell.Plot
makeClassy_Language.Stochaskell.Plot
makeFieldsLanguage.Stochaskell.Plot
makeFieldsNoPrefixLanguage.Stochaskell.Plot
makeLensesLanguage.Stochaskell.Plot
makeLensesForLanguage.Stochaskell.Plot
makeLensesWithLanguage.Stochaskell.Plot
makeLinesExplicitLanguage.Stochaskell.Plot
makePrismsLanguage.Stochaskell.Plot
makeWrappedLanguage.Stochaskell.Plot
mapLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLOfLanguage.Stochaskell.Plot
mapAccumRLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumROfLanguage.Stochaskell.Plot
mapAndUnzipMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapEqLanguage.Stochaskell.Plot
mapMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybePickFnLanguage.Stochaskell.Plot
mapMOfLanguage.Stochaskell.Plot
mapMOf_Language.Stochaskell.Plot
mapM_Language.Stochaskell.Prelude, Language.Stochaskell
mapOfLanguage.Stochaskell.Plot
mappedLanguage.Stochaskell.Plot
mappendLanguage.Stochaskell.Prelude, Language.Stochaskell
mapPickFnLanguage.Stochaskell.Plot
mappingLanguage.Stochaskell.Plot
mappingNamerLanguage.Stochaskell.Plot
mapXYLanguage.Stochaskell.Plot
markerStyleLanguage.Stochaskell.Plot
markerStyleFunctionLanguage.Stochaskell.Plot
maroonLanguage.Stochaskell.Plot
matchingLanguage.Stochaskell.Plot
Matrix 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
3 (Type/Class)Language.Stochaskell
matrixLanguage.Stochaskell
matrixColsLanguage.Stochaskell
matrixRowsLanguage.Stochaskell
matTLanguage.Stochaskell.Expression
maxLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
maxDepthLanguage.Stan
maximumLanguage.Stochaskell.Prelude, Language.Stochaskell
maximum1OfLanguage.Stochaskell.Plot
maximumByLanguage.Stochaskell.Prelude, Language.Stochaskell
maximumByOfLanguage.Stochaskell.Plot
maximumOfLanguage.Stochaskell.Plot
MAxisFnLanguage.Stochaskell.Plot
MaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeToEitherLanguage.Stochaskell
maybeToListLanguage.Stochaskell.Prelude, Language.Stochaskell
mconcatLanguage.Stochaskell.Prelude, Language.Stochaskell
meanLanguage.Stochaskell
mediumaquamarineLanguage.Stochaskell.Plot
mediumblueLanguage.Stochaskell.Plot
mediumorchidLanguage.Stochaskell.Plot
mediumpurpleLanguage.Stochaskell.Plot
mediumseagreenLanguage.Stochaskell.Plot
mediumslateblueLanguage.Stochaskell.Plot
mediumspringgreenLanguage.Stochaskell.Plot
mediumturquoiseLanguage.Stochaskell.Plot
mediumvioletredLanguage.Stochaskell.Plot
memptyLanguage.Stochaskell.Prelude, Language.Stochaskell
mergeLanguage.Stochaskell
mergeByLanguage.Stochaskell
MethodNameLanguage.Stochaskell.Plot
MetropolisLanguage.PyMC3
mfilterLanguage.Stochaskell.Prelude, Language.Stochaskell
mhLanguage.Stochaskell
mh'Language.Stochaskell
mhChurchLanguage.Church
mhRatioLanguage.Stochaskell
midAboveLanguage.Stochaskell.Plot
midBelowLanguage.Stochaskell.Plot
MiddleAxisLabelLanguage.Stochaskell.Plot
midnightblueLanguage.Stochaskell.Plot
minLanguage.Stochaskell.Prelude, Language.Stochaskell
min'Language.Stochaskell
minBLanguage.Stochaskell.Prelude, Language.Stochaskell
minBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumLanguage.Stochaskell.Prelude, Language.Stochaskell
minimum1OfLanguage.Stochaskell.Plot
minimumByLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumByOfLanguage.Stochaskell.Plot
minimumOfLanguage.Stochaskell.Plot
MinorGridLinesLanguage.Stochaskell.Plot
minorGridLinesLanguage.Stochaskell.Plot
minorGridLinesFunctionLanguage.Stochaskell.Plot
minorGridLinesStyleLanguage.Stochaskell.Plot
minorTickPositionsLanguage.Stochaskell.Plot
MinorTicksLanguage.Stochaskell.Plot
minorTicksLanguage.Stochaskell.Plot
minorTicksAlignmentLanguage.Stochaskell.Plot
minorTicksFunctionLanguage.Stochaskell.Plot
minorTicksHelperLanguage.Stochaskell.Plot
minorTicksLengthLanguage.Stochaskell.Plot
minorTicksStyleLanguage.Stochaskell.Plot
minsizeLanguage.Stochaskell.Plot
mintcreamLanguage.Stochaskell.Plot
mistyroseLanguage.Stochaskell.Plot
mixtureLanguage.Stochaskell
mixture'Language.Stochaskell
mkBarsLanguage.Stochaskell.Plot
mkComputedHistogramLanguage.Stochaskell.Plot
mkFloatingBarsLanguage.Stochaskell.Plot
mkGroupedBarsLanguage.Stochaskell.Plot
mkHeatMapLanguage.Stochaskell.Plot
mkHeatMatrixLanguage.Stochaskell.Plot
mkHeatMatrix'Language.Stochaskell.Plot
mkHistogramPlotLanguage.Stochaskell.Plot
mkLegendEntryLanguage.Stochaskell.Plot
mkPathLanguage.Stochaskell.Plot
mkPathOfLanguage.Stochaskell.Plot
mkPlotLanguage.Stochaskell.Plot
mkPolarLanguage.Stochaskell.Plot
mkrectLanguage.Stochaskell.Plot
mkRunningBarsLanguage.Stochaskell.Plot
mkScatterOptionsLanguage.Stochaskell.Plot
mkStackedBarsLanguage.Stochaskell.Plot
mkStackedEqualBarsLanguage.Stochaskell.Plot
mkTrailLanguage.Stochaskell.Plot
mkTrailOfLanguage.Stochaskell.Plot
mkWedgeLanguage.Stochaskell.Plot
moccasinLanguage.Stochaskell.Plot
modLanguage.Stochaskell.Prelude, Language.Stochaskell
modifyingLanguage.Stochaskell.Plot
MonadLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadGuardLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadPlusLanguage.Stochaskell.Prelude, Language.Stochaskell
MonoidLanguage.Stochaskell.Prelude, Language.Stochaskell
monthsLanguage.Stochaskell.Plot
MoveToLanguage.Stochaskell.Plot
moveToLanguage.Stochaskell.Plot
moveTo'Language.Stochaskell.Plot
mplusLanguage.Stochaskell.Prelude, Language.Stochaskell
msumLanguage.Stochaskell.Prelude, Language.Stochaskell
msumOfLanguage.Stochaskell.Plot
multiBarsLanguage.Stochaskell.Plot
MultiBarStateLanguage.Stochaskell.Plot
mzeroLanguage.Stochaskell.Prelude, Language.Stochaskell
namedBarPlotLanguage.Stochaskell.Plot
namedBarPlot'Language.Stochaskell.Plot
navajowhiteLanguage.Stochaskell.Plot
navyLanguage.Stochaskell.Plot
nearlyLanguage.Stochaskell.Plot
negateLanguage.Stochaskell.Prelude, Language.Stochaskell
negativeInfinityLanguage.Stochaskell
NegBinomialLanguage.Stochaskell
negBinomialLanguage.Stochaskell
NodeRefLanguage.Stochaskell.Expression
noExtendLanguage.Stochaskell.Plot
nonLanguage.Stochaskell.Plot
non'Language.Stochaskell.Plot
noneLanguage.Stochaskell.Plot
noneOfLanguage.Stochaskell.Plot
NormalLanguage.Stochaskell
normalLanguage.Stochaskell
normalCholLanguage.Stochaskell
normalCondLanguage.Stochaskell
NormalisationMethodLanguage.Stochaskell.Plot
normaliseSampleLanguage.Stochaskell.Plot
NormalsLanguage.Stochaskell
normalsLanguage.Stochaskell
normalsCholLanguage.Stochaskell
NoScaleLanguage.Stochaskell.Plot
notLanguage.Stochaskell.Prelude, Language.Stochaskell
notANumberLanguage.Stochaskell
notBLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemOfLanguage.Stochaskell.Plot
NothingLanguage.Stochaskell.Prelude, Language.Stochaskell
notNullOfLanguage.Stochaskell.Plot
nubLanguage.Stochaskell.Prelude, Language.Stochaskell
nubByLanguage.Stochaskell.Prelude, Language.Stochaskell
nullLanguage.Stochaskell.Prelude, Language.Stochaskell
nullOfLanguage.Stochaskell.Plot
nullPickFnLanguage.Stochaskell.Plot
nulltLanguage.Stochaskell.Plot
NumLanguage.Stochaskell.Prelude, Language.Stochaskell
numBinsLanguage.Stochaskell.Plot
numSamplesLanguage.Stan
numWarmupLanguage.Stan
NUTSLanguage.PyMC3
oddLanguage.Stochaskell.Prelude, Language.Stochaskell
oldlaceLanguage.Stochaskell.Plot
oliveLanguage.Stochaskell.Plot
olivedrabLanguage.Stochaskell.Plot
onBarsLanguage.Stochaskell.Plot
onlyLanguage.Stochaskell.Plot
onTicksGridLineFunctionLanguage.Stochaskell.Plot
onWedgesLanguage.Stochaskell.Plot
opLanguage.Stochaskell.Plot
opaqueLanguage.Stochaskell.Plot
OpticLanguage.Stochaskell.Plot
Optic'Language.Stochaskell.Plot
OpticalLanguage.Stochaskell.Plot
Optical'Language.Stochaskell.Plot
orLanguage.Stochaskell.Prelude, Language.Stochaskell
orangeLanguage.Stochaskell.Plot
orangeredLanguage.Stochaskell.Plot
orchidLanguage.Stochaskell.Plot
OrdLanguage.Stochaskell.Prelude, Language.Stochaskell
OrdBLanguage.Stochaskell.Prelude, Language.Stochaskell
OrderedSampleLanguage.Stochaskell
orderedSampleLanguage.Stochaskell
OrderingLanguage.Stochaskell.Prelude, Language.Stochaskell
orientLanguage.Stochaskell.Plot
OrientationLanguage.Stochaskell.Plot
orientationLanguage.Stochaskell.Plot
orOfLanguage.Stochaskell.Plot
otherwiseLanguage.Stochaskell.Prelude, Language.Stochaskell
outerLanguage.Stochaskell
outsideLanguage.Stochaskell.Plot
OutsideAxisLabelLanguage.Stochaskell.Plot
outsideTicksLanguage.Stochaskell.Plot
OverLanguage.Stochaskell.Plot
overLanguage.Stochaskell.Plot
Over'Language.Stochaskell.Plot
overALanguage.Stochaskell.Plot
overlayLanguage.Stochaskell.Plot
PLanguage.Stochaskell
palegoldenrodLanguage.Stochaskell.Plot
palegreenLanguage.Stochaskell.Plot
paleturquoiseLanguage.Stochaskell.Plot
palevioletredLanguage.Stochaskell.Plot
pAnchorLanguage.Stochaskell.Plot
papayawhipLanguage.Stochaskell.Plot
paraLanguage.Stochaskell.Plot
paraOfLanguage.Stochaskell.Plot
partitionLanguage.Stochaskell.Prelude, Language.Stochaskell
partsLanguage.Stochaskell.Plot
partsOfLanguage.Stochaskell.Plot
partsOf'Language.Stochaskell.Plot
passingLanguage.Stochaskell.Plot
pAtLanguage.Stochaskell.Plot
PathLanguage.Stochaskell.Plot
pathColourBarLanguage.Stochaskell.Plot
pathHeatRenderLanguage.Stochaskell.Plot
pathLengthLanguage.PyMC3
pathPlotLanguage.Stochaskell.Plot
pathPlot'Language.Stochaskell.Plot
pdfLanguage.Stochaskell.Plot
peachpuffLanguage.Stochaskell.Plot
Percent 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
permutationsLanguage.Stochaskell.Prelude, Language.Stochaskell
peruLanguage.Stochaskell.Plot
pGapDirLanguage.Stochaskell.Plot
piLanguage.Stochaskell.Prelude, Language.Stochaskell
PickFnLanguage.Stochaskell.Plot
PieChart 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
pieChartToRenderableLanguage.Stochaskell.Plot
PieItem 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PieLayout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
piePlotLanguage.Stochaskell.Plot
piePlot'Language.Stochaskell.Plot
PieStateLanguage.Stochaskell.Plot
pieToRenderableLanguage.Stochaskell.Plot
pieWedgeLanguage.Stochaskell.Plot
pie_backgroundLanguage.Stochaskell.Plot
pie_colorsLanguage.Stochaskell.Plot
pie_dataLanguage.Stochaskell.Plot
pie_label_line_styleLanguage.Stochaskell.Plot
pie_label_styleLanguage.Stochaskell.Plot
pie_marginLanguage.Stochaskell.Plot
pie_plotLanguage.Stochaskell.Plot
pie_start_angleLanguage.Stochaskell.Plot
pie_titleLanguage.Stochaskell.Plot
pie_title_styleLanguage.Stochaskell.Plot
pinkLanguage.Stochaskell.Plot
pitem_labelLanguage.Stochaskell.Plot
pitem_offsetLanguage.Stochaskell.Plot
pitem_valueLanguage.Stochaskell.Plot
pixelHeatRenderLanguage.Stochaskell.Plot
pixelHeatRender'Language.Stochaskell.Plot
placeAgainstLanguage.Stochaskell.Plot
Placement 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
placementLanguage.Stochaskell.Plot
placementAnchorLanguage.Stochaskell.Plot
placementAtLanguage.Stochaskell.Plot
plasmaLanguage.Stochaskell.Plot
plateLanguage.Stochaskell.Plot
PlatedLanguage.Stochaskell.Plot
plotLanguage.Stochaskell.Plot
PlotableLanguage.Stochaskell.Plot
PlotAnnotation 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotBars 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotBarsLanguage.Stochaskell.Plot
PlotBarsAlignmentLanguage.Stochaskell.Plot
PlotBarsSpacingLanguage.Stochaskell.Plot
PlotBarsStyleLanguage.Stochaskell.Plot
PlotCandle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotColorLanguage.Stochaskell.Plot
plotColourLanguage.Stochaskell.Plot
PlotErrBars 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotFillBetween 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotHidden 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotHist 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotIndex 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotindex_iLanguage.Stochaskell.Plot
plotLeftLanguage.Stochaskell.Plot
PlotLines 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotMarkerLanguage.Stochaskell.Plot
plotModifierLanguage.Stochaskell.Plot
PlotModsLanguage.Stochaskell.Plot
plotModsLanguage.Stochaskell.Plot
plotNameLanguage.Stochaskell.Plot
PlotOptionsLanguage.Stochaskell.Plot
plotOptionsLanguage.Stochaskell.Plot
PlotPoints 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotRightLanguage.Stochaskell.Plot
PlotStyleLanguage.Stochaskell.Plot
plotStyleLanguage.Stochaskell.Plot
plotStyleFunctionsLanguage.Stochaskell.Plot
plotStylesLanguage.Stochaskell.Plot
plotTransformLanguage.Stochaskell.Plot
PlotValueLanguage.Stochaskell.Plot
plotVectorFieldLanguage.Stochaskell.Plot
PlotVectors 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotVisibleLanguage.Stochaskell.Plot
plot_all_pointsLanguage.Stochaskell.Plot
plot_annotation_angleLanguage.Stochaskell.Plot
plot_annotation_backgroundLanguage.Stochaskell.Plot
plot_annotation_hanchorLanguage.Stochaskell.Plot
plot_annotation_styleLanguage.Stochaskell.Plot
plot_annotation_valuesLanguage.Stochaskell.Plot
plot_annotation_vanchorLanguage.Stochaskell.Plot
plot_bars_alignmentLanguage.Stochaskell.Plot
plot_bars_item_stylesLanguage.Stochaskell.Plot
plot_bars_referenceLanguage.Stochaskell.Plot
plot_bars_singleton_widthLanguage.Stochaskell.Plot
plot_bars_spacingLanguage.Stochaskell.Plot
plot_bars_styleLanguage.Stochaskell.Plot
plot_bars_titlesLanguage.Stochaskell.Plot
plot_bars_valuesLanguage.Stochaskell.Plot
plot_candle_centreLanguage.Stochaskell.Plot
plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
plot_candle_fillLanguage.Stochaskell.Plot
plot_candle_line_styleLanguage.Stochaskell.Plot
plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
plot_candle_tick_lengthLanguage.Stochaskell.Plot
plot_candle_titleLanguage.Stochaskell.Plot
plot_candle_valuesLanguage.Stochaskell.Plot
plot_candle_widthLanguage.Stochaskell.Plot
plot_errbars_line_styleLanguage.Stochaskell.Plot
plot_errbars_overhangLanguage.Stochaskell.Plot
plot_errbars_tick_lengthLanguage.Stochaskell.Plot
plot_errbars_titleLanguage.Stochaskell.Plot
plot_errbars_valuesLanguage.Stochaskell.Plot
plot_fillbetween_styleLanguage.Stochaskell.Plot
plot_fillbetween_titleLanguage.Stochaskell.Plot
plot_fillbetween_valuesLanguage.Stochaskell.Plot
plot_hidden_x_valuesLanguage.Stochaskell.Plot
plot_hidden_y_valuesLanguage.Stochaskell.Plot
plot_hist_binsLanguage.Stochaskell.Plot
plot_hist_drop_linesLanguage.Stochaskell.Plot
plot_hist_fill_styleLanguage.Stochaskell.Plot
plot_hist_line_styleLanguage.Stochaskell.Plot
plot_hist_norm_funcLanguage.Stochaskell.Plot
plot_hist_no_zerosLanguage.Stochaskell.Plot
plot_hist_rangeLanguage.Stochaskell.Plot
plot_hist_titleLanguage.Stochaskell.Plot
plot_hist_valuesLanguage.Stochaskell.Plot
plot_legendLanguage.Stochaskell.Plot
plot_lines_limit_valuesLanguage.Stochaskell.Plot
plot_lines_styleLanguage.Stochaskell.Plot
plot_lines_titleLanguage.Stochaskell.Plot
plot_lines_valuesLanguage.Stochaskell.Plot
plot_points_styleLanguage.Stochaskell.Plot
plot_points_titleLanguage.Stochaskell.Plot
plot_points_valuesLanguage.Stochaskell.Plot
plot_renderLanguage.Stochaskell.Plot
plot_vectors_gridLanguage.Stochaskell.Plot
plot_vectors_mapfLanguage.Stochaskell.Plot
plot_vectors_scaleLanguage.Stochaskell.Plot
plot_vectors_styleLanguage.Stochaskell.Plot
plot_vectors_titleLanguage.Stochaskell.Plot
plot_vectors_valuesLanguage.Stochaskell.Plot
plumLanguage.Stochaskell.Plot
plusLanguage.Stochaskell.Plot
plussesLanguage.Stochaskell.Plot
pmDrawsLanguage.PyMC3
PMFLanguage.Stochaskell
pmfLanguage.Stochaskell
pmInitLanguage.PyMC3
pmProgramLanguage.PyMC3
pmStartLanguage.PyMC3
pmStepLanguage.PyMC3
pmTuneLanguage.PyMC3
Point 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PointMapFnLanguage.Stochaskell.Plot
pointsLanguage.Stochaskell.Plot
PointShapeLanguage.Stochaskell.Plot
PointShapeArrowHeadLanguage.Stochaskell.Plot
PointShapeCircleLanguage.Stochaskell.Plot
PointShapeCrossLanguage.Stochaskell.Plot
PointShapeEllipseLanguage.Stochaskell.Plot
PointShapePlusLanguage.Stochaskell.Plot
PointShapePolygonLanguage.Stochaskell.Plot
PointShapeStarLanguage.Stochaskell.Plot
PointStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
pointToVecLanguage.Stochaskell.Plot
point_border_colorLanguage.Stochaskell.Plot
point_border_widthLanguage.Stochaskell.Plot
point_colorLanguage.Stochaskell.Plot
point_radiusLanguage.Stochaskell.Plot
point_shapeLanguage.Stochaskell.Plot
PoissonLanguage.Stochaskell
poissonLanguage.Stochaskell
PoissonProcessLanguage.Stochaskell
poissonProcessLanguage.Stochaskell
Polar 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
polarLanguage.Stochaskell.Plot
polarAxisLanguage.Stochaskell.Plot
polarIsoLanguage.Stochaskell.Plot
polarV2Language.Stochaskell.Plot
powderblueLanguage.Stochaskell.Plot
preLanguage.Stochaskell.Plot
predLanguage.Stochaskell.Prelude, Language.Stochaskell
preuseLanguage.Stochaskell.Plot
preusesLanguage.Stochaskell.Plot
previewLanguage.Stochaskell.Plot
previewsLanguage.Stochaskell.Plot
printLanguage.Stochaskell.Prelude, Language.Stochaskell
Prism 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
prismLanguage.Stochaskell.Plot
Prism'Language.Stochaskell.Plot
prism'Language.Stochaskell.Plot
probabilityLanguage.Stochaskell.Plot
Product 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
productLanguage.Stochaskell.Prelude, Language.Stochaskell
productOfLanguage.Stochaskell.Plot
ProfunctorLanguage.Stochaskell.Plot
properFractionLanguage.Stochaskell.Prelude, Language.Stochaskell
psubLanguage.Stochaskell.Plot
pureLanguage.Stochaskell.Prelude, Language.Stochaskell
purpleLanguage.Stochaskell.Plot
putCharLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLnLanguage.Stochaskell.Prelude, Language.Stochaskell
pvaddLanguage.Stochaskell.Plot
pvsubLanguage.Stochaskell.Plot
PyMC3InferenceLanguage.PyMC3
PyMC3SampleLanguage.PyMC3
PyMC3StepLanguage.PyMC3
p_xLanguage.Stochaskell.Plot
p_yLanguage.Stochaskell.Plot
qfDiagLanguage.Stochaskell
quotLanguage.Stochaskell.Prelude, Language.Stochaskell
quotRemLanguage.Stochaskell.Prelude, Language.Stochaskell
RLanguage.Stochaskell
r2AxisLanguage.Stochaskell.Plot
r2AxisMainLanguage.Stochaskell.Plot
RadialLanguage.Stochaskell.Plot
RangeLanguage.Stochaskell.Plot
RationalLanguage.Stochaskell.Prelude, Language.Stochaskell
rawPlotLanguage.Stochaskell.Plot
rAxisLanguage.Stochaskell.Plot
RCornerBevelLanguage.Stochaskell.Plot
RCornerRoundedLanguage.Stochaskell.Plot
RCornerSquareLanguage.Stochaskell.Plot
reLanguage.Stochaskell.Plot
ReadLanguage.Stochaskell.Prelude, Language.Stochaskell
readLanguage.Stochaskell.Prelude, Language.Stochaskell
readColourNameLanguage.Stochaskell.Plot
readFileLanguage.Stochaskell.Prelude, Language.Stochaskell
readIOLanguage.Stochaskell.Prelude, Language.Stochaskell
readListLanguage.Stochaskell.Prelude, Language.Stochaskell
readLnLanguage.Stochaskell.Prelude, Language.Stochaskell
readParenLanguage.Stochaskell.Prelude, Language.Stochaskell
readRealMatrixLanguage.Stochaskell
ReadSLanguage.Stochaskell.Prelude, Language.Stochaskell
readsLanguage.Stochaskell.Prelude, Language.Stochaskell
readsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
RealLanguage.Stochaskell.Prelude, Language.Stochaskell
realLanguage.Stochaskell
RealFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
RealFracLanguage.Stochaskell.Prelude, Language.Stochaskell
RealTLanguage.Stochaskell.Expression
realToFracLanguage.Stochaskell.Prelude, Language.Stochaskell
recipLanguage.Stochaskell.Prelude, Language.Stochaskell
Rect 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Rectangle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
rectangleToRenderableLanguage.Stochaskell.Plot
RectCornerStyleLanguage.Stochaskell.Plot
RectEdgeLanguage.Stochaskell.Plot
rectPathLanguage.Stochaskell.Plot
RectSizeLanguage.Stochaskell.Plot
rect_cornerStyleLanguage.Stochaskell.Plot
rect_fillStyleLanguage.Stochaskell.Plot
rect_lineStyleLanguage.Stochaskell.Plot
rect_minsizeLanguage.Stochaskell.Plot
redLanguage.Stochaskell.Plot
ReifiedFoldLanguage.Stochaskell.Plot
ReifiedGetterLanguage.Stochaskell.Plot
ReifiedIndexedFoldLanguage.Stochaskell.Plot
ReifiedIndexedGetterLanguage.Stochaskell.Plot
ReifiedIndexedLensLanguage.Stochaskell.Plot
ReifiedIndexedLens'Language.Stochaskell.Plot
ReifiedIndexedSetterLanguage.Stochaskell.Plot
ReifiedIndexedSetter'Language.Stochaskell.Plot
ReifiedIndexedTraversalLanguage.Stochaskell.Plot
ReifiedIndexedTraversal'Language.Stochaskell.Plot
ReifiedIsoLanguage.Stochaskell.Plot
ReifiedIso'Language.Stochaskell.Plot
ReifiedLensLanguage.Stochaskell.Plot
ReifiedLens'Language.Stochaskell.Plot
ReifiedPrismLanguage.Stochaskell.Plot
ReifiedPrism'Language.Stochaskell.Plot
ReifiedSetterLanguage.Stochaskell.Plot
ReifiedSetter'Language.Stochaskell.Plot
ReifiedTraversalLanguage.Stochaskell.Plot
ReifiedTraversal'Language.Stochaskell.Plot
reindexedLanguage.Stochaskell.Plot
RelativeExtendLanguage.Stochaskell.Plot
remLanguage.Stochaskell.Prelude, Language.Stochaskell
renderLanguage.Stochaskell.Plot
Renderable 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
RenderAxisLanguage.Stochaskell.Plot
renderAxisLanguage.Stochaskell.Plot
renderAxis2Language.Stochaskell.Plot
renderAxisGridLanguage.Stochaskell.Plot
renderColourBarLanguage.Stochaskell.Plot
renderPlotableLanguage.Stochaskell.Plot
renderSizeLanguage.Stochaskell.Plot
renderStackedLayoutsLanguage.Stochaskell.Plot
renderStyledPlotLanguage.Stochaskell.Plot
repeatLanguage.Stochaskell.Prelude, Language.Stochaskell
repeatedLanguage.Stochaskell.Plot
replaceLanguage.Stochaskell
replaceAtLanguage.Stochaskell
replaceIndexLanguage.Stochaskell
replicateLanguage.Stochaskell.Prelude, Language.Stochaskell
replicatedLanguage.Stochaskell.Plot
replicateMLanguage.Stochaskell.Prelude, Language.Stochaskell
replicateM_Language.Stochaskell.Prelude, Language.Stochaskell
retaggedLanguage.Stochaskell.Plot
returnLanguage.Stochaskell.Prelude, Language.Stochaskell
reuseLanguage.Stochaskell.Plot
reusesLanguage.Stochaskell.Plot
reverseLanguage.Stochaskell.Prelude, Language.Stochaskell
ReversedLanguage.Stochaskell.Plot
reversedLanguage.Stochaskell.Plot
ReversingLanguage.Stochaskell.Plot
reversingLanguage.Stochaskell.Plot
ReviewLanguage.Stochaskell.Plot
reviewLanguage.Stochaskell.Plot
ReviewableLanguage.Stochaskell.Plot
reviewsLanguage.Stochaskell.Plot
RewrappedLanguage.Stochaskell.Plot
RewrappingLanguage.Stochaskell.Plot
rewriteLanguage.Stochaskell.Plot
rewriteMLanguage.Stochaskell.Plot
rewriteMOfLanguage.Stochaskell.Plot
rewriteMOnLanguage.Stochaskell.Plot
rewriteMOnOfLanguage.Stochaskell.Plot
rewriteOfLanguage.Stochaskell.Plot
rewriteOnLanguage.Stochaskell.Plot
rewriteOnOfLanguage.Stochaskell.Plot
RightLanguage.Stochaskell.Prelude, Language.Stochaskell
rightLanguage.Stochaskell.Plot
right'Language.Stochaskell.Plot
rightAboveLanguage.Stochaskell.Plot
rightBelowLanguage.Stochaskell.Plot
rightBottomLanguage.Stochaskell.Plot
rightMidLanguage.Stochaskell.Plot
RightmostLanguage.Stochaskell.Plot
rightTopLanguage.Stochaskell.Plot
rjmcLanguage.Stochaskell
rjmcCLanguage.Stochaskell
rLabelLanguage.Stochaskell.Plot
rlabelLanguage.Stochaskell.Plot
rmapLanguage.Stochaskell.Plot
rmappingLanguage.Stochaskell.Plot
RMatLanguage.Stochaskell
rMaxLanguage.Stochaskell.Plot
rosybrownLanguage.Stochaskell.Plot
rotateLanguage.Stochaskell.Plot
rotatePLanguage.Stochaskell.Plot
roundLanguage.Stochaskell.Prelude, Language.Stochaskell
royalblueLanguage.Stochaskell.Plot
runBazaarLanguage.Stochaskell.Plot
runBazaar1Language.Stochaskell.Plot
runCCLanguage.Stochaskell
runEqLanguage.Stochaskell.Plot
runFoldLanguage.Stochaskell.Plot
runGetterLanguage.Stochaskell.Plot
runIdentityLanguage.Stochaskell.Plot
runIndexedLanguage.Stochaskell.Plot
runIndexedFoldLanguage.Stochaskell.Plot
runIndexedGetterLanguage.Stochaskell.Plot
runIndexedLensLanguage.Stochaskell.Plot
runIndexedSetterLanguage.Stochaskell.Plot
runIndexedTraversalLanguage.Stochaskell.Plot
runIsoLanguage.Stochaskell.Plot
runLensLanguage.Stochaskell.Plot
runningBarsLanguage.Stochaskell.Plot
runPrismLanguage.Stochaskell.Plot
runPyMC3Language.PyMC3
runSetterLanguage.Stochaskell.Plot
runStanLanguage.Stan
runStepLanguage.Stochaskell
runTraversalLanguage.Stochaskell.Plot
RVecLanguage.Stochaskell
saddlebrownLanguage.Stochaskell.Plot
salmonLanguage.Stochaskell.Plot
sandybrownLanguage.Stochaskell.Plot
sansLanguage.Stochaskell.Plot
saveWarmupLanguage.Stan
ScalableLanguage.Stochaskell
scalarMultiplyLanguage.Stochaskell.Plot
scaleLanguage.Stochaskell.Plot
scaleAspectRatioLanguage.Stochaskell.Plot
scaledAxisLanguage.Stochaskell.Plot
scaledIntAxisLanguage.Stochaskell.Plot
scaleFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
ScaleModeLanguage.Stochaskell.Plot
scaleModeLanguage.Stochaskell.Plot
scaleNumLanguage.Stochaskell.Plot
scalePLanguage.Stochaskell.Plot
scanlLanguage.Stochaskell
scanl'Language.Stochaskell.Prelude, Language.Stochaskell
scanl1Language.Stochaskell.Prelude, Language.Stochaskell
scanl1OfLanguage.Stochaskell.Plot
scanrLanguage.Stochaskell
scanr1Language.Stochaskell.Prelude, Language.Stochaskell
scanr1OfLanguage.Stochaskell.Plot
ScatterOptionsLanguage.Stochaskell.Plot
scatterOptionsLanguage.Stochaskell.Plot
ScatterPlotLanguage.Stochaskell.Plot
scatterPlotLanguage.Stochaskell.Plot
scatterPlot'Language.Stochaskell.Plot
scatterPlotOfLanguage.Stochaskell.Plot
scatterPlotOf'Language.Stochaskell.Plot
scatterPositionLanguage.Stochaskell.Plot
scatterStyleLanguage.Stochaskell.Plot
scatterTransformLanguage.Stochaskell.Plot
scribeLanguage.Stochaskell.Plot
seagreenLanguage.Stochaskell.Plot
seashellLanguage.Stochaskell.Plot
secondingLanguage.Stochaskell.Plot
selectItemsLanguage.Stochaskell
selfIndexLanguage.Stochaskell.Plot
SemigroupLanguage.Stochaskell.Prelude, Language.Stochaskell
seqLanguage.Stochaskell.Prelude, Language.Stochaskell
seqListLanguage.Stochaskell
sequenceLanguage.Stochaskell.Prelude, Language.Stochaskell
sequence1Of_Language.Stochaskell.Plot
sequenceALanguage.Stochaskell.Prelude, Language.Stochaskell
sequenceAOfLanguage.Stochaskell.Plot
sequenceAOf_Language.Stochaskell.Plot
sequenceByLanguage.Stochaskell.Plot
sequenceByOfLanguage.Stochaskell.Plot
SequencedLanguage.Stochaskell.Plot
sequenceOfLanguage.Stochaskell.Plot
sequenceOf_Language.Stochaskell.Plot
sequence_Language.Stochaskell.Prelude, Language.Stochaskell
setLanguage.Stochaskell.Plot
set'Language.Stochaskell.Plot
setColorsLanguage.Stochaskell.Plot
setPickFnLanguage.Stochaskell.Plot
setRandomSeedLanguage.Stochaskell
setsLanguage.Stochaskell.Plot
setShapesLanguage.Stochaskell.Plot
SettableLanguage.Stochaskell.Plot
Setter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Setter'Language.Stochaskell.Plot
SettingLanguage.Stochaskell.Plot
settingLanguage.Stochaskell.Plot
Setting'Language.Stochaskell.Plot
shapesLanguage.Stochaskell.Plot
ShowLanguage.Stochaskell.Prelude, Language.Stochaskell
showLanguage.Stochaskell.Prelude, Language.Stochaskell
showCharLanguage.Stochaskell.Prelude, Language.Stochaskell
showGridLinesLanguage.Stochaskell.Plot
showListLanguage.Stochaskell.Prelude, Language.Stochaskell
showParenLanguage.Stochaskell.Prelude, Language.Stochaskell
ShowSLanguage.Stochaskell.Prelude, Language.Stochaskell
showsLanguage.Stochaskell.Prelude, Language.Stochaskell
showsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
showStringLanguage.Stochaskell.Prelude, Language.Stochaskell
siennaLanguage.Stochaskell.Plot
significandLanguage.Stochaskell.Prelude, Language.Stochaskell
signumLanguage.Stochaskell.Prelude, Language.Stochaskell
silence'Language.Stochaskell
silverLanguage.Stochaskell.Plot
simChurchVecLanguage.Church
SimpleLanguage.Stochaskell.Plot
simpleLanguage.Stochaskell.Plot
simpleLensesLanguage.Stochaskell.Plot
simplyLanguage.Stochaskell.Plot
simulateLanguage.Stochaskell
sinLanguage.Stochaskell.Prelude, Language.Stochaskell
SingleAxisLanguage.Stochaskell.Plot
singleStyledPlotLegendLanguage.Stochaskell.Plot
singularLanguage.Stochaskell.Plot
sinhLanguage.Stochaskell.Prelude, Language.Stochaskell
skyblueLanguage.Stochaskell.Plot
slateblueLanguage.Stochaskell.Plot
slategrayLanguage.Stochaskell.Plot
slategreyLanguage.Stochaskell.Plot
slayouts_compress_legendLanguage.Stochaskell.Plot
slayouts_layoutsLanguage.Stochaskell.Plot
SliceLanguage.PyMC3
sliceLanguage.Stochaskell
smoothLinePlotLanguage.Stochaskell.Plot
smoothLinePlot'Language.Stochaskell.Plot
sndLanguage.Stochaskell.Prelude, Language.Stochaskell
SnocLanguage.Stochaskell.Plot
snocLanguage.Stochaskell.Plot
snowLanguage.Stochaskell.Plot
solidFillStyleLanguage.Stochaskell.Plot
solidLineLanguage.Stochaskell.Plot
solveLanguage.Stochaskell
solvePLanguage.Stochaskell
sortLanguage.Stochaskell.Prelude, Language.Stochaskell
sort2BLanguage.Stochaskell.Prelude, Language.Stochaskell
sortByLanguage.Stochaskell.Prelude, Language.Stochaskell
sortOnLanguage.Stochaskell.Prelude, Language.Stochaskell
spacerLanguage.Stochaskell.Plot
spacer1Language.Stochaskell.Plot
SpaceWeightLanguage.Stochaskell.Plot
SpanLanguage.Stochaskell.Plot
spanLanguage.Stochaskell.Prelude, Language.Stochaskell
spanListLanguage.Stochaskell
specBoundsLanguage.Stochaskell.Plot
specColourMapLanguage.Stochaskell.Plot
specPointLanguage.Stochaskell.Plot
specScaleLanguage.Stochaskell.Plot
specTransLanguage.Stochaskell.Plot
splitLanguage.Stochaskell
splitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
springgreenLanguage.Stochaskell.Plot
sqrtLanguage.Stochaskell.Prelude, Language.Stochaskell
squareLanguage.Stochaskell
SquareMatrixLanguage.Stochaskell
stackedBarsLanguage.Stochaskell.Plot
stackedEqualBarsLanguage.Stochaskell.Plot
StackedLayout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
StackedLayoutLRLanguage.Stochaskell.Plot
StackedLayouts 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
staircaseLanguage.Stochaskell
StanDenseEMetricLanguage.Stan
StanDiagEMetricLanguage.Stan
StanHMCEngineLanguage.Stan
StanHMCMetricLanguage.Stan
StanMethodLanguage.Stan
StanNUTSEngineLanguage.Stan
StanSampleLanguage.Stan
StanStaticHMCEngineLanguage.Stan
StanUnitEMetricLanguage.Stan
star'Language.Stochaskell.Plot
starsLanguage.Stochaskell.Plot
startswithLanguage.Stochaskell
steelblueLanguage.Stochaskell.Plot
stepRandLanguage.PyMC3
stepScaleLanguage.PyMC3
stochaskellLanguage.Stochaskell
storingLanguage.Stochaskell.Plot
StretchLanguage.Stochaskell.Plot
strFromALLanguage.Stochaskell
Strict 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
strictLanguage.Stochaskell.Plot
StringLanguage.Stochaskell.Prelude, Language.Stochaskell
stripPrefixLanguage.Stochaskell.Prelude, Language.Stochaskell
strokePathLanguage.Stochaskell.Plot
strokePointPathLanguage.Stochaskell.Plot
strToALLanguage.Stochaskell
StyledPlotLanguage.Stochaskell.Plot
styledPlotLanguage.Stochaskell.Plot
styledPlotLegendsLanguage.Stochaskell.Plot
styleDynamicLanguage.Stochaskell.Plot
subIndexLanguage.Stochaskell
SubrangeTLanguage.Stochaskell.Expression
subsequencesLanguage.Stochaskell.Prelude, Language.Stochaskell
substEqLanguage.Stochaskell.Plot
subtractLanguage.Stochaskell.Prelude, Language.Stochaskell
succLanguage.Stochaskell.Prelude, Language.Stochaskell
Sum 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
sumLanguage.Stochaskell.Prelude, Language.Stochaskell
sum'Language.Stochaskell
sumOfLanguage.Stochaskell.Plot
Swapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
swappedLanguage.Stochaskell.Plot
symbolLanguage.Stochaskell
symbolsLanguage.Stochaskell
symErrPointLanguage.Stochaskell.Plot
TagLanguage.Stochaskell.Expression
Tags 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tagsLanguage.Stochaskell.Expression
tailLanguage.Stochaskell.Prelude, Language.Stochaskell
tailsLanguage.Stochaskell.Prelude, Language.Stochaskell
takeLanguage.Stochaskell.Prelude, Language.Stochaskell
takeColorLanguage.Stochaskell.Plot
takeShapeLanguage.Stochaskell.Plot
takeWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
takeWhileListLanguage.Stochaskell
takingLanguage.Stochaskell.Plot
takingWhileLanguage.Stochaskell.Plot
tallBesideLanguage.Stochaskell.Plot
tan 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
tanhLanguage.Stochaskell.Prelude, Language.Stochaskell
tealLanguage.Stochaskell.Plot
textDimensionLanguage.Stochaskell.Plot
textDrawRectLanguage.Stochaskell.Plot
TextFunctionLanguage.Stochaskell.Plot
TextSize 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
textSizeLanguage.Stochaskell.Plot
textSizeAscentLanguage.Stochaskell.Plot
textSizeDescentLanguage.Stochaskell.Plot
textSizeHeightLanguage.Stochaskell.Plot
textSizeWidthLanguage.Stochaskell.Plot
textSizeYBearingLanguage.Stochaskell.Plot
textStyleLanguage.Stochaskell.Plot
textStyleFunctionLanguage.Stochaskell.Plot
thetaAxisLanguage.Stochaskell.Plot
thetaLabelLanguage.Stochaskell.Plot
thinLanguage.Stan
thistleLanguage.Stochaskell.Plot
ticLanguage.Stochaskell
tickLabelLanguage.Stochaskell.Plot
tickLabelFunctionLanguage.Stochaskell.Plot
tickLabelGapLanguage.Stochaskell.Plot
tickLabelPositionsLanguage.Stochaskell.Plot
TickLabelsLanguage.Stochaskell.Plot
tickLabelStyleLanguage.Stochaskell.Plot
tickLabelTextFunctionLanguage.Stochaskell.Plot
TicksLanguage.Stochaskell.Plot
ticksAlignLanguage.Stochaskell.Plot
TicksAlignmentLanguage.Stochaskell.Plot
TickSpecLanguage.Stochaskell.Plot
ticksStyleLanguage.Stochaskell.Plot
ticksVisibleLanguage.Stochaskell.Plot
TimeLabelAlignmentLanguage.Stochaskell.Plot
TimeLabelFnLanguage.Stochaskell.Plot
TimeSeqLanguage.Stochaskell.Plot
TimeValueLanguage.Stochaskell.Plot
timeValueAxisLanguage.Stochaskell.Plot
timeValueFromDoubleLanguage.Stochaskell.Plot
TitleLanguage.Stochaskell.Plot
titleLanguage.Stochaskell.Plot
titleGapLanguage.Stochaskell.Plot
titlePlacementLanguage.Stochaskell.Plot
titleStyleLanguage.Stochaskell.Plot
titleTextLanguage.Stochaskell.Plot
toLanguage.Stochaskell.Plot
tocLanguage.Stochaskell
toConcreteLanguage.Stochaskell.Expression
toConcreteCLanguage.Stochaskell.Expression
toEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
toExprTupleLanguage.Stochaskell.Expression
toIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
toListLanguage.Stochaskell
toListOfLanguage.Stochaskell.Plot
tomatoLanguage.Stochaskell.Plot
toNonEmptyOfLanguage.Stochaskell.Plot
topLanguage.Stochaskell.Plot
topLeftLanguage.Stochaskell.Plot
ToPlotLanguage.Stochaskell.Plot
toPlotLanguage.Stochaskell.Plot
TopNameLanguage.Stochaskell.Plot
ToPNGLanguage.Stochaskell.Plot
toPNGLanguage.Stochaskell.Plot
topRightLanguage.Stochaskell.Plot
toRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
ToRenderableLanguage.Stochaskell.Plot
toRenderableLanguage.Stochaskell.Plot
toStopsLanguage.Stochaskell.Plot
toValueLanguage.Stochaskell.Plot
trLanguage.Stochaskell
tr'Language.Stochaskell
trailPlotLanguage.Stochaskell.Plot
trailPlot'Language.Stochaskell.Plot
TransfiniteLanguage.Stochaskell
transformLanguage.Stochaskell.Plot
transformMLanguage.Stochaskell.Plot
transformMOfLanguage.Stochaskell.Plot
transformMOnLanguage.Stochaskell.Plot
transformMOnOfLanguage.Stochaskell.Plot
transformOfLanguage.Stochaskell.Plot
transformOnLanguage.Stochaskell.Plot
transformOnOfLanguage.Stochaskell.Plot
transformPLanguage.Stochaskell.Plot
translateLanguage.Stochaskell.Plot
translatePLanguage.Stochaskell.Plot
transparentLanguage.Stochaskell.Plot
TransposableLanguage.Stochaskell
transposeLanguage.Stochaskell.Prelude, Language.Stochaskell
transposeOfLanguage.Stochaskell.Plot
TraversableLanguage.Stochaskell.Plot, Language.Stochaskell.Prelude, Language.Stochaskell
Traversable1Language.Stochaskell.Plot
TraversableWithIndexLanguage.Stochaskell.Plot
Traversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Traversal'Language.Stochaskell.Plot
Traversal1Language.Stochaskell.Plot
Traversal1'Language.Stochaskell.Plot
traverseLanguage.Stochaskell.Plot, Language.Stochaskell.Prelude, Language.Stochaskell
traverse1Language.Stochaskell.Plot
traverse1Of_Language.Stochaskell.Plot
traverseByLanguage.Stochaskell.Plot
traverseByOfLanguage.Stochaskell.Plot
TraversedLanguage.Stochaskell.Plot
traversedLanguage.Stochaskell.Plot
traversed1Language.Stochaskell.Plot
traversed64Language.Stochaskell.Plot
TraverseMaxLanguage.Stochaskell.Plot
traverseMaxLanguage.Stochaskell.Plot
TraverseMinLanguage.Stochaskell.Plot
traverseMinLanguage.Stochaskell.Plot
traverseOfLanguage.Stochaskell.Plot
traverseOf_Language.Stochaskell.Plot
TraversingLanguage.Stochaskell.Plot
Traversing'Language.Stochaskell.Plot
Traversing1Language.Stochaskell.Plot
Traversing1'Language.Stochaskell.Plot
TrueLanguage.Stochaskell.Prelude, Language.Stochaskell
trueLanguage.Stochaskell.Prelude, Language.Stochaskell
truncateLanguage.Stochaskell.Prelude, Language.Stochaskell
truncatedLanguage.Stochaskell
tspanLanguage.Stochaskell.Plot
TupleSize 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tupleSizeLanguage.Stochaskell.Expression
TupleTLanguage.Stochaskell.Expression
tupleTLanguage.Stochaskell.Expression
turquoiseLanguage.Stochaskell.Plot
tvalLanguage.Stochaskell.Plot
tvFromUTCTimeLanguage.Stochaskell.Plot
TypeLanguage.Stochaskell.Expression
TypeIsLanguage.Stochaskell.Expression
TypeOfLanguage.Stochaskell.Expression
typeOfLanguage.Stochaskell.Expression
TypesIsLanguage.Stochaskell.Expression
TypesOfLanguage.Stochaskell.Expression
typesOfLanguage.Stochaskell.Expression
unLanguage.Stochaskell.Plot
uncons 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
uncurriedLanguage.Stochaskell.Plot
uncurryLanguage.Stochaskell.Prelude, Language.Stochaskell
undefinedLanguage.Stochaskell.Prelude, Language.Stochaskell
underLanguage.Stochaskell.Plot
underscoreFieldsLanguage.Stochaskell.Plot
underscoreNamerLanguage.Stochaskell.Plot
underscoreNoPrefixNamerLanguage.Stochaskell.Plot
UnderTicksLanguage.Stochaskell.Plot
unfoldedLanguage.Stochaskell.Plot
unfoldrLanguage.Stochaskell.Prelude, Language.Stochaskell
UniformLanguage.Stochaskell
uniformLanguage.Stochaskell
UniformsLanguage.Stochaskell
uniformsLanguage.Stochaskell
UniformScaleLanguage.Stochaskell.Plot
UniformScaleStrategyLanguage.Stochaskell.Plot
unionLanguage.Stochaskell.Prelude, Language.Stochaskell
unionByLanguage.Stochaskell.Prelude, Language.Stochaskell
UnionTLanguage.Stochaskell.Expression
uniqLanguage.Stochaskell
unitAxisLanguage.Stochaskell.Plot
unitedLanguage.Stochaskell.Plot
UnitOnlyLanguage.Stochaskell.Plot
universeLanguage.Stochaskell.Plot
universeOfLanguage.Stochaskell.Plot
universeOnLanguage.Stochaskell.Plot
universeOnOfLanguage.Stochaskell.Plot
UnknownTypeLanguage.Stochaskell.Expression
unlessLanguage.Stochaskell.Prelude, Language.Stochaskell
unlinesLanguage.Stochaskell.Prelude, Language.Stochaskell
unPercentLanguage.Stochaskell.Plot
unpolarLanguage.Stochaskell.Plot
unsafePartsOfLanguage.Stochaskell.Plot
unsafePartsOf'Language.Stochaskell.Plot
unsafeSingularLanguage.Stochaskell.Plot
unsnocLanguage.Stochaskell.Plot
untilLanguage.Stochaskell.Prelude, Language.Stochaskell
untoLanguage.Stochaskell.Plot
unwordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Unwrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
unzipLanguage.Stochaskell.Prelude, Language.Stochaskell
unzip3Language.Stochaskell.Prelude, Language.Stochaskell
unzip4Language.Stochaskell.Prelude, Language.Stochaskell
unzip5Language.Stochaskell.Prelude, Language.Stochaskell
unzip6Language.Stochaskell.Prelude, Language.Stochaskell
unzip7Language.Stochaskell.Prelude, Language.Stochaskell
UpperAxisLabelLanguage.Stochaskell.Plot
useLanguage.Stochaskell.Plot
userErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
usesLanguage.Stochaskell.Plot
utctimeFromTVLanguage.Stochaskell.Plot
valuesALLanguage.Stochaskell
vangleLanguage.Stochaskell.Plot
vecTLanguage.Stochaskell.Expression
VectorLanguage.Stochaskell
vectorLanguage.Stochaskell
vectorAlignmentFnsLanguage.Stochaskell.Plot
vectorSizeLanguage.Stochaskell
VectorStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
vector_head_styleLanguage.Stochaskell.Plot
vector_line_styleLanguage.Stochaskell.Plot
VerticalLanguage.Stochaskell.Plot
verticalLanguage.Stochaskell.Plot
viewLanguage.Stochaskell.Plot
viewsLanguage.Stochaskell.Plot
violetLanguage.Stochaskell.Plot
viridisLanguage.Stochaskell.Plot
visibleLanguage.Stochaskell.Plot
vividColoursLanguage.Stochaskell.Plot
vlenLanguage.Stochaskell.Plot
vlinePlotLanguage.Stochaskell.Plot
vmapLanguage.Stochaskell.Plot
voidLanguage.Stochaskell.Prelude, Language.Stochaskell
vscaleLanguage.Stochaskell.Plot
VTA_BaseLineLanguage.Stochaskell.Plot
VTA_BottomLanguage.Stochaskell.Plot
VTA_CentreLanguage.Stochaskell.Plot
VTA_TopLanguage.Stochaskell.Plot
VTextAnchorLanguage.Stochaskell.Plot
v_xLanguage.Stochaskell.Plot
v_yLanguage.Stochaskell.Plot
WedgeLanguage.Stochaskell.Plot
wedgeDirectionLanguage.Stochaskell.Plot
wedgeInnerRadiusLanguage.Stochaskell.Plot
wedgeKeysLanguage.Stochaskell.Plot
wedgeOffsetLanguage.Stochaskell.Plot
wedgeOuterRadiusLanguage.Stochaskell.Plot
wedgePlotLanguage.Stochaskell.Plot
wedgeWidthLanguage.Stochaskell.Plot
weightsLanguage.Stochaskell.Plot
wheatLanguage.Stochaskell.Plot
whenLanguage.Stochaskell.Prelude, Language.Stochaskell
whiteLanguage.Stochaskell.Plot
whitesmokeLanguage.Stochaskell.Plot
WholeFunc 
1 (Type/Class)Language.Stochaskell
2 (Data Constructor)Language.Stochaskell
wholeMapLanguage.Stochaskell
wideAboveLanguage.Stochaskell.Plot
widthLanguage.Stochaskell.Plot
withClipRegionLanguage.Stochaskell.Plot
withDefaultStyleLanguage.Stochaskell.Plot
withFillStyleLanguage.Stochaskell.Plot
withFontStyleLanguage.Stochaskell.Plot
withinLanguage.Stochaskell.Plot
withIndexLanguage.Stochaskell.Plot
withIsoLanguage.Stochaskell.Plot
withLineStyleLanguage.Stochaskell.Plot
withOpacityLanguage.Stochaskell.Plot
withoutLanguage.Stochaskell.Plot
withPointStyleLanguage.Stochaskell.Plot
withPrismLanguage.Stochaskell.Plot
withRotationLanguage.Stochaskell.Plot
withScaleLanguage.Stochaskell.Plot
withScaleXLanguage.Stochaskell.Plot
withScaleYLanguage.Stochaskell.Plot
withTransformLanguage.Stochaskell.Plot
withTranslationLanguage.Stochaskell.Plot
WordLanguage.Stochaskell.Prelude, Language.Stochaskell
wordedLanguage.Stochaskell.Plot
wordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Wrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
writeFileLanguage.Stochaskell.Prelude, Language.Stochaskell
x0Language.Stochaskell.Plot
xAxisLanguage.Stochaskell.Plot
xLabelLanguage.Stochaskell.Plot
xlabelLanguage.Stochaskell.Plot
xlimLanguage.Stochaskell.Plot
xMaxLanguage.Stochaskell.Plot
xMinLanguage.Stochaskell.Plot
xxLanguage.Stochaskell.Plot
xyLanguage.Stochaskell.Plot
xy_Language.Stochaskell.Plot
x_Language.Stochaskell.Plot
y0Language.Stochaskell.Plot
yAxisLanguage.Stochaskell.Plot
yearsLanguage.Stochaskell.Plot
yellowLanguage.Stochaskell.Plot
yellowgreenLanguage.Stochaskell.Plot
yLabelLanguage.Stochaskell.Plot
ylabelLanguage.Stochaskell.Plot
ylimLanguage.Stochaskell.Plot
yMaxLanguage.Stochaskell.Plot
yMinLanguage.Stochaskell.Plot
yxLanguage.Stochaskell.Plot
yyLanguage.Stochaskell.Plot
y_Language.Stochaskell.Plot
ZLanguage.Stochaskell
zAxisLanguage.Stochaskell.Plot
zerosLanguage.Stochaskell
zipLanguage.Stochaskell.Prelude, Language.Stochaskell
zip3Language.Stochaskell.Prelude, Language.Stochaskell
zip4Language.Stochaskell.Prelude, Language.Stochaskell
zip5Language.Stochaskell.Prelude, Language.Stochaskell
zip6Language.Stochaskell.Prelude, Language.Stochaskell
zip7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWith3Language.Stochaskell.Prelude, Language.Stochaskell
zipWith4Language.Stochaskell.Prelude, Language.Stochaskell
zipWith5Language.Stochaskell.Prelude, Language.Stochaskell
zipWith6Language.Stochaskell.Prelude, Language.Stochaskell
zipWith7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithMLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWithM_Language.Stochaskell.Prelude, Language.Stochaskell
zLabelLanguage.Stochaskell.Plot
ZMatLanguage.Stochaskell
zMaxLanguage.Stochaskell.Plot
zMinLanguage.Stochaskell.Plot
ZoomLanguage.Stochaskell.Plot
zoomLanguage.Stochaskell.Plot
ZoomedLanguage.Stochaskell.Plot
ZVecLanguage.Stochaskell
\\Language.Stochaskell.Prelude, Language.Stochaskell
^Language.Stochaskell.Prelude, Language.Stochaskell
^#Language.Stochaskell.Plot
^.Language.Stochaskell.Plot
^..Language.Stochaskell.Plot
^=Language.Stochaskell.Plot
^?Language.Stochaskell.Plot
^?!Language.Stochaskell.Plot
^@.Language.Stochaskell.Plot
^@..Language.Stochaskell.Plot
^@?Language.Stochaskell.Plot
^@?!Language.Stochaskell.Plot
^^Language.Stochaskell.Prelude, Language.Stochaskell
^^=Language.Stochaskell.Plot
^^~Language.Stochaskell.Plot
^~Language.Stochaskell.Plot
_1Language.Stochaskell.Plot
_1'Language.Stochaskell.Plot
_10Language.Stochaskell.Plot
_10'Language.Stochaskell.Plot
_11Language.Stochaskell.Plot
_11'Language.Stochaskell.Plot
_12Language.Stochaskell.Plot
_12'Language.Stochaskell.Plot
_13Language.Stochaskell.Plot
_13'Language.Stochaskell.Plot
_14Language.Stochaskell.Plot
_14'Language.Stochaskell.Plot
_15Language.Stochaskell.Plot
_15'Language.Stochaskell.Plot
_16Language.Stochaskell.Plot
_16'Language.Stochaskell.Plot
_17Language.Stochaskell.Plot
_17'Language.Stochaskell.Plot
_18Language.Stochaskell.Plot
_18'Language.Stochaskell.Plot
_19Language.Stochaskell.Plot
_19'Language.Stochaskell.Plot
_2Language.Stochaskell.Plot
_2'Language.Stochaskell.Plot
_3Language.Stochaskell.Plot
_3'Language.Stochaskell.Plot
_4Language.Stochaskell.Plot
_4'Language.Stochaskell.Plot
_5Language.Stochaskell.Plot
_5'Language.Stochaskell.Plot
_6Language.Stochaskell.Plot
_6'Language.Stochaskell.Plot
_7Language.Stochaskell.Plot
_7'Language.Stochaskell.Plot
_8Language.Stochaskell.Plot
_8'Language.Stochaskell.Plot
_9Language.Stochaskell.Plot
_9'Language.Stochaskell.Plot
_area_spots_4d_linethickLanguage.Stochaskell.Plot
_area_spots_4d_max_radiusLanguage.Stochaskell.Plot
_area_spots_4d_opacityLanguage.Stochaskell.Plot
_area_spots_4d_paletteLanguage.Stochaskell.Plot
_area_spots_4d_titleLanguage.Stochaskell.Plot
_area_spots_4d_valuesLanguage.Stochaskell.Plot
_area_spots_fillcolourLanguage.Stochaskell.Plot
_area_spots_linecolourLanguage.Stochaskell.Plot
_area_spots_linethickLanguage.Stochaskell.Plot
_area_spots_max_radiusLanguage.Stochaskell.Plot
_area_spots_opacityLanguage.Stochaskell.Plot
_area_spots_titleLanguage.Stochaskell.Plot
_area_spots_valuesLanguage.Stochaskell.Plot
_axis_gridLanguage.Stochaskell.Plot
_axis_grid_styleLanguage.Stochaskell.Plot
_axis_labelsLanguage.Stochaskell.Plot
_axis_label_gapLanguage.Stochaskell.Plot
_axis_label_styleLanguage.Stochaskell.Plot
_axis_line_styleLanguage.Stochaskell.Plot
_axis_show_labelsLanguage.Stochaskell.Plot
_axis_show_lineLanguage.Stochaskell.Plot
_axis_show_ticksLanguage.Stochaskell.Plot
_axis_ticksLanguage.Stochaskell.Plot
_axis_tropweivLanguage.Stochaskell.Plot
_axis_viewportLanguage.Stochaskell.Plot
_axis_visibilityLanguage.Stochaskell.Plot
_azimuthLanguage.Stochaskell.Plot
_ConsLanguage.Stochaskell.Plot
_DynamicPlotLanguage.Stochaskell.Plot
_EmptyLanguage.Stochaskell.Plot
_fill_colorLanguage.Stochaskell.Plot
_font_colorLanguage.Stochaskell.Plot
_font_nameLanguage.Stochaskell.Plot
_font_sizeLanguage.Stochaskell.Plot
_font_slantLanguage.Stochaskell.Plot
_font_weightLanguage.Stochaskell.Plot
_GWrapped'Language.Stochaskell.Plot
_headLanguage.Stochaskell.Plot
_initLanguage.Stochaskell.Plot
_JustLanguage.Stochaskell.Plot
_lastLanguage.Stochaskell.Plot
_laxis_generateLanguage.Stochaskell.Plot
_laxis_overrideLanguage.Stochaskell.Plot
_laxis_reverseLanguage.Stochaskell.Plot
_laxis_styleLanguage.Stochaskell.Plot
_laxis_titleLanguage.Stochaskell.Plot
_laxis_title_styleLanguage.Stochaskell.Plot
_layoutlr_backgroundLanguage.Stochaskell.Plot
_layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_grid_lastLanguage.Stochaskell.Plot
_layoutlr_left_axisLanguage.Stochaskell.Plot
_layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_legendLanguage.Stochaskell.Plot
_layoutlr_marginLanguage.Stochaskell.Plot
_layoutlr_plotsLanguage.Stochaskell.Plot
_layoutlr_plot_backgroundLanguage.Stochaskell.Plot
_layoutlr_right_axisLanguage.Stochaskell.Plot
_layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_titleLanguage.Stochaskell.Plot
_layoutlr_title_styleLanguage.Stochaskell.Plot
_layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_x_axisLanguage.Stochaskell.Plot
_layout_backgroundLanguage.Stochaskell.Plot
_layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layout_grid_lastLanguage.Stochaskell.Plot
_layout_left_axis_visibilityLanguage.Stochaskell.Plot
_layout_legendLanguage.Stochaskell.Plot
_layout_marginLanguage.Stochaskell.Plot
_layout_plotsLanguage.Stochaskell.Plot
_layout_plot_backgroundLanguage.Stochaskell.Plot
_layout_right_axis_visibilityLanguage.Stochaskell.Plot
_layout_titleLanguage.Stochaskell.Plot
_layout_title_styleLanguage.Stochaskell.Plot
_layout_top_axis_visibilityLanguage.Stochaskell.Plot
_layout_x_axisLanguage.Stochaskell.Plot
_layout_y_axisLanguage.Stochaskell.Plot
_la_labelfLanguage.Stochaskell.Plot
_la_nLabelsLanguage.Stochaskell.Plot
_la_nTicksLanguage.Stochaskell.Plot
_LeftLanguage.Stochaskell.Plot
_legend_label_styleLanguage.Stochaskell.Plot
_legend_marginLanguage.Stochaskell.Plot
_legend_orientationLanguage.Stochaskell.Plot
_legend_plot_sizeLanguage.Stochaskell.Plot
_legend_positionLanguage.Stochaskell.Plot
_line_capLanguage.Stochaskell.Plot
_line_colorLanguage.Stochaskell.Plot
_line_dashesLanguage.Stochaskell.Plot
_line_joinLanguage.Stochaskell.Plot
_line_widthLanguage.Stochaskell.Plot
_loga_labelfLanguage.Stochaskell.Plot
_NothingLanguage.Stochaskell.Plot
_pie_backgroundLanguage.Stochaskell.Plot
_pie_colorsLanguage.Stochaskell.Plot
_pie_dataLanguage.Stochaskell.Plot
_pie_label_line_styleLanguage.Stochaskell.Plot
_pie_label_styleLanguage.Stochaskell.Plot
_pie_marginLanguage.Stochaskell.Plot
_pie_plotLanguage.Stochaskell.Plot
_pie_start_angleLanguage.Stochaskell.Plot
_pie_titleLanguage.Stochaskell.Plot
_pie_title_styleLanguage.Stochaskell.Plot
_pitem_labelLanguage.Stochaskell.Plot
_pitem_offsetLanguage.Stochaskell.Plot
_pitem_valueLanguage.Stochaskell.Plot
_plot_all_pointsLanguage.Stochaskell.Plot
_plot_annotation_angleLanguage.Stochaskell.Plot
_plot_annotation_backgroundLanguage.Stochaskell.Plot
_plot_annotation_hanchorLanguage.Stochaskell.Plot
_plot_annotation_styleLanguage.Stochaskell.Plot
_plot_annotation_valuesLanguage.Stochaskell.Plot
_plot_annotation_vanchorLanguage.Stochaskell.Plot
_plot_bars_alignmentLanguage.Stochaskell.Plot
_plot_bars_item_stylesLanguage.Stochaskell.Plot
_plot_bars_referenceLanguage.Stochaskell.Plot
_plot_bars_singleton_widthLanguage.Stochaskell.Plot
_plot_bars_spacingLanguage.Stochaskell.Plot
_plot_bars_styleLanguage.Stochaskell.Plot
_plot_bars_titlesLanguage.Stochaskell.Plot
_plot_bars_valuesLanguage.Stochaskell.Plot
_plot_candle_centreLanguage.Stochaskell.Plot
_plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
_plot_candle_fillLanguage.Stochaskell.Plot
_plot_candle_line_styleLanguage.Stochaskell.Plot
_plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
_plot_candle_tick_lengthLanguage.Stochaskell.Plot
_plot_candle_titleLanguage.Stochaskell.Plot
_plot_candle_valuesLanguage.Stochaskell.Plot
_plot_candle_widthLanguage.Stochaskell.Plot
_plot_errbars_line_styleLanguage.Stochaskell.Plot
_plot_errbars_overhangLanguage.Stochaskell.Plot
_plot_errbars_tick_lengthLanguage.Stochaskell.Plot
_plot_errbars_titleLanguage.Stochaskell.Plot
_plot_errbars_valuesLanguage.Stochaskell.Plot
_plot_fillbetween_styleLanguage.Stochaskell.Plot
_plot_fillbetween_titleLanguage.Stochaskell.Plot
_plot_fillbetween_valuesLanguage.Stochaskell.Plot
_plot_hidden_x_valuesLanguage.Stochaskell.Plot
_plot_hidden_y_valuesLanguage.Stochaskell.Plot
_plot_hist_binsLanguage.Stochaskell.Plot
_plot_hist_drop_linesLanguage.Stochaskell.Plot
_plot_hist_fill_styleLanguage.Stochaskell.Plot
_plot_hist_line_styleLanguage.Stochaskell.Plot
_plot_hist_norm_funcLanguage.Stochaskell.Plot
_plot_hist_no_zerosLanguage.Stochaskell.Plot
_plot_hist_rangeLanguage.Stochaskell.Plot
_plot_hist_titleLanguage.Stochaskell.Plot
_plot_hist_valuesLanguage.Stochaskell.Plot
_plot_legendLanguage.Stochaskell.Plot
_plot_lines_limit_valuesLanguage.Stochaskell.Plot
_plot_lines_styleLanguage.Stochaskell.Plot
_plot_lines_titleLanguage.Stochaskell.Plot
_plot_lines_valuesLanguage.Stochaskell.Plot
_plot_points_styleLanguage.Stochaskell.Plot
_plot_points_titleLanguage.Stochaskell.Plot
_plot_points_valuesLanguage.Stochaskell.Plot
_plot_renderLanguage.Stochaskell.Plot
_plot_vectors_gridLanguage.Stochaskell.Plot
_plot_vectors_mapfLanguage.Stochaskell.Plot
_plot_vectors_scaleLanguage.Stochaskell.Plot
_plot_vectors_styleLanguage.Stochaskell.Plot
_plot_vectors_titleLanguage.Stochaskell.Plot
_plot_vectors_valuesLanguage.Stochaskell.Plot
_point_border_colorLanguage.Stochaskell.Plot
_point_border_widthLanguage.Stochaskell.Plot
_point_colorLanguage.Stochaskell.Plot
_point_radiusLanguage.Stochaskell.Plot
_point_shapeLanguage.Stochaskell.Plot
_polarLanguage.Stochaskell.Plot
_rLanguage.Stochaskell.Plot
_radialLanguage.Stochaskell.Plot
_rect_cornerStyleLanguage.Stochaskell.Plot
_rect_fillStyleLanguage.Stochaskell.Plot
_rect_lineStyleLanguage.Stochaskell.Plot
_rect_minsizeLanguage.Stochaskell.Plot
_RightLanguage.Stochaskell.Plot
_ShowLanguage.Stochaskell.Plot
_slayouts_compress_legendLanguage.Stochaskell.Plot
_slayouts_layoutsLanguage.Stochaskell.Plot
_SnocLanguage.Stochaskell.Plot
_specBoundsLanguage.Stochaskell.Plot
_specColourMapLanguage.Stochaskell.Plot
_specScaleLanguage.Stochaskell.Plot
_specTransLanguage.Stochaskell.Plot
_tailLanguage.Stochaskell.Plot
_UnwrappedLanguage.Stochaskell.Plot
_Unwrapped'Language.Stochaskell.Plot
_UnwrappingLanguage.Stochaskell.Plot
_Unwrapping'Language.Stochaskell.Plot
_vector_head_styleLanguage.Stochaskell.Plot
_vector_line_styleLanguage.Stochaskell.Plot
_VoidLanguage.Stochaskell.Plot
_WrappedLanguage.Stochaskell.Plot
_Wrapped'Language.Stochaskell.Plot
_WrappingLanguage.Stochaskell.Plot
_Wrapping'Language.Stochaskell.Plot
|>Language.Stochaskell.Plot
||Language.Stochaskell.Prelude, Language.Stochaskell
||*Language.Stochaskell.Prelude, Language.Stochaskell
||=Language.Stochaskell.Plot
||~Language.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index)

stochaskell-1.0.0: A probabilistic programming language

Index

!Language.Stochaskell
!!Language.Stochaskell.Prelude, Language.Stochaskell
#Language.Stochaskell.Plot
#%%=Language.Stochaskell.Plot
#%%~Language.Stochaskell.Plot
#%=Language.Stochaskell.Plot
#%~Language.Stochaskell.Plot
#=Language.Stochaskell.Plot
#>Language.Stochaskell
#~Language.Stochaskell.Plot
$Language.Stochaskell.Prelude, Language.Stochaskell
$!Language.Stochaskell.Prelude, Language.Stochaskell
%%=Language.Stochaskell.Plot
%%@=Language.Stochaskell.Plot
%%@~Language.Stochaskell.Plot
%%~Language.Stochaskell.Plot
%=Language.Stochaskell.Plot
%@=Language.Stochaskell.Plot
%@~Language.Stochaskell.Plot
%~Language.Stochaskell.Plot
&Language.Stochaskell.Plot
&&Language.Stochaskell.Prelude, Language.Stochaskell
&&*Language.Stochaskell.Prelude, Language.Stochaskell
&&=Language.Stochaskell.Plot
&&~Language.Stochaskell.Plot
&=Language.Stochaskell.Plot
&~Language.Stochaskell.Plot
&~~Language.Stochaskell.Plot
*Language.Stochaskell.Prelude, Language.Stochaskell
**Language.Stochaskell.Prelude, Language.Stochaskell
**=Language.Stochaskell.Plot
**~Language.Stochaskell.Plot
*=Language.Stochaskell.Plot
*>Language.Stochaskell
*~Language.Stochaskell.Plot
+Language.Stochaskell.Prelude, Language.Stochaskell
++Language.Stochaskell.Prelude, Language.Stochaskell
+=Language.Stochaskell.Plot
+~Language.Stochaskell.Plot
-Language.Stochaskell.Prelude, Language.Stochaskell
-=Language.Stochaskell.Plot
-~Language.Stochaskell.Plot
.Language.Stochaskell.Prelude, Language.Stochaskell
...Language.Stochaskell
./.Language.Stochaskell.Plot
.=Language.Stochaskell.Plot
.>Language.Stochaskell.Plot
.@=Language.Stochaskell.Plot
.@~Language.Stochaskell.Plot
.|.Language.Stochaskell.Plot
.~Language.Stochaskell.Plot
/Language.Stochaskell.Prelude, Language.Stochaskell
//=Language.Stochaskell.Plot
//~Language.Stochaskell.Plot
/=Language.Stochaskell.Prelude, Language.Stochaskell
/=*Language.Stochaskell.Prelude, Language.Stochaskell
:<Language.Stochaskell.Plot
:>Language.Stochaskell.Plot
<Language.Stochaskell.Prelude, Language.Stochaskell
<#Language.Stochaskell
<#%=Language.Stochaskell.Plot
<#%~Language.Stochaskell.Plot
<#=Language.Stochaskell.Plot
<#~Language.Stochaskell.Plot
<$Language.Stochaskell.Prelude, Language.Stochaskell
<$!>Language.Stochaskell.Prelude, Language.Stochaskell
<$>Language.Stochaskell.Prelude, Language.Stochaskell
<%=Language.Stochaskell.Plot
<%@=Language.Stochaskell.Plot
<%@~Language.Stochaskell.Plot
<%~Language.Stochaskell.Plot
<&&=Language.Stochaskell.Plot
<&&~Language.Stochaskell.Plot
<&>Language.Stochaskell.Plot
<*Language.Stochaskell.Prelude, Language.Stochaskell
<**=Language.Stochaskell.Plot
<**~Language.Stochaskell.Plot
<*=Language.Stochaskell.Plot
<*>Language.Stochaskell.Prelude, Language.Stochaskell
<*~Language.Stochaskell.Plot
<+=Language.Stochaskell.Plot
<+~Language.Stochaskell.Plot
<-=Language.Stochaskell.Plot
<-~Language.Stochaskell.Plot
<.Language.Stochaskell.Plot
<.=Language.Stochaskell.Plot
<.> 
1 (Function)Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
<.~Language.Stochaskell.Plot
<//=Language.Stochaskell.Plot
<//~Language.Stochaskell.Plot
<<%=Language.Stochaskell.Plot
<<%@=Language.Stochaskell.Plot
<<%@~Language.Stochaskell.Plot
<<%~Language.Stochaskell.Plot
<<&&=Language.Stochaskell.Plot
<<&&~Language.Stochaskell.Plot
<<**=Language.Stochaskell.Plot
<<**~Language.Stochaskell.Plot
<<*=Language.Stochaskell.Plot
<<*~Language.Stochaskell.Plot
<<+=Language.Stochaskell.Plot
<<+~Language.Stochaskell.Plot
<<-=Language.Stochaskell.Plot
<<-~Language.Stochaskell.Plot
<<.=Language.Stochaskell.Plot
<<.~Language.Stochaskell.Plot
<<//=Language.Stochaskell.Plot
<<//~Language.Stochaskell.Plot
<<<>=Language.Stochaskell.Plot
<<<>~Language.Stochaskell.Plot
<<>=Language.Stochaskell.Plot
<<>~Language.Stochaskell.Plot
<<?=Language.Stochaskell.Plot
<<?~Language.Stochaskell.Plot
<<^=Language.Stochaskell.Plot
<<^^=Language.Stochaskell.Plot
<<^^~Language.Stochaskell.Plot
<<^~Language.Stochaskell.Plot
<<||=Language.Stochaskell.Plot
<<||~Language.Stochaskell.Plot
<<~Language.Stochaskell.Plot
<=Language.Stochaskell.Prelude, Language.Stochaskell
<=*Language.Stochaskell.Prelude, Language.Stochaskell
<=<Language.Stochaskell.Prelude, Language.Stochaskell
<>Language.Stochaskell.Prelude, Language.Stochaskell
<>=Language.Stochaskell.Plot
<>~Language.Stochaskell.Plot
<?=Language.Stochaskell.Plot
<?~Language.Stochaskell.Plot
<^=Language.Stochaskell.Plot
<^^=Language.Stochaskell.Plot
<^^~Language.Stochaskell.Plot
<^~Language.Stochaskell.Plot
<|Language.Stochaskell.Plot
<||=Language.Stochaskell.Plot
<||~Language.Stochaskell.Plot
<~Language.Stochaskell.Plot
=<<Language.Stochaskell.Prelude, Language.Stochaskell
==Language.Stochaskell.Prelude, Language.Stochaskell
==*Language.Stochaskell.Prelude, Language.Stochaskell
>Language.Stochaskell.Prelude, Language.Stochaskell
>$Language.Stochaskell.Plot
>*Language.Stochaskell.Prelude, Language.Stochaskell
>=Language.Stochaskell.Prelude, Language.Stochaskell
>=*Language.Stochaskell.Prelude, Language.Stochaskell
>=>Language.Stochaskell.Prelude, Language.Stochaskell
>>Language.Stochaskell.Prelude, Language.Stochaskell
>>=Language.Stochaskell.Prelude, Language.Stochaskell
?=Language.Stochaskell.Plot
??Language.Stochaskell.Plot
?~Language.Stochaskell.Plot
abbreviatedFieldsLanguage.Stochaskell.Plot
abbreviatedNamerLanguage.Stochaskell.Plot
aboveLanguage.Stochaskell.Plot
aboveNLanguage.Stochaskell.Plot
aboveWideLanguage.Stochaskell.Plot
absLanguage.Stochaskell.Prelude, Language.Stochaskell
AbsoluteExtendLanguage.Stochaskell.Plot
AbstractArrayLanguage.Stochaskell
AccessingLanguage.Stochaskell.Plot
acosLanguage.Stochaskell.Prelude, Language.Stochaskell
acoshLanguage.Stochaskell.Prelude, Language.Stochaskell
adaptEngagedLanguage.Stan
addColourBarLanguage.Stochaskell.Plot
addIndexesLanguage.Stochaskell.Plot
addLegendEntryLanguage.Stochaskell.Plot
addMarginsLanguage.Stochaskell.Plot
addPlotLanguage.Stochaskell.Plot
addPlotableLanguage.Stochaskell.Plot
addPlotable'Language.Stochaskell.Plot
addToALLanguage.Stochaskell
adjointLanguage.Stochaskell.Plot
afCoordAlignFnLanguage.Stochaskell.Plot
affineComboLanguage.Stochaskell.Plot
AffineSpaceLanguage.Stochaskell.Plot
afPointAlignFnLanguage.Stochaskell.Plot
alaLanguage.Stochaskell.Plot
alafLanguage.Stochaskell.Plot
ALensLanguage.Stochaskell.Plot
ALens'Language.Stochaskell.Plot
aliceblueLanguage.Stochaskell.Plot
alignFillPathLanguage.Stochaskell.Plot
alignFillPointLanguage.Stochaskell.Plot
alignFillPointsLanguage.Stochaskell.Plot
AlignmentFnLanguage.Stochaskell.Plot
AlignmentFns 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
alignPathLanguage.Stochaskell.Plot
alignStrokePathLanguage.Stochaskell.Plot
alignStrokePointLanguage.Stochaskell.Plot
alignStrokePointsLanguage.Stochaskell.Plot
All 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
allLanguage.Stochaskell.Prelude, Language.Stochaskell
allOfLanguage.Stochaskell.Plot
alongsideLanguage.Stochaskell.Plot
alphaChannelLanguage.Stochaskell.Plot
AlphaColourLanguage.Stochaskell.Plot
alphaColourConvertLanguage.Stochaskell.Plot
Alt 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
alwaysElemRIndexLanguage.Stochaskell
andLanguage.Stochaskell.Prelude, Language.Stochaskell
andOfLanguage.Stochaskell.Plot
AnEqualityLanguage.Stochaskell.Plot
AnEquality'Language.Stochaskell.Plot
AnIndexedLensLanguage.Stochaskell.Plot
AnIndexedLens'Language.Stochaskell.Plot
AnIndexedSetterLanguage.Stochaskell.Plot
AnIndexedSetter'Language.Stochaskell.Plot
AnIndexedTraversalLanguage.Stochaskell.Plot
AnIndexedTraversal'Language.Stochaskell.Plot
AnIndexedTraversal1Language.Stochaskell.Plot
AnIndexedTraversal1'Language.Stochaskell.Plot
AnIsoLanguage.Stochaskell.Plot
AnIso'Language.Stochaskell.Plot
anonLanguage.Stochaskell.Plot
antiquewhiteLanguage.Stochaskell.Plot
Any 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
anyLanguage.Stochaskell.Prelude, Language.Stochaskell
anyOfLanguage.Stochaskell.Plot
Ap 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
apLanguage.Stochaskell.Prelude, Language.Stochaskell
appendFileLanguage.Stochaskell.Prelude, Language.Stochaskell
appEndoLanguage.Stochaskell.Prelude, Language.Stochaskell
ApplicativeLanguage.Stochaskell.Prelude, Language.Stochaskell
applyAreaStyleLanguage.Stochaskell.Plot
applyLineStyleLanguage.Stochaskell.Plot
applyMarkerStyleLanguage.Stochaskell.Plot
applyTextStyleLanguage.Stochaskell.Plot
APrismLanguage.Stochaskell.Plot
APrism'Language.Stochaskell.Plot
aquaLanguage.Stochaskell.Plot
aquamarineLanguage.Stochaskell.Plot
ArcLanguage.Stochaskell.Plot
arcLanguage.Stochaskell.Plot
arc'Language.Stochaskell.Plot
ArcNegLanguage.Stochaskell.Plot
arcNegLanguage.Stochaskell.Plot
arcNeg'Language.Stochaskell.Plot
AreaSpots 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
AreaSpots4D 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
areaStyleLanguage.Stochaskell.Plot
areaStyleFunctionLanguage.Stochaskell.Plot
area_spots_4d_linethickLanguage.Stochaskell.Plot
area_spots_4d_max_radiusLanguage.Stochaskell.Plot
area_spots_4d_opacityLanguage.Stochaskell.Plot
area_spots_4d_paletteLanguage.Stochaskell.Plot
area_spots_4d_titleLanguage.Stochaskell.Plot
area_spots_4d_valuesLanguage.Stochaskell.Plot
area_spots_fillcolourLanguage.Stochaskell.Plot
area_spots_linecolourLanguage.Stochaskell.Plot
area_spots_linethickLanguage.Stochaskell.Plot
area_spots_max_radiusLanguage.Stochaskell.Plot
area_spots_opacityLanguage.Stochaskell.Plot
area_spots_titleLanguage.Stochaskell.Plot
area_spots_valuesLanguage.Stochaskell.Plot
AReviewLanguage.Stochaskell.Plot
argumentLanguage.Stochaskell.Plot
ArrayTLanguage.Stochaskell.Expression
arrowsLanguage.Stochaskell.Plot
AsLanguage.Stochaskell.Plot
asColumnLanguage.Stochaskell
AsEmptyLanguage.Stochaskell.Plot
ASetterLanguage.Stochaskell.Plot
ASetter'Language.Stochaskell.Plot
asideLanguage.Stochaskell.Plot
asinLanguage.Stochaskell.Prelude, Language.Stochaskell
asIndexLanguage.Stochaskell.Plot
asinhLanguage.Stochaskell.Prelude, Language.Stochaskell
asRowLanguage.Stochaskell
assignLanguage.Stochaskell.Plot
assignALanguage.Stochaskell.Plot
asteriskLanguage.Stochaskell.Plot
asTypeOfLanguage.Stochaskell.Prelude, Language.Stochaskell
asumOfLanguage.Stochaskell.Plot
AtLanguage.Stochaskell.Plot
atLanguage.Stochaskell.Plot
atanLanguage.Stochaskell.Prelude, Language.Stochaskell
atan2Language.Stochaskell.Prelude, Language.Stochaskell
atanhLanguage.Stochaskell.Prelude, Language.Stochaskell
atMajorTicksLanguage.Stochaskell.Plot
atopLanguage.Stochaskell.Plot
ATraversalLanguage.Stochaskell.Plot
ATraversal'Language.Stochaskell.Plot
ATraversal1Language.Stochaskell.Plot
ATraversal1'Language.Stochaskell.Plot
auLanguage.Stochaskell.Plot
aufLanguage.Stochaskell.Plot
autoAxisLanguage.Stochaskell.Plot
autoIndexAxisLanguage.Stochaskell.Plot
AutoScaleLanguage.Stochaskell.Plot
autoScaledAxisLanguage.Stochaskell.Plot
autoScaledIntAxisLanguage.Stochaskell.Plot
autoScaledLogAxisLanguage.Stochaskell.Plot
autoStepsLanguage.Stochaskell.Plot
AutoTickLanguage.Stochaskell.Plot
autoTicksLanguage.Stochaskell.Plot
autoTimeValueAxisLanguage.Stochaskell.Plot
AutoUniformScaleLanguage.Stochaskell.Plot
axesLanguage.Stochaskell.Plot
AxisLanguage.Stochaskell.Plot
axisColourMapLanguage.Stochaskell.Plot
AxisData 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisExtendLanguage.Stochaskell.Plot
AxisFnLanguage.Stochaskell.Plot
axisGridAtBigTicksLanguage.Stochaskell.Plot
axisGridAtLabelsLanguage.Stochaskell.Plot
axisGridAtTicksLanguage.Stochaskell.Plot
axisGridHideLanguage.Stochaskell.Plot
AxisLabelLanguage.Stochaskell.Plot
axisLabelLanguage.Stochaskell.Plot
axisLabelGapLanguage.Stochaskell.Plot
AxisLabelPlacementLanguage.Stochaskell.Plot
axisLabelPlacementLanguage.Stochaskell.Plot
AxisLabelPositionLanguage.Stochaskell.Plot
axisLabelPositionLanguage.Stochaskell.Plot
axisLabelsOverrideLanguage.Stochaskell.Plot
axisLabelStyleLanguage.Stochaskell.Plot
axisLabelTextLanguage.Stochaskell.Plot
axisLabelTextFunctionLanguage.Stochaskell.Plot
axisOverhangLanguage.Stochaskell.Plot
axisPlotsLanguage.Stochaskell.Plot
AxisScalingLanguage.Stochaskell.Plot
axisScalingLanguage.Stochaskell.Plot
axisSizeLanguage.Stochaskell.Plot
AxisSpec 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisStyleLanguage.Stochaskell.Plot
axisStylesLanguage.Stochaskell.Plot
AxisT 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axisToRenderableLanguage.Stochaskell.Plot
AxisVisibility 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
axis_gridLanguage.Stochaskell.Plot
axis_grid_styleLanguage.Stochaskell.Plot
axis_labelsLanguage.Stochaskell.Plot
axis_label_gapLanguage.Stochaskell.Plot
axis_label_styleLanguage.Stochaskell.Plot
axis_line_styleLanguage.Stochaskell.Plot
axis_show_labelsLanguage.Stochaskell.Plot
axis_show_lineLanguage.Stochaskell.Plot
axis_show_ticksLanguage.Stochaskell.Plot
axis_ticksLanguage.Stochaskell.Plot
axis_tropweivLanguage.Stochaskell.Plot
axis_viewportLanguage.Stochaskell.Plot
axis_visibilityLanguage.Stochaskell.Plot
azureLanguage.Stochaskell.Plot
BLanguage.Stochaskell
BackendProgramLanguage.Stochaskell.Plot
backwardsLanguage.Stochaskell.Plot
BarLayoutLanguage.Stochaskell.Plot
barLayoutLanguage.Stochaskell.Plot
BarPlotLanguage.Stochaskell.Plot
barPlotLanguage.Stochaskell.Plot
barPlot'Language.Stochaskell.Plot
barsLanguage.Stochaskell.Plot
barsAddLanguage.Stochaskell.Plot
BarsCenteredLanguage.Stochaskell.Plot
BarsClusteredLanguage.Stochaskell.Plot
BarsFixGapLanguage.Stochaskell.Plot
BarsFixWidthLanguage.Stochaskell.Plot
BarsLeftLanguage.Stochaskell.Plot
barSpacingLanguage.Stochaskell.Plot
BarsPlotValueLanguage.Stochaskell.Plot
barsReferenceLanguage.Stochaskell.Plot
BarsRightLanguage.Stochaskell.Plot
BarsStackedLanguage.Stochaskell.Plot
barStartLanguage.Stochaskell.Plot
barWidthLanguage.Stochaskell.Plot
BaseSpaceLanguage.Stochaskell.Plot
Bazaar 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Bazaar'Language.Stochaskell.Plot
Bazaar1 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Bazaar1'Language.Stochaskell.Plot
beigeLanguage.Stochaskell.Plot
belowLanguage.Stochaskell.Plot
BernoulliLanguage.Stochaskell
bernoulliLanguage.Stochaskell
bernoulliLogitLanguage.Stochaskell
bernoulliLogitsLanguage.Stochaskell
BernoullisLanguage.Stochaskell
bernoullisLanguage.Stochaskell
besideLanguage.Stochaskell.Plot
besideNLanguage.Stochaskell.Plot
besideTallLanguage.Stochaskell.Plot
BetaLanguage.Stochaskell
betaLanguage.Stochaskell
BetweenTicksLanguage.Stochaskell.Plot
BifunctorLanguage.Stochaskell.Plot
bimapLanguage.Stochaskell.Plot
bimappingLanguage.Stochaskell.Plot
binarizeLanguage.Stochaskell
binRangeLanguage.Stochaskell.Plot
bisqueLanguage.Stochaskell.Plot
bitmapAlignmentFnsLanguage.Stochaskell.Plot
blackLanguage.Stochaskell.Plot
blackAndWhiteLanguage.Stochaskell.Plot
blanchedalmondLanguage.Stochaskell.Plot
blendLanguage.Stochaskell.Plot
blockMatrixLanguage.Stochaskell
blockVectorLanguage.Stochaskell
blueLanguage.Stochaskell.Plot
bluevioletLanguage.Stochaskell.Plot
BMatLanguage.Stochaskell
BoolLanguage.Stochaskell.Prelude, Language.Stochaskell
BooleanLanguage.Stochaskell.Prelude, Language.Stochaskell
booleanLanguage.Stochaskell
BooleanOfLanguage.Stochaskell.Prelude, Language.Stochaskell
boolTLanguage.Stochaskell.Expression
bothLanguage.Stochaskell.Plot
both1Language.Stochaskell.Plot
bothTicksLanguage.Stochaskell.Plot
bottomLanguage.Stochaskell.Plot
bottomLeftLanguage.Stochaskell.Plot
bottomRightLanguage.Stochaskell.Plot
BoundedLanguage.Stochaskell.Prelude, Language.Stochaskell
boundMaxLanguage.Stochaskell.Plot
boundMinLanguage.Stochaskell.Plot
boundsLanguage.Stochaskell
breakLanguage.Stochaskell.Prelude, Language.Stochaskell
breakListLanguage.Stochaskell
brownLanguage.Stochaskell.Plot
BubbleOptionsLanguage.Stochaskell.Plot
bubbleOptionsLanguage.Stochaskell.Plot
bubblePlotLanguage.Stochaskell.Plot
bubblePlot'Language.Stochaskell.Plot
bubblePlotOfLanguage.Stochaskell.Plot
bubblePlotOf'Language.Stochaskell.Plot
bubbleStyleLanguage.Stochaskell.Plot
bubbleTransformLanguage.Stochaskell.Plot
buildPlotsLanguage.Stochaskell.Plot
burlywoodLanguage.Stochaskell.Plot
BVecLanguage.Stochaskell
cadetblueLanguage.Stochaskell.Plot
calculateBoundsLanguage.Stochaskell.Plot
calculateScalingLanguage.Stochaskell.Plot
camelCaseFieldsLanguage.Stochaskell.Plot
camelCaseNamerLanguage.Stochaskell.Plot
Candle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
candle_closeLanguage.Stochaskell.Plot
candle_highLanguage.Stochaskell.Plot
candle_lowLanguage.Stochaskell.Plot
candle_midLanguage.Stochaskell.Plot
candle_openLanguage.Stochaskell.Plot
candle_xLanguage.Stochaskell.Plot
caseBLanguage.Stochaskell.Prelude, Language.Stochaskell
caseZLanguage.Stochaskell
CastLanguage.Stochaskell
castLanguage.Stochaskell
catMaybesLanguage.Stochaskell.Prelude, Language.Stochaskell
CauchyLanguage.Stochaskell
cauchyLanguage.Stochaskell
cdfLanguage.Stochaskell.Plot
ceilingLanguage.Stochaskell.Prelude, Language.Stochaskell
censoringLanguage.Stochaskell.Plot
centerTicksLanguage.Stochaskell.Plot
centreTicksLanguage.Stochaskell.Plot
chainLanguage.Stochaskell
chain'Language.Stochaskell
chainRangeLanguage.Stochaskell
chainRange'Language.Stochaskell
ChangeHorizontalLimitsLanguage.Stochaskell.Plot
ChangeVerticalLimitsLanguage.Stochaskell.Plot
CharLanguage.Stochaskell.Prelude, Language.Stochaskell
chartreuseLanguage.Stochaskell.Plot
childrenLanguage.Stochaskell.Plot
chocolateLanguage.Stochaskell.Plot
ChoiceLanguage.Stochaskell.Plot
cholLanguage.Stochaskell
choosingLanguage.Stochaskell.Plot
chosenLanguage.Stochaskell.Plot
CircleLanguage.Stochaskell.Plot
classUnderscoreNoPrefixFieldsLanguage.Stochaskell.Plot
classUnderscoreNoPrefixNamerLanguage.Stochaskell.Plot
ClassyNamerLanguage.Stochaskell.Plot
classyRulesLanguage.Stochaskell.Plot
classyRules_Language.Stochaskell.Plot
clipPlotLanguage.Stochaskell.Plot
cloneIndexedLensLanguage.Stochaskell.Plot
cloneIndexedSetterLanguage.Stochaskell.Plot
cloneIndexedTraversalLanguage.Stochaskell.Plot
cloneIndexedTraversal1Language.Stochaskell.Plot
cloneIndexPreservingLensLanguage.Stochaskell.Plot
cloneIndexPreservingSetterLanguage.Stochaskell.Plot
cloneIndexPreservingTraversalLanguage.Stochaskell.Plot
cloneIndexPreservingTraversal1Language.Stochaskell.Plot
cloneIsoLanguage.Stochaskell.Plot
cloneLensLanguage.Stochaskell.Plot
clonePrismLanguage.Stochaskell.Plot
cloneSetterLanguage.Stochaskell.Plot
cloneTraversalLanguage.Stochaskell.Plot
cloneTraversal1Language.Stochaskell.Plot
CloseLanguage.Stochaskell.Plot
closeLanguage.Stochaskell.Plot
cmTraverseLanguage.Stochaskell.Plot
coercedLanguage.Stochaskell.Plot
colorsLanguage.Stochaskell.Plot
ColourLanguage.Stochaskell.Plot
ColourBarLanguage.Stochaskell.Plot
colourBarLanguage.Stochaskell.Plot
colourBarDrawLanguage.Stochaskell.Plot
colourBarGapLanguage.Stochaskell.Plot
colourBarLengthFunctionLanguage.Stochaskell.Plot
colourBarRangeLanguage.Stochaskell.Plot
colourBarStyleLanguage.Stochaskell.Plot
colourBarWidthLanguage.Stochaskell.Plot
colourConvertLanguage.Stochaskell.Plot
colourListLanguage.Stochaskell.Plot
ColourMapLanguage.Stochaskell.Plot
colourMapLanguage.Stochaskell.Plot
ColourOpsLanguage.Stochaskell.Plot
colours1Language.Stochaskell.Plot
colours2Language.Stochaskell.Plot
compareLanguage.Stochaskell.Prelude, Language.Stochaskell
compileCCLanguage.Stochaskell
composOpFoldLanguage.Stochaskell.Plot
computedHistogramLanguage.Stochaskell.Plot
concatLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapOfLanguage.Stochaskell.Plot
concatOfLanguage.Stochaskell.Plot
condLanguage.Stochaskell.Prelude, Language.Stochaskell
ConditionOfLanguage.Stochaskell.Prelude, Language.Stochaskell
confusingLanguage.Stochaskell.Plot
ConjoinedLanguage.Stochaskell.Plot
conjoinedLanguage.Stochaskell.Plot
connectingLineLanguage.Stochaskell.Plot
ConsLanguage.Stochaskell.Plot
consLanguage.Stochaskell.Plot
Const 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
constLanguage.Stochaskell.Prelude, Language.Stochaskell
constExprLanguage.Stochaskell.Expression
constructLanguage.Stochaskell.Expression
ConstructorLanguage.Stochaskell.Expression
constSymbolLanguage.Stochaskell
ConstValLanguage.Stochaskell.Expression
constValLanguage.Stochaskell.Expression
ContainsLanguage.Stochaskell.Plot
contains 
1 (Function)Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
Context 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Context'Language.Stochaskell.Plot
contextsLanguage.Stochaskell.Plot
contextsOfLanguage.Stochaskell.Plot
contextsOnLanguage.Stochaskell.Plot
contextsOnOfLanguage.Stochaskell.Plot
contramapLanguage.Stochaskell.Plot
contramappedLanguage.Stochaskell.Plot
contramappingLanguage.Stochaskell.Plot
ContravariantLanguage.Stochaskell.Plot
coralLanguage.Stochaskell.Plot
cornflowerblueLanguage.Stochaskell.Plot
cornsilkLanguage.Stochaskell.Plot
corrLKJLanguage.Stochaskell
cosLanguage.Stochaskell.Prelude, Language.Stochaskell
coshLanguage.Stochaskell.Prelude, Language.Stochaskell
cosmosLanguage.Stochaskell.Plot
cosmosOfLanguage.Stochaskell.Plot
cosmosOnLanguage.Stochaskell.Plot
cosmosOnOfLanguage.Stochaskell.Plot
countLanguage.Stochaskell.Plot
countDensityLanguage.Stochaskell.Plot
countElemLanguage.Stochaskell
createClassLanguage.Stochaskell.Plot
crimsonLanguage.Stochaskell.Plot
cropLanguage.Stochaskell.Prelude, Language.Stochaskell
crossShapeLanguage.Stochaskell.Plot
CStateLanguage.Stochaskell.Plot
cumilativeLanguage.Stochaskell.Plot
currentPlotsLanguage.Stochaskell.Plot
curriedLanguage.Stochaskell.Plot
curryLanguage.Stochaskell.Prelude, Language.Stochaskell
CustomLegendPicLanguage.Stochaskell.Plot
cyanLanguage.Stochaskell.Plot
cycleLanguage.Stochaskell.Prelude, Language.Stochaskell
cycledLanguage.Stochaskell.Plot
dLanguage.Stochaskell
darkblueLanguage.Stochaskell.Plot
darkcyanLanguage.Stochaskell.Plot
darkenLanguage.Stochaskell.Plot
darkgoldenrodLanguage.Stochaskell.Plot
darkgrayLanguage.Stochaskell.Plot
darkgreenLanguage.Stochaskell.Plot
darkgreyLanguage.Stochaskell.Plot
darkkhakiLanguage.Stochaskell.Plot
darkmagentaLanguage.Stochaskell.Plot
darkolivegreenLanguage.Stochaskell.Plot
darkorangeLanguage.Stochaskell.Plot
darkorchidLanguage.Stochaskell.Plot
darkredLanguage.Stochaskell.Plot
darksalmonLanguage.Stochaskell.Plot
darkseagreenLanguage.Stochaskell.Plot
darkslateblueLanguage.Stochaskell.Plot
darkslategrayLanguage.Stochaskell.Plot
darkslategreyLanguage.Stochaskell.Plot
darkturquoiseLanguage.Stochaskell.Plot
darkvioletLanguage.Stochaskell.Plot
dashedLineLanguage.Stochaskell.Plot
daysLanguage.Stochaskell.Plot
debugLanguage.Stochaskell
declareClassyLanguage.Stochaskell.Plot
declareClassyForLanguage.Stochaskell.Plot
declareFieldsLanguage.Stochaskell.Plot
declareLensesLanguage.Stochaskell.Plot
declareLensesForLanguage.Stochaskell.Plot
declareLensesWithLanguage.Stochaskell.Plot
declarePrismsLanguage.Stochaskell.Plot
declareWrappedLanguage.Stochaskell.Plot
decodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
deconstructLanguage.Stochaskell.Expression
deepLanguage.Stochaskell.Plot
deepOfLanguage.Stochaskell.Plot
deeppinkLanguage.Stochaskell.Plot
deepseqLanguage.Stochaskell
deepskyblueLanguage.Stochaskell.Plot
defLanguage.Stochaskell.Plot
DefaultLanguage.Stochaskell.Plot
defaultAxisLineStyleLanguage.Stochaskell.Plot
defaultColorSeqLanguage.Stochaskell.Plot
defaultFieldRulesLanguage.Stochaskell.Plot
defaultFloatPlotHistLanguage.Stochaskell.Plot
defaultGridLineStyleLanguage.Stochaskell.Plot
defaultIntAxisLanguage.Stochaskell.Plot
DefaultLegendPicLanguage.Stochaskell.Plot
defaultNormedPlotHistLanguage.Stochaskell.Plot
defaultPlotHistLanguage.Stochaskell.Plot
defaultPlotLineStyleLanguage.Stochaskell.Plot
defaultPyMC3InferenceLanguage.PyMC3
defaultStanMethodLanguage.Stan
defColourBarLanguage.Stochaskell.Plot
defLegendPicLanguage.Stochaskell.Plot
DefNameLanguage.Stochaskell.Plot
deleteLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteAtLanguage.Stochaskell
deleteByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteFirstsByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteIndexLanguage.Stochaskell
delFromALLanguage.Stochaskell
densityLanguage.Stochaskell
density'Language.Stochaskell
designMatrixLanguage.Stochaskell
detLanguage.Stochaskell
devoidLanguage.Stochaskell.Plot
DExprLanguage.Stochaskell.Expression
diagLanguage.Stochaskell
diamondLanguage.Stochaskell.Plot
dimapLanguage.Stochaskell.Plot
dimappingLanguage.Stochaskell.Plot
dimgrayLanguage.Stochaskell.Plot
dimgreyLanguage.Stochaskell.Plot
displayLanguage.Stochaskell.Plot
dissolveLanguage.Stochaskell.Plot
distribLanguage.Stochaskell.Plot
DistributionLanguage.Stochaskell
divLanguage.Stochaskell.Prelude, Language.Stochaskell
divModLanguage.Stochaskell.Prelude, Language.Stochaskell
dodgerblueLanguage.Stochaskell.Plot
dotApplyLanguage.Graphviz
dotConstLanguage.Graphviz
dotConstsLanguage.Graphviz
dotDAGLanguage.Graphviz
dotIdLanguage.Graphviz
dotNodeLanguage.Graphviz
dotNodeRefLanguage.Graphviz
dotPBlockLanguage.Graphviz
dotPNodeLanguage.Graphviz
dotPNodesLanguage.Graphviz
DoubleLanguage.Stochaskell.Prelude, Language.Stochaskell
doubleFromTimeValueLanguage.Stochaskell.Plot
drawLegendLanguage.Stochaskell.Plot
drawPointLanguage.Stochaskell.Plot
drawRectangleLanguage.Stochaskell.Plot
drawTextLanguage.Stochaskell.Plot
drawTextALanguage.Stochaskell.Plot
drawTextRLanguage.Stochaskell.Plot
drawTextsRLanguage.Stochaskell.Plot
drawTitleLanguage.Stochaskell.Plot
dropLanguage.Stochaskell.Prelude, Language.Stochaskell
droppingLanguage.Stochaskell.Plot
droppingWhileLanguage.Stochaskell.Plot
dropWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileEndLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileListLanguage.Stochaskell
Dual 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
DynamicPlot 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
dynamicPlotLanguage.Stochaskell.Plot
dynamicPlotModsLanguage.Stochaskell.Plot
EachLanguage.Stochaskell.Plot
eachLanguage.Stochaskell.Plot
ECLanguage.Stochaskell.Plot
edgeApplyLanguage.Graphviz
edgeDAGLanguage.Graphviz
edgeNodeLanguage.Graphviz
edgeNodeRefLanguage.Graphviz
edgeNodeRefsLanguage.Graphviz
edgePBlockLanguage.Graphviz
edgePNodeLanguage.Graphviz
edgePNodesLanguage.Graphviz
edProgramLanguage.Edward
EEnvLanguage.Stochaskell.Expression
EitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherToMonadErrorLanguage.Stochaskell
elemLanguage.Stochaskell.Prelude, Language.Stochaskell
elementLanguage.Stochaskell.Plot
elementOfLanguage.Stochaskell.Plot
elementsLanguage.Stochaskell.Plot
elementsOfLanguage.Stochaskell.Plot
elemIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndexOfLanguage.Stochaskell.Plot
elemIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndicesOfLanguage.Stochaskell.Plot
elemOfLanguage.Stochaskell.Plot
elemRIndexLanguage.Stochaskell
embedRenderableLanguage.Stochaskell.Plot
EmptyLanguage.Stochaskell.Plot
emptyLanguage.Stochaskell.Plot
emptyGridLineFunctionLanguage.Stochaskell.Plot
emptyRenderableLanguage.Stochaskell.Plot
encodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
EndLanguage.Stochaskell.Plot
Endo 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
endswithLanguage.Stochaskell
EnumLanguage.Stochaskell.Prelude, Language.Stochaskell
enumLanguage.Stochaskell.Plot
enumFromLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenToLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromToLanguage.Stochaskell.Prelude, Language.Stochaskell
EnvLanguage.Stochaskell.Expression
ep_xLanguage.Stochaskell.Plot
ep_yLanguage.Stochaskell.Plot
EQLanguage.Stochaskell.Prelude, Language.Stochaskell
EqLanguage.Stochaskell.Prelude, Language.Stochaskell
EqBLanguage.Stochaskell.Prelude, Language.Stochaskell
EqualityLanguage.Stochaskell.Plot
Equality'Language.Stochaskell.Plot
erLanguage.Stochaskell.Plot
eraseLanguage.Stochaskell.Expression
errorLanguage.Stochaskell.Prelude, Language.Stochaskell
errorWithoutStackTraceLanguage.Stochaskell.Prelude, Language.Stochaskell
ErrPoint 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
ErrValue 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
ethetaLanguage.Stochaskell.Plot
EvalLanguage.Stochaskell.Expression
eval'Language.Stochaskell.Expression
eval_Language.Stochaskell.Expression
evenLanguage.Stochaskell.Prelude, Language.Stochaskell
ev_bestLanguage.Stochaskell.Plot
ev_highLanguage.Stochaskell.Plot
ev_lowLanguage.Stochaskell.Plot
execECLanguage.Stochaskell.Plot
exesLanguage.Stochaskell.Plot
expLanguage.Stochaskell.Prelude, Language.Stochaskell
exponentLanguage.Stochaskell.Prelude, Language.Stochaskell
ExprLanguage.Stochaskell.Expression
Expression 
1 (Type/Class)Language.Stochaskell.Expression, Language.Stochaskell
2 (Data Constructor)Language.Stochaskell.Expression
ExprTupleLanguage.Stochaskell.Expression
ExprTypeLanguage.Stochaskell.Expression
ExtendingLanguage.Stochaskell.Plot
eyeLanguage.Stochaskell
E_BottomLanguage.Stochaskell.Plot
E_LeftLanguage.Stochaskell.Plot
E_RightLanguage.Stochaskell.Plot
E_TopLanguage.Stochaskell.Plot
eθLanguage.Stochaskell.Plot
factorial'Language.Stochaskell
fadedColoursLanguage.Stochaskell.Plot
failLanguage.Stochaskell.Prelude, Language.Stochaskell
failingLanguage.Stochaskell.Plot
failoverLanguage.Stochaskell.Plot
FalseLanguage.Stochaskell.Prelude, Language.Stochaskell
falseLanguage.Stochaskell.Prelude, Language.Stochaskell
Field1Language.Stochaskell.Plot
Field10Language.Stochaskell.Plot
Field11Language.Stochaskell.Plot
Field12Language.Stochaskell.Plot
Field13Language.Stochaskell.Plot
Field14Language.Stochaskell.Plot
Field15Language.Stochaskell.Plot
Field16Language.Stochaskell.Plot
Field17Language.Stochaskell.Plot
Field18Language.Stochaskell.Plot
Field19Language.Stochaskell.Plot
Field2Language.Stochaskell.Plot
Field3Language.Stochaskell.Plot
Field4Language.Stochaskell.Plot
Field5Language.Stochaskell.Plot
Field6Language.Stochaskell.Plot
Field7Language.Stochaskell.Plot
Field8Language.Stochaskell.Plot
Field9Language.Stochaskell.Plot
FieldNamerLanguage.Stochaskell.Plot
FilePathLanguage.Stochaskell.Prelude, Language.Stochaskell
fillBackgroundLanguage.Stochaskell.Plot
filledCirclesLanguage.Stochaskell.Plot
filledPolygonLanguage.Stochaskell.Plot
fillPathLanguage.Stochaskell.Plot
fillPointPathLanguage.Stochaskell.Plot
FillStyleLanguage.Stochaskell.Plot
FillStyleSolidLanguage.Stochaskell.Plot
fill_colorLanguage.Stochaskell.Plot
filterLanguage.Stochaskell.Prelude, Language.Stochaskell
filteredLanguage.Stochaskell.Plot
filterMLanguage.Stochaskell.Prelude, Language.Stochaskell
finalPlotsLanguage.Stochaskell.Plot
findLanguage.Stochaskell.Prelude, Language.Stochaskell
find'Language.Stochaskell
findIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndexOfLanguage.Stochaskell.Plot
findIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndicesOfLanguage.Stochaskell.Plot
findMOfLanguage.Stochaskell.Plot
findOfLanguage.Stochaskell.Plot
findSortedInsertIndexLanguage.Stochaskell
findSortedInsertIndexBoundLanguage.Stochaskell
firebrickLanguage.Stochaskell.Plot
First 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
first1OfLanguage.Stochaskell.Plot
firstingLanguage.Stochaskell.Plot
firstOfLanguage.Stochaskell.Plot
FixE 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
FixE'Language.Stochaskell.Expression
fixedWidthLanguage.Stochaskell
flipLanguage.Stochaskell.Prelude, Language.Stochaskell
flipALLanguage.Stochaskell
flippedLanguage.Stochaskell.Plot
FloatLanguage.Stochaskell.Prelude, Language.Stochaskell
floatDigitsLanguage.Stochaskell.Prelude, Language.Stochaskell
FloatingLanguage.Stochaskell.Prelude, Language.Stochaskell
floatingBarPlotLanguage.Stochaskell.Plot
floatRadixLanguage.Stochaskell.Prelude, Language.Stochaskell
floatRangeLanguage.Stochaskell.Prelude, Language.Stochaskell
floorLanguage.Stochaskell.Prelude, Language.Stochaskell
floor'Language.Stochaskell
floralwhiteLanguage.Stochaskell.Plot
fmapLanguage.Stochaskell.Prelude, Language.Stochaskell
Fold 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Fold1Language.Stochaskell.Plot
FoldableLanguage.Stochaskell.Prelude, Language.Stochaskell
FoldableWithIndexLanguage.Stochaskell.Plot
foldByLanguage.Stochaskell.Plot
foldByOfLanguage.Stochaskell.Plot
foldELanguage.Stochaskell
foldedLanguage.Stochaskell.Plot
folded64Language.Stochaskell.Plot
foldingLanguage.Stochaskell.Plot
foldl'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1Language.Stochaskell.Prelude, Language.Stochaskell
foldl1'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1OfLanguage.Stochaskell.Plot
foldl1Of'Language.Stochaskell.Plot
foldlELanguage.Stochaskell
foldlMOfLanguage.Stochaskell.Plot
foldlOfLanguage.Stochaskell.Plot
foldlOf'Language.Stochaskell.Plot
foldMLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapByLanguage.Stochaskell.Plot
foldMapByOfLanguage.Stochaskell.Plot
foldMapOfLanguage.Stochaskell.Plot
foldM_Language.Stochaskell.Prelude, Language.Stochaskell
foldOfLanguage.Stochaskell.Plot
foldPLanguage.Stochaskell
foldPathLanguage.Stochaskell.Plot
foldr1Language.Stochaskell.Prelude, Language.Stochaskell
foldr1OfLanguage.Stochaskell.Plot
foldr1Of'Language.Stochaskell.Plot
foldrELanguage.Stochaskell
foldringLanguage.Stochaskell.Plot
foldrMOfLanguage.Stochaskell.Plot
foldrOfLanguage.Stochaskell.Plot
foldrOf'Language.Stochaskell.Plot
FontSlantLanguage.Stochaskell.Plot
FontSlantItalicLanguage.Stochaskell.Plot
FontSlantNormalLanguage.Stochaskell.Plot
FontSlantObliqueLanguage.Stochaskell.Plot
FontStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
FontWeightLanguage.Stochaskell.Plot
FontWeightBoldLanguage.Stochaskell.Plot
FontWeightNormalLanguage.Stochaskell.Plot
font_colorLanguage.Stochaskell.Plot
font_nameLanguage.Stochaskell.Plot
font_sizeLanguage.Stochaskell.Plot
font_slantLanguage.Stochaskell.Plot
font_weightLanguage.Stochaskell.Plot
for1Of_Language.Stochaskell.Plot
forceEitherLanguage.Stochaskell
forceEitherMsgLanguage.Stochaskell
forestgreenLanguage.Stochaskell.Plot
foreverLanguage.Stochaskell.Prelude, Language.Stochaskell
forMLanguage.Stochaskell.Prelude, Language.Stochaskell
forMOfLanguage.Stochaskell.Plot
forMOf_Language.Stochaskell.Plot
forM_Language.Stochaskell.Prelude, Language.Stochaskell
forOfLanguage.Stochaskell.Plot
forOf_Language.Stochaskell.Plot
FractionalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLanguage.Stochaskell.Plot
fromCaseLanguage.Stochaskell
fromCasePLanguage.Stochaskell
fromCaseP'Language.Stochaskell
fromConcreteLanguage.Stochaskell.Expression
fromConcreteCLanguage.Stochaskell.Expression
fromConstValsLanguage.Stochaskell.Expression
fromEitherLanguage.Stochaskell
fromEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
fromEqLanguage.Stochaskell.Plot
fromExprTupleLanguage.Stochaskell.Expression
fromIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
fromIntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
fromJustLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLeftLanguage.Stochaskell
fromListLanguage.Stochaskell
fromListNLanguage.Stochaskell
fromMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRightLanguage.Stochaskell
fromRight'Language.Stochaskell
fromValueLanguage.Stochaskell.Plot
fstLanguage.Stochaskell.Prelude, Language.Stochaskell
fuchsiaLanguage.Stochaskell.Plot
fullOverlayOverLanguage.Stochaskell.Plot
fullOverlayUnderLanguage.Stochaskell.Plot
FunctorLanguage.Stochaskell.Prelude, Language.Stochaskell
FunctorWithIndexLanguage.Stochaskell.Plot
fusingLanguage.Stochaskell.Plot
gainsboroLanguage.Stochaskell.Plot
GammaLanguage.Stochaskell
gammaLanguage.Stochaskell
gapLanguage.Stochaskell.Plot
gapDirectionLanguage.Stochaskell.Plot
gcdLanguage.Stochaskell.Prelude, Language.Stochaskell
gconstructLanguage.Stochaskell.Expression
GConstructorLanguage.Stochaskell.Expression
gdeconstructLanguage.Stochaskell.Expression
generateLazyPatternsLanguage.Stochaskell.Plot
generateSignaturesLanguage.Stochaskell.Plot
generateUpdateableOpticsLanguage.Stochaskell.Plot
GenericLanguage.Stochaskell.Expression
Generic1Language.Stochaskell.Expression
Generically1 
1 (Data Constructor)Language.Stochaskell.Expression
2 (Type/Class)Language.Stochaskell.Expression
genericDropLanguage.Stochaskell.Prelude, Language.Stochaskell
genericIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
genericJoinLanguage.Stochaskell
genericLengthLanguage.Stochaskell.Prelude, Language.Stochaskell
genericReplicateLanguage.Stochaskell.Prelude, Language.Stochaskell
genericSplitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
genericTakeLanguage.Stochaskell.Prelude, Language.Stochaskell
GeometricLanguage.Stochaskell
geometricLanguage.Stochaskell
getAllLanguage.Stochaskell.Prelude, Language.Stochaskell
getAltLanguage.Stochaskell.Prelude, Language.Stochaskell
getAnyLanguage.Stochaskell.Prelude, Language.Stochaskell
getApLanguage.Stochaskell.Prelude, Language.Stochaskell
getCharLanguage.Stochaskell.Prelude, Language.Stochaskell
getConstLanguage.Stochaskell.Plot
getContentsLanguage.Stochaskell.Prelude, Language.Stochaskell
getCoordAlignFnLanguage.Stochaskell.Plot
getDualLanguage.Stochaskell.Prelude, Language.Stochaskell
getFirstLanguage.Stochaskell.Prelude, Language.Stochaskell
getLastLanguage.Stochaskell.Prelude, Language.Stochaskell
getLineLanguage.Stochaskell.Prelude, Language.Stochaskell
getPointAlignFnLanguage.Stochaskell.Plot
getProductLanguage.Stochaskell.Prelude, Language.Stochaskell
getSumLanguage.Stochaskell.Prelude, Language.Stochaskell
Getter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
GettingLanguage.Stochaskell.Plot
gettingLanguage.Stochaskell.Plot
ghostwhiteLanguage.Stochaskell.Plot
goldLanguage.Stochaskell.Plot
goldenrodLanguage.Stochaskell.Plot
gplateLanguage.Stochaskell.Plot
gplate1Language.Stochaskell.Plot
GPlatedLanguage.Stochaskell.Plot
GPlated1Language.Stochaskell.Plot
grabLanguage.Stochaskell
gradientColourBarLanguage.Stochaskell.Plot
graphvizLanguage.Graphviz
grayLanguage.Stochaskell.Plot
greenLanguage.Stochaskell.Plot
greenyellowLanguage.Stochaskell.Plot
greyLanguage.Stochaskell.Plot
greysLanguage.Stochaskell.Plot
GridLanguage.Stochaskell.Plot
GridLineFunctionLanguage.Stochaskell.Plot
GridLinesLanguage.Stochaskell.Plot
gridLinesLanguage.Stochaskell.Plot
gridLinesStyleLanguage.Stochaskell.Plot
gridLinesVisibleLanguage.Stochaskell.Plot
gridToRenderableLanguage.Stochaskell.Plot
groupLanguage.Stochaskell.Prelude, Language.Stochaskell
groupByLanguage.Stochaskell.Prelude, Language.Stochaskell
groupedBarsLanguage.Stochaskell.Plot
groupedBars'Language.Stochaskell.Plot
gscatterOptionsLanguage.Stochaskell.Plot
gscatterOptionsForLanguage.Stochaskell.Plot
gscatterPlotLanguage.Stochaskell.Plot
GTLanguage.Stochaskell.Prelude, Language.Stochaskell
gtagsLanguage.Stochaskell.Expression
gtypeOfLanguage.Stochaskell.Expression
guardLanguage.Stochaskell.Prelude, Language.Stochaskell
guardedBLanguage.Stochaskell.Prelude, Language.Stochaskell
HamiltonianMCLanguage.PyMC3
hasLanguage.Stochaskell.Plot
hasAnyLanguage.Stochaskell
HasAxisLabelLanguage.Stochaskell.Plot
HasAxisScalingLanguage.Stochaskell.Plot
HasAxisStyleLanguage.Stochaskell.Plot
HasBarLayoutLanguage.Stochaskell.Plot
HasColourBarLanguage.Stochaskell.Plot
HasConnectingLineLanguage.Stochaskell.Plot
HasGapLanguage.Stochaskell.Plot
HasGridLinesLanguage.Stochaskell.Plot
HasHeatMapLanguage.Stochaskell.Plot
HasHistogramOptionsLanguage.Stochaskell.Plot
hasKeyALLanguage.Stochaskell
HasLegendLanguage.Stochaskell.Plot
HasMajorGridLinesLanguage.Stochaskell.Plot
HasMajorTicksLanguage.Stochaskell.Plot
HasMinorGridLinesLanguage.Stochaskell.Plot
HasMinorTicksLanguage.Stochaskell.Plot
hasn'tLanguage.Stochaskell.Plot
HasNanColoursLanguage.Stochaskell.Plot
HasOrientationLanguage.Stochaskell.Plot
HasPlacementLanguage.Stochaskell.Plot
HasPlotOptionsLanguage.Stochaskell.Plot
HasPlotStyleLanguage.Stochaskell.Plot
HasRLanguage.Stochaskell.Plot
HasScatterOptionsLanguage.Stochaskell.Plot
HasTickLabelsLanguage.Stochaskell.Plot
HasTicksLanguage.Stochaskell.Plot
HasTitleLanguage.Stochaskell.Plot
HasVisibilityLanguage.Stochaskell.Plot
HasWedgeLanguage.Stochaskell.Plot
HasXLanguage.Stochaskell.Plot
HasYLanguage.Stochaskell.Plot
headLanguage.Stochaskell.Prelude, Language.Stochaskell
heatImageLanguage.Stochaskell.Plot
HeatMapLanguage.Stochaskell.Plot
heatMapLanguage.Stochaskell.Plot
heatMap'Language.Stochaskell.Plot
heatMapCentreLanguage.Stochaskell.Plot
heatMapExtentLanguage.Stochaskell.Plot
heatMapGridStyleLanguage.Stochaskell.Plot
heatMapGridVisibleLanguage.Stochaskell.Plot
heatMapIndexedLanguage.Stochaskell.Plot
heatMapIndexed'Language.Stochaskell.Plot
heatMapLimitsLanguage.Stochaskell.Plot
heatMapOptionsLanguage.Stochaskell.Plot
heatMapRenderLanguage.Stochaskell.Plot
heatMapSizeLanguage.Stochaskell.Plot
heatMapStartLanguage.Stochaskell.Plot
HeatMatrixLanguage.Stochaskell.Plot
heightLanguage.Stochaskell.Plot
hiddenLanguage.Stochaskell.Plot
hideLanguage.Stochaskell.Plot
hideGridLinesLanguage.Stochaskell.Plot
hideTicksLanguage.Stochaskell.Plot
HistogramOptionsLanguage.Stochaskell.Plot
histogramOptionsLanguage.Stochaskell.Plot
HistogramPlotLanguage.Stochaskell.Plot
histogramPlotLanguage.Stochaskell.Plot
histogramPlot'Language.Stochaskell.Plot
histogramPlotOfLanguage.Stochaskell.Plot
histogramPlotOf'Language.Stochaskell.Plot
histToPlotLanguage.Stochaskell.Plot
hlinePlotLanguage.Stochaskell.Plot
hmcEdwardLanguage.Edward
hmcEngineLanguage.Stan
hmcMetricLanguage.Stan
hmcStanLanguage.Stan, Language.Stochaskell
hmcStanInitLanguage.Stan, Language.Stochaskell
hmcStepSizeLanguage.Stan
hmcStepSizeJitterLanguage.Stan
hmPointsLanguage.Stochaskell.Plot
hmSizeLanguage.Stochaskell.Plot
holesLanguage.Stochaskell.Plot
holes1OfLanguage.Stochaskell.Plot
holesOfLanguage.Stochaskell.Plot
holesOnLanguage.Stochaskell.Plot
holesOnOfLanguage.Stochaskell.Plot
hollowCirclesLanguage.Stochaskell.Plot
hollowPolygonLanguage.Stochaskell.Plot
honeydewLanguage.Stochaskell.Plot
HorizontalLanguage.Stochaskell.Plot
horizontalLanguage.Stochaskell.Plot
hotpinkLanguage.Stochaskell.Plot
HTA_CentreLanguage.Stochaskell.Plot
HTA_LeftLanguage.Stochaskell.Plot
HTA_RightLanguage.Stochaskell.Plot
HTextAnchorLanguage.Stochaskell.Plot
iallLanguage.Stochaskell.Plot
iallOfLanguage.Stochaskell.Plot
ianyLanguage.Stochaskell.Plot
ianyOfLanguage.Stochaskell.Plot
iatLanguage.Stochaskell.Plot
icensoringLanguage.Stochaskell.Plot
icomposeLanguage.Stochaskell.Plot
iconcatMapLanguage.Stochaskell.Plot
iconcatMapOfLanguage.Stochaskell.Plot
icontainsLanguage.Stochaskell.Plot
IdLanguage.Stochaskell.Expression
idLanguage.Stochaskell.Prelude, Language.Stochaskell
Identical 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Identity 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
identityLanguage.Stochaskell.Plot
idroppingWhileLanguage.Stochaskell.Plot
ifailoverLanguage.Stochaskell.Plot
IfBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifilteredLanguage.Stochaskell.Plot
ifindLanguage.Stochaskell.Plot
ifindMOfLanguage.Stochaskell.Plot
ifindOfLanguage.Stochaskell.Plot
ifoldedLanguage.Stochaskell.Plot
ifoldingLanguage.Stochaskell.Plot
ifoldlLanguage.Stochaskell.Plot
ifoldl'Language.Stochaskell.Plot
ifoldlMLanguage.Stochaskell.Plot
ifoldlMOfLanguage.Stochaskell.Plot
ifoldlOfLanguage.Stochaskell.Plot
ifoldlOf'Language.Stochaskell.Plot
ifoldMapLanguage.Stochaskell.Plot
ifoldMapByLanguage.Stochaskell.Plot
ifoldMapByOfLanguage.Stochaskell.Plot
ifoldMapOfLanguage.Stochaskell.Plot
ifoldrLanguage.Stochaskell.Plot
ifoldr'Language.Stochaskell.Plot
ifoldringLanguage.Stochaskell.Plot
ifoldrMLanguage.Stochaskell.Plot
ifoldrMOfLanguage.Stochaskell.Plot
ifoldrOfLanguage.Stochaskell.Plot
ifoldrOf'Language.Stochaskell.Plot
iforLanguage.Stochaskell.Plot
iforMLanguage.Stochaskell.Plot
iforMOfLanguage.Stochaskell.Plot
iforMOf_Language.Stochaskell.Plot
iforM_Language.Stochaskell.Plot
iforOfLanguage.Stochaskell.Plot
iforOf_Language.Stochaskell.Plot
ifor_Language.Stochaskell.Plot
ifThenElseLanguage.Stochaskell.Prelude, Language.Stochaskell
ignoredLanguage.Stochaskell.Plot
iixLanguage.Stochaskell.Plot
ilensLanguage.Stochaskell.Plot
ilevelsLanguage.Stochaskell.Plot
ilikeLanguage.Stochaskell.Plot
ilisteningLanguage.Stochaskell.Plot
ilisteningsLanguage.Stochaskell.Plot
ilocallyLanguage.Stochaskell.Plot
ilociLanguage.Stochaskell.Plot
imagmaLanguage.Stochaskell.Plot
imapLanguage.Stochaskell.Plot
imapAccumLLanguage.Stochaskell.Plot
imapAccumLOfLanguage.Stochaskell.Plot
imapAccumRLanguage.Stochaskell.Plot
imapAccumROfLanguage.Stochaskell.Plot
imapMLanguage.Stochaskell.Plot
imapMOfLanguage.Stochaskell.Plot
imapMOf_Language.Stochaskell.Plot
imapM_Language.Stochaskell.Plot
imapOfLanguage.Stochaskell.Plot
imappedLanguage.Stochaskell.Plot
imodifyingLanguage.Stochaskell.Plot
IndexLanguage.Stochaskell.Plot
indexLanguage.Stochaskell.Plot
Indexable 
1 (Type/Class)Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Plot
Indexed 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
indexedLanguage.Stochaskell.Plot
IndexedFold 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedFold1Language.Stochaskell.Plot
IndexedGetter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedGettingLanguage.Stochaskell.Plot
IndexedLens 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedLens'Language.Stochaskell.Plot
IndexedLensLikeLanguage.Stochaskell.Plot
IndexedLensLike'Language.Stochaskell.Plot
IndexedSetter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedSetter'Language.Stochaskell.Plot
IndexedTraversal 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedTraversal'Language.Stochaskell.Plot
IndexedTraversal1Language.Stochaskell.Plot
IndexedTraversal1'Language.Stochaskell.Plot
indexingLanguage.Stochaskell.Plot
indexing64Language.Stochaskell.Plot
IndexPreservingFoldLanguage.Stochaskell.Plot
IndexPreservingFold1Language.Stochaskell.Plot
IndexPreservingGetterLanguage.Stochaskell.Plot
IndexPreservingLensLanguage.Stochaskell.Plot
IndexPreservingLens'Language.Stochaskell.Plot
IndexPreservingSetterLanguage.Stochaskell.Plot
IndexPreservingSetter'Language.Stochaskell.Plot
IndexPreservingTraversalLanguage.Stochaskell.Plot
IndexPreservingTraversal'Language.Stochaskell.Plot
IndexPreservingTraversal1Language.Stochaskell.Plot
IndexPreservingTraversal1'Language.Stochaskell.Plot
indianredLanguage.Stochaskell.Plot
indicesLanguage.Stochaskell.Plot
indigoLanguage.Stochaskell.Plot
infColourLanguage.Stochaskell.Plot
infernoLanguage.Stochaskell.Plot
infinityLanguage.Stochaskell
initLanguage.Stochaskell.Prelude, Language.Stochaskell
initsLanguage.Stochaskell.Prelude, Language.Stochaskell
InnerProductLanguage.Stochaskell
inoneLanguage.Stochaskell.Plot
inoneOfLanguage.Stochaskell.Plot
insertLanguage.Stochaskell.Prelude, Language.Stochaskell
insertAtLanguage.Stochaskell
insertByLanguage.Stochaskell.Prelude, Language.Stochaskell
insertIndexLanguage.Stochaskell
insideLanguage.Stochaskell.Plot
InsideAxisLabelLanguage.Stochaskell.Plot
insideTicksLanguage.Stochaskell.Plot
IntLanguage.Stochaskell.Prelude, Language.Stochaskell
IntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
integerLanguage.Stochaskell
IntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
interactLanguage.Stochaskell.Prelude, Language.Stochaskell
intercalateLanguage.Stochaskell.Prelude, Language.Stochaskell
interpolateLanguage.Stochaskell
interpPolarLanguage.Stochaskell.Plot
intersectLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectByLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectRectLanguage.Stochaskell.Plot
intersperseLanguage.Stochaskell.Prelude, Language.Stochaskell
IntervalLanguage.Stochaskell
IntTLanguage.Stochaskell.Expression
intTimeLanguage.Stan
invLanguage.Stochaskell
invertLanguage.Stochaskell.Plot
InvGammaLanguage.Stochaskell
invGammaLanguage.Stochaskell
invLinMapLanguage.Stochaskell.Plot
invmapLanguage.Stochaskell.Plot
involutedLanguage.Stochaskell.Plot
IOLanguage.Stochaskell.Prelude, Language.Stochaskell
IOErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioverLanguage.Stochaskell.Plot
ipartsOfLanguage.Stochaskell.Plot
ipartsOf'Language.Stochaskell.Plot
ipassingLanguage.Stochaskell.Plot
iplensLanguage.Stochaskell.Plot
ipreLanguage.Stochaskell.Plot
ipreuseLanguage.Stochaskell.Plot
ipreusesLanguage.Stochaskell.Plot
ipreviewLanguage.Stochaskell.Plot
ipreviewsLanguage.Stochaskell.Plot
isDenormalizedLanguage.Stochaskell.Prelude, Language.Stochaskell
isetLanguage.Stochaskell.Plot
isetsLanguage.Stochaskell.Plot
isIEEELanguage.Stochaskell.Prelude, Language.Stochaskell
isInfiniteLanguage.Stochaskell.Prelude, Language.Stochaskell
isInfixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isJustLanguage.Stochaskell.Prelude, Language.Stochaskell
IsListLanguage.Stochaskell
isn'tLanguage.Stochaskell.Plot
isNaNLanguage.Stochaskell.Prelude, Language.Stochaskell
isNegativeZeroLanguage.Stochaskell.Prelude, Language.Stochaskell
isNothingLanguage.Stochaskell.Prelude, Language.Stochaskell
Iso 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
isoLanguage.Stochaskell.Plot
Iso'Language.Stochaskell.Plot
isPrefixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSubsequenceOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSuffixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
itakingWhileLanguage.Stochaskell.Plot
ItemLanguage.Stochaskell
iterateLanguage.Stochaskell.Prelude, Language.Stochaskell
iterate'Language.Stochaskell.Prelude, Language.Stochaskell
iteratedLanguage.Stochaskell.Plot
iterateLimitLanguage.Stochaskell
itoLanguage.Stochaskell.Plot
itoListLanguage.Stochaskell.Plot
itoListOfLanguage.Stochaskell.Plot
itraverseLanguage.Stochaskell.Plot
itraverseByLanguage.Stochaskell.Plot
itraverseByOfLanguage.Stochaskell.Plot
itraversedLanguage.Stochaskell.Plot
itraverseOfLanguage.Stochaskell.Plot
itraverseOf_Language.Stochaskell.Plot
itraverse_Language.Stochaskell.Plot
iunsafePartsOfLanguage.Stochaskell.Plot
iunsafePartsOf'Language.Stochaskell.Plot
iuseLanguage.Stochaskell.Plot
iusesLanguage.Stochaskell.Plot
iviewLanguage.Stochaskell.Plot
iviewsLanguage.Stochaskell.Plot
ivoryLanguage.Stochaskell.Plot
ixLanguage.Stochaskell.Plot
ixAtLanguage.Stochaskell.Plot
ixColourLanguage.Stochaskell.Plot
ixColourRLanguage.Stochaskell.Plot
IxedLanguage.Stochaskell.Plot
IxValueLanguage.Stochaskell.Plot
joinLanguage.Stochaskell.Prelude, Language.Stochaskell
joinPlotLanguage.Stochaskell.Plot
JointLanguage.Stochaskell
jointLanguage.Stochaskell
JustLanguage.Stochaskell.Prelude, Language.Stochaskell
kdeLanguage.Stochaskell.Plot
kde'Language.Stochaskell.Plot
kdeplotLanguage.Stochaskell.Plot
kdeplot'Language.Stochaskell.Plot
keyLanguage.Stochaskell.Plot
keysALLanguage.Stochaskell
khakiLanguage.Stochaskell.Plot
labelLanguage.Stochaskell.Plot
labelBarsLanguage.Stochaskell.Plot
Last 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
lastLanguage.Stochaskell.Prelude, Language.Stochaskell
last1OfLanguage.Stochaskell.Plot
lastOfLanguage.Stochaskell.Plot
lavenderLanguage.Stochaskell.Plot
lavenderblushLanguage.Stochaskell.Plot
lawngreenLanguage.Stochaskell.Plot
laxis_generateLanguage.Stochaskell.Plot
laxis_overrideLanguage.Stochaskell.Plot
laxis_reverseLanguage.Stochaskell.Plot
laxis_styleLanguage.Stochaskell.Plot
laxis_titleLanguage.Stochaskell.Plot
laxis_title_styleLanguage.Stochaskell.Plot
Layout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
LayoutAxis 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
LayoutLR 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
layoutLRToGridLanguage.Stochaskell.Plot
layoutLRToRenderableLanguage.Stochaskell.Plot
layoutlr_all_font_stylesLanguage.Stochaskell.Plot
layoutlr_axes_stylesLanguage.Stochaskell.Plot
layoutlr_axes_title_stylesLanguage.Stochaskell.Plot
layoutlr_backgroundLanguage.Stochaskell.Plot
layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_foregroundLanguage.Stochaskell.Plot
layoutlr_grid_lastLanguage.Stochaskell.Plot
layoutlr_left_axisLanguage.Stochaskell.Plot
layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_legendLanguage.Stochaskell.Plot
layoutlr_marginLanguage.Stochaskell.Plot
layoutlr_plotsLanguage.Stochaskell.Plot
layoutlr_plot_backgroundLanguage.Stochaskell.Plot
layoutlr_right_axisLanguage.Stochaskell.Plot
layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_titleLanguage.Stochaskell.Plot
layoutlr_title_styleLanguage.Stochaskell.Plot
layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_x_axisLanguage.Stochaskell.Plot
LayoutPickLanguage.Stochaskell.Plot
LayoutPick_LegendLanguage.Stochaskell.Plot
LayoutPick_PlotAreaLanguage.Stochaskell.Plot
LayoutPick_TitleLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisTitleLanguage.Stochaskell.Plot
LayoutPick_XTopAxisLanguage.Stochaskell.Plot
LayoutPick_XTopAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YRightAxisLanguage.Stochaskell.Plot
LayoutPick_YRightAxisTitleLanguage.Stochaskell.Plot
layoutToGridLanguage.Stochaskell.Plot
layoutToRenderableLanguage.Stochaskell.Plot
layout_all_font_stylesLanguage.Stochaskell.Plot
layout_axes_stylesLanguage.Stochaskell.Plot
layout_axes_title_stylesLanguage.Stochaskell.Plot
layout_backgroundLanguage.Stochaskell.Plot
layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
layout_foregroundLanguage.Stochaskell.Plot
layout_grid_lastLanguage.Stochaskell.Plot
layout_left_axis_visibilityLanguage.Stochaskell.Plot
layout_legendLanguage.Stochaskell.Plot
layout_marginLanguage.Stochaskell.Plot
layout_plotsLanguage.Stochaskell.Plot
layout_plot_backgroundLanguage.Stochaskell.Plot
layout_right_axis_visibilityLanguage.Stochaskell.Plot
layout_titleLanguage.Stochaskell.Plot
layout_title_styleLanguage.Stochaskell.Plot
layout_top_axis_visibilityLanguage.Stochaskell.Plot
layout_x_axisLanguage.Stochaskell.Plot
layout_y_axisLanguage.Stochaskell.Plot
LazyLanguage.Stochaskell.Plot
lazyLanguage.Stochaskell.Plot
la_labelfLanguage.Stochaskell.Plot
la_nLabelsLanguage.Stochaskell.Plot
la_nTicksLanguage.Stochaskell.Plot
lcmLanguage.Stochaskell.Prelude, Language.Stochaskell
LeftLanguage.Stochaskell.Prelude, Language.Stochaskell
leftLanguage.Stochaskell.Plot
left'Language.Stochaskell.Plot
leftAboveLanguage.Stochaskell.Plot
leftBelowLanguage.Stochaskell.Plot
leftBottomLanguage.Stochaskell.Plot
leftMidLanguage.Stochaskell.Plot
LeftmostLanguage.Stochaskell.Plot
leftTopLanguage.Stochaskell.Plot
legendLanguage.Stochaskell.Plot
LegendAboveLanguage.Stochaskell.Plot
LegendBelowLanguage.Stochaskell.Plot
legendEntriesLanguage.Stochaskell.Plot
LegendEntryLanguage.Stochaskell.Plot
legendGapLanguage.Stochaskell.Plot
LegendLeftLanguage.Stochaskell.Plot
LegendOrientationLanguage.Stochaskell.Plot
legendOrientationLanguage.Stochaskell.Plot
LegendPicLanguage.Stochaskell.Plot
legendPictureLanguage.Stochaskell.Plot
legendPlacementLanguage.Stochaskell.Plot
LegendPositionLanguage.Stochaskell.Plot
legendPrecedenceLanguage.Stochaskell.Plot
LegendRightLanguage.Stochaskell.Plot
legendSpacingLanguage.Stochaskell.Plot
LegendStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
legendStyleLanguage.Stochaskell.Plot
legendTextLanguage.Stochaskell.Plot
legendTextFunctionLanguage.Stochaskell.Plot
legendTextStyleLanguage.Stochaskell.Plot
legendTextWidthLanguage.Stochaskell.Plot
legendToRenderableLanguage.Stochaskell.Plot
legend_label_styleLanguage.Stochaskell.Plot
legend_marginLanguage.Stochaskell.Plot
legend_orientationLanguage.Stochaskell.Plot
legend_plot_sizeLanguage.Stochaskell.Plot
legend_positionLanguage.Stochaskell.Plot
lemonchiffonLanguage.Stochaskell.Plot
lengthLanguage.Stochaskell.Prelude, Language.Stochaskell
lengthOfLanguage.Stochaskell.Plot
Lens 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lensLanguage.Stochaskell.Plot
Lens'Language.Stochaskell.Plot
lensClassLanguage.Stochaskell.Plot
lensFieldLanguage.Stochaskell.Plot
LensLikeLanguage.Stochaskell.Plot
LensLike'Language.Stochaskell.Plot
LensRulesLanguage.Stochaskell.Plot
lensRulesLanguage.Stochaskell.Plot
lensRulesForLanguage.Stochaskell.Plot
LevelLanguage.Stochaskell.Plot
levelsLanguage.Stochaskell.Plot
lexLanguage.Stochaskell.Prelude, Language.Stochaskell
liftCStateLanguage.Stochaskell.Plot
liftECLanguage.Stochaskell.Plot
liftedLanguage.Stochaskell.Plot
liftMLanguage.Stochaskell.Prelude, Language.Stochaskell
liftM2Language.Stochaskell.Prelude, Language.Stochaskell
liftM3Language.Stochaskell.Prelude, Language.Stochaskell
liftM4Language.Stochaskell.Prelude, Language.Stochaskell
liftM5Language.Stochaskell.Prelude, Language.Stochaskell
lightblueLanguage.Stochaskell.Plot
lightcoralLanguage.Stochaskell.Plot
lightcyanLanguage.Stochaskell.Plot
lightgoldenrodyellowLanguage.Stochaskell.Plot
lightgrayLanguage.Stochaskell.Plot
lightgreenLanguage.Stochaskell.Plot
lightgreyLanguage.Stochaskell.Plot
lightpinkLanguage.Stochaskell.Plot
lightsalmonLanguage.Stochaskell.Plot
lightseagreenLanguage.Stochaskell.Plot
lightskyblueLanguage.Stochaskell.Plot
lightslategrayLanguage.Stochaskell.Plot
lightslategreyLanguage.Stochaskell.Plot
lightsteelblueLanguage.Stochaskell.Plot
lightyellowLanguage.Stochaskell.Plot
likeLanguage.Stochaskell.Plot
limeLanguage.Stochaskell.Plot
limegreenLanguage.Stochaskell.Plot
LimitLanguage.Stochaskell.Plot
lineLanguage.Stochaskell.Plot
LinearAxisLanguage.Stochaskell.Plot
LinearAxisParams 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
linearMajorTicksLanguage.Stochaskell.Plot
LinearOperatorLanguage.Stochaskell
LineCapLanguage.Stochaskell.Plot
LineCapButtLanguage.Stochaskell.Plot
LineCapRoundLanguage.Stochaskell.Plot
LineCapSquareLanguage.Stochaskell.Plot
linedLanguage.Stochaskell.Plot
LineJoinLanguage.Stochaskell.Plot
LineJoinBevelLanguage.Stochaskell.Plot
LineJoinMiterLanguage.Stochaskell.Plot
LineJoinRoundLanguage.Stochaskell.Plot
lineMarkersLanguage.Stochaskell.Plot
linenLanguage.Stochaskell.Plot
linePlotLanguage.Stochaskell.Plot
linePlot'Language.Stochaskell.Plot
linesLanguage.Stochaskell.Prelude, Language.Stochaskell
LineStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lineStyleLanguage.Stochaskell.Plot
lineStyleFunctionLanguage.Stochaskell.Plot
LineToLanguage.Stochaskell.Plot
lineToLanguage.Stochaskell.Plot
lineTo'Language.Stochaskell.Plot
line_capLanguage.Stochaskell.Plot
line_colorLanguage.Stochaskell.Plot
line_dashesLanguage.Stochaskell.Plot
line_joinLanguage.Stochaskell.Plot
line_widthLanguage.Stochaskell.Plot
linMapLanguage.Stochaskell.Plot
linspaceLanguage.Stochaskell
ListLanguage.Stochaskell.Plot
listLanguage.Stochaskell
listeningLanguage.Stochaskell.Plot
listeningsLanguage.Stochaskell.Plot
listToMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
LKJLanguage.Stochaskell
lmapLanguage.Stochaskell.Plot
lmappingLanguage.Stochaskell.Plot
LMaxLanguage.Stochaskell.Plot
LMinLanguage.Stochaskell.Plot
locallyLanguage.Stochaskell.Plot
lociLanguage.Stochaskell.Plot
LOColsLanguage.Stochaskell.Plot
locusLanguage.Stochaskell.Plot
logLanguage.Stochaskell.Prelude, Language.Stochaskell
LogAxisLanguage.Stochaskell.Plot
LogAxisParams 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
loga_labelfLanguage.Stochaskell.Plot
logBaseLanguage.Stochaskell.Prelude, Language.Stochaskell
logDeformLanguage.Stochaskell.Plot
logDetLanguage.Stochaskell
logFactorial'Language.Stochaskell
logFromLogFloatLanguage.Stochaskell
LogisticLanguage.Stochaskell
logisticLanguage.Stochaskell
logMajorTicksLanguage.Stochaskell.Plot
lognormalLanguage.Stochaskell
logNumberLanguage.Stochaskell.Plot
logPointLanguage.Stochaskell.Plot
LogScaleLanguage.Stochaskell.Plot
logScaleLanguage.Stochaskell.Plot
LogValue 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lookingupNamerLanguage.Stochaskell.Plot
lookupLanguage.Stochaskell.Prelude, Language.Stochaskell
lookupOfLanguage.Stochaskell.Plot
loopLanguage.Stochaskell
LORowsLanguage.Stochaskell.Plot
LowerAxisLabelLanguage.Stochaskell.Plot
lpdfLanguage.Stochaskell
lpdfAuxLanguage.Stochaskell
lpdfAuxCLanguage.Stochaskell
lpdfCondLanguage.Stochaskell
lpdfDiscreteUniformLanguage.Stochaskell
lpdfGammaLanguage.Stochaskell
lpdfNegBinomialLanguage.Stochaskell
lpdfNormalLanguage.Stochaskell
lpdfPoissonLanguage.Stochaskell
lpdfUniformLanguage.Stochaskell
LTLanguage.Stochaskell.Prelude, Language.Stochaskell
LValLanguage.Stochaskell.Expression
LValueLanguage.Stochaskell.Plot
LVarLanguage.Stochaskell.Expression
magentaLanguage.Stochaskell.Plot
MagmaLanguage.Stochaskell.Plot
MagnifiedLanguage.Stochaskell.Plot
MagnifyLanguage.Stochaskell.Plot
magnifyLanguage.Stochaskell.Plot
MajorGridLinesLanguage.Stochaskell.Plot
majorGridLinesLanguage.Stochaskell.Plot
majorGridLinesFunctionLanguage.Stochaskell.Plot
majorGridLinesStyleLanguage.Stochaskell.Plot
majorTickPositionsLanguage.Stochaskell.Plot
MajorTicksLanguage.Stochaskell.Plot
majorTicksLanguage.Stochaskell.Plot
majorTicksAlignmentLanguage.Stochaskell.Plot
majorTicksFunctionLanguage.Stochaskell.Plot
majorTicksHelperLanguage.Stochaskell.Plot
majorTicksLengthLanguage.Stochaskell.Plot
majorTicksStyleLanguage.Stochaskell.Plot
makeAxisLanguage.Stochaskell.Plot
makeAxis'Language.Stochaskell.Plot
makeClassyLanguage.Stochaskell.Plot
makeClassyForLanguage.Stochaskell.Plot
makeClassyPrismsLanguage.Stochaskell.Plot
makeClassy_Language.Stochaskell.Plot
makeFieldsLanguage.Stochaskell.Plot
makeFieldsNoPrefixLanguage.Stochaskell.Plot
makeLensesLanguage.Stochaskell.Plot
makeLensesForLanguage.Stochaskell.Plot
makeLensesWithLanguage.Stochaskell.Plot
makeLinesExplicitLanguage.Stochaskell.Plot
makePrismsLanguage.Stochaskell.Plot
makeWrappedLanguage.Stochaskell.Plot
mapLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLOfLanguage.Stochaskell.Plot
mapAccumRLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumROfLanguage.Stochaskell.Plot
mapAndUnzipMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapEqLanguage.Stochaskell.Plot
mapMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybePickFnLanguage.Stochaskell.Plot
mapMOfLanguage.Stochaskell.Plot
mapMOf_Language.Stochaskell.Plot
mapM_Language.Stochaskell.Prelude, Language.Stochaskell
mapOfLanguage.Stochaskell.Plot
mappedLanguage.Stochaskell.Plot
mappendLanguage.Stochaskell.Prelude, Language.Stochaskell
mapPickFnLanguage.Stochaskell.Plot
mappingLanguage.Stochaskell.Plot
mappingNamerLanguage.Stochaskell.Plot
mapXYLanguage.Stochaskell.Plot
markerStyleLanguage.Stochaskell.Plot
markerStyleFunctionLanguage.Stochaskell.Plot
maroonLanguage.Stochaskell.Plot
matchingLanguage.Stochaskell.Plot
Matrix 
1 (Type/Class)Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Plot
3 (Data Constructor)Language.Stochaskell.Plot
matrixLanguage.Stochaskell
matrixColsLanguage.Stochaskell
matrixRowsLanguage.Stochaskell
matTLanguage.Stochaskell.Expression
maxLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
maxDepthLanguage.Stan
maximumLanguage.Stochaskell.Prelude, Language.Stochaskell
maximum1OfLanguage.Stochaskell.Plot
maximumByLanguage.Stochaskell.Prelude, Language.Stochaskell
maximumByOfLanguage.Stochaskell.Plot
maximumOfLanguage.Stochaskell.Plot
MAxisFnLanguage.Stochaskell.Plot
MaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeToEitherLanguage.Stochaskell
maybeToListLanguage.Stochaskell.Prelude, Language.Stochaskell
mconcatLanguage.Stochaskell.Prelude, Language.Stochaskell
meanLanguage.Stochaskell
mediumaquamarineLanguage.Stochaskell.Plot
mediumblueLanguage.Stochaskell.Plot
mediumorchidLanguage.Stochaskell.Plot
mediumpurpleLanguage.Stochaskell.Plot
mediumseagreenLanguage.Stochaskell.Plot
mediumslateblueLanguage.Stochaskell.Plot
mediumspringgreenLanguage.Stochaskell.Plot
mediumturquoiseLanguage.Stochaskell.Plot
mediumvioletredLanguage.Stochaskell.Plot
memptyLanguage.Stochaskell.Prelude, Language.Stochaskell
mergeLanguage.Stochaskell
mergeByLanguage.Stochaskell
MethodNameLanguage.Stochaskell.Plot
MetropolisLanguage.PyMC3
mfilterLanguage.Stochaskell.Prelude, Language.Stochaskell
mhChurchLanguage.Church
midAboveLanguage.Stochaskell.Plot
midBelowLanguage.Stochaskell.Plot
MiddleAxisLabelLanguage.Stochaskell.Plot
midnightblueLanguage.Stochaskell.Plot
minLanguage.Stochaskell.Prelude, Language.Stochaskell
min'Language.Stochaskell
minBLanguage.Stochaskell.Prelude, Language.Stochaskell
minBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumLanguage.Stochaskell.Prelude, Language.Stochaskell
minimum1OfLanguage.Stochaskell.Plot
minimumByLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumByOfLanguage.Stochaskell.Plot
minimumOfLanguage.Stochaskell.Plot
MinorGridLinesLanguage.Stochaskell.Plot
minorGridLinesLanguage.Stochaskell.Plot
minorGridLinesFunctionLanguage.Stochaskell.Plot
minorGridLinesStyleLanguage.Stochaskell.Plot
minorTickPositionsLanguage.Stochaskell.Plot
MinorTicksLanguage.Stochaskell.Plot
minorTicksLanguage.Stochaskell.Plot
minorTicksAlignmentLanguage.Stochaskell.Plot
minorTicksFunctionLanguage.Stochaskell.Plot
minorTicksHelperLanguage.Stochaskell.Plot
minorTicksLengthLanguage.Stochaskell.Plot
minorTicksStyleLanguage.Stochaskell.Plot
minsizeLanguage.Stochaskell.Plot
mintcreamLanguage.Stochaskell.Plot
mistyroseLanguage.Stochaskell.Plot
mixtureLanguage.Stochaskell
mixture'Language.Stochaskell
mkBarsLanguage.Stochaskell.Plot
mkComputedHistogramLanguage.Stochaskell.Plot
mkFloatingBarsLanguage.Stochaskell.Plot
mkGroupedBarsLanguage.Stochaskell.Plot
mkHeatMapLanguage.Stochaskell.Plot
mkHeatMatrixLanguage.Stochaskell.Plot
mkHeatMatrix'Language.Stochaskell.Plot
mkHistogramPlotLanguage.Stochaskell.Plot
mkLegendEntryLanguage.Stochaskell.Plot
mkPathLanguage.Stochaskell.Plot
mkPathOfLanguage.Stochaskell.Plot
mkPlotLanguage.Stochaskell.Plot
mkPolarLanguage.Stochaskell.Plot
mkrectLanguage.Stochaskell.Plot
mkRunningBarsLanguage.Stochaskell.Plot
mkScatterOptionsLanguage.Stochaskell.Plot
mkStackedBarsLanguage.Stochaskell.Plot
mkStackedEqualBarsLanguage.Stochaskell.Plot
mkTrailLanguage.Stochaskell.Plot
mkTrailOfLanguage.Stochaskell.Plot
mkWedgeLanguage.Stochaskell.Plot
moccasinLanguage.Stochaskell.Plot
modLanguage.Stochaskell.Prelude, Language.Stochaskell
modifyingLanguage.Stochaskell.Plot
MonadLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadGuardLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadPlusLanguage.Stochaskell.Prelude, Language.Stochaskell
MonoidLanguage.Stochaskell.Prelude, Language.Stochaskell
monthsLanguage.Stochaskell.Plot
MoveToLanguage.Stochaskell.Plot
moveToLanguage.Stochaskell.Plot
moveTo'Language.Stochaskell.Plot
mplusLanguage.Stochaskell.Prelude, Language.Stochaskell
msumLanguage.Stochaskell.Prelude, Language.Stochaskell
msumOfLanguage.Stochaskell.Plot
multiBarsLanguage.Stochaskell.Plot
MultiBarStateLanguage.Stochaskell.Plot
mzeroLanguage.Stochaskell.Prelude, Language.Stochaskell
namedBarPlotLanguage.Stochaskell.Plot
namedBarPlot'Language.Stochaskell.Plot
nanColourLanguage.Stochaskell.Plot
NanColoursLanguage.Stochaskell.Plot
nanColoursLanguage.Stochaskell.Plot
navajowhiteLanguage.Stochaskell.Plot
navyLanguage.Stochaskell.Plot
nearlyLanguage.Stochaskell.Plot
negateLanguage.Stochaskell.Prelude, Language.Stochaskell
negativeInfinityLanguage.Stochaskell
NegBinomialLanguage.Stochaskell
negBinomialLanguage.Stochaskell
negInfColourLanguage.Stochaskell.Plot
NodeRefLanguage.Stochaskell.Expression
noExtendLanguage.Stochaskell.Plot
nonLanguage.Stochaskell.Plot
non'Language.Stochaskell.Plot
noneLanguage.Stochaskell.Plot
noneOfLanguage.Stochaskell.Plot
NormalLanguage.Stochaskell
normalLanguage.Stochaskell
normalCholLanguage.Stochaskell
normalCondLanguage.Stochaskell
NormalisationMethodLanguage.Stochaskell.Plot
normaliseSampleLanguage.Stochaskell.Plot
NormalsLanguage.Stochaskell
normalsLanguage.Stochaskell
normalsCholLanguage.Stochaskell
NoScaleLanguage.Stochaskell.Plot
notLanguage.Stochaskell.Prelude, Language.Stochaskell
notANumberLanguage.Stochaskell
notBLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemOfLanguage.Stochaskell.Plot
NothingLanguage.Stochaskell.Prelude, Language.Stochaskell
notNullOfLanguage.Stochaskell.Plot
nubLanguage.Stochaskell.Prelude, Language.Stochaskell
nubByLanguage.Stochaskell.Prelude, Language.Stochaskell
nullLanguage.Stochaskell.Prelude, Language.Stochaskell
nullOfLanguage.Stochaskell.Plot
nullPickFnLanguage.Stochaskell.Plot
nulltLanguage.Stochaskell.Plot
NumLanguage.Stochaskell.Prelude, Language.Stochaskell
numBinsLanguage.Stochaskell.Plot
numSamplesLanguage.Stan
numWarmupLanguage.Stan
NUTSLanguage.PyMC3
oddLanguage.Stochaskell.Prelude, Language.Stochaskell
oldlaceLanguage.Stochaskell.Plot
oliveLanguage.Stochaskell.Plot
olivedrabLanguage.Stochaskell.Plot
onBarsLanguage.Stochaskell.Plot
onlyLanguage.Stochaskell.Plot
onTicksGridLineFunctionLanguage.Stochaskell.Plot
onWedgesLanguage.Stochaskell.Plot
opLanguage.Stochaskell.Plot
opaqueLanguage.Stochaskell.Plot
OpticLanguage.Stochaskell.Plot
Optic'Language.Stochaskell.Plot
OpticalLanguage.Stochaskell.Plot
Optical'Language.Stochaskell.Plot
orLanguage.Stochaskell.Prelude, Language.Stochaskell
orangeLanguage.Stochaskell.Plot
orangeredLanguage.Stochaskell.Plot
orchidLanguage.Stochaskell.Plot
OrdLanguage.Stochaskell.Prelude, Language.Stochaskell
OrdBLanguage.Stochaskell.Prelude, Language.Stochaskell
OrderedSampleLanguage.Stochaskell
orderedSampleLanguage.Stochaskell
OrderingLanguage.Stochaskell.Prelude, Language.Stochaskell
orientLanguage.Stochaskell.Plot
OrientationLanguage.Stochaskell.Plot
orientationLanguage.Stochaskell.Plot
orOfLanguage.Stochaskell.Plot
otherwiseLanguage.Stochaskell.Prelude, Language.Stochaskell
outerLanguage.Stochaskell
outsideLanguage.Stochaskell.Plot
OutsideAxisLabelLanguage.Stochaskell.Plot
outsideTicksLanguage.Stochaskell.Plot
OverLanguage.Stochaskell.Plot
overLanguage.Stochaskell.Plot
Over'Language.Stochaskell.Plot
overALanguage.Stochaskell.Plot
overlayLanguage.Stochaskell.Plot
PLanguage.Stochaskell
palegoldenrodLanguage.Stochaskell.Plot
palegreenLanguage.Stochaskell.Plot
paleturquoiseLanguage.Stochaskell.Plot
palevioletredLanguage.Stochaskell.Plot
pAnchorLanguage.Stochaskell.Plot
papayawhipLanguage.Stochaskell.Plot
paraLanguage.Stochaskell.Plot
paraOfLanguage.Stochaskell.Plot
partitionLanguage.Stochaskell.Prelude, Language.Stochaskell
partsLanguage.Stochaskell.Plot
partsOfLanguage.Stochaskell.Plot
partsOf'Language.Stochaskell.Plot
passingLanguage.Stochaskell.Plot
pAtLanguage.Stochaskell.Plot
PathLanguage.Stochaskell.Plot
pathColourBarLanguage.Stochaskell.Plot
pathHeatRenderLanguage.Stochaskell.Plot
pathLengthLanguage.PyMC3
pathPlotLanguage.Stochaskell.Plot
pathPlot'Language.Stochaskell.Plot
pdfLanguage.Stochaskell
peachpuffLanguage.Stochaskell.Plot
Percent 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
permutationsLanguage.Stochaskell.Prelude, Language.Stochaskell
peruLanguage.Stochaskell.Plot
pGapDirLanguage.Stochaskell.Plot
piLanguage.Stochaskell.Prelude, Language.Stochaskell
PickFnLanguage.Stochaskell.Plot
PieChart 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
pieChartToRenderableLanguage.Stochaskell.Plot
PieItem 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PieLayout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
piePlotLanguage.Stochaskell.Plot
piePlot'Language.Stochaskell.Plot
PieStateLanguage.Stochaskell.Plot
pieToRenderableLanguage.Stochaskell.Plot
pieWedgeLanguage.Stochaskell.Plot
pie_backgroundLanguage.Stochaskell.Plot
pie_colorsLanguage.Stochaskell.Plot
pie_dataLanguage.Stochaskell.Plot
pie_label_line_styleLanguage.Stochaskell.Plot
pie_label_styleLanguage.Stochaskell.Plot
pie_marginLanguage.Stochaskell.Plot
pie_plotLanguage.Stochaskell.Plot
pie_start_angleLanguage.Stochaskell.Plot
pie_titleLanguage.Stochaskell.Plot
pie_title_styleLanguage.Stochaskell.Plot
pinkLanguage.Stochaskell.Plot
pitem_labelLanguage.Stochaskell.Plot
pitem_offsetLanguage.Stochaskell.Plot
pitem_valueLanguage.Stochaskell.Plot
pixelHeatRenderLanguage.Stochaskell.Plot
pixelHeatRender'Language.Stochaskell.Plot
placeAgainstLanguage.Stochaskell.Plot
Placement 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
placementLanguage.Stochaskell.Plot
placementAnchorLanguage.Stochaskell.Plot
placementAtLanguage.Stochaskell.Plot
plasmaLanguage.Stochaskell.Plot
plateLanguage.Stochaskell.Plot
PlatedLanguage.Stochaskell.Plot
plotLanguage.Stochaskell.Plot
PlotableLanguage.Stochaskell.Plot
PlotAnnotation 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotBars 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotBarsLanguage.Stochaskell.Plot
PlotBarsAlignmentLanguage.Stochaskell.Plot
PlotBarsSpacingLanguage.Stochaskell.Plot
PlotBarsStyleLanguage.Stochaskell.Plot
PlotCandle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotColorLanguage.Stochaskell.Plot
plotColourLanguage.Stochaskell.Plot
PlotErrBars 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotFillBetween 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotHidden 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotHist 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotHistLanguage.Stochaskell.Plot
PlotIndex 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotindex_iLanguage.Stochaskell.Plot
plotLeftLanguage.Stochaskell.Plot
PlotLines 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotMarkerLanguage.Stochaskell.Plot
plotModifierLanguage.Stochaskell.Plot
PlotModsLanguage.Stochaskell.Plot
plotModsLanguage.Stochaskell.Plot
plotNameLanguage.Stochaskell.Plot
PlotOptionsLanguage.Stochaskell.Plot
plotOptionsLanguage.Stochaskell.Plot
PlotPLanguage.Stochaskell.Plot
plotPLanguage.Stochaskell.Plot
plotP'Language.Stochaskell.Plot
plotpdfLanguage.Stochaskell.Plot
PlotPoints 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotRightLanguage.Stochaskell.Plot
plotStepLanguage.Stochaskell.Plot
PlotStyleLanguage.Stochaskell.Plot
plotStyleLanguage.Stochaskell.Plot
plotStyleFunctionsLanguage.Stochaskell.Plot
plotStylesLanguage.Stochaskell.Plot
plotTransformLanguage.Stochaskell.Plot
plotUnderLanguage.Stochaskell.Plot
PlotValueLanguage.Stochaskell.Plot
plotVectorFieldLanguage.Stochaskell.Plot
PlotVectors 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotVisibleLanguage.Stochaskell.Plot
plot_all_pointsLanguage.Stochaskell.Plot
plot_annotation_angleLanguage.Stochaskell.Plot
plot_annotation_backgroundLanguage.Stochaskell.Plot
plot_annotation_hanchorLanguage.Stochaskell.Plot
plot_annotation_styleLanguage.Stochaskell.Plot
plot_annotation_valuesLanguage.Stochaskell.Plot
plot_annotation_vanchorLanguage.Stochaskell.Plot
plot_bars_alignmentLanguage.Stochaskell.Plot
plot_bars_item_stylesLanguage.Stochaskell.Plot
plot_bars_referenceLanguage.Stochaskell.Plot
plot_bars_singleton_widthLanguage.Stochaskell.Plot
plot_bars_spacingLanguage.Stochaskell.Plot
plot_bars_styleLanguage.Stochaskell.Plot
plot_bars_titlesLanguage.Stochaskell.Plot
plot_bars_valuesLanguage.Stochaskell.Plot
plot_candle_centreLanguage.Stochaskell.Plot
plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
plot_candle_fillLanguage.Stochaskell.Plot
plot_candle_line_styleLanguage.Stochaskell.Plot
plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
plot_candle_tick_lengthLanguage.Stochaskell.Plot
plot_candle_titleLanguage.Stochaskell.Plot
plot_candle_valuesLanguage.Stochaskell.Plot
plot_candle_widthLanguage.Stochaskell.Plot
plot_errbars_line_styleLanguage.Stochaskell.Plot
plot_errbars_overhangLanguage.Stochaskell.Plot
plot_errbars_tick_lengthLanguage.Stochaskell.Plot
plot_errbars_titleLanguage.Stochaskell.Plot
plot_errbars_valuesLanguage.Stochaskell.Plot
plot_fillbetween_styleLanguage.Stochaskell.Plot
plot_fillbetween_titleLanguage.Stochaskell.Plot
plot_fillbetween_valuesLanguage.Stochaskell.Plot
plot_hidden_x_valuesLanguage.Stochaskell.Plot
plot_hidden_y_valuesLanguage.Stochaskell.Plot
plot_hist_binsLanguage.Stochaskell.Plot
plot_hist_drop_linesLanguage.Stochaskell.Plot
plot_hist_fill_styleLanguage.Stochaskell.Plot
plot_hist_line_styleLanguage.Stochaskell.Plot
plot_hist_norm_funcLanguage.Stochaskell.Plot
plot_hist_no_zerosLanguage.Stochaskell.Plot
plot_hist_rangeLanguage.Stochaskell.Plot
plot_hist_titleLanguage.Stochaskell.Plot
plot_hist_valuesLanguage.Stochaskell.Plot
plot_legendLanguage.Stochaskell.Plot
plot_lines_limit_valuesLanguage.Stochaskell.Plot
plot_lines_styleLanguage.Stochaskell.Plot
plot_lines_titleLanguage.Stochaskell.Plot
plot_lines_valuesLanguage.Stochaskell.Plot
plot_points_styleLanguage.Stochaskell.Plot
plot_points_titleLanguage.Stochaskell.Plot
plot_points_valuesLanguage.Stochaskell.Plot
plot_renderLanguage.Stochaskell.Plot
plot_vectors_gridLanguage.Stochaskell.Plot
plot_vectors_mapfLanguage.Stochaskell.Plot
plot_vectors_scaleLanguage.Stochaskell.Plot
plot_vectors_styleLanguage.Stochaskell.Plot
plot_vectors_titleLanguage.Stochaskell.Plot
plot_vectors_valuesLanguage.Stochaskell.Plot
plumLanguage.Stochaskell.Plot
plusLanguage.Stochaskell.Plot
plussesLanguage.Stochaskell.Plot
pmChainsLanguage.PyMC3
pmDrawsLanguage.PyMC3
PMFLanguage.Stochaskell
pmfLanguage.Stochaskell
pmFloatXLanguage.PyMC3
pmInitLanguage.PyMC3
pmProgramLanguage.PyMC3
pmProgram'Language.PyMC3
pmStartLanguage.PyMC3
pmStepLanguage.PyMC3
pmTuneLanguage.PyMC3
Point 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PointMapFnLanguage.Stochaskell.Plot
pointsLanguage.Stochaskell.Plot
PointShapeLanguage.Stochaskell.Plot
PointShapeArrowHeadLanguage.Stochaskell.Plot
PointShapeCircleLanguage.Stochaskell.Plot
PointShapeCrossLanguage.Stochaskell.Plot
PointShapeEllipseLanguage.Stochaskell.Plot
PointShapePlusLanguage.Stochaskell.Plot
PointShapePolygonLanguage.Stochaskell.Plot
PointShapeStarLanguage.Stochaskell.Plot
PointStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
pointToVecLanguage.Stochaskell.Plot
point_border_colorLanguage.Stochaskell.Plot
point_border_widthLanguage.Stochaskell.Plot
point_colorLanguage.Stochaskell.Plot
point_radiusLanguage.Stochaskell.Plot
point_shapeLanguage.Stochaskell.Plot
PoissonLanguage.Stochaskell
poissonLanguage.Stochaskell
PoissonProcessLanguage.Stochaskell
poissonProcessLanguage.Stochaskell
Polar 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
polarLanguage.Stochaskell.Plot
polarAxisLanguage.Stochaskell.Plot
polarIsoLanguage.Stochaskell.Plot
polarV2Language.Stochaskell.Plot
powderblueLanguage.Stochaskell.Plot
preLanguage.Stochaskell.Plot
predLanguage.Stochaskell.Prelude, Language.Stochaskell
preuseLanguage.Stochaskell.Plot
preusesLanguage.Stochaskell.Plot
previewLanguage.Stochaskell.Plot
previewsLanguage.Stochaskell.Plot
printLanguage.Stochaskell.Prelude, Language.Stochaskell
Prism 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
prismLanguage.Stochaskell.Plot
Prism'Language.Stochaskell.Plot
prism'Language.Stochaskell.Plot
probabilityLanguage.Stochaskell.Plot
Product 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
productLanguage.Stochaskell.Prelude, Language.Stochaskell
productOfLanguage.Stochaskell.Plot
ProfunctorLanguage.Stochaskell.Plot
properFractionLanguage.Stochaskell.Prelude, Language.Stochaskell
psubLanguage.Stochaskell.Plot
pureLanguage.Stochaskell.Prelude, Language.Stochaskell
purpleLanguage.Stochaskell.Plot
putCharLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLnLanguage.Stochaskell.Prelude, Language.Stochaskell
pvaddLanguage.Stochaskell.Plot
pvsubLanguage.Stochaskell.Plot
PyMC3InferenceLanguage.PyMC3
PyMC3SampleLanguage.PyMC3
PyMC3StepLanguage.PyMC3
p_xLanguage.Stochaskell.Plot
p_yLanguage.Stochaskell.Plot
qfDiagLanguage.Stochaskell
quotLanguage.Stochaskell.Prelude, Language.Stochaskell
quotRemLanguage.Stochaskell.Prelude, Language.Stochaskell
RLanguage.Stochaskell
r2AxisLanguage.Stochaskell.Plot
r2AxisMainLanguage.Stochaskell.Plot
RadialLanguage.Stochaskell.Plot
RangeLanguage.Stochaskell.Plot
RationalLanguage.Stochaskell.Prelude, Language.Stochaskell
rawPlotLanguage.Stochaskell.Plot
rAxisLanguage.Stochaskell.Plot
RCornerBevelLanguage.Stochaskell.Plot
RCornerRoundedLanguage.Stochaskell.Plot
RCornerSquareLanguage.Stochaskell.Plot
reLanguage.Stochaskell.Plot
ReadLanguage.Stochaskell.Prelude, Language.Stochaskell
readLanguage.Stochaskell.Prelude, Language.Stochaskell
readColourNameLanguage.Stochaskell.Plot
readFileLanguage.Stochaskell.Prelude, Language.Stochaskell
readIOLanguage.Stochaskell.Prelude, Language.Stochaskell
readListLanguage.Stochaskell.Prelude, Language.Stochaskell
readLnLanguage.Stochaskell.Prelude, Language.Stochaskell
readParenLanguage.Stochaskell.Prelude, Language.Stochaskell
readRealMatrixLanguage.Stochaskell
ReadSLanguage.Stochaskell.Prelude, Language.Stochaskell
readsLanguage.Stochaskell.Prelude, Language.Stochaskell
readsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
RealLanguage.Stochaskell.Prelude, Language.Stochaskell
realLanguage.Stochaskell
RealFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
RealFracLanguage.Stochaskell.Prelude, Language.Stochaskell
RealTLanguage.Stochaskell.Expression
realToFracLanguage.Stochaskell.Prelude, Language.Stochaskell
recipLanguage.Stochaskell.Prelude, Language.Stochaskell
Rect 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Rectangle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
rectangleToRenderableLanguage.Stochaskell.Plot
RectCornerStyleLanguage.Stochaskell.Plot
RectEdgeLanguage.Stochaskell.Plot
rectPathLanguage.Stochaskell.Plot
RectSizeLanguage.Stochaskell.Plot
rect_cornerStyleLanguage.Stochaskell.Plot
rect_fillStyleLanguage.Stochaskell.Plot
rect_lineStyleLanguage.Stochaskell.Plot
rect_minsizeLanguage.Stochaskell.Plot
RecursiveTLanguage.Stochaskell.Expression
redLanguage.Stochaskell.Plot
ReifiedFoldLanguage.Stochaskell.Plot
ReifiedGetterLanguage.Stochaskell.Plot
ReifiedIndexedFoldLanguage.Stochaskell.Plot
ReifiedIndexedGetterLanguage.Stochaskell.Plot
ReifiedIndexedLensLanguage.Stochaskell.Plot
ReifiedIndexedLens'Language.Stochaskell.Plot
ReifiedIndexedSetterLanguage.Stochaskell.Plot
ReifiedIndexedSetter'Language.Stochaskell.Plot
ReifiedIndexedTraversalLanguage.Stochaskell.Plot
ReifiedIndexedTraversal'Language.Stochaskell.Plot
ReifiedIsoLanguage.Stochaskell.Plot
ReifiedIso'Language.Stochaskell.Plot
ReifiedLensLanguage.Stochaskell.Plot
ReifiedLens'Language.Stochaskell.Plot
ReifiedPrismLanguage.Stochaskell.Plot
ReifiedPrism'Language.Stochaskell.Plot
ReifiedSetterLanguage.Stochaskell.Plot
ReifiedSetter'Language.Stochaskell.Plot
ReifiedTraversalLanguage.Stochaskell.Plot
ReifiedTraversal'Language.Stochaskell.Plot
reindexedLanguage.Stochaskell.Plot
RelativeExtendLanguage.Stochaskell.Plot
remLanguage.Stochaskell.Prelude, Language.Stochaskell
renderLanguage.Stochaskell.Plot
Renderable 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
RenderAxisLanguage.Stochaskell.Plot
renderAxisLanguage.Stochaskell.Plot
renderAxis2Language.Stochaskell.Plot
renderAxisGridLanguage.Stochaskell.Plot
renderColourBarLanguage.Stochaskell.Plot
renderPlotableLanguage.Stochaskell.Plot
renderSizeLanguage.Stochaskell.Plot
renderStackedLayoutsLanguage.Stochaskell.Plot
renderStyledPlotLanguage.Stochaskell.Plot
repeatLanguage.Stochaskell.Prelude, Language.Stochaskell
repeatedLanguage.Stochaskell.Plot
replaceLanguage.Stochaskell
replaceAtLanguage.Stochaskell
replaceIndexLanguage.Stochaskell
replicateLanguage.Stochaskell.Prelude, Language.Stochaskell
replicatedLanguage.Stochaskell.Plot
replicateMLanguage.Stochaskell.Prelude, Language.Stochaskell
replicateM_Language.Stochaskell.Prelude, Language.Stochaskell
retaggedLanguage.Stochaskell.Plot
returnLanguage.Stochaskell.Prelude, Language.Stochaskell
reuseLanguage.Stochaskell.Plot
reusesLanguage.Stochaskell.Plot
reverseLanguage.Stochaskell.Prelude, Language.Stochaskell
ReversedLanguage.Stochaskell.Plot
reversedLanguage.Stochaskell.Plot
ReversingLanguage.Stochaskell.Plot
reversingLanguage.Stochaskell.Plot
ReviewLanguage.Stochaskell.Plot
reviewLanguage.Stochaskell.Plot
ReviewableLanguage.Stochaskell.Plot
reviewsLanguage.Stochaskell.Plot
RewrappedLanguage.Stochaskell.Plot
RewrappingLanguage.Stochaskell.Plot
rewriteLanguage.Stochaskell.Plot
rewriteMLanguage.Stochaskell.Plot
rewriteMOfLanguage.Stochaskell.Plot
rewriteMOnLanguage.Stochaskell.Plot
rewriteMOnOfLanguage.Stochaskell.Plot
rewriteOfLanguage.Stochaskell.Plot
rewriteOnLanguage.Stochaskell.Plot
rewriteOnOfLanguage.Stochaskell.Plot
RightLanguage.Stochaskell.Prelude, Language.Stochaskell
rightLanguage.Stochaskell.Plot
right'Language.Stochaskell.Plot
rightAboveLanguage.Stochaskell.Plot
rightBelowLanguage.Stochaskell.Plot
rightBottomLanguage.Stochaskell.Plot
rightMidLanguage.Stochaskell.Plot
RightmostLanguage.Stochaskell.Plot
rightTopLanguage.Stochaskell.Plot
rjmcLanguage.Stochaskell
rjmc1Language.Stochaskell
rjmc1RatioLanguage.Stochaskell
rjmcCLanguage.Stochaskell
rLabelLanguage.Stochaskell.Plot
rlabelLanguage.Stochaskell.Plot
rmapLanguage.Stochaskell.Plot
rmappingLanguage.Stochaskell.Plot
RMatLanguage.Stochaskell
rMaxLanguage.Stochaskell.Plot
rosybrownLanguage.Stochaskell.Plot
rotateLanguage.Stochaskell.Plot
rotatePLanguage.Stochaskell.Plot
roundLanguage.Stochaskell.Prelude, Language.Stochaskell
royalblueLanguage.Stochaskell.Plot
runBazaarLanguage.Stochaskell.Plot
runBazaar1Language.Stochaskell.Plot
runCCLanguage.Stochaskell
runEqLanguage.Stochaskell.Plot
runFoldLanguage.Stochaskell.Plot
runGetterLanguage.Stochaskell.Plot
runIdentityLanguage.Stochaskell.Plot
runIndexedLanguage.Stochaskell.Plot
runIndexedFoldLanguage.Stochaskell.Plot
runIndexedGetterLanguage.Stochaskell.Plot
runIndexedLensLanguage.Stochaskell.Plot
runIndexedSetterLanguage.Stochaskell.Plot
runIndexedTraversalLanguage.Stochaskell.Plot
runIsoLanguage.Stochaskell.Plot
runLensLanguage.Stochaskell.Plot
runningBarsLanguage.Stochaskell.Plot
runPrismLanguage.Stochaskell.Plot
runPyMC3Language.PyMC3
runSetterLanguage.Stochaskell.Plot
runStanLanguage.Stan
runStepLanguage.Stochaskell
runTraversalLanguage.Stochaskell.Plot
RVecLanguage.Stochaskell
saddlebrownLanguage.Stochaskell.Plot
salmonLanguage.Stochaskell.Plot
sandybrownLanguage.Stochaskell.Plot
sansLanguage.Stochaskell.Plot
saveWarmupLanguage.Stan
ScalableLanguage.Stochaskell
scalarMultiplyLanguage.Stochaskell.Plot
scaleLanguage.Stochaskell.Plot
scaleAspectRatioLanguage.Stochaskell.Plot
scaledAxisLanguage.Stochaskell.Plot
scaledIntAxisLanguage.Stochaskell.Plot
scaleFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
ScaleModeLanguage.Stochaskell.Plot
scaleModeLanguage.Stochaskell.Plot
scaleNumLanguage.Stochaskell.Plot
scalePLanguage.Stochaskell.Plot
scanl'Language.Stochaskell.Prelude, Language.Stochaskell
scanl1Language.Stochaskell.Prelude, Language.Stochaskell
scanl1OfLanguage.Stochaskell.Plot
scanlELanguage.Stochaskell
scanr1Language.Stochaskell.Prelude, Language.Stochaskell
scanr1OfLanguage.Stochaskell.Plot
scanrELanguage.Stochaskell
ScatterOptionsLanguage.Stochaskell.Plot
scatterOptionsLanguage.Stochaskell.Plot
ScatterPlotLanguage.Stochaskell.Plot
scatterPlotLanguage.Stochaskell.Plot
scatterPlot'Language.Stochaskell.Plot
scatterPlotOfLanguage.Stochaskell.Plot
scatterPlotOf'Language.Stochaskell.Plot
scatterPositionLanguage.Stochaskell.Plot
scatterStyleLanguage.Stochaskell.Plot
scatterTransformLanguage.Stochaskell.Plot
scribeLanguage.Stochaskell.Plot
seagreenLanguage.Stochaskell.Plot
seashellLanguage.Stochaskell.Plot
secondingLanguage.Stochaskell.Plot
selectItemsLanguage.Stochaskell
selfIndexLanguage.Stochaskell.Plot
SemigroupLanguage.Stochaskell.Prelude, Language.Stochaskell
seqLanguage.Stochaskell.Prelude, Language.Stochaskell
seqListLanguage.Stochaskell
sequenceLanguage.Stochaskell.Prelude, Language.Stochaskell
sequence1Of_Language.Stochaskell.Plot
sequenceALanguage.Stochaskell.Prelude, Language.Stochaskell
sequenceAOfLanguage.Stochaskell.Plot
sequenceAOf_Language.Stochaskell.Plot
sequenceByLanguage.Stochaskell.Plot
sequenceByOfLanguage.Stochaskell.Plot
SequencedLanguage.Stochaskell.Plot
sequenceOfLanguage.Stochaskell.Plot
sequenceOf_Language.Stochaskell.Plot
sequence_Language.Stochaskell.Prelude, Language.Stochaskell
setLanguage.Stochaskell.Plot
set'Language.Stochaskell.Plot
setColorsLanguage.Stochaskell.Plot
setPickFnLanguage.Stochaskell.Plot
setRandomSeedLanguage.Stochaskell
setsLanguage.Stochaskell.Plot
setShapesLanguage.Stochaskell.Plot
SettableLanguage.Stochaskell.Plot
Setter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Setter'Language.Stochaskell.Plot
SettingLanguage.Stochaskell.Plot
settingLanguage.Stochaskell.Plot
Setting'Language.Stochaskell.Plot
shapesLanguage.Stochaskell.Plot
ShowLanguage.Stochaskell.Prelude, Language.Stochaskell
showLanguage.Stochaskell.Prelude, Language.Stochaskell
Show1Language.Stochaskell.Expression
showCharLanguage.Stochaskell.Prelude, Language.Stochaskell
showGridLinesLanguage.Stochaskell.Plot
showListLanguage.Stochaskell.Prelude, Language.Stochaskell
showParenLanguage.Stochaskell.Prelude, Language.Stochaskell
ShowSLanguage.Stochaskell.Prelude, Language.Stochaskell
showsLanguage.Stochaskell.Prelude, Language.Stochaskell
showsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
showStringLanguage.Stochaskell.Prelude, Language.Stochaskell
siennaLanguage.Stochaskell.Plot
significandLanguage.Stochaskell.Prelude, Language.Stochaskell
signumLanguage.Stochaskell.Prelude, Language.Stochaskell
silence'Language.Stochaskell
silverLanguage.Stochaskell.Plot
simChurchVecLanguage.Church
SimpleLanguage.Stochaskell.Plot
simpleLanguage.Stochaskell.Plot
simpleLensesLanguage.Stochaskell.Plot
simplyLanguage.Stochaskell.Plot
simulateLanguage.Stochaskell
sinLanguage.Stochaskell.Prelude, Language.Stochaskell
SingleAxisLanguage.Stochaskell.Plot
singleStyledPlotLegendLanguage.Stochaskell.Plot
singularLanguage.Stochaskell.Plot
sinhLanguage.Stochaskell.Prelude, Language.Stochaskell
skyblueLanguage.Stochaskell.Plot
slateblueLanguage.Stochaskell.Plot
slategrayLanguage.Stochaskell.Plot
slategreyLanguage.Stochaskell.Plot
slayouts_compress_legendLanguage.Stochaskell.Plot
slayouts_layoutsLanguage.Stochaskell.Plot
SliceLanguage.PyMC3
sliceLanguage.Stochaskell
smoothLinePlotLanguage.Stochaskell.Plot
smoothLinePlot'Language.Stochaskell.Plot
sndLanguage.Stochaskell.Prelude, Language.Stochaskell
SnocLanguage.Stochaskell.Plot
snocLanguage.Stochaskell.Plot
snowLanguage.Stochaskell.Plot
solidFillStyleLanguage.Stochaskell.Plot
solidLineLanguage.Stochaskell.Plot
solveLanguage.Stochaskell
solvePLanguage.Stochaskell
sortLanguage.Stochaskell.Prelude, Language.Stochaskell
sort2BLanguage.Stochaskell.Prelude, Language.Stochaskell
sortByLanguage.Stochaskell.Prelude, Language.Stochaskell
sortOnLanguage.Stochaskell.Prelude, Language.Stochaskell
spacerLanguage.Stochaskell.Plot
spacer1Language.Stochaskell.Plot
SpaceWeightLanguage.Stochaskell.Plot
SpanLanguage.Stochaskell.Plot
spanLanguage.Stochaskell.Prelude, Language.Stochaskell
spanListLanguage.Stochaskell
specBoundsLanguage.Stochaskell.Plot
specColourMapLanguage.Stochaskell.Plot
specPointLanguage.Stochaskell.Plot
specScaleLanguage.Stochaskell.Plot
specTransLanguage.Stochaskell.Plot
splitLanguage.Stochaskell
splitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
springgreenLanguage.Stochaskell.Plot
sqrtLanguage.Stochaskell.Prelude, Language.Stochaskell
squareLanguage.Stochaskell
SquareMatrixLanguage.Stochaskell
stackedBarsLanguage.Stochaskell.Plot
stackedEqualBarsLanguage.Stochaskell.Plot
StackedLayout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
StackedLayoutLRLanguage.Stochaskell.Plot
StackedLayouts 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
staircaseLanguage.Stochaskell
StanDenseEMetricLanguage.Stan
StanDiagEMetricLanguage.Stan
StanHMCEngineLanguage.Stan
StanHMCMetricLanguage.Stan
StanMethodLanguage.Stan
StanNUTSEngineLanguage.Stan
StanSampleLanguage.Stan
StanStaticHMCEngineLanguage.Stan
StanUnitEMetricLanguage.Stan
star'Language.Stochaskell.Plot
starsLanguage.Stochaskell.Plot
startswithLanguage.Stochaskell
steelblueLanguage.Stochaskell.Plot
stepRandLanguage.PyMC3
stepScaleLanguage.PyMC3
stochaskellLanguage.Stochaskell
storingLanguage.Stochaskell.Plot
StretchLanguage.Stochaskell.Plot
strFromALLanguage.Stochaskell
Strict 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
strictLanguage.Stochaskell.Plot
StringLanguage.Stochaskell.Prelude, Language.Stochaskell
stripPrefixLanguage.Stochaskell.Prelude, Language.Stochaskell
strokePathLanguage.Stochaskell.Plot
strokePointPathLanguage.Stochaskell.Plot
strToALLanguage.Stochaskell
StyledPlotLanguage.Stochaskell.Plot
styledPlotLanguage.Stochaskell.Plot
styledPlotLegendsLanguage.Stochaskell.Plot
styleDynamicLanguage.Stochaskell.Plot
subIndexLanguage.Stochaskell
SubrangeTLanguage.Stochaskell.Expression
subsequencesLanguage.Stochaskell.Prelude, Language.Stochaskell
substEqLanguage.Stochaskell.Plot
subtractLanguage.Stochaskell.Prelude, Language.Stochaskell
succLanguage.Stochaskell.Prelude, Language.Stochaskell
Sum 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
sumLanguage.Stochaskell.Prelude, Language.Stochaskell
sum'Language.Stochaskell
sumOfLanguage.Stochaskell.Plot
Swapped 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
swappedLanguage.Stochaskell.Plot
symbolLanguage.Stochaskell
symbolsLanguage.Stochaskell
symErrPointLanguage.Stochaskell.Plot
TagLanguage.Stochaskell.Expression
Tags 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tagsLanguage.Stochaskell.Expression
tailLanguage.Stochaskell.Prelude, Language.Stochaskell
tailsLanguage.Stochaskell.Prelude, Language.Stochaskell
takeLanguage.Stochaskell.Prelude, Language.Stochaskell
takeColorLanguage.Stochaskell.Plot
takeShapeLanguage.Stochaskell.Plot
takeWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
takeWhileListLanguage.Stochaskell
takingLanguage.Stochaskell.Plot
takingWhileLanguage.Stochaskell.Plot
tallBesideLanguage.Stochaskell.Plot
tanLanguage.Stochaskell.Prelude, Language.Stochaskell
tanhLanguage.Stochaskell.Prelude, Language.Stochaskell
tealLanguage.Stochaskell.Plot
textDimensionLanguage.Stochaskell.Plot
textDrawRectLanguage.Stochaskell.Plot
TextFunctionLanguage.Stochaskell.Plot
TextSize 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
textSizeLanguage.Stochaskell.Plot
textSizeAscentLanguage.Stochaskell.Plot
textSizeDescentLanguage.Stochaskell.Plot
textSizeHeightLanguage.Stochaskell.Plot
textSizeWidthLanguage.Stochaskell.Plot
textSizeYBearingLanguage.Stochaskell.Plot
textStyleLanguage.Stochaskell.Plot
textStyleFunctionLanguage.Stochaskell.Plot
thetaAxisLanguage.Stochaskell.Plot
thetaLabelLanguage.Stochaskell.Plot
thinLanguage.Stan
thistleLanguage.Stochaskell.Plot
ticLanguage.Stochaskell
tickLabelLanguage.Stochaskell.Plot
tickLabelFunctionLanguage.Stochaskell.Plot
tickLabelGapLanguage.Stochaskell.Plot
tickLabelPositionsLanguage.Stochaskell.Plot
TickLabelsLanguage.Stochaskell.Plot
tickLabelStyleLanguage.Stochaskell.Plot
tickLabelTextFunctionLanguage.Stochaskell.Plot
TicksLanguage.Stochaskell.Plot
ticksAlignLanguage.Stochaskell.Plot
TicksAlignmentLanguage.Stochaskell.Plot
TickSpecLanguage.Stochaskell.Plot
ticksStyleLanguage.Stochaskell.Plot
ticksVisibleLanguage.Stochaskell.Plot
TimeLabelAlignmentLanguage.Stochaskell.Plot
TimeLabelFnLanguage.Stochaskell.Plot
TimeSeqLanguage.Stochaskell.Plot
TimeValueLanguage.Stochaskell.Plot
timeValueAxisLanguage.Stochaskell.Plot
timeValueFromDoubleLanguage.Stochaskell.Plot
TitleLanguage.Stochaskell.Plot
titleLanguage.Stochaskell.Plot
titleAlignmentLanguage.Stochaskell.Plot
titleGapLanguage.Stochaskell.Plot
titlePlacementLanguage.Stochaskell.Plot
titleStyleLanguage.Stochaskell.Plot
titleTextLanguage.Stochaskell.Plot
titleTextFunctionLanguage.Stochaskell.Plot
toLanguage.Stochaskell.Plot
tocLanguage.Stochaskell
toConcreteLanguage.Stochaskell.Expression
toConcreteCLanguage.Stochaskell.Expression
toEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
toExprTupleLanguage.Stochaskell.Expression
ToImageLanguage.Stochaskell.Plot
toIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
toListLanguage.Stochaskell
toListOfLanguage.Stochaskell.Plot
tomatoLanguage.Stochaskell.Plot
toNonEmptyOfLanguage.Stochaskell.Plot
topLanguage.Stochaskell.Plot
topLeftLanguage.Stochaskell.Plot
ToPlotLanguage.Stochaskell.Plot
toPlotLanguage.Stochaskell.Plot
TopNameLanguage.Stochaskell.Plot
toPNGLanguage.Stochaskell.Plot
topRightLanguage.Stochaskell.Plot
toRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
ToRenderableLanguage.Stochaskell.Plot
toRenderableLanguage.Stochaskell.Plot
toStopsLanguage.Stochaskell.Plot
toSVGLanguage.Stochaskell.Plot
toValueLanguage.Stochaskell.Plot
trLanguage.Stochaskell
tr'Language.Stochaskell
trailPlotLanguage.Stochaskell.Plot
trailPlot'Language.Stochaskell.Plot
TransfiniteLanguage.Stochaskell
transformLanguage.Stochaskell.Plot
transformMLanguage.Stochaskell.Plot
transformMOfLanguage.Stochaskell.Plot
transformMOnLanguage.Stochaskell.Plot
transformMOnOfLanguage.Stochaskell.Plot
transformOfLanguage.Stochaskell.Plot
transformOnLanguage.Stochaskell.Plot
transformOnOfLanguage.Stochaskell.Plot
transformPLanguage.Stochaskell.Plot
translateLanguage.Stochaskell.Plot
translatePLanguage.Stochaskell.Plot
transparentLanguage.Stochaskell.Plot
TransposableLanguage.Stochaskell
transposeLanguage.Stochaskell.Prelude, Language.Stochaskell
transposeOfLanguage.Stochaskell.Plot
TraversableLanguage.Stochaskell.Prelude, Language.Stochaskell, Language.Stochaskell.Plot
Traversable1Language.Stochaskell.Plot
TraversableWithIndexLanguage.Stochaskell.Plot
Traversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Traversal'Language.Stochaskell.Plot
Traversal1Language.Stochaskell.Plot
Traversal1'Language.Stochaskell.Plot
traverseLanguage.Stochaskell.Prelude, Language.Stochaskell, Language.Stochaskell.Plot
traverse1Language.Stochaskell.Plot
traverse1Of_Language.Stochaskell.Plot
traverseByLanguage.Stochaskell.Plot
traverseByOfLanguage.Stochaskell.Plot
TraversedLanguage.Stochaskell.Plot
traversedLanguage.Stochaskell.Plot
traversed1Language.Stochaskell.Plot
traversed64Language.Stochaskell.Plot
TraverseMaxLanguage.Stochaskell.Plot
traverseMaxLanguage.Stochaskell.Plot
TraverseMinLanguage.Stochaskell.Plot
traverseMinLanguage.Stochaskell.Plot
traverseOfLanguage.Stochaskell.Plot
traverseOf_Language.Stochaskell.Plot
TraversingLanguage.Stochaskell.Plot
Traversing'Language.Stochaskell.Plot
Traversing1Language.Stochaskell.Plot
Traversing1'Language.Stochaskell.Plot
TrueLanguage.Stochaskell.Prelude, Language.Stochaskell
trueLanguage.Stochaskell.Prelude, Language.Stochaskell
truncateLanguage.Stochaskell.Prelude, Language.Stochaskell
truncatedLanguage.Stochaskell
tspanLanguage.Stochaskell.Plot
TupleSize 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tupleSizeLanguage.Stochaskell.Expression
TupleTLanguage.Stochaskell.Expression
tupleTLanguage.Stochaskell.Expression
turquoiseLanguage.Stochaskell.Plot
tvalLanguage.Stochaskell.Plot
tvFromUTCTimeLanguage.Stochaskell.Plot
TypeLanguage.Stochaskell.Expression
TypeIsLanguage.Stochaskell.Expression
TypeOfLanguage.Stochaskell.Expression
typeOfLanguage.Stochaskell.Expression
TypesIsLanguage.Stochaskell.Expression
TypesOfLanguage.Stochaskell.Expression
typesOfLanguage.Stochaskell.Expression
unLanguage.Stochaskell.Plot
uncons 
1 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
uncurriedLanguage.Stochaskell.Plot
uncurryLanguage.Stochaskell.Prelude, Language.Stochaskell
undefinedLanguage.Stochaskell.Prelude, Language.Stochaskell
underLanguage.Stochaskell.Plot
underscoreFieldsLanguage.Stochaskell.Plot
underscoreNamerLanguage.Stochaskell.Plot
underscoreNoPrefixNamerLanguage.Stochaskell.Plot
UnderTicksLanguage.Stochaskell.Plot
unfixELanguage.Stochaskell.Expression
unfoldELanguage.Stochaskell
unfoldedLanguage.Stochaskell.Plot
unfoldPLanguage.Stochaskell
unfoldrLanguage.Stochaskell.Prelude, Language.Stochaskell
unGenerically1Language.Stochaskell.Expression
UniformLanguage.Stochaskell
uniformLanguage.Stochaskell
UniformsLanguage.Stochaskell
uniformsLanguage.Stochaskell
UniformScaleLanguage.Stochaskell.Plot
UniformScaleStrategyLanguage.Stochaskell.Plot
unionLanguage.Stochaskell.Prelude, Language.Stochaskell
unionByLanguage.Stochaskell.Prelude, Language.Stochaskell
UnionTLanguage.Stochaskell.Expression
uniqLanguage.Stochaskell
unitAxisLanguage.Stochaskell.Plot
unitedLanguage.Stochaskell.Plot
UnitOnlyLanguage.Stochaskell.Plot
universeLanguage.Stochaskell.Plot
universeOfLanguage.Stochaskell.Plot
universeOnLanguage.Stochaskell.Plot
universeOnOfLanguage.Stochaskell.Plot
UnknownTypeLanguage.Stochaskell.Expression
unlessLanguage.Stochaskell.Prelude, Language.Stochaskell
unlinesLanguage.Stochaskell.Prelude, Language.Stochaskell
unPercentLanguage.Stochaskell.Plot
unpolarLanguage.Stochaskell.Plot
unsafePartsOfLanguage.Stochaskell.Plot
unsafePartsOf'Language.Stochaskell.Plot
unsafeSingularLanguage.Stochaskell.Plot
unsnocLanguage.Stochaskell.Plot
untilLanguage.Stochaskell.Prelude, Language.Stochaskell
untoLanguage.Stochaskell.Plot
unwordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Unwrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
unzipLanguage.Stochaskell.Prelude, Language.Stochaskell
unzip3Language.Stochaskell.Prelude, Language.Stochaskell
unzip4Language.Stochaskell.Prelude, Language.Stochaskell
unzip5Language.Stochaskell.Prelude, Language.Stochaskell
unzip6Language.Stochaskell.Prelude, Language.Stochaskell
unzip7Language.Stochaskell.Prelude, Language.Stochaskell
UpperAxisLabelLanguage.Stochaskell.Plot
useLanguage.Stochaskell.Plot
userErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
usesLanguage.Stochaskell.Plot
utctimeFromTVLanguage.Stochaskell.Plot
valuesALLanguage.Stochaskell
vangleLanguage.Stochaskell.Plot
vecTLanguage.Stochaskell.Expression
VectorLanguage.Stochaskell
vectorLanguage.Stochaskell
vectorAlignmentFnsLanguage.Stochaskell.Plot
vectorSizeLanguage.Stochaskell
VectorStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
vector_head_styleLanguage.Stochaskell.Plot
vector_line_styleLanguage.Stochaskell.Plot
VerticalLanguage.Stochaskell.Plot
verticalLanguage.Stochaskell.Plot
viewLanguage.Stochaskell.Plot
viewsLanguage.Stochaskell.Plot
violetLanguage.Stochaskell.Plot
viridisLanguage.Stochaskell.Plot
visibleLanguage.Stochaskell.Plot
vividColoursLanguage.Stochaskell.Plot
vizIRLanguage.Graphviz, Language.Stochaskell
vlenLanguage.Stochaskell.Plot
vlinePlotLanguage.Stochaskell.Plot
vmapLanguage.Stochaskell.Plot
voidLanguage.Stochaskell.Prelude, Language.Stochaskell
vscaleLanguage.Stochaskell.Plot
VTA_BaseLineLanguage.Stochaskell.Plot
VTA_BottomLanguage.Stochaskell.Plot
VTA_CentreLanguage.Stochaskell.Plot
VTA_TopLanguage.Stochaskell.Plot
VTextAnchorLanguage.Stochaskell.Plot
v_xLanguage.Stochaskell.Plot
v_yLanguage.Stochaskell.Plot
WedgeLanguage.Stochaskell.Plot
wedgeDirectionLanguage.Stochaskell.Plot
wedgeInnerRadiusLanguage.Stochaskell.Plot
wedgeKeysLanguage.Stochaskell.Plot
wedgeOffsetLanguage.Stochaskell.Plot
wedgeOuterRadiusLanguage.Stochaskell.Plot
wedgePlotLanguage.Stochaskell.Plot
wedgeWidthLanguage.Stochaskell.Plot
weightsLanguage.Stochaskell.Plot
wheatLanguage.Stochaskell.Plot
whenLanguage.Stochaskell.Prelude, Language.Stochaskell
whiteLanguage.Stochaskell.Plot
whitesmokeLanguage.Stochaskell.Plot
WholeFunc 
1 (Data Constructor)Language.Stochaskell
2 (Type/Class)Language.Stochaskell
wholeMapLanguage.Stochaskell
wideAboveLanguage.Stochaskell.Plot
widthLanguage.Stochaskell.Plot
withClipRegionLanguage.Stochaskell.Plot
withDefaultStyleLanguage.Stochaskell.Plot
withFillStyleLanguage.Stochaskell.Plot
withFontStyleLanguage.Stochaskell.Plot
withinLanguage.Stochaskell.Plot
withIndexLanguage.Stochaskell.Plot
withIsoLanguage.Stochaskell.Plot
withLineStyleLanguage.Stochaskell.Plot
withOpacityLanguage.Stochaskell.Plot
withoutLanguage.Stochaskell.Plot
withPointStyleLanguage.Stochaskell.Plot
withPrismLanguage.Stochaskell.Plot
withRotationLanguage.Stochaskell.Plot
withScaleLanguage.Stochaskell.Plot
withScaleXLanguage.Stochaskell.Plot
withScaleYLanguage.Stochaskell.Plot
withTransformLanguage.Stochaskell.Plot
withTranslationLanguage.Stochaskell.Plot
WordLanguage.Stochaskell.Prelude, Language.Stochaskell
wordedLanguage.Stochaskell.Plot
wordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Wrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
writeFileLanguage.Stochaskell.Prelude, Language.Stochaskell
x0Language.Stochaskell.Plot
xAxisLanguage.Stochaskell.Plot
xLabelLanguage.Stochaskell.Plot
xlabelLanguage.Stochaskell.Plot
xlimLanguage.Stochaskell.Plot
xMaxLanguage.Stochaskell.Plot
xMinLanguage.Stochaskell.Plot
xxLanguage.Stochaskell.Plot
xyLanguage.Stochaskell.Plot
xy_Language.Stochaskell.Plot
x_Language.Stochaskell.Plot
y0Language.Stochaskell.Plot
yAxisLanguage.Stochaskell.Plot
yearsLanguage.Stochaskell.Plot
yellowLanguage.Stochaskell.Plot
yellowgreenLanguage.Stochaskell.Plot
yLabelLanguage.Stochaskell.Plot
ylabelLanguage.Stochaskell.Plot
ylimLanguage.Stochaskell.Plot
yMaxLanguage.Stochaskell.Plot
yMinLanguage.Stochaskell.Plot
yxLanguage.Stochaskell.Plot
yyLanguage.Stochaskell.Plot
y_Language.Stochaskell.Plot
ZLanguage.Stochaskell
zAxisLanguage.Stochaskell.Plot
zerosLanguage.Stochaskell
zipLanguage.Stochaskell.Prelude, Language.Stochaskell
zip3Language.Stochaskell.Prelude, Language.Stochaskell
zip4Language.Stochaskell.Prelude, Language.Stochaskell
zip5Language.Stochaskell.Prelude, Language.Stochaskell
zip6Language.Stochaskell.Prelude, Language.Stochaskell
zip7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWith3Language.Stochaskell.Prelude, Language.Stochaskell
zipWith4Language.Stochaskell.Prelude, Language.Stochaskell
zipWith5Language.Stochaskell.Prelude, Language.Stochaskell
zipWith6Language.Stochaskell.Prelude, Language.Stochaskell
zipWith7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithMLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWithM_Language.Stochaskell.Prelude, Language.Stochaskell
zLabelLanguage.Stochaskell.Plot
ZMatLanguage.Stochaskell
zMaxLanguage.Stochaskell.Plot
zMinLanguage.Stochaskell.Plot
ZoomLanguage.Stochaskell.Plot
zoomLanguage.Stochaskell.Plot
ZoomedLanguage.Stochaskell.Plot
ZVecLanguage.Stochaskell
\\Language.Stochaskell.Prelude, Language.Stochaskell
^Language.Stochaskell.Prelude, Language.Stochaskell
^#Language.Stochaskell.Plot
^.Language.Stochaskell.Plot
^..Language.Stochaskell.Plot
^=Language.Stochaskell.Plot
^?Language.Stochaskell.Plot
^?!Language.Stochaskell.Plot
^@.Language.Stochaskell.Plot
^@..Language.Stochaskell.Plot
^@?Language.Stochaskell.Plot
^@?!Language.Stochaskell.Plot
^^Language.Stochaskell.Prelude, Language.Stochaskell
^^=Language.Stochaskell.Plot
^^~Language.Stochaskell.Plot
^~Language.Stochaskell.Plot
_1Language.Stochaskell.Plot
_1'Language.Stochaskell.Plot
_10Language.Stochaskell.Plot
_10'Language.Stochaskell.Plot
_11Language.Stochaskell.Plot
_11'Language.Stochaskell.Plot
_12Language.Stochaskell.Plot
_12'Language.Stochaskell.Plot
_13Language.Stochaskell.Plot
_13'Language.Stochaskell.Plot
_14Language.Stochaskell.Plot
_14'Language.Stochaskell.Plot
_15Language.Stochaskell.Plot
_15'Language.Stochaskell.Plot
_16Language.Stochaskell.Plot
_16'Language.Stochaskell.Plot
_17Language.Stochaskell.Plot
_17'Language.Stochaskell.Plot
_18Language.Stochaskell.Plot
_18'Language.Stochaskell.Plot
_19Language.Stochaskell.Plot
_19'Language.Stochaskell.Plot
_2Language.Stochaskell.Plot
_2'Language.Stochaskell.Plot
_3Language.Stochaskell.Plot
_3'Language.Stochaskell.Plot
_4Language.Stochaskell.Plot
_4'Language.Stochaskell.Plot
_5Language.Stochaskell.Plot
_5'Language.Stochaskell.Plot
_6Language.Stochaskell.Plot
_6'Language.Stochaskell.Plot
_7Language.Stochaskell.Plot
_7'Language.Stochaskell.Plot
_8Language.Stochaskell.Plot
_8'Language.Stochaskell.Plot
_9Language.Stochaskell.Plot
_9'Language.Stochaskell.Plot
_area_spots_4d_linethickLanguage.Stochaskell.Plot
_area_spots_4d_max_radiusLanguage.Stochaskell.Plot
_area_spots_4d_opacityLanguage.Stochaskell.Plot
_area_spots_4d_paletteLanguage.Stochaskell.Plot
_area_spots_4d_titleLanguage.Stochaskell.Plot
_area_spots_4d_valuesLanguage.Stochaskell.Plot
_area_spots_fillcolourLanguage.Stochaskell.Plot
_area_spots_linecolourLanguage.Stochaskell.Plot
_area_spots_linethickLanguage.Stochaskell.Plot
_area_spots_max_radiusLanguage.Stochaskell.Plot
_area_spots_opacityLanguage.Stochaskell.Plot
_area_spots_titleLanguage.Stochaskell.Plot
_area_spots_valuesLanguage.Stochaskell.Plot
_axis_gridLanguage.Stochaskell.Plot
_axis_grid_styleLanguage.Stochaskell.Plot
_axis_labelsLanguage.Stochaskell.Plot
_axis_label_gapLanguage.Stochaskell.Plot
_axis_label_styleLanguage.Stochaskell.Plot
_axis_line_styleLanguage.Stochaskell.Plot
_axis_show_labelsLanguage.Stochaskell.Plot
_axis_show_lineLanguage.Stochaskell.Plot
_axis_show_ticksLanguage.Stochaskell.Plot
_axis_ticksLanguage.Stochaskell.Plot
_axis_tropweivLanguage.Stochaskell.Plot
_axis_viewportLanguage.Stochaskell.Plot
_axis_visibilityLanguage.Stochaskell.Plot
_azimuthLanguage.Stochaskell.Plot
_ConsLanguage.Stochaskell.Plot
_DynamicPlotLanguage.Stochaskell.Plot
_EmptyLanguage.Stochaskell.Plot
_fill_colorLanguage.Stochaskell.Plot
_font_colorLanguage.Stochaskell.Plot
_font_nameLanguage.Stochaskell.Plot
_font_sizeLanguage.Stochaskell.Plot
_font_slantLanguage.Stochaskell.Plot
_font_weightLanguage.Stochaskell.Plot
_GWrapped'Language.Stochaskell.Plot
_headLanguage.Stochaskell.Plot
_initLanguage.Stochaskell.Plot
_JustLanguage.Stochaskell.Plot
_lastLanguage.Stochaskell.Plot
_laxis_generateLanguage.Stochaskell.Plot
_laxis_overrideLanguage.Stochaskell.Plot
_laxis_reverseLanguage.Stochaskell.Plot
_laxis_styleLanguage.Stochaskell.Plot
_laxis_titleLanguage.Stochaskell.Plot
_laxis_title_styleLanguage.Stochaskell.Plot
_layoutlr_backgroundLanguage.Stochaskell.Plot
_layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_grid_lastLanguage.Stochaskell.Plot
_layoutlr_left_axisLanguage.Stochaskell.Plot
_layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_legendLanguage.Stochaskell.Plot
_layoutlr_marginLanguage.Stochaskell.Plot
_layoutlr_plotsLanguage.Stochaskell.Plot
_layoutlr_plot_backgroundLanguage.Stochaskell.Plot
_layoutlr_right_axisLanguage.Stochaskell.Plot
_layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_titleLanguage.Stochaskell.Plot
_layoutlr_title_styleLanguage.Stochaskell.Plot
_layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
_layoutlr_x_axisLanguage.Stochaskell.Plot
_layout_backgroundLanguage.Stochaskell.Plot
_layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
_layout_grid_lastLanguage.Stochaskell.Plot
_layout_left_axis_visibilityLanguage.Stochaskell.Plot
_layout_legendLanguage.Stochaskell.Plot
_layout_marginLanguage.Stochaskell.Plot
_layout_plotsLanguage.Stochaskell.Plot
_layout_plot_backgroundLanguage.Stochaskell.Plot
_layout_right_axis_visibilityLanguage.Stochaskell.Plot
_layout_titleLanguage.Stochaskell.Plot
_layout_title_styleLanguage.Stochaskell.Plot
_layout_top_axis_visibilityLanguage.Stochaskell.Plot
_layout_x_axisLanguage.Stochaskell.Plot
_layout_y_axisLanguage.Stochaskell.Plot
_la_labelfLanguage.Stochaskell.Plot
_la_nLabelsLanguage.Stochaskell.Plot
_la_nTicksLanguage.Stochaskell.Plot
_LeftLanguage.Stochaskell.Plot
_legend_label_styleLanguage.Stochaskell.Plot
_legend_marginLanguage.Stochaskell.Plot
_legend_orientationLanguage.Stochaskell.Plot
_legend_plot_sizeLanguage.Stochaskell.Plot
_legend_positionLanguage.Stochaskell.Plot
_line_capLanguage.Stochaskell.Plot
_line_colorLanguage.Stochaskell.Plot
_line_dashesLanguage.Stochaskell.Plot
_line_joinLanguage.Stochaskell.Plot
_line_widthLanguage.Stochaskell.Plot
_loga_labelfLanguage.Stochaskell.Plot
_NothingLanguage.Stochaskell.Plot
_pie_backgroundLanguage.Stochaskell.Plot
_pie_colorsLanguage.Stochaskell.Plot
_pie_dataLanguage.Stochaskell.Plot
_pie_label_line_styleLanguage.Stochaskell.Plot
_pie_label_styleLanguage.Stochaskell.Plot
_pie_marginLanguage.Stochaskell.Plot
_pie_plotLanguage.Stochaskell.Plot
_pie_start_angleLanguage.Stochaskell.Plot
_pie_titleLanguage.Stochaskell.Plot
_pie_title_styleLanguage.Stochaskell.Plot
_pitem_labelLanguage.Stochaskell.Plot
_pitem_offsetLanguage.Stochaskell.Plot
_pitem_valueLanguage.Stochaskell.Plot
_plot_all_pointsLanguage.Stochaskell.Plot
_plot_annotation_angleLanguage.Stochaskell.Plot
_plot_annotation_backgroundLanguage.Stochaskell.Plot
_plot_annotation_hanchorLanguage.Stochaskell.Plot
_plot_annotation_styleLanguage.Stochaskell.Plot
_plot_annotation_valuesLanguage.Stochaskell.Plot
_plot_annotation_vanchorLanguage.Stochaskell.Plot
_plot_bars_alignmentLanguage.Stochaskell.Plot
_plot_bars_item_stylesLanguage.Stochaskell.Plot
_plot_bars_referenceLanguage.Stochaskell.Plot
_plot_bars_singleton_widthLanguage.Stochaskell.Plot
_plot_bars_spacingLanguage.Stochaskell.Plot
_plot_bars_styleLanguage.Stochaskell.Plot
_plot_bars_titlesLanguage.Stochaskell.Plot
_plot_bars_valuesLanguage.Stochaskell.Plot
_plot_candle_centreLanguage.Stochaskell.Plot
_plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
_plot_candle_fillLanguage.Stochaskell.Plot
_plot_candle_line_styleLanguage.Stochaskell.Plot
_plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
_plot_candle_tick_lengthLanguage.Stochaskell.Plot
_plot_candle_titleLanguage.Stochaskell.Plot
_plot_candle_valuesLanguage.Stochaskell.Plot
_plot_candle_widthLanguage.Stochaskell.Plot
_plot_errbars_line_styleLanguage.Stochaskell.Plot
_plot_errbars_overhangLanguage.Stochaskell.Plot
_plot_errbars_tick_lengthLanguage.Stochaskell.Plot
_plot_errbars_titleLanguage.Stochaskell.Plot
_plot_errbars_valuesLanguage.Stochaskell.Plot
_plot_fillbetween_styleLanguage.Stochaskell.Plot
_plot_fillbetween_titleLanguage.Stochaskell.Plot
_plot_fillbetween_valuesLanguage.Stochaskell.Plot
_plot_hidden_x_valuesLanguage.Stochaskell.Plot
_plot_hidden_y_valuesLanguage.Stochaskell.Plot
_plot_hist_binsLanguage.Stochaskell.Plot
_plot_hist_drop_linesLanguage.Stochaskell.Plot
_plot_hist_fill_styleLanguage.Stochaskell.Plot
_plot_hist_line_styleLanguage.Stochaskell.Plot
_plot_hist_norm_funcLanguage.Stochaskell.Plot
_plot_hist_no_zerosLanguage.Stochaskell.Plot
_plot_hist_rangeLanguage.Stochaskell.Plot
_plot_hist_titleLanguage.Stochaskell.Plot
_plot_hist_valuesLanguage.Stochaskell.Plot
_plot_legendLanguage.Stochaskell.Plot
_plot_lines_limit_valuesLanguage.Stochaskell.Plot
_plot_lines_styleLanguage.Stochaskell.Plot
_plot_lines_titleLanguage.Stochaskell.Plot
_plot_lines_valuesLanguage.Stochaskell.Plot
_plot_points_styleLanguage.Stochaskell.Plot
_plot_points_titleLanguage.Stochaskell.Plot
_plot_points_valuesLanguage.Stochaskell.Plot
_plot_renderLanguage.Stochaskell.Plot
_plot_vectors_gridLanguage.Stochaskell.Plot
_plot_vectors_mapfLanguage.Stochaskell.Plot
_plot_vectors_scaleLanguage.Stochaskell.Plot
_plot_vectors_styleLanguage.Stochaskell.Plot
_plot_vectors_titleLanguage.Stochaskell.Plot
_plot_vectors_valuesLanguage.Stochaskell.Plot
_point_border_colorLanguage.Stochaskell.Plot
_point_border_widthLanguage.Stochaskell.Plot
_point_colorLanguage.Stochaskell.Plot
_point_radiusLanguage.Stochaskell.Plot
_point_shapeLanguage.Stochaskell.Plot
_polarLanguage.Stochaskell.Plot
_rLanguage.Stochaskell.Plot
_radialLanguage.Stochaskell.Plot
_rect_cornerStyleLanguage.Stochaskell.Plot
_rect_fillStyleLanguage.Stochaskell.Plot
_rect_lineStyleLanguage.Stochaskell.Plot
_rect_minsizeLanguage.Stochaskell.Plot
_RightLanguage.Stochaskell.Plot
_ShowLanguage.Stochaskell.Plot
_slayouts_compress_legendLanguage.Stochaskell.Plot
_slayouts_layoutsLanguage.Stochaskell.Plot
_SnocLanguage.Stochaskell.Plot
_specBoundsLanguage.Stochaskell.Plot
_specColourMapLanguage.Stochaskell.Plot
_specScaleLanguage.Stochaskell.Plot
_specTransLanguage.Stochaskell.Plot
_tailLanguage.Stochaskell.Plot
_UnwrappedLanguage.Stochaskell.Plot
_Unwrapped'Language.Stochaskell.Plot
_UnwrappingLanguage.Stochaskell.Plot
_Unwrapping'Language.Stochaskell.Plot
_vector_head_styleLanguage.Stochaskell.Plot
_vector_line_styleLanguage.Stochaskell.Plot
_VoidLanguage.Stochaskell.Plot
_WrappedLanguage.Stochaskell.Plot
_Wrapped'Language.Stochaskell.Plot
_WrappingLanguage.Stochaskell.Plot
_Wrapping'Language.Stochaskell.Plot
|>Language.Stochaskell.Plot
||Language.Stochaskell.Prelude, Language.Stochaskell
||*Language.Stochaskell.Prelude, Language.Stochaskell
||=Language.Stochaskell.Plot
||~Language.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-B.html b/docs/doc/doc-index-B.html index 3d37f92..0ecfb0d 100644 --- a/docs/doc/doc-index-B.html +++ b/docs/doc/doc-index-B.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - B)

stochaskell-0.1.0: A probabilistic programming language

Index - B

BLanguage.Stochaskell
BackendProgramLanguage.Stochaskell.Plot
backwardsLanguage.Stochaskell.Plot
BarLayoutLanguage.Stochaskell.Plot
barLayoutLanguage.Stochaskell.Plot
BarPlotLanguage.Stochaskell.Plot
barPlotLanguage.Stochaskell.Plot
barPlot'Language.Stochaskell.Plot
barsLanguage.Stochaskell.Plot
barsAddLanguage.Stochaskell.Plot
BarsCenteredLanguage.Stochaskell.Plot
BarsClusteredLanguage.Stochaskell.Plot
BarsFixGapLanguage.Stochaskell.Plot
BarsFixWidthLanguage.Stochaskell.Plot
BarsLeftLanguage.Stochaskell.Plot
barSpacingLanguage.Stochaskell.Plot
BarsPlotValueLanguage.Stochaskell.Plot
barsReferenceLanguage.Stochaskell.Plot
BarsRightLanguage.Stochaskell.Plot
BarsStackedLanguage.Stochaskell.Plot
barStartLanguage.Stochaskell.Plot
barWidthLanguage.Stochaskell.Plot
BaseSpaceLanguage.Stochaskell.Plot
Bazaar 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Bazaar'Language.Stochaskell.Plot
Bazaar1 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Bazaar1'Language.Stochaskell.Plot
beigeLanguage.Stochaskell.Plot
belowLanguage.Stochaskell.Plot
BernoulliLanguage.Stochaskell
bernoulliLanguage.Stochaskell
bernoulliLogitLanguage.Stochaskell
bernoulliLogitsLanguage.Stochaskell
BernoullisLanguage.Stochaskell
bernoullisLanguage.Stochaskell
besideLanguage.Stochaskell.Plot
besideNLanguage.Stochaskell.Plot
besideTallLanguage.Stochaskell.Plot
BetaLanguage.Stochaskell
betaLanguage.Stochaskell
BetweenTicksLanguage.Stochaskell.Plot
BifunctorLanguage.Stochaskell.Plot
bimapLanguage.Stochaskell.Plot
bimappingLanguage.Stochaskell.Plot
binarizeLanguage.Stochaskell
binRangeLanguage.Stochaskell.Plot
bisqueLanguage.Stochaskell.Plot
bitmapAlignmentFnsLanguage.Stochaskell.Plot
blackLanguage.Stochaskell.Plot
blackAndWhiteLanguage.Stochaskell.Plot
blanchedalmondLanguage.Stochaskell.Plot
blendLanguage.Stochaskell.Plot
blockMatrixLanguage.Stochaskell
blockVectorLanguage.Stochaskell
blueLanguage.Stochaskell.Plot
bluevioletLanguage.Stochaskell.Plot
BMatLanguage.Stochaskell
BoolLanguage.Stochaskell.Prelude, Language.Stochaskell
BooleanLanguage.Stochaskell.Prelude, Language.Stochaskell
booleanLanguage.Stochaskell
BooleanOfLanguage.Stochaskell.Prelude, Language.Stochaskell
boolTLanguage.Stochaskell.Expression
bothLanguage.Stochaskell.Plot
both1Language.Stochaskell.Plot
bothTicksLanguage.Stochaskell.Plot
bottomLanguage.Stochaskell.Plot
bottomLeftLanguage.Stochaskell.Plot
bottomRightLanguage.Stochaskell.Plot
BoundedLanguage.Stochaskell.Prelude, Language.Stochaskell
boundMaxLanguage.Stochaskell.Plot
boundMinLanguage.Stochaskell.Plot
boundsLanguage.Stochaskell
breakLanguage.Stochaskell.Prelude, Language.Stochaskell
breakListLanguage.Stochaskell
brownLanguage.Stochaskell.Plot
BubbleOptionsLanguage.Stochaskell.Plot
bubbleOptionsLanguage.Stochaskell.Plot
bubblePlotLanguage.Stochaskell.Plot
bubblePlot'Language.Stochaskell.Plot
bubblePlotOfLanguage.Stochaskell.Plot
bubblePlotOf'Language.Stochaskell.Plot
bubbleStyleLanguage.Stochaskell.Plot
bubbleTransformLanguage.Stochaskell.Plot
buildPlotsLanguage.Stochaskell.Plot
burlywoodLanguage.Stochaskell.Plot
BVecLanguage.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - B)

stochaskell-1.0.0: A probabilistic programming language

Index - B

BLanguage.Stochaskell
BackendProgramLanguage.Stochaskell.Plot
backwardsLanguage.Stochaskell.Plot
BarLayoutLanguage.Stochaskell.Plot
barLayoutLanguage.Stochaskell.Plot
BarPlotLanguage.Stochaskell.Plot
barPlotLanguage.Stochaskell.Plot
barPlot'Language.Stochaskell.Plot
barsLanguage.Stochaskell.Plot
barsAddLanguage.Stochaskell.Plot
BarsCenteredLanguage.Stochaskell.Plot
BarsClusteredLanguage.Stochaskell.Plot
BarsFixGapLanguage.Stochaskell.Plot
BarsFixWidthLanguage.Stochaskell.Plot
BarsLeftLanguage.Stochaskell.Plot
barSpacingLanguage.Stochaskell.Plot
BarsPlotValueLanguage.Stochaskell.Plot
barsReferenceLanguage.Stochaskell.Plot
BarsRightLanguage.Stochaskell.Plot
BarsStackedLanguage.Stochaskell.Plot
barStartLanguage.Stochaskell.Plot
barWidthLanguage.Stochaskell.Plot
BaseSpaceLanguage.Stochaskell.Plot
Bazaar 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Bazaar'Language.Stochaskell.Plot
Bazaar1 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Bazaar1'Language.Stochaskell.Plot
beigeLanguage.Stochaskell.Plot
belowLanguage.Stochaskell.Plot
BernoulliLanguage.Stochaskell
bernoulliLanguage.Stochaskell
bernoulliLogitLanguage.Stochaskell
bernoulliLogitsLanguage.Stochaskell
BernoullisLanguage.Stochaskell
bernoullisLanguage.Stochaskell
besideLanguage.Stochaskell.Plot
besideNLanguage.Stochaskell.Plot
besideTallLanguage.Stochaskell.Plot
BetaLanguage.Stochaskell
betaLanguage.Stochaskell
BetweenTicksLanguage.Stochaskell.Plot
BifunctorLanguage.Stochaskell.Plot
bimapLanguage.Stochaskell.Plot
bimappingLanguage.Stochaskell.Plot
binarizeLanguage.Stochaskell
binRangeLanguage.Stochaskell.Plot
bisqueLanguage.Stochaskell.Plot
bitmapAlignmentFnsLanguage.Stochaskell.Plot
blackLanguage.Stochaskell.Plot
blackAndWhiteLanguage.Stochaskell.Plot
blanchedalmondLanguage.Stochaskell.Plot
blendLanguage.Stochaskell.Plot
blockMatrixLanguage.Stochaskell
blockVectorLanguage.Stochaskell
blueLanguage.Stochaskell.Plot
bluevioletLanguage.Stochaskell.Plot
BMatLanguage.Stochaskell
BoolLanguage.Stochaskell.Prelude, Language.Stochaskell
BooleanLanguage.Stochaskell.Prelude, Language.Stochaskell
booleanLanguage.Stochaskell
BooleanOfLanguage.Stochaskell.Prelude, Language.Stochaskell
boolTLanguage.Stochaskell.Expression
bothLanguage.Stochaskell.Plot
both1Language.Stochaskell.Plot
bothTicksLanguage.Stochaskell.Plot
bottomLanguage.Stochaskell.Plot
bottomLeftLanguage.Stochaskell.Plot
bottomRightLanguage.Stochaskell.Plot
BoundedLanguage.Stochaskell.Prelude, Language.Stochaskell
boundMaxLanguage.Stochaskell.Plot
boundMinLanguage.Stochaskell.Plot
boundsLanguage.Stochaskell
breakLanguage.Stochaskell.Prelude, Language.Stochaskell
breakListLanguage.Stochaskell
brownLanguage.Stochaskell.Plot
BubbleOptionsLanguage.Stochaskell.Plot
bubbleOptionsLanguage.Stochaskell.Plot
bubblePlotLanguage.Stochaskell.Plot
bubblePlot'Language.Stochaskell.Plot
bubblePlotOfLanguage.Stochaskell.Plot
bubblePlotOf'Language.Stochaskell.Plot
bubbleStyleLanguage.Stochaskell.Plot
bubbleTransformLanguage.Stochaskell.Plot
buildPlotsLanguage.Stochaskell.Plot
burlywoodLanguage.Stochaskell.Plot
BVecLanguage.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-C.html b/docs/doc/doc-index-C.html index 2a9956c..3d7801d 100644 --- a/docs/doc/doc-index-C.html +++ b/docs/doc/doc-index-C.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - C)

stochaskell-0.1.0: A probabilistic programming language

Index - C

cadetblueLanguage.Stochaskell.Plot
calculateBoundsLanguage.Stochaskell.Plot
calculateScalingLanguage.Stochaskell.Plot
camelCaseFieldsLanguage.Stochaskell.Plot
camelCaseNamerLanguage.Stochaskell.Plot
Candle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
candle_closeLanguage.Stochaskell.Plot
candle_highLanguage.Stochaskell.Plot
candle_lowLanguage.Stochaskell.Plot
candle_midLanguage.Stochaskell.Plot
candle_openLanguage.Stochaskell.Plot
candle_xLanguage.Stochaskell.Plot
caseBLanguage.Stochaskell.Prelude, Language.Stochaskell
CastLanguage.Stochaskell
castLanguage.Stochaskell
catMaybesLanguage.Stochaskell.Prelude, Language.Stochaskell
CauchyLanguage.Stochaskell
cauchyLanguage.Stochaskell
cdfLanguage.Stochaskell.Plot
ceilingLanguage.Stochaskell.Prelude, Language.Stochaskell
censoringLanguage.Stochaskell.Plot
centerTicksLanguage.Stochaskell.Plot
centreTicksLanguage.Stochaskell.Plot
chainLanguage.Stochaskell
chain'Language.Stochaskell
chainRangeLanguage.Stochaskell
chainRange'Language.Stochaskell
ChangeHorizontalLimitsLanguage.Stochaskell.Plot
ChangeVerticalLimitsLanguage.Stochaskell.Plot
CharLanguage.Stochaskell.Prelude, Language.Stochaskell
chartreuseLanguage.Stochaskell.Plot
childrenLanguage.Stochaskell.Plot
chocolateLanguage.Stochaskell.Plot
ChoiceLanguage.Stochaskell.Plot
cholLanguage.Stochaskell
choosingLanguage.Stochaskell.Plot
chosenLanguage.Stochaskell.Plot
CircleLanguage.Stochaskell.Plot
classUnderscoreNoPrefixFieldsLanguage.Stochaskell.Plot
classUnderscoreNoPrefixNamerLanguage.Stochaskell.Plot
ClassyNamerLanguage.Stochaskell.Plot
classyRulesLanguage.Stochaskell.Plot
classyRules_Language.Stochaskell.Plot
clipPlotLanguage.Stochaskell.Plot
cloneIndexedLensLanguage.Stochaskell.Plot
cloneIndexedSetterLanguage.Stochaskell.Plot
cloneIndexedTraversalLanguage.Stochaskell.Plot
cloneIndexedTraversal1Language.Stochaskell.Plot
cloneIndexPreservingLensLanguage.Stochaskell.Plot
cloneIndexPreservingSetterLanguage.Stochaskell.Plot
cloneIndexPreservingTraversalLanguage.Stochaskell.Plot
cloneIndexPreservingTraversal1Language.Stochaskell.Plot
cloneIsoLanguage.Stochaskell.Plot
cloneLensLanguage.Stochaskell.Plot
clonePrismLanguage.Stochaskell.Plot
cloneSetterLanguage.Stochaskell.Plot
cloneTraversalLanguage.Stochaskell.Plot
cloneTraversal1Language.Stochaskell.Plot
CloseLanguage.Stochaskell.Plot
closeLanguage.Stochaskell.Plot
cmTraverseLanguage.Stochaskell.Plot
coercedLanguage.Stochaskell.Plot
colorsLanguage.Stochaskell.Plot
ColourLanguage.Stochaskell.Plot
ColourBarLanguage.Stochaskell.Plot
colourBarLanguage.Stochaskell.Plot
colourBarDrawLanguage.Stochaskell.Plot
colourBarGapLanguage.Stochaskell.Plot
colourBarLengthFunctionLanguage.Stochaskell.Plot
colourBarRangeLanguage.Stochaskell.Plot
colourBarStyleLanguage.Stochaskell.Plot
colourBarWidthLanguage.Stochaskell.Plot
colourConvertLanguage.Stochaskell.Plot
colourListLanguage.Stochaskell.Plot
ColourMapLanguage.Stochaskell.Plot
colourMapLanguage.Stochaskell.Plot
ColourOpsLanguage.Stochaskell.Plot
colours1Language.Stochaskell.Plot
colours2Language.Stochaskell.Plot
compareLanguage.Stochaskell.Prelude, Language.Stochaskell
compileCCLanguage.Stochaskell
composOpFoldLanguage.Stochaskell.Plot
computedHistogramLanguage.Stochaskell.Plot
concatLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapOfLanguage.Stochaskell.Plot
concatOfLanguage.Stochaskell.Plot
condLanguage.Stochaskell.Prelude, Language.Stochaskell
ConditionOfLanguage.Stochaskell.Prelude, Language.Stochaskell
confusingLanguage.Stochaskell.Plot
ConjoinedLanguage.Stochaskell.Plot
conjoinedLanguage.Stochaskell.Plot
connectingLineLanguage.Stochaskell.Plot
ConsLanguage.Stochaskell.Plot
consLanguage.Stochaskell.Plot
Const 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
constLanguage.Stochaskell.Prelude, Language.Stochaskell
constExprLanguage.Stochaskell.Expression
constructLanguage.Stochaskell.Expression
ConstructorLanguage.Stochaskell.Expression
constSymbolLanguage.Stochaskell
ConstValLanguage.Stochaskell.Expression
constValLanguage.Stochaskell.Expression
ContainsLanguage.Stochaskell.Plot
contains 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell
Context 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Context'Language.Stochaskell.Plot
contextsLanguage.Stochaskell.Plot
contextsOfLanguage.Stochaskell.Plot
contextsOnLanguage.Stochaskell.Plot
contextsOnOfLanguage.Stochaskell.Plot
contramapLanguage.Stochaskell.Plot
contramappedLanguage.Stochaskell.Plot
contramappingLanguage.Stochaskell.Plot
ContravariantLanguage.Stochaskell.Plot
coralLanguage.Stochaskell.Plot
cornflowerblueLanguage.Stochaskell.Plot
cornsilkLanguage.Stochaskell.Plot
corrLKJLanguage.Stochaskell
cosLanguage.Stochaskell.Prelude, Language.Stochaskell
coshLanguage.Stochaskell.Prelude, Language.Stochaskell
cosmosLanguage.Stochaskell.Plot
cosmosOfLanguage.Stochaskell.Plot
cosmosOnLanguage.Stochaskell.Plot
cosmosOnOfLanguage.Stochaskell.Plot
countLanguage.Stochaskell.Plot
countDensityLanguage.Stochaskell.Plot
countElemLanguage.Stochaskell
createClassLanguage.Stochaskell.Plot
crimsonLanguage.Stochaskell.Plot
cropLanguage.Stochaskell.Prelude, Language.Stochaskell
crossShapeLanguage.Stochaskell.Plot
CStateLanguage.Stochaskell.Plot
cumilativeLanguage.Stochaskell.Plot
currentPlotsLanguage.Stochaskell.Plot
curriedLanguage.Stochaskell.Plot
curryLanguage.Stochaskell.Prelude, Language.Stochaskell
CustomLegendPicLanguage.Stochaskell.Plot
cyanLanguage.Stochaskell.Plot
cycleLanguage.Stochaskell.Prelude, Language.Stochaskell
cycledLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - C)

stochaskell-1.0.0: A probabilistic programming language

Index - C

cadetblueLanguage.Stochaskell.Plot
calculateBoundsLanguage.Stochaskell.Plot
calculateScalingLanguage.Stochaskell.Plot
camelCaseFieldsLanguage.Stochaskell.Plot
camelCaseNamerLanguage.Stochaskell.Plot
Candle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
candle_closeLanguage.Stochaskell.Plot
candle_highLanguage.Stochaskell.Plot
candle_lowLanguage.Stochaskell.Plot
candle_midLanguage.Stochaskell.Plot
candle_openLanguage.Stochaskell.Plot
candle_xLanguage.Stochaskell.Plot
caseBLanguage.Stochaskell.Prelude, Language.Stochaskell
caseZLanguage.Stochaskell
CastLanguage.Stochaskell
castLanguage.Stochaskell
catMaybesLanguage.Stochaskell.Prelude, Language.Stochaskell
CauchyLanguage.Stochaskell
cauchyLanguage.Stochaskell
cdfLanguage.Stochaskell.Plot
ceilingLanguage.Stochaskell.Prelude, Language.Stochaskell
censoringLanguage.Stochaskell.Plot
centerTicksLanguage.Stochaskell.Plot
centreTicksLanguage.Stochaskell.Plot
chainLanguage.Stochaskell
chain'Language.Stochaskell
chainRangeLanguage.Stochaskell
chainRange'Language.Stochaskell
ChangeHorizontalLimitsLanguage.Stochaskell.Plot
ChangeVerticalLimitsLanguage.Stochaskell.Plot
CharLanguage.Stochaskell.Prelude, Language.Stochaskell
chartreuseLanguage.Stochaskell.Plot
childrenLanguage.Stochaskell.Plot
chocolateLanguage.Stochaskell.Plot
ChoiceLanguage.Stochaskell.Plot
cholLanguage.Stochaskell
choosingLanguage.Stochaskell.Plot
chosenLanguage.Stochaskell.Plot
CircleLanguage.Stochaskell.Plot
classUnderscoreNoPrefixFieldsLanguage.Stochaskell.Plot
classUnderscoreNoPrefixNamerLanguage.Stochaskell.Plot
ClassyNamerLanguage.Stochaskell.Plot
classyRulesLanguage.Stochaskell.Plot
classyRules_Language.Stochaskell.Plot
clipPlotLanguage.Stochaskell.Plot
cloneIndexedLensLanguage.Stochaskell.Plot
cloneIndexedSetterLanguage.Stochaskell.Plot
cloneIndexedTraversalLanguage.Stochaskell.Plot
cloneIndexedTraversal1Language.Stochaskell.Plot
cloneIndexPreservingLensLanguage.Stochaskell.Plot
cloneIndexPreservingSetterLanguage.Stochaskell.Plot
cloneIndexPreservingTraversalLanguage.Stochaskell.Plot
cloneIndexPreservingTraversal1Language.Stochaskell.Plot
cloneIsoLanguage.Stochaskell.Plot
cloneLensLanguage.Stochaskell.Plot
clonePrismLanguage.Stochaskell.Plot
cloneSetterLanguage.Stochaskell.Plot
cloneTraversalLanguage.Stochaskell.Plot
cloneTraversal1Language.Stochaskell.Plot
CloseLanguage.Stochaskell.Plot
closeLanguage.Stochaskell.Plot
cmTraverseLanguage.Stochaskell.Plot
coercedLanguage.Stochaskell.Plot
colorsLanguage.Stochaskell.Plot
ColourLanguage.Stochaskell.Plot
ColourBarLanguage.Stochaskell.Plot
colourBarLanguage.Stochaskell.Plot
colourBarDrawLanguage.Stochaskell.Plot
colourBarGapLanguage.Stochaskell.Plot
colourBarLengthFunctionLanguage.Stochaskell.Plot
colourBarRangeLanguage.Stochaskell.Plot
colourBarStyleLanguage.Stochaskell.Plot
colourBarWidthLanguage.Stochaskell.Plot
colourConvertLanguage.Stochaskell.Plot
colourListLanguage.Stochaskell.Plot
ColourMapLanguage.Stochaskell.Plot
colourMapLanguage.Stochaskell.Plot
ColourOpsLanguage.Stochaskell.Plot
colours1Language.Stochaskell.Plot
colours2Language.Stochaskell.Plot
compareLanguage.Stochaskell.Prelude, Language.Stochaskell
compileCCLanguage.Stochaskell
composOpFoldLanguage.Stochaskell.Plot
computedHistogramLanguage.Stochaskell.Plot
concatLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapLanguage.Stochaskell.Prelude, Language.Stochaskell
concatMapOfLanguage.Stochaskell.Plot
concatOfLanguage.Stochaskell.Plot
condLanguage.Stochaskell.Prelude, Language.Stochaskell
ConditionOfLanguage.Stochaskell.Prelude, Language.Stochaskell
confusingLanguage.Stochaskell.Plot
ConjoinedLanguage.Stochaskell.Plot
conjoinedLanguage.Stochaskell.Plot
connectingLineLanguage.Stochaskell.Plot
ConsLanguage.Stochaskell.Plot
consLanguage.Stochaskell.Plot
Const 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
constLanguage.Stochaskell.Prelude, Language.Stochaskell
constExprLanguage.Stochaskell.Expression
constructLanguage.Stochaskell.Expression
ConstructorLanguage.Stochaskell.Expression
constSymbolLanguage.Stochaskell
ConstValLanguage.Stochaskell.Expression
constValLanguage.Stochaskell.Expression
ContainsLanguage.Stochaskell.Plot
contains 
1 (Function)Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
Context 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Context'Language.Stochaskell.Plot
contextsLanguage.Stochaskell.Plot
contextsOfLanguage.Stochaskell.Plot
contextsOnLanguage.Stochaskell.Plot
contextsOnOfLanguage.Stochaskell.Plot
contramapLanguage.Stochaskell.Plot
contramappedLanguage.Stochaskell.Plot
contramappingLanguage.Stochaskell.Plot
ContravariantLanguage.Stochaskell.Plot
coralLanguage.Stochaskell.Plot
cornflowerblueLanguage.Stochaskell.Plot
cornsilkLanguage.Stochaskell.Plot
corrLKJLanguage.Stochaskell
cosLanguage.Stochaskell.Prelude, Language.Stochaskell
coshLanguage.Stochaskell.Prelude, Language.Stochaskell
cosmosLanguage.Stochaskell.Plot
cosmosOfLanguage.Stochaskell.Plot
cosmosOnLanguage.Stochaskell.Plot
cosmosOnOfLanguage.Stochaskell.Plot
countLanguage.Stochaskell.Plot
countDensityLanguage.Stochaskell.Plot
countElemLanguage.Stochaskell
createClassLanguage.Stochaskell.Plot
crimsonLanguage.Stochaskell.Plot
cropLanguage.Stochaskell.Prelude, Language.Stochaskell
crossShapeLanguage.Stochaskell.Plot
CStateLanguage.Stochaskell.Plot
cumilativeLanguage.Stochaskell.Plot
currentPlotsLanguage.Stochaskell.Plot
curriedLanguage.Stochaskell.Plot
curryLanguage.Stochaskell.Prelude, Language.Stochaskell
CustomLegendPicLanguage.Stochaskell.Plot
cyanLanguage.Stochaskell.Plot
cycleLanguage.Stochaskell.Prelude, Language.Stochaskell
cycledLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-D.html b/docs/doc/doc-index-D.html index 640f810..fbf402a 100644 --- a/docs/doc/doc-index-D.html +++ b/docs/doc/doc-index-D.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - D)

stochaskell-0.1.0: A probabilistic programming language

Index - D

dLanguage.Stochaskell
darkblueLanguage.Stochaskell.Plot
darkcyanLanguage.Stochaskell.Plot
darkenLanguage.Stochaskell.Plot
darkgoldenrodLanguage.Stochaskell.Plot
darkgrayLanguage.Stochaskell.Plot
darkgreenLanguage.Stochaskell.Plot
darkgreyLanguage.Stochaskell.Plot
darkkhakiLanguage.Stochaskell.Plot
darkmagentaLanguage.Stochaskell.Plot
darkolivegreenLanguage.Stochaskell.Plot
darkorangeLanguage.Stochaskell.Plot
darkorchidLanguage.Stochaskell.Plot
darkredLanguage.Stochaskell.Plot
darksalmonLanguage.Stochaskell.Plot
darkseagreenLanguage.Stochaskell.Plot
darkslateblueLanguage.Stochaskell.Plot
darkslategrayLanguage.Stochaskell.Plot
darkslategreyLanguage.Stochaskell.Plot
darkturquoiseLanguage.Stochaskell.Plot
darkvioletLanguage.Stochaskell.Plot
dashedLineLanguage.Stochaskell.Plot
daysLanguage.Stochaskell.Plot
debugLanguage.Stochaskell
declareClassyLanguage.Stochaskell.Plot
declareClassyForLanguage.Stochaskell.Plot
declareFieldsLanguage.Stochaskell.Plot
declareLensesLanguage.Stochaskell.Plot
declareLensesForLanguage.Stochaskell.Plot
declareLensesWithLanguage.Stochaskell.Plot
declarePrismsLanguage.Stochaskell.Plot
declareWrappedLanguage.Stochaskell.Plot
decodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
deconstructLanguage.Stochaskell.Expression
deepLanguage.Stochaskell.Plot
deepOfLanguage.Stochaskell.Plot
deeppinkLanguage.Stochaskell.Plot
deepskyblueLanguage.Stochaskell.Plot
defLanguage.Stochaskell.Plot
DefaultLanguage.Stochaskell.Plot
defaultAxisLineStyleLanguage.Stochaskell.Plot
defaultColorSeqLanguage.Stochaskell.Plot
defaultFieldRulesLanguage.Stochaskell.Plot
defaultFloatPlotHistLanguage.Stochaskell.Plot
defaultGridLineStyleLanguage.Stochaskell.Plot
defaultIntAxisLanguage.Stochaskell.Plot
DefaultLegendPicLanguage.Stochaskell.Plot
defaultNormedPlotHistLanguage.Stochaskell.Plot
defaultPlotHistLanguage.Stochaskell.Plot
defaultPlotLineStyleLanguage.Stochaskell.Plot
defaultPyMC3InferenceLanguage.PyMC3
defaultStanMethodLanguage.Stan
defColourBarLanguage.Stochaskell.Plot
defLegendPicLanguage.Stochaskell.Plot
DefNameLanguage.Stochaskell.Plot
deleteLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteAtLanguage.Stochaskell
deleteByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteFirstsByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteIndexLanguage.Stochaskell
delFromALLanguage.Stochaskell
designMatrixLanguage.Stochaskell
detLanguage.Stochaskell
devoidLanguage.Stochaskell.Plot
DExprLanguage.Stochaskell.Expression
diagLanguage.Stochaskell
diamondLanguage.Stochaskell.Plot
dimapLanguage.Stochaskell.Plot
dimappingLanguage.Stochaskell.Plot
dimgrayLanguage.Stochaskell.Plot
dimgreyLanguage.Stochaskell.Plot
displayLanguage.Stochaskell.Plot
dissolveLanguage.Stochaskell.Plot
distribLanguage.Stochaskell.Plot
DistributionLanguage.Stochaskell
divLanguage.Stochaskell.Prelude, Language.Stochaskell
divModLanguage.Stochaskell.Prelude, Language.Stochaskell
dodgerblueLanguage.Stochaskell.Plot
DoubleLanguage.Stochaskell.Prelude, Language.Stochaskell
doubleFromTimeValueLanguage.Stochaskell.Plot
drawLegendLanguage.Stochaskell.Plot
drawPointLanguage.Stochaskell.Plot
drawRectangleLanguage.Stochaskell.Plot
drawTextLanguage.Stochaskell.Plot
drawTextALanguage.Stochaskell.Plot
drawTextRLanguage.Stochaskell.Plot
drawTextsRLanguage.Stochaskell.Plot
drawTitleLanguage.Stochaskell.Plot
dropLanguage.Stochaskell.Prelude, Language.Stochaskell
droppingLanguage.Stochaskell.Plot
droppingWhileLanguage.Stochaskell.Plot
dropWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileEndLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileListLanguage.Stochaskell
Dual 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
DynamicPlot 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
dynamicPlotLanguage.Stochaskell.Plot
dynamicPlotModsLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - D)

stochaskell-1.0.0: A probabilistic programming language

Index - D

dLanguage.Stochaskell
darkblueLanguage.Stochaskell.Plot
darkcyanLanguage.Stochaskell.Plot
darkenLanguage.Stochaskell.Plot
darkgoldenrodLanguage.Stochaskell.Plot
darkgrayLanguage.Stochaskell.Plot
darkgreenLanguage.Stochaskell.Plot
darkgreyLanguage.Stochaskell.Plot
darkkhakiLanguage.Stochaskell.Plot
darkmagentaLanguage.Stochaskell.Plot
darkolivegreenLanguage.Stochaskell.Plot
darkorangeLanguage.Stochaskell.Plot
darkorchidLanguage.Stochaskell.Plot
darkredLanguage.Stochaskell.Plot
darksalmonLanguage.Stochaskell.Plot
darkseagreenLanguage.Stochaskell.Plot
darkslateblueLanguage.Stochaskell.Plot
darkslategrayLanguage.Stochaskell.Plot
darkslategreyLanguage.Stochaskell.Plot
darkturquoiseLanguage.Stochaskell.Plot
darkvioletLanguage.Stochaskell.Plot
dashedLineLanguage.Stochaskell.Plot
daysLanguage.Stochaskell.Plot
debugLanguage.Stochaskell
declareClassyLanguage.Stochaskell.Plot
declareClassyForLanguage.Stochaskell.Plot
declareFieldsLanguage.Stochaskell.Plot
declareLensesLanguage.Stochaskell.Plot
declareLensesForLanguage.Stochaskell.Plot
declareLensesWithLanguage.Stochaskell.Plot
declarePrismsLanguage.Stochaskell.Plot
declareWrappedLanguage.Stochaskell.Plot
decodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
deconstructLanguage.Stochaskell.Expression
deepLanguage.Stochaskell.Plot
deepOfLanguage.Stochaskell.Plot
deeppinkLanguage.Stochaskell.Plot
deepseqLanguage.Stochaskell
deepskyblueLanguage.Stochaskell.Plot
defLanguage.Stochaskell.Plot
DefaultLanguage.Stochaskell.Plot
defaultAxisLineStyleLanguage.Stochaskell.Plot
defaultColorSeqLanguage.Stochaskell.Plot
defaultFieldRulesLanguage.Stochaskell.Plot
defaultFloatPlotHistLanguage.Stochaskell.Plot
defaultGridLineStyleLanguage.Stochaskell.Plot
defaultIntAxisLanguage.Stochaskell.Plot
DefaultLegendPicLanguage.Stochaskell.Plot
defaultNormedPlotHistLanguage.Stochaskell.Plot
defaultPlotHistLanguage.Stochaskell.Plot
defaultPlotLineStyleLanguage.Stochaskell.Plot
defaultPyMC3InferenceLanguage.PyMC3
defaultStanMethodLanguage.Stan
defColourBarLanguage.Stochaskell.Plot
defLegendPicLanguage.Stochaskell.Plot
DefNameLanguage.Stochaskell.Plot
deleteLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteAtLanguage.Stochaskell
deleteByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteFirstsByLanguage.Stochaskell.Prelude, Language.Stochaskell
deleteIndexLanguage.Stochaskell
delFromALLanguage.Stochaskell
densityLanguage.Stochaskell
density'Language.Stochaskell
designMatrixLanguage.Stochaskell
detLanguage.Stochaskell
devoidLanguage.Stochaskell.Plot
DExprLanguage.Stochaskell.Expression
diagLanguage.Stochaskell
diamondLanguage.Stochaskell.Plot
dimapLanguage.Stochaskell.Plot
dimappingLanguage.Stochaskell.Plot
dimgrayLanguage.Stochaskell.Plot
dimgreyLanguage.Stochaskell.Plot
displayLanguage.Stochaskell.Plot
dissolveLanguage.Stochaskell.Plot
distribLanguage.Stochaskell.Plot
DistributionLanguage.Stochaskell
divLanguage.Stochaskell.Prelude, Language.Stochaskell
divModLanguage.Stochaskell.Prelude, Language.Stochaskell
dodgerblueLanguage.Stochaskell.Plot
dotApplyLanguage.Graphviz
dotConstLanguage.Graphviz
dotConstsLanguage.Graphviz
dotDAGLanguage.Graphviz
dotIdLanguage.Graphviz
dotNodeLanguage.Graphviz
dotNodeRefLanguage.Graphviz
dotPBlockLanguage.Graphviz
dotPNodeLanguage.Graphviz
dotPNodesLanguage.Graphviz
DoubleLanguage.Stochaskell.Prelude, Language.Stochaskell
doubleFromTimeValueLanguage.Stochaskell.Plot
drawLegendLanguage.Stochaskell.Plot
drawPointLanguage.Stochaskell.Plot
drawRectangleLanguage.Stochaskell.Plot
drawTextLanguage.Stochaskell.Plot
drawTextALanguage.Stochaskell.Plot
drawTextRLanguage.Stochaskell.Plot
drawTextsRLanguage.Stochaskell.Plot
drawTitleLanguage.Stochaskell.Plot
dropLanguage.Stochaskell.Prelude, Language.Stochaskell
droppingLanguage.Stochaskell.Plot
droppingWhileLanguage.Stochaskell.Plot
dropWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileEndLanguage.Stochaskell.Prelude, Language.Stochaskell
dropWhileListLanguage.Stochaskell
Dual 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
DynamicPlot 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
dynamicPlotLanguage.Stochaskell.Plot
dynamicPlotModsLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-E.html b/docs/doc/doc-index-E.html index 5a331bd..dd210aa 100644 --- a/docs/doc/doc-index-E.html +++ b/docs/doc/doc-index-E.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - E)

stochaskell-0.1.0: A probabilistic programming language

Index - E

EachLanguage.Stochaskell.Plot
eachLanguage.Stochaskell.Plot
ECLanguage.Stochaskell.Plot
edProgramLanguage.Edward
EEnvLanguage.Stochaskell.Expression
EitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherToMonadErrorLanguage.Stochaskell
elemLanguage.Stochaskell.Prelude, Language.Stochaskell
elementLanguage.Stochaskell.Plot
elementOfLanguage.Stochaskell.Plot
elementsLanguage.Stochaskell.Plot
elementsOfLanguage.Stochaskell.Plot
elemIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndexOfLanguage.Stochaskell.Plot
elemIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndicesOfLanguage.Stochaskell.Plot
elemOfLanguage.Stochaskell.Plot
elemRIndexLanguage.Stochaskell
embedRenderableLanguage.Stochaskell.Plot
EmptyLanguage.Stochaskell.Plot
emptyLanguage.Stochaskell.Plot
emptyGridLineFunctionLanguage.Stochaskell.Plot
emptyRenderableLanguage.Stochaskell.Plot
encodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
EndLanguage.Stochaskell.Plot
Endo 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
endswithLanguage.Stochaskell
EnumLanguage.Stochaskell.Prelude, Language.Stochaskell
enumLanguage.Stochaskell.Plot
enumFromLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenToLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromToLanguage.Stochaskell.Prelude, Language.Stochaskell
EnvLanguage.Stochaskell.Expression
ep_xLanguage.Stochaskell.Plot
ep_yLanguage.Stochaskell.Plot
EQLanguage.Stochaskell.Prelude, Language.Stochaskell
EqLanguage.Stochaskell.Prelude, Language.Stochaskell
EqBLanguage.Stochaskell.Prelude, Language.Stochaskell
EqualityLanguage.Stochaskell.Plot
Equality'Language.Stochaskell.Plot
erLanguage.Stochaskell.Plot
eraseLanguage.Stochaskell.Expression
errorLanguage.Stochaskell.Prelude, Language.Stochaskell
errorWithoutStackTraceLanguage.Stochaskell.Prelude, Language.Stochaskell
ErrPoint 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
ErrValue 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
ethetaLanguage.Stochaskell.Plot
EvalLanguage.Stochaskell.Expression
eval'Language.Stochaskell.Expression
eval_Language.Stochaskell.Expression
evenLanguage.Stochaskell.Prelude, Language.Stochaskell
ev_bestLanguage.Stochaskell.Plot
ev_highLanguage.Stochaskell.Plot
ev_lowLanguage.Stochaskell.Plot
execECLanguage.Stochaskell.Plot
exesLanguage.Stochaskell.Plot
expLanguage.Stochaskell.Prelude, Language.Stochaskell
exponentLanguage.Stochaskell.Prelude, Language.Stochaskell
ExprLanguage.Stochaskell.Expression
Expression 
1 (Type/Class)Language.Stochaskell.Expression, Language.Stochaskell
2 (Data Constructor)Language.Stochaskell.Expression
ExprTupleLanguage.Stochaskell.Expression
ExprTypeLanguage.Stochaskell.Expression
ExtendingLanguage.Stochaskell.Plot
eyeLanguage.Stochaskell
E_BottomLanguage.Stochaskell.Plot
E_LeftLanguage.Stochaskell.Plot
E_RightLanguage.Stochaskell.Plot
E_TopLanguage.Stochaskell.Plot
eθLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - E)

stochaskell-1.0.0: A probabilistic programming language

Index - E

EachLanguage.Stochaskell.Plot
eachLanguage.Stochaskell.Plot
ECLanguage.Stochaskell.Plot
edgeApplyLanguage.Graphviz
edgeDAGLanguage.Graphviz
edgeNodeLanguage.Graphviz
edgeNodeRefLanguage.Graphviz
edgeNodeRefsLanguage.Graphviz
edgePBlockLanguage.Graphviz
edgePNodeLanguage.Graphviz
edgePNodesLanguage.Graphviz
edProgramLanguage.Edward
EEnvLanguage.Stochaskell.Expression
EitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherLanguage.Stochaskell.Prelude, Language.Stochaskell
eitherToMonadErrorLanguage.Stochaskell
elemLanguage.Stochaskell.Prelude, Language.Stochaskell
elementLanguage.Stochaskell.Plot
elementOfLanguage.Stochaskell.Plot
elementsLanguage.Stochaskell.Plot
elementsOfLanguage.Stochaskell.Plot
elemIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndexOfLanguage.Stochaskell.Plot
elemIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
elemIndicesOfLanguage.Stochaskell.Plot
elemOfLanguage.Stochaskell.Plot
elemRIndexLanguage.Stochaskell
embedRenderableLanguage.Stochaskell.Plot
EmptyLanguage.Stochaskell.Plot
emptyLanguage.Stochaskell.Plot
emptyGridLineFunctionLanguage.Stochaskell.Plot
emptyRenderableLanguage.Stochaskell.Plot
encodeFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
EndLanguage.Stochaskell.Plot
Endo 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
endswithLanguage.Stochaskell
EnumLanguage.Stochaskell.Prelude, Language.Stochaskell
enumLanguage.Stochaskell.Plot
enumFromLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromThenToLanguage.Stochaskell.Prelude, Language.Stochaskell
enumFromToLanguage.Stochaskell.Prelude, Language.Stochaskell
EnvLanguage.Stochaskell.Expression
ep_xLanguage.Stochaskell.Plot
ep_yLanguage.Stochaskell.Plot
EQLanguage.Stochaskell.Prelude, Language.Stochaskell
EqLanguage.Stochaskell.Prelude, Language.Stochaskell
EqBLanguage.Stochaskell.Prelude, Language.Stochaskell
EqualityLanguage.Stochaskell.Plot
Equality'Language.Stochaskell.Plot
erLanguage.Stochaskell.Plot
eraseLanguage.Stochaskell.Expression
errorLanguage.Stochaskell.Prelude, Language.Stochaskell
errorWithoutStackTraceLanguage.Stochaskell.Prelude, Language.Stochaskell
ErrPoint 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
ErrValue 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
ethetaLanguage.Stochaskell.Plot
EvalLanguage.Stochaskell.Expression
eval'Language.Stochaskell.Expression
eval_Language.Stochaskell.Expression
evenLanguage.Stochaskell.Prelude, Language.Stochaskell
ev_bestLanguage.Stochaskell.Plot
ev_highLanguage.Stochaskell.Plot
ev_lowLanguage.Stochaskell.Plot
execECLanguage.Stochaskell.Plot
exesLanguage.Stochaskell.Plot
expLanguage.Stochaskell.Prelude, Language.Stochaskell
exponentLanguage.Stochaskell.Prelude, Language.Stochaskell
ExprLanguage.Stochaskell.Expression
Expression 
1 (Type/Class)Language.Stochaskell.Expression, Language.Stochaskell
2 (Data Constructor)Language.Stochaskell.Expression
ExprTupleLanguage.Stochaskell.Expression
ExprTypeLanguage.Stochaskell.Expression
ExtendingLanguage.Stochaskell.Plot
eyeLanguage.Stochaskell
E_BottomLanguage.Stochaskell.Plot
E_LeftLanguage.Stochaskell.Plot
E_RightLanguage.Stochaskell.Plot
E_TopLanguage.Stochaskell.Plot
eθLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-F.html b/docs/doc/doc-index-F.html index 298a2a8..4c58eb9 100644 --- a/docs/doc/doc-index-F.html +++ b/docs/doc/doc-index-F.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - F)

stochaskell-0.1.0: A probabilistic programming language

Index - F

fadedColoursLanguage.Stochaskell.Plot
failLanguage.Stochaskell.Prelude, Language.Stochaskell
failingLanguage.Stochaskell.Plot
failoverLanguage.Stochaskell.Plot
FalseLanguage.Stochaskell.Prelude, Language.Stochaskell
falseLanguage.Stochaskell.Prelude, Language.Stochaskell
Field1Language.Stochaskell.Plot
Field10Language.Stochaskell.Plot
Field11Language.Stochaskell.Plot
Field12Language.Stochaskell.Plot
Field13Language.Stochaskell.Plot
Field14Language.Stochaskell.Plot
Field15Language.Stochaskell.Plot
Field16Language.Stochaskell.Plot
Field17Language.Stochaskell.Plot
Field18Language.Stochaskell.Plot
Field19Language.Stochaskell.Plot
Field2Language.Stochaskell.Plot
Field3Language.Stochaskell.Plot
Field4Language.Stochaskell.Plot
Field5Language.Stochaskell.Plot
Field6Language.Stochaskell.Plot
Field7Language.Stochaskell.Plot
Field8Language.Stochaskell.Plot
Field9Language.Stochaskell.Plot
FieldNamerLanguage.Stochaskell.Plot
FilePathLanguage.Stochaskell.Prelude, Language.Stochaskell
fillBackgroundLanguage.Stochaskell.Plot
filledCirclesLanguage.Stochaskell.Plot
filledPolygonLanguage.Stochaskell.Plot
fillPathLanguage.Stochaskell.Plot
fillPointPathLanguage.Stochaskell.Plot
FillStyleLanguage.Stochaskell.Plot
FillStyleSolidLanguage.Stochaskell.Plot
fill_colorLanguage.Stochaskell.Plot
filterLanguage.Stochaskell.Prelude, Language.Stochaskell
filteredLanguage.Stochaskell.Plot
filterMLanguage.Stochaskell.Prelude, Language.Stochaskell
finalPlotsLanguage.Stochaskell.Plot
findLanguage.Stochaskell.Prelude, Language.Stochaskell
find'Language.Stochaskell
findIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndexOfLanguage.Stochaskell.Plot
findIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndicesOfLanguage.Stochaskell.Plot
findMOfLanguage.Stochaskell.Plot
findOfLanguage.Stochaskell.Plot
findSortedInsertIndexLanguage.Stochaskell
firebrickLanguage.Stochaskell.Plot
First 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
first1OfLanguage.Stochaskell.Plot
firstingLanguage.Stochaskell.Plot
firstOfLanguage.Stochaskell.Plot
fixedWidthLanguage.Stochaskell
flipLanguage.Stochaskell.Prelude, Language.Stochaskell
flipALLanguage.Stochaskell
flippedLanguage.Stochaskell.Plot
FloatLanguage.Stochaskell.Prelude, Language.Stochaskell
floatDigitsLanguage.Stochaskell.Prelude, Language.Stochaskell
FloatingLanguage.Stochaskell.Prelude, Language.Stochaskell
floatingBarPlotLanguage.Stochaskell.Plot
floatRadixLanguage.Stochaskell.Prelude, Language.Stochaskell
floatRangeLanguage.Stochaskell.Prelude, Language.Stochaskell
floorLanguage.Stochaskell.Prelude, Language.Stochaskell
floralwhiteLanguage.Stochaskell.Plot
fmapLanguage.Stochaskell.Prelude, Language.Stochaskell
Fold 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Fold1Language.Stochaskell.Plot
FoldableLanguage.Stochaskell.Prelude, Language.Stochaskell
FoldableWithIndexLanguage.Stochaskell.Plot
foldByLanguage.Stochaskell.Plot
foldByOfLanguage.Stochaskell.Plot
foldedLanguage.Stochaskell.Plot
folded64Language.Stochaskell.Plot
foldingLanguage.Stochaskell.Plot
foldlLanguage.Stochaskell
foldl'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1Language.Stochaskell.Prelude, Language.Stochaskell
foldl1'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1OfLanguage.Stochaskell.Plot
foldl1Of'Language.Stochaskell.Plot
foldlMOfLanguage.Stochaskell.Plot
foldlOfLanguage.Stochaskell.Plot
foldlOf'Language.Stochaskell.Plot
foldMLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapByLanguage.Stochaskell.Plot
foldMapByOfLanguage.Stochaskell.Plot
foldMapOfLanguage.Stochaskell.Plot
foldM_Language.Stochaskell.Prelude, Language.Stochaskell
foldOfLanguage.Stochaskell.Plot
foldPathLanguage.Stochaskell.Plot
foldrLanguage.Stochaskell
foldr1Language.Stochaskell.Prelude, Language.Stochaskell
foldr1OfLanguage.Stochaskell.Plot
foldr1Of'Language.Stochaskell.Plot
foldringLanguage.Stochaskell.Plot
foldrMOfLanguage.Stochaskell.Plot
foldrOfLanguage.Stochaskell.Plot
foldrOf'Language.Stochaskell.Plot
FontSlantLanguage.Stochaskell.Plot
FontSlantItalicLanguage.Stochaskell.Plot
FontSlantNormalLanguage.Stochaskell.Plot
FontSlantObliqueLanguage.Stochaskell.Plot
FontStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
FontWeightLanguage.Stochaskell.Plot
FontWeightBoldLanguage.Stochaskell.Plot
FontWeightNormalLanguage.Stochaskell.Plot
font_colorLanguage.Stochaskell.Plot
font_nameLanguage.Stochaskell.Plot
font_sizeLanguage.Stochaskell.Plot
font_slantLanguage.Stochaskell.Plot
font_weightLanguage.Stochaskell.Plot
for1Of_Language.Stochaskell.Plot
forceEitherLanguage.Stochaskell
forceEitherMsgLanguage.Stochaskell
forestgreenLanguage.Stochaskell.Plot
foreverLanguage.Stochaskell.Prelude, Language.Stochaskell
forMLanguage.Stochaskell.Prelude, Language.Stochaskell
forMOfLanguage.Stochaskell.Plot
forMOf_Language.Stochaskell.Plot
forM_Language.Stochaskell.Prelude, Language.Stochaskell
forOfLanguage.Stochaskell.Plot
forOf_Language.Stochaskell.Plot
FractionalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLanguage.Stochaskell.Plot
fromConcreteLanguage.Stochaskell.Expression
fromConcreteCLanguage.Stochaskell.Expression
fromConstValsLanguage.Stochaskell.Expression
fromEitherLanguage.Stochaskell
fromEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
fromEqLanguage.Stochaskell.Plot
fromExprTupleLanguage.Stochaskell.Expression
fromIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
fromIntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
fromJustLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLeftLanguage.Stochaskell
fromListLanguage.Stochaskell
fromListNLanguage.Stochaskell
fromMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRightLanguage.Stochaskell
fromRight'Language.Stochaskell
fromValueLanguage.Stochaskell.Plot
fstLanguage.Stochaskell.Prelude, Language.Stochaskell
fuchsiaLanguage.Stochaskell.Plot
fullOverlayOverLanguage.Stochaskell.Plot
fullOverlayUnderLanguage.Stochaskell.Plot
FunctorLanguage.Stochaskell.Prelude, Language.Stochaskell
FunctorWithIndexLanguage.Stochaskell.Plot
fusingLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - F)

stochaskell-1.0.0: A probabilistic programming language

Index - F

factorial'Language.Stochaskell
fadedColoursLanguage.Stochaskell.Plot
failLanguage.Stochaskell.Prelude, Language.Stochaskell
failingLanguage.Stochaskell.Plot
failoverLanguage.Stochaskell.Plot
FalseLanguage.Stochaskell.Prelude, Language.Stochaskell
falseLanguage.Stochaskell.Prelude, Language.Stochaskell
Field1Language.Stochaskell.Plot
Field10Language.Stochaskell.Plot
Field11Language.Stochaskell.Plot
Field12Language.Stochaskell.Plot
Field13Language.Stochaskell.Plot
Field14Language.Stochaskell.Plot
Field15Language.Stochaskell.Plot
Field16Language.Stochaskell.Plot
Field17Language.Stochaskell.Plot
Field18Language.Stochaskell.Plot
Field19Language.Stochaskell.Plot
Field2Language.Stochaskell.Plot
Field3Language.Stochaskell.Plot
Field4Language.Stochaskell.Plot
Field5Language.Stochaskell.Plot
Field6Language.Stochaskell.Plot
Field7Language.Stochaskell.Plot
Field8Language.Stochaskell.Plot
Field9Language.Stochaskell.Plot
FieldNamerLanguage.Stochaskell.Plot
FilePathLanguage.Stochaskell.Prelude, Language.Stochaskell
fillBackgroundLanguage.Stochaskell.Plot
filledCirclesLanguage.Stochaskell.Plot
filledPolygonLanguage.Stochaskell.Plot
fillPathLanguage.Stochaskell.Plot
fillPointPathLanguage.Stochaskell.Plot
FillStyleLanguage.Stochaskell.Plot
FillStyleSolidLanguage.Stochaskell.Plot
fill_colorLanguage.Stochaskell.Plot
filterLanguage.Stochaskell.Prelude, Language.Stochaskell
filteredLanguage.Stochaskell.Plot
filterMLanguage.Stochaskell.Prelude, Language.Stochaskell
finalPlotsLanguage.Stochaskell.Plot
findLanguage.Stochaskell.Prelude, Language.Stochaskell
find'Language.Stochaskell
findIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndexOfLanguage.Stochaskell.Plot
findIndicesLanguage.Stochaskell.Prelude, Language.Stochaskell
findIndicesOfLanguage.Stochaskell.Plot
findMOfLanguage.Stochaskell.Plot
findOfLanguage.Stochaskell.Plot
findSortedInsertIndexLanguage.Stochaskell
findSortedInsertIndexBoundLanguage.Stochaskell
firebrickLanguage.Stochaskell.Plot
First 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
first1OfLanguage.Stochaskell.Plot
firstingLanguage.Stochaskell.Plot
firstOfLanguage.Stochaskell.Plot
FixE 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
FixE'Language.Stochaskell.Expression
fixedWidthLanguage.Stochaskell
flipLanguage.Stochaskell.Prelude, Language.Stochaskell
flipALLanguage.Stochaskell
flippedLanguage.Stochaskell.Plot
FloatLanguage.Stochaskell.Prelude, Language.Stochaskell
floatDigitsLanguage.Stochaskell.Prelude, Language.Stochaskell
FloatingLanguage.Stochaskell.Prelude, Language.Stochaskell
floatingBarPlotLanguage.Stochaskell.Plot
floatRadixLanguage.Stochaskell.Prelude, Language.Stochaskell
floatRangeLanguage.Stochaskell.Prelude, Language.Stochaskell
floorLanguage.Stochaskell.Prelude, Language.Stochaskell
floor'Language.Stochaskell
floralwhiteLanguage.Stochaskell.Plot
fmapLanguage.Stochaskell.Prelude, Language.Stochaskell
Fold 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Fold1Language.Stochaskell.Plot
FoldableLanguage.Stochaskell.Prelude, Language.Stochaskell
FoldableWithIndexLanguage.Stochaskell.Plot
foldByLanguage.Stochaskell.Plot
foldByOfLanguage.Stochaskell.Plot
foldELanguage.Stochaskell
foldedLanguage.Stochaskell.Plot
folded64Language.Stochaskell.Plot
foldingLanguage.Stochaskell.Plot
foldl'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1Language.Stochaskell.Prelude, Language.Stochaskell
foldl1'Language.Stochaskell.Prelude, Language.Stochaskell
foldl1OfLanguage.Stochaskell.Plot
foldl1Of'Language.Stochaskell.Plot
foldlELanguage.Stochaskell
foldlMOfLanguage.Stochaskell.Plot
foldlOfLanguage.Stochaskell.Plot
foldlOf'Language.Stochaskell.Plot
foldMLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapLanguage.Stochaskell.Prelude, Language.Stochaskell
foldMapByLanguage.Stochaskell.Plot
foldMapByOfLanguage.Stochaskell.Plot
foldMapOfLanguage.Stochaskell.Plot
foldM_Language.Stochaskell.Prelude, Language.Stochaskell
foldOfLanguage.Stochaskell.Plot
foldPLanguage.Stochaskell
foldPathLanguage.Stochaskell.Plot
foldr1Language.Stochaskell.Prelude, Language.Stochaskell
foldr1OfLanguage.Stochaskell.Plot
foldr1Of'Language.Stochaskell.Plot
foldrELanguage.Stochaskell
foldringLanguage.Stochaskell.Plot
foldrMOfLanguage.Stochaskell.Plot
foldrOfLanguage.Stochaskell.Plot
foldrOf'Language.Stochaskell.Plot
FontSlantLanguage.Stochaskell.Plot
FontSlantItalicLanguage.Stochaskell.Plot
FontSlantNormalLanguage.Stochaskell.Plot
FontSlantObliqueLanguage.Stochaskell.Plot
FontStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
FontWeightLanguage.Stochaskell.Plot
FontWeightBoldLanguage.Stochaskell.Plot
FontWeightNormalLanguage.Stochaskell.Plot
font_colorLanguage.Stochaskell.Plot
font_nameLanguage.Stochaskell.Plot
font_sizeLanguage.Stochaskell.Plot
font_slantLanguage.Stochaskell.Plot
font_weightLanguage.Stochaskell.Plot
for1Of_Language.Stochaskell.Plot
forceEitherLanguage.Stochaskell
forceEitherMsgLanguage.Stochaskell
forestgreenLanguage.Stochaskell.Plot
foreverLanguage.Stochaskell.Prelude, Language.Stochaskell
forMLanguage.Stochaskell.Prelude, Language.Stochaskell
forMOfLanguage.Stochaskell.Plot
forMOf_Language.Stochaskell.Plot
forM_Language.Stochaskell.Prelude, Language.Stochaskell
forOfLanguage.Stochaskell.Plot
forOf_Language.Stochaskell.Plot
FractionalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLanguage.Stochaskell.Plot
fromCaseLanguage.Stochaskell
fromCasePLanguage.Stochaskell
fromCaseP'Language.Stochaskell
fromConcreteLanguage.Stochaskell.Expression
fromConcreteCLanguage.Stochaskell.Expression
fromConstValsLanguage.Stochaskell.Expression
fromEitherLanguage.Stochaskell
fromEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
fromEqLanguage.Stochaskell.Plot
fromExprTupleLanguage.Stochaskell.Expression
fromIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
fromIntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
fromJustLanguage.Stochaskell.Prelude, Language.Stochaskell
fromLeftLanguage.Stochaskell
fromListLanguage.Stochaskell
fromListNLanguage.Stochaskell
fromMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
fromRightLanguage.Stochaskell
fromRight'Language.Stochaskell
fromValueLanguage.Stochaskell.Plot
fstLanguage.Stochaskell.Prelude, Language.Stochaskell
fuchsiaLanguage.Stochaskell.Plot
fullOverlayOverLanguage.Stochaskell.Plot
fullOverlayUnderLanguage.Stochaskell.Plot
FunctorLanguage.Stochaskell.Prelude, Language.Stochaskell
FunctorWithIndexLanguage.Stochaskell.Plot
fusingLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-G.html b/docs/doc/doc-index-G.html index 55fa064..7da996d 100644 --- a/docs/doc/doc-index-G.html +++ b/docs/doc/doc-index-G.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - G)

stochaskell-0.1.0: A probabilistic programming language

Index - G

gainsboroLanguage.Stochaskell.Plot
GammaLanguage.Stochaskell
gammaLanguage.Stochaskell
gapLanguage.Stochaskell.Plot
gapDirectionLanguage.Stochaskell.Plot
gcdLanguage.Stochaskell.Prelude, Language.Stochaskell
generateLazyPatternsLanguage.Stochaskell.Plot
generateSignaturesLanguage.Stochaskell.Plot
generateUpdateableOpticsLanguage.Stochaskell.Plot
genericDropLanguage.Stochaskell.Prelude, Language.Stochaskell
genericIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
genericJoinLanguage.Stochaskell
genericLengthLanguage.Stochaskell.Prelude, Language.Stochaskell
genericReplicateLanguage.Stochaskell.Prelude, Language.Stochaskell
genericSplitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
genericTakeLanguage.Stochaskell.Prelude, Language.Stochaskell
GeometricLanguage.Stochaskell
geometricLanguage.Stochaskell
getAllLanguage.Stochaskell.Prelude, Language.Stochaskell
getAltLanguage.Stochaskell.Prelude, Language.Stochaskell
getAnyLanguage.Stochaskell.Prelude, Language.Stochaskell
getCharLanguage.Stochaskell.Prelude, Language.Stochaskell
getConstLanguage.Stochaskell.Plot
getContentsLanguage.Stochaskell.Prelude, Language.Stochaskell
getCoordAlignFnLanguage.Stochaskell.Plot
getDualLanguage.Stochaskell.Prelude, Language.Stochaskell
getFirstLanguage.Stochaskell.Prelude, Language.Stochaskell
getLastLanguage.Stochaskell.Prelude, Language.Stochaskell
getLineLanguage.Stochaskell.Prelude, Language.Stochaskell
getPointAlignFnLanguage.Stochaskell.Plot
getProductLanguage.Stochaskell.Prelude, Language.Stochaskell
getSumLanguage.Stochaskell.Prelude, Language.Stochaskell
Getter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
GettingLanguage.Stochaskell.Plot
gettingLanguage.Stochaskell.Plot
ghostwhiteLanguage.Stochaskell.Plot
goldLanguage.Stochaskell.Plot
goldenrodLanguage.Stochaskell.Plot
gplateLanguage.Stochaskell.Plot
GPlatedLanguage.Stochaskell.Plot
grabLanguage.Stochaskell
gradientColourBarLanguage.Stochaskell.Plot
grayLanguage.Stochaskell.Plot
greenLanguage.Stochaskell.Plot
greenyellowLanguage.Stochaskell.Plot
greyLanguage.Stochaskell.Plot
greysLanguage.Stochaskell.Plot
GridLanguage.Stochaskell.Plot
GridLineFunctionLanguage.Stochaskell.Plot
GridLinesLanguage.Stochaskell.Plot
gridLinesLanguage.Stochaskell.Plot
gridLinesStyleLanguage.Stochaskell.Plot
gridLinesVisibleLanguage.Stochaskell.Plot
gridToRenderableLanguage.Stochaskell.Plot
groupLanguage.Stochaskell.Prelude, Language.Stochaskell
groupByLanguage.Stochaskell.Prelude, Language.Stochaskell
groupedBarsLanguage.Stochaskell.Plot
groupedBars'Language.Stochaskell.Plot
gscatterOptionsLanguage.Stochaskell.Plot
gscatterOptionsForLanguage.Stochaskell.Plot
gscatterPlotLanguage.Stochaskell.Plot
GTLanguage.Stochaskell.Prelude, Language.Stochaskell
guardLanguage.Stochaskell.Prelude, Language.Stochaskell
guardedBLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - G)

stochaskell-1.0.0: A probabilistic programming language

Index - G

gainsboroLanguage.Stochaskell.Plot
GammaLanguage.Stochaskell
gammaLanguage.Stochaskell
gapLanguage.Stochaskell.Plot
gapDirectionLanguage.Stochaskell.Plot
gcdLanguage.Stochaskell.Prelude, Language.Stochaskell
gconstructLanguage.Stochaskell.Expression
GConstructorLanguage.Stochaskell.Expression
gdeconstructLanguage.Stochaskell.Expression
generateLazyPatternsLanguage.Stochaskell.Plot
generateSignaturesLanguage.Stochaskell.Plot
generateUpdateableOpticsLanguage.Stochaskell.Plot
GenericLanguage.Stochaskell.Expression
Generic1Language.Stochaskell.Expression
Generically1 
1 (Data Constructor)Language.Stochaskell.Expression
2 (Type/Class)Language.Stochaskell.Expression
genericDropLanguage.Stochaskell.Prelude, Language.Stochaskell
genericIndexLanguage.Stochaskell.Prelude, Language.Stochaskell
genericJoinLanguage.Stochaskell
genericLengthLanguage.Stochaskell.Prelude, Language.Stochaskell
genericReplicateLanguage.Stochaskell.Prelude, Language.Stochaskell
genericSplitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
genericTakeLanguage.Stochaskell.Prelude, Language.Stochaskell
GeometricLanguage.Stochaskell
geometricLanguage.Stochaskell
getAllLanguage.Stochaskell.Prelude, Language.Stochaskell
getAltLanguage.Stochaskell.Prelude, Language.Stochaskell
getAnyLanguage.Stochaskell.Prelude, Language.Stochaskell
getApLanguage.Stochaskell.Prelude, Language.Stochaskell
getCharLanguage.Stochaskell.Prelude, Language.Stochaskell
getConstLanguage.Stochaskell.Plot
getContentsLanguage.Stochaskell.Prelude, Language.Stochaskell
getCoordAlignFnLanguage.Stochaskell.Plot
getDualLanguage.Stochaskell.Prelude, Language.Stochaskell
getFirstLanguage.Stochaskell.Prelude, Language.Stochaskell
getLastLanguage.Stochaskell.Prelude, Language.Stochaskell
getLineLanguage.Stochaskell.Prelude, Language.Stochaskell
getPointAlignFnLanguage.Stochaskell.Plot
getProductLanguage.Stochaskell.Prelude, Language.Stochaskell
getSumLanguage.Stochaskell.Prelude, Language.Stochaskell
Getter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
GettingLanguage.Stochaskell.Plot
gettingLanguage.Stochaskell.Plot
ghostwhiteLanguage.Stochaskell.Plot
goldLanguage.Stochaskell.Plot
goldenrodLanguage.Stochaskell.Plot
gplateLanguage.Stochaskell.Plot
gplate1Language.Stochaskell.Plot
GPlatedLanguage.Stochaskell.Plot
GPlated1Language.Stochaskell.Plot
grabLanguage.Stochaskell
gradientColourBarLanguage.Stochaskell.Plot
graphvizLanguage.Graphviz
grayLanguage.Stochaskell.Plot
greenLanguage.Stochaskell.Plot
greenyellowLanguage.Stochaskell.Plot
greyLanguage.Stochaskell.Plot
greysLanguage.Stochaskell.Plot
GridLanguage.Stochaskell.Plot
GridLineFunctionLanguage.Stochaskell.Plot
GridLinesLanguage.Stochaskell.Plot
gridLinesLanguage.Stochaskell.Plot
gridLinesStyleLanguage.Stochaskell.Plot
gridLinesVisibleLanguage.Stochaskell.Plot
gridToRenderableLanguage.Stochaskell.Plot
groupLanguage.Stochaskell.Prelude, Language.Stochaskell
groupByLanguage.Stochaskell.Prelude, Language.Stochaskell
groupedBarsLanguage.Stochaskell.Plot
groupedBars'Language.Stochaskell.Plot
gscatterOptionsLanguage.Stochaskell.Plot
gscatterOptionsForLanguage.Stochaskell.Plot
gscatterPlotLanguage.Stochaskell.Plot
GTLanguage.Stochaskell.Prelude, Language.Stochaskell
gtagsLanguage.Stochaskell.Expression
gtypeOfLanguage.Stochaskell.Expression
guardLanguage.Stochaskell.Prelude, Language.Stochaskell
guardedBLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-H.html b/docs/doc/doc-index-H.html index f172452..66f882d 100644 --- a/docs/doc/doc-index-H.html +++ b/docs/doc/doc-index-H.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - H)

stochaskell-0.1.0: A probabilistic programming language

Index - H

HamiltonianMCLanguage.PyMC3
hasLanguage.Stochaskell.Plot
hasAnyLanguage.Stochaskell
HasAxisLabelLanguage.Stochaskell.Plot
HasAxisScalingLanguage.Stochaskell.Plot
HasAxisStyleLanguage.Stochaskell.Plot
HasBarLayoutLanguage.Stochaskell.Plot
HasColourBarLanguage.Stochaskell.Plot
HasConnectingLineLanguage.Stochaskell.Plot
HasGapLanguage.Stochaskell.Plot
HasGridLinesLanguage.Stochaskell.Plot
HasHeatMapLanguage.Stochaskell.Plot
HasHistogramOptionsLanguage.Stochaskell.Plot
hasKeyALLanguage.Stochaskell
HasLegendLanguage.Stochaskell.Plot
HasMajorGridLinesLanguage.Stochaskell.Plot
HasMajorTicksLanguage.Stochaskell.Plot
HasMinorGridLinesLanguage.Stochaskell.Plot
HasMinorTicksLanguage.Stochaskell.Plot
hasn'tLanguage.Stochaskell.Plot
HasOrientationLanguage.Stochaskell.Plot
HasPlacementLanguage.Stochaskell.Plot
HasPlotOptionsLanguage.Stochaskell.Plot
HasPlotStyleLanguage.Stochaskell.Plot
HasRLanguage.Stochaskell.Plot
HasScatterOptionsLanguage.Stochaskell.Plot
HasTickLabelsLanguage.Stochaskell.Plot
HasTicksLanguage.Stochaskell.Plot
HasTitleLanguage.Stochaskell.Plot
HasVisibilityLanguage.Stochaskell.Plot
HasWedgeLanguage.Stochaskell.Plot
HasXLanguage.Stochaskell.Plot
HasYLanguage.Stochaskell.Plot
headLanguage.Stochaskell.Prelude, Language.Stochaskell
heatImageLanguage.Stochaskell.Plot
HeatMapLanguage.Stochaskell.Plot
heatMapLanguage.Stochaskell.Plot
heatMap'Language.Stochaskell.Plot
heatMapCentreLanguage.Stochaskell.Plot
heatMapExtentLanguage.Stochaskell.Plot
heatMapGridStyleLanguage.Stochaskell.Plot
heatMapGridVisibleLanguage.Stochaskell.Plot
heatMapIndexedLanguage.Stochaskell.Plot
heatMapIndexed'Language.Stochaskell.Plot
heatMapLimitsLanguage.Stochaskell.Plot
heatMapOptionsLanguage.Stochaskell.Plot
heatMapRenderLanguage.Stochaskell.Plot
heatMapSizeLanguage.Stochaskell.Plot
heatMapStartLanguage.Stochaskell.Plot
HeatMatrixLanguage.Stochaskell.Plot
heightLanguage.Stochaskell.Plot
hiddenLanguage.Stochaskell.Plot
hideLanguage.Stochaskell.Plot
hideGridLinesLanguage.Stochaskell.Plot
hideTicksLanguage.Stochaskell.Plot
HistogramOptionsLanguage.Stochaskell.Plot
histogramOptionsLanguage.Stochaskell.Plot
HistogramPlotLanguage.Stochaskell.Plot
histogramPlotLanguage.Stochaskell.Plot
histogramPlot'Language.Stochaskell.Plot
histogramPlotOfLanguage.Stochaskell.Plot
histogramPlotOf'Language.Stochaskell.Plot
histToPlotLanguage.Stochaskell.Plot
hlinePlotLanguage.Stochaskell.Plot
hmcEdwardLanguage.Edward
hmcEngineLanguage.Stan
hmcMetricLanguage.Stan
hmcStanLanguage.Stan, Language.Stochaskell
hmcStanInitLanguage.Stan, Language.Stochaskell
hmcStepSizeLanguage.Stan
hmcStepSizeJitterLanguage.Stan
hmPointsLanguage.Stochaskell.Plot
hmSizeLanguage.Stochaskell.Plot
holesLanguage.Stochaskell.Plot
holesOfLanguage.Stochaskell.Plot
holesOnLanguage.Stochaskell.Plot
holesOnOfLanguage.Stochaskell.Plot
hollowCirclesLanguage.Stochaskell.Plot
hollowPolygonLanguage.Stochaskell.Plot
honeydewLanguage.Stochaskell.Plot
HorizontalLanguage.Stochaskell.Plot
horizontalLanguage.Stochaskell.Plot
hotpinkLanguage.Stochaskell.Plot
HTA_CentreLanguage.Stochaskell.Plot
HTA_LeftLanguage.Stochaskell.Plot
HTA_RightLanguage.Stochaskell.Plot
HTextAnchorLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - H)

stochaskell-1.0.0: A probabilistic programming language

Index - H

HamiltonianMCLanguage.PyMC3
hasLanguage.Stochaskell.Plot
hasAnyLanguage.Stochaskell
HasAxisLabelLanguage.Stochaskell.Plot
HasAxisScalingLanguage.Stochaskell.Plot
HasAxisStyleLanguage.Stochaskell.Plot
HasBarLayoutLanguage.Stochaskell.Plot
HasColourBarLanguage.Stochaskell.Plot
HasConnectingLineLanguage.Stochaskell.Plot
HasGapLanguage.Stochaskell.Plot
HasGridLinesLanguage.Stochaskell.Plot
HasHeatMapLanguage.Stochaskell.Plot
HasHistogramOptionsLanguage.Stochaskell.Plot
hasKeyALLanguage.Stochaskell
HasLegendLanguage.Stochaskell.Plot
HasMajorGridLinesLanguage.Stochaskell.Plot
HasMajorTicksLanguage.Stochaskell.Plot
HasMinorGridLinesLanguage.Stochaskell.Plot
HasMinorTicksLanguage.Stochaskell.Plot
hasn'tLanguage.Stochaskell.Plot
HasNanColoursLanguage.Stochaskell.Plot
HasOrientationLanguage.Stochaskell.Plot
HasPlacementLanguage.Stochaskell.Plot
HasPlotOptionsLanguage.Stochaskell.Plot
HasPlotStyleLanguage.Stochaskell.Plot
HasRLanguage.Stochaskell.Plot
HasScatterOptionsLanguage.Stochaskell.Plot
HasTickLabelsLanguage.Stochaskell.Plot
HasTicksLanguage.Stochaskell.Plot
HasTitleLanguage.Stochaskell.Plot
HasVisibilityLanguage.Stochaskell.Plot
HasWedgeLanguage.Stochaskell.Plot
HasXLanguage.Stochaskell.Plot
HasYLanguage.Stochaskell.Plot
headLanguage.Stochaskell.Prelude, Language.Stochaskell
heatImageLanguage.Stochaskell.Plot
HeatMapLanguage.Stochaskell.Plot
heatMapLanguage.Stochaskell.Plot
heatMap'Language.Stochaskell.Plot
heatMapCentreLanguage.Stochaskell.Plot
heatMapExtentLanguage.Stochaskell.Plot
heatMapGridStyleLanguage.Stochaskell.Plot
heatMapGridVisibleLanguage.Stochaskell.Plot
heatMapIndexedLanguage.Stochaskell.Plot
heatMapIndexed'Language.Stochaskell.Plot
heatMapLimitsLanguage.Stochaskell.Plot
heatMapOptionsLanguage.Stochaskell.Plot
heatMapRenderLanguage.Stochaskell.Plot
heatMapSizeLanguage.Stochaskell.Plot
heatMapStartLanguage.Stochaskell.Plot
HeatMatrixLanguage.Stochaskell.Plot
heightLanguage.Stochaskell.Plot
hiddenLanguage.Stochaskell.Plot
hideLanguage.Stochaskell.Plot
hideGridLinesLanguage.Stochaskell.Plot
hideTicksLanguage.Stochaskell.Plot
HistogramOptionsLanguage.Stochaskell.Plot
histogramOptionsLanguage.Stochaskell.Plot
HistogramPlotLanguage.Stochaskell.Plot
histogramPlotLanguage.Stochaskell.Plot
histogramPlot'Language.Stochaskell.Plot
histogramPlotOfLanguage.Stochaskell.Plot
histogramPlotOf'Language.Stochaskell.Plot
histToPlotLanguage.Stochaskell.Plot
hlinePlotLanguage.Stochaskell.Plot
hmcEdwardLanguage.Edward
hmcEngineLanguage.Stan
hmcMetricLanguage.Stan
hmcStanLanguage.Stan, Language.Stochaskell
hmcStanInitLanguage.Stan, Language.Stochaskell
hmcStepSizeLanguage.Stan
hmcStepSizeJitterLanguage.Stan
hmPointsLanguage.Stochaskell.Plot
hmSizeLanguage.Stochaskell.Plot
holesLanguage.Stochaskell.Plot
holes1OfLanguage.Stochaskell.Plot
holesOfLanguage.Stochaskell.Plot
holesOnLanguage.Stochaskell.Plot
holesOnOfLanguage.Stochaskell.Plot
hollowCirclesLanguage.Stochaskell.Plot
hollowPolygonLanguage.Stochaskell.Plot
honeydewLanguage.Stochaskell.Plot
HorizontalLanguage.Stochaskell.Plot
horizontalLanguage.Stochaskell.Plot
hotpinkLanguage.Stochaskell.Plot
HTA_CentreLanguage.Stochaskell.Plot
HTA_LeftLanguage.Stochaskell.Plot
HTA_RightLanguage.Stochaskell.Plot
HTextAnchorLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-I.html b/docs/doc/doc-index-I.html index 980999b..efb4ecb 100644 --- a/docs/doc/doc-index-I.html +++ b/docs/doc/doc-index-I.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - I)

stochaskell-0.1.0: A probabilistic programming language

Index - I

iallLanguage.Stochaskell.Plot
iallOfLanguage.Stochaskell.Plot
ianyLanguage.Stochaskell.Plot
ianyOfLanguage.Stochaskell.Plot
iatLanguage.Stochaskell.Plot
icensoringLanguage.Stochaskell.Plot
icomposeLanguage.Stochaskell.Plot
iconcatMapLanguage.Stochaskell.Plot
iconcatMapOfLanguage.Stochaskell.Plot
icontainsLanguage.Stochaskell.Plot
IdLanguage.Stochaskell.Expression
idLanguage.Stochaskell.Prelude, Language.Stochaskell
id'Language.Stochaskell
Identical 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Identity 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
identityLanguage.Stochaskell.Plot
idroppingWhileLanguage.Stochaskell.Plot
ifailoverLanguage.Stochaskell.Plot
IfBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifilteredLanguage.Stochaskell.Plot
ifindLanguage.Stochaskell.Plot
ifindMOfLanguage.Stochaskell.Plot
ifindOfLanguage.Stochaskell.Plot
ifoldedLanguage.Stochaskell.Plot
ifoldingLanguage.Stochaskell.Plot
ifoldlLanguage.Stochaskell.Plot
ifoldl'Language.Stochaskell.Plot
ifoldlMLanguage.Stochaskell.Plot
ifoldlMOfLanguage.Stochaskell.Plot
ifoldlOfLanguage.Stochaskell.Plot
ifoldlOf'Language.Stochaskell.Plot
ifoldMapLanguage.Stochaskell.Plot
ifoldMapByLanguage.Stochaskell.Plot
ifoldMapByOfLanguage.Stochaskell.Plot
ifoldMapOfLanguage.Stochaskell.Plot
ifoldrLanguage.Stochaskell.Plot
ifoldr'Language.Stochaskell.Plot
ifoldringLanguage.Stochaskell.Plot
ifoldrMLanguage.Stochaskell.Plot
ifoldrMOfLanguage.Stochaskell.Plot
ifoldrOfLanguage.Stochaskell.Plot
ifoldrOf'Language.Stochaskell.Plot
iforLanguage.Stochaskell.Plot
iforMLanguage.Stochaskell.Plot
iforMOfLanguage.Stochaskell.Plot
iforMOf_Language.Stochaskell.Plot
iforM_Language.Stochaskell.Plot
iforOfLanguage.Stochaskell.Plot
iforOf_Language.Stochaskell.Plot
ifor_Language.Stochaskell.Plot
ifThenElseLanguage.Stochaskell.Prelude, Language.Stochaskell
ignoredLanguage.Stochaskell.Plot
iixLanguage.Stochaskell.Plot
ilensLanguage.Stochaskell.Plot
ilevelsLanguage.Stochaskell.Plot
ilikeLanguage.Stochaskell.Plot
ilisteningLanguage.Stochaskell.Plot
ilisteningsLanguage.Stochaskell.Plot
ilociLanguage.Stochaskell.Plot
imagmaLanguage.Stochaskell.Plot
imapLanguage.Stochaskell.Plot
imapAccumLLanguage.Stochaskell.Plot
imapAccumLOfLanguage.Stochaskell.Plot
imapAccumRLanguage.Stochaskell.Plot
imapAccumROfLanguage.Stochaskell.Plot
imapMLanguage.Stochaskell.Plot
imapMOfLanguage.Stochaskell.Plot
imapMOf_Language.Stochaskell.Plot
imapM_Language.Stochaskell.Plot
imapOfLanguage.Stochaskell.Plot
imappedLanguage.Stochaskell.Plot
imodifyingLanguage.Stochaskell.Plot
IndexLanguage.Stochaskell.Plot
indexLanguage.Stochaskell.Plot
Indexable 
1 (Type/Class)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell
Indexed 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
indexedLanguage.Stochaskell.Plot
IndexedFold 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedFold1Language.Stochaskell.Plot
IndexedGetter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedGettingLanguage.Stochaskell.Plot
IndexedLens 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedLens'Language.Stochaskell.Plot
IndexedLensLikeLanguage.Stochaskell.Plot
IndexedLensLike'Language.Stochaskell.Plot
IndexedSetter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedSetter'Language.Stochaskell.Plot
IndexedTraversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
IndexedTraversal'Language.Stochaskell.Plot
IndexedTraversal1Language.Stochaskell.Plot
IndexedTraversal1'Language.Stochaskell.Plot
indexingLanguage.Stochaskell.Plot
indexing64Language.Stochaskell.Plot
IndexPreservingFoldLanguage.Stochaskell.Plot
IndexPreservingFold1Language.Stochaskell.Plot
IndexPreservingGetterLanguage.Stochaskell.Plot
IndexPreservingLensLanguage.Stochaskell.Plot
IndexPreservingLens'Language.Stochaskell.Plot
IndexPreservingSetterLanguage.Stochaskell.Plot
IndexPreservingSetter'Language.Stochaskell.Plot
IndexPreservingTraversalLanguage.Stochaskell.Plot
IndexPreservingTraversal'Language.Stochaskell.Plot
IndexPreservingTraversal1Language.Stochaskell.Plot
IndexPreservingTraversal1'Language.Stochaskell.Plot
indianredLanguage.Stochaskell.Plot
indicesLanguage.Stochaskell.Plot
indigoLanguage.Stochaskell.Plot
infernoLanguage.Stochaskell.Plot
infinityLanguage.Stochaskell
initLanguage.Stochaskell.Prelude, Language.Stochaskell
initsLanguage.Stochaskell.Prelude, Language.Stochaskell
InnerProductLanguage.Stochaskell
inoneLanguage.Stochaskell.Plot
inoneOfLanguage.Stochaskell.Plot
insertLanguage.Stochaskell.Prelude, Language.Stochaskell
insertAtLanguage.Stochaskell
insertByLanguage.Stochaskell.Prelude, Language.Stochaskell
insertIndexLanguage.Stochaskell
insideLanguage.Stochaskell.Plot
InsideAxisLabelLanguage.Stochaskell.Plot
insideTicksLanguage.Stochaskell.Plot
IntLanguage.Stochaskell.Prelude, Language.Stochaskell
IntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
integerLanguage.Stochaskell
IntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
interactLanguage.Stochaskell.Prelude, Language.Stochaskell
intercalateLanguage.Stochaskell.Prelude, Language.Stochaskell
interpolateLanguage.Stochaskell
interpPolarLanguage.Stochaskell.Plot
intersectLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectByLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectRectLanguage.Stochaskell.Plot
intersperseLanguage.Stochaskell.Prelude, Language.Stochaskell
IntervalLanguage.Stochaskell
IntTLanguage.Stochaskell.Expression
intTimeLanguage.Stan
invLanguage.Stochaskell
invertLanguage.Stochaskell.Plot
InvGammaLanguage.Stochaskell
invGammaLanguage.Stochaskell
invLinMapLanguage.Stochaskell.Plot
invmapLanguage.Stochaskell.Plot
involutedLanguage.Stochaskell.Plot
IOLanguage.Stochaskell.Prelude, Language.Stochaskell
IOErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioverLanguage.Stochaskell.Plot
ipartsOfLanguage.Stochaskell.Plot
ipartsOf'Language.Stochaskell.Plot
ipassingLanguage.Stochaskell.Plot
iplensLanguage.Stochaskell.Plot
ipreLanguage.Stochaskell.Plot
ipreuseLanguage.Stochaskell.Plot
ipreusesLanguage.Stochaskell.Plot
ipreviewLanguage.Stochaskell.Plot
ipreviewsLanguage.Stochaskell.Plot
isDenormalizedLanguage.Stochaskell.Prelude, Language.Stochaskell
isetLanguage.Stochaskell.Plot
isetsLanguage.Stochaskell.Plot
isIEEELanguage.Stochaskell.Prelude, Language.Stochaskell
isInfiniteLanguage.Stochaskell.Prelude, Language.Stochaskell
isInfixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isJustLanguage.Stochaskell.Prelude, Language.Stochaskell
IsListLanguage.Stochaskell
isn'tLanguage.Stochaskell.Plot
isNaNLanguage.Stochaskell.Prelude, Language.Stochaskell
isNegativeZeroLanguage.Stochaskell.Prelude, Language.Stochaskell
isNothingLanguage.Stochaskell.Prelude, Language.Stochaskell
Iso 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
isoLanguage.Stochaskell.Plot
Iso'Language.Stochaskell.Plot
isPrefixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSubsequenceOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSuffixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
itakingWhileLanguage.Stochaskell.Plot
ItemLanguage.Stochaskell
iterateLanguage.Stochaskell.Prelude, Language.Stochaskell
iterate'Language.Stochaskell.Prelude, Language.Stochaskell
iteratedLanguage.Stochaskell.Plot
iterateLimitLanguage.Stochaskell
itoLanguage.Stochaskell.Plot
itoListLanguage.Stochaskell.Plot
itoListOfLanguage.Stochaskell.Plot
itraverseLanguage.Stochaskell.Plot
itraverseByLanguage.Stochaskell.Plot
itraverseByOfLanguage.Stochaskell.Plot
itraversedLanguage.Stochaskell.Plot
itraverseOfLanguage.Stochaskell.Plot
itraverseOf_Language.Stochaskell.Plot
itraverse_Language.Stochaskell.Plot
iunsafePartsOfLanguage.Stochaskell.Plot
iunsafePartsOf'Language.Stochaskell.Plot
iuseLanguage.Stochaskell.Plot
iusesLanguage.Stochaskell.Plot
iviewLanguage.Stochaskell.Plot
iviewsLanguage.Stochaskell.Plot
ivoryLanguage.Stochaskell.Plot
ixLanguage.Stochaskell.Plot
ixAtLanguage.Stochaskell.Plot
ixColourLanguage.Stochaskell.Plot
IxedLanguage.Stochaskell.Plot
IxValueLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - I)

stochaskell-1.0.0: A probabilistic programming language

Index - I

iallLanguage.Stochaskell.Plot
iallOfLanguage.Stochaskell.Plot
ianyLanguage.Stochaskell.Plot
ianyOfLanguage.Stochaskell.Plot
iatLanguage.Stochaskell.Plot
icensoringLanguage.Stochaskell.Plot
icomposeLanguage.Stochaskell.Plot
iconcatMapLanguage.Stochaskell.Plot
iconcatMapOfLanguage.Stochaskell.Plot
icontainsLanguage.Stochaskell.Plot
IdLanguage.Stochaskell.Expression
idLanguage.Stochaskell.Prelude, Language.Stochaskell
Identical 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Identity 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
identityLanguage.Stochaskell.Plot
idroppingWhileLanguage.Stochaskell.Plot
ifailoverLanguage.Stochaskell.Plot
IfBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifBLanguage.Stochaskell.Prelude, Language.Stochaskell
ifilteredLanguage.Stochaskell.Plot
ifindLanguage.Stochaskell.Plot
ifindMOfLanguage.Stochaskell.Plot
ifindOfLanguage.Stochaskell.Plot
ifoldedLanguage.Stochaskell.Plot
ifoldingLanguage.Stochaskell.Plot
ifoldlLanguage.Stochaskell.Plot
ifoldl'Language.Stochaskell.Plot
ifoldlMLanguage.Stochaskell.Plot
ifoldlMOfLanguage.Stochaskell.Plot
ifoldlOfLanguage.Stochaskell.Plot
ifoldlOf'Language.Stochaskell.Plot
ifoldMapLanguage.Stochaskell.Plot
ifoldMapByLanguage.Stochaskell.Plot
ifoldMapByOfLanguage.Stochaskell.Plot
ifoldMapOfLanguage.Stochaskell.Plot
ifoldrLanguage.Stochaskell.Plot
ifoldr'Language.Stochaskell.Plot
ifoldringLanguage.Stochaskell.Plot
ifoldrMLanguage.Stochaskell.Plot
ifoldrMOfLanguage.Stochaskell.Plot
ifoldrOfLanguage.Stochaskell.Plot
ifoldrOf'Language.Stochaskell.Plot
iforLanguage.Stochaskell.Plot
iforMLanguage.Stochaskell.Plot
iforMOfLanguage.Stochaskell.Plot
iforMOf_Language.Stochaskell.Plot
iforM_Language.Stochaskell.Plot
iforOfLanguage.Stochaskell.Plot
iforOf_Language.Stochaskell.Plot
ifor_Language.Stochaskell.Plot
ifThenElseLanguage.Stochaskell.Prelude, Language.Stochaskell
ignoredLanguage.Stochaskell.Plot
iixLanguage.Stochaskell.Plot
ilensLanguage.Stochaskell.Plot
ilevelsLanguage.Stochaskell.Plot
ilikeLanguage.Stochaskell.Plot
ilisteningLanguage.Stochaskell.Plot
ilisteningsLanguage.Stochaskell.Plot
ilocallyLanguage.Stochaskell.Plot
ilociLanguage.Stochaskell.Plot
imagmaLanguage.Stochaskell.Plot
imapLanguage.Stochaskell.Plot
imapAccumLLanguage.Stochaskell.Plot
imapAccumLOfLanguage.Stochaskell.Plot
imapAccumRLanguage.Stochaskell.Plot
imapAccumROfLanguage.Stochaskell.Plot
imapMLanguage.Stochaskell.Plot
imapMOfLanguage.Stochaskell.Plot
imapMOf_Language.Stochaskell.Plot
imapM_Language.Stochaskell.Plot
imapOfLanguage.Stochaskell.Plot
imappedLanguage.Stochaskell.Plot
imodifyingLanguage.Stochaskell.Plot
IndexLanguage.Stochaskell.Plot
indexLanguage.Stochaskell.Plot
Indexable 
1 (Type/Class)Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Plot
Indexed 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
indexedLanguage.Stochaskell.Plot
IndexedFold 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedFold1Language.Stochaskell.Plot
IndexedGetter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedGettingLanguage.Stochaskell.Plot
IndexedLens 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedLens'Language.Stochaskell.Plot
IndexedLensLikeLanguage.Stochaskell.Plot
IndexedLensLike'Language.Stochaskell.Plot
IndexedSetter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedSetter'Language.Stochaskell.Plot
IndexedTraversal 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
IndexedTraversal'Language.Stochaskell.Plot
IndexedTraversal1Language.Stochaskell.Plot
IndexedTraversal1'Language.Stochaskell.Plot
indexingLanguage.Stochaskell.Plot
indexing64Language.Stochaskell.Plot
IndexPreservingFoldLanguage.Stochaskell.Plot
IndexPreservingFold1Language.Stochaskell.Plot
IndexPreservingGetterLanguage.Stochaskell.Plot
IndexPreservingLensLanguage.Stochaskell.Plot
IndexPreservingLens'Language.Stochaskell.Plot
IndexPreservingSetterLanguage.Stochaskell.Plot
IndexPreservingSetter'Language.Stochaskell.Plot
IndexPreservingTraversalLanguage.Stochaskell.Plot
IndexPreservingTraversal'Language.Stochaskell.Plot
IndexPreservingTraversal1Language.Stochaskell.Plot
IndexPreservingTraversal1'Language.Stochaskell.Plot
indianredLanguage.Stochaskell.Plot
indicesLanguage.Stochaskell.Plot
indigoLanguage.Stochaskell.Plot
infColourLanguage.Stochaskell.Plot
infernoLanguage.Stochaskell.Plot
infinityLanguage.Stochaskell
initLanguage.Stochaskell.Prelude, Language.Stochaskell
initsLanguage.Stochaskell.Prelude, Language.Stochaskell
InnerProductLanguage.Stochaskell
inoneLanguage.Stochaskell.Plot
inoneOfLanguage.Stochaskell.Plot
insertLanguage.Stochaskell.Prelude, Language.Stochaskell
insertAtLanguage.Stochaskell
insertByLanguage.Stochaskell.Prelude, Language.Stochaskell
insertIndexLanguage.Stochaskell
insideLanguage.Stochaskell.Plot
InsideAxisLabelLanguage.Stochaskell.Plot
insideTicksLanguage.Stochaskell.Plot
IntLanguage.Stochaskell.Prelude, Language.Stochaskell
IntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
integerLanguage.Stochaskell
IntegralLanguage.Stochaskell.Prelude, Language.Stochaskell
interactLanguage.Stochaskell.Prelude, Language.Stochaskell
intercalateLanguage.Stochaskell.Prelude, Language.Stochaskell
interpolateLanguage.Stochaskell
interpPolarLanguage.Stochaskell.Plot
intersectLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectByLanguage.Stochaskell.Prelude, Language.Stochaskell
intersectRectLanguage.Stochaskell.Plot
intersperseLanguage.Stochaskell.Prelude, Language.Stochaskell
IntervalLanguage.Stochaskell
IntTLanguage.Stochaskell.Expression
intTimeLanguage.Stan
invLanguage.Stochaskell
invertLanguage.Stochaskell.Plot
InvGammaLanguage.Stochaskell
invGammaLanguage.Stochaskell
invLinMapLanguage.Stochaskell.Plot
invmapLanguage.Stochaskell.Plot
involutedLanguage.Stochaskell.Plot
IOLanguage.Stochaskell.Prelude, Language.Stochaskell
IOErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
ioverLanguage.Stochaskell.Plot
ipartsOfLanguage.Stochaskell.Plot
ipartsOf'Language.Stochaskell.Plot
ipassingLanguage.Stochaskell.Plot
iplensLanguage.Stochaskell.Plot
ipreLanguage.Stochaskell.Plot
ipreuseLanguage.Stochaskell.Plot
ipreusesLanguage.Stochaskell.Plot
ipreviewLanguage.Stochaskell.Plot
ipreviewsLanguage.Stochaskell.Plot
isDenormalizedLanguage.Stochaskell.Prelude, Language.Stochaskell
isetLanguage.Stochaskell.Plot
isetsLanguage.Stochaskell.Plot
isIEEELanguage.Stochaskell.Prelude, Language.Stochaskell
isInfiniteLanguage.Stochaskell.Prelude, Language.Stochaskell
isInfixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isJustLanguage.Stochaskell.Prelude, Language.Stochaskell
IsListLanguage.Stochaskell
isn'tLanguage.Stochaskell.Plot
isNaNLanguage.Stochaskell.Prelude, Language.Stochaskell
isNegativeZeroLanguage.Stochaskell.Prelude, Language.Stochaskell
isNothingLanguage.Stochaskell.Prelude, Language.Stochaskell
Iso 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
isoLanguage.Stochaskell.Plot
Iso'Language.Stochaskell.Plot
isPrefixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSubsequenceOfLanguage.Stochaskell.Prelude, Language.Stochaskell
isSuffixOfLanguage.Stochaskell.Prelude, Language.Stochaskell
itakingWhileLanguage.Stochaskell.Plot
ItemLanguage.Stochaskell
iterateLanguage.Stochaskell.Prelude, Language.Stochaskell
iterate'Language.Stochaskell.Prelude, Language.Stochaskell
iteratedLanguage.Stochaskell.Plot
iterateLimitLanguage.Stochaskell
itoLanguage.Stochaskell.Plot
itoListLanguage.Stochaskell.Plot
itoListOfLanguage.Stochaskell.Plot
itraverseLanguage.Stochaskell.Plot
itraverseByLanguage.Stochaskell.Plot
itraverseByOfLanguage.Stochaskell.Plot
itraversedLanguage.Stochaskell.Plot
itraverseOfLanguage.Stochaskell.Plot
itraverseOf_Language.Stochaskell.Plot
itraverse_Language.Stochaskell.Plot
iunsafePartsOfLanguage.Stochaskell.Plot
iunsafePartsOf'Language.Stochaskell.Plot
iuseLanguage.Stochaskell.Plot
iusesLanguage.Stochaskell.Plot
iviewLanguage.Stochaskell.Plot
iviewsLanguage.Stochaskell.Plot
ivoryLanguage.Stochaskell.Plot
ixLanguage.Stochaskell.Plot
ixAtLanguage.Stochaskell.Plot
ixColourLanguage.Stochaskell.Plot
ixColourRLanguage.Stochaskell.Plot
IxedLanguage.Stochaskell.Plot
IxValueLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-J.html b/docs/doc/doc-index-J.html index 315e361..8286230 100644 --- a/docs/doc/doc-index-J.html +++ b/docs/doc/doc-index-J.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - J)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - J)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-K.html b/docs/doc/doc-index-K.html index 0ae40d2..d869198 100644 --- a/docs/doc/doc-index-K.html +++ b/docs/doc/doc-index-K.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - K)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - K)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-L.html b/docs/doc/doc-index-L.html index 41b91fe..8f24aac 100644 --- a/docs/doc/doc-index-L.html +++ b/docs/doc/doc-index-L.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - L)

stochaskell-0.1.0: A probabilistic programming language

Index - L

labelLanguage.Stochaskell.Plot
labelBarsLanguage.Stochaskell.Plot
Last 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
lastLanguage.Stochaskell.Prelude, Language.Stochaskell
last1OfLanguage.Stochaskell.Plot
lastOfLanguage.Stochaskell.Plot
lavenderLanguage.Stochaskell.Plot
lavenderblushLanguage.Stochaskell.Plot
lawngreenLanguage.Stochaskell.Plot
laxis_generateLanguage.Stochaskell.Plot
laxis_overrideLanguage.Stochaskell.Plot
laxis_reverseLanguage.Stochaskell.Plot
laxis_styleLanguage.Stochaskell.Plot
laxis_titleLanguage.Stochaskell.Plot
laxis_title_styleLanguage.Stochaskell.Plot
Layout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
LayoutAxis 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
LayoutLR 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
layoutLRToGridLanguage.Stochaskell.Plot
layoutLRToRenderableLanguage.Stochaskell.Plot
layoutlr_all_font_stylesLanguage.Stochaskell.Plot
layoutlr_axes_stylesLanguage.Stochaskell.Plot
layoutlr_axes_title_stylesLanguage.Stochaskell.Plot
layoutlr_backgroundLanguage.Stochaskell.Plot
layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_foregroundLanguage.Stochaskell.Plot
layoutlr_grid_lastLanguage.Stochaskell.Plot
layoutlr_left_axisLanguage.Stochaskell.Plot
layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_legendLanguage.Stochaskell.Plot
layoutlr_marginLanguage.Stochaskell.Plot
layoutlr_plotsLanguage.Stochaskell.Plot
layoutlr_plot_backgroundLanguage.Stochaskell.Plot
layoutlr_right_axisLanguage.Stochaskell.Plot
layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_titleLanguage.Stochaskell.Plot
layoutlr_title_styleLanguage.Stochaskell.Plot
layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_x_axisLanguage.Stochaskell.Plot
LayoutPickLanguage.Stochaskell.Plot
LayoutPick_LegendLanguage.Stochaskell.Plot
LayoutPick_PlotAreaLanguage.Stochaskell.Plot
LayoutPick_TitleLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisTitleLanguage.Stochaskell.Plot
LayoutPick_XTopAxisLanguage.Stochaskell.Plot
LayoutPick_XTopAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YRightAxisLanguage.Stochaskell.Plot
LayoutPick_YRightAxisTitleLanguage.Stochaskell.Plot
layoutToGridLanguage.Stochaskell.Plot
layoutToRenderableLanguage.Stochaskell.Plot
layout_all_font_stylesLanguage.Stochaskell.Plot
layout_axes_stylesLanguage.Stochaskell.Plot
layout_axes_title_stylesLanguage.Stochaskell.Plot
layout_backgroundLanguage.Stochaskell.Plot
layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
layout_foregroundLanguage.Stochaskell.Plot
layout_grid_lastLanguage.Stochaskell.Plot
layout_left_axis_visibilityLanguage.Stochaskell.Plot
layout_legendLanguage.Stochaskell.Plot
layout_marginLanguage.Stochaskell.Plot
layout_plotsLanguage.Stochaskell.Plot
layout_plot_backgroundLanguage.Stochaskell.Plot
layout_right_axis_visibilityLanguage.Stochaskell.Plot
layout_titleLanguage.Stochaskell.Plot
layout_title_styleLanguage.Stochaskell.Plot
layout_top_axis_visibilityLanguage.Stochaskell.Plot
layout_x_axisLanguage.Stochaskell.Plot
layout_y_axisLanguage.Stochaskell.Plot
LazyLanguage.Stochaskell.Plot
lazyLanguage.Stochaskell.Plot
la_labelfLanguage.Stochaskell.Plot
la_nLabelsLanguage.Stochaskell.Plot
la_nTicksLanguage.Stochaskell.Plot
lcmLanguage.Stochaskell.Prelude, Language.Stochaskell
LeftLanguage.Stochaskell.Prelude, Language.Stochaskell
leftLanguage.Stochaskell.Plot
left'Language.Stochaskell.Plot
leftAboveLanguage.Stochaskell.Plot
leftBelowLanguage.Stochaskell.Plot
leftBottomLanguage.Stochaskell.Plot
leftMidLanguage.Stochaskell.Plot
LeftmostLanguage.Stochaskell.Plot
leftTopLanguage.Stochaskell.Plot
legendLanguage.Stochaskell.Plot
LegendAboveLanguage.Stochaskell.Plot
LegendBelowLanguage.Stochaskell.Plot
legendEntriesLanguage.Stochaskell.Plot
LegendEntryLanguage.Stochaskell.Plot
legendGapLanguage.Stochaskell.Plot
LegendLeftLanguage.Stochaskell.Plot
LegendOrientationLanguage.Stochaskell.Plot
legendOrientationLanguage.Stochaskell.Plot
LegendPicLanguage.Stochaskell.Plot
legendPictureLanguage.Stochaskell.Plot
legendPlacementLanguage.Stochaskell.Plot
LegendPositionLanguage.Stochaskell.Plot
legendPrecedenceLanguage.Stochaskell.Plot
LegendRightLanguage.Stochaskell.Plot
legendSpacingLanguage.Stochaskell.Plot
LegendStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
legendStyleLanguage.Stochaskell.Plot
legendTextLanguage.Stochaskell.Plot
legendTextFunctionLanguage.Stochaskell.Plot
legendTextStyleLanguage.Stochaskell.Plot
legendTextWidthLanguage.Stochaskell.Plot
legendToRenderableLanguage.Stochaskell.Plot
legend_label_styleLanguage.Stochaskell.Plot
legend_marginLanguage.Stochaskell.Plot
legend_orientationLanguage.Stochaskell.Plot
legend_plot_sizeLanguage.Stochaskell.Plot
legend_positionLanguage.Stochaskell.Plot
lemonchiffonLanguage.Stochaskell.Plot
lengthLanguage.Stochaskell.Prelude, Language.Stochaskell
lengthOfLanguage.Stochaskell.Plot
Lens 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lensLanguage.Stochaskell.Plot
Lens'Language.Stochaskell.Plot
lensClassLanguage.Stochaskell.Plot
lensFieldLanguage.Stochaskell.Plot
LensLikeLanguage.Stochaskell.Plot
LensLike'Language.Stochaskell.Plot
LensRulesLanguage.Stochaskell.Plot
lensRulesLanguage.Stochaskell.Plot
lensRulesForLanguage.Stochaskell.Plot
LevelLanguage.Stochaskell.Plot
levelsLanguage.Stochaskell.Plot
lexLanguage.Stochaskell.Prelude, Language.Stochaskell
liftCStateLanguage.Stochaskell.Plot
liftECLanguage.Stochaskell.Plot
liftedLanguage.Stochaskell.Plot
liftMLanguage.Stochaskell.Prelude, Language.Stochaskell
liftM2Language.Stochaskell.Prelude, Language.Stochaskell
liftM3Language.Stochaskell.Prelude, Language.Stochaskell
liftM4Language.Stochaskell.Prelude, Language.Stochaskell
liftM5Language.Stochaskell.Prelude, Language.Stochaskell
lightblueLanguage.Stochaskell.Plot
lightcoralLanguage.Stochaskell.Plot
lightcyanLanguage.Stochaskell.Plot
lightgoldenrodyellowLanguage.Stochaskell.Plot
lightgrayLanguage.Stochaskell.Plot
lightgreenLanguage.Stochaskell.Plot
lightgreyLanguage.Stochaskell.Plot
lightpinkLanguage.Stochaskell.Plot
lightsalmonLanguage.Stochaskell.Plot
lightseagreenLanguage.Stochaskell.Plot
lightskyblueLanguage.Stochaskell.Plot
lightslategrayLanguage.Stochaskell.Plot
lightslategreyLanguage.Stochaskell.Plot
lightsteelblueLanguage.Stochaskell.Plot
lightyellowLanguage.Stochaskell.Plot
likeLanguage.Stochaskell.Plot
limeLanguage.Stochaskell.Plot
limegreenLanguage.Stochaskell.Plot
LimitLanguage.Stochaskell.Plot
lineLanguage.Stochaskell.Plot
LinearAxisLanguage.Stochaskell.Plot
LinearAxisParams 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
linearMajorTicksLanguage.Stochaskell.Plot
LinearOperatorLanguage.Stochaskell
LineCapLanguage.Stochaskell.Plot
LineCapButtLanguage.Stochaskell.Plot
LineCapRoundLanguage.Stochaskell.Plot
LineCapSquareLanguage.Stochaskell.Plot
linedLanguage.Stochaskell.Plot
LineJoinLanguage.Stochaskell.Plot
LineJoinBevelLanguage.Stochaskell.Plot
LineJoinMiterLanguage.Stochaskell.Plot
LineJoinRoundLanguage.Stochaskell.Plot
lineMarkersLanguage.Stochaskell.Plot
linenLanguage.Stochaskell.Plot
linePlotLanguage.Stochaskell.Plot
linePlot'Language.Stochaskell.Plot
linesLanguage.Stochaskell.Prelude, Language.Stochaskell
LineStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lineStyleLanguage.Stochaskell.Plot
lineStyleFunctionLanguage.Stochaskell.Plot
LineToLanguage.Stochaskell.Plot
lineToLanguage.Stochaskell.Plot
lineTo'Language.Stochaskell.Plot
line_capLanguage.Stochaskell.Plot
line_colorLanguage.Stochaskell.Plot
line_dashesLanguage.Stochaskell.Plot
line_joinLanguage.Stochaskell.Plot
line_widthLanguage.Stochaskell.Plot
linMapLanguage.Stochaskell.Plot
linspaceLanguage.Stochaskell
ListLanguage.Stochaskell.Plot
listLanguage.Stochaskell
listeningLanguage.Stochaskell.Plot
listeningsLanguage.Stochaskell.Plot
listToMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
LKJLanguage.Stochaskell
lmapLanguage.Stochaskell.Plot
lmappingLanguage.Stochaskell.Plot
LMaxLanguage.Stochaskell.Plot
LMinLanguage.Stochaskell.Plot
lociLanguage.Stochaskell.Plot
LOColsLanguage.Stochaskell.Plot
locusLanguage.Stochaskell.Plot
logLanguage.Stochaskell.Prelude, Language.Stochaskell
LogAxisLanguage.Stochaskell.Plot
LogAxisParams 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
loga_labelfLanguage.Stochaskell.Plot
logBaseLanguage.Stochaskell.Prelude, Language.Stochaskell
logDeformLanguage.Stochaskell.Plot
logDetLanguage.Stochaskell
logMajorTicksLanguage.Stochaskell.Plot
lognormalLanguage.Stochaskell
logNumberLanguage.Stochaskell.Plot
logPointLanguage.Stochaskell.Plot
LogScaleLanguage.Stochaskell.Plot
logScaleLanguage.Stochaskell.Plot
LogValue 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lookingupNamerLanguage.Stochaskell.Plot
lookupLanguage.Stochaskell.Prelude, Language.Stochaskell
lookupOfLanguage.Stochaskell.Plot
loopLanguage.Stochaskell
LORowsLanguage.Stochaskell.Plot
LowerAxisLabelLanguage.Stochaskell.Plot
lpdfLanguage.Stochaskell
lpdfAuxLanguage.Stochaskell
lpdfDiscreteUniformLanguage.Stochaskell
lpdfGammaLanguage.Stochaskell
lpdfNegBinomialLanguage.Stochaskell
lpdfNormalLanguage.Stochaskell
lpdfPoissonLanguage.Stochaskell
lpdfUniformLanguage.Stochaskell
LTLanguage.Stochaskell.Prelude, Language.Stochaskell
LValLanguage.Stochaskell.Expression
LValueLanguage.Stochaskell.Plot
LVarLanguage.Stochaskell.Expression
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - L)

stochaskell-1.0.0: A probabilistic programming language

Index - L

labelLanguage.Stochaskell.Plot
labelBarsLanguage.Stochaskell.Plot
Last 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
lastLanguage.Stochaskell.Prelude, Language.Stochaskell
last1OfLanguage.Stochaskell.Plot
lastOfLanguage.Stochaskell.Plot
lavenderLanguage.Stochaskell.Plot
lavenderblushLanguage.Stochaskell.Plot
lawngreenLanguage.Stochaskell.Plot
laxis_generateLanguage.Stochaskell.Plot
laxis_overrideLanguage.Stochaskell.Plot
laxis_reverseLanguage.Stochaskell.Plot
laxis_styleLanguage.Stochaskell.Plot
laxis_titleLanguage.Stochaskell.Plot
laxis_title_styleLanguage.Stochaskell.Plot
Layout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
LayoutAxis 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
LayoutLR 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
layoutLRToGridLanguage.Stochaskell.Plot
layoutLRToRenderableLanguage.Stochaskell.Plot
layoutlr_all_font_stylesLanguage.Stochaskell.Plot
layoutlr_axes_stylesLanguage.Stochaskell.Plot
layoutlr_axes_title_stylesLanguage.Stochaskell.Plot
layoutlr_backgroundLanguage.Stochaskell.Plot
layoutlr_bottom_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_foregroundLanguage.Stochaskell.Plot
layoutlr_grid_lastLanguage.Stochaskell.Plot
layoutlr_left_axisLanguage.Stochaskell.Plot
layoutlr_left_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_legendLanguage.Stochaskell.Plot
layoutlr_marginLanguage.Stochaskell.Plot
layoutlr_plotsLanguage.Stochaskell.Plot
layoutlr_plot_backgroundLanguage.Stochaskell.Plot
layoutlr_right_axisLanguage.Stochaskell.Plot
layoutlr_right_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_titleLanguage.Stochaskell.Plot
layoutlr_title_styleLanguage.Stochaskell.Plot
layoutlr_top_axis_visibilityLanguage.Stochaskell.Plot
layoutlr_x_axisLanguage.Stochaskell.Plot
LayoutPickLanguage.Stochaskell.Plot
LayoutPick_LegendLanguage.Stochaskell.Plot
LayoutPick_PlotAreaLanguage.Stochaskell.Plot
LayoutPick_TitleLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisLanguage.Stochaskell.Plot
LayoutPick_XBottomAxisTitleLanguage.Stochaskell.Plot
LayoutPick_XTopAxisLanguage.Stochaskell.Plot
LayoutPick_XTopAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisLanguage.Stochaskell.Plot
LayoutPick_YLeftAxisTitleLanguage.Stochaskell.Plot
LayoutPick_YRightAxisLanguage.Stochaskell.Plot
LayoutPick_YRightAxisTitleLanguage.Stochaskell.Plot
layoutToGridLanguage.Stochaskell.Plot
layoutToRenderableLanguage.Stochaskell.Plot
layout_all_font_stylesLanguage.Stochaskell.Plot
layout_axes_stylesLanguage.Stochaskell.Plot
layout_axes_title_stylesLanguage.Stochaskell.Plot
layout_backgroundLanguage.Stochaskell.Plot
layout_bottom_axis_visibilityLanguage.Stochaskell.Plot
layout_foregroundLanguage.Stochaskell.Plot
layout_grid_lastLanguage.Stochaskell.Plot
layout_left_axis_visibilityLanguage.Stochaskell.Plot
layout_legendLanguage.Stochaskell.Plot
layout_marginLanguage.Stochaskell.Plot
layout_plotsLanguage.Stochaskell.Plot
layout_plot_backgroundLanguage.Stochaskell.Plot
layout_right_axis_visibilityLanguage.Stochaskell.Plot
layout_titleLanguage.Stochaskell.Plot
layout_title_styleLanguage.Stochaskell.Plot
layout_top_axis_visibilityLanguage.Stochaskell.Plot
layout_x_axisLanguage.Stochaskell.Plot
layout_y_axisLanguage.Stochaskell.Plot
LazyLanguage.Stochaskell.Plot
lazyLanguage.Stochaskell.Plot
la_labelfLanguage.Stochaskell.Plot
la_nLabelsLanguage.Stochaskell.Plot
la_nTicksLanguage.Stochaskell.Plot
lcmLanguage.Stochaskell.Prelude, Language.Stochaskell
LeftLanguage.Stochaskell.Prelude, Language.Stochaskell
leftLanguage.Stochaskell.Plot
left'Language.Stochaskell.Plot
leftAboveLanguage.Stochaskell.Plot
leftBelowLanguage.Stochaskell.Plot
leftBottomLanguage.Stochaskell.Plot
leftMidLanguage.Stochaskell.Plot
LeftmostLanguage.Stochaskell.Plot
leftTopLanguage.Stochaskell.Plot
legendLanguage.Stochaskell.Plot
LegendAboveLanguage.Stochaskell.Plot
LegendBelowLanguage.Stochaskell.Plot
legendEntriesLanguage.Stochaskell.Plot
LegendEntryLanguage.Stochaskell.Plot
legendGapLanguage.Stochaskell.Plot
LegendLeftLanguage.Stochaskell.Plot
LegendOrientationLanguage.Stochaskell.Plot
legendOrientationLanguage.Stochaskell.Plot
LegendPicLanguage.Stochaskell.Plot
legendPictureLanguage.Stochaskell.Plot
legendPlacementLanguage.Stochaskell.Plot
LegendPositionLanguage.Stochaskell.Plot
legendPrecedenceLanguage.Stochaskell.Plot
LegendRightLanguage.Stochaskell.Plot
legendSpacingLanguage.Stochaskell.Plot
LegendStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
legendStyleLanguage.Stochaskell.Plot
legendTextLanguage.Stochaskell.Plot
legendTextFunctionLanguage.Stochaskell.Plot
legendTextStyleLanguage.Stochaskell.Plot
legendTextWidthLanguage.Stochaskell.Plot
legendToRenderableLanguage.Stochaskell.Plot
legend_label_styleLanguage.Stochaskell.Plot
legend_marginLanguage.Stochaskell.Plot
legend_orientationLanguage.Stochaskell.Plot
legend_plot_sizeLanguage.Stochaskell.Plot
legend_positionLanguage.Stochaskell.Plot
lemonchiffonLanguage.Stochaskell.Plot
lengthLanguage.Stochaskell.Prelude, Language.Stochaskell
lengthOfLanguage.Stochaskell.Plot
Lens 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
lensLanguage.Stochaskell.Plot
Lens'Language.Stochaskell.Plot
lensClassLanguage.Stochaskell.Plot
lensFieldLanguage.Stochaskell.Plot
LensLikeLanguage.Stochaskell.Plot
LensLike'Language.Stochaskell.Plot
LensRulesLanguage.Stochaskell.Plot
lensRulesLanguage.Stochaskell.Plot
lensRulesForLanguage.Stochaskell.Plot
LevelLanguage.Stochaskell.Plot
levelsLanguage.Stochaskell.Plot
lexLanguage.Stochaskell.Prelude, Language.Stochaskell
liftCStateLanguage.Stochaskell.Plot
liftECLanguage.Stochaskell.Plot
liftedLanguage.Stochaskell.Plot
liftMLanguage.Stochaskell.Prelude, Language.Stochaskell
liftM2Language.Stochaskell.Prelude, Language.Stochaskell
liftM3Language.Stochaskell.Prelude, Language.Stochaskell
liftM4Language.Stochaskell.Prelude, Language.Stochaskell
liftM5Language.Stochaskell.Prelude, Language.Stochaskell
lightblueLanguage.Stochaskell.Plot
lightcoralLanguage.Stochaskell.Plot
lightcyanLanguage.Stochaskell.Plot
lightgoldenrodyellowLanguage.Stochaskell.Plot
lightgrayLanguage.Stochaskell.Plot
lightgreenLanguage.Stochaskell.Plot
lightgreyLanguage.Stochaskell.Plot
lightpinkLanguage.Stochaskell.Plot
lightsalmonLanguage.Stochaskell.Plot
lightseagreenLanguage.Stochaskell.Plot
lightskyblueLanguage.Stochaskell.Plot
lightslategrayLanguage.Stochaskell.Plot
lightslategreyLanguage.Stochaskell.Plot
lightsteelblueLanguage.Stochaskell.Plot
lightyellowLanguage.Stochaskell.Plot
likeLanguage.Stochaskell.Plot
limeLanguage.Stochaskell.Plot
limegreenLanguage.Stochaskell.Plot
LimitLanguage.Stochaskell.Plot
lineLanguage.Stochaskell.Plot
LinearAxisLanguage.Stochaskell.Plot
LinearAxisParams 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
linearMajorTicksLanguage.Stochaskell.Plot
LinearOperatorLanguage.Stochaskell
LineCapLanguage.Stochaskell.Plot
LineCapButtLanguage.Stochaskell.Plot
LineCapRoundLanguage.Stochaskell.Plot
LineCapSquareLanguage.Stochaskell.Plot
linedLanguage.Stochaskell.Plot
LineJoinLanguage.Stochaskell.Plot
LineJoinBevelLanguage.Stochaskell.Plot
LineJoinMiterLanguage.Stochaskell.Plot
LineJoinRoundLanguage.Stochaskell.Plot
lineMarkersLanguage.Stochaskell.Plot
linenLanguage.Stochaskell.Plot
linePlotLanguage.Stochaskell.Plot
linePlot'Language.Stochaskell.Plot
linesLanguage.Stochaskell.Prelude, Language.Stochaskell
LineStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lineStyleLanguage.Stochaskell.Plot
lineStyleFunctionLanguage.Stochaskell.Plot
LineToLanguage.Stochaskell.Plot
lineToLanguage.Stochaskell.Plot
lineTo'Language.Stochaskell.Plot
line_capLanguage.Stochaskell.Plot
line_colorLanguage.Stochaskell.Plot
line_dashesLanguage.Stochaskell.Plot
line_joinLanguage.Stochaskell.Plot
line_widthLanguage.Stochaskell.Plot
linMapLanguage.Stochaskell.Plot
linspaceLanguage.Stochaskell
ListLanguage.Stochaskell.Plot
listLanguage.Stochaskell
listeningLanguage.Stochaskell.Plot
listeningsLanguage.Stochaskell.Plot
listToMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
LKJLanguage.Stochaskell
lmapLanguage.Stochaskell.Plot
lmappingLanguage.Stochaskell.Plot
LMaxLanguage.Stochaskell.Plot
LMinLanguage.Stochaskell.Plot
locallyLanguage.Stochaskell.Plot
lociLanguage.Stochaskell.Plot
LOColsLanguage.Stochaskell.Plot
locusLanguage.Stochaskell.Plot
logLanguage.Stochaskell.Prelude, Language.Stochaskell
LogAxisLanguage.Stochaskell.Plot
LogAxisParams 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
loga_labelfLanguage.Stochaskell.Plot
logBaseLanguage.Stochaskell.Prelude, Language.Stochaskell
logDeformLanguage.Stochaskell.Plot
logDetLanguage.Stochaskell
logFactorial'Language.Stochaskell
logFromLogFloatLanguage.Stochaskell
LogisticLanguage.Stochaskell
logisticLanguage.Stochaskell
logMajorTicksLanguage.Stochaskell.Plot
lognormalLanguage.Stochaskell
logNumberLanguage.Stochaskell.Plot
logPointLanguage.Stochaskell.Plot
LogScaleLanguage.Stochaskell.Plot
logScaleLanguage.Stochaskell.Plot
LogValue 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
lookingupNamerLanguage.Stochaskell.Plot
lookupLanguage.Stochaskell.Prelude, Language.Stochaskell
lookupOfLanguage.Stochaskell.Plot
loopLanguage.Stochaskell
LORowsLanguage.Stochaskell.Plot
LowerAxisLabelLanguage.Stochaskell.Plot
lpdfLanguage.Stochaskell
lpdfAuxLanguage.Stochaskell
lpdfAuxCLanguage.Stochaskell
lpdfCondLanguage.Stochaskell
lpdfDiscreteUniformLanguage.Stochaskell
lpdfGammaLanguage.Stochaskell
lpdfNegBinomialLanguage.Stochaskell
lpdfNormalLanguage.Stochaskell
lpdfPoissonLanguage.Stochaskell
lpdfUniformLanguage.Stochaskell
LTLanguage.Stochaskell.Prelude, Language.Stochaskell
LValLanguage.Stochaskell.Expression
LValueLanguage.Stochaskell.Plot
LVarLanguage.Stochaskell.Expression
\ No newline at end of file diff --git a/docs/doc/doc-index-M.html b/docs/doc/doc-index-M.html index d379928..3afe8e9 100644 --- a/docs/doc/doc-index-M.html +++ b/docs/doc/doc-index-M.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - M)

stochaskell-0.1.0: A probabilistic programming language

Index - M

magentaLanguage.Stochaskell.Plot
MagmaLanguage.Stochaskell.Plot
MagnifiedLanguage.Stochaskell.Plot
MagnifyLanguage.Stochaskell.Plot
magnifyLanguage.Stochaskell.Plot
MajorGridLinesLanguage.Stochaskell.Plot
majorGridLinesLanguage.Stochaskell.Plot
majorGridLinesFunctionLanguage.Stochaskell.Plot
majorGridLinesStyleLanguage.Stochaskell.Plot
majorTickPositionsLanguage.Stochaskell.Plot
MajorTicksLanguage.Stochaskell.Plot
majorTicksLanguage.Stochaskell.Plot
majorTicksAlignmentLanguage.Stochaskell.Plot
majorTicksFunctionLanguage.Stochaskell.Plot
majorTicksHelperLanguage.Stochaskell.Plot
majorTicksLengthLanguage.Stochaskell.Plot
majorTicksStyleLanguage.Stochaskell.Plot
makeAxisLanguage.Stochaskell.Plot
makeAxis'Language.Stochaskell.Plot
makeClassyLanguage.Stochaskell.Plot
makeClassyForLanguage.Stochaskell.Plot
makeClassyPrismsLanguage.Stochaskell.Plot
makeClassy_Language.Stochaskell.Plot
makeFieldsLanguage.Stochaskell.Plot
makeFieldsNoPrefixLanguage.Stochaskell.Plot
makeLensesLanguage.Stochaskell.Plot
makeLensesForLanguage.Stochaskell.Plot
makeLensesWithLanguage.Stochaskell.Plot
makeLinesExplicitLanguage.Stochaskell.Plot
makePrismsLanguage.Stochaskell.Plot
makeWrappedLanguage.Stochaskell.Plot
mapLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLOfLanguage.Stochaskell.Plot
mapAccumRLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumROfLanguage.Stochaskell.Plot
mapAndUnzipMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapEqLanguage.Stochaskell.Plot
mapMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybePickFnLanguage.Stochaskell.Plot
mapMOfLanguage.Stochaskell.Plot
mapMOf_Language.Stochaskell.Plot
mapM_Language.Stochaskell.Prelude, Language.Stochaskell
mapOfLanguage.Stochaskell.Plot
mappedLanguage.Stochaskell.Plot
mappendLanguage.Stochaskell.Prelude, Language.Stochaskell
mapPickFnLanguage.Stochaskell.Plot
mappingLanguage.Stochaskell.Plot
mappingNamerLanguage.Stochaskell.Plot
mapXYLanguage.Stochaskell.Plot
markerStyleLanguage.Stochaskell.Plot
markerStyleFunctionLanguage.Stochaskell.Plot
maroonLanguage.Stochaskell.Plot
matchingLanguage.Stochaskell.Plot
Matrix 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
3 (Type/Class)Language.Stochaskell
matrixLanguage.Stochaskell
matrixColsLanguage.Stochaskell
matrixRowsLanguage.Stochaskell
matTLanguage.Stochaskell.Expression
maxLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
maxDepthLanguage.Stan
maximumLanguage.Stochaskell.Prelude, Language.Stochaskell
maximum1OfLanguage.Stochaskell.Plot
maximumByLanguage.Stochaskell.Prelude, Language.Stochaskell
maximumByOfLanguage.Stochaskell.Plot
maximumOfLanguage.Stochaskell.Plot
MAxisFnLanguage.Stochaskell.Plot
MaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeToEitherLanguage.Stochaskell
maybeToListLanguage.Stochaskell.Prelude, Language.Stochaskell
mconcatLanguage.Stochaskell.Prelude, Language.Stochaskell
meanLanguage.Stochaskell
mediumaquamarineLanguage.Stochaskell.Plot
mediumblueLanguage.Stochaskell.Plot
mediumorchidLanguage.Stochaskell.Plot
mediumpurpleLanguage.Stochaskell.Plot
mediumseagreenLanguage.Stochaskell.Plot
mediumslateblueLanguage.Stochaskell.Plot
mediumspringgreenLanguage.Stochaskell.Plot
mediumturquoiseLanguage.Stochaskell.Plot
mediumvioletredLanguage.Stochaskell.Plot
memptyLanguage.Stochaskell.Prelude, Language.Stochaskell
mergeLanguage.Stochaskell
mergeByLanguage.Stochaskell
MethodNameLanguage.Stochaskell.Plot
MetropolisLanguage.PyMC3
mfilterLanguage.Stochaskell.Prelude, Language.Stochaskell
mhLanguage.Stochaskell
mh'Language.Stochaskell
mhChurchLanguage.Church
mhRatioLanguage.Stochaskell
midAboveLanguage.Stochaskell.Plot
midBelowLanguage.Stochaskell.Plot
MiddleAxisLabelLanguage.Stochaskell.Plot
midnightblueLanguage.Stochaskell.Plot
minLanguage.Stochaskell.Prelude, Language.Stochaskell
min'Language.Stochaskell
minBLanguage.Stochaskell.Prelude, Language.Stochaskell
minBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumLanguage.Stochaskell.Prelude, Language.Stochaskell
minimum1OfLanguage.Stochaskell.Plot
minimumByLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumByOfLanguage.Stochaskell.Plot
minimumOfLanguage.Stochaskell.Plot
MinorGridLinesLanguage.Stochaskell.Plot
minorGridLinesLanguage.Stochaskell.Plot
minorGridLinesFunctionLanguage.Stochaskell.Plot
minorGridLinesStyleLanguage.Stochaskell.Plot
minorTickPositionsLanguage.Stochaskell.Plot
MinorTicksLanguage.Stochaskell.Plot
minorTicksLanguage.Stochaskell.Plot
minorTicksAlignmentLanguage.Stochaskell.Plot
minorTicksFunctionLanguage.Stochaskell.Plot
minorTicksHelperLanguage.Stochaskell.Plot
minorTicksLengthLanguage.Stochaskell.Plot
minorTicksStyleLanguage.Stochaskell.Plot
minsizeLanguage.Stochaskell.Plot
mintcreamLanguage.Stochaskell.Plot
mistyroseLanguage.Stochaskell.Plot
mixtureLanguage.Stochaskell
mixture'Language.Stochaskell
mkBarsLanguage.Stochaskell.Plot
mkComputedHistogramLanguage.Stochaskell.Plot
mkFloatingBarsLanguage.Stochaskell.Plot
mkGroupedBarsLanguage.Stochaskell.Plot
mkHeatMapLanguage.Stochaskell.Plot
mkHeatMatrixLanguage.Stochaskell.Plot
mkHeatMatrix'Language.Stochaskell.Plot
mkHistogramPlotLanguage.Stochaskell.Plot
mkLegendEntryLanguage.Stochaskell.Plot
mkPathLanguage.Stochaskell.Plot
mkPathOfLanguage.Stochaskell.Plot
mkPlotLanguage.Stochaskell.Plot
mkPolarLanguage.Stochaskell.Plot
mkrectLanguage.Stochaskell.Plot
mkRunningBarsLanguage.Stochaskell.Plot
mkScatterOptionsLanguage.Stochaskell.Plot
mkStackedBarsLanguage.Stochaskell.Plot
mkStackedEqualBarsLanguage.Stochaskell.Plot
mkTrailLanguage.Stochaskell.Plot
mkTrailOfLanguage.Stochaskell.Plot
mkWedgeLanguage.Stochaskell.Plot
moccasinLanguage.Stochaskell.Plot
modLanguage.Stochaskell.Prelude, Language.Stochaskell
modifyingLanguage.Stochaskell.Plot
MonadLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadGuardLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadPlusLanguage.Stochaskell.Prelude, Language.Stochaskell
MonoidLanguage.Stochaskell.Prelude, Language.Stochaskell
monthsLanguage.Stochaskell.Plot
MoveToLanguage.Stochaskell.Plot
moveToLanguage.Stochaskell.Plot
moveTo'Language.Stochaskell.Plot
mplusLanguage.Stochaskell.Prelude, Language.Stochaskell
msumLanguage.Stochaskell.Prelude, Language.Stochaskell
msumOfLanguage.Stochaskell.Plot
multiBarsLanguage.Stochaskell.Plot
MultiBarStateLanguage.Stochaskell.Plot
mzeroLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - M)

stochaskell-1.0.0: A probabilistic programming language

Index - M

magentaLanguage.Stochaskell.Plot
MagmaLanguage.Stochaskell.Plot
MagnifiedLanguage.Stochaskell.Plot
MagnifyLanguage.Stochaskell.Plot
magnifyLanguage.Stochaskell.Plot
MajorGridLinesLanguage.Stochaskell.Plot
majorGridLinesLanguage.Stochaskell.Plot
majorGridLinesFunctionLanguage.Stochaskell.Plot
majorGridLinesStyleLanguage.Stochaskell.Plot
majorTickPositionsLanguage.Stochaskell.Plot
MajorTicksLanguage.Stochaskell.Plot
majorTicksLanguage.Stochaskell.Plot
majorTicksAlignmentLanguage.Stochaskell.Plot
majorTicksFunctionLanguage.Stochaskell.Plot
majorTicksHelperLanguage.Stochaskell.Plot
majorTicksLengthLanguage.Stochaskell.Plot
majorTicksStyleLanguage.Stochaskell.Plot
makeAxisLanguage.Stochaskell.Plot
makeAxis'Language.Stochaskell.Plot
makeClassyLanguage.Stochaskell.Plot
makeClassyForLanguage.Stochaskell.Plot
makeClassyPrismsLanguage.Stochaskell.Plot
makeClassy_Language.Stochaskell.Plot
makeFieldsLanguage.Stochaskell.Plot
makeFieldsNoPrefixLanguage.Stochaskell.Plot
makeLensesLanguage.Stochaskell.Plot
makeLensesForLanguage.Stochaskell.Plot
makeLensesWithLanguage.Stochaskell.Plot
makeLinesExplicitLanguage.Stochaskell.Plot
makePrismsLanguage.Stochaskell.Plot
makeWrappedLanguage.Stochaskell.Plot
mapLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumLOfLanguage.Stochaskell.Plot
mapAccumRLanguage.Stochaskell.Prelude, Language.Stochaskell
mapAccumROfLanguage.Stochaskell.Plot
mapAndUnzipMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapEqLanguage.Stochaskell.Plot
mapMLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
mapMaybePickFnLanguage.Stochaskell.Plot
mapMOfLanguage.Stochaskell.Plot
mapMOf_Language.Stochaskell.Plot
mapM_Language.Stochaskell.Prelude, Language.Stochaskell
mapOfLanguage.Stochaskell.Plot
mappedLanguage.Stochaskell.Plot
mappendLanguage.Stochaskell.Prelude, Language.Stochaskell
mapPickFnLanguage.Stochaskell.Plot
mappingLanguage.Stochaskell.Plot
mappingNamerLanguage.Stochaskell.Plot
mapXYLanguage.Stochaskell.Plot
markerStyleLanguage.Stochaskell.Plot
markerStyleFunctionLanguage.Stochaskell.Plot
maroonLanguage.Stochaskell.Plot
matchingLanguage.Stochaskell.Plot
Matrix 
1 (Type/Class)Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Plot
3 (Data Constructor)Language.Stochaskell.Plot
matrixLanguage.Stochaskell
matrixColsLanguage.Stochaskell
matrixRowsLanguage.Stochaskell
matTLanguage.Stochaskell.Expression
maxLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBLanguage.Stochaskell.Prelude, Language.Stochaskell
maxBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
maxDepthLanguage.Stan
maximumLanguage.Stochaskell.Prelude, Language.Stochaskell
maximum1OfLanguage.Stochaskell.Plot
maximumByLanguage.Stochaskell.Prelude, Language.Stochaskell
maximumByOfLanguage.Stochaskell.Plot
maximumOfLanguage.Stochaskell.Plot
MAxisFnLanguage.Stochaskell.Plot
MaybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeLanguage.Stochaskell.Prelude, Language.Stochaskell
maybeToEitherLanguage.Stochaskell
maybeToListLanguage.Stochaskell.Prelude, Language.Stochaskell
mconcatLanguage.Stochaskell.Prelude, Language.Stochaskell
meanLanguage.Stochaskell
mediumaquamarineLanguage.Stochaskell.Plot
mediumblueLanguage.Stochaskell.Plot
mediumorchidLanguage.Stochaskell.Plot
mediumpurpleLanguage.Stochaskell.Plot
mediumseagreenLanguage.Stochaskell.Plot
mediumslateblueLanguage.Stochaskell.Plot
mediumspringgreenLanguage.Stochaskell.Plot
mediumturquoiseLanguage.Stochaskell.Plot
mediumvioletredLanguage.Stochaskell.Plot
memptyLanguage.Stochaskell.Prelude, Language.Stochaskell
mergeLanguage.Stochaskell
mergeByLanguage.Stochaskell
MethodNameLanguage.Stochaskell.Plot
MetropolisLanguage.PyMC3
mfilterLanguage.Stochaskell.Prelude, Language.Stochaskell
mhChurchLanguage.Church
midAboveLanguage.Stochaskell.Plot
midBelowLanguage.Stochaskell.Plot
MiddleAxisLabelLanguage.Stochaskell.Plot
midnightblueLanguage.Stochaskell.Plot
minLanguage.Stochaskell.Prelude, Language.Stochaskell
min'Language.Stochaskell
minBLanguage.Stochaskell.Prelude, Language.Stochaskell
minBoundLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumLanguage.Stochaskell.Prelude, Language.Stochaskell
minimum1OfLanguage.Stochaskell.Plot
minimumByLanguage.Stochaskell.Prelude, Language.Stochaskell
minimumByOfLanguage.Stochaskell.Plot
minimumOfLanguage.Stochaskell.Plot
MinorGridLinesLanguage.Stochaskell.Plot
minorGridLinesLanguage.Stochaskell.Plot
minorGridLinesFunctionLanguage.Stochaskell.Plot
minorGridLinesStyleLanguage.Stochaskell.Plot
minorTickPositionsLanguage.Stochaskell.Plot
MinorTicksLanguage.Stochaskell.Plot
minorTicksLanguage.Stochaskell.Plot
minorTicksAlignmentLanguage.Stochaskell.Plot
minorTicksFunctionLanguage.Stochaskell.Plot
minorTicksHelperLanguage.Stochaskell.Plot
minorTicksLengthLanguage.Stochaskell.Plot
minorTicksStyleLanguage.Stochaskell.Plot
minsizeLanguage.Stochaskell.Plot
mintcreamLanguage.Stochaskell.Plot
mistyroseLanguage.Stochaskell.Plot
mixtureLanguage.Stochaskell
mixture'Language.Stochaskell
mkBarsLanguage.Stochaskell.Plot
mkComputedHistogramLanguage.Stochaskell.Plot
mkFloatingBarsLanguage.Stochaskell.Plot
mkGroupedBarsLanguage.Stochaskell.Plot
mkHeatMapLanguage.Stochaskell.Plot
mkHeatMatrixLanguage.Stochaskell.Plot
mkHeatMatrix'Language.Stochaskell.Plot
mkHistogramPlotLanguage.Stochaskell.Plot
mkLegendEntryLanguage.Stochaskell.Plot
mkPathLanguage.Stochaskell.Plot
mkPathOfLanguage.Stochaskell.Plot
mkPlotLanguage.Stochaskell.Plot
mkPolarLanguage.Stochaskell.Plot
mkrectLanguage.Stochaskell.Plot
mkRunningBarsLanguage.Stochaskell.Plot
mkScatterOptionsLanguage.Stochaskell.Plot
mkStackedBarsLanguage.Stochaskell.Plot
mkStackedEqualBarsLanguage.Stochaskell.Plot
mkTrailLanguage.Stochaskell.Plot
mkTrailOfLanguage.Stochaskell.Plot
mkWedgeLanguage.Stochaskell.Plot
moccasinLanguage.Stochaskell.Plot
modLanguage.Stochaskell.Prelude, Language.Stochaskell
modifyingLanguage.Stochaskell.Plot
MonadLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadGuardLanguage.Stochaskell.Prelude, Language.Stochaskell
MonadPlusLanguage.Stochaskell.Prelude, Language.Stochaskell
MonoidLanguage.Stochaskell.Prelude, Language.Stochaskell
monthsLanguage.Stochaskell.Plot
MoveToLanguage.Stochaskell.Plot
moveToLanguage.Stochaskell.Plot
moveTo'Language.Stochaskell.Plot
mplusLanguage.Stochaskell.Prelude, Language.Stochaskell
msumLanguage.Stochaskell.Prelude, Language.Stochaskell
msumOfLanguage.Stochaskell.Plot
multiBarsLanguage.Stochaskell.Plot
MultiBarStateLanguage.Stochaskell.Plot
mzeroLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-N.html b/docs/doc/doc-index-N.html index 26dc92b..9f30326 100644 --- a/docs/doc/doc-index-N.html +++ b/docs/doc/doc-index-N.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - N)

stochaskell-0.1.0: A probabilistic programming language

Index - N

namedBarPlotLanguage.Stochaskell.Plot
namedBarPlot'Language.Stochaskell.Plot
navajowhiteLanguage.Stochaskell.Plot
navyLanguage.Stochaskell.Plot
nearlyLanguage.Stochaskell.Plot
negateLanguage.Stochaskell.Prelude, Language.Stochaskell
negativeInfinityLanguage.Stochaskell
NegBinomialLanguage.Stochaskell
negBinomialLanguage.Stochaskell
NodeRefLanguage.Stochaskell.Expression
noExtendLanguage.Stochaskell.Plot
nonLanguage.Stochaskell.Plot
non'Language.Stochaskell.Plot
noneLanguage.Stochaskell.Plot
noneOfLanguage.Stochaskell.Plot
NormalLanguage.Stochaskell
normalLanguage.Stochaskell
normalCholLanguage.Stochaskell
normalCondLanguage.Stochaskell
NormalisationMethodLanguage.Stochaskell.Plot
normaliseSampleLanguage.Stochaskell.Plot
NormalsLanguage.Stochaskell
normalsLanguage.Stochaskell
normalsCholLanguage.Stochaskell
NoScaleLanguage.Stochaskell.Plot
notLanguage.Stochaskell.Prelude, Language.Stochaskell
notANumberLanguage.Stochaskell
notBLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemOfLanguage.Stochaskell.Plot
NothingLanguage.Stochaskell.Prelude, Language.Stochaskell
notNullOfLanguage.Stochaskell.Plot
nubLanguage.Stochaskell.Prelude, Language.Stochaskell
nubByLanguage.Stochaskell.Prelude, Language.Stochaskell
nullLanguage.Stochaskell.Prelude, Language.Stochaskell
nullOfLanguage.Stochaskell.Plot
nullPickFnLanguage.Stochaskell.Plot
nulltLanguage.Stochaskell.Plot
NumLanguage.Stochaskell.Prelude, Language.Stochaskell
numBinsLanguage.Stochaskell.Plot
numSamplesLanguage.Stan
numWarmupLanguage.Stan
NUTSLanguage.PyMC3
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - N)

stochaskell-1.0.0: A probabilistic programming language

Index - N

namedBarPlotLanguage.Stochaskell.Plot
namedBarPlot'Language.Stochaskell.Plot
nanColourLanguage.Stochaskell.Plot
NanColoursLanguage.Stochaskell.Plot
nanColoursLanguage.Stochaskell.Plot
navajowhiteLanguage.Stochaskell.Plot
navyLanguage.Stochaskell.Plot
nearlyLanguage.Stochaskell.Plot
negateLanguage.Stochaskell.Prelude, Language.Stochaskell
negativeInfinityLanguage.Stochaskell
NegBinomialLanguage.Stochaskell
negBinomialLanguage.Stochaskell
negInfColourLanguage.Stochaskell.Plot
NodeRefLanguage.Stochaskell.Expression
noExtendLanguage.Stochaskell.Plot
nonLanguage.Stochaskell.Plot
non'Language.Stochaskell.Plot
noneLanguage.Stochaskell.Plot
noneOfLanguage.Stochaskell.Plot
NormalLanguage.Stochaskell
normalLanguage.Stochaskell
normalCholLanguage.Stochaskell
normalCondLanguage.Stochaskell
NormalisationMethodLanguage.Stochaskell.Plot
normaliseSampleLanguage.Stochaskell.Plot
NormalsLanguage.Stochaskell
normalsLanguage.Stochaskell
normalsCholLanguage.Stochaskell
NoScaleLanguage.Stochaskell.Plot
notLanguage.Stochaskell.Prelude, Language.Stochaskell
notANumberLanguage.Stochaskell
notBLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemLanguage.Stochaskell.Prelude, Language.Stochaskell
notElemOfLanguage.Stochaskell.Plot
NothingLanguage.Stochaskell.Prelude, Language.Stochaskell
notNullOfLanguage.Stochaskell.Plot
nubLanguage.Stochaskell.Prelude, Language.Stochaskell
nubByLanguage.Stochaskell.Prelude, Language.Stochaskell
nullLanguage.Stochaskell.Prelude, Language.Stochaskell
nullOfLanguage.Stochaskell.Plot
nullPickFnLanguage.Stochaskell.Plot
nulltLanguage.Stochaskell.Plot
NumLanguage.Stochaskell.Prelude, Language.Stochaskell
numBinsLanguage.Stochaskell.Plot
numSamplesLanguage.Stan
numWarmupLanguage.Stan
NUTSLanguage.PyMC3
\ No newline at end of file diff --git a/docs/doc/doc-index-O.html b/docs/doc/doc-index-O.html index 4488fc1..36e89e6 100644 --- a/docs/doc/doc-index-O.html +++ b/docs/doc/doc-index-O.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - O)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - O)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-P.html b/docs/doc/doc-index-P.html index 8760ee2..fb03c30 100644 --- a/docs/doc/doc-index-P.html +++ b/docs/doc/doc-index-P.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - P)

stochaskell-0.1.0: A probabilistic programming language

Index - P

PLanguage.Stochaskell
palegoldenrodLanguage.Stochaskell.Plot
palegreenLanguage.Stochaskell.Plot
paleturquoiseLanguage.Stochaskell.Plot
palevioletredLanguage.Stochaskell.Plot
pAnchorLanguage.Stochaskell.Plot
papayawhipLanguage.Stochaskell.Plot
paraLanguage.Stochaskell.Plot
paraOfLanguage.Stochaskell.Plot
partitionLanguage.Stochaskell.Prelude, Language.Stochaskell
partsLanguage.Stochaskell.Plot
partsOfLanguage.Stochaskell.Plot
partsOf'Language.Stochaskell.Plot
passingLanguage.Stochaskell.Plot
pAtLanguage.Stochaskell.Plot
PathLanguage.Stochaskell.Plot
pathColourBarLanguage.Stochaskell.Plot
pathHeatRenderLanguage.Stochaskell.Plot
pathLengthLanguage.PyMC3
pathPlotLanguage.Stochaskell.Plot
pathPlot'Language.Stochaskell.Plot
pdfLanguage.Stochaskell.Plot
peachpuffLanguage.Stochaskell.Plot
Percent 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
permutationsLanguage.Stochaskell.Prelude, Language.Stochaskell
peruLanguage.Stochaskell.Plot
pGapDirLanguage.Stochaskell.Plot
piLanguage.Stochaskell.Prelude, Language.Stochaskell
PickFnLanguage.Stochaskell.Plot
PieChart 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
pieChartToRenderableLanguage.Stochaskell.Plot
PieItem 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PieLayout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
piePlotLanguage.Stochaskell.Plot
piePlot'Language.Stochaskell.Plot
PieStateLanguage.Stochaskell.Plot
pieToRenderableLanguage.Stochaskell.Plot
pieWedgeLanguage.Stochaskell.Plot
pie_backgroundLanguage.Stochaskell.Plot
pie_colorsLanguage.Stochaskell.Plot
pie_dataLanguage.Stochaskell.Plot
pie_label_line_styleLanguage.Stochaskell.Plot
pie_label_styleLanguage.Stochaskell.Plot
pie_marginLanguage.Stochaskell.Plot
pie_plotLanguage.Stochaskell.Plot
pie_start_angleLanguage.Stochaskell.Plot
pie_titleLanguage.Stochaskell.Plot
pie_title_styleLanguage.Stochaskell.Plot
pinkLanguage.Stochaskell.Plot
pitem_labelLanguage.Stochaskell.Plot
pitem_offsetLanguage.Stochaskell.Plot
pitem_valueLanguage.Stochaskell.Plot
pixelHeatRenderLanguage.Stochaskell.Plot
pixelHeatRender'Language.Stochaskell.Plot
placeAgainstLanguage.Stochaskell.Plot
Placement 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
placementLanguage.Stochaskell.Plot
placementAnchorLanguage.Stochaskell.Plot
placementAtLanguage.Stochaskell.Plot
plasmaLanguage.Stochaskell.Plot
plateLanguage.Stochaskell.Plot
PlatedLanguage.Stochaskell.Plot
plotLanguage.Stochaskell.Plot
PlotableLanguage.Stochaskell.Plot
PlotAnnotation 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotBars 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotBarsLanguage.Stochaskell.Plot
PlotBarsAlignmentLanguage.Stochaskell.Plot
PlotBarsSpacingLanguage.Stochaskell.Plot
PlotBarsStyleLanguage.Stochaskell.Plot
PlotCandle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotColorLanguage.Stochaskell.Plot
plotColourLanguage.Stochaskell.Plot
PlotErrBars 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotFillBetween 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotHidden 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotHist 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PlotIndex 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotindex_iLanguage.Stochaskell.Plot
plotLeftLanguage.Stochaskell.Plot
PlotLines 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotMarkerLanguage.Stochaskell.Plot
plotModifierLanguage.Stochaskell.Plot
PlotModsLanguage.Stochaskell.Plot
plotModsLanguage.Stochaskell.Plot
plotNameLanguage.Stochaskell.Plot
PlotOptionsLanguage.Stochaskell.Plot
plotOptionsLanguage.Stochaskell.Plot
PlotPoints 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotRightLanguage.Stochaskell.Plot
PlotStyleLanguage.Stochaskell.Plot
plotStyleLanguage.Stochaskell.Plot
plotStyleFunctionsLanguage.Stochaskell.Plot
plotStylesLanguage.Stochaskell.Plot
plotTransformLanguage.Stochaskell.Plot
PlotValueLanguage.Stochaskell.Plot
plotVectorFieldLanguage.Stochaskell.Plot
PlotVectors 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
plotVisibleLanguage.Stochaskell.Plot
plot_all_pointsLanguage.Stochaskell.Plot
plot_annotation_angleLanguage.Stochaskell.Plot
plot_annotation_backgroundLanguage.Stochaskell.Plot
plot_annotation_hanchorLanguage.Stochaskell.Plot
plot_annotation_styleLanguage.Stochaskell.Plot
plot_annotation_valuesLanguage.Stochaskell.Plot
plot_annotation_vanchorLanguage.Stochaskell.Plot
plot_bars_alignmentLanguage.Stochaskell.Plot
plot_bars_item_stylesLanguage.Stochaskell.Plot
plot_bars_referenceLanguage.Stochaskell.Plot
plot_bars_singleton_widthLanguage.Stochaskell.Plot
plot_bars_spacingLanguage.Stochaskell.Plot
plot_bars_styleLanguage.Stochaskell.Plot
plot_bars_titlesLanguage.Stochaskell.Plot
plot_bars_valuesLanguage.Stochaskell.Plot
plot_candle_centreLanguage.Stochaskell.Plot
plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
plot_candle_fillLanguage.Stochaskell.Plot
plot_candle_line_styleLanguage.Stochaskell.Plot
plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
plot_candle_tick_lengthLanguage.Stochaskell.Plot
plot_candle_titleLanguage.Stochaskell.Plot
plot_candle_valuesLanguage.Stochaskell.Plot
plot_candle_widthLanguage.Stochaskell.Plot
plot_errbars_line_styleLanguage.Stochaskell.Plot
plot_errbars_overhangLanguage.Stochaskell.Plot
plot_errbars_tick_lengthLanguage.Stochaskell.Plot
plot_errbars_titleLanguage.Stochaskell.Plot
plot_errbars_valuesLanguage.Stochaskell.Plot
plot_fillbetween_styleLanguage.Stochaskell.Plot
plot_fillbetween_titleLanguage.Stochaskell.Plot
plot_fillbetween_valuesLanguage.Stochaskell.Plot
plot_hidden_x_valuesLanguage.Stochaskell.Plot
plot_hidden_y_valuesLanguage.Stochaskell.Plot
plot_hist_binsLanguage.Stochaskell.Plot
plot_hist_drop_linesLanguage.Stochaskell.Plot
plot_hist_fill_styleLanguage.Stochaskell.Plot
plot_hist_line_styleLanguage.Stochaskell.Plot
plot_hist_norm_funcLanguage.Stochaskell.Plot
plot_hist_no_zerosLanguage.Stochaskell.Plot
plot_hist_rangeLanguage.Stochaskell.Plot
plot_hist_titleLanguage.Stochaskell.Plot
plot_hist_valuesLanguage.Stochaskell.Plot
plot_legendLanguage.Stochaskell.Plot
plot_lines_limit_valuesLanguage.Stochaskell.Plot
plot_lines_styleLanguage.Stochaskell.Plot
plot_lines_titleLanguage.Stochaskell.Plot
plot_lines_valuesLanguage.Stochaskell.Plot
plot_points_styleLanguage.Stochaskell.Plot
plot_points_titleLanguage.Stochaskell.Plot
plot_points_valuesLanguage.Stochaskell.Plot
plot_renderLanguage.Stochaskell.Plot
plot_vectors_gridLanguage.Stochaskell.Plot
plot_vectors_mapfLanguage.Stochaskell.Plot
plot_vectors_scaleLanguage.Stochaskell.Plot
plot_vectors_styleLanguage.Stochaskell.Plot
plot_vectors_titleLanguage.Stochaskell.Plot
plot_vectors_valuesLanguage.Stochaskell.Plot
plumLanguage.Stochaskell.Plot
plusLanguage.Stochaskell.Plot
plussesLanguage.Stochaskell.Plot
pmDrawsLanguage.PyMC3
PMFLanguage.Stochaskell
pmfLanguage.Stochaskell
pmInitLanguage.PyMC3
pmProgramLanguage.PyMC3
pmStartLanguage.PyMC3
pmStepLanguage.PyMC3
pmTuneLanguage.PyMC3
Point 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
PointMapFnLanguage.Stochaskell.Plot
pointsLanguage.Stochaskell.Plot
PointShapeLanguage.Stochaskell.Plot
PointShapeArrowHeadLanguage.Stochaskell.Plot
PointShapeCircleLanguage.Stochaskell.Plot
PointShapeCrossLanguage.Stochaskell.Plot
PointShapeEllipseLanguage.Stochaskell.Plot
PointShapePlusLanguage.Stochaskell.Plot
PointShapePolygonLanguage.Stochaskell.Plot
PointShapeStarLanguage.Stochaskell.Plot
PointStyle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
pointToVecLanguage.Stochaskell.Plot
point_border_colorLanguage.Stochaskell.Plot
point_border_widthLanguage.Stochaskell.Plot
point_colorLanguage.Stochaskell.Plot
point_radiusLanguage.Stochaskell.Plot
point_shapeLanguage.Stochaskell.Plot
PoissonLanguage.Stochaskell
poissonLanguage.Stochaskell
PoissonProcessLanguage.Stochaskell
poissonProcessLanguage.Stochaskell
Polar 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
polarLanguage.Stochaskell.Plot
polarAxisLanguage.Stochaskell.Plot
polarIsoLanguage.Stochaskell.Plot
polarV2Language.Stochaskell.Plot
powderblueLanguage.Stochaskell.Plot
preLanguage.Stochaskell.Plot
predLanguage.Stochaskell.Prelude, Language.Stochaskell
preuseLanguage.Stochaskell.Plot
preusesLanguage.Stochaskell.Plot
previewLanguage.Stochaskell.Plot
previewsLanguage.Stochaskell.Plot
printLanguage.Stochaskell.Prelude, Language.Stochaskell
Prism 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
prismLanguage.Stochaskell.Plot
Prism'Language.Stochaskell.Plot
prism'Language.Stochaskell.Plot
probabilityLanguage.Stochaskell.Plot
Product 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
productLanguage.Stochaskell.Prelude, Language.Stochaskell
productOfLanguage.Stochaskell.Plot
ProfunctorLanguage.Stochaskell.Plot
properFractionLanguage.Stochaskell.Prelude, Language.Stochaskell
psubLanguage.Stochaskell.Plot
pureLanguage.Stochaskell.Prelude, Language.Stochaskell
purpleLanguage.Stochaskell.Plot
putCharLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLnLanguage.Stochaskell.Prelude, Language.Stochaskell
pvaddLanguage.Stochaskell.Plot
pvsubLanguage.Stochaskell.Plot
PyMC3InferenceLanguage.PyMC3
PyMC3SampleLanguage.PyMC3
PyMC3StepLanguage.PyMC3
p_xLanguage.Stochaskell.Plot
p_yLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - P)

stochaskell-1.0.0: A probabilistic programming language

Index - P

PLanguage.Stochaskell
palegoldenrodLanguage.Stochaskell.Plot
palegreenLanguage.Stochaskell.Plot
paleturquoiseLanguage.Stochaskell.Plot
palevioletredLanguage.Stochaskell.Plot
pAnchorLanguage.Stochaskell.Plot
papayawhipLanguage.Stochaskell.Plot
paraLanguage.Stochaskell.Plot
paraOfLanguage.Stochaskell.Plot
partitionLanguage.Stochaskell.Prelude, Language.Stochaskell
partsLanguage.Stochaskell.Plot
partsOfLanguage.Stochaskell.Plot
partsOf'Language.Stochaskell.Plot
passingLanguage.Stochaskell.Plot
pAtLanguage.Stochaskell.Plot
PathLanguage.Stochaskell.Plot
pathColourBarLanguage.Stochaskell.Plot
pathHeatRenderLanguage.Stochaskell.Plot
pathLengthLanguage.PyMC3
pathPlotLanguage.Stochaskell.Plot
pathPlot'Language.Stochaskell.Plot
pdfLanguage.Stochaskell
peachpuffLanguage.Stochaskell.Plot
Percent 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
permutationsLanguage.Stochaskell.Prelude, Language.Stochaskell
peruLanguage.Stochaskell.Plot
pGapDirLanguage.Stochaskell.Plot
piLanguage.Stochaskell.Prelude, Language.Stochaskell
PickFnLanguage.Stochaskell.Plot
PieChart 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
pieChartToRenderableLanguage.Stochaskell.Plot
PieItem 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PieLayout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
piePlotLanguage.Stochaskell.Plot
piePlot'Language.Stochaskell.Plot
PieStateLanguage.Stochaskell.Plot
pieToRenderableLanguage.Stochaskell.Plot
pieWedgeLanguage.Stochaskell.Plot
pie_backgroundLanguage.Stochaskell.Plot
pie_colorsLanguage.Stochaskell.Plot
pie_dataLanguage.Stochaskell.Plot
pie_label_line_styleLanguage.Stochaskell.Plot
pie_label_styleLanguage.Stochaskell.Plot
pie_marginLanguage.Stochaskell.Plot
pie_plotLanguage.Stochaskell.Plot
pie_start_angleLanguage.Stochaskell.Plot
pie_titleLanguage.Stochaskell.Plot
pie_title_styleLanguage.Stochaskell.Plot
pinkLanguage.Stochaskell.Plot
pitem_labelLanguage.Stochaskell.Plot
pitem_offsetLanguage.Stochaskell.Plot
pitem_valueLanguage.Stochaskell.Plot
pixelHeatRenderLanguage.Stochaskell.Plot
pixelHeatRender'Language.Stochaskell.Plot
placeAgainstLanguage.Stochaskell.Plot
Placement 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
placementLanguage.Stochaskell.Plot
placementAnchorLanguage.Stochaskell.Plot
placementAtLanguage.Stochaskell.Plot
plasmaLanguage.Stochaskell.Plot
plateLanguage.Stochaskell.Plot
PlatedLanguage.Stochaskell.Plot
plotLanguage.Stochaskell.Plot
PlotableLanguage.Stochaskell.Plot
PlotAnnotation 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotBars 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotBarsLanguage.Stochaskell.Plot
PlotBarsAlignmentLanguage.Stochaskell.Plot
PlotBarsSpacingLanguage.Stochaskell.Plot
PlotBarsStyleLanguage.Stochaskell.Plot
PlotCandle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotColorLanguage.Stochaskell.Plot
plotColourLanguage.Stochaskell.Plot
PlotErrBars 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotFillBetween 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotHidden 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PlotHist 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotHistLanguage.Stochaskell.Plot
PlotIndex 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotindex_iLanguage.Stochaskell.Plot
plotLeftLanguage.Stochaskell.Plot
PlotLines 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotMarkerLanguage.Stochaskell.Plot
plotModifierLanguage.Stochaskell.Plot
PlotModsLanguage.Stochaskell.Plot
plotModsLanguage.Stochaskell.Plot
plotNameLanguage.Stochaskell.Plot
PlotOptionsLanguage.Stochaskell.Plot
plotOptionsLanguage.Stochaskell.Plot
PlotPLanguage.Stochaskell.Plot
plotPLanguage.Stochaskell.Plot
plotP'Language.Stochaskell.Plot
plotpdfLanguage.Stochaskell.Plot
PlotPoints 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotRightLanguage.Stochaskell.Plot
plotStepLanguage.Stochaskell.Plot
PlotStyleLanguage.Stochaskell.Plot
plotStyleLanguage.Stochaskell.Plot
plotStyleFunctionsLanguage.Stochaskell.Plot
plotStylesLanguage.Stochaskell.Plot
plotTransformLanguage.Stochaskell.Plot
plotUnderLanguage.Stochaskell.Plot
PlotValueLanguage.Stochaskell.Plot
plotVectorFieldLanguage.Stochaskell.Plot
PlotVectors 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
plotVisibleLanguage.Stochaskell.Plot
plot_all_pointsLanguage.Stochaskell.Plot
plot_annotation_angleLanguage.Stochaskell.Plot
plot_annotation_backgroundLanguage.Stochaskell.Plot
plot_annotation_hanchorLanguage.Stochaskell.Plot
plot_annotation_styleLanguage.Stochaskell.Plot
plot_annotation_valuesLanguage.Stochaskell.Plot
plot_annotation_vanchorLanguage.Stochaskell.Plot
plot_bars_alignmentLanguage.Stochaskell.Plot
plot_bars_item_stylesLanguage.Stochaskell.Plot
plot_bars_referenceLanguage.Stochaskell.Plot
plot_bars_singleton_widthLanguage.Stochaskell.Plot
plot_bars_spacingLanguage.Stochaskell.Plot
plot_bars_styleLanguage.Stochaskell.Plot
plot_bars_titlesLanguage.Stochaskell.Plot
plot_bars_valuesLanguage.Stochaskell.Plot
plot_candle_centreLanguage.Stochaskell.Plot
plot_candle_fall_fill_styleLanguage.Stochaskell.Plot
plot_candle_fillLanguage.Stochaskell.Plot
plot_candle_line_styleLanguage.Stochaskell.Plot
plot_candle_rise_fill_styleLanguage.Stochaskell.Plot
plot_candle_tick_lengthLanguage.Stochaskell.Plot
plot_candle_titleLanguage.Stochaskell.Plot
plot_candle_valuesLanguage.Stochaskell.Plot
plot_candle_widthLanguage.Stochaskell.Plot
plot_errbars_line_styleLanguage.Stochaskell.Plot
plot_errbars_overhangLanguage.Stochaskell.Plot
plot_errbars_tick_lengthLanguage.Stochaskell.Plot
plot_errbars_titleLanguage.Stochaskell.Plot
plot_errbars_valuesLanguage.Stochaskell.Plot
plot_fillbetween_styleLanguage.Stochaskell.Plot
plot_fillbetween_titleLanguage.Stochaskell.Plot
plot_fillbetween_valuesLanguage.Stochaskell.Plot
plot_hidden_x_valuesLanguage.Stochaskell.Plot
plot_hidden_y_valuesLanguage.Stochaskell.Plot
plot_hist_binsLanguage.Stochaskell.Plot
plot_hist_drop_linesLanguage.Stochaskell.Plot
plot_hist_fill_styleLanguage.Stochaskell.Plot
plot_hist_line_styleLanguage.Stochaskell.Plot
plot_hist_norm_funcLanguage.Stochaskell.Plot
plot_hist_no_zerosLanguage.Stochaskell.Plot
plot_hist_rangeLanguage.Stochaskell.Plot
plot_hist_titleLanguage.Stochaskell.Plot
plot_hist_valuesLanguage.Stochaskell.Plot
plot_legendLanguage.Stochaskell.Plot
plot_lines_limit_valuesLanguage.Stochaskell.Plot
plot_lines_styleLanguage.Stochaskell.Plot
plot_lines_titleLanguage.Stochaskell.Plot
plot_lines_valuesLanguage.Stochaskell.Plot
plot_points_styleLanguage.Stochaskell.Plot
plot_points_titleLanguage.Stochaskell.Plot
plot_points_valuesLanguage.Stochaskell.Plot
plot_renderLanguage.Stochaskell.Plot
plot_vectors_gridLanguage.Stochaskell.Plot
plot_vectors_mapfLanguage.Stochaskell.Plot
plot_vectors_scaleLanguage.Stochaskell.Plot
plot_vectors_styleLanguage.Stochaskell.Plot
plot_vectors_titleLanguage.Stochaskell.Plot
plot_vectors_valuesLanguage.Stochaskell.Plot
plumLanguage.Stochaskell.Plot
plusLanguage.Stochaskell.Plot
plussesLanguage.Stochaskell.Plot
pmChainsLanguage.PyMC3
pmDrawsLanguage.PyMC3
PMFLanguage.Stochaskell
pmfLanguage.Stochaskell
pmFloatXLanguage.PyMC3
pmInitLanguage.PyMC3
pmProgramLanguage.PyMC3
pmProgram'Language.PyMC3
pmStartLanguage.PyMC3
pmStepLanguage.PyMC3
pmTuneLanguage.PyMC3
Point 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
PointMapFnLanguage.Stochaskell.Plot
pointsLanguage.Stochaskell.Plot
PointShapeLanguage.Stochaskell.Plot
PointShapeArrowHeadLanguage.Stochaskell.Plot
PointShapeCircleLanguage.Stochaskell.Plot
PointShapeCrossLanguage.Stochaskell.Plot
PointShapeEllipseLanguage.Stochaskell.Plot
PointShapePlusLanguage.Stochaskell.Plot
PointShapePolygonLanguage.Stochaskell.Plot
PointShapeStarLanguage.Stochaskell.Plot
PointStyle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
pointToVecLanguage.Stochaskell.Plot
point_border_colorLanguage.Stochaskell.Plot
point_border_widthLanguage.Stochaskell.Plot
point_colorLanguage.Stochaskell.Plot
point_radiusLanguage.Stochaskell.Plot
point_shapeLanguage.Stochaskell.Plot
PoissonLanguage.Stochaskell
poissonLanguage.Stochaskell
PoissonProcessLanguage.Stochaskell
poissonProcessLanguage.Stochaskell
Polar 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
polarLanguage.Stochaskell.Plot
polarAxisLanguage.Stochaskell.Plot
polarIsoLanguage.Stochaskell.Plot
polarV2Language.Stochaskell.Plot
powderblueLanguage.Stochaskell.Plot
preLanguage.Stochaskell.Plot
predLanguage.Stochaskell.Prelude, Language.Stochaskell
preuseLanguage.Stochaskell.Plot
preusesLanguage.Stochaskell.Plot
previewLanguage.Stochaskell.Plot
previewsLanguage.Stochaskell.Plot
printLanguage.Stochaskell.Prelude, Language.Stochaskell
Prism 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
prismLanguage.Stochaskell.Plot
Prism'Language.Stochaskell.Plot
prism'Language.Stochaskell.Plot
probabilityLanguage.Stochaskell.Plot
Product 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
productLanguage.Stochaskell.Prelude, Language.Stochaskell
productOfLanguage.Stochaskell.Plot
ProfunctorLanguage.Stochaskell.Plot
properFractionLanguage.Stochaskell.Prelude, Language.Stochaskell
psubLanguage.Stochaskell.Plot
pureLanguage.Stochaskell.Prelude, Language.Stochaskell
purpleLanguage.Stochaskell.Plot
putCharLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLanguage.Stochaskell.Prelude, Language.Stochaskell
putStrLnLanguage.Stochaskell.Prelude, Language.Stochaskell
pvaddLanguage.Stochaskell.Plot
pvsubLanguage.Stochaskell.Plot
PyMC3InferenceLanguage.PyMC3
PyMC3SampleLanguage.PyMC3
PyMC3StepLanguage.PyMC3
p_xLanguage.Stochaskell.Plot
p_yLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-Q.html b/docs/doc/doc-index-Q.html index 26b332f..5d0a079 100644 --- a/docs/doc/doc-index-Q.html +++ b/docs/doc/doc-index-Q.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - Q)

stochaskell-0.1.0: A probabilistic programming language

Index - Q

qfDiagLanguage.Stochaskell
quotLanguage.Stochaskell.Prelude, Language.Stochaskell
quotRemLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - Q)

stochaskell-1.0.0: A probabilistic programming language

Index - Q

qfDiagLanguage.Stochaskell
quotLanguage.Stochaskell.Prelude, Language.Stochaskell
quotRemLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-R.html b/docs/doc/doc-index-R.html index 8e9fdfd..3d8d6c0 100644 --- a/docs/doc/doc-index-R.html +++ b/docs/doc/doc-index-R.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - R)

stochaskell-0.1.0: A probabilistic programming language

Index - R

RLanguage.Stochaskell
r2AxisLanguage.Stochaskell.Plot
r2AxisMainLanguage.Stochaskell.Plot
RadialLanguage.Stochaskell.Plot
RangeLanguage.Stochaskell.Plot
RationalLanguage.Stochaskell.Prelude, Language.Stochaskell
rawPlotLanguage.Stochaskell.Plot
rAxisLanguage.Stochaskell.Plot
RCornerBevelLanguage.Stochaskell.Plot
RCornerRoundedLanguage.Stochaskell.Plot
RCornerSquareLanguage.Stochaskell.Plot
reLanguage.Stochaskell.Plot
ReadLanguage.Stochaskell.Prelude, Language.Stochaskell
readLanguage.Stochaskell.Prelude, Language.Stochaskell
readColourNameLanguage.Stochaskell.Plot
readFileLanguage.Stochaskell.Prelude, Language.Stochaskell
readIOLanguage.Stochaskell.Prelude, Language.Stochaskell
readListLanguage.Stochaskell.Prelude, Language.Stochaskell
readLnLanguage.Stochaskell.Prelude, Language.Stochaskell
readParenLanguage.Stochaskell.Prelude, Language.Stochaskell
readRealMatrixLanguage.Stochaskell
ReadSLanguage.Stochaskell.Prelude, Language.Stochaskell
readsLanguage.Stochaskell.Prelude, Language.Stochaskell
readsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
RealLanguage.Stochaskell.Prelude, Language.Stochaskell
realLanguage.Stochaskell
RealFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
RealFracLanguage.Stochaskell.Prelude, Language.Stochaskell
RealTLanguage.Stochaskell.Expression
realToFracLanguage.Stochaskell.Prelude, Language.Stochaskell
recipLanguage.Stochaskell.Prelude, Language.Stochaskell
Rect 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Rectangle 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
rectangleToRenderableLanguage.Stochaskell.Plot
RectCornerStyleLanguage.Stochaskell.Plot
RectEdgeLanguage.Stochaskell.Plot
rectPathLanguage.Stochaskell.Plot
RectSizeLanguage.Stochaskell.Plot
rect_cornerStyleLanguage.Stochaskell.Plot
rect_fillStyleLanguage.Stochaskell.Plot
rect_lineStyleLanguage.Stochaskell.Plot
rect_minsizeLanguage.Stochaskell.Plot
redLanguage.Stochaskell.Plot
ReifiedFoldLanguage.Stochaskell.Plot
ReifiedGetterLanguage.Stochaskell.Plot
ReifiedIndexedFoldLanguage.Stochaskell.Plot
ReifiedIndexedGetterLanguage.Stochaskell.Plot
ReifiedIndexedLensLanguage.Stochaskell.Plot
ReifiedIndexedLens'Language.Stochaskell.Plot
ReifiedIndexedSetterLanguage.Stochaskell.Plot
ReifiedIndexedSetter'Language.Stochaskell.Plot
ReifiedIndexedTraversalLanguage.Stochaskell.Plot
ReifiedIndexedTraversal'Language.Stochaskell.Plot
ReifiedIsoLanguage.Stochaskell.Plot
ReifiedIso'Language.Stochaskell.Plot
ReifiedLensLanguage.Stochaskell.Plot
ReifiedLens'Language.Stochaskell.Plot
ReifiedPrismLanguage.Stochaskell.Plot
ReifiedPrism'Language.Stochaskell.Plot
ReifiedSetterLanguage.Stochaskell.Plot
ReifiedSetter'Language.Stochaskell.Plot
ReifiedTraversalLanguage.Stochaskell.Plot
ReifiedTraversal'Language.Stochaskell.Plot
reindexedLanguage.Stochaskell.Plot
RelativeExtendLanguage.Stochaskell.Plot
remLanguage.Stochaskell.Prelude, Language.Stochaskell
renderLanguage.Stochaskell.Plot
Renderable 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
RenderAxisLanguage.Stochaskell.Plot
renderAxisLanguage.Stochaskell.Plot
renderAxis2Language.Stochaskell.Plot
renderAxisGridLanguage.Stochaskell.Plot
renderColourBarLanguage.Stochaskell.Plot
renderPlotableLanguage.Stochaskell.Plot
renderSizeLanguage.Stochaskell.Plot
renderStackedLayoutsLanguage.Stochaskell.Plot
renderStyledPlotLanguage.Stochaskell.Plot
repeatLanguage.Stochaskell.Prelude, Language.Stochaskell
repeatedLanguage.Stochaskell.Plot
replaceLanguage.Stochaskell
replaceAtLanguage.Stochaskell
replaceIndexLanguage.Stochaskell
replicateLanguage.Stochaskell.Prelude, Language.Stochaskell
replicatedLanguage.Stochaskell.Plot
replicateMLanguage.Stochaskell.Prelude, Language.Stochaskell
replicateM_Language.Stochaskell.Prelude, Language.Stochaskell
retaggedLanguage.Stochaskell.Plot
returnLanguage.Stochaskell.Prelude, Language.Stochaskell
reuseLanguage.Stochaskell.Plot
reusesLanguage.Stochaskell.Plot
reverseLanguage.Stochaskell.Prelude, Language.Stochaskell
ReversedLanguage.Stochaskell.Plot
reversedLanguage.Stochaskell.Plot
ReversingLanguage.Stochaskell.Plot
reversingLanguage.Stochaskell.Plot
ReviewLanguage.Stochaskell.Plot
reviewLanguage.Stochaskell.Plot
ReviewableLanguage.Stochaskell.Plot
reviewsLanguage.Stochaskell.Plot
RewrappedLanguage.Stochaskell.Plot
RewrappingLanguage.Stochaskell.Plot
rewriteLanguage.Stochaskell.Plot
rewriteMLanguage.Stochaskell.Plot
rewriteMOfLanguage.Stochaskell.Plot
rewriteMOnLanguage.Stochaskell.Plot
rewriteMOnOfLanguage.Stochaskell.Plot
rewriteOfLanguage.Stochaskell.Plot
rewriteOnLanguage.Stochaskell.Plot
rewriteOnOfLanguage.Stochaskell.Plot
RightLanguage.Stochaskell.Prelude, Language.Stochaskell
rightLanguage.Stochaskell.Plot
right'Language.Stochaskell.Plot
rightAboveLanguage.Stochaskell.Plot
rightBelowLanguage.Stochaskell.Plot
rightBottomLanguage.Stochaskell.Plot
rightMidLanguage.Stochaskell.Plot
RightmostLanguage.Stochaskell.Plot
rightTopLanguage.Stochaskell.Plot
rjmcLanguage.Stochaskell
rjmcCLanguage.Stochaskell
rLabelLanguage.Stochaskell.Plot
rlabelLanguage.Stochaskell.Plot
rmapLanguage.Stochaskell.Plot
rmappingLanguage.Stochaskell.Plot
RMatLanguage.Stochaskell
rMaxLanguage.Stochaskell.Plot
rosybrownLanguage.Stochaskell.Plot
rotateLanguage.Stochaskell.Plot
rotatePLanguage.Stochaskell.Plot
roundLanguage.Stochaskell.Prelude, Language.Stochaskell
royalblueLanguage.Stochaskell.Plot
runBazaarLanguage.Stochaskell.Plot
runBazaar1Language.Stochaskell.Plot
runCCLanguage.Stochaskell
runEqLanguage.Stochaskell.Plot
runFoldLanguage.Stochaskell.Plot
runGetterLanguage.Stochaskell.Plot
runIdentityLanguage.Stochaskell.Plot
runIndexedLanguage.Stochaskell.Plot
runIndexedFoldLanguage.Stochaskell.Plot
runIndexedGetterLanguage.Stochaskell.Plot
runIndexedLensLanguage.Stochaskell.Plot
runIndexedSetterLanguage.Stochaskell.Plot
runIndexedTraversalLanguage.Stochaskell.Plot
runIsoLanguage.Stochaskell.Plot
runLensLanguage.Stochaskell.Plot
runningBarsLanguage.Stochaskell.Plot
runPrismLanguage.Stochaskell.Plot
runPyMC3Language.PyMC3
runSetterLanguage.Stochaskell.Plot
runStanLanguage.Stan
runStepLanguage.Stochaskell
runTraversalLanguage.Stochaskell.Plot
RVecLanguage.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - R)

stochaskell-1.0.0: A probabilistic programming language

Index - R

RLanguage.Stochaskell
r2AxisLanguage.Stochaskell.Plot
r2AxisMainLanguage.Stochaskell.Plot
RadialLanguage.Stochaskell.Plot
RangeLanguage.Stochaskell.Plot
RationalLanguage.Stochaskell.Prelude, Language.Stochaskell
rawPlotLanguage.Stochaskell.Plot
rAxisLanguage.Stochaskell.Plot
RCornerBevelLanguage.Stochaskell.Plot
RCornerRoundedLanguage.Stochaskell.Plot
RCornerSquareLanguage.Stochaskell.Plot
reLanguage.Stochaskell.Plot
ReadLanguage.Stochaskell.Prelude, Language.Stochaskell
readLanguage.Stochaskell.Prelude, Language.Stochaskell
readColourNameLanguage.Stochaskell.Plot
readFileLanguage.Stochaskell.Prelude, Language.Stochaskell
readIOLanguage.Stochaskell.Prelude, Language.Stochaskell
readListLanguage.Stochaskell.Prelude, Language.Stochaskell
readLnLanguage.Stochaskell.Prelude, Language.Stochaskell
readParenLanguage.Stochaskell.Prelude, Language.Stochaskell
readRealMatrixLanguage.Stochaskell
ReadSLanguage.Stochaskell.Prelude, Language.Stochaskell
readsLanguage.Stochaskell.Prelude, Language.Stochaskell
readsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
RealLanguage.Stochaskell.Prelude, Language.Stochaskell
realLanguage.Stochaskell
RealFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
RealFracLanguage.Stochaskell.Prelude, Language.Stochaskell
RealTLanguage.Stochaskell.Expression
realToFracLanguage.Stochaskell.Prelude, Language.Stochaskell
recipLanguage.Stochaskell.Prelude, Language.Stochaskell
Rect 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Rectangle 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
rectangleToRenderableLanguage.Stochaskell.Plot
RectCornerStyleLanguage.Stochaskell.Plot
RectEdgeLanguage.Stochaskell.Plot
rectPathLanguage.Stochaskell.Plot
RectSizeLanguage.Stochaskell.Plot
rect_cornerStyleLanguage.Stochaskell.Plot
rect_fillStyleLanguage.Stochaskell.Plot
rect_lineStyleLanguage.Stochaskell.Plot
rect_minsizeLanguage.Stochaskell.Plot
RecursiveTLanguage.Stochaskell.Expression
redLanguage.Stochaskell.Plot
ReifiedFoldLanguage.Stochaskell.Plot
ReifiedGetterLanguage.Stochaskell.Plot
ReifiedIndexedFoldLanguage.Stochaskell.Plot
ReifiedIndexedGetterLanguage.Stochaskell.Plot
ReifiedIndexedLensLanguage.Stochaskell.Plot
ReifiedIndexedLens'Language.Stochaskell.Plot
ReifiedIndexedSetterLanguage.Stochaskell.Plot
ReifiedIndexedSetter'Language.Stochaskell.Plot
ReifiedIndexedTraversalLanguage.Stochaskell.Plot
ReifiedIndexedTraversal'Language.Stochaskell.Plot
ReifiedIsoLanguage.Stochaskell.Plot
ReifiedIso'Language.Stochaskell.Plot
ReifiedLensLanguage.Stochaskell.Plot
ReifiedLens'Language.Stochaskell.Plot
ReifiedPrismLanguage.Stochaskell.Plot
ReifiedPrism'Language.Stochaskell.Plot
ReifiedSetterLanguage.Stochaskell.Plot
ReifiedSetter'Language.Stochaskell.Plot
ReifiedTraversalLanguage.Stochaskell.Plot
ReifiedTraversal'Language.Stochaskell.Plot
reindexedLanguage.Stochaskell.Plot
RelativeExtendLanguage.Stochaskell.Plot
remLanguage.Stochaskell.Prelude, Language.Stochaskell
renderLanguage.Stochaskell.Plot
Renderable 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
RenderAxisLanguage.Stochaskell.Plot
renderAxisLanguage.Stochaskell.Plot
renderAxis2Language.Stochaskell.Plot
renderAxisGridLanguage.Stochaskell.Plot
renderColourBarLanguage.Stochaskell.Plot
renderPlotableLanguage.Stochaskell.Plot
renderSizeLanguage.Stochaskell.Plot
renderStackedLayoutsLanguage.Stochaskell.Plot
renderStyledPlotLanguage.Stochaskell.Plot
repeatLanguage.Stochaskell.Prelude, Language.Stochaskell
repeatedLanguage.Stochaskell.Plot
replaceLanguage.Stochaskell
replaceAtLanguage.Stochaskell
replaceIndexLanguage.Stochaskell
replicateLanguage.Stochaskell.Prelude, Language.Stochaskell
replicatedLanguage.Stochaskell.Plot
replicateMLanguage.Stochaskell.Prelude, Language.Stochaskell
replicateM_Language.Stochaskell.Prelude, Language.Stochaskell
retaggedLanguage.Stochaskell.Plot
returnLanguage.Stochaskell.Prelude, Language.Stochaskell
reuseLanguage.Stochaskell.Plot
reusesLanguage.Stochaskell.Plot
reverseLanguage.Stochaskell.Prelude, Language.Stochaskell
ReversedLanguage.Stochaskell.Plot
reversedLanguage.Stochaskell.Plot
ReversingLanguage.Stochaskell.Plot
reversingLanguage.Stochaskell.Plot
ReviewLanguage.Stochaskell.Plot
reviewLanguage.Stochaskell.Plot
ReviewableLanguage.Stochaskell.Plot
reviewsLanguage.Stochaskell.Plot
RewrappedLanguage.Stochaskell.Plot
RewrappingLanguage.Stochaskell.Plot
rewriteLanguage.Stochaskell.Plot
rewriteMLanguage.Stochaskell.Plot
rewriteMOfLanguage.Stochaskell.Plot
rewriteMOnLanguage.Stochaskell.Plot
rewriteMOnOfLanguage.Stochaskell.Plot
rewriteOfLanguage.Stochaskell.Plot
rewriteOnLanguage.Stochaskell.Plot
rewriteOnOfLanguage.Stochaskell.Plot
RightLanguage.Stochaskell.Prelude, Language.Stochaskell
rightLanguage.Stochaskell.Plot
right'Language.Stochaskell.Plot
rightAboveLanguage.Stochaskell.Plot
rightBelowLanguage.Stochaskell.Plot
rightBottomLanguage.Stochaskell.Plot
rightMidLanguage.Stochaskell.Plot
RightmostLanguage.Stochaskell.Plot
rightTopLanguage.Stochaskell.Plot
rjmcLanguage.Stochaskell
rjmc1Language.Stochaskell
rjmc1RatioLanguage.Stochaskell
rjmcCLanguage.Stochaskell
rLabelLanguage.Stochaskell.Plot
rlabelLanguage.Stochaskell.Plot
rmapLanguage.Stochaskell.Plot
rmappingLanguage.Stochaskell.Plot
RMatLanguage.Stochaskell
rMaxLanguage.Stochaskell.Plot
rosybrownLanguage.Stochaskell.Plot
rotateLanguage.Stochaskell.Plot
rotatePLanguage.Stochaskell.Plot
roundLanguage.Stochaskell.Prelude, Language.Stochaskell
royalblueLanguage.Stochaskell.Plot
runBazaarLanguage.Stochaskell.Plot
runBazaar1Language.Stochaskell.Plot
runCCLanguage.Stochaskell
runEqLanguage.Stochaskell.Plot
runFoldLanguage.Stochaskell.Plot
runGetterLanguage.Stochaskell.Plot
runIdentityLanguage.Stochaskell.Plot
runIndexedLanguage.Stochaskell.Plot
runIndexedFoldLanguage.Stochaskell.Plot
runIndexedGetterLanguage.Stochaskell.Plot
runIndexedLensLanguage.Stochaskell.Plot
runIndexedSetterLanguage.Stochaskell.Plot
runIndexedTraversalLanguage.Stochaskell.Plot
runIsoLanguage.Stochaskell.Plot
runLensLanguage.Stochaskell.Plot
runningBarsLanguage.Stochaskell.Plot
runPrismLanguage.Stochaskell.Plot
runPyMC3Language.PyMC3
runSetterLanguage.Stochaskell.Plot
runStanLanguage.Stan
runStepLanguage.Stochaskell
runTraversalLanguage.Stochaskell.Plot
RVecLanguage.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-S.html b/docs/doc/doc-index-S.html index 33ff0b1..8380bd3 100644 --- a/docs/doc/doc-index-S.html +++ b/docs/doc/doc-index-S.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - S)

stochaskell-0.1.0: A probabilistic programming language

Index - S

saddlebrownLanguage.Stochaskell.Plot
salmonLanguage.Stochaskell.Plot
sandybrownLanguage.Stochaskell.Plot
sansLanguage.Stochaskell.Plot
saveWarmupLanguage.Stan
ScalableLanguage.Stochaskell
scalarMultiplyLanguage.Stochaskell.Plot
scaleLanguage.Stochaskell.Plot
scaleAspectRatioLanguage.Stochaskell.Plot
scaledAxisLanguage.Stochaskell.Plot
scaledIntAxisLanguage.Stochaskell.Plot
scaleFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
ScaleModeLanguage.Stochaskell.Plot
scaleModeLanguage.Stochaskell.Plot
scaleNumLanguage.Stochaskell.Plot
scalePLanguage.Stochaskell.Plot
scanlLanguage.Stochaskell
scanl'Language.Stochaskell.Prelude, Language.Stochaskell
scanl1Language.Stochaskell.Prelude, Language.Stochaskell
scanl1OfLanguage.Stochaskell.Plot
scanrLanguage.Stochaskell
scanr1Language.Stochaskell.Prelude, Language.Stochaskell
scanr1OfLanguage.Stochaskell.Plot
ScatterOptionsLanguage.Stochaskell.Plot
scatterOptionsLanguage.Stochaskell.Plot
ScatterPlotLanguage.Stochaskell.Plot
scatterPlotLanguage.Stochaskell.Plot
scatterPlot'Language.Stochaskell.Plot
scatterPlotOfLanguage.Stochaskell.Plot
scatterPlotOf'Language.Stochaskell.Plot
scatterPositionLanguage.Stochaskell.Plot
scatterStyleLanguage.Stochaskell.Plot
scatterTransformLanguage.Stochaskell.Plot
scribeLanguage.Stochaskell.Plot
seagreenLanguage.Stochaskell.Plot
seashellLanguage.Stochaskell.Plot
secondingLanguage.Stochaskell.Plot
selectItemsLanguage.Stochaskell
selfIndexLanguage.Stochaskell.Plot
SemigroupLanguage.Stochaskell.Prelude, Language.Stochaskell
seqLanguage.Stochaskell.Prelude, Language.Stochaskell
seqListLanguage.Stochaskell
sequenceLanguage.Stochaskell.Prelude, Language.Stochaskell
sequence1Of_Language.Stochaskell.Plot
sequenceALanguage.Stochaskell.Prelude, Language.Stochaskell
sequenceAOfLanguage.Stochaskell.Plot
sequenceAOf_Language.Stochaskell.Plot
sequenceByLanguage.Stochaskell.Plot
sequenceByOfLanguage.Stochaskell.Plot
SequencedLanguage.Stochaskell.Plot
sequenceOfLanguage.Stochaskell.Plot
sequenceOf_Language.Stochaskell.Plot
sequence_Language.Stochaskell.Prelude, Language.Stochaskell
setLanguage.Stochaskell.Plot
set'Language.Stochaskell.Plot
setColorsLanguage.Stochaskell.Plot
setPickFnLanguage.Stochaskell.Plot
setRandomSeedLanguage.Stochaskell
setsLanguage.Stochaskell.Plot
setShapesLanguage.Stochaskell.Plot
SettableLanguage.Stochaskell.Plot
Setter 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Setter'Language.Stochaskell.Plot
SettingLanguage.Stochaskell.Plot
settingLanguage.Stochaskell.Plot
Setting'Language.Stochaskell.Plot
shapesLanguage.Stochaskell.Plot
ShowLanguage.Stochaskell.Prelude, Language.Stochaskell
showLanguage.Stochaskell.Prelude, Language.Stochaskell
showCharLanguage.Stochaskell.Prelude, Language.Stochaskell
showGridLinesLanguage.Stochaskell.Plot
showListLanguage.Stochaskell.Prelude, Language.Stochaskell
showParenLanguage.Stochaskell.Prelude, Language.Stochaskell
ShowSLanguage.Stochaskell.Prelude, Language.Stochaskell
showsLanguage.Stochaskell.Prelude, Language.Stochaskell
showsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
showStringLanguage.Stochaskell.Prelude, Language.Stochaskell
siennaLanguage.Stochaskell.Plot
significandLanguage.Stochaskell.Prelude, Language.Stochaskell
signumLanguage.Stochaskell.Prelude, Language.Stochaskell
silence'Language.Stochaskell
silverLanguage.Stochaskell.Plot
simChurchVecLanguage.Church
SimpleLanguage.Stochaskell.Plot
simpleLanguage.Stochaskell.Plot
simpleLensesLanguage.Stochaskell.Plot
simplyLanguage.Stochaskell.Plot
simulateLanguage.Stochaskell
sinLanguage.Stochaskell.Prelude, Language.Stochaskell
SingleAxisLanguage.Stochaskell.Plot
singleStyledPlotLegendLanguage.Stochaskell.Plot
singularLanguage.Stochaskell.Plot
sinhLanguage.Stochaskell.Prelude, Language.Stochaskell
skyblueLanguage.Stochaskell.Plot
slateblueLanguage.Stochaskell.Plot
slategrayLanguage.Stochaskell.Plot
slategreyLanguage.Stochaskell.Plot
slayouts_compress_legendLanguage.Stochaskell.Plot
slayouts_layoutsLanguage.Stochaskell.Plot
SliceLanguage.PyMC3
sliceLanguage.Stochaskell
smoothLinePlotLanguage.Stochaskell.Plot
smoothLinePlot'Language.Stochaskell.Plot
sndLanguage.Stochaskell.Prelude, Language.Stochaskell
SnocLanguage.Stochaskell.Plot
snocLanguage.Stochaskell.Plot
snowLanguage.Stochaskell.Plot
solidFillStyleLanguage.Stochaskell.Plot
solidLineLanguage.Stochaskell.Plot
solveLanguage.Stochaskell
solvePLanguage.Stochaskell
sortLanguage.Stochaskell.Prelude, Language.Stochaskell
sort2BLanguage.Stochaskell.Prelude, Language.Stochaskell
sortByLanguage.Stochaskell.Prelude, Language.Stochaskell
sortOnLanguage.Stochaskell.Prelude, Language.Stochaskell
spacerLanguage.Stochaskell.Plot
spacer1Language.Stochaskell.Plot
SpaceWeightLanguage.Stochaskell.Plot
SpanLanguage.Stochaskell.Plot
spanLanguage.Stochaskell.Prelude, Language.Stochaskell
spanListLanguage.Stochaskell
specBoundsLanguage.Stochaskell.Plot
specColourMapLanguage.Stochaskell.Plot
specPointLanguage.Stochaskell.Plot
specScaleLanguage.Stochaskell.Plot
specTransLanguage.Stochaskell.Plot
splitLanguage.Stochaskell
splitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
springgreenLanguage.Stochaskell.Plot
sqrtLanguage.Stochaskell.Prelude, Language.Stochaskell
squareLanguage.Stochaskell
SquareMatrixLanguage.Stochaskell
stackedBarsLanguage.Stochaskell.Plot
stackedEqualBarsLanguage.Stochaskell.Plot
StackedLayout 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
StackedLayoutLRLanguage.Stochaskell.Plot
StackedLayouts 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
staircaseLanguage.Stochaskell
StanDenseEMetricLanguage.Stan
StanDiagEMetricLanguage.Stan
StanHMCEngineLanguage.Stan
StanHMCMetricLanguage.Stan
StanMethodLanguage.Stan
StanNUTSEngineLanguage.Stan
StanSampleLanguage.Stan
StanStaticHMCEngineLanguage.Stan
StanUnitEMetricLanguage.Stan
star'Language.Stochaskell.Plot
starsLanguage.Stochaskell.Plot
startswithLanguage.Stochaskell
steelblueLanguage.Stochaskell.Plot
stepRandLanguage.PyMC3
stepScaleLanguage.PyMC3
stochaskellLanguage.Stochaskell
storingLanguage.Stochaskell.Plot
StretchLanguage.Stochaskell.Plot
strFromALLanguage.Stochaskell
Strict 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
strictLanguage.Stochaskell.Plot
StringLanguage.Stochaskell.Prelude, Language.Stochaskell
stripPrefixLanguage.Stochaskell.Prelude, Language.Stochaskell
strokePathLanguage.Stochaskell.Plot
strokePointPathLanguage.Stochaskell.Plot
strToALLanguage.Stochaskell
StyledPlotLanguage.Stochaskell.Plot
styledPlotLanguage.Stochaskell.Plot
styledPlotLegendsLanguage.Stochaskell.Plot
styleDynamicLanguage.Stochaskell.Plot
subIndexLanguage.Stochaskell
SubrangeTLanguage.Stochaskell.Expression
subsequencesLanguage.Stochaskell.Prelude, Language.Stochaskell
substEqLanguage.Stochaskell.Plot
subtractLanguage.Stochaskell.Prelude, Language.Stochaskell
succLanguage.Stochaskell.Prelude, Language.Stochaskell
Sum 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
sumLanguage.Stochaskell.Prelude, Language.Stochaskell
sum'Language.Stochaskell
sumOfLanguage.Stochaskell.Plot
Swapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
swappedLanguage.Stochaskell.Plot
symbolLanguage.Stochaskell
symbolsLanguage.Stochaskell
symErrPointLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - S)

stochaskell-1.0.0: A probabilistic programming language

Index - S

saddlebrownLanguage.Stochaskell.Plot
salmonLanguage.Stochaskell.Plot
sandybrownLanguage.Stochaskell.Plot
sansLanguage.Stochaskell.Plot
saveWarmupLanguage.Stan
ScalableLanguage.Stochaskell
scalarMultiplyLanguage.Stochaskell.Plot
scaleLanguage.Stochaskell.Plot
scaleAspectRatioLanguage.Stochaskell.Plot
scaledAxisLanguage.Stochaskell.Plot
scaledIntAxisLanguage.Stochaskell.Plot
scaleFloatLanguage.Stochaskell.Prelude, Language.Stochaskell
ScaleModeLanguage.Stochaskell.Plot
scaleModeLanguage.Stochaskell.Plot
scaleNumLanguage.Stochaskell.Plot
scalePLanguage.Stochaskell.Plot
scanl'Language.Stochaskell.Prelude, Language.Stochaskell
scanl1Language.Stochaskell.Prelude, Language.Stochaskell
scanl1OfLanguage.Stochaskell.Plot
scanlELanguage.Stochaskell
scanr1Language.Stochaskell.Prelude, Language.Stochaskell
scanr1OfLanguage.Stochaskell.Plot
scanrELanguage.Stochaskell
ScatterOptionsLanguage.Stochaskell.Plot
scatterOptionsLanguage.Stochaskell.Plot
ScatterPlotLanguage.Stochaskell.Plot
scatterPlotLanguage.Stochaskell.Plot
scatterPlot'Language.Stochaskell.Plot
scatterPlotOfLanguage.Stochaskell.Plot
scatterPlotOf'Language.Stochaskell.Plot
scatterPositionLanguage.Stochaskell.Plot
scatterStyleLanguage.Stochaskell.Plot
scatterTransformLanguage.Stochaskell.Plot
scribeLanguage.Stochaskell.Plot
seagreenLanguage.Stochaskell.Plot
seashellLanguage.Stochaskell.Plot
secondingLanguage.Stochaskell.Plot
selectItemsLanguage.Stochaskell
selfIndexLanguage.Stochaskell.Plot
SemigroupLanguage.Stochaskell.Prelude, Language.Stochaskell
seqLanguage.Stochaskell.Prelude, Language.Stochaskell
seqListLanguage.Stochaskell
sequenceLanguage.Stochaskell.Prelude, Language.Stochaskell
sequence1Of_Language.Stochaskell.Plot
sequenceALanguage.Stochaskell.Prelude, Language.Stochaskell
sequenceAOfLanguage.Stochaskell.Plot
sequenceAOf_Language.Stochaskell.Plot
sequenceByLanguage.Stochaskell.Plot
sequenceByOfLanguage.Stochaskell.Plot
SequencedLanguage.Stochaskell.Plot
sequenceOfLanguage.Stochaskell.Plot
sequenceOf_Language.Stochaskell.Plot
sequence_Language.Stochaskell.Prelude, Language.Stochaskell
setLanguage.Stochaskell.Plot
set'Language.Stochaskell.Plot
setColorsLanguage.Stochaskell.Plot
setPickFnLanguage.Stochaskell.Plot
setRandomSeedLanguage.Stochaskell
setsLanguage.Stochaskell.Plot
setShapesLanguage.Stochaskell.Plot
SettableLanguage.Stochaskell.Plot
Setter 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
Setter'Language.Stochaskell.Plot
SettingLanguage.Stochaskell.Plot
settingLanguage.Stochaskell.Plot
Setting'Language.Stochaskell.Plot
shapesLanguage.Stochaskell.Plot
ShowLanguage.Stochaskell.Prelude, Language.Stochaskell
showLanguage.Stochaskell.Prelude, Language.Stochaskell
Show1Language.Stochaskell.Expression
showCharLanguage.Stochaskell.Prelude, Language.Stochaskell
showGridLinesLanguage.Stochaskell.Plot
showListLanguage.Stochaskell.Prelude, Language.Stochaskell
showParenLanguage.Stochaskell.Prelude, Language.Stochaskell
ShowSLanguage.Stochaskell.Prelude, Language.Stochaskell
showsLanguage.Stochaskell.Prelude, Language.Stochaskell
showsPrecLanguage.Stochaskell.Prelude, Language.Stochaskell
showStringLanguage.Stochaskell.Prelude, Language.Stochaskell
siennaLanguage.Stochaskell.Plot
significandLanguage.Stochaskell.Prelude, Language.Stochaskell
signumLanguage.Stochaskell.Prelude, Language.Stochaskell
silence'Language.Stochaskell
silverLanguage.Stochaskell.Plot
simChurchVecLanguage.Church
SimpleLanguage.Stochaskell.Plot
simpleLanguage.Stochaskell.Plot
simpleLensesLanguage.Stochaskell.Plot
simplyLanguage.Stochaskell.Plot
simulateLanguage.Stochaskell
sinLanguage.Stochaskell.Prelude, Language.Stochaskell
SingleAxisLanguage.Stochaskell.Plot
singleStyledPlotLegendLanguage.Stochaskell.Plot
singularLanguage.Stochaskell.Plot
sinhLanguage.Stochaskell.Prelude, Language.Stochaskell
skyblueLanguage.Stochaskell.Plot
slateblueLanguage.Stochaskell.Plot
slategrayLanguage.Stochaskell.Plot
slategreyLanguage.Stochaskell.Plot
slayouts_compress_legendLanguage.Stochaskell.Plot
slayouts_layoutsLanguage.Stochaskell.Plot
SliceLanguage.PyMC3
sliceLanguage.Stochaskell
smoothLinePlotLanguage.Stochaskell.Plot
smoothLinePlot'Language.Stochaskell.Plot
sndLanguage.Stochaskell.Prelude, Language.Stochaskell
SnocLanguage.Stochaskell.Plot
snocLanguage.Stochaskell.Plot
snowLanguage.Stochaskell.Plot
solidFillStyleLanguage.Stochaskell.Plot
solidLineLanguage.Stochaskell.Plot
solveLanguage.Stochaskell
solvePLanguage.Stochaskell
sortLanguage.Stochaskell.Prelude, Language.Stochaskell
sort2BLanguage.Stochaskell.Prelude, Language.Stochaskell
sortByLanguage.Stochaskell.Prelude, Language.Stochaskell
sortOnLanguage.Stochaskell.Prelude, Language.Stochaskell
spacerLanguage.Stochaskell.Plot
spacer1Language.Stochaskell.Plot
SpaceWeightLanguage.Stochaskell.Plot
SpanLanguage.Stochaskell.Plot
spanLanguage.Stochaskell.Prelude, Language.Stochaskell
spanListLanguage.Stochaskell
specBoundsLanguage.Stochaskell.Plot
specColourMapLanguage.Stochaskell.Plot
specPointLanguage.Stochaskell.Plot
specScaleLanguage.Stochaskell.Plot
specTransLanguage.Stochaskell.Plot
splitLanguage.Stochaskell
splitAtLanguage.Stochaskell.Prelude, Language.Stochaskell
springgreenLanguage.Stochaskell.Plot
sqrtLanguage.Stochaskell.Prelude, Language.Stochaskell
squareLanguage.Stochaskell
SquareMatrixLanguage.Stochaskell
stackedBarsLanguage.Stochaskell.Plot
stackedEqualBarsLanguage.Stochaskell.Plot
StackedLayout 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
StackedLayoutLRLanguage.Stochaskell.Plot
StackedLayouts 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
staircaseLanguage.Stochaskell
StanDenseEMetricLanguage.Stan
StanDiagEMetricLanguage.Stan
StanHMCEngineLanguage.Stan
StanHMCMetricLanguage.Stan
StanMethodLanguage.Stan
StanNUTSEngineLanguage.Stan
StanSampleLanguage.Stan
StanStaticHMCEngineLanguage.Stan
StanUnitEMetricLanguage.Stan
star'Language.Stochaskell.Plot
starsLanguage.Stochaskell.Plot
startswithLanguage.Stochaskell
steelblueLanguage.Stochaskell.Plot
stepRandLanguage.PyMC3
stepScaleLanguage.PyMC3
stochaskellLanguage.Stochaskell
storingLanguage.Stochaskell.Plot
StretchLanguage.Stochaskell.Plot
strFromALLanguage.Stochaskell
Strict 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
strictLanguage.Stochaskell.Plot
StringLanguage.Stochaskell.Prelude, Language.Stochaskell
stripPrefixLanguage.Stochaskell.Prelude, Language.Stochaskell
strokePathLanguage.Stochaskell.Plot
strokePointPathLanguage.Stochaskell.Plot
strToALLanguage.Stochaskell
StyledPlotLanguage.Stochaskell.Plot
styledPlotLanguage.Stochaskell.Plot
styledPlotLegendsLanguage.Stochaskell.Plot
styleDynamicLanguage.Stochaskell.Plot
subIndexLanguage.Stochaskell
SubrangeTLanguage.Stochaskell.Expression
subsequencesLanguage.Stochaskell.Prelude, Language.Stochaskell
substEqLanguage.Stochaskell.Plot
subtractLanguage.Stochaskell.Prelude, Language.Stochaskell
succLanguage.Stochaskell.Prelude, Language.Stochaskell
Sum 
1 (Data Constructor)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Type/Class)Language.Stochaskell.Prelude, Language.Stochaskell
sumLanguage.Stochaskell.Prelude, Language.Stochaskell
sum'Language.Stochaskell
sumOfLanguage.Stochaskell.Plot
Swapped 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
swappedLanguage.Stochaskell.Plot
symbolLanguage.Stochaskell
symbolsLanguage.Stochaskell
symErrPointLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-T.html b/docs/doc/doc-index-T.html index 964dad5..881fdf9 100644 --- a/docs/doc/doc-index-T.html +++ b/docs/doc/doc-index-T.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - T)

stochaskell-0.1.0: A probabilistic programming language

Index - T

TagLanguage.Stochaskell.Expression
Tags 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tagsLanguage.Stochaskell.Expression
tailLanguage.Stochaskell.Prelude, Language.Stochaskell
tailsLanguage.Stochaskell.Prelude, Language.Stochaskell
takeLanguage.Stochaskell.Prelude, Language.Stochaskell
takeColorLanguage.Stochaskell.Plot
takeShapeLanguage.Stochaskell.Plot
takeWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
takeWhileListLanguage.Stochaskell
takingLanguage.Stochaskell.Plot
takingWhileLanguage.Stochaskell.Plot
tallBesideLanguage.Stochaskell.Plot
tan 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
tanhLanguage.Stochaskell.Prelude, Language.Stochaskell
tealLanguage.Stochaskell.Plot
textDimensionLanguage.Stochaskell.Plot
textDrawRectLanguage.Stochaskell.Plot
TextFunctionLanguage.Stochaskell.Plot
TextSize 
1 (Data Constructor)Language.Stochaskell.Plot
2 (Type/Class)Language.Stochaskell.Plot
textSizeLanguage.Stochaskell.Plot
textSizeAscentLanguage.Stochaskell.Plot
textSizeDescentLanguage.Stochaskell.Plot
textSizeHeightLanguage.Stochaskell.Plot
textSizeWidthLanguage.Stochaskell.Plot
textSizeYBearingLanguage.Stochaskell.Plot
textStyleLanguage.Stochaskell.Plot
textStyleFunctionLanguage.Stochaskell.Plot
thetaAxisLanguage.Stochaskell.Plot
thetaLabelLanguage.Stochaskell.Plot
thinLanguage.Stan
thistleLanguage.Stochaskell.Plot
ticLanguage.Stochaskell
tickLabelLanguage.Stochaskell.Plot
tickLabelFunctionLanguage.Stochaskell.Plot
tickLabelGapLanguage.Stochaskell.Plot
tickLabelPositionsLanguage.Stochaskell.Plot
TickLabelsLanguage.Stochaskell.Plot
tickLabelStyleLanguage.Stochaskell.Plot
tickLabelTextFunctionLanguage.Stochaskell.Plot
TicksLanguage.Stochaskell.Plot
ticksAlignLanguage.Stochaskell.Plot
TicksAlignmentLanguage.Stochaskell.Plot
TickSpecLanguage.Stochaskell.Plot
ticksStyleLanguage.Stochaskell.Plot
ticksVisibleLanguage.Stochaskell.Plot
TimeLabelAlignmentLanguage.Stochaskell.Plot
TimeLabelFnLanguage.Stochaskell.Plot
TimeSeqLanguage.Stochaskell.Plot
TimeValueLanguage.Stochaskell.Plot
timeValueAxisLanguage.Stochaskell.Plot
timeValueFromDoubleLanguage.Stochaskell.Plot
TitleLanguage.Stochaskell.Plot
titleLanguage.Stochaskell.Plot
titleGapLanguage.Stochaskell.Plot
titlePlacementLanguage.Stochaskell.Plot
titleStyleLanguage.Stochaskell.Plot
titleTextLanguage.Stochaskell.Plot
toLanguage.Stochaskell.Plot
tocLanguage.Stochaskell
toConcreteLanguage.Stochaskell.Expression
toConcreteCLanguage.Stochaskell.Expression
toEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
toExprTupleLanguage.Stochaskell.Expression
toIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
toListLanguage.Stochaskell
toListOfLanguage.Stochaskell.Plot
tomatoLanguage.Stochaskell.Plot
toNonEmptyOfLanguage.Stochaskell.Plot
topLanguage.Stochaskell.Plot
topLeftLanguage.Stochaskell.Plot
ToPlotLanguage.Stochaskell.Plot
toPlotLanguage.Stochaskell.Plot
TopNameLanguage.Stochaskell.Plot
ToPNGLanguage.Stochaskell.Plot
toPNGLanguage.Stochaskell.Plot
topRightLanguage.Stochaskell.Plot
toRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
ToRenderableLanguage.Stochaskell.Plot
toRenderableLanguage.Stochaskell.Plot
toStopsLanguage.Stochaskell.Plot
toValueLanguage.Stochaskell.Plot
trLanguage.Stochaskell
tr'Language.Stochaskell
trailPlotLanguage.Stochaskell.Plot
trailPlot'Language.Stochaskell.Plot
TransfiniteLanguage.Stochaskell
transformLanguage.Stochaskell.Plot
transformMLanguage.Stochaskell.Plot
transformMOfLanguage.Stochaskell.Plot
transformMOnLanguage.Stochaskell.Plot
transformMOnOfLanguage.Stochaskell.Plot
transformOfLanguage.Stochaskell.Plot
transformOnLanguage.Stochaskell.Plot
transformOnOfLanguage.Stochaskell.Plot
transformPLanguage.Stochaskell.Plot
translateLanguage.Stochaskell.Plot
translatePLanguage.Stochaskell.Plot
transparentLanguage.Stochaskell.Plot
TransposableLanguage.Stochaskell
transposeLanguage.Stochaskell.Prelude, Language.Stochaskell
transposeOfLanguage.Stochaskell.Plot
TraversableLanguage.Stochaskell.Plot, Language.Stochaskell.Prelude, Language.Stochaskell
Traversable1Language.Stochaskell.Plot
TraversableWithIndexLanguage.Stochaskell.Plot
Traversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Traversal'Language.Stochaskell.Plot
Traversal1Language.Stochaskell.Plot
Traversal1'Language.Stochaskell.Plot
traverseLanguage.Stochaskell.Plot, Language.Stochaskell.Prelude, Language.Stochaskell
traverse1Language.Stochaskell.Plot
traverse1Of_Language.Stochaskell.Plot
traverseByLanguage.Stochaskell.Plot
traverseByOfLanguage.Stochaskell.Plot
TraversedLanguage.Stochaskell.Plot
traversedLanguage.Stochaskell.Plot
traversed1Language.Stochaskell.Plot
traversed64Language.Stochaskell.Plot
TraverseMaxLanguage.Stochaskell.Plot
traverseMaxLanguage.Stochaskell.Plot
TraverseMinLanguage.Stochaskell.Plot
traverseMinLanguage.Stochaskell.Plot
traverseOfLanguage.Stochaskell.Plot
traverseOf_Language.Stochaskell.Plot
TraversingLanguage.Stochaskell.Plot
Traversing'Language.Stochaskell.Plot
Traversing1Language.Stochaskell.Plot
Traversing1'Language.Stochaskell.Plot
TrueLanguage.Stochaskell.Prelude, Language.Stochaskell
trueLanguage.Stochaskell.Prelude, Language.Stochaskell
truncateLanguage.Stochaskell.Prelude, Language.Stochaskell
truncatedLanguage.Stochaskell
tspanLanguage.Stochaskell.Plot
TupleSize 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tupleSizeLanguage.Stochaskell.Expression
TupleTLanguage.Stochaskell.Expression
tupleTLanguage.Stochaskell.Expression
turquoiseLanguage.Stochaskell.Plot
tvalLanguage.Stochaskell.Plot
tvFromUTCTimeLanguage.Stochaskell.Plot
TypeLanguage.Stochaskell.Expression
TypeIsLanguage.Stochaskell.Expression
TypeOfLanguage.Stochaskell.Expression
typeOfLanguage.Stochaskell.Expression
TypesIsLanguage.Stochaskell.Expression
TypesOfLanguage.Stochaskell.Expression
typesOfLanguage.Stochaskell.Expression
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - T)

stochaskell-1.0.0: A probabilistic programming language

Index - T

TagLanguage.Stochaskell.Expression
Tags 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tagsLanguage.Stochaskell.Expression
tailLanguage.Stochaskell.Prelude, Language.Stochaskell
tailsLanguage.Stochaskell.Prelude, Language.Stochaskell
takeLanguage.Stochaskell.Prelude, Language.Stochaskell
takeColorLanguage.Stochaskell.Plot
takeShapeLanguage.Stochaskell.Plot
takeWhileLanguage.Stochaskell.Prelude, Language.Stochaskell
takeWhileListLanguage.Stochaskell
takingLanguage.Stochaskell.Plot
takingWhileLanguage.Stochaskell.Plot
tallBesideLanguage.Stochaskell.Plot
tanLanguage.Stochaskell.Prelude, Language.Stochaskell
tanhLanguage.Stochaskell.Prelude, Language.Stochaskell
tealLanguage.Stochaskell.Plot
textDimensionLanguage.Stochaskell.Plot
textDrawRectLanguage.Stochaskell.Plot
TextFunctionLanguage.Stochaskell.Plot
TextSize 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
textSizeLanguage.Stochaskell.Plot
textSizeAscentLanguage.Stochaskell.Plot
textSizeDescentLanguage.Stochaskell.Plot
textSizeHeightLanguage.Stochaskell.Plot
textSizeWidthLanguage.Stochaskell.Plot
textSizeYBearingLanguage.Stochaskell.Plot
textStyleLanguage.Stochaskell.Plot
textStyleFunctionLanguage.Stochaskell.Plot
thetaAxisLanguage.Stochaskell.Plot
thetaLabelLanguage.Stochaskell.Plot
thinLanguage.Stan
thistleLanguage.Stochaskell.Plot
ticLanguage.Stochaskell
tickLabelLanguage.Stochaskell.Plot
tickLabelFunctionLanguage.Stochaskell.Plot
tickLabelGapLanguage.Stochaskell.Plot
tickLabelPositionsLanguage.Stochaskell.Plot
TickLabelsLanguage.Stochaskell.Plot
tickLabelStyleLanguage.Stochaskell.Plot
tickLabelTextFunctionLanguage.Stochaskell.Plot
TicksLanguage.Stochaskell.Plot
ticksAlignLanguage.Stochaskell.Plot
TicksAlignmentLanguage.Stochaskell.Plot
TickSpecLanguage.Stochaskell.Plot
ticksStyleLanguage.Stochaskell.Plot
ticksVisibleLanguage.Stochaskell.Plot
TimeLabelAlignmentLanguage.Stochaskell.Plot
TimeLabelFnLanguage.Stochaskell.Plot
TimeSeqLanguage.Stochaskell.Plot
TimeValueLanguage.Stochaskell.Plot
timeValueAxisLanguage.Stochaskell.Plot
timeValueFromDoubleLanguage.Stochaskell.Plot
TitleLanguage.Stochaskell.Plot
titleLanguage.Stochaskell.Plot
titleAlignmentLanguage.Stochaskell.Plot
titleGapLanguage.Stochaskell.Plot
titlePlacementLanguage.Stochaskell.Plot
titleStyleLanguage.Stochaskell.Plot
titleTextLanguage.Stochaskell.Plot
titleTextFunctionLanguage.Stochaskell.Plot
toLanguage.Stochaskell.Plot
tocLanguage.Stochaskell
toConcreteLanguage.Stochaskell.Expression
toConcreteCLanguage.Stochaskell.Expression
toEnumLanguage.Stochaskell.Prelude, Language.Stochaskell
toExprTupleLanguage.Stochaskell.Expression
ToImageLanguage.Stochaskell.Plot
toIntegerLanguage.Stochaskell.Prelude, Language.Stochaskell
toListLanguage.Stochaskell
toListOfLanguage.Stochaskell.Plot
tomatoLanguage.Stochaskell.Plot
toNonEmptyOfLanguage.Stochaskell.Plot
topLanguage.Stochaskell.Plot
topLeftLanguage.Stochaskell.Plot
ToPlotLanguage.Stochaskell.Plot
toPlotLanguage.Stochaskell.Plot
TopNameLanguage.Stochaskell.Plot
toPNGLanguage.Stochaskell.Plot
topRightLanguage.Stochaskell.Plot
toRationalLanguage.Stochaskell.Prelude, Language.Stochaskell
ToRenderableLanguage.Stochaskell.Plot
toRenderableLanguage.Stochaskell.Plot
toStopsLanguage.Stochaskell.Plot
toSVGLanguage.Stochaskell.Plot
toValueLanguage.Stochaskell.Plot
trLanguage.Stochaskell
tr'Language.Stochaskell
trailPlotLanguage.Stochaskell.Plot
trailPlot'Language.Stochaskell.Plot
TransfiniteLanguage.Stochaskell
transformLanguage.Stochaskell.Plot
transformMLanguage.Stochaskell.Plot
transformMOfLanguage.Stochaskell.Plot
transformMOnLanguage.Stochaskell.Plot
transformMOnOfLanguage.Stochaskell.Plot
transformOfLanguage.Stochaskell.Plot
transformOnLanguage.Stochaskell.Plot
transformOnOfLanguage.Stochaskell.Plot
transformPLanguage.Stochaskell.Plot
translateLanguage.Stochaskell.Plot
translatePLanguage.Stochaskell.Plot
transparentLanguage.Stochaskell.Plot
TransposableLanguage.Stochaskell
transposeLanguage.Stochaskell.Prelude, Language.Stochaskell
transposeOfLanguage.Stochaskell.Plot
TraversableLanguage.Stochaskell.Prelude, Language.Stochaskell, Language.Stochaskell.Plot
Traversable1Language.Stochaskell.Plot
TraversableWithIndexLanguage.Stochaskell.Plot
Traversal 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
Traversal'Language.Stochaskell.Plot
Traversal1Language.Stochaskell.Plot
Traversal1'Language.Stochaskell.Plot
traverseLanguage.Stochaskell.Prelude, Language.Stochaskell, Language.Stochaskell.Plot
traverse1Language.Stochaskell.Plot
traverse1Of_Language.Stochaskell.Plot
traverseByLanguage.Stochaskell.Plot
traverseByOfLanguage.Stochaskell.Plot
TraversedLanguage.Stochaskell.Plot
traversedLanguage.Stochaskell.Plot
traversed1Language.Stochaskell.Plot
traversed64Language.Stochaskell.Plot
TraverseMaxLanguage.Stochaskell.Plot
traverseMaxLanguage.Stochaskell.Plot
TraverseMinLanguage.Stochaskell.Plot
traverseMinLanguage.Stochaskell.Plot
traverseOfLanguage.Stochaskell.Plot
traverseOf_Language.Stochaskell.Plot
TraversingLanguage.Stochaskell.Plot
Traversing'Language.Stochaskell.Plot
Traversing1Language.Stochaskell.Plot
Traversing1'Language.Stochaskell.Plot
TrueLanguage.Stochaskell.Prelude, Language.Stochaskell
trueLanguage.Stochaskell.Prelude, Language.Stochaskell
truncateLanguage.Stochaskell.Prelude, Language.Stochaskell
truncatedLanguage.Stochaskell
tspanLanguage.Stochaskell.Plot
TupleSize 
1 (Type/Class)Language.Stochaskell.Expression
2 (Data Constructor)Language.Stochaskell.Expression
tupleSizeLanguage.Stochaskell.Expression
TupleTLanguage.Stochaskell.Expression
tupleTLanguage.Stochaskell.Expression
turquoiseLanguage.Stochaskell.Plot
tvalLanguage.Stochaskell.Plot
tvFromUTCTimeLanguage.Stochaskell.Plot
TypeLanguage.Stochaskell.Expression
TypeIsLanguage.Stochaskell.Expression
TypeOfLanguage.Stochaskell.Expression
typeOfLanguage.Stochaskell.Expression
TypesIsLanguage.Stochaskell.Expression
TypesOfLanguage.Stochaskell.Expression
typesOfLanguage.Stochaskell.Expression
\ No newline at end of file diff --git a/docs/doc/doc-index-U.html b/docs/doc/doc-index-U.html index 6709cf0..ac1f2f9 100644 --- a/docs/doc/doc-index-U.html +++ b/docs/doc/doc-index-U.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - U)

stochaskell-0.1.0: A probabilistic programming language

Index - U

unLanguage.Stochaskell.Plot
uncons 
1 (Function)Language.Stochaskell.Plot
2 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
uncurriedLanguage.Stochaskell.Plot
uncurryLanguage.Stochaskell.Prelude, Language.Stochaskell
undefinedLanguage.Stochaskell.Prelude, Language.Stochaskell
underLanguage.Stochaskell.Plot
underscoreFieldsLanguage.Stochaskell.Plot
underscoreNamerLanguage.Stochaskell.Plot
underscoreNoPrefixNamerLanguage.Stochaskell.Plot
UnderTicksLanguage.Stochaskell.Plot
unfoldedLanguage.Stochaskell.Plot
unfoldrLanguage.Stochaskell.Prelude, Language.Stochaskell
UniformLanguage.Stochaskell
uniformLanguage.Stochaskell
UniformsLanguage.Stochaskell
uniformsLanguage.Stochaskell
UniformScaleLanguage.Stochaskell.Plot
UniformScaleStrategyLanguage.Stochaskell.Plot
unionLanguage.Stochaskell.Prelude, Language.Stochaskell
unionByLanguage.Stochaskell.Prelude, Language.Stochaskell
UnionTLanguage.Stochaskell.Expression
uniqLanguage.Stochaskell
unitAxisLanguage.Stochaskell.Plot
unitedLanguage.Stochaskell.Plot
UnitOnlyLanguage.Stochaskell.Plot
universeLanguage.Stochaskell.Plot
universeOfLanguage.Stochaskell.Plot
universeOnLanguage.Stochaskell.Plot
universeOnOfLanguage.Stochaskell.Plot
UnknownTypeLanguage.Stochaskell.Expression
unlessLanguage.Stochaskell.Prelude, Language.Stochaskell
unlinesLanguage.Stochaskell.Prelude, Language.Stochaskell
unPercentLanguage.Stochaskell.Plot
unpolarLanguage.Stochaskell.Plot
unsafePartsOfLanguage.Stochaskell.Plot
unsafePartsOf'Language.Stochaskell.Plot
unsafeSingularLanguage.Stochaskell.Plot
unsnocLanguage.Stochaskell.Plot
untilLanguage.Stochaskell.Prelude, Language.Stochaskell
untoLanguage.Stochaskell.Plot
unwordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Unwrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
unzipLanguage.Stochaskell.Prelude, Language.Stochaskell
unzip3Language.Stochaskell.Prelude, Language.Stochaskell
unzip4Language.Stochaskell.Prelude, Language.Stochaskell
unzip5Language.Stochaskell.Prelude, Language.Stochaskell
unzip6Language.Stochaskell.Prelude, Language.Stochaskell
unzip7Language.Stochaskell.Prelude, Language.Stochaskell
UpperAxisLabelLanguage.Stochaskell.Plot
useLanguage.Stochaskell.Plot
userErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
usesLanguage.Stochaskell.Plot
utctimeFromTVLanguage.Stochaskell.Plot
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - U)

stochaskell-1.0.0: A probabilistic programming language

Index - U

unLanguage.Stochaskell.Plot
uncons 
1 (Function)Language.Stochaskell.Prelude, Language.Stochaskell
2 (Function)Language.Stochaskell.Plot
uncurriedLanguage.Stochaskell.Plot
uncurryLanguage.Stochaskell.Prelude, Language.Stochaskell
undefinedLanguage.Stochaskell.Prelude, Language.Stochaskell
underLanguage.Stochaskell.Plot
underscoreFieldsLanguage.Stochaskell.Plot
underscoreNamerLanguage.Stochaskell.Plot
underscoreNoPrefixNamerLanguage.Stochaskell.Plot
UnderTicksLanguage.Stochaskell.Plot
unfixELanguage.Stochaskell.Expression
unfoldELanguage.Stochaskell
unfoldedLanguage.Stochaskell.Plot
unfoldPLanguage.Stochaskell
unfoldrLanguage.Stochaskell.Prelude, Language.Stochaskell
unGenerically1Language.Stochaskell.Expression
UniformLanguage.Stochaskell
uniformLanguage.Stochaskell
UniformsLanguage.Stochaskell
uniformsLanguage.Stochaskell
UniformScaleLanguage.Stochaskell.Plot
UniformScaleStrategyLanguage.Stochaskell.Plot
unionLanguage.Stochaskell.Prelude, Language.Stochaskell
unionByLanguage.Stochaskell.Prelude, Language.Stochaskell
UnionTLanguage.Stochaskell.Expression
uniqLanguage.Stochaskell
unitAxisLanguage.Stochaskell.Plot
unitedLanguage.Stochaskell.Plot
UnitOnlyLanguage.Stochaskell.Plot
universeLanguage.Stochaskell.Plot
universeOfLanguage.Stochaskell.Plot
universeOnLanguage.Stochaskell.Plot
universeOnOfLanguage.Stochaskell.Plot
UnknownTypeLanguage.Stochaskell.Expression
unlessLanguage.Stochaskell.Prelude, Language.Stochaskell
unlinesLanguage.Stochaskell.Prelude, Language.Stochaskell
unPercentLanguage.Stochaskell.Plot
unpolarLanguage.Stochaskell.Plot
unsafePartsOfLanguage.Stochaskell.Plot
unsafePartsOf'Language.Stochaskell.Plot
unsafeSingularLanguage.Stochaskell.Plot
unsnocLanguage.Stochaskell.Plot
untilLanguage.Stochaskell.Prelude, Language.Stochaskell
untoLanguage.Stochaskell.Plot
unwordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Unwrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
unzipLanguage.Stochaskell.Prelude, Language.Stochaskell
unzip3Language.Stochaskell.Prelude, Language.Stochaskell
unzip4Language.Stochaskell.Prelude, Language.Stochaskell
unzip5Language.Stochaskell.Prelude, Language.Stochaskell
unzip6Language.Stochaskell.Prelude, Language.Stochaskell
unzip7Language.Stochaskell.Prelude, Language.Stochaskell
UpperAxisLabelLanguage.Stochaskell.Plot
useLanguage.Stochaskell.Plot
userErrorLanguage.Stochaskell.Prelude, Language.Stochaskell
usesLanguage.Stochaskell.Plot
utctimeFromTVLanguage.Stochaskell.Plot
\ No newline at end of file diff --git a/docs/doc/doc-index-V.html b/docs/doc/doc-index-V.html index 57a3f4e..2eb5fc9 100644 --- a/docs/doc/doc-index-V.html +++ b/docs/doc/doc-index-V.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - V)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - V)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-W.html b/docs/doc/doc-index-W.html index 84c240d..d3203bf 100644 --- a/docs/doc/doc-index-W.html +++ b/docs/doc/doc-index-W.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - W)

stochaskell-0.1.0: A probabilistic programming language

Index - W

WedgeLanguage.Stochaskell.Plot
wedgeDirectionLanguage.Stochaskell.Plot
wedgeInnerRadiusLanguage.Stochaskell.Plot
wedgeKeysLanguage.Stochaskell.Plot
wedgeOffsetLanguage.Stochaskell.Plot
wedgeOuterRadiusLanguage.Stochaskell.Plot
wedgePlotLanguage.Stochaskell.Plot
wedgeWidthLanguage.Stochaskell.Plot
weightsLanguage.Stochaskell.Plot
wheatLanguage.Stochaskell.Plot
whenLanguage.Stochaskell.Prelude, Language.Stochaskell
whiteLanguage.Stochaskell.Plot
whitesmokeLanguage.Stochaskell.Plot
WholeFunc 
1 (Type/Class)Language.Stochaskell
2 (Data Constructor)Language.Stochaskell
wholeMapLanguage.Stochaskell
wideAboveLanguage.Stochaskell.Plot
widthLanguage.Stochaskell.Plot
withClipRegionLanguage.Stochaskell.Plot
withDefaultStyleLanguage.Stochaskell.Plot
withFillStyleLanguage.Stochaskell.Plot
withFontStyleLanguage.Stochaskell.Plot
withinLanguage.Stochaskell.Plot
withIndexLanguage.Stochaskell.Plot
withIsoLanguage.Stochaskell.Plot
withLineStyleLanguage.Stochaskell.Plot
withOpacityLanguage.Stochaskell.Plot
withoutLanguage.Stochaskell.Plot
withPointStyleLanguage.Stochaskell.Plot
withPrismLanguage.Stochaskell.Plot
withRotationLanguage.Stochaskell.Plot
withScaleLanguage.Stochaskell.Plot
withScaleXLanguage.Stochaskell.Plot
withScaleYLanguage.Stochaskell.Plot
withTransformLanguage.Stochaskell.Plot
withTranslationLanguage.Stochaskell.Plot
WordLanguage.Stochaskell.Prelude, Language.Stochaskell
wordedLanguage.Stochaskell.Plot
wordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Wrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
writeFileLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - W)

stochaskell-1.0.0: A probabilistic programming language

Index - W

WedgeLanguage.Stochaskell.Plot
wedgeDirectionLanguage.Stochaskell.Plot
wedgeInnerRadiusLanguage.Stochaskell.Plot
wedgeKeysLanguage.Stochaskell.Plot
wedgeOffsetLanguage.Stochaskell.Plot
wedgeOuterRadiusLanguage.Stochaskell.Plot
wedgePlotLanguage.Stochaskell.Plot
wedgeWidthLanguage.Stochaskell.Plot
weightsLanguage.Stochaskell.Plot
wheatLanguage.Stochaskell.Plot
whenLanguage.Stochaskell.Prelude, Language.Stochaskell
whiteLanguage.Stochaskell.Plot
whitesmokeLanguage.Stochaskell.Plot
WholeFunc 
1 (Data Constructor)Language.Stochaskell
2 (Type/Class)Language.Stochaskell
wholeMapLanguage.Stochaskell
wideAboveLanguage.Stochaskell.Plot
widthLanguage.Stochaskell.Plot
withClipRegionLanguage.Stochaskell.Plot
withDefaultStyleLanguage.Stochaskell.Plot
withFillStyleLanguage.Stochaskell.Plot
withFontStyleLanguage.Stochaskell.Plot
withinLanguage.Stochaskell.Plot
withIndexLanguage.Stochaskell.Plot
withIsoLanguage.Stochaskell.Plot
withLineStyleLanguage.Stochaskell.Plot
withOpacityLanguage.Stochaskell.Plot
withoutLanguage.Stochaskell.Plot
withPointStyleLanguage.Stochaskell.Plot
withPrismLanguage.Stochaskell.Plot
withRotationLanguage.Stochaskell.Plot
withScaleLanguage.Stochaskell.Plot
withScaleXLanguage.Stochaskell.Plot
withScaleYLanguage.Stochaskell.Plot
withTransformLanguage.Stochaskell.Plot
withTranslationLanguage.Stochaskell.Plot
WordLanguage.Stochaskell.Prelude, Language.Stochaskell
wordedLanguage.Stochaskell.Plot
wordsLanguage.Stochaskell.Prelude, Language.Stochaskell
Wrapped 
1 (Type/Class)Language.Stochaskell.Plot
2 (Data Constructor)Language.Stochaskell.Plot
writeFileLanguage.Stochaskell.Prelude, Language.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index-X.html b/docs/doc/doc-index-X.html index 729042d..d1c2fee 100644 --- a/docs/doc/doc-index-X.html +++ b/docs/doc/doc-index-X.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - X)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - X)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-Y.html b/docs/doc/doc-index-Y.html index 2998ba0..991d3dc 100644 --- a/docs/doc/doc-index-Y.html +++ b/docs/doc/doc-index-Y.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - Y)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - Y)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/doc-index-Z.html b/docs/doc/doc-index-Z.html index 28788c5..3fc0310 100644 --- a/docs/doc/doc-index-Z.html +++ b/docs/doc/doc-index-Z.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index - Z)

stochaskell-0.1.0: A probabilistic programming language

Index - Z

ZLanguage.Stochaskell
zAxisLanguage.Stochaskell.Plot
zerosLanguage.Stochaskell
zipLanguage.Stochaskell.Prelude, Language.Stochaskell
zip3Language.Stochaskell.Prelude, Language.Stochaskell
zip4Language.Stochaskell.Prelude, Language.Stochaskell
zip5Language.Stochaskell.Prelude, Language.Stochaskell
zip6Language.Stochaskell.Prelude, Language.Stochaskell
zip7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWith3Language.Stochaskell.Prelude, Language.Stochaskell
zipWith4Language.Stochaskell.Prelude, Language.Stochaskell
zipWith5Language.Stochaskell.Prelude, Language.Stochaskell
zipWith6Language.Stochaskell.Prelude, Language.Stochaskell
zipWith7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithMLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWithM_Language.Stochaskell.Prelude, Language.Stochaskell
zLabelLanguage.Stochaskell.Plot
ZMatLanguage.Stochaskell
zMaxLanguage.Stochaskell.Plot
zMinLanguage.Stochaskell.Plot
ZoomLanguage.Stochaskell.Plot
zoomLanguage.Stochaskell.Plot
ZoomedLanguage.Stochaskell.Plot
ZVecLanguage.Stochaskell
\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index - Z)

stochaskell-1.0.0: A probabilistic programming language

Index - Z

ZLanguage.Stochaskell
zAxisLanguage.Stochaskell.Plot
zerosLanguage.Stochaskell
zipLanguage.Stochaskell.Prelude, Language.Stochaskell
zip3Language.Stochaskell.Prelude, Language.Stochaskell
zip4Language.Stochaskell.Prelude, Language.Stochaskell
zip5Language.Stochaskell.Prelude, Language.Stochaskell
zip6Language.Stochaskell.Prelude, Language.Stochaskell
zip7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWith3Language.Stochaskell.Prelude, Language.Stochaskell
zipWith4Language.Stochaskell.Prelude, Language.Stochaskell
zipWith5Language.Stochaskell.Prelude, Language.Stochaskell
zipWith6Language.Stochaskell.Prelude, Language.Stochaskell
zipWith7Language.Stochaskell.Prelude, Language.Stochaskell
zipWithMLanguage.Stochaskell.Prelude, Language.Stochaskell
zipWithM_Language.Stochaskell.Prelude, Language.Stochaskell
zLabelLanguage.Stochaskell.Plot
ZMatLanguage.Stochaskell
zMaxLanguage.Stochaskell.Plot
zMinLanguage.Stochaskell.Plot
ZoomLanguage.Stochaskell.Plot
zoomLanguage.Stochaskell.Plot
ZoomedLanguage.Stochaskell.Plot
ZVecLanguage.Stochaskell
\ No newline at end of file diff --git a/docs/doc/doc-index.html b/docs/doc/doc-index.html index 5fdbbd5..9e6262f 100644 --- a/docs/doc/doc-index.html +++ b/docs/doc/doc-index.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language (Index)

stochaskell-0.1.0: A probabilistic programming language

\ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language (Index)

stochaskell-1.0.0: A probabilistic programming language

\ No newline at end of file diff --git a/docs/doc/haddock-bundle.min.js b/docs/doc/haddock-bundle.min.js index 8bf397c..1061714 100644 --- a/docs/doc/haddock-bundle.min.js +++ b/docs/doc/haddock-bundle.min.js @@ -1,2 +1,2 @@ -!function e(t,n,o){function r(s,a){if(!n[s]){if(!t[s]){var l="function"==typeof require&&require;if(!a&&l)return l(s,!0);if(i)return i(s,!0);var c=new Error("Cannot find module '"+s+"'");throw c.code="MODULE_NOT_FOUND",c}var u=n[s]={exports:{}};t[s][0].call(u.exports,function(e){var n=t[s][1][e];return r(n||e)},u,u.exports,e,t,n,o)}return n[s].exports}for(var i="function"==typeof require&&require,s=0;s element with id '"+e+"'");return t}function r(e){for(var t=e.target,n=t.id,r=o(n),i=r.element.open,s=0,l=r.toggles;s0&&(d[n.id]={element:n,openByDefault:!!n.open,toggles:[]},n.addEventListener("toggle",r))}}function s(e){var t=o(e).element;t.open=!t.open}function a(){var e=Object.keys(p);document.cookie="toggled="+encodeURIComponent(e.join("+"))}function l(){var e=h.getCookie("toggled");if(e)for(var t=0,n=e.split("+");t=0&&e.followActiveLink()),"s"===t.key&&"input"!==t.target.tagName.toLowerCase()&&(t.preventDefault(),e.show())})},t.prototype.hide=function(){this.setState({isVisible:!1})},t.prototype.show=function(){this.state.isVisible||(this.focusPlease=!0,this.setState({isVisible:!0,activeLinkIndex:-1}))},t.prototype.toggleVisibility=function(){this.state.isVisible?this.hide():this.show()},t.prototype.navigateLinks=function(e){var t=Math.max(-1,Math.min(this.linkIndex-1,this.state.activeLinkIndex+e));this.navigatedByKeyboard=!0,this.setState({activeLinkIndex:t})},t.prototype.followActiveLink=function(){this.activeLinkAction&&this.activeLinkAction()},t.prototype.updateResults=function(){var e=this.input&&this.input.value||"",t={};this.state.fuse.search(e).forEach(function(e){var n=e.item.module;(t[n]||(t[n]=[])).push(e)});var n=[];for(var o in t)!function(e){var o=t[e],r=0;o.forEach(function(e){r+=1/e.score}),n.push({module:e,totalScore:1/r,items:o})}(o);n.sort(function(e,t){return e.totalScore-t.totalScore}),this.setState({searchString:e,isVisible:!0,moduleResults:n})},t.prototype.componentDidUpdate=function(){if(this.searchResults&&this.activeLink&&this.navigatedByKeyboard){var e=this.activeLink.getClientRects()[0],t=this.searchResults.getClientRects()[0].top;e.bottom>window.innerHeight?this.searchResults.scrollTop+=e.bottom-window.innerHeight+80:e.top=0}function s(e,t){var n=o(e.className||"");n.indexOf(" "+t+" ")<0&&(e.className=r(n+" "+t))}function a(e,t){var n=o(e.className||"");n=n.replace(" "+t+" "," "),e.className=r(n)}function l(e,t,n,o){return null==o&&(o=!i(e,t)),o?(a(e,n),s(e,t)):(a(e,t),s(e,n)),o}function c(e){var t=document.getElementById("page-menu");if(t&&t.firstChild){var n=t.firstChild.cloneNode(!1);n.innerHTML=e,t.appendChild(n)}}function u(){return Array.prototype.slice.call(document.getElementsByTagName("link")).filter(function(e){return-1!=e.rel.indexOf("style")&&e.title})}function h(){var e=u(),t="";e.forEach(function(e){t+="
  • "+e.title+"
    • "}),e.length>1&&c("")}function d(e){for(var t=u(),n=null,o=0;on)return i(e,this.pattern,o);var r=this.options,a=r.location,l=r.distance,c=r.threshold,u=r.findAllMatches,h=r.minMatchCharLength;return s(e,this.pattern,this.patternAlphabet,{location:a,distance:l,threshold:c,findAllMatches:u,minMatchCharLength:h})}}]),e}();e.exports=l},function(e,t,n){"use strict";var o=n(0),r=function e(t,n,r){if(n){var i=n.indexOf("."),s=n,a=null;-1!==i&&(s=n.slice(0,i),a=n.slice(i+1));var l=t[s];if(null!==l&&void 0!==l)if(a||"string"!=typeof l&&"number"!=typeof l)if(o(l))for(var c=0,u=l.length;c0&&void 0!==arguments[0]?arguments[0]:[],t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1,n=[],o=-1,r=-1,i=0,s=e.length;i=t&&n.push([o,r]),o=-1)}return e[i-1]&&i-o>=t&&n.push([o,i-1]),n}},function(e,t,n){"use strict";e.exports=function(e){for(var t={},n=e.length,o=0;o2&&void 0!==arguments[2]?arguments[2]:/ +/g,r=new RegExp(t.replace(o,"\\$&").replace(n,"|")),i=e.match(r),s=!!i,a=[];if(s)for(var l=0,c=i.length;l=E;P-=1){var R=P-1,U=n[e.charAt(R)];if(U&&(b[R]=1),j[P]=(j[P+1]<<1|1)&U,0!==I&&(j[P]|=(L[P+1]|L[P])<<1|1|L[P+1]),j[P]&N&&(C=o(t,{errors:I,currentLocation:R,expectedLocation:g,distance:c}))<=y){if(y=C,(_=R)<=g)break;E=Math.max(1,2*g-_)}}if(o(t,{errors:I+1,currentLocation:g,expectedLocation:g,distance:c})>y)break;L=j}return{isMatch:_>=0,score:0===C?.001:C,matchedIndices:r(b,v)}}},function(e,t,n){"use strict";function o(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var r=function(){function e(e,t){for(var n=0;n0&&void 0!==arguments[0]?arguments[0]:"",t=[];if(this.options.tokenize)for(var n=e.split(this.options.tokenSeparator),o=0,r=n.length;o0&&void 0!==arguments[0]?arguments[0]:[],t=arguments[1],n=this.list,o={},r=[];if("string"==typeof n[0]){for(var i=0,s=n.length;i1)throw new Error("Key weight has to be > 0 and <= 1");p=p.name}else a[p]={weight:1};this._analyze({key:p,value:this.options.getFn(u,p),record:u,index:l},{resultMap:o,results:r,tokenSearchers:e,fullSearcher:t})}return{weights:a,results:r}}},{key:"_analyze",value:function(e,t){var n=e.key,o=e.arrayIndex,r=void 0===o?-1:o,i=e.value,s=e.record,l=e.index,c=t.tokenSearchers,u=void 0===c?[]:c,h=t.fullSearcher,d=void 0===h?[]:h,p=t.resultMap,f=void 0===p?{}:p,v=t.results,g=void 0===v?[]:v;if(void 0!==i&&null!==i){var m=!1,y=-1,_=0;if("string"==typeof i){this._log("\nKey: "+(""===n?"-":n));var k=d.search(i);if(this._log('Full text: "'+i+'", score: '+k.score),this.options.tokenize){for(var b=i.split(this.options.tokenSeparator),x=[],w=0;w-1&&(E=(E+y)/2),this._log("Score average:",E);var T=!this.options.tokenize||!this.options.matchAllTokens||_>=u.length;if(this._log("\nCheck Matches: "+T),(m||k.isMatch)&&T){var j=f[l];j?j.output.push({key:n,arrayIndex:r,value:i,score:E,matchedIndices:k.matchedIndices}):(f[l]={item:s,output:[{key:n,arrayIndex:r,value:i,score:E,matchedIndices:k.matchedIndices}]},g.push(f[l]))}}else if(a(i))for(var P=0,R=i.length;P-1&&(s.arrayIndex=i.arrayIndex),t.matches.push(s)}}}),this.options.includeScore&&n.push(function(e,t){t.score=e.score});for(var o=0,r=e.length;o2;)A.push(arguments[s]);for(n&&null!=n.children&&(A.length||A.push(n.children),delete n.children);A.length;)if((r=A.pop())&&void 0!==r.pop)for(s=r.length;s--;)A.push(r[s]);else"boolean"==typeof r&&(r=null),(i="function"!=typeof t)&&(null==r?r="":"number"==typeof r?r=String(r):"string"!=typeof r&&(i=!1)),i&&o?a[a.length-1]+=r:a===O?a=[r]:a.push(r),o=i;var l=new e;return l.nodeName=t,l.children=a,l.attributes=null==n?void 0:n,l.key=null==n?void 0:n.key,void 0!==I.vnode&&I.vnode(l),l}function o(e,t){for(var n in t)e[n]=t[n];return e}function r(e){!e.__d&&(e.__d=!0)&&1==j.push(e)&&(I.debounceRendering||E)(i)}function i(){var e,t=j;for(j=[];e=t.pop();)e.__d&&L(e)}function s(e,t,n){return"string"==typeof t||"number"==typeof t?void 0!==e.splitText:"string"==typeof t.nodeName?!e._componentConstructor&&a(e,t.nodeName):n||e._componentConstructor===t.nodeName}function a(e,t){return e.__n===t||e.nodeName.toLowerCase()===t.toLowerCase()}function l(e){var t=o({},e.attributes);t.children=e.children;var n=e.nodeName.defaultProps;if(void 0!==n)for(var r in n)void 0===t[r]&&(t[r]=n[r]);return t}function c(e,t){var n=t?document.createElementNS("http://www.w3.org/2000/svg",e):document.createElement(e);return n.__n=e,n}function u(e){var t=e.parentNode;t&&t.removeChild(e)}function h(e,t,n,o,r){if("className"===t&&(t="class"),"key"===t);else if("ref"===t)n&&n(null),o&&o(e);else if("class"!==t||r)if("style"===t){if(o&&"string"!=typeof o&&"string"!=typeof n||(e.style.cssText=o||""),o&&"object"==typeof o){if("string"!=typeof n)for(var i in n)i in o||(e.style[i]="");for(var i in o)e.style[i]="number"==typeof o[i]&&!1===T.test(i)?o[i]+"px":o[i]}}else if("dangerouslySetInnerHTML"===t)o&&(e.innerHTML=o.__html||"");else if("o"==t[0]&&"n"==t[1]){var s=t!==(t=t.replace(/Capture$/,""));t=t.toLowerCase().substring(2),o?n||e.addEventListener(t,p,s):e.removeEventListener(t,p,s),(e.__l||(e.__l={}))[t]=o}else if("list"!==t&&"type"!==t&&!r&&t in e)d(e,t,null==o?"":o),null!=o&&!1!==o||e.removeAttribute(t);else{var a=r&&t!==(t=t.replace(/^xlink\:?/,""));null==o||!1===o?a?e.removeAttributeNS("http://www.w3.org/1999/xlink",t.toLowerCase()):e.removeAttribute(t):"function"!=typeof o&&(a?e.setAttributeNS("http://www.w3.org/1999/xlink",t.toLowerCase(),o):e.setAttribute(t,o))}else e.className=o||""}function d(e,t,n){try{e[t]=n}catch(e){}}function p(e){return this.__l[e.type](I.event&&I.event(e)||e)}function f(){for(var e;e=P.pop();)I.afterMount&&I.afterMount(e),e.componentDidMount&&e.componentDidMount()}function v(e,t,n,o,r,i){R++||(U=null!=r&&void 0!==r.ownerSVGElement,D=null!=e&&!("__preactattr_"in e));var s=g(e,t,n,o,i);return r&&s.parentNode!==r&&r.appendChild(s),--R||(D=!1,i||f()),s}function g(e,t,n,o,r){var i=e,s=U;if(null!=t&&"boolean"!=typeof t||(t=""),"string"==typeof t||"number"==typeof t)return e&&void 0!==e.splitText&&e.parentNode&&(!e._component||r)?e.nodeValue!=t&&(e.nodeValue=t):(i=document.createTextNode(t),e&&(e.parentNode&&e.parentNode.replaceChild(i,e),y(e,!0))),i.__preactattr_=!0,i;var l=t.nodeName;if("function"==typeof l)return C(e,t,n,o);if(U="svg"===l||"foreignObject"!==l&&U,l=String(l),(!e||!a(e,l))&&(i=c(l,U),e)){for(;e.firstChild;)i.appendChild(e.firstChild);e.parentNode&&e.parentNode.replaceChild(i,e),y(e,!0)}var u=i.firstChild,h=i.__preactattr_,d=t.children;if(null==h){h=i.__preactattr_={};for(var p=i.attributes,f=p.length;f--;)h[p[f].name]=p[f].value}return!D&&d&&1===d.length&&"string"==typeof d[0]&&null!=u&&void 0!==u.splitText&&null==u.nextSibling?u.nodeValue!=d[0]&&(u.nodeValue=d[0]):(d&&d.length||null!=u)&&m(i,d,n,o,D||null!=h.dangerouslySetInnerHTML),k(i,t.attributes,h),U=s,i}function m(e,t,n,o,r){var i,a,l,c,h,d=e.childNodes,p=[],f={},v=0,m=0,_=d.length,k=0,b=t?t.length:0;if(0!==_)for(L=0;L<_;L++){var x=d[L],w=x.__preactattr_;null!=(S=b&&w?x._component?x._component.__k:w.key:null)?(v++,f[S]=x):(w||(void 0!==x.splitText?!r||x.nodeValue.trim():r))&&(p[k++]=x)}if(0!==b)for(L=0;L2?[].slice.call(arguments,2):e.children)},Component:N,render:function(e,t,n){return v(n,e,{},!1,t,!1)},rerender:i,options:I};void 0!==t?t.exports=F:self.preact=F}()},{}]},{},[3]); +!function e(t,n,o){function r(s,a){if(!n[s]){if(!t[s]){var l="function"==typeof require&&require;if(!a&&l)return l(s,!0);if(i)return i(s,!0);var c=new Error("Cannot find module '"+s+"'");throw c.code="MODULE_NOT_FOUND",c}var u=n[s]={exports:{}};t[s][0].call(u.exports,function(e){var n=t[s][1][e];return r(n||e)},u,u.exports,e,t,n,o)}return n[s].exports}for(var i="function"==typeof require&&require,s=0;s element with id '"+e+"'");return t}function r(e){for(var t=e.target,n=t.id,r=o(n),i=r.element.open,s=0,l=r.toggles;s0&&(d[n.id]={element:n,openByDefault:!!n.open,toggles:[]},n.addEventListener("toggle",r))}}function s(e){var t=o(e).element;t.open=!t.open}function a(){var e=Object.keys(p);document.cookie="toggled="+encodeURIComponent(e.join("+"))}function l(){var e=h.getCookie("toggled");if(e)for(var t=0,n=e.split("+");t=0&&e.followActiveLink()),"s"===t.key&&"input"!==t.target.tagName.toLowerCase()&&(t.preventDefault(),e.show())})},t.prototype.hide=function(){this.setState({isVisible:!1,searchString:""})},t.prototype.show=function(){this.state.isVisible||(this.focusPlease=!0,this.setState({isVisible:!0,activeLinkIndex:-1}))},t.prototype.toggleVisibility=function(){this.state.isVisible?this.hide():this.show()},t.prototype.navigateLinks=function(e){var t=Math.max(-1,Math.min(this.linkIndex-1,this.state.activeLinkIndex+e));this.navigatedByKeyboard=!0,this.setState({activeLinkIndex:t})},t.prototype.followActiveLink=function(){this.activeLinkAction&&this.activeLinkAction()},t.prototype.updateResults=function(){var e=this.input&&this.input.value||"",t={};this.state.fuse.search(e).forEach(function(e){var n=e.item.module;(t[n]||(t[n]=[])).push(e)});var n=[];for(var o in t)!function(e){var o=t[e],r=0;o.forEach(function(e){r+=1/e.score}),n.push({module:e,totalScore:1/r,items:o})}(o);n.sort(function(e,t){return e.totalScore-t.totalScore}),this.setState({searchString:e,isVisible:!0,moduleResults:n})},t.prototype.componentDidUpdate=function(){if(this.searchResults&&this.activeLink&&this.navigatedByKeyboard){var e=this.activeLink.getClientRects()[0],t=this.searchResults.getClientRects()[0].top;e.bottom>window.innerHeight?this.searchResults.scrollTop+=e.bottom-window.innerHeight+80:e.top=0}function s(e,t){var n=o(e.className||"");n.indexOf(" "+t+" ")<0&&(e.className=r(n+" "+t))}function a(e,t){var n=o(e.className||"");n=n.replace(" "+t+" "," "),e.className=r(n)}function l(e,t,n,o){return null==o&&(o=!i(e,t)),o?(a(e,n),s(e,t)):(a(e,t),s(e,n)),o}function c(e){var t=document.getElementById("page-menu");if(t&&t.firstChild){var n=t.firstChild.cloneNode(!1);n.innerHTML=e,t.appendChild(n)}}function u(){return Array.prototype.slice.call(document.getElementsByTagName("link")).filter(function(e){return-1!=e.rel.indexOf("style")&&e.title})}function h(){var e=u(),t="";e.forEach(function(e){t+="
  • "+e.title+"
    • "}),e.length>1&&c("")}function d(e){for(var t=u(),n=null,o=0;on)return i(e,this.pattern,o);var r=this.options,a=r.location,l=r.distance,c=r.threshold,u=r.findAllMatches,h=r.minMatchCharLength;return s(e,this.pattern,this.patternAlphabet,{location:a,distance:l,threshold:c,findAllMatches:u,minMatchCharLength:h})}}]),e}();e.exports=l},function(e,t,n){"use strict";var o=n(0),r=function e(t,n,r){if(n){var i=n.indexOf("."),s=n,a=null;-1!==i&&(s=n.slice(0,i),a=n.slice(i+1));var l=t[s];if(null!==l&&void 0!==l)if(a||"string"!=typeof l&&"number"!=typeof l)if(o(l))for(var c=0,u=l.length;c0&&void 0!==arguments[0]?arguments[0]:[],t=arguments.length>1&&void 0!==arguments[1]?arguments[1]:1,n=[],o=-1,r=-1,i=0,s=e.length;i=t&&n.push([o,r]),o=-1)}return e[i-1]&&i-o>=t&&n.push([o,i-1]),n}},function(e,t,n){"use strict";e.exports=function(e){for(var t={},n=e.length,o=0;o2&&void 0!==arguments[2]?arguments[2]:/ +/g,r=new RegExp(t.replace(o,"\\$&").replace(n,"|")),i=e.match(r),s=!!i,a=[];if(s)for(var l=0,c=i.length;l=E;P-=1){var R=P-1,U=n[e.charAt(R)];if(U&&(b[R]=1),j[P]=(j[P+1]<<1|1)&U,0!==I&&(j[P]|=(L[P+1]|L[P])<<1|1|L[P+1]),j[P]&N&&(C=o(t,{errors:I,currentLocation:R,expectedLocation:g,distance:c}))<=y){if(y=C,(_=R)<=g)break;E=Math.max(1,2*g-_)}}if(o(t,{errors:I+1,currentLocation:g,expectedLocation:g,distance:c})>y)break;L=j}return{isMatch:_>=0,score:0===C?.001:C,matchedIndices:r(b,v)}}},function(e,t,n){"use strict";function o(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var r=function(){function e(e,t){for(var n=0;n0&&void 0!==arguments[0]?arguments[0]:"",t=[];if(this.options.tokenize)for(var n=e.split(this.options.tokenSeparator),o=0,r=n.length;o0&&void 0!==arguments[0]?arguments[0]:[],t=arguments[1],n=this.list,o={},r=[];if("string"==typeof n[0]){for(var i=0,s=n.length;i1)throw new Error("Key weight has to be > 0 and <= 1");p=p.name}else a[p]={weight:1};this._analyze({key:p,value:this.options.getFn(u,p),record:u,index:l},{resultMap:o,results:r,tokenSearchers:e,fullSearcher:t})}return{weights:a,results:r}}},{key:"_analyze",value:function(e,t){var n=e.key,o=e.arrayIndex,r=void 0===o?-1:o,i=e.value,s=e.record,l=e.index,c=t.tokenSearchers,u=void 0===c?[]:c,h=t.fullSearcher,d=void 0===h?[]:h,p=t.resultMap,f=void 0===p?{}:p,v=t.results,g=void 0===v?[]:v;if(void 0!==i&&null!==i){var m=!1,y=-1,_=0;if("string"==typeof i){this._log("\nKey: "+(""===n?"-":n));var k=d.search(i);if(this._log('Full text: "'+i+'", score: '+k.score),this.options.tokenize){for(var b=i.split(this.options.tokenSeparator),x=[],w=0;w-1&&(E=(E+y)/2),this._log("Score average:",E);var T=!this.options.tokenize||!this.options.matchAllTokens||_>=u.length;if(this._log("\nCheck Matches: "+T),(m||k.isMatch)&&T){var j=f[l];j?j.output.push({key:n,arrayIndex:r,value:i,score:E,matchedIndices:k.matchedIndices}):(f[l]={item:s,output:[{key:n,arrayIndex:r,value:i,score:E,matchedIndices:k.matchedIndices}]},g.push(f[l]))}}else if(a(i))for(var P=0,R=i.length;P-1&&(s.arrayIndex=i.arrayIndex),t.matches.push(s)}}}),this.options.includeScore&&n.push(function(e,t){t.score=e.score});for(var o=0,r=e.length;o2;)A.push(arguments[s]);for(n&&null!=n.children&&(A.length||A.push(n.children),delete n.children);A.length;)if((r=A.pop())&&void 0!==r.pop)for(s=r.length;s--;)A.push(r[s]);else"boolean"==typeof r&&(r=null),(i="function"!=typeof t)&&(null==r?r="":"number"==typeof r?r=String(r):"string"!=typeof r&&(i=!1)),i&&o?a[a.length-1]+=r:a===O?a=[r]:a.push(r),o=i;var l=new e;return l.nodeName=t,l.children=a,l.attributes=null==n?void 0:n,l.key=null==n?void 0:n.key,void 0!==I.vnode&&I.vnode(l),l}function o(e,t){for(var n in t)e[n]=t[n];return e}function r(e){!e.__d&&(e.__d=!0)&&1==j.push(e)&&(I.debounceRendering||E)(i)}function i(){var e,t=j;for(j=[];e=t.pop();)e.__d&&L(e)}function s(e,t,n){return"string"==typeof t||"number"==typeof t?void 0!==e.splitText:"string"==typeof t.nodeName?!e._componentConstructor&&a(e,t.nodeName):n||e._componentConstructor===t.nodeName}function a(e,t){return e.__n===t||e.nodeName.toLowerCase()===t.toLowerCase()}function l(e){var t=o({},e.attributes);t.children=e.children;var n=e.nodeName.defaultProps;if(void 0!==n)for(var r in n)void 0===t[r]&&(t[r]=n[r]);return t}function c(e,t){var n=t?document.createElementNS("http://www.w3.org/2000/svg",e):document.createElement(e);return n.__n=e,n}function u(e){var t=e.parentNode;t&&t.removeChild(e)}function h(e,t,n,o,r){if("className"===t&&(t="class"),"key"===t);else if("ref"===t)n&&n(null),o&&o(e);else if("class"!==t||r)if("style"===t){if(o&&"string"!=typeof o&&"string"!=typeof n||(e.style.cssText=o||""),o&&"object"==typeof o){if("string"!=typeof n)for(var i in n)i in o||(e.style[i]="");for(var i in o)e.style[i]="number"==typeof o[i]&&!1===T.test(i)?o[i]+"px":o[i]}}else if("dangerouslySetInnerHTML"===t)o&&(e.innerHTML=o.__html||"");else if("o"==t[0]&&"n"==t[1]){var s=t!==(t=t.replace(/Capture$/,""));t=t.toLowerCase().substring(2),o?n||e.addEventListener(t,p,s):e.removeEventListener(t,p,s),(e.__l||(e.__l={}))[t]=o}else if("list"!==t&&"type"!==t&&!r&&t in e)d(e,t,null==o?"":o),null!=o&&!1!==o||e.removeAttribute(t);else{var a=r&&t!==(t=t.replace(/^xlink\:?/,""));null==o||!1===o?a?e.removeAttributeNS("http://www.w3.org/1999/xlink",t.toLowerCase()):e.removeAttribute(t):"function"!=typeof o&&(a?e.setAttributeNS("http://www.w3.org/1999/xlink",t.toLowerCase(),o):e.setAttribute(t,o))}else e.className=o||""}function d(e,t,n){try{e[t]=n}catch(e){}}function p(e){return this.__l[e.type](I.event&&I.event(e)||e)}function f(){for(var e;e=P.pop();)I.afterMount&&I.afterMount(e),e.componentDidMount&&e.componentDidMount()}function v(e,t,n,o,r,i){R++||(U=null!=r&&void 0!==r.ownerSVGElement,D=null!=e&&!("__preactattr_"in e));var s=g(e,t,n,o,i);return r&&s.parentNode!==r&&r.appendChild(s),--R||(D=!1,i||f()),s}function g(e,t,n,o,r){var i=e,s=U;if(null!=t&&"boolean"!=typeof t||(t=""),"string"==typeof t||"number"==typeof t)return e&&void 0!==e.splitText&&e.parentNode&&(!e._component||r)?e.nodeValue!=t&&(e.nodeValue=t):(i=document.createTextNode(t),e&&(e.parentNode&&e.parentNode.replaceChild(i,e),y(e,!0))),i.__preactattr_=!0,i;var l=t.nodeName;if("function"==typeof l)return C(e,t,n,o);if(U="svg"===l||"foreignObject"!==l&&U,l=String(l),(!e||!a(e,l))&&(i=c(l,U),e)){for(;e.firstChild;)i.appendChild(e.firstChild);e.parentNode&&e.parentNode.replaceChild(i,e),y(e,!0)}var u=i.firstChild,h=i.__preactattr_,d=t.children;if(null==h){h=i.__preactattr_={};for(var p=i.attributes,f=p.length;f--;)h[p[f].name]=p[f].value}return!D&&d&&1===d.length&&"string"==typeof d[0]&&null!=u&&void 0!==u.splitText&&null==u.nextSibling?u.nodeValue!=d[0]&&(u.nodeValue=d[0]):(d&&d.length||null!=u)&&m(i,d,n,o,D||null!=h.dangerouslySetInnerHTML),k(i,t.attributes,h),U=s,i}function m(e,t,n,o,r){var i,a,l,c,h,d=e.childNodes,p=[],f={},v=0,m=0,_=d.length,k=0,b=t?t.length:0;if(0!==_)for(L=0;L<_;L++){var x=d[L],w=x.__preactattr_;null!=(S=b&&w?x._component?x._component.__k:w.key:null)?(v++,f[S]=x):(w||(void 0!==x.splitText?!r||x.nodeValue.trim():r))&&(p[k++]=x)}if(0!==b)for(L=0;L2?[].slice.call(arguments,2):e.children)},Component:N,render:function(e,t,n){return v(n,e,{},!1,t,!1)},rerender:i,options:I};void 0!==t?t.exports=F:self.preact=F}()},{}]},{},[3]); //# sourceMappingURL=haddock-bundle.min.js.map diff --git a/docs/doc/index.html b/docs/doc/index.html index 10c1a69..71629a6 100644 --- a/docs/doc/index.html +++ b/docs/doc/index.html @@ -1 +1 @@ -stochaskell-0.1.0: A probabilistic programming language

    stochaskell-0.1.0: A probabilistic programming language

    stochaskell-0.1.0: A probabilistic programming language

    An embedded domain-specific language for specifying probabilistic programs that can be compiled to multiple existing probabilistic programming languages.

    Signatures

    Modules

    \ No newline at end of file +stochaskell-1.0.0: A probabilistic programming language

    stochaskell-1.0.0: A probabilistic programming language

    stochaskell-1.0.0: A probabilistic programming language

    An embedded domain-specific language for specifying probabilistic programs that can be compiled to multiple existing probabilistic programming languages.

    Signatures

    Modules

    \ No newline at end of file diff --git a/docs/doc/meta.json b/docs/doc/meta.json index 3be69bd..00981df 100644 --- a/docs/doc/meta.json +++ b/docs/doc/meta.json @@ -1 +1 @@ -{"haddock_version":"2.20.0"} \ No newline at end of file +{"haddock_version":"2.22.0"} \ No newline at end of file diff --git a/stack.yaml b/stack.yaml index bb32f03..b298609 100644 --- a/stack.yaml +++ b/stack.yaml @@ -6,9 +6,9 @@ extra-deps: - Chart-cairo-1.9.1 - diagrams-cairo-1.4.1 - lazy-csv-0.5.1 -- glib-0.13.7.0 +- glib-0.13.7.1 - gtk2hs-buildtools-0.13.5.0 -- pango-0.13.6.0 +- pango-0.13.6.1 - plots-0.1.1.2 - github: gibiansky/IHaskell commit: ac0882dc39d27fbb7f068834f5f111ad1b2cd340 diff --git a/stack.yaml.lock b/stack.yaml.lock index 2dd692e..694624f 100644 --- a/stack.yaml.lock +++ b/stack.yaml.lock @@ -33,12 +33,12 @@ packages: original: hackage: lazy-csv-0.5.1 - completed: - hackage: glib-0.13.7.0@sha256:25f62eb48d104342537dd1c724f07355d56226ca595ce6f1848415fbb7f59fa7,3120 + hackage: glib-0.13.7.1@sha256:b517bbbc46f8bd72a8c97fb1d6769705a9b0d006f7cff8b3dc85948511817b11,3120 pantry-tree: size: 1625 - sha256: 3c465a6ff9d66eeff421271202e5f2537babf865d38541fed78b983317698c71 + sha256: d7218c2ed9890d7b07030601980f62a57d5e888f656db5f32c3017ec7551a0d2 original: - hackage: glib-0.13.7.0 + hackage: glib-0.13.7.1 - completed: hackage: gtk2hs-buildtools-0.13.5.0@sha256:a765766c4208a3e4def319ebf280fbb9e7d0a3f28d15922db36970404fb1daee,5238 pantry-tree: @@ -47,12 +47,12 @@ packages: original: hackage: gtk2hs-buildtools-0.13.5.0 - completed: - hackage: pango-0.13.6.0@sha256:ed8d300945bea97ccb652efc73d159634aefebff8c64f60eef6b6ac5ecebc4ae,3881 + hackage: pango-0.13.6.1@sha256:177c9b6d865dc8f1634742497c6807a7c37a11e86c0dc93fbc047981d546738a,3881 pantry-tree: size: 1506 - sha256: 4563a04bbeac051cb257534bce68240956868936d64bf1b81c377aae0c98f9b1 + sha256: 216bb39cdc265804f6ddd30c00c82ab156c17dcf8577b85527c287a21b4cb9fb original: - hackage: pango-0.13.6.0 + hackage: pango-0.13.6.1 - completed: hackage: plots-0.1.1.2@sha256:01f2ba7ca0c1e00b5231a81b44a3b8b9fd21b49bc333ff4cef880e31c5332935,2034 pantry-tree: @@ -64,9 +64,6 @@ packages: size: 753659 subdir: . url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 6498 - sha256: 0cf0a6b76891b364754475d61f8d01bbfcef03fa7f0abaf572807450d0f719ab name: ihaskell version: 0.10.0.0 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -80,9 +77,6 @@ packages: size: 753659 subdir: ipython-kernel url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2802 - sha256: 47de9a6de7a8c3f139176ae1ef48a1acd851164d9fa9f8212b31335bace62ad5 name: ipython-kernel version: 0.10.0.0 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -96,9 +90,6 @@ packages: size: 753659 subdir: ghc-parser url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 1092 - sha256: 494041ba5cc28768c7b7e8ff6fefa0da4eebef73a51d760f7c8835ef95ebb153 name: ghc-parser version: 0.2.0.3 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -112,9 +103,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-aeson url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2046 - sha256: a17c90a4fdde49ff3a4b52234b845512115ef72d8340902d15ef2d0bf249ec81 name: ihaskell-aeson version: 0.3.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -128,9 +116,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-blaze url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2103 - sha256: 9270098ff961df4f08b4fec0afc94d4790d97cb5f1eae222afed1e11b6ab306a name: ihaskell-blaze version: 0.3.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -144,9 +129,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-charts url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2068 - sha256: ab6632e6b8ee0dbe99e14f90b0021d1d7aa257e7a906cda15df67079dafbaf95 name: ihaskell-charts version: 0.3.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -160,9 +142,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-diagrams url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2411 - sha256: b31d53e32f964793f3a2f5ab6b1379f5b12bb8e149faff6feee312014688dbde name: ihaskell-diagrams version: 0.3.2.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -176,9 +155,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-gnuplot url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2068 - sha256: 87cb4896f6ebad4fec068b66a0997392eb209d648ab0ace4c40703f39205406f name: ihaskell-gnuplot version: 0.1.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -192,9 +168,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-hatex url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 661 - sha256: f7e7d6e80b3802a2471fefe6ab4dcbc86f2c5f05cb049ef650c129b0b54c4b82 name: ihaskell-hatex version: 0.2.1.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -208,9 +181,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-juicypixels url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2566 - sha256: 609252090633984401c494f0cee58335d14d3ec5fb4401c61a6674e3ecd25780 name: ihaskell-juicypixels version: 1.1.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da @@ -224,9 +194,6 @@ packages: size: 753659 subdir: ihaskell-display/ihaskell-magic url: https://github.com/gibiansky/IHaskell/archive/ac0882dc39d27fbb7f068834f5f111ad1b2cd340.tar.gz - cabal-file: - size: 2226 - sha256: a0b073620c3072813a02dba13038ac4b10d61c0f54453ba6cfea4299c6a3f8e7 name: ihaskell-magic version: 0.3.0.1 sha256: 38b70982559a9238a1ccd5671ad8ac8792ad34d472d262907ea3570a2641c1da diff --git a/stochaskell/backward-cpp b/stochaskell/backward-cpp index 936c1c0..83da756 160000 --- a/stochaskell/backward-cpp +++ b/stochaskell/backward-cpp @@ -1 +1 @@ -Subproject commit 936c1c0f281de1cf2327c76414e5d7b6e1462c6e +Subproject commit 83da75636cef3ee6e0c83cf8651e2929e1b87261 diff --git a/stochaskell/package.yaml b/stochaskell/package.yaml index 18d4eca..28372b2 100644 --- a/stochaskell/package.yaml +++ b/stochaskell/package.yaml @@ -1,5 +1,5 @@ name: stochaskell -version: '0.1.0' +version: '1.0.0' synopsis: A probabilistic programming language description: An embedded domain-specific language for specifying probabilistic programs that can be compiled to multiple existing probabilistic programming diff --git a/stochaskell/src/Language/Church.hs b/stochaskell/src/Language/Church.hs index 26d3f5b..72aace3 100644 --- a/stochaskell/src/Language/Church.hs +++ b/stochaskell/src/Language/Church.hs @@ -1,6 +1,6 @@ {-| Description : Church integration -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/Edward.hs b/stochaskell/src/Language/Edward.hs index 13eb8aa..55814f1 100644 --- a/stochaskell/src/Language/Edward.hs +++ b/stochaskell/src/Language/Edward.hs @@ -1,6 +1,6 @@ {-| Description : Edward integration -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/PyMC3.hs b/stochaskell/src/Language/PyMC3.hs index 7f5dbf0..6057a51 100644 --- a/stochaskell/src/Language/PyMC3.hs +++ b/stochaskell/src/Language/PyMC3.hs @@ -1,7 +1,7 @@ {-# LANGUAGE RecordWildCards #-} {-| Description : PyMC3 integration -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/Stan.hs b/stochaskell/src/Language/Stan.hs index 596666d..dcbfeb6 100644 --- a/stochaskell/src/Language/Stan.hs +++ b/stochaskell/src/Language/Stan.hs @@ -1,7 +1,7 @@ {-# LANGUAGE OverloadedStrings, RecordWildCards #-} {-| Description : Stan integration -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/Stochaskell.hs b/stochaskell/src/Language/Stochaskell.hs index 75dd7ed..0261e02 100644 --- a/stochaskell/src/Language/Stochaskell.hs +++ b/stochaskell/src/Language/Stochaskell.hs @@ -1,6 +1,6 @@ {-| Description : Stochaskell main module -Copyright : (c) David A Roberts, 2015-2020 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental @@ -150,7 +150,7 @@ stochaskell :: IO () stochaskell = do putStr $ unlines [ "Stochaskell, version "++ showVersion version - , "Copyright (C) 2015-2020 David A Roberts" + , "Copyright (C) 2015-2021 David A Roberts" , "This program comes with ABSOLUTELY NO WARRANTY." , "This is free software, and you are welcome to redistribute it" , "under certain conditions; see the LICENSE for details." diff --git a/stochaskell/src/Language/Stochaskell/Expression.hs b/stochaskell/src/Language/Stochaskell/Expression.hs index f7761a2..9095491 100644 --- a/stochaskell/src/Language/Stochaskell/Expression.hs +++ b/stochaskell/src/Language/Stochaskell/Expression.hs @@ -1,6 +1,6 @@ {-| Description : lower-level expression manipulation -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/Stochaskell/Plot.hs b/stochaskell/src/Language/Stochaskell/Plot.hs index d9fa598..cc52262 100644 --- a/stochaskell/src/Language/Stochaskell/Plot.hs +++ b/stochaskell/src/Language/Stochaskell/Plot.hs @@ -1,7 +1,7 @@ {-# LANGUAGE FlexibleContexts, FlexibleInstances #-} {-| Description : plotting utilities -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/src/Language/Stochaskell/Prelude.hs b/stochaskell/src/Language/Stochaskell/Prelude.hs index 34a38b7..a4590f9 100644 --- a/stochaskell/src/Language/Stochaskell/Prelude.hs +++ b/stochaskell/src/Language/Stochaskell/Prelude.hs @@ -1,6 +1,6 @@ {-| Description : modified Prelude -Copyright : (c) David A Roberts, 2015-2019 +Copyright : (c) David A Roberts, 2015-2021 License : GPL-3 Maintainer : d@vidr.cc Stability : experimental diff --git a/stochaskell/stack.yaml b/stochaskell/stack.yaml index e52e32d..0df85e4 100644 --- a/stochaskell/stack.yaml +++ b/stochaskell/stack.yaml @@ -9,9 +9,9 @@ extra-deps: - cairo-0.13.6.0 - Chart-cairo-1.9.1 - diagrams-cairo-1.4.1 -- glib-0.13.7.0 +- glib-0.13.7.1 - gtk2hs-buildtools-0.13.5.0 - lazy-csv-0.5.1 -- pango-0.13.6.0 +- pango-0.13.6.1 - plots-0.1.1.2 resolver: lts-13.26 diff --git a/stochaskell/stack.yaml.lock b/stochaskell/stack.yaml.lock index 01783e5..f0b48ed 100644 --- a/stochaskell/stack.yaml.lock +++ b/stochaskell/stack.yaml.lock @@ -26,12 +26,12 @@ packages: original: hackage: diagrams-cairo-1.4.1 - completed: - hackage: glib-0.13.7.0@sha256:25f62eb48d104342537dd1c724f07355d56226ca595ce6f1848415fbb7f59fa7,3120 + hackage: glib-0.13.7.1@sha256:b517bbbc46f8bd72a8c97fb1d6769705a9b0d006f7cff8b3dc85948511817b11,3120 pantry-tree: size: 1625 - sha256: 3c465a6ff9d66eeff421271202e5f2537babf865d38541fed78b983317698c71 + sha256: d7218c2ed9890d7b07030601980f62a57d5e888f656db5f32c3017ec7551a0d2 original: - hackage: glib-0.13.7.0 + hackage: glib-0.13.7.1 - completed: hackage: gtk2hs-buildtools-0.13.5.0@sha256:a765766c4208a3e4def319ebf280fbb9e7d0a3f28d15922db36970404fb1daee,5238 pantry-tree: @@ -47,12 +47,12 @@ packages: original: hackage: lazy-csv-0.5.1 - completed: - hackage: pango-0.13.6.0@sha256:ed8d300945bea97ccb652efc73d159634aefebff8c64f60eef6b6ac5ecebc4ae,3881 + hackage: pango-0.13.6.1@sha256:177c9b6d865dc8f1634742497c6807a7c37a11e86c0dc93fbc047981d546738a,3881 pantry-tree: size: 1506 - sha256: 4563a04bbeac051cb257534bce68240956868936d64bf1b81c377aae0c98f9b1 + sha256: 216bb39cdc265804f6ddd30c00c82ab156c17dcf8577b85527c287a21b4cb9fb original: - hackage: pango-0.13.6.0 + hackage: pango-0.13.6.1 - completed: hackage: plots-0.1.1.2@sha256:01f2ba7ca0c1e00b5231a81b44a3b8b9fd21b49bc333ff4cef880e31c5332935,2034 pantry-tree: