| Copyright | Copyright (C) 2006-2018 Bjorn Buckwalter |
|---|---|
| License | BSD3 |
| Maintainer | bjorn@buckwalter.se |
| Stability | Stable |
| Portability | GHC only |
| Safe Haskell | None |
| Language | Haskell2010 |
Numeric.Units.Dimensional.Prelude
Description
Summary
This module supplies a convenient set of imports for working with the dimensional package, including aliases for common Quantitys and Dimensions,
and a comprehensive set of SI units and units accepted for use with the SI.
It re-exports the Prelude, hiding arithmetic functions whose names collide with the dimensionally-typed versions supplied by this package.
Synopsis
- type Recip (d :: Dimension) = DOne / d
- type family (a :: Dimension) / (d :: Dimension) :: Dimension where ...
- (/) :: forall (v1 :: Variant) (v2 :: Variant) a (d1 :: Dimension) (d2 :: Dimension). (KnownVariant v1, KnownVariant v2, KnownVariant (v1 / v2), Fractional a) => Dimensional v1 d1 a -> Dimensional v2 d2 a -> Dimensional (v1 / v2) (d1 / d2) a
- type family (a :: Dimension) * (b :: Dimension) :: Dimension where ...
- (*) :: forall (v1 :: Variant) (v2 :: Variant) a (d1 :: Dimension) (d2 :: Dimension). (KnownVariant v1, KnownVariant v2, KnownVariant (v1 * v2), Num a) => Dimensional v1 d1 a -> Dimensional v2 d2 a -> Dimensional (v1 * v2) (d1 * d2) a
- pi :: Floating a => Dimensionless a
- type Unit (m :: Metricality) = Dimensional ('DUnit m)
- (-) :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a -> Quantity d a
- negate :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a
- type family (d :: Dimension) ^ (x :: TypeInt) :: Dimension where ...
- (^) :: forall a (i :: TypeInt) (v :: Variant) (d1 :: Dimension). (Fractional a, KnownTypeInt i, KnownVariant v, KnownVariant (Weaken v)) => Dimensional v d1 a -> Proxy i -> Dimensional (Weaken v) (d1 ^ i) a
- (+) :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a -> Quantity d a
- abs :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a
- signum :: forall a (d :: Dimension). Num a => Quantity d a -> Dimensionless a
- class KnownVariant (v :: Variant) where
- data Dimensional (v :: Variant) :: Dimension -> Type -> Type
- data family Dimensional (v :: Variant) :: Dimension -> Type -> Type
- type Quantity = SQuantity One
- data Metricality
- data Dimension = Dim TypeInt TypeInt TypeInt TypeInt TypeInt TypeInt TypeInt
- type family NRoot (d :: Dimension) (x :: TypeInt) :: Dimension where ...
- type Sqrt (d :: Dimension) = NRoot d 'Pos2
- type Cbrt (d :: Dimension) = NRoot d 'Pos3
- data Dimension' = Dim' !Int !Int !Int !Int !Int !Int !Int
- class HasDynamicDimension a => HasDimension a where
- dimension :: a -> Dimension'
- type KnownDimension (d :: Dimension) = HasDimension (Proxy d)
- (*~) :: forall a (m :: Metricality) (d :: Dimension). Num a => a -> Unit m d a -> Quantity d a
- (/~) :: forall a (d :: Dimension) (m :: Metricality). Fractional a => Quantity d a -> Unit m d a -> a
- (^/) :: forall (n :: TypeInt) a (d :: Dimension). (KnownTypeInt n, Floating a) => Quantity d a -> Proxy n -> Quantity (NRoot d n) a
- (**) :: Floating a => Dimensionless a -> Dimensionless a -> Dimensionless a
- recip :: forall a (d :: Dimension). Fractional a => Quantity d a -> Quantity (Recip d) a
- nroot :: forall (n :: TypeInt) a (d :: Dimension). (KnownTypeInt n, Floating a) => Proxy n -> Quantity d a -> Quantity (NRoot d n) a
- sqrt :: forall a (d :: Dimension). Floating a => Quantity d a -> Quantity (Sqrt d) a
- cbrt :: forall a (d :: Dimension). Floating a => Quantity d a -> Quantity (Cbrt d) a
- exp :: Floating a => Dimensionless a -> Dimensionless a
- log :: Floating a => Dimensionless a -> Dimensionless a
- logBase :: Floating a => Dimensionless a -> Dimensionless a -> Dimensionless a
- sin :: Floating a => Dimensionless a -> Dimensionless a
- cos :: Floating a => Dimensionless a -> Dimensionless a
- tan :: Floating a => Dimensionless a -> Dimensionless a
- asin :: Floating a => Dimensionless a -> Dimensionless a
- acos :: Floating a => Dimensionless a -> Dimensionless a
- atan :: Floating a => Dimensionless a -> Dimensionless a
- sinh :: Floating a => Dimensionless a -> Dimensionless a
- cosh :: Floating a => Dimensionless a -> Dimensionless a
- tanh :: Floating a => Dimensionless a -> Dimensionless a
- asinh :: Floating a => Dimensionless a -> Dimensionless a
- acosh :: Floating a => Dimensionless a -> Dimensionless a
- atanh :: Floating a => Dimensionless a -> Dimensionless a
- atan2 :: forall a (d :: Dimension). RealFloat a => Quantity d a -> Quantity d a -> Dimensionless a
- log1p :: Floating a => Dimensionless a -> Dimensionless a
- expm1 :: Floating a => Dimensionless a -> Dimensionless a
- log1pexp :: Floating a => Dimensionless a -> Dimensionless a
- log1mexp :: Floating a => Dimensionless a -> Dimensionless a
- (*~~) :: forall f a (m :: Metricality) (d :: Dimension). (Functor f, Num a) => f a -> Unit m d a -> f (Quantity d a)
- (/~~) :: forall f (m :: Metricality) (d :: Dimension) a. (Functor f, Fractional a) => f (Quantity d a) -> Unit m d a -> f a
- sum :: forall a f (d :: Dimension). (Num a, Foldable f) => f (Quantity d a) -> Quantity d a
- mean :: forall a f (d :: Dimension). (Fractional a, Foldable f) => f (Quantity d a) -> Quantity d a
- product :: (Num a, Foldable f) => f (Dimensionless a) -> Dimensionless a
- dimensionlessLength :: (Num a, Foldable f) => f b -> Dimensionless a
- nFromTo :: forall a b (d :: Dimension). (Fractional a, Integral b) => Quantity d a -> Quantity d a -> b -> [Quantity d a]
- type DOne = 'Dim 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero
- type DLength = 'Dim 'Pos1 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero
- type DMass = 'Dim 'Zero 'Pos1 'Zero 'Zero 'Zero 'Zero 'Zero
- type DTime = 'Dim 'Zero 'Zero 'Pos1 'Zero 'Zero 'Zero 'Zero
- type DElectricCurrent = 'Dim 'Zero 'Zero 'Zero 'Pos1 'Zero 'Zero 'Zero
- type DThermodynamicTemperature = 'Dim 'Zero 'Zero 'Zero 'Zero 'Pos1 'Zero 'Zero
- type DAmountOfSubstance = 'Dim 'Zero 'Zero 'Zero 'Zero 'Zero 'Pos1 'Zero
- type DLuminousIntensity = 'Dim 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero 'Pos1
- type Dimensionless = Quantity DOne
- type Length = Quantity DLength
- type Mass = Quantity DMass
- type Time = Quantity DTime
- type ElectricCurrent = Quantity DElectricCurrent
- type ThermodynamicTemperature = Quantity DThermodynamicTemperature
- type AmountOfSubstance = Quantity DAmountOfSubstance
- type LuminousIntensity = Quantity DLuminousIntensity
- _0 :: forall a (d :: Dimension). Num a => Quantity d a
- _1 :: Num a => Dimensionless a
- _2 :: Num a => Dimensionless a
- _3 :: Num a => Dimensionless a
- _4 :: Num a => Dimensionless a
- _5 :: Num a => Dimensionless a
- _6 :: Num a => Dimensionless a
- _7 :: Num a => Dimensionless a
- _8 :: Num a => Dimensionless a
- _9 :: Num a => Dimensionless a
- tau :: Floating a => Dimensionless a
- siUnit :: forall (d :: Dimension) a. (KnownDimension d, Num a) => Unit 'NonMetric d a
- one :: Num a => Unit 'NonMetric DOne a
- mkUnitR :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Floating a => UnitName m -> ExactPi -> Unit m1 d a -> Unit m d a
- mkUnitQ :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Fractional a => UnitName m -> Rational -> Unit m1 d a -> Unit m d a
- mkUnitZ :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Num a => UnitName m -> Integer -> Unit m1 d a -> Unit m d a
- name :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> UnitName m
- exactValue :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> ExactPi
- weaken :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Unit 'NonMetric d a
- strengthen :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Maybe (Unit 'Metric d a)
- exactify :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Unit m d ExactPi
- showIn :: forall a (m :: Metricality) (d :: Dimension). (Show a, Fractional a) => Unit m d a -> Quantity d a -> String
- changeRep :: forall (v :: Variant) a b (d :: Dimension). (KnownVariant v, Real a, Fractional b) => Dimensional v d a -> Dimensional v d b
- changeRepApproximate :: forall (v :: Variant) b (d :: Dimension). (KnownVariant v, Floating b) => Dimensional v d ExactPi -> Dimensional v d b
- asLens :: forall a (m :: Metricality) (d :: Dimension). Fractional a => Unit m d a -> forall (f :: Type -> Type). Functor f => (a -> f a) -> Quantity d a -> f (Quantity d a)
- module Numeric.Units.Dimensional.Quantities
- module Numeric.Units.Dimensional.SIUnits
- neg5 :: Proxy 'Neg5
- neg4 :: Proxy 'Neg4
- neg3 :: Proxy 'Neg3
- neg2 :: Proxy 'Neg2
- neg1 :: Proxy 'Neg1
- zero :: Proxy 'Zero
- pos1 :: Proxy 'Pos1
- pos2 :: Proxy 'Pos2
- pos3 :: Proxy 'Pos3
- pos4 :: Proxy 'Pos4
- pos5 :: Proxy 'Pos5
- class Category (cat :: k -> k -> Type) where
- minimum :: (Foldable t, Ord a) => t a -> a
- maximum :: (Foldable t, Ord a) => t a -> a
- class Fractional a => Floating a
- data Integer
- data Maybe a
- type Rational = Ratio Integer
- class (Num a, Ord a) => Real a where
- toRational :: a -> Rational
- data Double
- class Num a where
- fromInteger :: Integer -> a
- class Num a => Fractional a where
- fromRational :: Rational -> a
- data Bool
- data Char
- data Float
- data Int
- data Word
- data Ordering
- class a ~# b => (a :: k) ~ (b :: k)
- class (RealFrac a, Floating a) => RealFloat a where
- floatRadix :: a -> Integer
- floatDigits :: a -> Int
- floatRange :: a -> (Int, Int)
- decodeFloat :: a -> (Integer, Int)
- encodeFloat :: Integer -> Int -> a
- exponent :: a -> Int
- significand :: a -> a
- scaleFloat :: Int -> a -> a
- isNaN :: a -> Bool
- isInfinite :: a -> Bool
- isDenormalized :: a -> Bool
- isNegativeZero :: a -> Bool
- isIEEE :: a -> Bool
- realToFrac :: (Real a, Fractional b) => a -> b
- fromIntegral :: (Integral a, Num b) => a -> b
- class (Real a, Enum a) => Integral a where
- class (Real a, Fractional a) => RealFrac a where
- data IO a
- class Eq a where
- class Eq a => Ord a where
- class Enum a where
- succ :: a -> a
- pred :: a -> a
- toEnum :: Int -> a
- fromEnum :: a -> Int
- enumFrom :: a -> [a]
- enumFromThen :: a -> a -> [a]
- enumFromTo :: a -> a -> [a]
- enumFromThenTo :: a -> a -> a -> [a]
- class Functor (f :: Type -> Type) where
- flip :: (a -> b -> c) -> b -> a -> c
- (++) :: [a] -> [a] -> [a]
- error :: HasCallStack => [Char] -> a
- ($) :: (a -> b) -> a -> b
- uncurry :: (a -> b -> c) -> (a, b) -> c
- otherwise :: Bool
- class Foldable (t :: Type -> Type) where
- foldMap :: Monoid m => (a -> m) -> t a -> m
- foldr :: (a -> b -> b) -> b -> t a -> b
- foldl :: (b -> a -> b) -> b -> t a -> b
- foldl' :: (b -> a -> b) -> b -> t a -> b
- foldr1 :: (a -> a -> a) -> t a -> a
- foldl1 :: (a -> a -> a) -> t a -> a
- null :: t a -> Bool
- length :: t a -> Int
- elem :: Eq a => a -> t a -> Bool
- class Semigroup a where
- (<>) :: a -> a -> a
- class Semigroup a => Monoid a where
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- (&&) :: Bool -> Bool -> Bool
- class Show a where
- class Applicative m => Monad (m :: Type -> Type) where
- class Functor f => Applicative (f :: Type -> Type) where
- class Bounded a where
- type String = [Char]
- undefined :: HasCallStack => a
- ($!) :: (a -> b) -> a -> b
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- map :: (a -> b) -> [a] -> [b]
- type ReadS a = String -> [(a, String)]
- type ShowS = String -> String
- class Read a where
- class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where
- traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
- sequenceA :: Applicative f => t (f a) -> f (t a)
- mapM :: Monad m => (a -> m b) -> t a -> m (t b)
- sequence :: Monad m => t (m a) -> m (t a)
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- asTypeOf :: a -> a -> a
- const :: a -> b -> a
- until :: (a -> Bool) -> (a -> a) -> a -> a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- and :: Foldable t => t Bool -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- concat :: Foldable t => t [a] -> [a]
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
- notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- or :: Foldable t => t Bool -> Bool
- sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- maybe :: b -> (a -> b) -> Maybe a -> b
- lines :: String -> [String]
- unlines :: [String] -> String
- unwords :: [String] -> String
- words :: String -> [String]
- curry :: ((a, b) -> c) -> a -> b -> c
- errorWithoutStackTrace :: [Char] -> a
- ioError :: IOError -> IO a
- userError :: String -> IOError
- (!!) :: HasCallStack => [a] -> Int -> a
- break :: (a -> Bool) -> [a] -> ([a], [a])
- cycle :: HasCallStack => [a] -> [a]
- drop :: Int -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- head :: HasCallStack => [a] -> a
- init :: HasCallStack => [a] -> [a]
- iterate :: (a -> a) -> a -> [a]
- last :: HasCallStack => [a] -> a
- lookup :: Eq a => a -> [(a, b)] -> Maybe b
- repeat :: a -> [a]
- replicate :: Int -> a -> [a]
- reverse :: [a] -> [a]
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- scanl1 :: (a -> a -> a) -> [a] -> [a]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- scanr1 :: (a -> a -> a) -> [a] -> [a]
- span :: (a -> Bool) -> [a] -> ([a], [a])
- splitAt :: Int -> [a] -> ([a], [a])
- tail :: HasCallStack => [a] -> [a]
- take :: Int -> [a] -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- unzip :: [(a, b)] -> ([a], [b])
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
- subtract :: Num a => a -> a -> a
- lex :: ReadS String
- readParen :: Bool -> ReadS a -> ReadS a
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- even :: Integral a => a -> Bool
- gcd :: Integral a => a -> a -> a
- lcm :: Integral a => a -> a -> a
- odd :: Integral a => a -> Bool
- showChar :: Char -> ShowS
- showParen :: Bool -> ShowS -> ShowS
- showString :: String -> ShowS
- shows :: Show a => a -> ShowS
- appendFile :: FilePath -> String -> IO ()
- getChar :: IO Char
- getContents :: IO String
- getLine :: IO String
- interact :: (String -> String) -> IO ()
- putChar :: Char -> IO ()
- putStr :: String -> IO ()
- putStrLn :: String -> IO ()
- readFile :: FilePath -> IO String
- readIO :: Read a => String -> IO a
- readLn :: Read a => IO a
- writeFile :: FilePath -> String -> IO ()
- read :: Read a => String -> a
- reads :: Read a => ReadS a
- not :: Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- type FilePath = String
- type IOError = IOException
- data Either a b
- zip :: [a] -> [b] -> [(a, b)]
- filter :: (a -> Bool) -> [a] -> [a]
- print :: Show a => a -> IO ()
- seq :: a -> b -> b
- class Monad m => MonadFail (m :: Type -> Type) where
Documentation
type Recip (d :: Dimension) = DOne / d Source #
The reciprocal of a dimension is defined as the result of dividing DOne by it,
or of negating each of the base dimensions' exponents.
type family (a :: Dimension) / (d :: Dimension) :: Dimension where ... infixl 7 Source #
Division of dimensions corresponds to subtraction of the base dimensions' exponents.
(/) :: forall (v1 :: Variant) (v2 :: Variant) a (d1 :: Dimension) (d2 :: Dimension). (KnownVariant v1, KnownVariant v2, KnownVariant (v1 / v2), Fractional a) => Dimensional v1 d1 a -> Dimensional v2 d2 a -> Dimensional (v1 / v2) (d1 / d2) a infixl 7 Source #
type family (a :: Dimension) * (b :: Dimension) :: Dimension where ... infixl 7 Source #
Multiplication of dimensions corresponds to addition of the base dimensions' exponents.
(*) :: forall (v1 :: Variant) (v2 :: Variant) a (d1 :: Dimension) (d2 :: Dimension). (KnownVariant v1, KnownVariant v2, KnownVariant (v1 * v2), Num a) => Dimensional v1 d1 a -> Dimensional v2 d2 a -> Dimensional (v1 * v2) (d1 * d2) a infixl 7 Source #
pi :: Floating a => Dimensionless a Source #
type Unit (m :: Metricality) = Dimensional ('DUnit m) Source #
A unit of measurement.
(-) :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a -> Quantity d a infixl 6 Source #
Subtracts one Quantity from another.
negate :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a Source #
Negates the value of a Quantity.
type family (d :: Dimension) ^ (x :: TypeInt) :: Dimension where ... infixr 8 Source #
Powers of dimensions correspond to multiplication of the base dimensions' exponents by the exponent.
We limit ourselves to integer powers of Dimensionals as fractional powers make little physical sense.
(^) :: forall a (i :: TypeInt) (v :: Variant) (d1 :: Dimension). (Fractional a, KnownTypeInt i, KnownVariant v, KnownVariant (Weaken v)) => Dimensional v d1 a -> Proxy i -> Dimensional (Weaken v) (d1 ^ i) a infixr 8 Source #
Raises a Quantity or Unit to an integer power.
Because the power chosen impacts the Dimension of the result, it is necessary to supply a type-level representation
of the exponent in the form of a Proxy to some TypeInt. Convenience values pos1, pos2, neg1, ...
are supplied by the Numeric.NumType.DK.Integers module. The most commonly used ones are
also reexported by Numeric.Units.Dimensional.Prelude.
The intimidating type signature captures the similarity between these operations
and ensures that composite Units are NonMetric.
(+) :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a -> Quantity d a infixl 6 Source #
Adds two Quantitys.
abs :: forall a (d :: Dimension). Num a => Quantity d a -> Quantity d a Source #
Takes the absolute value of a Quantity.
class KnownVariant (v :: Variant) Source #
A KnownVariant is one whose term-level Dimensional values we can represent with an associated data family instance
and manipulate with certain functions, not all of which are exported from the package.
Each validly constructed type of kind Variant has a KnownVariant instance.
Minimal complete definition
extractValue, extractName, injectValue, dmap
Associated Types
data Dimensional (v :: Variant) :: Dimension -> Type -> Type Source #
Instances
data family Dimensional (v :: Variant) :: Dimension -> Type -> Type Source #
A dimensional value, either a Quantity or a Unit, parameterized by its Dimension and representation.
Instances
| Generic1 (Dimensional ('DQuantity s) d :: Type -> Type) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Associated Types
Methods from1 :: Dimensional ('DQuantity s) d a -> Rep1 (Dimensional ('DQuantity s) d) a to1 :: Rep1 (Dimensional ('DQuantity s) d) a -> Dimensional ('DQuantity s) d a | |||||
| Generic1 (Dimensional ('DUnit m) d :: Type -> Type) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Associated Types
Methods from1 :: Dimensional ('DUnit m) d a -> Rep1 (Dimensional ('DUnit m) d) a to1 :: Rep1 (Dimensional ('DUnit m) d) a -> Dimensional ('DUnit m) d a | |||||
| Vector Vector a => Vector Vector (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods basicUnsafeFreeze :: Mutable Vector s0 (SQuantity s d a) -> ST s0 (Vector (SQuantity s d a)) basicUnsafeThaw :: Vector (SQuantity s d a) -> ST s0 (Mutable Vector s0 (SQuantity s d a)) basicLength :: Vector (SQuantity s d a) -> Int basicUnsafeSlice :: Int -> Int -> Vector (SQuantity s d a) -> Vector (SQuantity s d a) basicUnsafeIndexM :: Vector (SQuantity s d a) -> Int -> Box (SQuantity s d a) basicUnsafeCopy :: Mutable Vector s0 (SQuantity s d a) -> Vector (SQuantity s d a) -> ST s0 () elemseq :: Vector (SQuantity s d a) -> SQuantity s d a -> b -> b | |||||
| MVector MVector a => MVector MVector (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods basicLength :: MVector s0 (SQuantity s d a) -> Int basicUnsafeSlice :: Int -> Int -> MVector s0 (SQuantity s d a) -> MVector s0 (SQuantity s d a) basicOverlaps :: MVector s0 (SQuantity s d a) -> MVector s0 (SQuantity s d a) -> Bool basicUnsafeNew :: Int -> ST s0 (MVector s0 (SQuantity s d a)) basicInitialize :: MVector s0 (SQuantity s d a) -> ST s0 () basicUnsafeReplicate :: Int -> SQuantity s d a -> ST s0 (MVector s0 (SQuantity s d a)) basicUnsafeRead :: MVector s0 (SQuantity s d a) -> Int -> ST s0 (SQuantity s d a) basicUnsafeWrite :: MVector s0 (SQuantity s d a) -> Int -> SQuantity s d a -> ST s0 () basicClear :: MVector s0 (SQuantity s d a) -> ST s0 () basicSet :: MVector s0 (SQuantity s d a) -> SQuantity s d a -> ST s0 () basicUnsafeCopy :: MVector s0 (SQuantity s d a) -> MVector s0 (SQuantity s d a) -> ST s0 () basicUnsafeMove :: MVector s0 (SQuantity s d a) -> MVector s0 (SQuantity s d a) -> ST s0 () basicUnsafeGrow :: MVector s0 (SQuantity s d a) -> Int -> ST s0 (MVector s0 (SQuantity s d a)) | |||||
| KnownDimension d => Demotable (Quantity d) Source # | |||||
Defined in Numeric.Units.Dimensional.Dynamic Methods demotableOut :: Quantity d a -> AnyQuantity a | |||||
| Eq1 (SQuantity s d) Source # | |||||
| Ord1 (SQuantity s d) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods liftCompare :: (a -> b -> Ordering) -> SQuantity s d a -> SQuantity s d b -> Ordering | |||||
| NFData a => NFData (Quantity d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
| KnownVariant v => Functor (Dimensional v d) Source # | A Note that this instance is dubious, because it allows you to break the dimensional abstraction. See Note that, while this instance overlaps with that given for Note that this is an orphan instance. | ||||
Defined in Numeric.Units.Dimensional.Functor Methods fmap :: (a -> b) -> Dimensional v d a -> Dimensional v d b # (<$) :: a -> Dimensional v d b -> Dimensional v d a # | |||||
| Functor (SQuantity s DOne) Source # | |||||
| KnownDimension d => HasDimension (Dimensional v d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods dimension :: Dimensional v d a -> Dimension' Source # | |||||
| KnownDimension d => HasDynamicDimension (Dimensional v d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods dynamicDimension :: Dimensional v d a -> DynamicDimension Source # | |||||
| HasInterchangeName (Unit m d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods interchangeName :: Unit m d a -> InterchangeName Source # | |||||
| Num a => Monoid (SQuantity s d a) Source # |
| ||||
| Num a => Semigroup (SQuantity s d a) Source # |
| ||||
| (Typeable s, Typeable d, Data a) => Data (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods gfoldl :: (forall d0 b. Data d0 => c (d0 -> b) -> d0 -> c b) -> (forall g. g -> c g) -> Dimensional ('DQuantity s) d a -> c (Dimensional ('DQuantity s) d a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Dimensional ('DQuantity s) d a) toConstr :: Dimensional ('DQuantity s) d a -> Constr dataTypeOf :: Dimensional ('DQuantity s) d a -> DataType dataCast1 :: Typeable t => (forall d0. Data d0 => c (t d0)) -> Maybe (c (Dimensional ('DQuantity s) d a)) dataCast2 :: Typeable t => (forall d0 e. (Data d0, Data e) => c (t d0 e)) -> Maybe (c (Dimensional ('DQuantity s) d a)) gmapT :: (forall b. Data b => b -> b) -> Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a gmapQl :: (r -> r' -> r) -> r -> (forall d0. Data d0 => d0 -> r') -> Dimensional ('DQuantity s) d a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d0. Data d0 => d0 -> r') -> Dimensional ('DQuantity s) d a -> r gmapQ :: (forall d0. Data d0 => d0 -> u) -> Dimensional ('DQuantity s) d a -> [u] gmapQi :: Int -> (forall d0. Data d0 => d0 -> u) -> Dimensional ('DQuantity s) d a -> u gmapM :: Monad m => (forall d0. Data d0 => d0 -> m d0) -> Dimensional ('DQuantity s) d a -> m (Dimensional ('DQuantity s) d a) gmapMp :: MonadPlus m => (forall d0. Data d0 => d0 -> m d0) -> Dimensional ('DQuantity s) d a -> m (Dimensional ('DQuantity s) d a) gmapMo :: MonadPlus m => (forall d0. Data d0 => d0 -> m d0) -> Dimensional ('DQuantity s) d a -> m (Dimensional ('DQuantity s) d a) | |||||
| Bounded a => Bounded (SQuantity s d a) Source # | |||||
| Storable a => Storable (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods sizeOf :: SQuantity s d a -> Int alignment :: SQuantity s d a -> Int peekElemOff :: Ptr (SQuantity s d a) -> Int -> IO (SQuantity s d a) pokeElemOff :: Ptr (SQuantity s d a) -> Int -> SQuantity s d a -> IO () peekByteOff :: Ptr b -> Int -> IO (SQuantity s d a) pokeByteOff :: Ptr b -> Int -> SQuantity s d a -> IO () | |||||
| Generic (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Associated Types
Methods from :: Dimensional ('DQuantity s) d a -> Rep (Dimensional ('DQuantity s) d a) x to :: Rep (Dimensional ('DQuantity s) d a) x -> Dimensional ('DQuantity s) d a | |||||
| Generic (Dimensional ('DUnit m) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Associated Types
Methods from :: Dimensional ('DUnit m) d a -> Rep (Dimensional ('DUnit m) d a) x to :: Rep (Dimensional ('DUnit m) d a) x -> Dimensional ('DUnit m) d a | |||||
| (KnownDimension d, KnownExactPi s, Show a, Real a) => Show (SQuantity s d a) Source # | Uses non-breaking spaces between the value and the unit, and within the unit name. | ||||
| Show a => Show (Unit m d a) Source # | Unit names are shown with non-breaking spaces. | ||||
| Eq a => Eq (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods (==) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (/=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # | |||||
| Ord a => Ord (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods compare :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Ordering # (<) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (<=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (>) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (>=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # max :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a # min :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a # | |||||
| AEq a => AEq (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal Methods (===) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool Source # (~==) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool Source # | |||||
| Unbox a => Unbox (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
| type Rep1 (Dimensional ('DQuantity s) d :: Type -> Type) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal type Rep1 (Dimensional ('DQuantity s) d :: Type -> Type) = D1 ('MetaData "Dimensional" "Numeric.Units.Dimensional.Internal" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'True) (C1 ('MetaCons "Quantity" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |||||
| type Rep1 (Dimensional ('DUnit m) d :: Type -> Type) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal type Rep1 (Dimensional ('DUnit m) d :: Type -> Type) = D1 ('MetaData "Dimensional" "Numeric.Units.Dimensional.Internal" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (UnitName m)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ExactPi) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) Par1))) | |||||
| newtype MVector v (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
| newtype Dimensional ('DQuantity s) d a Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
| data Dimensional ('DUnit m) d a Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
| type Rep (Dimensional ('DQuantity s) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal type Rep (Dimensional ('DQuantity s) d a) = D1 ('MetaData "Dimensional" "Numeric.Units.Dimensional.Internal" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'True) (C1 ('MetaCons "Quantity" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))) | |||||
| type Rep (Dimensional ('DUnit m) d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal type Rep (Dimensional ('DUnit m) d a) = D1 ('MetaData "Dimensional" "Numeric.Units.Dimensional.Internal" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'False) (C1 ('MetaCons "Unit" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 (UnitName m)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 ExactPi) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 a)))) | |||||
| newtype Vector (SQuantity s d a) Source # | |||||
Defined in Numeric.Units.Dimensional.Internal | |||||
data Metricality Source #
Encodes whether a unit is a metric unit, that is, whether it can be combined with a metric prefix to form a related unit.
Constructors
| Metric | Capable of receiving a metric prefix. |
| NonMetric | Incapable of receiving a metric prefix. |
Instances
| NFData Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants Methods rnf :: Metricality -> () | |||||
| Data Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Metricality -> c Metricality gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Metricality toConstr :: Metricality -> Constr dataTypeOf :: Metricality -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Metricality) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Metricality) gmapT :: (forall b. Data b => b -> b) -> Metricality -> Metricality gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Metricality -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Metricality -> r gmapQ :: (forall d. Data d => d -> u) -> Metricality -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Metricality -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Metricality -> m Metricality gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Metricality -> m Metricality gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Metricality -> m Metricality | |||||
| Generic Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants Associated Types
| |||||
| Eq Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants | |||||
| Ord Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants Methods compare :: Metricality -> Metricality -> Ordering # (<) :: Metricality -> Metricality -> Bool # (<=) :: Metricality -> Metricality -> Bool # (>) :: Metricality -> Metricality -> Bool # (>=) :: Metricality -> Metricality -> Bool # max :: Metricality -> Metricality -> Metricality # min :: Metricality -> Metricality -> Metricality # | |||||
| type Rep Metricality Source # | |||||
Defined in Numeric.Units.Dimensional.Variants type Rep Metricality = D1 ('MetaData "Metricality" "Numeric.Units.Dimensional.Variants" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'False) (C1 ('MetaCons "Metric" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NonMetric" 'PrefixI 'False) (U1 :: Type -> Type)) | |||||
Represents a physical dimension in the basis of the 7 SI base dimensions, where the respective dimensions are represented by type variables using the following convention:
- l: Length
- m: Mass
- t: Time
- i: Electric current
- th: Thermodynamic temperature
- n: Amount of substance
- j: Luminous intensity
For the equivalent term-level representation, see Dimension'
Instances
| (KnownTypeInt l, KnownTypeInt m, KnownTypeInt t, KnownTypeInt i, KnownTypeInt th, KnownTypeInt n, KnownTypeInt j) => HasDimension (Proxy ('Dim l m t i th n j)) Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TypeLevel Methods dimension :: Proxy ('Dim l m t i th n j) -> Dimension' Source # | |
| (KnownTypeInt l, KnownTypeInt m, KnownTypeInt t, KnownTypeInt i, KnownTypeInt th, KnownTypeInt n, KnownTypeInt j) => HasDynamicDimension (Proxy ('Dim l m t i th n j)) Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TypeLevel Methods dynamicDimension :: Proxy ('Dim l m t i th n j) -> DynamicDimension Source # | |
type family NRoot (d :: Dimension) (x :: TypeInt) :: Dimension where ... Source #
Roots of dimensions correspond to division of the base dimensions' exponents by the order of the root.
type Sqrt (d :: Dimension) = NRoot d 'Pos2 Source #
Square root is a special case of NRoot with order 2.
type Cbrt (d :: Dimension) = NRoot d 'Pos3 Source #
Cube root is a special case of NRoot with order 3.
data Dimension' Source #
A physical dimension, encoded as 7 integers, representing a factorization of the dimension into the
7 SI base dimensions. By convention they are stored in the same order as
in the Dimension data kind.
Instances
| NFData Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods rnf :: Dimension' -> () | |||||
| HasDimension Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods dimension :: Dimension' -> Dimension' Source # | |||||
| HasDynamicDimension Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods | |||||
| Monoid Dimension' Source # | The monoid of dimensions under multiplication. | ||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods mempty :: Dimension' # mappend :: Dimension' -> Dimension' -> Dimension' # mconcat :: [Dimension'] -> Dimension' # | |||||
| Semigroup Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods (<>) :: Dimension' -> Dimension' -> Dimension' # sconcat :: NonEmpty Dimension' -> Dimension' stimes :: Integral b => b -> Dimension' -> Dimension' | |||||
| Data Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Dimension' -> c Dimension' gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Dimension' toConstr :: Dimension' -> Constr dataTypeOf :: Dimension' -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Dimension') dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Dimension') gmapT :: (forall b. Data b => b -> b) -> Dimension' -> Dimension' gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Dimension' -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Dimension' -> r gmapQ :: (forall d. Data d => d -> u) -> Dimension' -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Dimension' -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Dimension' -> m Dimension' gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Dimension' -> m Dimension' gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Dimension' -> m Dimension' | |||||
| Generic Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Associated Types
| |||||
| Show Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods showsPrec :: Int -> Dimension' -> ShowS # show :: Dimension' -> String # showList :: [Dimension'] -> ShowS # | |||||
| Eq Dimension' Source # | |||||
| Ord Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods compare :: Dimension' -> Dimension' -> Ordering # (<) :: Dimension' -> Dimension' -> Bool # (<=) :: Dimension' -> Dimension' -> Bool # (>) :: Dimension' -> Dimension' -> Bool # (>=) :: Dimension' -> Dimension' -> Bool # max :: Dimension' -> Dimension' -> Dimension' # min :: Dimension' -> Dimension' -> Dimension' # | |||||
| type Rep Dimension' Source # | |||||
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel type Rep Dimension' = D1 ('MetaData "Dimension'" "Numeric.Units.Dimensional.Dimensions.TermLevel" "dimensional-1.6.1-DmNxHObAeML5uhkkhNUdgI" 'False) (C1 ('MetaCons "Dim'" 'PrefixI 'False) ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int))) :*: ((S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int)) :*: (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Int))))) | |||||
class HasDynamicDimension a => HasDimension a where Source #
Dimensional values inhabit this class, which allows access to a term-level representation of their dimension.
Methods
dimension :: a -> Dimension' Source #
Obtains a term-level representation of a value's dimension.
Instances
| HasDimension Dimension' Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods dimension :: Dimension' -> Dimension' Source # | |
| HasDimension AnyUnit Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods dimension :: AnyUnit -> Dimension' Source # | |
| HasDimension (AnyQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods dimension :: AnyQuantity a -> Dimension' Source # | |
| (KnownTypeInt l, KnownTypeInt m, KnownTypeInt t, KnownTypeInt i, KnownTypeInt th, KnownTypeInt n, KnownTypeInt j) => HasDimension (Proxy ('Dim l m t i th n j)) Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TypeLevel Methods dimension :: Proxy ('Dim l m t i th n j) -> Dimension' Source # | |
| KnownDimension d => HasDimension (Dimensional v d a) Source # | |
Defined in Numeric.Units.Dimensional.Internal Methods dimension :: Dimensional v d a -> Dimension' Source # | |
type KnownDimension (d :: Dimension) = HasDimension (Proxy d) Source #
A KnownDimension is one for which we can construct a term-level representation.
Each validly constructed type of kind Dimension has a KnownDimension instance.
While KnownDimension is a constraint synonym, the presence of KnownDimension ddimension :: Proxy d -> Dimension'
(*~) :: forall a (m :: Metricality) (d :: Dimension). Num a => a -> Unit m d a -> Quantity d a infixl 7 Source #
Forms a Quantity by multipliying a number and a unit.
(/~) :: forall a (d :: Dimension) (m :: Metricality). Fractional a => Quantity d a -> Unit m d a -> a infixl 7 Source #
(^/) :: forall (n :: TypeInt) a (d :: Dimension). (KnownTypeInt n, Floating a) => Quantity d a -> Proxy n -> Quantity (NRoot d n) a infixr 8 Source #
Computes the nth root of a Quantity using **.
The NRoot type family will prevent application of this operator where the result would have a fractional dimension or where n is zero.
Because the root chosen impacts the Dimension of the result, it is necessary to supply a type-level representation
of the root in the form of a Proxy to some TypeInt. Convenience values pos1, pos2, neg1, ...
are supplied by the Numeric.NumType.DK.Integers module. The most commonly used ones are
also reexported by Numeric.Units.Dimensional.Prelude.
Also available in prefix form, see nroot.
(**) :: Floating a => Dimensionless a -> Dimensionless a -> Dimensionless a infixr 8 Source #
Raises a dimensionless quantity to a dimensionless power.
recip :: forall a (d :: Dimension). Fractional a => Quantity d a -> Quantity (Recip d) a Source #
Forms the reciprocal of a Quantity, which has the reciprocal dimension.
>>>recip $ 47 *~ hertz2.127659574468085e-2 s
nroot :: forall (n :: TypeInt) a (d :: Dimension). (KnownTypeInt n, Floating a) => Proxy n -> Quantity d a -> Quantity (NRoot d n) a Source #
Computes the nth root of a Quantity using **.
The NRoot type family will prevent application of this operator where the result would have a fractional dimension or where n is zero.
Because the root chosen impacts the Dimension of the result, it is necessary to supply a type-level representation
of the root in the form of a Proxy to some TypeInt. Convenience values pos1, pos2, neg1, ...
are supplied by the Numeric.NumType.DK.Integers module. The most commonly used ones are
also reexported by Numeric.Units.Dimensional.Prelude.
n must not be zero. Negative roots are defined such that nroot (Proxy :: Proxy (Negate n)) x == nroot (Proxy :: Proxy n) (recip x).
Also available in operator form, see ^/.
exp :: Floating a => Dimensionless a -> Dimensionless a Source #
log :: Floating a => Dimensionless a -> Dimensionless a Source #
logBase :: Floating a => Dimensionless a -> Dimensionless a -> Dimensionless a Source #
Takes the logarithm of the second argument in the base of the first.
>>>logBase _2 _83.0
sin :: Floating a => Dimensionless a -> Dimensionless a Source #
cos :: Floating a => Dimensionless a -> Dimensionless a Source #
tan :: Floating a => Dimensionless a -> Dimensionless a Source #
asin :: Floating a => Dimensionless a -> Dimensionless a Source #
acos :: Floating a => Dimensionless a -> Dimensionless a Source #
atan :: Floating a => Dimensionless a -> Dimensionless a Source #
sinh :: Floating a => Dimensionless a -> Dimensionless a Source #
cosh :: Floating a => Dimensionless a -> Dimensionless a Source #
tanh :: Floating a => Dimensionless a -> Dimensionless a Source #
asinh :: Floating a => Dimensionless a -> Dimensionless a Source #
acosh :: Floating a => Dimensionless a -> Dimensionless a Source #
atanh :: Floating a => Dimensionless a -> Dimensionless a Source #
atan2 :: forall a (d :: Dimension). RealFloat a => Quantity d a -> Quantity d a -> Dimensionless a Source #
The standard two argument arctangent function. Since it interprets its two arguments in comparison with one another, the input may have any dimension.
>>>atan2 _0 _10.0
>>>atan2 _1 _01.5707963267948966
>>>atan2 _0 (negate _1)3.141592653589793
>>>atan2 (negate _1) _0-1.5707963267948966
log1p :: Floating a => Dimensionless a -> Dimensionless a Source #
expm1 :: Floating a => Dimensionless a -> Dimensionless a Source #
log1pexp :: Floating a => Dimensionless a -> Dimensionless a Source #
log1mexp :: Floating a => Dimensionless a -> Dimensionless a Source #
(*~~) :: forall f a (m :: Metricality) (d :: Dimension). (Functor f, Num a) => f a -> Unit m d a -> f (Quantity d a) infixl 7 Source #
Applies *~ to all values in a functor.
(/~~) :: forall f (m :: Metricality) (d :: Dimension) a. (Functor f, Fractional a) => f (Quantity d a) -> Unit m d a -> f a infixl 7 Source #
Applies /~ to all values in a functor.
sum :: forall a f (d :: Dimension). (Num a, Foldable f) => f (Quantity d a) -> Quantity d a Source #
The sum of all elements in a foldable structure.
>>>sum ([] :: [Mass Double])0.0 kg
>>>sum [12.4 *~ meter, 1 *~ foot]12.7048 m
mean :: forall a f (d :: Dimension). (Fractional a, Foldable f) => f (Quantity d a) -> Quantity d a Source #
The arithmetic mean of all elements in a foldable structure.
>>>mean [pi, _7]5.070796326794897
product :: (Num a, Foldable f) => f (Dimensionless a) -> Dimensionless a Source #
The product of all elements in a foldable structure.
>>>product ([] :: [Dimensionless Double])1.0
>>>product [pi, _4, 0.36 *~ one]4.523893421169302
dimensionlessLength :: (Num a, Foldable f) => f b -> Dimensionless a Source #
The length of the foldable data structure as a Dimensionless.
This can be useful for purposes of e.g. calculating averages.
>>>dimensionlessLength ["foo", "bar"]2
Arguments
| :: forall a b (d :: Dimension). (Fractional a, Integral b) | |
| => Quantity d a | The initial value. |
| -> Quantity d a | The final value. |
| -> b | The number of intermediate values. If less than one, no intermediate values will result. |
| -> [Quantity d a] |
Returns a list of quantities between given bounds.
n <= 0 ==> nFromTo (x :: Mass Double) (y :: Mass Double) n == [x, y]
(x :: Length Double) <= (y :: Length Double) ==> all (\z -> x <= z && z <= y) (nFromTo x y n)
>>>nFromTo _0 _3 2[0.0,1.0,2.0,3.0]
>>>nFromTo _1 _0 7[1.0,0.875,0.75,0.625,0.5,0.375,0.25,0.125,0.0]
>>>nFromTo _0 _1 (-5)[0.0,1.0]
type DOne = 'Dim 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero 'Zero Source #
The type-level dimension of dimensionless values.
type Dimensionless = Quantity DOne Source #
_0 :: forall a (d :: Dimension). Num a => Quantity d a Source #
The constant for zero is polymorphic, allowing it to express zero Length or
Capacitance or Velocity etc,
in addition to the Dimensionless value zero.
_1 :: Num a => Dimensionless a Source #
_2 :: Num a => Dimensionless a Source #
_3 :: Num a => Dimensionless a Source #
_4 :: Num a => Dimensionless a Source #
_5 :: Num a => Dimensionless a Source #
_6 :: Num a => Dimensionless a Source #
_7 :: Num a => Dimensionless a Source #
_8 :: Num a => Dimensionless a Source #
_9 :: Num a => Dimensionless a Source #
tau :: Floating a => Dimensionless a Source #
Twice pi.
For background on tau see https://tauday.com/tau-manifesto (but also
feel free to review https://web.archive.org/web/20200926221249/http://www.thepimanifesto.com/).
siUnit :: forall (d :: Dimension) a. (KnownDimension d, Num a) => Unit 'NonMetric d a Source #
A polymorphic Unit which can be used in place of the coherent
SI base unit of any dimension. This allows polymorphic quantity
creation and destruction without exposing the Dimensional constructor.
one :: Num a => Unit 'NonMetric DOne a Source #
The unit one has dimension DOne and is the base unit of dimensionless values.
As detailed in 7.10 "Values of quantities expressed simply as numbers:
the unit one, symbol 1" of [1], the unit one generally does not
appear in expressions. However, for us it is necessary to use one
as we would any other unit to perform the "wrapping" of dimensionless values.
mkUnitR :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Floating a => UnitName m -> ExactPi -> Unit m1 d a -> Unit m d a Source #
Forms a new atomic Unit by specifying its UnitName and its definition as a multiple of another Unit.
Use this variant when the scale factor of the resulting unit is irrational or Approximate. See mkUnitQ for when it is rational
and mkUnitZ for when it is an integer.
Note that supplying zero as a definining quantity is invalid, as the library relies upon units forming a group under multiplication.
Supplying negative defining quantities is allowed and handled gracefully, but is discouraged on the grounds that it may be unexpected by other readers.
mkUnitQ :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Fractional a => UnitName m -> Rational -> Unit m1 d a -> Unit m d a Source #
mkUnitZ :: forall a (m :: Metricality) (m1 :: Metricality) (d :: Dimension). Num a => UnitName m -> Integer -> Unit m1 d a -> Unit m d a Source #
exactValue :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> ExactPi Source #
weaken :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Unit 'NonMetric d a Source #
Discards potentially unwanted type level information about a Unit.
strengthen :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Maybe (Unit 'Metric d a) Source #
exactify :: forall (m :: Metricality) (d :: Dimension) a. Unit m d a -> Unit m d ExactPi Source #
Forms the exact version of a Unit.
showIn :: forall a (m :: Metricality) (d :: Dimension). (Show a, Fractional a) => Unit m d a -> Quantity d a -> String Source #
changeRep :: forall (v :: Variant) a b (d :: Dimension). (KnownVariant v, Real a, Fractional b) => Dimensional v d a -> Dimensional v d b Source #
Convenient conversion between numerical types while retaining dimensional information.
>>>let x = (37 :: Rational) *~ poundMass>>>changeRep x :: Mass Double16.78291769 kg
changeRepApproximate :: forall (v :: Variant) b (d :: Dimension). (KnownVariant v, Floating b) => Dimensional v d ExactPi -> Dimensional v d b Source #
Convenient conversion from exactly represented values while retaining dimensional information.
asLens :: forall a (m :: Metricality) (d :: Dimension). Fractional a => Unit m d a -> forall (f :: Type -> Type). Functor f => (a -> f a) -> Quantity d a -> f (Quantity d a) Source #
class Category (cat :: k -> k -> Type) where #
Methods
id :: forall (a :: k). cat a a #
(.) :: forall (b :: k) (c :: k) (a :: k). cat b c -> cat a b -> cat a c #
Instances
| Category Op | |
Defined in Data.Functor.Contravariant | |
| Monad m => Category (Kleisli m :: Type -> Type -> Type) | |
Defined in GHC.Internal.Control.Arrow | |
| Category (Coercion :: k -> k -> Type) | |
Defined in GHC.Internal.Control.Category | |
| Category ((:~:) :: k -> k -> Type) | |
Defined in GHC.Internal.Control.Category | |
| Category (->) | |
Defined in GHC.Internal.Control.Category | |
| Category ((:~~:) :: k -> k -> Type) | |
Defined in GHC.Internal.Control.Category | |
class Fractional a => Floating a #
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Instances
| Floating ExactPi | |
| Floating CDouble | |
Defined in GHC.Internal.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 CFloat | |
Defined in GHC.Internal.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 Double | |
| Floating Float | |
| RealFloat a => Floating (Complex a) | |
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 (DynQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods pi :: DynQuantity a exp :: DynQuantity a -> DynQuantity a log :: DynQuantity a -> DynQuantity a sqrt :: DynQuantity a -> DynQuantity a (**) :: DynQuantity a -> DynQuantity a -> DynQuantity a logBase :: DynQuantity a -> DynQuantity a -> DynQuantity a sin :: DynQuantity a -> DynQuantity a cos :: DynQuantity a -> DynQuantity a tan :: DynQuantity a -> DynQuantity a asin :: DynQuantity a -> DynQuantity a acos :: DynQuantity a -> DynQuantity a atan :: DynQuantity a -> DynQuantity a sinh :: DynQuantity a -> DynQuantity a cosh :: DynQuantity a -> DynQuantity a tanh :: DynQuantity a -> DynQuantity a asinh :: DynQuantity a -> DynQuantity a acosh :: DynQuantity a -> DynQuantity a atanh :: DynQuantity a -> DynQuantity a log1p :: DynQuantity a -> DynQuantity a expm1 :: DynQuantity a -> DynQuantity a log1pexp :: DynQuantity a -> DynQuantity a log1mexp :: DynQuantity a -> DynQuantity a | |
| Floating a => Floating (Identity a) | |
Defined in GHC.Internal.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 | |
| Floating a => Floating (Down a) | |
Defined in GHC.Internal.Data.Ord Methods pi :: Down a exp :: Down a -> Down a log :: Down a -> Down a sqrt :: Down a -> Down a (**) :: Down a -> Down a -> Down a logBase :: Down a -> Down a -> Down a sin :: Down a -> Down a cos :: Down a -> Down a tan :: Down a -> Down a asin :: Down a -> Down a acos :: Down a -> Down a atan :: Down a -> Down a sinh :: Down a -> Down a cosh :: Down a -> Down a tanh :: Down a -> Down a asinh :: Down a -> Down a acosh :: Down a -> Down a atanh :: Down a -> Down a log1p :: Down a -> Down a expm1 :: Down a -> Down a log1pexp :: Down a -> Down a log1mexp :: Down a -> Down a | |
| Floating a => Floating (Op a b) | |
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) | |
Defined in GHC.Internal.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 (f (g a)) => Floating (Compose f g a) | |
Defined in Data.Functor.Compose Methods pi :: Compose f g a exp :: Compose f g a -> Compose f g a log :: Compose f g a -> Compose f g a sqrt :: Compose f g a -> Compose f g a (**) :: Compose f g a -> Compose f g a -> Compose f g a logBase :: Compose f g a -> Compose f g a -> Compose f g a sin :: Compose f g a -> Compose f g a cos :: Compose f g a -> Compose f g a tan :: Compose f g a -> Compose f g a asin :: Compose f g a -> Compose f g a acos :: Compose f g a -> Compose f g a atan :: Compose f g a -> Compose f g a sinh :: Compose f g a -> Compose f g a cosh :: Compose f g a -> Compose f g a tanh :: Compose f g a -> Compose f g a asinh :: Compose f g a -> Compose f g a acosh :: Compose f g a -> Compose f g a atanh :: Compose f g a -> Compose f g a log1p :: Compose f g a -> Compose f g a expm1 :: Compose f g a -> Compose f g a log1pexp :: Compose f g a -> Compose f g a log1mexp :: Compose f g a -> Compose f g a | |
Instances
| PrintfArg Integer | |
Defined in Text.Printf | |
| NFData Integer | |
Defined in Control.DeepSeq | |
| Bits Integer | |
Defined in GHC.Internal.Bits Methods (.&.) :: Integer -> Integer -> Integer (.|.) :: Integer -> Integer -> Integer xor :: Integer -> Integer -> Integer complement :: Integer -> Integer shift :: Integer -> Int -> Integer rotate :: Integer -> Int -> Integer setBit :: Integer -> Int -> Integer clearBit :: Integer -> Int -> Integer complementBit :: Integer -> Int -> Integer testBit :: Integer -> Int -> Bool bitSizeMaybe :: Integer -> Maybe Int shiftL :: Integer -> Int -> Integer unsafeShiftL :: Integer -> Int -> Integer shiftR :: Integer -> Int -> Integer unsafeShiftR :: Integer -> Int -> Integer rotateL :: Integer -> Int -> Integer | |
| Data Integer | |
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Integer -> c Integer gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Integer dataTypeOf :: Integer -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Integer) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Integer) gmapT :: (forall b. Data b => b -> b) -> Integer -> Integer gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Integer -> r gmapQ :: (forall d. Data d => d -> u) -> Integer -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Integer -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Integer -> m Integer gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Integer -> m Integer | |
| Enum Integer | |
| Num Integer | |
| Read Integer | |
| Integral Integer | |
Defined in GHC.Internal.Real | |
| Real Integer | |
Defined in GHC.Internal.Real Methods toRational :: Integer -> Rational # | |
| Show Integer | |
| Eq Integer | |
| Ord Integer | |
| AEq Integer | |
| Lift Integer | |
Instances
| MonadZip Maybe | |||||
| Eq1 Maybe | |||||
| Ord1 Maybe | |||||
Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Maybe a -> Maybe b -> Ordering | |||||
| Read1 Maybe | |||||
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 | |||||
Defined in Data.Functor.Classes | |||||
| NFData1 Maybe | |||||
Defined in Control.DeepSeq | |||||
| Alternative Maybe | |||||
| Applicative Maybe | |||||
| Functor Maybe | |||||
| Monad Maybe | |||||
| MonadPlus Maybe | |||||
| MonadFail Maybe | |||||
Defined in GHC.Internal.Control.Monad.Fail | |||||
| Foldable Maybe | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Maybe m -> m foldMap :: Monoid m => (a -> m) -> Maybe a -> 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 # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # | |||||
| Traversable Maybe | |||||
| Generic1 Maybe | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Lift a => Lift (Maybe a :: Type) | |||||
| NFData a => NFData (Maybe a) | |||||
Defined in Control.DeepSeq | |||||
| Semigroup a => Monoid (Maybe a) | |||||
| Semigroup a => Semigroup (Maybe a) | |||||
| Data a => Data (Maybe a) | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) dataTypeOf :: Maybe a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) | |||||
| Generic (Maybe a) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| SingKind a => SingKind (Maybe a) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Read a => Read (Maybe a) | |||||
| Show a => Show (Maybe a) | |||||
| Eq a => Eq (Maybe a) | |||||
| Ord a => Ord (Maybe a) | |||||
| AEq a => AEq (Maybe a) | |||||
| SingI ('Nothing :: Maybe a) | |||||
Defined in GHC.Internal.Generics | |||||
| SingI a2 => SingI ('Just a2 :: Maybe a1) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep1 Maybe | |||||
Defined in GHC.Internal.Generics | |||||
| type DemoteRep (Maybe a) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (Maybe a) | |||||
Defined in GHC.Internal.Generics | |||||
| data Sing (b :: Maybe a) | |||||
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
Instances
| Real CBool | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CBool -> Rational # | |
| Real CChar | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CChar -> Rational # | |
| Real CClock | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CClock -> Rational # | |
| Real CDouble | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CDouble -> Rational # | |
| Real CFloat | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CFloat -> Rational # | |
| Real CInt | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CInt -> Rational # | |
| Real CIntMax | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CIntMax -> Rational # | |
| Real CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CIntPtr -> Rational # | |
| Real CLLong | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CLLong -> Rational # | |
| Real CLong | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CLong -> Rational # | |
| Real CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CPtrdiff -> Rational # | |
| Real CSChar | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSChar -> Rational # | |
| Real CSUSeconds | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSUSeconds -> Rational # | |
| Real CShort | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CShort -> Rational # | |
| Real CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSigAtomic -> Rational # | |
| Real CSize | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CSize -> Rational # | |
| Real CTime | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CTime -> Rational # | |
| Real CUChar | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUChar -> Rational # | |
| Real CUInt | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUInt -> Rational # | |
| Real CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUIntMax -> Rational # | |
| Real CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUIntPtr -> Rational # | |
| Real CULLong | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CULLong -> Rational # | |
| Real CULong | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CULong -> Rational # | |
| Real CUSeconds | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUSeconds -> Rational # | |
| Real CUShort | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CUShort -> Rational # | |
| Real CWchar | |
Defined in GHC.Internal.Foreign.C.Types Methods toRational :: CWchar -> Rational # | |
| Real Int16 | |
Defined in GHC.Internal.Int Methods toRational :: Int16 -> Rational # | |
| Real Int32 | |
Defined in GHC.Internal.Int Methods toRational :: Int32 -> Rational # | |
| Real Int64 | |
Defined in GHC.Internal.Int Methods toRational :: Int64 -> Rational # | |
| Real Int8 | |
Defined in GHC.Internal.Int Methods toRational :: Int8 -> Rational # | |
| Real Word16 | |
Defined in GHC.Internal.Word Methods toRational :: Word16 -> Rational # | |
| Real Word32 | |
Defined in GHC.Internal.Word Methods toRational :: Word32 -> Rational # | |
| Real Word64 | |
Defined in GHC.Internal.Word Methods toRational :: Word64 -> Rational # | |
| Real Word8 | |
Defined in GHC.Internal.Word Methods toRational :: Word8 -> Rational # | |
| Real Integer | |
Defined in GHC.Internal.Real Methods toRational :: Integer -> Rational # | |
| Real Natural | |
Defined in GHC.Internal.Real Methods toRational :: Natural -> Rational # | |
| Real Double | |
Defined in GHC.Internal.Float Methods toRational :: Double -> Rational # | |
| Real Float | |
Defined in GHC.Internal.Float Methods toRational :: Float -> Rational # | |
| Real Int | |
Defined in GHC.Internal.Real Methods toRational :: Int -> Rational # | |
| Real Word | |
Defined in GHC.Internal.Real Methods toRational :: Word -> Rational # | |
| Real a => Real (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| Real a => Real (Down a) | |
Defined in GHC.Internal.Data.Ord Methods toRational :: Down a -> Rational # | |
| Integral a => Real (Ratio a) | |
Defined in GHC.Internal.Real Methods toRational :: Ratio a -> Rational # | |
| HasResolution a => Real (Fixed a) | |
Defined in Data.Fixed Methods toRational :: Fixed a -> Rational # | |
| Real a => Real (Const a b) | |
Defined in GHC.Internal.Data.Functor.Const Methods toRational :: Const a b -> Rational # | |
| Real (f (g a)) => Real (Compose f g a) | |
Defined in Data.Functor.Compose Methods toRational :: Compose f g a -> Rational # | |
Instances
| PrintfArg Double | |||||
Defined in Text.Printf | |||||
| NFData Double | |||||
Defined in Control.DeepSeq | |||||
| Data Double | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Double -> c Double gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Double dataTypeOf :: Double -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Double) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Double) gmapT :: (forall b. Data b => b -> b) -> Double -> Double gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r gmapQ :: (forall d. Data d => d -> u) -> Double -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Double -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Double -> m Double gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double | |||||
| Enum Double | |||||
Defined in GHC.Internal.Float | |||||
| Floating Double | |||||
| RealFloat Double | |||||
Defined in GHC.Internal.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |||||
| Storable Double | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Num Double | |||||
| Read Double | |||||
| Fractional Double | |||||
| Real Double | |||||
Defined in GHC.Internal.Float Methods toRational :: Double -> Rational # | |||||
| RealFrac Double | |||||
| Show Double | |||||
| Eq Double | |||||
| Ord Double | |||||
| AEq Double | |||||
| IEEE Double | |||||
Defined in Numeric.IEEE Methods minDenormal :: Double Source # copySign :: Double -> Double -> Double Source # identicalIEEE :: Double -> Double -> Bool Source # succIEEE :: Double -> Double Source # predIEEE :: Double -> Double Source # bisectIEEE :: Double -> Double -> Double Source # sameSignificandBits :: Double -> Double -> Int Source # nanWithPayload :: Word64 -> Double Source # maxNaNPayload :: Double -> Word64 Source # nanPayload :: Double -> Word64 Source # | |||||
| Unbox Double | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Double | |||||
| Vector Vector Double | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Double -> ST s (Vector Double) basicUnsafeThaw :: Vector Double -> ST s (Mutable Vector s Double) basicLength :: Vector Double -> Int basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double basicUnsafeIndexM :: Vector Double -> Int -> Box Double basicUnsafeCopy :: Mutable Vector s Double -> Vector Double -> ST s () | |||||
| MVector MVector Double | |||||
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 :: Int -> ST s (MVector s Double) basicInitialize :: MVector s Double -> ST s () basicUnsafeReplicate :: Int -> Double -> ST s (MVector s Double) basicUnsafeRead :: MVector s Double -> Int -> ST s Double basicUnsafeWrite :: MVector s Double -> Int -> Double -> ST s () basicClear :: MVector s Double -> ST s () basicSet :: MVector s Double -> Double -> ST s () basicUnsafeCopy :: MVector s Double -> MVector s Double -> ST s () basicUnsafeMove :: MVector s Double -> MVector s Double -> ST s () basicUnsafeGrow :: MVector s Double -> Int -> ST s (MVector s Double) | |||||
| Generic1 (URec Double :: k -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Foldable (UDouble :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UDouble m -> m foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # toList :: UDouble a -> [a] elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |||||
| Traversable (UDouble :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| AEq (Complex Double) | |||||
| Functor (URec Double :: Type -> Type) | |||||
| Generic (URec Double p) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Show (URec Double p) | |||||
| Eq (URec Double p) | |||||
| Ord (URec Double p) | |||||
Defined in GHC.Internal.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 # | |||||
| newtype Vector Double | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| data URec Double (p :: k) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype MVector s Double | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| type Rep1 (URec Double :: k -> Type) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (URec Double p) | |||||
Defined in GHC.Internal.Generics | |||||
Minimal complete definition
(+), (*), abs, signum, fromInteger, (negate | (-))
Methods
fromInteger :: Integer -> a #
Instances
| Num ExactPi | |
| Num CBool | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CClock | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CDouble | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CFloat | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CLLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CSChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CSUSeconds | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CSize | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CTime | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CULLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CULong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUSeconds | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CUShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num CWchar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Num Int16 | |
Defined in GHC.Internal.Int | |
| Num Int32 | |
Defined in GHC.Internal.Int | |
| Num Int64 | |
Defined in GHC.Internal.Int | |
| Num Int8 | |
Defined in GHC.Internal.Int | |
| Num Word16 | |
Defined in GHC.Internal.Word | |
| Num Word32 | |
Defined in GHC.Internal.Word | |
| Num Word64 | |
Defined in GHC.Internal.Word | |
| Num Word8 | |
Defined in GHC.Internal.Word | |
| Num Size | |
Defined in Data.Vector.Fusion.Bundle.Size | |
| Num Integer | |
| Num Natural | |
Defined in GHC.Internal.Num | |
| Num Double | |
| Num Float | |
| Num Int | |
| Num Word | |
| RealFloat a => Num (Complex a) | |
Defined in Data.Complex | |
| Num a => Num (Max a) | |
Defined in Data.Semigroup | |
| Num a => Num (Min a) | |
Defined in Data.Semigroup | |
| Num a => Num (DynQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods (+) :: DynQuantity a -> DynQuantity a -> DynQuantity a (-) :: DynQuantity a -> DynQuantity a -> DynQuantity a (*) :: DynQuantity a -> DynQuantity a -> DynQuantity a negate :: DynQuantity a -> DynQuantity a abs :: DynQuantity a -> DynQuantity a signum :: DynQuantity a -> DynQuantity a fromInteger :: Integer -> DynQuantity a # | |
| Num a => Num (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity | |
| Num a => Num (Down a) | |
Defined in GHC.Internal.Data.Ord | |
| Num a => Num (Product a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Num a => Num (Sum a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Integral a => Num (Ratio a) | |
Defined in GHC.Internal.Real | |
| HasResolution a => Num (Fixed a) | |
Defined in Data.Fixed | |
| Num a => Num (Op a b) | |
Defined in Data.Functor.Contravariant | |
| Num a => Num (Const a b) | |
Defined in GHC.Internal.Data.Functor.Const | |
| (Applicative f, Num a) => Num (Ap f a) | |
Defined in GHC.Internal.Data.Monoid | |
| Num (f a) => Num (Alt f a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Num (f (g a)) => Num (Compose f g a) | |
Defined in Data.Functor.Compose Methods (+) :: Compose f g a -> Compose f g a -> Compose f g a (-) :: Compose f g a -> Compose f g a -> Compose f g a (*) :: Compose f g a -> Compose f g a -> Compose f g a negate :: Compose f g a -> Compose f g a abs :: Compose f g a -> Compose f g a signum :: Compose f g a -> Compose f g a fromInteger :: Integer -> Compose f g a # | |
class Num a => Fractional a where #
Methods
fromRational :: Rational -> a #
Instances
| Fractional ExactPi | |
| Fractional CDouble | |
Defined in GHC.Internal.Foreign.C.Types Methods (/) :: CDouble -> CDouble -> CDouble recip :: CDouble -> CDouble fromRational :: Rational -> CDouble # | |
| Fractional CFloat | |
Defined in GHC.Internal.Foreign.C.Types Methods (/) :: CFloat -> CFloat -> CFloat recip :: CFloat -> CFloat fromRational :: Rational -> CFloat # | |
| Fractional Double | |
| Fractional Float | |
| RealFloat a => Fractional (Complex a) | |
Defined in Data.Complex Methods (/) :: Complex a -> Complex a -> Complex a recip :: Complex a -> Complex a fromRational :: Rational -> Complex a # | |
| Fractional a => Fractional (DynQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods (/) :: DynQuantity a -> DynQuantity a -> DynQuantity a recip :: DynQuantity a -> DynQuantity a fromRational :: Rational -> DynQuantity a # | |
| Fractional a => Fractional (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity Methods (/) :: Identity a -> Identity a -> Identity a recip :: Identity a -> Identity a fromRational :: Rational -> Identity a # | |
| Fractional a => Fractional (Down a) | |
Defined in GHC.Internal.Data.Ord Methods (/) :: Down a -> Down a -> Down a recip :: Down a -> Down a fromRational :: Rational -> Down a # | |
| Integral a => Fractional (Ratio a) | |
Defined in GHC.Internal.Real Methods (/) :: Ratio a -> Ratio a -> Ratio a recip :: Ratio a -> Ratio a fromRational :: Rational -> Ratio a # | |
| HasResolution a => Fractional (Fixed a) | |
Defined in Data.Fixed Methods (/) :: Fixed a -> Fixed a -> Fixed a recip :: Fixed a -> Fixed a fromRational :: Rational -> Fixed a # | |
| Fractional a => Fractional (Op a b) | |
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) | |
Defined in GHC.Internal.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 (f (g a)) => Fractional (Compose f g a) | |
Defined in Data.Functor.Compose Methods (/) :: Compose f g a -> Compose f g a -> Compose f g a recip :: Compose f g a -> Compose f g a fromRational :: Rational -> Compose f g a # | |
Instances
| NFData Bool | |||||
Defined in Control.DeepSeq | |||||
| Bits Bool | |||||
Defined in GHC.Internal.Bits | |||||
| FiniteBits Bool | |||||
Defined in GHC.Internal.Bits Methods finiteBitSize :: Bool -> Int countLeadingZeros :: Bool -> Int countTrailingZeros :: Bool -> Int | |||||
| Data Bool | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bool -> c Bool gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool dataTypeOf :: Bool -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool | |||||
| Bounded Bool | |||||
| Enum Bool | |||||
| Storable Bool | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Generic Bool | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| SingKind Bool | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Read Bool | |||||
| Show Bool | |||||
| Eq Bool | |||||
| Ord Bool | |||||
| AEq Bool | |||||
| Unbox Bool | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| SingI 'False | |||||
Defined in GHC.Internal.Generics | |||||
| SingI 'True | |||||
Defined in GHC.Internal.Generics | |||||
| Lift Bool | |||||
| Vector Vector Bool | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Bool -> ST s (Vector Bool) basicUnsafeThaw :: Vector Bool -> ST s (Mutable Vector s Bool) basicLength :: Vector Bool -> Int basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool basicUnsafeIndexM :: Vector Bool -> Int -> Box Bool basicUnsafeCopy :: Mutable Vector s Bool -> Vector Bool -> ST s () | |||||
| MVector MVector Bool | |||||
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 :: Int -> ST s (MVector s Bool) basicInitialize :: MVector s Bool -> ST s () basicUnsafeReplicate :: Int -> Bool -> ST s (MVector s Bool) basicUnsafeRead :: MVector s Bool -> Int -> ST s Bool basicUnsafeWrite :: MVector s Bool -> Int -> Bool -> ST s () basicClear :: MVector s Bool -> ST s () basicSet :: MVector s Bool -> Bool -> ST s () basicUnsafeCopy :: MVector s Bool -> MVector s Bool -> ST s () basicUnsafeMove :: MVector s Bool -> MVector s Bool -> ST s () basicUnsafeGrow :: MVector s Bool -> Int -> ST s (MVector s Bool) | |||||
| type DemoteRep Bool | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep Bool | |||||
Defined in GHC.Internal.Generics | |||||
| data Sing (a :: Bool) | |||||
| newtype Vector Bool | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| newtype MVector s Bool | |||||
Defined in Data.Vector.Unboxed.Base | |||||
Instances
| IsChar Char | |||||
| PrintfArg Char | |||||
Defined in Text.Printf | |||||
| NFData Char | |||||
Defined in Control.DeepSeq | |||||
| Data Char | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Char -> c Char gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Char dataTypeOf :: Char -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Char) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Char) gmapT :: (forall b. Data b => b -> b) -> Char -> Char gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Char -> r gmapQ :: (forall d. Data d => d -> u) -> Char -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Char -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Char -> m Char gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Char -> m Char | |||||
| Bounded Char | |||||
| Enum Char | |||||
| Storable Char | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Read Char | |||||
| Show Char | |||||
| Eq Char | |||||
| Ord Char | |||||
| AEq Char | |||||
| Unbox Char | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Char | |||||
| Vector Vector Char | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Char -> ST s (Vector Char) basicUnsafeThaw :: Vector Char -> ST s (Mutable Vector s Char) basicLength :: Vector Char -> Int basicUnsafeSlice :: Int -> Int -> Vector Char -> Vector Char basicUnsafeIndexM :: Vector Char -> Int -> Box Char basicUnsafeCopy :: Mutable Vector s Char -> Vector Char -> ST s () | |||||
| MVector MVector Char | |||||
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 :: Int -> ST s (MVector s Char) basicInitialize :: MVector s Char -> ST s () basicUnsafeReplicate :: Int -> Char -> ST s (MVector s Char) basicUnsafeRead :: MVector s Char -> Int -> ST s Char basicUnsafeWrite :: MVector s Char -> Int -> Char -> ST s () basicClear :: MVector s Char -> ST s () basicSet :: MVector s Char -> Char -> ST s () basicUnsafeCopy :: MVector s Char -> MVector s Char -> ST s () basicUnsafeMove :: MVector s Char -> MVector s Char -> ST s () basicUnsafeGrow :: MVector s Char -> Int -> ST s (MVector s Char) | |||||
| Generic1 (URec Char :: k -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Foldable (UChar :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UChar m -> m foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # toList :: UChar a -> [a] elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # | |||||
| Traversable (UChar :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| Functor (URec Char :: Type -> Type) | |||||
| Generic (URec Char p) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Show (URec Char p) | |||||
| Eq (URec Char p) | |||||
| Ord (URec Char p) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype Vector Char | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| data URec Char (p :: k) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype MVector s Char | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| type Compare (a :: Char) (b :: Char) | |||||
Defined in GHC.Internal.Data.Type.Ord | |||||
| type Rep1 (URec Char :: k -> Type) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (URec Char p) | |||||
Defined in GHC.Internal.Generics | |||||
Instances
| PrintfArg Float | |||||
Defined in Text.Printf | |||||
| NFData Float | |||||
Defined in Control.DeepSeq | |||||
| Data Float | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Float -> c Float gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Float dataTypeOf :: Float -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Float) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Float) gmapT :: (forall b. Data b => b -> b) -> Float -> Float gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r gmapQ :: (forall d. Data d => d -> u) -> Float -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Float -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Float -> m Float gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float | |||||
| Enum Float | |||||
Defined in GHC.Internal.Float | |||||
| Floating Float | |||||
| RealFloat Float | |||||
Defined in GHC.Internal.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |||||
| Storable Float | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Num Float | |||||
| Read Float | |||||
| Fractional Float | |||||
| Real Float | |||||
Defined in GHC.Internal.Float Methods toRational :: Float -> Rational # | |||||
| RealFrac Float | |||||
| Show Float | |||||
| Eq Float | |||||
| Ord Float | |||||
| AEq Float | |||||
| IEEE Float | |||||
Defined in Numeric.IEEE Methods minDenormal :: Float Source # copySign :: Float -> Float -> Float Source # identicalIEEE :: Float -> Float -> Bool Source # succIEEE :: Float -> Float Source # predIEEE :: Float -> Float Source # bisectIEEE :: Float -> Float -> Float Source # sameSignificandBits :: Float -> Float -> Int Source # nanWithPayload :: Word64 -> Float Source # maxNaNPayload :: Float -> Word64 Source # nanPayload :: Float -> Word64 Source # | |||||
| Unbox Float | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Float | |||||
| Vector Vector Float | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Float -> ST s (Vector Float) basicUnsafeThaw :: Vector Float -> ST s (Mutable Vector s Float) basicLength :: Vector Float -> Int basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float basicUnsafeIndexM :: Vector Float -> Int -> Box Float basicUnsafeCopy :: Mutable Vector s Float -> Vector Float -> ST s () | |||||
| MVector MVector Float | |||||
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 :: Int -> ST s (MVector s Float) basicInitialize :: MVector s Float -> ST s () basicUnsafeReplicate :: Int -> Float -> ST s (MVector s Float) basicUnsafeRead :: MVector s Float -> Int -> ST s Float basicUnsafeWrite :: MVector s Float -> Int -> Float -> ST s () basicClear :: MVector s Float -> ST s () basicSet :: MVector s Float -> Float -> ST s () basicUnsafeCopy :: MVector s Float -> MVector s Float -> ST s () basicUnsafeMove :: MVector s Float -> MVector s Float -> ST s () basicUnsafeGrow :: MVector s Float -> Int -> ST s (MVector s Float) | |||||
| Generic1 (URec Float :: k -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Foldable (UFloat :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UFloat m -> m foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # toList :: UFloat a -> [a] elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # | |||||
| Traversable (UFloat :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| AEq (Complex Float) | |||||
| Functor (URec Float :: Type -> Type) | |||||
| Generic (URec Float p) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Show (URec Float p) | |||||
| Eq (URec Float p) | |||||
| Ord (URec Float p) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype Vector Float | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| data URec Float (p :: k) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype MVector s Float | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| type Rep1 (URec Float :: k -> Type) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (URec Float p) | |||||
Defined in GHC.Internal.Generics | |||||
Instances
| PrintfArg Int | |||||
Defined in Text.Printf | |||||
| NFData Int | |||||
Defined in Control.DeepSeq | |||||
| Bits Int | |||||
Defined in GHC.Internal.Bits Methods complement :: Int -> Int complementBit :: Int -> Int -> Int bitSizeMaybe :: Int -> Maybe Int unsafeShiftL :: Int -> Int -> Int unsafeShiftR :: Int -> Int -> Int | |||||
| FiniteBits Int | |||||
Defined in GHC.Internal.Bits | |||||
| Data Int | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Int -> c Int gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Int dataTypeOf :: Int -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Int) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Int) gmapT :: (forall b. Data b => b -> b) -> Int -> Int gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Int -> r gmapQ :: (forall d. Data d => d -> u) -> Int -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Int -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Int -> m Int gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Int -> m Int | |||||
| Bounded Int | |||||
| Enum Int | |||||
| Storable Int | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Num Int | |||||
| Read Int | |||||
| Integral Int | |||||
| Real Int | |||||
Defined in GHC.Internal.Real Methods toRational :: Int -> Rational # | |||||
| Show Int | |||||
| Eq Int | |||||
| Ord Int | |||||
| AEq Int | |||||
| Unbox Int | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Int | |||||
| Vector Vector Int | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Int -> ST s (Vector Int) basicUnsafeThaw :: Vector Int -> ST s (Mutable Vector s Int) basicLength :: Vector Int -> Int basicUnsafeSlice :: Int -> Int -> Vector Int -> Vector Int basicUnsafeIndexM :: Vector Int -> Int -> Box Int basicUnsafeCopy :: Mutable Vector s Int -> Vector Int -> ST s () | |||||
| MVector MVector Int | |||||
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 :: Int -> ST s (MVector s Int) basicInitialize :: MVector s Int -> ST s () basicUnsafeReplicate :: Int -> Int -> ST s (MVector s Int) basicUnsafeRead :: MVector s Int -> Int -> ST s Int basicUnsafeWrite :: MVector s Int -> Int -> Int -> ST s () basicClear :: MVector s Int -> ST s () basicSet :: MVector s Int -> Int -> ST s () basicUnsafeCopy :: MVector s Int -> MVector s Int -> ST s () basicUnsafeMove :: MVector s Int -> MVector s Int -> ST s () basicUnsafeGrow :: MVector s Int -> Int -> ST s (MVector s Int) | |||||
| Generic1 (URec Int :: k -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Foldable (UInt :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UInt m -> m foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # toList :: UInt a -> [a] elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |||||
| Traversable (UInt :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| Functor (URec Int :: Type -> Type) | |||||
| Generic (URec Int p) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Show (URec Int p) | |||||
| Eq (URec Int p) | |||||
| Ord (URec Int p) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype Vector Int | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| data URec Int (p :: k) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype MVector s Int | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| type Rep1 (URec Int :: k -> Type) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (URec Int p) | |||||
Defined in GHC.Internal.Generics | |||||
Instances
| PrintfArg Word | |||||
Defined in Text.Printf | |||||
| NFData Word | |||||
Defined in Control.DeepSeq | |||||
| Bits Word | |||||
Defined in GHC.Internal.Bits | |||||
| FiniteBits Word | |||||
Defined in GHC.Internal.Bits Methods finiteBitSize :: Word -> Int countLeadingZeros :: Word -> Int countTrailingZeros :: Word -> Int | |||||
| Data Word | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Word -> c Word gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Word dataTypeOf :: Word -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Word) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Word) gmapT :: (forall b. Data b => b -> b) -> Word -> Word gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Word -> r gmapQ :: (forall d. Data d => d -> u) -> Word -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Word -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Word -> m Word gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Word -> m Word | |||||
| Bounded Word | |||||
| Enum Word | |||||
| Storable Word | |||||
Defined in GHC.Internal.Foreign.Storable | |||||
| Num Word | |||||
| Read Word | |||||
| Integral Word | |||||
| Real Word | |||||
Defined in GHC.Internal.Real Methods toRational :: Word -> Rational # | |||||
| Show Word | |||||
| Eq Word | |||||
| Ord Word | |||||
| AEq Word | |||||
| Unbox Word | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| Lift Word | |||||
| Vector Vector Word | |||||
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Word -> ST s (Vector Word) basicUnsafeThaw :: Vector Word -> ST s (Mutable Vector s Word) basicLength :: Vector Word -> Int basicUnsafeSlice :: Int -> Int -> Vector Word -> Vector Word basicUnsafeIndexM :: Vector Word -> Int -> Box Word basicUnsafeCopy :: Mutable Vector s Word -> Vector Word -> ST s () | |||||
| MVector MVector Word | |||||
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 :: Int -> ST s (MVector s Word) basicInitialize :: MVector s Word -> ST s () basicUnsafeReplicate :: Int -> Word -> ST s (MVector s Word) basicUnsafeRead :: MVector s Word -> Int -> ST s Word basicUnsafeWrite :: MVector s Word -> Int -> Word -> ST s () basicClear :: MVector s Word -> ST s () basicSet :: MVector s Word -> Word -> ST s () basicUnsafeCopy :: MVector s Word -> MVector s Word -> ST s () basicUnsafeMove :: MVector s Word -> MVector s Word -> ST s () basicUnsafeGrow :: MVector s Word -> Int -> ST s (MVector s Word) | |||||
| Generic1 (URec Word :: k -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Foldable (UWord :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UWord m -> m foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # toList :: UWord a -> [a] elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # | |||||
| Traversable (UWord :: Type -> Type) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| Functor (URec Word :: Type -> Type) | |||||
| Generic (URec Word p) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Show (URec Word p) | |||||
| Eq (URec Word p) | |||||
| Ord (URec Word p) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype Vector Word | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| data URec Word (p :: k) | |||||
Defined in GHC.Internal.Generics | |||||
| newtype MVector s Word | |||||
Defined in Data.Vector.Unboxed.Base | |||||
| type Rep1 (URec Word :: k -> Type) | |||||
Defined in GHC.Internal.Generics | |||||
| type Rep (URec Word p) | |||||
Defined in GHC.Internal.Generics | |||||
Instances
| NFData Ordering | |||||
Defined in Control.DeepSeq | |||||
| Monoid Ordering | |||||
| Semigroup Ordering | |||||
| Data Ordering | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordering -> c Ordering gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ordering toConstr :: Ordering -> Constr dataTypeOf :: Ordering -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Ordering) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ordering) gmapT :: (forall b. Data b => b -> b) -> Ordering -> Ordering gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r gmapQ :: (forall d. Data d => d -> u) -> Ordering -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordering -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering | |||||
| Bounded Ordering | |||||
| Enum Ordering | |||||
Defined in GHC.Internal.Enum | |||||
| Generic Ordering | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| Read Ordering | |||||
| Show Ordering | |||||
| Eq Ordering | |||||
| Ord Ordering | |||||
Defined in GHC.Classes | |||||
| AEq Ordering | |||||
| type Rep Ordering | |||||
class (RealFrac a, Floating a) => RealFloat a where #
Minimal complete definition
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
Methods
floatRadix :: a -> Integer #
floatDigits :: a -> Int #
floatRange :: a -> (Int, Int) #
decodeFloat :: a -> (Integer, Int) #
encodeFloat :: Integer -> Int -> a #
significand :: a -> a #
scaleFloat :: Int -> a -> a #
isInfinite :: a -> Bool #
isDenormalized :: a -> Bool #
isNegativeZero :: a -> Bool #
Instances
| RealFloat CDouble | |
Defined in GHC.Internal.Foreign.C.Types Methods floatRadix :: CDouble -> Integer # floatDigits :: CDouble -> Int # floatRange :: CDouble -> (Int, Int) # decodeFloat :: CDouble -> (Integer, Int) # encodeFloat :: Integer -> Int -> CDouble # significand :: CDouble -> CDouble # scaleFloat :: Int -> CDouble -> CDouble # isInfinite :: CDouble -> Bool # isDenormalized :: CDouble -> Bool # isNegativeZero :: CDouble -> Bool # atan2 :: CDouble -> CDouble -> CDouble | |
| RealFloat CFloat | |
Defined in GHC.Internal.Foreign.C.Types Methods floatRadix :: CFloat -> Integer # floatDigits :: CFloat -> Int # floatRange :: CFloat -> (Int, Int) # decodeFloat :: CFloat -> (Integer, Int) # encodeFloat :: Integer -> Int -> CFloat # significand :: CFloat -> CFloat # scaleFloat :: Int -> CFloat -> CFloat # isInfinite :: CFloat -> Bool # isDenormalized :: CFloat -> Bool # isNegativeZero :: CFloat -> Bool # atan2 :: CFloat -> CFloat -> CFloat | |
| RealFloat Double | |
Defined in GHC.Internal.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |
| RealFloat Float | |
Defined in GHC.Internal.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |
| RealFloat a => RealFloat (Identity a) | |
Defined in GHC.Internal.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 # 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 (Down a) | |
Defined in GHC.Internal.Data.Ord Methods floatRadix :: Down a -> Integer # floatDigits :: Down a -> Int # floatRange :: Down a -> (Int, Int) # decodeFloat :: Down a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Down a # significand :: Down a -> Down a # scaleFloat :: Int -> Down a -> Down a # isInfinite :: Down a -> Bool # isDenormalized :: Down a -> Bool # isNegativeZero :: Down a -> Bool # atan2 :: Down a -> Down a -> Down a | |
| RealFloat a => RealFloat (Const a b) | |
Defined in GHC.Internal.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 # isInfinite :: Const a b -> Bool # isDenormalized :: Const a b -> Bool # isNegativeZero :: Const a b -> Bool # atan2 :: Const a b -> Const a b -> Const a b | |
| RealFloat (f (g a)) => RealFloat (Compose f g a) | |
Defined in Data.Functor.Compose Methods floatRadix :: Compose f g a -> Integer # floatDigits :: Compose f g a -> Int # floatRange :: Compose f g a -> (Int, Int) # decodeFloat :: Compose f g a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Compose f g a # exponent :: Compose f g a -> Int # significand :: Compose f g a -> Compose f g a # scaleFloat :: Int -> Compose f g a -> Compose f g a # isNaN :: Compose f g a -> Bool # isInfinite :: Compose f g a -> Bool # isDenormalized :: Compose f g a -> Bool # isNegativeZero :: Compose f g a -> Bool # isIEEE :: Compose f g a -> Bool # atan2 :: Compose f g a -> Compose f g a -> Compose f g a | |
realToFrac :: (Real a, Fractional b) => a -> b #
fromIntegral :: (Integral a, Num b) => a -> b #
class (Real a, Enum a) => Integral a where #
Methods
Instances
| Integral CBool | |
| Integral CChar | |
| Integral CInt | |
| Integral CIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CLLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CLong | |
| Integral CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CSChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CSigAtomic | |
Defined in GHC.Internal.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) # | |
| Integral CSize | |
| Integral CUChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CUInt | |
| Integral CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CULLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CULong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CUShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral CWchar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Integral Int16 | |
| Integral Int32 | |
| Integral Int64 | |
| Integral Int8 | |
| Integral Word16 | |
Defined in GHC.Internal.Word | |
| Integral Word32 | |
Defined in GHC.Internal.Word | |
| Integral Word64 | |
Defined in GHC.Internal.Word | |
| Integral Word8 | |
| Integral Integer | |
Defined in GHC.Internal.Real | |
| Integral Natural | |
Defined in GHC.Internal.Real | |
| Integral Int | |
| Integral Word | |
| Integral a => Integral (Identity a) | |
Defined in GHC.Internal.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) # | |
| Integral a => Integral (Const a b) | |
Defined in GHC.Internal.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) # | |
| Integral (f (g a)) => Integral (Compose f g a) | |
Defined in Data.Functor.Compose Methods quot :: Compose f g a -> Compose f g a -> Compose f g a # rem :: Compose f g a -> Compose f g a -> Compose f g a # div :: Compose f g a -> Compose f g a -> Compose f g a # mod :: Compose f g a -> Compose f g a -> Compose f g a # quotRem :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # divMod :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # | |
class (Real a, Fractional a) => RealFrac a where #
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) #
truncate :: Integral b => a -> b #
round :: Integral b => a -> b #
Instances
| MonadIO IO | |||||
Defined in Control.Monad.IO.Class | |||||
| Alternative IO | |||||
| Applicative IO | |||||
| Functor IO | |||||
| Monad IO | |||||
| MonadPlus IO | |||||
| MonadFail IO | |||||
Defined in GHC.Internal.Control.Monad.Fail | |||||
| PrimBase IO | |||||
Defined in Control.Monad.Primitive | |||||
| PrimMonad IO | |||||
Defined in Control.Monad.Primitive Associated Types
| |||||
| Quasi IO | |||||
Defined in Language.Haskell.TH.Syntax Methods qReport :: Bool -> String -> IO () qRecover :: IO a -> IO a -> IO a qLookupName :: Bool -> String -> IO (Maybe Name) qReifyFixity :: Name -> IO (Maybe Fixity) qReifyType :: Name -> IO Type qReifyInstances :: Name -> [Type] -> IO [Dec] qReifyRoles :: Name -> IO [Role] qReifyAnnotations :: Data a => AnnLookup -> IO [a] qReifyModule :: Module -> IO ModuleInfo qReifyConStrictness :: Name -> IO [DecidedStrictness] qGetPackageRoot :: IO FilePath 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] | |||||
| Quote IO | |||||
Defined in Language.Haskell.TH.Syntax | |||||
| a ~ () => HPrintfType (IO a) | |||||
Defined in Text.Printf | |||||
| a ~ () => PrintfType (IO a) | |||||
Defined in Text.Printf | |||||
| Monoid a => Monoid (IO a) | |||||
| Semigroup a => Semigroup (IO a) | |||||
| type PrimState IO | |||||
Defined in Control.Monad.Primitive type PrimState IO = RealWorld | |||||
Instances
| Eq ByteArray | |
| Eq Timeout | |
| Eq Dimension' Source # | |
| Eq DynamicDimension Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods (==) :: DynamicDimension -> DynamicDimension -> Bool # (/=) :: DynamicDimension -> DynamicDimension -> Bool # | |
| Eq InterchangeName Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods (==) :: InterchangeName -> InterchangeName -> Bool # (/=) :: InterchangeName -> InterchangeName -> Bool # | |
| Eq InterchangeNameAuthority Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods (==) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # (/=) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # | |
| Eq Prefix Source # | |
| Eq Metricality Source # | |
Defined in Numeric.Units.Dimensional.Variants | |
| Eq BigNat | |
| Eq ForeignSrcLang | |
| Eq Extension | |
| Eq Void | |
| Eq Constr | |
| Eq ConstrRep | |
| Eq DataRep | |
| Eq Fixity | |
| Eq All | |
| Eq Any | |
| Eq SomeTypeRep | |
| Eq Version | |
| Eq CBool | |
| Eq CChar | |
| Eq CClock | |
| Eq CDouble | |
| Eq CFloat | |
| Eq CInt | |
| Eq CIntMax | |
| Eq CIntPtr | |
| Eq CLLong | |
| Eq CLong | |
| Eq CPtrdiff | |
| Eq CSChar | |
| Eq CSUSeconds | |
| Eq CShort | |
| Eq CSigAtomic | |
| Eq CSize | |
| Eq CTime | |
| Eq CUChar | |
| Eq CUInt | |
| Eq CUIntMax | |
| Eq CUIntPtr | |
| Eq CULLong | |
| Eq CULong | |
| Eq CUSeconds | |
| Eq CUShort | |
| Eq CWchar | |
| Eq Associativity | |
| Eq DecidedStrictness | |
| Eq Fixity | |
| Eq SourceStrictness | |
| Eq SourceUnpackedness | |
| Eq MaskingState | |
| Eq ArrayException | |
| Eq AsyncException | |
| Eq ExitCode | |
| Eq IOErrorType | |
| Eq IOException | |
| Eq Int16 | |
| Eq Int32 | |
| Eq Int64 | |
| Eq Int8 | |
| Eq IoSubSystem | |
| Eq SrcLoc | |
| Eq SomeNat | |
| Eq Word16 | |
| Eq Word32 | |
| Eq Word64 | |
| Eq Word8 | |
| Eq Module | |
| Eq Ordering | |
| Eq TrName | |
| Eq TyCon | |
| Eq AnnLookup | |
| Eq AnnTarget | |
| Eq Bang | |
| Eq BndrVis | |
| Eq Body | |
| Eq Bytes | |
| Eq Callconv | |
| Eq Clause | |
| Eq Con | |
| Eq Dec | |
| Eq DecidedStrictness | |
| Eq DerivClause | |
| Eq DerivStrategy | |
| Eq DocLoc | |
| Eq Exp | |
| Eq FamilyResultSig | |
| Eq Fixity | |
| Eq FixityDirection | |
| Eq Foreign | |
| Eq FunDep | |
| Eq Guard | |
| Eq Info | |
| Eq InjectivityAnn | |
| Eq Inline | |
| Eq Lit | |
| Eq Loc | |
| Eq Match | |
| Eq ModName | |
| Eq Module | |
| Eq ModuleInfo | |
| Eq Name | |
| Eq NameFlavour | |
| Eq NameSpace | |
| Eq NamespaceSpecifier | |
| Eq OccName | |
| Eq Overlap | |
| Eq Pat | |
| Eq PatSynArgs | |
| Eq PatSynDir | |
| Eq Phases | |
| Eq PkgName | |
| Eq Pragma | |
| Eq Range | |
| Eq Role | |
| Eq RuleBndr | |
| Eq RuleMatch | |
| Eq Safety | |
| Eq SourceStrictness | |
| Eq SourceUnpackedness | |
| Eq Specificity | |
| Eq Stmt | |
| Eq TyLit | |
| Eq TySynEqn | |
| Eq Type | |
| Eq TypeFamilyHead | |
| Eq Size | |
| Eq Checks | |
| Eq Integer | |
| Eq Natural | |
| Eq () | |
| Eq Bool | |
| Eq Char | |
| Eq Double | |
| Eq Float | |
| Eq Int | |
| Eq Word | |
| Eq (Chan a) | |
| Eq (MutableByteArray s) | |
| Eq a => Eq (Complex a) | |
| Eq a => Eq (First a) | |
| Eq a => Eq (Last a) | |
| Eq a => Eq (Max a) | |
| Eq a => Eq (Min a) | |
| Eq m => Eq (WrappedMonoid m) | |
| Eq a => Eq (AnyQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods (==) :: AnyQuantity a -> AnyQuantity a -> Bool # (/=) :: AnyQuantity a -> AnyQuantity a -> Bool # | |
| Eq a => Eq (DynQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods (==) :: DynQuantity a -> DynQuantity a -> Bool # (/=) :: DynQuantity a -> DynQuantity a -> Bool # | |
| Eq (NameAtom m) Source # | |
| Eq (UnitName m) Source # | |
| Eq a => Eq (NonEmpty a) | |
| Eq a => Eq (Identity a) | |
| Eq a => Eq (First a) | |
| Eq a => Eq (Last a) | |
| Eq a => Eq (Down a) | |
| Eq a => Eq (Dual a) | |
| Eq a => Eq (Product a) | |
| Eq a => Eq (Sum a) | |
| Eq a => Eq (ZipList a) | |
| Eq p => Eq (Par1 p) | |
| Eq (FunPtr a) | |
| Eq (Ptr a) | |
| Eq a => Eq (Ratio a) | |
| Eq (SNat n) | |
| Eq a => Eq (Array a) | |
| (Eq a, Prim a) => Eq (PrimArray a) | |
| Eq a => Eq (SmallArray a) | |
| Eq flag => Eq (TyVarBndr flag) | |
| Eq a => Eq (Vector a) | |
| (Prim a, Eq a) => Eq (Vector a) | |
| (Storable a, Eq a) => Eq (Vector a) | |
| Eq a => Eq (Vector a) | |
| Eq a => Eq (Maybe a) | |
| Eq a => Eq (Solo a) | |
| Eq a => Eq [a] | |
| Eq (Fixed a) | |
| Eq a => Eq (Arg a b) | |
| (Eq a, Eq b) => Eq (Either a b) | |
| Eq (Proxy s) | |
| Eq (TypeRep a) | |
| Eq (U1 p) | |
| Eq (V1 p) | |
| Eq (MutableArray s a) | |
| Eq (MutablePrimArray s a) | |
| Eq (SmallMutableArray s a) | |
| (Eq1 m, Eq a) => Eq (MaybeT m a) | |
| (Eq a, Eq b) => Eq (a, b) | |
| Eq a => Eq (Dimensional ('DQuantity s) d a) Source # | |
Defined in Numeric.Units.Dimensional.Internal Methods (==) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (/=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # | |
| Eq a => Eq (Const a b) | |
| Eq (f a) => Eq (Ap f a) | |
| Eq (f a) => Eq (Alt f a) | |
| Eq (OrderingI a b) | |
| (Generic1 f, Eq (Rep1 f a)) => Eq (Generically1 f a) | |
| Eq (f p) => Eq (Rec1 f p) | |
| Eq (URec (Ptr ()) p) | |
| Eq (URec Char p) | |
| Eq (URec Double p) | |
| Eq (URec Float p) | |
| Eq (URec Int p) | |
| Eq (URec Word p) | |
| (Eq e, Eq1 m, Eq a) => Eq (ExceptT e m a) | |
| (Eq1 f, Eq a) => Eq (IdentityT f a) | |
| (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) | |
| (Eq w, Eq1 m, Eq a) => Eq (WriterT w m a) | |
| Eq a => Eq (Bundle Id v a) | |
| (Eq a, Eq b, Eq c) => Eq (a, b, c) | |
| (Eq (f a), Eq (g a)) => Eq (Product f g a) | |
| (Eq (f a), Eq (g a)) => Eq (Sum f g a) | |
| (Eq (f p), Eq (g p)) => Eq ((f :*: g) p) | |
| (Eq (f p), Eq (g p)) => Eq ((f :+: g) p) | |
| Eq c => Eq (K1 i c p) | |
| (Eq a, Eq b, Eq c, Eq d) => Eq (a, b, c, d) | |
| Eq (f (g a)) => Eq (Compose f g a) | |
| Eq (f (g p)) => Eq ((f :.: g) p) | |
| Eq (f p) => Eq (M1 i c f p) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e) => Eq (a, b, c, d, e) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f) => Eq (a, b, c, d, e, f) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g) => Eq (a, b, c, d, e, f, g) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h) => Eq (a, b, c, d, e, f, g, h) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i) => Eq (a, b, c, d, e, f, g, h, i) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j) => Eq (a, b, c, d, e, f, g, h, i, j) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k) => Eq (a, b, c, d, e, f, g, h, i, j, k) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l) => Eq (a, b, c, d, e, f, g, h, i, j, k, l) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | |
| (Eq a, Eq b, Eq c, Eq d, Eq e, Eq f, Eq g, Eq h, Eq i, Eq j, Eq k, Eq l, Eq m, Eq n, Eq o) => Eq (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | |
Instances
| Ord ByteArray | |
| Ord Dimension' Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods compare :: Dimension' -> Dimension' -> Ordering # (<) :: Dimension' -> Dimension' -> Bool # (<=) :: Dimension' -> Dimension' -> Bool # (>) :: Dimension' -> Dimension' -> Bool # (>=) :: Dimension' -> Dimension' -> Bool # max :: Dimension' -> Dimension' -> Dimension' # min :: Dimension' -> Dimension' -> Dimension' # | |
| Ord DynamicDimension Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods compare :: DynamicDimension -> DynamicDimension -> Ordering # (<) :: DynamicDimension -> DynamicDimension -> Bool # (<=) :: DynamicDimension -> DynamicDimension -> Bool # (>) :: DynamicDimension -> DynamicDimension -> Bool # (>=) :: DynamicDimension -> DynamicDimension -> Bool # max :: DynamicDimension -> DynamicDimension -> DynamicDimension # min :: DynamicDimension -> DynamicDimension -> DynamicDimension # | |
| Ord InterchangeName Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods compare :: InterchangeName -> InterchangeName -> Ordering # (<) :: InterchangeName -> InterchangeName -> Bool # (<=) :: InterchangeName -> InterchangeName -> Bool # (>) :: InterchangeName -> InterchangeName -> Bool # (>=) :: InterchangeName -> InterchangeName -> Bool # max :: InterchangeName -> InterchangeName -> InterchangeName # min :: InterchangeName -> InterchangeName -> InterchangeName # | |
| Ord InterchangeNameAuthority Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods compare :: InterchangeNameAuthority -> InterchangeNameAuthority -> Ordering # (<) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # (<=) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # (>) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # (>=) :: InterchangeNameAuthority -> InterchangeNameAuthority -> Bool # max :: InterchangeNameAuthority -> InterchangeNameAuthority -> InterchangeNameAuthority # min :: InterchangeNameAuthority -> InterchangeNameAuthority -> InterchangeNameAuthority # | |
| Ord Prefix Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.Internal | |
| Ord Metricality Source # | |
Defined in Numeric.Units.Dimensional.Variants Methods compare :: Metricality -> Metricality -> Ordering # (<) :: Metricality -> Metricality -> Bool # (<=) :: Metricality -> Metricality -> Bool # (>) :: Metricality -> Metricality -> Bool # (>=) :: Metricality -> Metricality -> Bool # max :: Metricality -> Metricality -> Metricality # min :: Metricality -> Metricality -> Metricality # | |
| Ord BigNat | |
| Ord Extension | |
| Ord Void | |
| Ord All | |
| Ord Any | |
| Ord SomeTypeRep | |
Defined in GHC.Internal.Data.Typeable.Internal | |
| Ord Version | |
Defined in GHC.Internal.Data.Version | |
| Ord CBool | |
| Ord CChar | |
| Ord CClock | |
| Ord CDouble | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CFloat | |
| Ord CInt | |
| Ord CIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CLLong | |
| Ord CLong | |
| Ord CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CSChar | |
| Ord CSUSeconds | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CShort | |
| Ord CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CSize | |
| Ord CTime | |
| Ord CUChar | |
| Ord CUInt | |
| Ord CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CULLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CULong | |
| Ord CUSeconds | |
| Ord CUShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Ord CWchar | |
| Ord Associativity | |
Defined in GHC.Internal.Generics Methods compare :: Associativity -> Associativity -> Ordering # (<) :: Associativity -> Associativity -> Bool # (<=) :: Associativity -> Associativity -> Bool # (>) :: Associativity -> Associativity -> Bool # (>=) :: Associativity -> Associativity -> Bool # | |
| Ord DecidedStrictness | |
Defined in GHC.Internal.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 Fixity | |
| Ord SourceStrictness | |
Defined in GHC.Internal.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 SourceUnpackedness | |
Defined in GHC.Internal.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 ArrayException | |
Defined in GHC.Internal.IO.Exception Methods compare :: ArrayException -> ArrayException -> Ordering # (<) :: ArrayException -> ArrayException -> Bool # (<=) :: ArrayException -> ArrayException -> Bool # (>) :: ArrayException -> ArrayException -> Bool # (>=) :: ArrayException -> ArrayException -> Bool # | |
| Ord AsyncException | |
Defined in GHC.Internal.IO.Exception Methods compare :: AsyncException -> AsyncException -> Ordering # (<) :: AsyncException -> AsyncException -> Bool # (<=) :: AsyncException -> AsyncException -> Bool # (>) :: AsyncException -> AsyncException -> Bool # (>=) :: AsyncException -> AsyncException -> Bool # | |
| Ord ExitCode | |
Defined in GHC.Internal.IO.Exception | |
| Ord Int16 | |
| Ord Int32 | |
| Ord Int64 | |
| Ord Int8 | |
| Ord SomeNat | |
Defined in GHC.Internal.TypeNats | |
| Ord Word16 | |
| Ord Word32 | |
| Ord Word64 | |
| Ord Word8 | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Ord TyCon | |
| Ord AnnLookup | |
| Ord AnnTarget | |
| Ord Bang | |
| Ord BndrVis | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Body | |
| Ord Bytes | |
| Ord Callconv | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Clause | |
| Ord Con | |
| Ord Dec | |
| Ord DecidedStrictness | |
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 DerivClause | |
Defined in Language.Haskell.TH.Syntax | |
| Ord DerivStrategy | |
Defined in Language.Haskell.TH.Syntax Methods compare :: DerivStrategy -> DerivStrategy -> Ordering # (<) :: DerivStrategy -> DerivStrategy -> Bool # (<=) :: DerivStrategy -> DerivStrategy -> Bool # (>) :: DerivStrategy -> DerivStrategy -> Bool # (>=) :: DerivStrategy -> DerivStrategy -> Bool # | |
| Ord DocLoc | |
| Ord Exp | |
| Ord FamilyResultSig | |
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 Fixity | |
| Ord FixityDirection | |
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 Foreign | |
Defined in Language.Haskell.TH.Syntax | |
| Ord FunDep | |
| Ord Guard | |
| Ord Info | |
| Ord InjectivityAnn | |
Defined in Language.Haskell.TH.Syntax Methods compare :: InjectivityAnn -> InjectivityAnn -> Ordering # (<) :: InjectivityAnn -> InjectivityAnn -> Bool # (<=) :: InjectivityAnn -> InjectivityAnn -> Bool # (>) :: InjectivityAnn -> InjectivityAnn -> Bool # (>=) :: InjectivityAnn -> InjectivityAnn -> Bool # | |
| Ord Inline | |
| Ord Lit | |
| Ord Loc | |
| Ord Match | |
| Ord ModName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Module | |
| Ord ModuleInfo | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Name | |
| Ord NameFlavour | |
Defined in Language.Haskell.TH.Syntax | |
| Ord NameSpace | |
| Ord NamespaceSpecifier | |
Defined in Language.Haskell.TH.Syntax Methods compare :: NamespaceSpecifier -> NamespaceSpecifier -> Ordering # (<) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (<=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (>) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # (>=) :: NamespaceSpecifier -> NamespaceSpecifier -> Bool # max :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier # min :: NamespaceSpecifier -> NamespaceSpecifier -> NamespaceSpecifier # | |
| Ord OccName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Overlap | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pat | |
| Ord PatSynArgs | |
Defined in Language.Haskell.TH.Syntax | |
| Ord PatSynDir | |
| Ord Phases | |
| Ord PkgName | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Pragma | |
| Ord Range | |
| Ord Role | |
| Ord RuleBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Ord RuleMatch | |
| Ord Safety | |
| Ord SourceStrictness | |
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 SourceUnpackedness | |
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 Specificity | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Stmt | |
| Ord TyLit | |
| Ord TySynEqn | |
Defined in Language.Haskell.TH.Syntax | |
| Ord Type | |
| Ord TypeFamilyHead | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TypeFamilyHead -> TypeFamilyHead -> Ordering # (<) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (<=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>) :: TypeFamilyHead -> TypeFamilyHead -> Bool # (>=) :: TypeFamilyHead -> TypeFamilyHead -> Bool # | |
| Ord Integer | |
| Ord Natural | |
| Ord () | |
| Ord Bool | |
| Ord Char | |
| Ord Double | |
| Ord Float | |
| Ord Int | |
| Ord Word | |
| Ord a => Ord (First a) | |
| Ord a => Ord (Last a) | |
| Ord a => Ord (Max a) | |
| Ord a => Ord (Min a) | |
| Ord m => Ord (WrappedMonoid m) | |
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 (NameAtom m) Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.Internal | |
| Ord a => Ord (NonEmpty a) | |
| Ord a => Ord (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity | |
| Ord a => Ord (First a) | |
Defined in GHC.Internal.Data.Monoid | |
| Ord a => Ord (Last a) | |
| Ord a => Ord (Down a) | |
| Ord a => Ord (Dual a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Ord a => Ord (Product a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Ord a => Ord (Sum a) | |
| Ord a => Ord (ZipList a) | |
| Ord p => Ord (Par1 p) | |
| Ord (FunPtr a) | |
Defined in GHC.Internal.Ptr | |
| Ord (Ptr a) | |
| Integral a => Ord (Ratio a) | |
| Ord (SNat n) | |
| Ord a => Ord (Array a) | |
Defined in Data.Primitive.Array | |
| (Ord a, Prim a) => Ord (PrimArray a) | |
Defined in Data.Primitive.PrimArray | |
| Ord a => Ord (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
| Ord flag => Ord (TyVarBndr flag) | |
Defined in Language.Haskell.TH.Syntax Methods compare :: TyVarBndr flag -> TyVarBndr flag -> Ordering # (<) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (<=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>) :: TyVarBndr flag -> TyVarBndr flag -> Bool # (>=) :: TyVarBndr flag -> TyVarBndr flag -> Bool # | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| (Prim a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Primitive | |
| (Storable a, Ord a) => Ord (Vector a) | |
Defined in Data.Vector.Storable | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector.Strict | |
| Ord a => Ord (Maybe a) | |
| Ord a => Ord (Solo a) | |
| Ord a => Ord [a] | |
| Ord (Fixed a) | |
| Ord a => Ord (Arg a b) | |
| (Ord a, Ord b) => Ord (Either a b) | |
Defined in GHC.Internal.Data.Either | |
| Ord (Proxy s) | |
Defined in GHC.Internal.Data.Proxy | |
| Ord (TypeRep a) | |
Defined in GHC.Internal.Data.Typeable.Internal | |
| Ord (U1 p) | |
| Ord (V1 p) | |
| (Ord1 m, Ord a) => Ord (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe | |
| (Ord a, Ord b) => Ord (a, b) | |
| Ord a => Ord (Dimensional ('DQuantity s) d a) Source # | |
Defined in Numeric.Units.Dimensional.Internal Methods compare :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Ordering # (<) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (<=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (>) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # (>=) :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Bool # max :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a # min :: Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a -> Dimensional ('DQuantity s) d a # | |
| Ord a => Ord (Const a b) | |
| Ord (f a) => Ord (Ap f a) | |
| Ord (f a) => Ord (Alt f a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| (Generic1 f, Ord (Rep1 f a)) => Ord (Generically1 f a) | |
Defined in GHC.Internal.Generics 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 (f p) => Ord (Rec1 f p) | |
Defined in GHC.Internal.Generics | |
| Ord (URec (Ptr ()) p) | |
Defined in GHC.Internal.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) | |
Defined in GHC.Internal.Generics | |
| Ord (URec Double p) | |
Defined in GHC.Internal.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 # | |
| Ord (URec Float p) | |
Defined in GHC.Internal.Generics | |
| Ord (URec Int p) | |
Defined in GHC.Internal.Generics | |
| Ord (URec Word p) | |
Defined in GHC.Internal.Generics | |
| (Ord e, Ord1 m, Ord a) => Ord (ExceptT e m a) | |
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 # | |
| (Ord1 f, Ord a) => Ord (IdentityT f a) | |
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 # | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
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 # | |
| (Ord w, Ord1 m, Ord a) => Ord (WriterT w m a) | |
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 # | |
| Ord a => Ord (Bundle Id v a) | |
Defined in Data.Vector.Fusion.Bundle Methods compare :: Bundle Id v a -> Bundle Id v a -> Ordering # (<) :: Bundle Id v a -> Bundle Id v a -> Bool # (<=) :: Bundle Id v a -> Bundle Id v a -> Bool # (>) :: Bundle Id v a -> Bundle Id v a -> Bool # (>=) :: Bundle Id v a -> Bundle Id v a -> Bool # | |
| (Ord a, Ord b, Ord c) => Ord (a, b, c) | |
| (Ord (f a), Ord (g a)) => Ord (Product f g a) | |
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 # | |
| (Ord (f a), Ord (g a)) => Ord (Sum f g a) | |
| (Ord (f p), Ord (g p)) => Ord ((f :*: g) p) | |
Defined in GHC.Internal.Generics | |
| (Ord (f p), Ord (g p)) => Ord ((f :+: g) p) | |
Defined in GHC.Internal.Generics | |
| Ord c => Ord (K1 i c p) | |
Defined in GHC.Internal.Generics | |
| (Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d) | |
Defined in GHC.Classes | |
| Ord (f (g a)) => Ord (Compose f g a) | |
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 # | |
| Ord (f (g p)) => Ord ((f :.: g) p) | |
Defined in GHC.Internal.Generics | |
| Ord (f p) => Ord (M1 i c f p) | |
Defined in GHC.Internal.Generics | |
| (Ord a, Ord b, Ord c, Ord d, Ord e) => Ord (a, b, c, d, e) | |
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) # | |
| (Ord a, Ord b, Ord c, Ord d, Ord e, Ord f) => Ord (a, b, c, d, e, f) | |
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 a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g) => Ord (a, b, c, d, e, f, g) | |
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 a, Ord b, Ord c, Ord d, Ord e, Ord f, Ord g, Ord h) => Ord (a, b, c, d, e, f, g, h) | |
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) | |
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 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) | |
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) | |
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) | |
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) | |
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) | |
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) | |
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) # | |
Methods
enumFromThen :: a -> a -> [a] #
enumFromTo :: a -> a -> [a] #
enumFromThenTo :: a -> a -> a -> [a] #
Instances
| Enum Extension | |
Defined in GHC.LanguageExtensions.Type Methods succ :: Extension -> Extension # pred :: Extension -> Extension # fromEnum :: Extension -> Int # enumFrom :: Extension -> [Extension] # enumFromThen :: Extension -> Extension -> [Extension] # enumFromTo :: Extension -> Extension -> [Extension] # enumFromThenTo :: Extension -> Extension -> Extension -> [Extension] # | |
| Enum CBool | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CClock | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CDouble | |
Defined in GHC.Internal.Foreign.C.Types Methods enumFrom :: CDouble -> [CDouble] # enumFromThen :: CDouble -> CDouble -> [CDouble] # enumFromTo :: CDouble -> CDouble -> [CDouble] # enumFromThenTo :: CDouble -> CDouble -> CDouble -> [CDouble] # | |
| Enum CFloat | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CIntMax | |
Defined in GHC.Internal.Foreign.C.Types Methods enumFrom :: CIntMax -> [CIntMax] # enumFromThen :: CIntMax -> CIntMax -> [CIntMax] # enumFromTo :: CIntMax -> CIntMax -> [CIntMax] # enumFromThenTo :: CIntMax -> CIntMax -> CIntMax -> [CIntMax] # | |
| Enum CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types Methods enumFrom :: CIntPtr -> [CIntPtr] # enumFromThen :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromTo :: CIntPtr -> CIntPtr -> [CIntPtr] # enumFromThenTo :: CIntPtr -> CIntPtr -> CIntPtr -> [CIntPtr] # | |
| Enum CLLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CPtrdiff -> CPtrdiff # pred :: CPtrdiff -> CPtrdiff # enumFrom :: CPtrdiff -> [CPtrdiff] # enumFromThen :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromTo :: CPtrdiff -> CPtrdiff -> [CPtrdiff] # enumFromThenTo :: CPtrdiff -> CPtrdiff -> CPtrdiff -> [CPtrdiff] # | |
| Enum CSChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CSUSeconds | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CSUSeconds -> CSUSeconds # pred :: CSUSeconds -> CSUSeconds # fromEnum :: CSUSeconds -> Int # enumFrom :: CSUSeconds -> [CSUSeconds] # enumFromThen :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromTo :: CSUSeconds -> CSUSeconds -> [CSUSeconds] # enumFromThenTo :: CSUSeconds -> CSUSeconds -> CSUSeconds -> [CSUSeconds] # | |
| Enum CShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CSigAtomic -> CSigAtomic # pred :: CSigAtomic -> CSigAtomic # fromEnum :: CSigAtomic -> Int # enumFrom :: CSigAtomic -> [CSigAtomic] # enumFromThen :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromTo :: CSigAtomic -> CSigAtomic -> [CSigAtomic] # enumFromThenTo :: CSigAtomic -> CSigAtomic -> CSigAtomic -> [CSigAtomic] # | |
| Enum CSize | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CTime | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CUChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CUInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CUIntMax -> CUIntMax # pred :: CUIntMax -> CUIntMax # enumFrom :: CUIntMax -> [CUIntMax] # enumFromThen :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromTo :: CUIntMax -> CUIntMax -> [CUIntMax] # enumFromThenTo :: CUIntMax -> CUIntMax -> CUIntMax -> [CUIntMax] # | |
| Enum CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CUIntPtr -> CUIntPtr # pred :: CUIntPtr -> CUIntPtr # enumFrom :: CUIntPtr -> [CUIntPtr] # enumFromThen :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromTo :: CUIntPtr -> CUIntPtr -> [CUIntPtr] # enumFromThenTo :: CUIntPtr -> CUIntPtr -> CUIntPtr -> [CUIntPtr] # | |
| Enum CULLong | |
Defined in GHC.Internal.Foreign.C.Types Methods enumFrom :: CULLong -> [CULLong] # enumFromThen :: CULLong -> CULLong -> [CULLong] # enumFromTo :: CULLong -> CULLong -> [CULLong] # enumFromThenTo :: CULLong -> CULLong -> CULLong -> [CULLong] # | |
| Enum CULong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum CUSeconds | |
Defined in GHC.Internal.Foreign.C.Types Methods succ :: CUSeconds -> CUSeconds # pred :: CUSeconds -> CUSeconds # fromEnum :: CUSeconds -> Int # enumFrom :: CUSeconds -> [CUSeconds] # enumFromThen :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromTo :: CUSeconds -> CUSeconds -> [CUSeconds] # enumFromThenTo :: CUSeconds -> CUSeconds -> CUSeconds -> [CUSeconds] # | |
| Enum CUShort | |
Defined in GHC.Internal.Foreign.C.Types Methods enumFrom :: CUShort -> [CUShort] # enumFromThen :: CUShort -> CUShort -> [CUShort] # enumFromTo :: CUShort -> CUShort -> [CUShort] # enumFromThenTo :: CUShort -> CUShort -> CUShort -> [CUShort] # | |
| Enum CWchar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Enum Associativity | |
Defined in GHC.Internal.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 DecidedStrictness | |
Defined in GHC.Internal.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 SourceStrictness | |
Defined in GHC.Internal.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 SourceUnpackedness | |
Defined in GHC.Internal.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 Int16 | |
Defined in GHC.Internal.Int | |
| Enum Int32 | |
Defined in GHC.Internal.Int | |
| Enum Int64 | |
Defined in GHC.Internal.Int | |
| Enum Int8 | |
Defined in GHC.Internal.Int | |
| Enum DoCostCentres | |
Defined in GHC.Internal.RTS.Flags Methods succ :: DoCostCentres -> DoCostCentres # pred :: DoCostCentres -> DoCostCentres # toEnum :: Int -> DoCostCentres # fromEnum :: DoCostCentres -> Int # enumFrom :: DoCostCentres -> [DoCostCentres] # enumFromThen :: DoCostCentres -> DoCostCentres -> [DoCostCentres] # enumFromTo :: DoCostCentres -> DoCostCentres -> [DoCostCentres] # enumFromThenTo :: DoCostCentres -> DoCostCentres -> DoCostCentres -> [DoCostCentres] # | |
| Enum DoHeapProfile | |
Defined in GHC.Internal.RTS.Flags Methods succ :: DoHeapProfile -> DoHeapProfile # pred :: DoHeapProfile -> DoHeapProfile # toEnum :: Int -> DoHeapProfile # fromEnum :: DoHeapProfile -> Int # enumFrom :: DoHeapProfile -> [DoHeapProfile] # enumFromThen :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # enumFromTo :: DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # enumFromThenTo :: DoHeapProfile -> DoHeapProfile -> DoHeapProfile -> [DoHeapProfile] # | |
| Enum DoTrace | |
Defined in GHC.Internal.RTS.Flags Methods enumFrom :: DoTrace -> [DoTrace] # enumFromThen :: DoTrace -> DoTrace -> [DoTrace] # enumFromTo :: DoTrace -> DoTrace -> [DoTrace] # enumFromThenTo :: DoTrace -> DoTrace -> DoTrace -> [DoTrace] # | |
| Enum GiveGCStats | |
Defined in GHC.Internal.RTS.Flags Methods succ :: GiveGCStats -> GiveGCStats # pred :: GiveGCStats -> GiveGCStats # toEnum :: Int -> GiveGCStats # fromEnum :: GiveGCStats -> Int # enumFrom :: GiveGCStats -> [GiveGCStats] # enumFromThen :: GiveGCStats -> GiveGCStats -> [GiveGCStats] # enumFromTo :: GiveGCStats -> GiveGCStats -> [GiveGCStats] # enumFromThenTo :: GiveGCStats -> GiveGCStats -> GiveGCStats -> [GiveGCStats] # | |
| Enum IoSubSystem | |
Defined in GHC.Internal.RTS.Flags Methods succ :: IoSubSystem -> IoSubSystem # pred :: IoSubSystem -> IoSubSystem # toEnum :: Int -> IoSubSystem # fromEnum :: IoSubSystem -> Int # enumFrom :: IoSubSystem -> [IoSubSystem] # enumFromThen :: IoSubSystem -> IoSubSystem -> [IoSubSystem] # enumFromTo :: IoSubSystem -> IoSubSystem -> [IoSubSystem] # enumFromThenTo :: IoSubSystem -> IoSubSystem -> IoSubSystem -> [IoSubSystem] # | |
| Enum Word16 | |
Defined in GHC.Internal.Word | |
| Enum Word32 | |
Defined in GHC.Internal.Word | |
| Enum Word64 | |
Defined in GHC.Internal.Word | |
| Enum Word8 | |
Defined in GHC.Internal.Word | |
| Enum Ordering | |
Defined in GHC.Internal.Enum | |
| Enum Integer | |
| Enum Natural | |
Defined in GHC.Internal.Enum Methods enumFrom :: Natural -> [Natural] # enumFromThen :: Natural -> Natural -> [Natural] # enumFromTo :: Natural -> Natural -> [Natural] # enumFromThenTo :: Natural -> Natural -> Natural -> [Natural] # | |
| Enum () | |
Defined in GHC.Internal.Enum | |
| Enum Bool | |
| Enum Char | |
| Enum Double | |
Defined in GHC.Internal.Float | |
| Enum Float | |
Defined in GHC.Internal.Float | |
| Enum Int | |
| Enum Levity | |
Defined in GHC.Internal.Enum | |
| Enum VecCount | |
Defined in GHC.Internal.Enum Methods succ :: VecCount -> VecCount # pred :: VecCount -> VecCount # enumFrom :: VecCount -> [VecCount] # enumFromThen :: VecCount -> VecCount -> [VecCount] # enumFromTo :: VecCount -> VecCount -> [VecCount] # enumFromThenTo :: VecCount -> VecCount -> VecCount -> [VecCount] # | |
| Enum VecElem | |
Defined in GHC.Internal.Enum Methods enumFrom :: VecElem -> [VecElem] # enumFromThen :: VecElem -> VecElem -> [VecElem] # enumFromTo :: VecElem -> VecElem -> [VecElem] # enumFromThenTo :: VecElem -> VecElem -> VecElem -> [VecElem] # | |
| Enum Word | |
| Enum a => Enum (First a) | |
Defined in Data.Semigroup Methods 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) | |
Defined in Data.Semigroup | |
| Enum a => Enum (Max a) | |
Defined in Data.Semigroup | |
| Enum a => Enum (Min a) | |
Defined in Data.Semigroup | |
| Enum a => Enum (WrappedMonoid a) | |
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) | |
Defined in GHC.Internal.Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> 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, Bounded a, Eq a) => Enum (Down a) | |
Defined in GHC.Internal.Data.Ord | |
| Integral a => Enum (Ratio a) | |
Defined in GHC.Internal.Real Methods 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 (Solo a) | |
Defined in GHC.Internal.Enum | |
| Enum (Fixed a) | |
Defined in Data.Fixed Methods enumFrom :: Fixed a -> [Fixed a] # enumFromThen :: Fixed a -> Fixed a -> [Fixed a] # enumFromTo :: Fixed a -> Fixed a -> [Fixed a] # enumFromThenTo :: Fixed a -> Fixed a -> Fixed a -> [Fixed a] # | |
| Enum (Proxy s) | |
Defined in GHC.Internal.Data.Proxy Methods 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] # | |
| Enum a => Enum (Const a b) | |
Defined in GHC.Internal.Data.Functor.Const Methods succ :: Const a b -> Const a b # pred :: Const a b -> 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) | |
Defined in GHC.Internal.Data.Monoid | |
| Enum (f a) => Enum (Alt f a) | |
Defined in GHC.Internal.Data.Semigroup.Internal Methods 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] # | |
| Enum (f (g a)) => Enum (Compose f g a) | |
Defined in Data.Functor.Compose Methods succ :: Compose f g a -> Compose f g a # pred :: Compose f g a -> Compose f g a # toEnum :: Int -> Compose f g a # fromEnum :: Compose f g a -> Int # enumFrom :: Compose f g a -> [Compose f g a] # enumFromThen :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromTo :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromThenTo :: Compose f g a -> Compose f g a -> Compose f g a -> [Compose f g a] # | |
class Functor (f :: Type -> Type) where #
Minimal complete definition
Instances
| Functor Complex | |
Defined in Data.Complex | |
| Functor First | |
Defined in Data.Semigroup | |
| Functor Last | |
Defined in Data.Semigroup | |
| Functor Max | |
Defined in Data.Semigroup | |
| Functor Min | |
Defined in Data.Semigroup | |
| Functor ArgDescr | |
Defined in System.Console.GetOpt | |
| Functor ArgOrder | |
Defined in System.Console.GetOpt | |
| Functor OptDescr | |
Defined in System.Console.GetOpt | |
| Functor NonEmpty | |
Defined in GHC.Internal.Base | |
| Functor Identity | |
Defined in GHC.Internal.Data.Functor.Identity | |
| Functor First | |
Defined in GHC.Internal.Data.Monoid | |
| Functor Last | |
Defined in GHC.Internal.Data.Monoid | |
| Functor Down | |
Defined in GHC.Internal.Data.Ord | |
| Functor Dual | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Functor Product | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Functor Sum | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Functor ZipList | |
Defined in GHC.Internal.Functor.ZipList | |
| Functor Par1 | |
Defined in GHC.Internal.Generics | |
| Functor P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| Functor ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| Functor IO | |
| Functor Array | |
Defined in Data.Primitive.Array | |
| Functor SmallArray | |
Defined in Data.Primitive.SmallArray | |
| Functor Q | |
Defined in Language.Haskell.TH.Syntax | |
| Functor TyVarBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Functor Vector | |
Defined in Data.Vector | |
| Functor Id | |
Defined in Data.Vector.Fusion.Util | |
| Functor Vector | |
Defined in Data.Vector.Strict | |
| Functor Box | |
Defined in Data.Stream.Monadic | |
| Functor Maybe | |
| Functor Solo | |
Defined in GHC.Internal.Base | |
| Functor [] | |
Defined in GHC.Internal.Base | |
| Monad m => Functor (WrappedMonad m) | |
Defined in Control.Applicative | |
| Functor (Arg a) | |
Defined in Data.Semigroup | |
| Arrow a => Functor (ArrowMonad a) | |
Defined in GHC.Internal.Control.Arrow | |
| Functor (Either a) | |
| Functor (Proxy :: Type -> Type) | |
Defined in GHC.Internal.Data.Proxy | |
| Functor (U1 :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| Functor (V1 :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| Functor (ST s) | |
Defined in GHC.Internal.ST | |
| Functor m => Functor (MaybeT m) | |
Defined in Control.Monad.Trans.Maybe | |
| Functor (Step s) | |
Defined in Data.Stream.Monadic | |
| Monad m => Functor (Stream m) | |
Defined in Data.Stream.Monadic | |
| Functor ((,) a) | |
Defined in GHC.Internal.Base | |
| Arrow a => Functor (WrappedArrow a b) | |
Defined in Control.Applicative | |
| KnownVariant v => Functor (Dimensional v d) Source # | A Note that this instance is dubious, because it allows you to break the dimensional abstraction. See Note that, while this instance overlaps with that given for Note that this is an orphan instance. |
Defined in Numeric.Units.Dimensional.Functor Methods fmap :: (a -> b) -> Dimensional v d a -> Dimensional v d b # (<$) :: a -> Dimensional v d b -> Dimensional v d a # | |
| Functor (SQuantity s DOne) Source # | |
| Functor m => Functor (Kleisli m a) | |
Defined in GHC.Internal.Control.Arrow | |
| Functor (Const m :: Type -> Type) | |
Defined in GHC.Internal.Data.Functor.Const | |
| Functor f => Functor (Ap f) | |
Defined in GHC.Internal.Data.Monoid | |
| Functor f => Functor (Alt f) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| (Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f) | |
Defined in GHC.Internal.Generics | |
| Functor f => Functor (Rec1 f) | |
Defined in GHC.Internal.Generics | |
| Functor (URec (Ptr ()) :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| Functor (URec Char :: Type -> Type) | |
| Functor (URec Double :: Type -> Type) | |
| Functor (URec Float :: Type -> Type) | |
| Functor (URec Int :: Type -> Type) | |
| Functor (URec Word :: Type -> Type) | |
| Functor m => Functor (AccumT w m) | |
Defined in Control.Monad.Trans.Accum | |
| Functor m => Functor (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| Functor m => Functor (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| Functor m => Functor (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| Functor m => Functor (SelectT r m) | |
Defined in Control.Monad.Trans.Select | |
| Functor m => Functor (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| Functor m => Functor (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| Functor m => Functor (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.CPS | |
| Functor m => Functor (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| Functor m => Functor (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| Monad m => Functor (Bundle m v) | |
Defined in Data.Vector.Fusion.Bundle.Monadic | |
| Functor ((,,) a b) | |
Defined in GHC.Internal.Base | |
| (Functor f, Functor g) => Functor (Product f g) | |
Defined in Data.Functor.Product | |
| (Functor f, Functor g) => Functor (Sum f g) | |
Defined in Data.Functor.Sum | |
| (Functor f, Functor g) => Functor (f :*: g) | |
Defined in GHC.Internal.Generics | |
| (Functor f, Functor g) => Functor (f :+: g) | |
Defined in GHC.Internal.Generics | |
| Functor (K1 i c :: Type -> Type) | |
Defined in GHC.Internal.Generics | |
| Functor (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
| Functor ((,,,) a b c) | |
Defined in GHC.Internal.Base | |
| Functor ((->) r) | |
Defined in GHC.Internal.Base | |
| (Functor f, Functor g) => Functor (Compose f g) | |
Defined in Data.Functor.Compose | |
| (Functor f, Functor g) => Functor (f :.: g) | |
Defined in GHC.Internal.Generics | |
| Functor f => Functor (M1 i c f) | |
Defined in GHC.Internal.Generics | |
| Functor m => Functor (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.CPS | |
| Functor m => Functor (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
| Functor m => Functor (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict | |
| Functor ((,,,,) a b c d) | |
Defined in GHC.Internal.Base | |
| Functor ((,,,,,) a b c d e) | |
Defined in GHC.Internal.Base | |
| Functor ((,,,,,,) a b c d e f) | |
Defined in GHC.Internal.Base | |
class Foldable (t :: Type -> Type) where #
Methods
foldMap :: Monoid m => (a -> m) -> t a -> m #
foldr :: (a -> b -> b) -> b -> t a -> b #
foldl :: (b -> a -> b) -> b -> t a -> b #
foldl' :: (b -> a -> b) -> b -> t a -> b #
foldr1 :: (a -> a -> a) -> t a -> a #
Instances
| Foldable Complex | |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m foldMap :: Monoid m => (a -> m) -> Complex a -> 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] elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
| Foldable First | |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m foldMap :: Monoid m => (a -> m) -> First a -> 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] elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # | |
| Foldable Last | |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m foldMap :: Monoid m => (a -> m) -> Last a -> 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] elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Max | |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m foldMap :: Monoid m => (a -> m) -> Max a -> 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] elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
| Foldable Min | |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m foldMap :: Monoid m => (a -> m) -> Min a -> 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] elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
| Foldable NonEmpty | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m foldMap :: Monoid m => (a -> m) -> NonEmpty a -> 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] elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Foldable Identity | |
Defined in GHC.Internal.Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m foldMap :: Monoid m => (a -> m) -> Identity a -> 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] elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable First | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => First m -> m foldMap :: Monoid m => (a -> m) -> First a -> 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] elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # | |
| Foldable Last | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Last m -> m foldMap :: Monoid m => (a -> m) -> Last a -> 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] elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Down | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Down m -> m foldMap :: Monoid m => (a -> m) -> Down a -> 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] elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Foldable Dual | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Dual m -> m foldMap :: Monoid m => (a -> m) -> Dual a -> 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] elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Foldable Product | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Product m -> m foldMap :: Monoid m => (a -> m) -> Product a -> 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] elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Foldable Sum | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Sum m -> m foldMap :: Monoid m => (a -> m) -> Sum a -> 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] elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Foldable ZipList | |
Defined in GHC.Internal.Functor.ZipList Methods fold :: Monoid m => ZipList m -> m foldMap :: Monoid m => (a -> m) -> ZipList a -> 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] elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Foldable Par1 | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Par1 m -> m foldMap :: Monoid m => (a -> m) -> Par1 a -> 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] elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m foldMap :: Monoid m => (a -> m) -> Array a -> 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] elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m foldMap :: Monoid m => (a -> m) -> SmallArray a -> 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 # | |
| Foldable TyVarBndr | |
Defined in Language.Haskell.TH.Syntax Methods fold :: Monoid m => TyVarBndr m -> m foldMap :: Monoid m => (a -> m) -> TyVarBndr a -> m # foldMap' :: Monoid m => (a -> m) -> TyVarBndr a -> m foldr :: (a -> b -> b) -> b -> TyVarBndr a -> b # foldr' :: (a -> b -> b) -> b -> TyVarBndr a -> b foldl :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldl' :: (b -> a -> b) -> b -> TyVarBndr a -> b # foldr1 :: (a -> a -> a) -> TyVarBndr a -> a # foldl1 :: (a -> a -> a) -> TyVarBndr a -> a # toList :: TyVarBndr a -> [a] length :: TyVarBndr a -> Int # elem :: Eq a => a -> TyVarBndr a -> Bool # maximum :: Ord a => TyVarBndr a -> a # minimum :: Ord a => TyVarBndr a -> a # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m foldMap :: Monoid m => (a -> m) -> Vector a -> 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] elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # | |
| Foldable Vector | |
Defined in Data.Vector.Strict Methods fold :: Monoid m => Vector m -> m foldMap :: Monoid m => (a -> m) -> Vector a -> 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] elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # | |
| Foldable Maybe | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Maybe m -> m foldMap :: Monoid m => (a -> m) -> Maybe a -> 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 # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # | |
| Foldable Solo | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Solo m -> m foldMap :: Monoid m => (a -> m) -> Solo a -> m # foldMap' :: Monoid m => (a -> m) -> Solo a -> m foldr :: (a -> b -> b) -> b -> Solo a -> b # foldr' :: (a -> b -> b) -> b -> Solo a -> b foldl :: (b -> a -> b) -> b -> Solo a -> b # foldl' :: (b -> a -> b) -> b -> Solo a -> b # foldr1 :: (a -> a -> a) -> Solo a -> a # foldl1 :: (a -> a -> a) -> Solo a -> a # toList :: Solo a -> [a] elem :: Eq a => a -> Solo a -> Bool # maximum :: Ord a => Solo a -> a # | |
| Foldable [] | |
Defined in GHC.Internal.Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> [a] -> 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] elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
| Foldable (Arg a) | |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> 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] elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
| Foldable (Array i) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Array i m -> m foldMap :: Monoid m => (a -> m) -> Array i a -> 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] elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
| Foldable (Either a) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Either a m -> m foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> 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 # 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 # | |
| Foldable (Proxy :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Proxy m -> m foldMap :: Monoid m => (a -> m) -> Proxy a -> 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] elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # | |
| Foldable (U1 :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> U1 a -> 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] elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
| Foldable (UAddr :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UAddr m -> m foldMap :: Monoid m => (a -> m) -> UAddr a -> m # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m foldr :: (a -> b -> b) -> b -> UAddr a -> b # foldr' :: (a -> b -> b) -> b -> UAddr a -> b foldl :: (b -> a -> b) -> b -> UAddr a -> b # foldl' :: (b -> a -> b) -> b -> UAddr a -> b # foldr1 :: (a -> a -> a) -> UAddr a -> a # foldl1 :: (a -> a -> a) -> UAddr a -> a # toList :: UAddr a -> [a] elem :: Eq a => a -> UAddr a -> Bool # maximum :: Ord a => UAddr a -> a # | |
| Foldable (UChar :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UChar m -> m foldMap :: Monoid m => (a -> m) -> UChar a -> m # foldMap' :: Monoid m => (a -> m) -> UChar a -> m foldr :: (a -> b -> b) -> b -> UChar a -> b # foldr' :: (a -> b -> b) -> b -> UChar a -> b foldl :: (b -> a -> b) -> b -> UChar a -> b # foldl' :: (b -> a -> b) -> b -> UChar a -> b # foldr1 :: (a -> a -> a) -> UChar a -> a # foldl1 :: (a -> a -> a) -> UChar a -> a # toList :: UChar a -> [a] elem :: Eq a => a -> UChar a -> Bool # maximum :: Ord a => UChar a -> a # | |
| Foldable (UDouble :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UDouble m -> m foldMap :: Monoid m => (a -> m) -> UDouble a -> m # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m foldr :: (a -> b -> b) -> b -> UDouble a -> b # foldr' :: (a -> b -> b) -> b -> UDouble a -> b foldl :: (b -> a -> b) -> b -> UDouble a -> b # foldl' :: (b -> a -> b) -> b -> UDouble a -> b # foldr1 :: (a -> a -> a) -> UDouble a -> a # foldl1 :: (a -> a -> a) -> UDouble a -> a # toList :: UDouble a -> [a] elem :: Eq a => a -> UDouble a -> Bool # maximum :: Ord a => UDouble a -> a # minimum :: Ord a => UDouble a -> a # | |
| Foldable (UFloat :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UFloat m -> m foldMap :: Monoid m => (a -> m) -> UFloat a -> m # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m foldr :: (a -> b -> b) -> b -> UFloat a -> b # foldr' :: (a -> b -> b) -> b -> UFloat a -> b foldl :: (b -> a -> b) -> b -> UFloat a -> b # foldl' :: (b -> a -> b) -> b -> UFloat a -> b # foldr1 :: (a -> a -> a) -> UFloat a -> a # foldl1 :: (a -> a -> a) -> UFloat a -> a # toList :: UFloat a -> [a] elem :: Eq a => a -> UFloat a -> Bool # maximum :: Ord a => UFloat a -> a # | |
| Foldable (UInt :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UInt m -> m foldMap :: Monoid m => (a -> m) -> UInt a -> m # foldMap' :: Monoid m => (a -> m) -> UInt a -> m foldr :: (a -> b -> b) -> b -> UInt a -> b # foldr' :: (a -> b -> b) -> b -> UInt a -> b foldl :: (b -> a -> b) -> b -> UInt a -> b # foldl' :: (b -> a -> b) -> b -> UInt a -> b # foldr1 :: (a -> a -> a) -> UInt a -> a # foldl1 :: (a -> a -> a) -> UInt a -> a # toList :: UInt a -> [a] elem :: Eq a => a -> UInt a -> Bool # maximum :: Ord a => UInt a -> a # | |
| Foldable (UWord :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => UWord m -> m foldMap :: Monoid m => (a -> m) -> UWord a -> m # foldMap' :: Monoid m => (a -> m) -> UWord a -> m foldr :: (a -> b -> b) -> b -> UWord a -> b # foldr' :: (a -> b -> b) -> b -> UWord a -> b foldl :: (b -> a -> b) -> b -> UWord a -> b # foldl' :: (b -> a -> b) -> b -> UWord a -> b # foldr1 :: (a -> a -> a) -> UWord a -> a # foldl1 :: (a -> a -> a) -> UWord a -> a # toList :: UWord a -> [a] elem :: Eq a => a -> UWord a -> Bool # maximum :: Ord a => UWord a -> a # | |
| Foldable (V1 :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods foldMap :: Monoid m => (a -> m) -> V1 a -> 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] elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
| Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe Methods fold :: Monoid m => MaybeT f m -> m foldMap :: Monoid m => (a -> m) -> MaybeT f a -> 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] elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
| Foldable ((,) a) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => (a, m) -> m foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> 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] elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
| Foldable (Const m :: Type -> Type) | |
Defined in GHC.Internal.Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 foldMap :: Monoid m0 => (a -> m0) -> Const m a -> 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] elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
| Foldable f => Foldable (Ap f) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Ap f m -> m foldMap :: Monoid m => (a -> m) -> Ap f a -> 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] elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
| Foldable f => Foldable (Alt f) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Alt f m -> m foldMap :: Monoid m => (a -> m) -> Alt f a -> 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] elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # | |
| Foldable f => Foldable (Rec1 f) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m foldMap :: Monoid m => (a -> m) -> Rec1 f a -> 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] elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # | |
| Foldable f => Foldable (ExceptT e f) | |
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 # 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 # | |
| Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity Methods fold :: Monoid m => IdentityT f m -> m foldMap :: Monoid m => (a -> m) -> IdentityT f a -> 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 # | |
| Foldable f => Foldable (WriterT w f) | |
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 # 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 # | |
| Foldable f => Foldable (WriterT w f) | |
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 # 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 # | |
| (Foldable f, Foldable g) => Foldable (Product f g) | |
Defined in Data.Functor.Product Methods fold :: Monoid m => Product f g m -> m foldMap :: Monoid m => (a -> m) -> Product f g a -> 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 # | |
| (Foldable f, Foldable g) => Foldable (Sum f g) | |
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m foldMap :: Monoid m => (a -> m) -> Sum f g a -> 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] 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 # | |
| (Foldable f, Foldable g) => Foldable (f :*: g) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> 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] 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 # | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> 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] 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 # | |
| Foldable (K1 i c :: Type -> Type) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => K1 i c m -> m foldMap :: Monoid m => (a -> m) -> K1 i c a -> 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] elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m foldMap :: Monoid m => (a -> m) -> Compose f g a -> 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 # | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> 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] 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 # | |
| Foldable f => Foldable (M1 i c f) | |
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m foldMap :: Monoid m => (a -> m) -> M1 i c f a -> 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] 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 # | |
Minimal complete definition
(<>) | sconcat
Instances
| Semigroup ByteArray | |
| Semigroup Dimension' Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods (<>) :: Dimension' -> Dimension' -> Dimension' # sconcat :: NonEmpty Dimension' -> Dimension' stimes :: Integral b => b -> Dimension' -> Dimension' | |
| Semigroup AnyUnit Source # | |
| Semigroup ExactPi | The multiplicative semigroup over |
| Semigroup Void | |
| Semigroup All | |
| Semigroup Any | |
| Semigroup ExceptionContext | |
| Semigroup Ordering | |
| Semigroup () | |
| Semigroup (FromMaybe b) | |
| Semigroup a => Semigroup (JoinWith a) | |
| Semigroup (NonEmptyDList a) | |
| Semigroup (Comparison a) | |
| Semigroup (Equivalence a) | |
| Semigroup (Predicate a) | |
| Semigroup (First a) | |
| Semigroup (Last a) | |
| Ord a => Semigroup (Max a) | |
| Ord a => Semigroup (Min a) | |
| Monoid m => Semigroup (WrappedMonoid m) | |
| Num a => Semigroup (AnyQuantity a) Source # |
|
Defined in Numeric.Units.Dimensional.Dynamic Methods (<>) :: AnyQuantity a -> AnyQuantity a -> AnyQuantity a # sconcat :: NonEmpty (AnyQuantity a) -> AnyQuantity a stimes :: Integral b => b -> AnyQuantity a -> AnyQuantity a | |
| Num a => Semigroup (DynQuantity a) Source # |
|
Defined in Numeric.Units.Dimensional.Dynamic Methods (<>) :: DynQuantity a -> DynQuantity a -> DynQuantity a # sconcat :: NonEmpty (DynQuantity a) -> DynQuantity a stimes :: Integral b => b -> DynQuantity a -> DynQuantity a | |
| Semigroup (NonEmpty a) | |
| Semigroup a => Semigroup (Identity a) | |
| Semigroup (First a) | |
| Semigroup (Last a) | |
| Semigroup a => Semigroup (Down a) | |
| Semigroup a => Semigroup (Dual a) | |
| Semigroup (Endo a) | |
| Num a => Semigroup (Product a) | |
| Num a => Semigroup (Sum a) | |
| (Generic a, Semigroup (Rep a ())) => Semigroup (Generically a) | |
| Semigroup p => Semigroup (Par1 p) | |
| Semigroup a => Semigroup (IO a) | |
| Semigroup (Array a) | |
| Semigroup (PrimArray a) | |
| Semigroup (SmallArray a) | |
| Semigroup a => Semigroup (Q a) | |
| Semigroup (Vector a) | |
| Prim a => Semigroup (Vector a) | |
| Storable a => Semigroup (Vector a) | |
| Semigroup (Vector a) | |
| Semigroup a => Semigroup (Maybe a) | |
| Semigroup a => Semigroup (Solo a) | |
| Semigroup [a] | |
| Semigroup a => Semigroup (Op a b) | |
| Semigroup (Either a b) | |
| Semigroup (Proxy s) | |
| Semigroup (U1 p) | |
| Semigroup (V1 p) | |
| Semigroup a => Semigroup (ST s a) | |
| (Semigroup a, Semigroup b) => Semigroup (a, b) | |
| Semigroup b => Semigroup (a -> b) | |
| Num a => Semigroup (SQuantity s d a) Source # |
|
| Semigroup a => Semigroup (Const a b) | |
| (Applicative f, Semigroup a) => Semigroup (Ap f a) | |
| Alternative f => Semigroup (Alt f a) | |
| Semigroup (f p) => Semigroup (Rec1 f p) | |
| (Semigroup a, Semigroup b, Semigroup c) => Semigroup (a, b, c) | |
| (Semigroup (f a), Semigroup (g a)) => Semigroup (Product f g a) | |
| (Semigroup (f p), Semigroup (g p)) => Semigroup ((f :*: g) p) | |
| Semigroup c => Semigroup (K1 i c p) | |
| (Semigroup a, Semigroup b, Semigroup c, Semigroup d) => Semigroup (a, b, c, d) | |
| Semigroup (f (g a)) => Semigroup (Compose f g a) | |
| Semigroup (f (g p)) => Semigroup ((f :.: g) p) | |
| Semigroup (f p) => Semigroup (M1 i c f p) | |
| (Semigroup a, Semigroup b, Semigroup c, Semigroup d, Semigroup e) => Semigroup (a, b, c, d, e) | |
class Semigroup a => Monoid a where #
Instances
| Monoid ByteArray | |
| Monoid Dimension' Source # | The monoid of dimensions under multiplication. |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods mempty :: Dimension' # mappend :: Dimension' -> Dimension' -> Dimension' # mconcat :: [Dimension'] -> Dimension' # | |
| Monoid AnyUnit Source # | |
| Monoid ExactPi | The multiplicative monoid over |
| Monoid All | |
| Monoid Any | |
| Monoid ExceptionContext | |
| Monoid Ordering | |
| Monoid () | |
| Monoid (Comparison a) | |
| Monoid (Equivalence a) | |
| Monoid (Predicate a) | |
| (Ord a, Bounded a) => Monoid (Max a) | |
| (Ord a, Bounded a) => Monoid (Min a) | |
| Monoid m => Monoid (WrappedMonoid m) | |
| Num a => Monoid (AnyQuantity a) Source # |
|
Defined in Numeric.Units.Dimensional.Dynamic Methods mempty :: AnyQuantity a # mappend :: AnyQuantity a -> AnyQuantity a -> AnyQuantity a # mconcat :: [AnyQuantity a] -> AnyQuantity a # | |
| Num a => Monoid (DynQuantity a) Source # |
|
Defined in Numeric.Units.Dimensional.Dynamic Methods mempty :: DynQuantity a # mappend :: DynQuantity a -> DynQuantity a -> DynQuantity a # mconcat :: [DynQuantity a] -> DynQuantity a # | |
| Monoid a => Monoid (Identity a) | |
| Monoid (First a) | |
| Monoid (Last a) | |
| Monoid a => Monoid (Down a) | |
| Monoid a => Monoid (Dual a) | |
| Monoid (Endo a) | |
| Num a => Monoid (Product a) | |
| Num a => Monoid (Sum a) | |
| (Generic a, Monoid (Rep a ())) => Monoid (Generically a) | |
| Monoid p => Monoid (Par1 p) | |
| Monoid a => Monoid (IO a) | |
| Monoid (Array a) | |
| Monoid (PrimArray a) | |
| Monoid (SmallArray a) | |
| Monoid a => Monoid (Q a) | |
| Monoid (Vector a) | |
| Prim a => Monoid (Vector a) | |
| Storable a => Monoid (Vector a) | |
| Monoid (Vector a) | |
| Semigroup a => Monoid (Maybe a) | |
| Monoid a => Monoid (Solo a) | |
| Monoid [a] | |
| Monoid a => Monoid (Op a b) | |
| Monoid (Proxy s) | |
| Monoid (U1 p) | |
| Monoid a => Monoid (ST s a) | |
| (Monoid a, Monoid b) => Monoid (a, b) | |
| Monoid b => Monoid (a -> b) | |
| Num a => Monoid (SQuantity s d a) Source # |
|
| Monoid a => Monoid (Const a b) | |
| (Applicative f, Monoid a) => Monoid (Ap f a) | |
| Alternative f => Monoid (Alt f a) | |
| Monoid (f p) => Monoid (Rec1 f p) | |
| (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | |
| (Monoid (f a), Monoid (g a)) => Monoid (Product f g a) | |
| (Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | |
| Monoid c => Monoid (K1 i c p) | |
| (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | |
| Monoid (f (g a)) => Monoid (Compose f g a) | |
| Monoid (f (g p)) => Monoid ((f :.: g) p) | |
| Monoid (f p) => Monoid (M1 i c f p) | |
| (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | |
Instances
| Show ByteArray | |
| Show Timeout | |
| Show Dimension' Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods showsPrec :: Int -> Dimension' -> ShowS # show :: Dimension' -> String # showList :: [Dimension'] -> ShowS # | |
| Show DynamicDimension Source # | |
Defined in Numeric.Units.Dimensional.Dimensions.TermLevel Methods showsPrec :: Int -> DynamicDimension -> ShowS # show :: DynamicDimension -> String # showList :: [DynamicDimension] -> ShowS # | |
| Show AnyUnit Source # | |
| Show InterchangeName Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods showsPrec :: Int -> InterchangeName -> ShowS # show :: InterchangeName -> String # showList :: [InterchangeName] -> ShowS # | |
| Show InterchangeNameAuthority Source # | |
Defined in Numeric.Units.Dimensional.UnitNames.InterchangeNames Methods showsPrec :: Int -> InterchangeNameAuthority -> ShowS # show :: InterchangeNameAuthority -> String # showList :: [InterchangeNameAuthority] -> ShowS # | |
| Show ExactPi | |
| Show ForeignSrcLang | |
| Show Extension | |
| Show Void | |
| Show Constr | |
| Show ConstrRep | |
| Show DataRep | |
| Show DataType | |
| Show Fixity | |
| Show All | |
| Show Any | |
| Show SomeTypeRep | |
| Show Version | |
| Show CBool | |
| Show CChar | |
| Show CClock | |
| Show CDouble | |
| Show CFloat | |
| Show CInt | |
| Show CIntMax | |
| Show CIntPtr | |
| Show CLLong | |
| Show CLong | |
| Show CPtrdiff | |
| Show CSChar | |
| Show CSUSeconds | |
| Show CShort | |
| Show CSigAtomic | |
| Show CSize | |
| Show CTime | |
| Show CUChar | |
| Show CUInt | |
| Show CUIntMax | |
| Show CUIntPtr | |
| Show CULLong | |
| Show CULong | |
| Show CUSeconds | |
| Show CUShort | |
| Show CWchar | |
| Show Associativity | |
| Show DecidedStrictness | |
| Show Fixity | |
| Show SourceStrictness | |
| Show SourceUnpackedness | |
| Show MaskingState | |
| Show AllocationLimitExceeded | |
| Show ArrayException | |
| Show AssertionFailed | |
| Show AsyncException | |
| Show BlockedIndefinitelyOnMVar | |
| Show BlockedIndefinitelyOnSTM | |
| Show CompactionFailed | |
| Show Deadlock | |
| Show ExitCode | |
| Show FixIOException | |
| Show IOErrorType | |
| Show IOException | |
| Show SomeAsyncException | |
| Show Int16 | |
| Show Int32 | |
| Show Int64 | |
| Show Int8 | |
| Show CCFlags | |
| Show ConcFlags | |
| Show DebugFlags | |
| Show DoCostCentres | |
| Show DoHeapProfile | |
| Show DoTrace | |
| Show GCFlags | |
| Show GiveGCStats | |
| Show HpcFlags | |
| Show IoSubSystem | |
| Show MiscFlags | |
| Show ParFlags | |
| Show ProfFlags | |
| Show RTSFlags | |
| Show TickyFlags | |
| Show TraceFlags | |
| Show FractionalExponentBase | |
| Show CallStack | |
| Show SrcLoc | |
| Show SomeNat | |
| Show Word16 | |
| Show Word32 | |
| Show Word64 | |
| Show Word8 | |
| Show KindRep | |
| Show Module | |
| Show Ordering | |
| Show TrName | |
| Show TyCon | |
| Show TypeLitSort | |
| Show AnnLookup | |
| Show AnnTarget | |
| Show Bang | |
| Show BndrVis | |
| Show Body | |
| Show Bytes | |
| Show Callconv | |
| Show Clause | |
| Show Con | |
| Show Dec | |
| Show DecidedStrictness | |
| Show DerivClause | |
| Show DerivStrategy | |
| Show DocLoc | |
| Show Exp | |
| Show FamilyResultSig | |
| Show Fixity | |
| Show FixityDirection | |
| Show Foreign | |
| Show FunDep | |
| Show Guard | |
| Show Info | |
| Show InjectivityAnn | |
| Show Inline | |
| Show Lit | |
| Show Loc | |
| Show Match | |
| Show ModName | |
| Show Module | |
| Show ModuleInfo | |
| Show Name | |
| Show NameFlavour | |
| Show NameSpace | |
| Show NamespaceSpecifier | |
| Show OccName | |
| Show Overlap | |
| Show Pat | |
| Show PatSynArgs | |
| Show PatSynDir | |
| Show Phases | |
| Show PkgName | |
| Show Pragma | |
| Show Range | |
| Show Role | |
| Show RuleBndr | |
| Show RuleMatch | |
| Show Safety | |
| Show SourceStrictness | |
| Show SourceUnpackedness | |
| Show Specificity | |
| Show Stmt | |
| Show TyLit | |
| Show TySynEqn | |
| Show Type | |
| Show TypeFamilyHead | |
| Show Size | |
| Show Integer | |
| Show Natural | |
| Show () | |
| Show Bool | |
| Show Char | |
| Show Double | |
| Show Float | |
| Show Int | |
| Show Levity | |
| Show RuntimeRep | |
| Show VecCount | |
| Show VecElem | |
| Show Word | |
| Show a => Show (Complex a) | |
| Show a => Show (First a) | |
| Show a => Show (Last a) | |
| Show a => Show (Max a) | |
| Show a => Show (Min a) | |
| Show m => Show (WrappedMonoid m) | |
| Show a => Show (AnyQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods showsPrec :: Int -> AnyQuantity a -> ShowS # show :: AnyQuantity a -> String # showList :: [AnyQuantity a] -> ShowS # | |
| Show a => Show (DynQuantity a) Source # | |
Defined in Numeric.Units.Dimensional.Dynamic Methods showsPrec :: Int -> DynQuantity a -> ShowS # show :: DynQuantity a -> String # showList :: [DynQuantity a] -> ShowS # | |
| Show (UnitName m) Source # |
|
| Show a => Show (NonEmpty a) | |
| Show a => Show (Identity a) | |
| Show a => Show (First a) | |
| Show a => Show (Last a) | |
| Show a => Show (Down a) | |
| Show a => Show (Dual a) | |
| Show a => Show (Product a) | |
| Show a => Show (Sum a) | |
| Show a => Show (ZipList a) | |
| Show p => Show (Par1 p) | |
| Show (FunPtr a) | |
| Show (Ptr a) | |
| Show a => Show (Ratio a) | |
| Show (SNat n) | |
| Show a => Show (Array a) | |
| (Show a, Prim a) => Show (PrimArray a) | |
| Show a => Show (SmallArray a) | |
| Show flag => Show (TyVarBndr flag) | |
| Show a => Show (Vector a) | |
| (Show a, Prim a) => Show (Vector a) | |
| (Show a, Storable a) => Show (Vector a) | |
| Show a => Show (Vector a) | |
| Show a => Show (Maybe a) | |
| Show a => Show (Solo a) | |
| Show a => Show [a] | |
| HasResolution a => Show (Fixed a) | |
| (Show a, Show b) => Show (Arg a b) | |
| (Show a, Show b) => Show (Either a b) | |
| Show (Proxy s) | |
| Show (TypeRep a) | |
| Show (U1 p) | |
| Show (V1 p) | |
| Show (ST s a) | |
| (Show1 m, Show a) => Show (MaybeT m a) | |
| (Show a, Show b) => Show (a, b) | |
| (KnownDimension d, KnownExactPi s, Show a, Real a) => Show (SQuantity s d a) Source # | Uses non-breaking spaces between the value and the unit, and within the unit name. |
| Show a => Show (Unit m d a) Source # | Unit names are shown with non-breaking spaces. |
| Show a => Show (Const a b) | |
| Show (f a) => Show (Ap f a) | |
| Show (f a) => Show (Alt f a) | |
| Show (OrderingI a b) | |
| Show (f p) => Show (Rec1 f p) | |
| Show (URec Char p) | |
| Show (URec Double p) | |
| Show (URec Float p) | |
| Show (URec Int p) | |
| Show (URec Word p) | |
| (Show e, Show1 m, Show a) => Show (ExceptT e m a) | |
| (Show1 f, Show a) => Show (IdentityT f a) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| (Show w, Show1 m, Show a) => Show (WriterT w m a) | |
| (Show a, Show b, Show c) => Show (a, b, c) | |
| (Show (f a), Show (g a)) => Show (Product f g a) | |
| (Show (f a), Show (g a)) => Show (Sum f g a) | |
| (Show (f p), Show (g p)) => Show ((f :*: g) p) | |
| (Show (f p), Show (g p)) => Show ((f :+: g) p) | |
| Show c => Show (K1 i c p) | |
| (Show a, Show b, Show c, Show d) => Show (a, b, c, d) | |
| Show (f (g a)) => Show (Compose f g a) | |
| Show (f (g p)) => Show ((f :.: g) p) | |
| Show (f p) => Show (M1 i c f p) | |
| (Show a, Show b, Show c, Show d, Show e) => Show (a, b, c, d, e) | |
| (Show a, Show b, Show c, Show d, Show e, Show f) => Show (a, b, c, d, e, f) | |
| (Show a, Show b, Show c, Show d, Show e, Show f, Show g) => Show (a, b, c, d, e, f, g) | |
| (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) | |
| (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) | |
| (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) | |
| (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) | |
| (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) | |
| (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) | |
| (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) | |
| (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) | |
class Applicative m => Monad (m :: Type -> Type) where #
Minimal complete definition
Instances
| Monad Complex | |
| Monad First | |
| Monad Last | |
| Monad Max | |
| Monad Min | |
| Monad NonEmpty | |
| Monad Identity | |
| Monad First | |
| Monad Last | |
| Monad Down | |
| Monad Dual | |
| Monad Product | |
| Monad Sum | |
| Monad Par1 | |
| Monad P | |
| Monad ReadP | |
| Monad IO | |
| Monad Array | |
| Monad SmallArray | |
| Monad Q | |
| Monad Vector | |
| Monad Id | |
| Monad Vector | |
| Monad Box | |
| Monad Maybe | |
| Monad Solo | |
| Monad [] | |
| Monad m => Monad (WrappedMonad m) | |
| ArrowApply a => Monad (ArrowMonad a) | |
| Monad (Either e) | |
| Monad (Proxy :: Type -> Type) | |
| Monad (U1 :: Type -> Type) | |
| Monad (ST s) | |
| Monad m => Monad (MaybeT m) | |
| Monoid a => Monad ((,) a) | |
| Monad m => Monad (Kleisli m a) | |
| Monad f => Monad (Ap f) | |
| Monad f => Monad (Alt f) | |
| Monad f => Monad (Rec1 f) | |
| (Monoid w, Functor m, Monad m) => Monad (AccumT w m) | |
| Monad m => Monad (ExceptT e m) | |
| Monad m => Monad (IdentityT m) | |
| Monad m => Monad (ReaderT r m) | |
| Monad m => Monad (SelectT r m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (StateT s m) | |
| Monad m => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monoid a, Monoid b) => Monad ((,,) a b) | |
| (Monad f, Monad g) => Monad (Product f g) | |
| (Monad f, Monad g) => Monad (f :*: g) | |
| Monad (ContT r m) | |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | |
| Monad ((->) r) | |
| Monad f => Monad (M1 i c f) | |
| Monad m => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
class Functor f => Applicative (f :: Type -> Type) where #
Instances
| Applicative Complex | |
| Applicative First | |
| Applicative Last | |
| Applicative Max | |
| Applicative Min | |
| Applicative NonEmpty | |
| Applicative Identity | |
| Applicative First | |
| Applicative Last | |
| Applicative Down | |
| Applicative Dual | |
| Applicative Product | |
| Applicative Sum | |
| Applicative ZipList | |
| Applicative Par1 | |
| Applicative P | |
| Applicative ReadP | |
| Applicative IO | |
| Applicative Array | |
| Applicative SmallArray | |
Defined in Data.Primitive.SmallArray | |
| Applicative Q | |
| Applicative Vector | |
| Applicative Id | |
| Applicative Vector | |
| Applicative Box | |
| Applicative Maybe | |
| Applicative Solo | |
| Applicative [] | |
| Monad m => Applicative (WrappedMonad m) | |
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) | |
Defined in GHC.Internal.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 (Either e) | |
| Applicative (Proxy :: Type -> Type) | |
| Applicative (U1 :: Type -> Type) | |
| Applicative (ST s) | |
| (Functor m, Monad m) => Applicative (MaybeT m) | |
| Monoid a => Applicative ((,) a) | |
| Arrow a => Applicative (WrappedArrow a b) | |
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 m => Applicative (Kleisli m a) | |
Defined in GHC.Internal.Control.Arrow | |
| Monoid m => Applicative (Const m :: Type -> Type) | |
| Applicative f => Applicative (Ap f) | |
| Applicative f => Applicative (Alt f) | |
| (Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f) | |
Defined in GHC.Internal.Generics 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 f => Applicative (Rec1 f) | |
| (Monoid w, Functor m, Monad m) => Applicative (AccumT w m) | |
Defined in Control.Monad.Trans.Accum | |
| (Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| Applicative m => Applicative (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| (Functor m, Monad m) => Applicative (SelectT r m) | |
Defined in Control.Monad.Trans.Select | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| (Functor m, Monad m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.CPS | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| (Monoid a, Monoid b) => Applicative ((,,) a b) | |
| (Applicative f, Applicative g) => Applicative (Product f g) | |
Defined in Data.Functor.Product | |
| (Applicative f, Applicative g) => Applicative (f :*: g) | |
| Monoid c => Applicative (K1 i c :: Type -> Type) | |
| Applicative (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
| (Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) | |
Defined in GHC.Internal.Base | |
| Applicative ((->) r) | |
| (Applicative f, Applicative g) => Applicative (Compose f g) | |
Defined in Data.Functor.Compose | |
| (Applicative f, Applicative g) => Applicative (f :.: g) | |
| Applicative f => Applicative (M1 i c f) | |
| (Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.CPS | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict | |
Instances
| Bounded Extension | |
Defined in GHC.LanguageExtensions.Type | |
| Bounded All | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Bounded Any | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Bounded CBool | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CLLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CSChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CSize | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CUChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CUInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CULLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CULong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CUShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded CWchar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Bounded Associativity | |
Defined in GHC.Internal.Generics | |
| Bounded DecidedStrictness | |
Defined in GHC.Internal.Generics | |
| Bounded SourceStrictness | |
Defined in GHC.Internal.Generics | |
| Bounded SourceUnpackedness | |
Defined in GHC.Internal.Generics | |
| Bounded Int16 | |
Defined in GHC.Internal.Int | |
| Bounded Int32 | |
Defined in GHC.Internal.Int | |
| Bounded Int64 | |
Defined in GHC.Internal.Int | |
| Bounded Int8 | |
Defined in GHC.Internal.Int | |
| Bounded Word16 | |
Defined in GHC.Internal.Word | |
| Bounded Word32 | |
Defined in GHC.Internal.Word | |
| Bounded Word64 | |
Defined in GHC.Internal.Word | |
| Bounded Word8 | |
Defined in GHC.Internal.Word | |
| Bounded Ordering | |
| Bounded () | |
Defined in GHC.Internal.Enum | |
| Bounded Bool | |
| Bounded Char | |
| Bounded Int | |
| Bounded Levity | |
Defined in GHC.Internal.Enum | |
| Bounded VecCount | |
Defined in GHC.Internal.Enum | |
| Bounded VecElem | |
Defined in GHC.Internal.Enum | |
| Bounded Word | |
| Bounded a => Bounded (First a) | |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Last a) | |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Max a) | |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Min a) | |
Defined in Data.Semigroup | |
| Bounded m => Bounded (WrappedMonoid m) | |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity | |
| Bounded a => Bounded (Down a) | |
Defined in GHC.Internal.Data.Ord | |
| Bounded a => Bounded (Dual a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Bounded a => Bounded (Product a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Bounded a => Bounded (Sum a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Bounded a => Bounded (Solo a) | |
Defined in GHC.Internal.Enum | |
| Bounded (Proxy t) | |
Defined in GHC.Internal.Data.Proxy | |
| (Bounded a, Bounded b) => Bounded (a, b) | |
Defined in GHC.Internal.Enum | |
| Bounded a => Bounded (SQuantity s d a) Source # | |
| Bounded a => Bounded (Const a b) | |
Defined in GHC.Internal.Data.Functor.Const | |
| (Applicative f, Bounded a) => Bounded (Ap f a) | |
Defined in GHC.Internal.Data.Monoid | |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | |
Defined in GHC.Internal.Enum | |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | |
Defined in GHC.Internal.Enum | |
| Bounded (f (g a)) => Bounded (Compose f g a) | |
Defined in Data.Functor.Compose | |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | |
Defined in GHC.Internal.Enum | |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | |
Defined in GHC.Internal.Enum | |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
| (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) | |
Defined in GHC.Internal.Enum | |
Minimal complete definition
readsPrec | readPrec
Instances
| Read Void | |
Defined in GHC.Internal.Read | |
| Read All | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read Any | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read Version | |
Defined in GHC.Internal.Data.Version | |
| Read CBool | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CClock | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CDouble | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CFloat | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CLLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CPtrdiff | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CSChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CSUSeconds | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CSigAtomic | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CSize | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CTime | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUChar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUInt | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUIntMax | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUIntPtr | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CULLong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CULong | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUSeconds | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CUShort | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read CWchar | |
Defined in GHC.Internal.Foreign.C.Types | |
| Read Associativity | |
Defined in GHC.Internal.Generics | |
| Read DecidedStrictness | |
Defined in GHC.Internal.Generics | |
| Read Fixity | |
Defined in GHC.Internal.Generics | |
| Read SourceStrictness | |
Defined in GHC.Internal.Generics | |
| Read SourceUnpackedness | |
Defined in GHC.Internal.Generics | |
| Read ExitCode | |
Defined in GHC.Internal.IO.Exception | |
| Read Int16 | |
Defined in GHC.Internal.Int | |
| Read Int32 | |
Defined in GHC.Internal.Int | |
| Read Int64 | |
Defined in GHC.Internal.Int | |
| Read Int8 | |
Defined in GHC.Internal.Int | |
| Read Lexeme | |
Defined in GHC.Internal.Read | |
| Read SomeNat | |
Defined in GHC.Internal.TypeNats | |
| Read GeneralCategory | |
Defined in GHC.Internal.Read | |
| Read Word16 | |
Defined in GHC.Internal.Read | |
| Read Word32 | |
Defined in GHC.Internal.Read | |
| Read Word64 | |
Defined in GHC.Internal.Read | |
| Read Word8 | |
Defined in GHC.Internal.Read | |
| Read Ordering | |
| Read Integer | |
| Read Natural | |
Defined in GHC.Internal.Read | |
| Read () | |
Defined in GHC.Internal.Read | |
| Read Bool | |
| Read Char | |
| Read Double | |
| Read Float | |
| Read Int | |
| Read Word | |
| Read a => Read (Complex a) | |
Defined in Data.Complex | |
| Read a => Read (First a) | |
Defined in Data.Semigroup | |
| Read a => Read (Last a) | |
Defined in Data.Semigroup | |
| Read a => Read (Max a) | |
Defined in Data.Semigroup | |
| Read a => Read (Min a) | |
Defined in Data.Semigroup | |
| Read m => Read (WrappedMonoid m) | |
Defined in Data.Semigroup | |
| Read a => Read (NonEmpty a) | |
Defined in GHC.Internal.Read | |
| Read a => Read (Identity a) | |
Defined in GHC.Internal.Data.Functor.Identity | |
| Read a => Read (First a) | |
Defined in GHC.Internal.Data.Monoid | |
| Read a => Read (Last a) | |
Defined in GHC.Internal.Data.Monoid | |
| Read a => Read (Down a) | |
Defined in GHC.Internal.Data.Ord | |
| Read a => Read (Dual a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read a => Read (Product a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read a => Read (Sum a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read a => Read (ZipList a) | |
Defined in GHC.Internal.Functor.ZipList | |
| Read p => Read (Par1 p) | |
Defined in GHC.Internal.Generics | |
| (Integral a, Read a) => Read (Ratio a) | |
Defined in GHC.Internal.Read | |
| Read a => Read (Array a) | |
Defined in Data.Primitive.Array | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray | |
| Read a => Read (Vector a) | |
Defined in Data.Vector | |
| (Read a, Prim a) => Read (Vector a) | |
Defined in Data.Vector.Primitive | |
| (Read a, Storable a) => Read (Vector a) | |
Defined in Data.Vector.Storable | |
| Read a => Read (Vector a) | |
Defined in Data.Vector.Strict | |
| Read a => Read (Maybe a) | |
| Read a => Read (Solo a) | |
Defined in GHC.Internal.Read | |
| Read a => Read [a] | |
Defined in GHC.Internal.Read | |
| HasResolution a => Read (Fixed a) | |
Defined in Data.Fixed | |
| (Read a, Read b) => Read (Arg a b) | |
Defined in Data.Semigroup | |
| (Ix a, Read a, Read b) => Read (Array a b) | |
Defined in GHC.Internal.Read | |
| (Read a, Read b) => Read (Either a b) | |
| Read (Proxy t) | |
Defined in GHC.Internal.Data.Proxy | |
| Read (U1 p) | |
Defined in GHC.Internal.Generics | |
| Read (V1 p) | |
Defined in GHC.Internal.Generics | |
| (Read1 m, Read a) => Read (MaybeT m a) | |
Defined in Control.Monad.Trans.Maybe | |
| (Read a, Read b) => Read (a, b) | |
Defined in GHC.Internal.Read | |
| Read a => Read (Const a b) | |
Defined in GHC.Internal.Data.Functor.Const | |
| Read (f a) => Read (Ap f a) | |
Defined in GHC.Internal.Data.Monoid | |
| Read (f a) => Read (Alt f a) | |
Defined in GHC.Internal.Data.Semigroup.Internal | |
| Read (f p) => Read (Rec1 f p) | |
Defined in GHC.Internal.Generics | |
| (Read e, Read1 m, Read a) => Read (ExceptT e m a) | |
Defined in Control.Monad.Trans.Except | |
| (Read1 f, Read a) => Read (IdentityT f a) | |
Defined in Control.Monad.Trans.Identity | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| (Read a, Read b, Read c) => Read (a, b, c) | |
Defined in GHC.Internal.Read | |
| (Read (f a), Read (g a)) => Read (Product f g a) | |
Defined in Data.Functor.Product | |
| (Read (f a), Read (g a)) => Read (Sum f g a) | |
Defined in Data.Functor.Sum | |
| (Read (f p), Read (g p)) => Read ((f :*: g) p) | |
Defined in GHC.Internal.Generics | |
| (Read (f p), Read (g p)) => Read ((f :+: g) p) | |
Defined in GHC.Internal.Generics | |
| Read c => Read (K1 i c p) | |
Defined in GHC.Internal.Generics | |
| (Read a, Read b, Read c, Read d) => Read (a, b, c, d) | |
Defined in GHC.Internal.Read | |
| Read (f (g a)) => Read (Compose f g a) | |
Defined in Data.Functor.Compose | |
| Read (f (g p)) => Read ((f :.: g) p) | |
Defined in GHC.Internal.Generics | |
| Read (f p) => Read (M1 i c f p) | |
Defined in GHC.Internal.Generics | |
| (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | |
Defined in GHC.Internal.Read | |
| (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | |
Defined in GHC.Internal.Read | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
| (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) | |
Defined in GHC.Internal.Read | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
sequenceA :: Applicative f => t (f a) -> f (t a) #
Instances
| Traversable Complex | |
Defined in Data.Complex | |
| Traversable First | |
Defined in Data.Semigroup | |
| Traversable Last | |
Defined in Data.Semigroup | |
| Traversable Max | |
Defined in Data.Semigroup | |
| Traversable Min | |
Defined in Data.Semigroup | |
| Traversable NonEmpty | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Identity | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable First | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Last | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Down | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Dual | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Product | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Sum | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable ZipList | |
Defined in GHC.Internal.Functor.ZipList | |
| Traversable Par1 | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable Array | |
Defined in Data.Primitive.Array | |
| Traversable SmallArray | |
Defined in Data.Primitive.SmallArray | |
| Traversable TyVarBndr | |
Defined in Language.Haskell.TH.Syntax | |
| Traversable Vector | |
Defined in Data.Vector | |
| Traversable Vector | |
Defined in Data.Vector.Strict | |
| Traversable Maybe | |
| Traversable Solo | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable [] | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (Arg a) | |
Defined in Data.Semigroup | |
| Ix i => Traversable (Array i) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (Either a) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (Proxy :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (U1 :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UAddr :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UChar :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UDouble :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UFloat :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UInt :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (UWord :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (V1 :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe | |
| Traversable ((,) a) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (Const m :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (Ap f) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (Alt f) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (Rec1 f) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except | |
| Traversable f => Traversable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| Traversable f => Traversable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| (Traversable f, Traversable g) => Traversable (Product f g) | |
Defined in Data.Functor.Product | |
| (Traversable f, Traversable g) => Traversable (Sum f g) | |
Defined in Data.Functor.Sum | |
| (Traversable f, Traversable g) => Traversable (f :*: g) | |
Defined in GHC.Internal.Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (f :+: g) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable (K1 i c :: Type -> Type) | |
Defined in GHC.Internal.Data.Traversable | |
| (Traversable f, Traversable g) => Traversable (Compose f g) | |
Defined in Data.Functor.Compose | |
| (Traversable f, Traversable g) => Traversable (f :.: g) | |
Defined in GHC.Internal.Data.Traversable | |
| Traversable f => Traversable (M1 i c f) | |
Defined in GHC.Internal.Data.Traversable | |
errorWithoutStackTrace :: [Char] -> a #
(^^) :: (Fractional a, Integral b) => a -> b -> a #
showString :: String -> ShowS #
appendFile :: FilePath -> String -> IO () #
getContents :: IO String #
Instances
| Bifoldable Either | |||||
| Bifoldable1 Either | |||||
Defined in Data.Bifoldable1 | |||||
| Bifunctor Either | |||||
| Bitraversable Either | |||||
Defined in Data.Bitraversable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) | |||||
| Eq2 Either | |||||
| Ord2 Either | |||||
Defined in Data.Functor.Classes | |||||
| Read2 Either | |||||
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 | |||||
| NFData2 Either | |||||
Defined in Control.DeepSeq | |||||
| Generic1 (Either a :: Type -> Type) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| (Lift a, Lift b) => Lift (Either a b :: Type) | |||||
| Eq a => Eq1 (Either a) | |||||
| Ord a => Ord1 (Either a) | |||||
Defined in Data.Functor.Classes Methods liftCompare :: (a0 -> b -> Ordering) -> Either a a0 -> Either a b -> Ordering | |||||
| Read a => Read1 (Either a) | |||||
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) | |||||
Defined in Data.Functor.Classes | |||||
| NFData a => NFData1 (Either a) | |||||
Defined in Control.DeepSeq | |||||
| Applicative (Either e) | |||||
| Functor (Either a) | |||||
| Monad (Either e) | |||||
| Foldable (Either a) | |||||
Defined in GHC.Internal.Data.Foldable Methods fold :: Monoid m => Either a m -> m foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> 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 # 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 # | |||||
| Traversable (Either a) | |||||
Defined in GHC.Internal.Data.Traversable | |||||
| (NFData a, NFData b) => NFData (Either a b) | |||||
Defined in Control.DeepSeq | |||||
| Semigroup (Either a b) | |||||
| (Data a, Data b) => Data (Either a b) | |||||
Defined in GHC.Internal.Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) toConstr :: Either a b -> Constr dataTypeOf :: Either a b -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) | |||||
| Generic (Either a b) | |||||
Defined in GHC.Internal.Generics Associated Types
| |||||
| (Read a, Read b) => Read (Either a b) | |||||
| (Show a, Show b) => Show (Either a b) | |||||
| (Eq a, Eq b) => Eq (Either a b) | |||||
| (Ord a, Ord b) => Ord (Either a b) | |||||
Defined in GHC.Internal.Data.Either | |||||
| (AEq a, AEq b) => AEq (Either a b) | |||||
| type Rep1 (Either a :: Type -> Type) | |||||
Defined in GHC.Internal.Generics type Rep1 (Either a :: Type -> Type) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" '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) | |||||
Defined in GHC.Internal.Generics type Rep (Either a b) = D1 ('MetaData "Either" "GHC.Internal.Data.Either" "ghc-internal" '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))) | |||||
class Monad m => MonadFail (m :: Type -> Type) where #
Instances
| MonadFail P | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail ReadP | |
Defined in GHC.Internal.Text.ParserCombinators.ReadP | |
| MonadFail IO | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail Array | |
Defined in Data.Primitive.Array | |
| MonadFail SmallArray | |
Defined in Data.Primitive.SmallArray | |
| MonadFail Q | |
Defined in Language.Haskell.TH.Syntax | |
| MonadFail Vector | |
Defined in Data.Vector | |
| MonadFail Vector | |
Defined in Data.Vector.Strict | |
| MonadFail Maybe | |
Defined in GHC.Internal.Control.Monad.Fail | |
| MonadFail [] | |
Defined in GHC.Internal.Control.Monad.Fail | |
| Monad m => MonadFail (MaybeT m) | |
Defined in Control.Monad.Trans.Maybe | |
| MonadFail f => MonadFail (Ap f) | |
Defined in GHC.Internal.Data.Monoid | |
| (Monoid w, MonadFail m) => MonadFail (AccumT w m) | |
Defined in Control.Monad.Trans.Accum | |
| MonadFail m => MonadFail (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| MonadFail m => MonadFail (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| MonadFail m => MonadFail (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| MonadFail m => MonadFail (SelectT r m) | |
Defined in Control.Monad.Trans.Select | |
| MonadFail m => MonadFail (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| MonadFail m => MonadFail (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| MonadFail m => MonadFail (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.CPS | |
| (Monoid w, MonadFail m) => MonadFail (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy | |
| (Monoid w, MonadFail m) => MonadFail (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict | |
| MonadFail m => MonadFail (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
| MonadFail m => MonadFail (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.CPS | |
| (Monoid w, MonadFail m) => MonadFail (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy | |
| (Monoid w, MonadFail m) => MonadFail (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict | |