| Copyright | (C) 2019 QBayLogic B.V. |
|---|---|
| License | BSD2 (see the file LICENSE) |
| Maintainer | QBayLogic B.V <devops@qbaylogic.com> |
| Safe Haskell | Safe |
| Language | Haskell2010 |
| Extensions |
|
Clash.HaskellPrelude
Description
Clash.HaskellPrelude re-exports most of the Haskell Prelude with the exception of the following: (++), (!!), concat, drop, even, foldl, foldl1, foldr, foldr1, head, init, iterate, last, length, map, odd, repeat, replicate, reverse, scanl, scanr, splitAt, tail, take, unzip, unzip3, zip, zip3, zipWith, zipWith3.
Synopsis
- seq :: a -> b -> b
- filter :: (a -> Bool) -> [a] -> [a]
- print :: Show a => a -> IO ()
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- otherwise :: Bool
- ($) :: (a -> b) -> a -> b
- fromIntegral :: (Integral a, Num b) => a -> b
- realToFrac :: (Real a, Fractional b) => a -> b
- class Bounded 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 Eq a where
- class Fractional a => Floating a where
- class Num a => Fractional a where
- (/) :: a -> a -> a
- recip :: a -> a
- fromRational :: Rational -> a
- class (Real a, Enum a) => Integral a where
- class Applicative m => Monad (m :: Type -> Type) where
- class Functor (f :: Type -> Type) where
- class Num a where
- class Eq a => Ord a where
- class Read a where
- class (Num a, Ord a) => Real a where
- toRational :: a -> Rational
- 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
- atan2 :: a -> a -> a
- class (Real a, Fractional a) => RealFrac a where
- class Show a where
- class Functor f => Applicative (f :: Type -> Type) where
- class Foldable (t :: Type -> Type) 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)
- class Semigroup a where
- (<>) :: a -> a -> a
- class Semigroup a => Monoid a where
- data Bool
- data Char
- data Double
- data Float
- data Int
- data Integer
- data Maybe a
- data Ordering
- type Rational = Ratio Integer
- data IO a
- data Word
- data Either a b
- type String = [Char]
- id :: a -> a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- readIO :: Read a => String -> IO a
- readLn :: Read a => IO a
- appendFile :: FilePath -> String -> IO ()
- writeFile :: FilePath -> String -> IO ()
- readFile :: FilePath -> IO String
- interact :: (String -> String) -> IO ()
- getContents :: IO String
- putStrLn :: String -> IO ()
- putStr :: String -> IO ()
- ioError :: IOError -> IO a
- type FilePath = String
- userError :: String -> IOError
- type IOError = IOException
- notElem :: (Foldable t, Eq a) => a -> t a -> Bool
- all :: Foldable t => (a -> Bool) -> t a -> Bool
- any :: Foldable t => (a -> Bool) -> t a -> Bool
- or :: Foldable t => t Bool -> Bool
- and :: Foldable t => t Bool -> Bool
- sequence_ :: (Foldable t, Monad m) => t (m a) -> m ()
- mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
- unwords :: [String] -> String
- words :: String -> [String]
- unlines :: [String] -> String
- lines :: String -> [String]
- read :: Read a => String -> a
- reads :: Read a => ReadS a
- lex :: ReadS String
- readParen :: Bool -> ReadS a -> ReadS a
- type ReadS a = String -> [(a, String)]
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- lcm :: Integral a => a -> a -> a
- gcd :: Integral a => a -> a -> a
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- showParen :: Bool -> ShowS -> ShowS
- showString :: String -> ShowS
- showChar :: Char -> ShowS
- shows :: Show a => a -> ShowS
- type ShowS = String -> String
- lookup :: Eq a => a -> [(a, b)] -> Maybe b
- break :: (a -> Bool) -> [a] -> ([a], [a])
- span :: (a -> Bool) -> [a] -> ([a], [a])
- dropWhile :: (a -> Bool) -> [a] -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- cycle :: [a] -> [a]
- scanr1 :: (a -> a -> a) -> [a] -> [a]
- scanl1 :: (a -> a -> a) -> [a] -> [a]
- maybe :: b -> (a -> b) -> Maybe a -> b
- uncurry :: (a -> b -> c) -> (a, b) -> c
- curry :: ((a, b) -> c) -> a -> b -> c
- subtract :: Num a => a -> a -> a
- asTypeOf :: a -> a -> a
- until :: (a -> Bool) -> (a -> a) -> a -> a
- ($!) :: (a -> b) -> a -> b
- flip :: (a -> b -> c) -> b -> a -> c
- (.) :: (b -> c) -> (a -> b) -> a -> c
- const :: a -> b -> a
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- errorWithoutStackTrace :: [Char] -> a
- error :: HasCallStack => [Char] -> a
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
Documentation
The value of seq a b is bottom if a is bottom, and
otherwise equal to b. In other words, it evaluates the first
argument a to weak head normal form (WHNF). seq is usually
introduced to improve performance by avoiding unneeded laziness.
A note on evaluation order: the expression seq a b does
not guarantee that a will be evaluated before b.
The only guarantee given by seq is that the both a
and b will be evaluated before seq returns a value.
In particular, this means that b may be evaluated before
a. If you need to guarantee a specific order of evaluation,
you must use the function pseq from the "parallel" package.
filter :: (a -> Bool) -> [a] -> [a] #
filter, applied to a predicate and a list, returns the list of
those elements that satisfy the predicate; i.e.,
filter p xs = [ x | x <- xs, p x]
print :: Show a => a -> IO () #
The print function outputs a value of any printable type to the
standard output device.
Printable types are those that are instances of class Show; print
converts values to strings for output using the show operation and
adds a newline.
For example, a program to print the first 20 integers and their powers of 2 could be written as:
main = print ([(n, 2^n) | n <- [0..19]])
($) :: (a -> b) -> a -> b infixr 0 #
Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f . However, $ x)$ has
low, right-associative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xszipWith ($) fs xs
Note that ($) is levity-polymorphic in its result type, so that
foo $ True where foo :: Bool -> Int#
is well-typed
fromIntegral :: (Integral a, Num b) => a -> b #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b #
general coercion to fractional types
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
| Bounded Bool | Since: base-2.1 |
| Bounded Char | Since: base-2.1 |
| Bounded Int | Since: base-2.1 |
| Bounded Int8 | Since: base-2.1 |
| Bounded Int16 | Since: base-2.1 |
| Bounded Int32 | Since: base-2.1 |
| Bounded Int64 | Since: base-2.1 |
| Bounded Ordering | Since: base-2.1 |
| Bounded Word | Since: base-2.1 |
| Bounded Word8 | Since: base-2.1 |
| Bounded Word16 | Since: base-2.1 |
| Bounded Word32 | Since: base-2.1 |
| Bounded Word64 | Since: base-2.1 |
| Bounded VecCount | Since: base-4.10.0.0 |
| Bounded VecElem | Since: base-4.10.0.0 |
| Bounded () | Since: base-2.1 |
| Bounded All | Since: base-2.1 |
| Bounded Any | Since: base-2.1 |
| Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded CChar | |
| Bounded CSChar | |
| Bounded CUChar | |
| Bounded CShort | |
| Bounded CUShort | |
| Bounded CInt | |
| Bounded CUInt | |
| Bounded CLong | |
| Bounded CULong | |
| Bounded CLLong | |
| Bounded CULLong | |
| Bounded CBool | |
| Bounded CPtrdiff | |
| Bounded CSize | |
| Bounded CWchar | |
| Bounded CSigAtomic | |
Defined in Foreign.C.Types | |
| Bounded CIntPtr | |
| Bounded CUIntPtr | |
| Bounded CIntMax | |
| Bounded CUIntMax | |
| Bounded WordPtr | |
| Bounded IntPtr | |
| Bounded GeneralCategory | Since: base-2.1 |
Defined in GHC.Unicode | |
| Bounded GenTextMethods | |
Defined in TextShow.Options | |
| Bounded HDL Source # | |
| Bounded Bit Source # | |
| Class () (Bounded a) | |
Defined in Data.Constraint | |
| a :=> (Bounded (Dict a)) | |
| () :=> (Bounded Bool) | |
| () :=> (Bounded Char) | |
| () :=> (Bounded Int) | |
| () :=> (Bounded Ordering) | |
| () :=> (Bounded Word) | |
| () :=> (Bounded ()) | |
Defined in Data.Constraint | |
| Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| a => Bounded (Dict a) | |
| KnownNat n => Bounded (BitVector n) Source # | |
| KnownNat n => Bounded (Index n) Source # | |
| KnownNat n => Bounded (Unsigned n) Source # | |
| KnownNat n => Bounded (Signed n) Source # | |
| (Bounded a) :=> (Bounded (Identity a)) | |
| (Bounded a) :=> (Bounded (Const a b)) | |
| (Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| (Bounded a, Bounded b) :=> (Bounded (a, b)) | |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
| Coercible a b => Bounded (Coercion a b) | Since: base-4.7.0.0 |
| a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
| Bounded b => Bounded (Tagged s b) | |
| Bounded (rep (int + frac)) => Bounded (Fixed rep int frac) Source # | |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
| a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum from 0 through n-1.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded as well as Enum,
the following should hold:
- The calls
succmaxBoundpredminBound fromEnumandtoEnumshould give a runtime error if the result value is not representable in the result type. For example,toEnum7 ::BoolenumFromandenumFromThenshould be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound
enumFromThen x y = enumFromThenTo x y bound
where
bound | fromEnum y >= fromEnum x = maxBound
| otherwise = minBoundMethods
the successor of a value. For numeric types, succ adds 1.
the predecessor of a value. For numeric types, pred subtracts 1.
Convert from an Int.
Convert to an Int.
It is implementation-dependent what fromEnum returns when
applied to a value that is too large to fit in an Int.
Used in Haskell's translation of [n..] with [n..] = enumFrom n,
a possible implementation being enumFrom n = n : enumFrom (succ n).
For example:
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]
enumFromThen :: a -> a -> [a] #
Used in Haskell's translation of [n,n'..]
with [n,n'..] = enumFromThen n n', a possible implementation being
enumFromThen n n' = n : n' : worker (f x) (f x n'),
worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
For example:
enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]
enumFromTo :: a -> a -> [a] #
Used in Haskell's translation of [n..m] with
[n..m] = enumFromTo n m, a possible implementation being
enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = [].
For example:
enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
enumFromTo 42 1 :: [Integer] = []
enumFromThenTo :: a -> a -> a -> [a] #
Used in Haskell's translation of [n,n'..m] with
[n,n'..m] = enumFromThenTo n n' m, a possible implementation
being enumFromThenTo n n' m = worker (f x) (c x) n m,
x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y and
worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []
For example:
enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
enumFromThenTo 6 8 2 :: [Int] = []
Instances
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
class Fractional a => Floating a where #
Trigonometric and hyperbolic functions and related functions.
The Haskell Report defines no laws for Floating. However, '(+)', '(*)'
and exp are customarily expected to define an exponential field and have
the following properties:
exp (a + b)= @exp a * exp bexp (fromInteger 0)=fromInteger 1
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Instances
class Num a => Fractional a where #
Fractional numbers, supporting real division.
The Haskell Report defines no laws for Fractional. However, '(+)' and
'(*)' are customarily expected to define a division ring and have the
following properties:
recipgives the multiplicative inversex * recip x=recip x * x=fromInteger 1
Note that it isn't customarily expected that a type instance of
Fractional implement a field. However, all instances in base do.
Minimal complete definition
fromRational, (recip | (/))
Methods
fractional division
reciprocal fraction
fromRational :: Rational -> a #
Conversion from a Rational (that is Ratio IntegerfromRational
to a value of type Rational, so such literals have type
(.Fractional a) => a
Instances
class (Real a, Enum a) => Integral a where #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the 'div'/'mod' and 'quot'/'rem' pairs, given
suitable Euclidean functions f and g:
x=y * quot x y + rem x ywithrem x y=fromInteger 0org (rem x y)<g yx=y * div x y + mod x ywithmod x y=fromInteger 0orf (mod x y)<f y
An example of a suitable Euclidean function, for Integer's instance, is
abs.
Methods
quot :: a -> a -> a infixl 7 #
integer division truncated toward zero
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
integer division truncated toward negative infinity
integer modulus, satisfying
(x `div` y)*y + (x `mod` y) == x
conversion to Integer
Instances
class Applicative m => Monad (m :: Type -> Type) where #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following laws:
Furthermore, the Monad and Applicative operations should relate as follows:
The above laws imply:
and that pure and (<*>) satisfy the applicative functor laws.
The instances of Monad for lists, Maybe and IO
defined in the Prelude satisfy these laws.
Minimal complete definition
Methods
(>>=) :: m a -> (a -> m b) -> m b infixl 1 #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
(>>) :: m a -> m b -> m b infixl 1 #
Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.
Inject a value into the monadic type.
Fail with a message. This operation is not part of the
mathematical definition of a monad, but is invoked on pattern-match
failure in a do expression.
As part of the MonadFail proposal (MFP), this function is moved
to its own class MonadFail (see Control.Monad.Fail for more
details). The definition here will be removed in a future
release.
Instances
| Monad [] | Since: base-2.1 |
| Monad Maybe | Since: base-2.1 |
| Monad IO | Since: base-2.1 |
| Monad Par1 | Since: base-4.9.0.0 |
| Monad Q | |
| Monad Rose | |
| Monad Gen | |
| Monad Complex | Since: base-4.9.0.0 |
| Monad Min | Since: base-4.9.0.0 |
| Monad Max | Since: base-4.9.0.0 |
| Monad First | Since: base-4.9.0.0 |
| Monad Last | Since: base-4.9.0.0 |
| Monad Option | Since: base-4.9.0.0 |
| Monad Identity | Since: base-4.8.0.0 |
| Monad STM | Since: base-4.3.0.0 |
| Monad First | Since: base-4.8.0.0 |
| Monad Last | Since: base-4.8.0.0 |
| Monad Dual | Since: base-4.8.0.0 |
| Monad Sum | Since: base-4.8.0.0 |
| Monad Product | Since: base-4.8.0.0 |
| Monad Down | Since: base-4.11.0.0 |
| Monad ReadPrec | Since: base-2.1 |
| Monad ReadP | Since: base-2.1 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| Monad PutM | |
| Monad Get | |
| Monad Put | |
| Monad Tree | |
| Monad Seq | |
| Monad Vector | |
| Monad SmallArray | |
Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b # (>>) :: SmallArray a -> SmallArray b -> SmallArray b # return :: a -> SmallArray a # fail :: String -> SmallArray a # | |
| Monad Array | |
| Monad PprM | |
| Monad Id | |
| Monad Box | |
| Monad P | Since: base-2.1 |
| Monad SimIO Source # | |
| () :=> (Monad ((->) a :: Type -> Type)) | |
Defined in Data.Constraint | |
| () :=> (Monad []) | |
Defined in Data.Constraint | |
| () :=> (Monad IO) | |
| () :=> (Monad (Either a)) | |
| () :=> (Monad Identity) | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
| Monad (ST s) | Since: base-2.1 |
| Representable f => Monad (Co f) | |
| Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0 |
Defined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # return :: a -> WrappedMonad m a # fail :: String -> WrappedMonad m a # | |
| ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # fail :: String -> ArrowMonad a a0 # | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Alternative f => Monad (Cofree f) | |
| Monad (F f) | |
| Functor f => Monad (Free f) | |
| Monad m => Monad (Yoneda m) | |
| Monad (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # return :: a -> ReifiedGetter s a # fail :: String -> ReifiedGetter s a # | |
| Monad (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # return :: a -> ReifiedFold s a # fail :: String -> ReifiedFold s a # | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad (SetM s) | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint Methods cls :: Monad f :- Applicative f # | |
| (Monad m) :=> (Functor (WrappedMonad m)) | |
Defined in Data.Constraint | |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) # | |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| (Applicative f, Monad f) => Monad (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMissing f x a -> (a -> WhenMissing f x b) -> WhenMissing f x b # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # fail :: String -> WhenMissing f x a # | |
| (Functor f, Monad m) => Monad (FreeT f m) | |
| (Alternative f, Monad w) => Monad (CofreeT f w) | |
| (Monad m, Error e) => Monad (ErrorT e m) | |
| Monad (Tagged s) | |
| Monad (Indexed i a) | |
| Monad m => Monad (ReaderT r m) | |
| Monad m => Monad (StateT s m) | |
| Class (Monad f, Alternative f) (MonadPlus f) | |
Defined in Data.Constraint | |
| Monad ((->) r :: Type -> Type) | Since: base-2.1 |
| (Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0 |
| (Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
| Monad (Cokleisli w a) | |
| (Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # fail :: String -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # fail :: String -> WhenMissing f k x a # | |
| Monad f => Monad (M1 i c f) | Since: base-4.9.0.0 |
| (Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # fail :: String -> WhenMatched f k x y a # | |
class Functor (f :: Type -> Type) where #
The Functor class is used for types that can be mapped over.
Instances of Functor should satisfy the following laws:
fmap id == id fmap (f . g) == fmap f . fmap g
The instances of Functor for lists, Maybe and IO
satisfy these laws.
Minimal complete definition
Instances
Basic numeric class.
The Haskell Report defines no laws for Num. However, '(+)' and '(*)' are
customarily expected to define a ring and have the following properties:
- Associativity of (+)
(x + y) + z=x + (y + z)- Commutativity of (+)
x + y=y + xfromInteger 0is the additive identityx + fromInteger 0=xnegategives the additive inversex + negate x=fromInteger 0- Associativity of (*)
(x * y) * z=x * (y * z)fromInteger 1is the multiplicative identityx * fromInteger 1=xandfromInteger 1 * x=x- Distributivity of (*) with respect to (+)
a * (b + c)=(a * b) + (a * c)and(b + c) * a=(b * a) + (c * a)
Note that it isn't customarily expected that a type instance of both Num
and Ord implement an ordered ring. Indeed, in base only Integer and
Rational do.
Methods
Unary negation.
Absolute value.
Sign of a number.
The functions abs and signum should satisfy the law:
abs x * signum x == x
For real numbers, the signum is either -1 (negative), 0 (zero)
or 1 (positive).
fromInteger :: Integer -> a #
Conversion from an Integer.
An integer literal represents the application of the function
fromInteger to the appropriate value of type Integer,
so such literals have type (.Num a) => a
Instances
| Num Int | Since: base-2.1 |
| Num Int8 | Since: base-2.1 |
| Num Int16 | Since: base-2.1 |
| Num Int32 | Since: base-2.1 |
| Num Int64 | Since: base-2.1 |
| Num Integer | Since: base-2.1 |
| Num Natural | Note that Since: base-4.8.0.0 |
| Num Word | Since: base-2.1 |
| Num Word8 | Since: base-2.1 |
| Num Word16 | Since: base-2.1 |
| Num Word32 | Since: base-2.1 |
| Num Word64 | Since: base-2.1 |
| Num CChar | |
| Num CSChar | |
| Num CUChar | |
| Num CShort | |
| Num CUShort | |
| Num CInt | |
| Num CUInt | |
| Num CLong | |
| Num CULong | |
| Num CLLong | |
| Num CULLong | |
| Num CBool | |
| Num CFloat | |
| Num CDouble | |
| Num CPtrdiff | |
| Num CSize | |
| Num CWchar | |
| Num CSigAtomic | |
Defined in Foreign.C.Types Methods (+) :: CSigAtomic -> CSigAtomic -> CSigAtomic # (-) :: CSigAtomic -> CSigAtomic -> CSigAtomic # (*) :: CSigAtomic -> CSigAtomic -> CSigAtomic # negate :: CSigAtomic -> CSigAtomic # abs :: CSigAtomic -> CSigAtomic # signum :: CSigAtomic -> CSigAtomic # fromInteger :: Integer -> CSigAtomic # | |
| Num CClock | |
| Num CTime | |
| Num CUSeconds | |
Defined in Foreign.C.Types | |
| Num CSUSeconds | |
Defined in Foreign.C.Types Methods (+) :: CSUSeconds -> CSUSeconds -> CSUSeconds # (-) :: CSUSeconds -> CSUSeconds -> CSUSeconds # (*) :: CSUSeconds -> CSUSeconds -> CSUSeconds # negate :: CSUSeconds -> CSUSeconds # abs :: CSUSeconds -> CSUSeconds # signum :: CSUSeconds -> CSUSeconds # fromInteger :: Integer -> CSUSeconds # | |
| Num CIntPtr | |
| Num CUIntPtr | |
| Num CIntMax | |
| Num CUIntMax | |
| Num WordPtr | |
| Num IntPtr | |
| Num Half | |
| Num Bit Source # | |
| Class () (Num a) | |
Defined in Data.Constraint | |
| () :=> (Num Double) | |
| () :=> (Num Float) | |
| () :=> (Num Int) | |
| () :=> (Num Integer) | |
| () :=> (Num Natural) | |
| () :=> (Num Word) | |
| Integral a => Num (Ratio a) | Since: base-2.0.1 |
| RealFloat a => Num (Complex a) | Since: base-2.1 |
| HasResolution a => Num (Fixed a) | Since: base-2.1 |
| Num a => Num (Min a) | Since: base-4.9.0.0 |
| Num a => Num (Max a) | Since: base-4.9.0.0 |
| Num a => Num (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity | |
| Num a => Num (Sum a) | Since: base-4.7.0.0 |
| Num a => Num (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| KnownNat n => Num (BitVector n) Source # | |
Defined in Clash.Sized.Internal.BitVector Methods (+) :: BitVector n -> BitVector n -> BitVector n # (-) :: BitVector n -> BitVector n -> BitVector n # (*) :: BitVector n -> BitVector n -> BitVector n # negate :: BitVector n -> BitVector n # abs :: BitVector n -> BitVector n # signum :: BitVector n -> BitVector n # fromInteger :: Integer -> BitVector n # | |
| KnownNat n => Num (Index n) Source # | Operators report an error on overflow and underflow |
| KnownNat n => Num (Unsigned n) Source # | |
Defined in Clash.Sized.Internal.Unsigned | |
| KnownNat n => Num (Signed n) Source # | Operators do |
| Class (Num a) (Fractional a) | |
Defined in Data.Constraint Methods cls :: Fractional a :- Num a # | |
| (Integral a) :=> (Num (Ratio a)) | |
| (Num a) :=> (Num (Identity a)) | |
| (Num a) :=> (Num (Const a b)) | |
| (RealFloat a) :=> (Num (Complex a)) | |
| Num a => Num (Op a b) | |
| Num a => Num (Signal dom a) Source # | |
Defined in Clash.Signal.Internal Methods (+) :: Signal dom a -> Signal dom a -> Signal dom a # (-) :: Signal dom a -> Signal dom a -> Signal dom a # (*) :: Signal dom a -> Signal dom a -> Signal dom a # negate :: Signal dom a -> Signal dom a # abs :: Signal dom a -> Signal dom a # signum :: Signal dom a -> Signal dom a # fromInteger :: Integer -> Signal dom a # | |
| Class (Num a, Ord a) (Real a) | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| (Applicative f, Num a) => Num (Ap f a) | Since: base-4.12.0.0 |
| Num (f a) => Num (Alt f a) | Since: base-4.8.0.0 |
| Num a => Num (Tagged s a) | |
Defined in Data.Tagged | |
| Num a => Num (DSignal dom delay a) Source # | |
Defined in Clash.Signal.Delayed.Internal Methods (+) :: DSignal dom delay a -> DSignal dom delay a -> DSignal dom delay a # (-) :: DSignal dom delay a -> DSignal dom delay a -> DSignal dom delay a # (*) :: DSignal dom delay a -> DSignal dom delay a -> DSignal dom delay a # negate :: DSignal dom delay a -> DSignal dom delay a # abs :: DSignal dom delay a -> DSignal dom delay a # signum :: DSignal dom delay a -> DSignal dom delay a # fromInteger :: Integer -> DSignal dom delay a # | |
| NumFixedC rep int frac => Num (Fixed rep int frac) Source # | The operators of this instance saturate on overflow, and use truncation as the rounding method. When used in a polymorphic setting, use the following Constraint synonyms for less verbose type signatures:
|
Defined in Clash.Sized.Fixed Methods (+) :: Fixed rep int frac -> Fixed rep int frac -> Fixed rep int frac # (-) :: Fixed rep int frac -> Fixed rep int frac -> Fixed rep int frac # (*) :: Fixed rep int frac -> Fixed rep int frac -> Fixed rep int frac # negate :: Fixed rep int frac -> Fixed rep int frac # abs :: Fixed rep int frac -> Fixed rep int frac # signum :: Fixed rep int frac -> Fixed rep int frac # fromInteger :: Integer -> Fixed rep int frac # | |
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Methods
compare :: a -> a -> Ordering #
(<) :: a -> a -> Bool infix 4 #
(<=) :: a -> a -> Bool infix 4 #
(>) :: a -> a -> Bool infix 4 #
Instances
Parsing of Strings, producing values.
Derived instances of Read make the following assumptions, which
derived instances of Show obey:
- If the constructor is defined to be an infix operator, then the
derived
Readinstance will parse only infix applications of the constructor (not the prefix form). - Associativity is not used to reduce the occurrence of parentheses, although precedence may be.
- If the constructor is defined using record syntax, the derived
Readwill parse only the record-syntax form, and furthermore, the fields must be given in the same order as the original declaration. - The derived
Readinstance allows arbitrary Haskell whitespace between tokens of the input string. Extra parentheses are also allowed.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Read in Haskell 2010 is equivalent to
instance (Read a) => Read (Tree a) where
readsPrec d r = readParen (d > app_prec)
(\r -> [(Leaf m,t) |
("Leaf",s) <- lex r,
(m,t) <- readsPrec (app_prec+1) s]) r
++ readParen (d > up_prec)
(\r -> [(u:^:v,w) |
(u,s) <- readsPrec (up_prec+1) r,
(":^:",t) <- lex s,
(v,w) <- readsPrec (up_prec+1) t]) r
where app_prec = 10
up_prec = 5Note that right-associativity of :^: is unused.
The derived instance in GHC is equivalent to
instance (Read a) => Read (Tree a) where
readPrec = parens $ (prec app_prec $ do
Ident "Leaf" <- lexP
m <- step readPrec
return (Leaf m))
+++ (prec up_prec $ do
u <- step readPrec
Symbol ":^:" <- lexP
v <- step readPrec
return (u :^: v))
where app_prec = 10
up_prec = 5
readListPrec = readListPrecDefaultWhy do both readsPrec and readPrec exist, and why does GHC opt to
implement readPrec in derived Read instances instead of readsPrec?
The reason is that readsPrec is based on the ReadS type, and although
ReadS is mentioned in the Haskell 2010 Report, it is not a very efficient
parser data structure.
readPrec, on the other hand, is based on a much more efficient ReadPrec
datatype (a.k.a "new-style parsers"), but its definition relies on the use
of the RankNTypes language extension. Therefore, readPrec (and its
cousin, readListPrec) are marked as GHC-only. Nevertheless, it is
recommended to use readPrec instead of readsPrec whenever possible
for the efficiency improvements it brings.
As mentioned above, derived Read instances in GHC will implement
readPrec instead of readsPrec. The default implementations of
readsPrec (and its cousin, readList) will simply use readPrec under
the hood. If you are writing a Read instance by hand, it is recommended
to write it like so:
instanceReadT wherereadPrec= ...readListPrec=readListPrecDefault
Methods
Arguments
| :: Int | the operator precedence of the enclosing
context (a number from |
| -> ReadS a |
attempts to parse a value from the front of the string, returning a list of (parsed value, remaining string) pairs. If there is no successful parse, the returned list is empty.
Derived instances of Read and Show satisfy the following:
That is, readsPrec parses the string produced by
showsPrec, and delivers the value that
showsPrec started with.
Instances
| Read Bool | Since: base-2.1 |
| Read Char | Since: base-2.1 |
| Read Double | Since: base-2.1 |
| Read Float | Since: base-2.1 |
| Read Int | Since: base-2.1 |
| Read Int8 | Since: base-2.1 |
| Read Int16 | Since: base-2.1 |
| Read Int32 | Since: base-2.1 |
| Read Int64 | Since: base-2.1 |
| Read Integer | Since: base-2.1 |
| Read Natural | Since: base-4.8.0.0 |
| Read Ordering | Since: base-2.1 |
| Read Word | Since: base-4.5.0.0 |
| Read Word8 | Since: base-2.1 |
| Read Word16 | Since: base-2.1 |
| Read Word32 | Since: base-2.1 |
| Read Word64 | Since: base-2.1 |
| Read () | Since: base-2.1 |
| Read Version | Since: base-2.1 |
| Read QCGen | |
| Read Void | Reading a Since: base-4.8.0.0 |
| Read ExitCode | |
| Read BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode # readList :: ReadS [BufferMode] # readPrec :: ReadPrec BufferMode # readListPrec :: ReadPrec [BufferMode] # | |
| Read Newline | Since: base-4.3.0.0 |
| Read NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS NewlineMode # readList :: ReadS [NewlineMode] # readPrec :: ReadPrec NewlineMode # readListPrec :: ReadPrec [NewlineMode] # | |
| Read SeekMode | Since: base-4.2.0.0 |
| Read All | Since: base-2.1 |
| Read Any | Since: base-2.1 |
| Read Fixity | Since: base-4.6.0.0 |
| Read Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # | |
| Read SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness # readList :: ReadS [SourceUnpackedness] # | |
| Read SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness # readList :: ReadS [SourceStrictness] # | |
| Read DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness # readList :: ReadS [DecidedStrictness] # | |
| Read SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits Methods readsPrec :: Int -> ReadS SomeSymbol # readList :: ReadS [SomeSymbol] # readPrec :: ReadPrec SomeSymbol # readListPrec :: ReadPrec [SomeSymbol] # | |
| Read SomeNat | Since: base-4.7.0.0 |
| Read CChar | |
| Read CSChar | |
| Read CUChar | |
| Read CShort | |
| Read CUShort | |
| Read CInt | |
| Read CUInt | |
| Read CLong | |
| Read CULong | |
| Read CLLong | |
| Read CULLong | |
| Read CBool | |
| Read CFloat | |
| Read CDouble | |
| Read CPtrdiff | |
| Read CSize | |
| Read CWchar | |
| Read CSigAtomic | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSigAtomic # readList :: ReadS [CSigAtomic] # readPrec :: ReadPrec CSigAtomic # readListPrec :: ReadPrec [CSigAtomic] # | |
| Read CClock | |
| Read CTime | |
| Read CUSeconds | |
| Read CSUSeconds | |
Defined in Foreign.C.Types Methods readsPrec :: Int -> ReadS CSUSeconds # readList :: ReadS [CSUSeconds] # readPrec :: ReadPrec CSUSeconds # readListPrec :: ReadPrec [CSUSeconds] # | |
| Read CIntPtr | |
| Read CUIntPtr | |
| Read CIntMax | |
| Read CUIntMax | |
| Read WordPtr | |
| Read IntPtr | |
| Read IOMode | Since: base-4.2.0.0 |
| Read Lexeme | Since: base-2.1 |
| Read GeneralCategory | Since: base-2.1 |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS GeneralCategory # readList :: ReadS [GeneralCategory] # | |
| Read ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods readsPrec :: Int -> ReadS ShortByteString # readList :: ReadS [ShortByteString] # | |
| Read ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read ByteString | |
Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read IntSet | |
| Read DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant # readList :: ReadS [DatatypeVariant] # | |
| Read Half | |
| Read ConType | |
| Read Options | |
| Read GenTextMethods | |
Defined in TextShow.Options Methods readsPrec :: Int -> ReadS GenTextMethods # readList :: ReadS [GenTextMethods] # | |
| Read Primitive Source # | |
| Read HDL Source # | |
| Class () (Read a) | |
Defined in Data.Constraint | |
| a :=> (Read (Dict a)) | |
| () :=> (Read Bool) | |
| () :=> (Read Char) | |
| () :=> (Read Int) | |
| () :=> (Read Natural) | |
| () :=> (Read Ordering) | |
| () :=> (Read Word) | |
| () :=> (Read ()) | |
Defined in Data.Constraint | |
| Read a => Read [a] | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| (Integral a, Read a) => Read (Ratio a) | Since: base-2.1 |
| Read p => Read (Par1 p) | Since: base-4.7.0.0 |
| Read a => Read (Complex a) | Since: base-2.1 |
| HasResolution a => Read (Fixed a) | Since: base-4.3.0.0 |
| Read a => Read (Min a) | Since: base-4.9.0.0 |
| Read a => Read (Max a) | Since: base-4.9.0.0 |
| Read a => Read (First a) | Since: base-4.9.0.0 |
| Read a => Read (Last a) | Since: base-4.9.0.0 |
| Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
| Read a => Read (Option a) | Since: base-4.9.0.0 |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Read a => Read (First a) | Since: base-2.1 |
| Read a => Read (Last a) | Since: base-2.1 |
| Read a => Read (Dual a) | Since: base-2.1 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Read a => Read (Product a) | Since: base-2.1 |
| Read a => Read (Down a) | Since: base-4.7.0.0 |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| a => Read (Dict a) | |
| Read e => Read (IntMap e) | |
| Read vertex => Read (SCC vertex) | Since: containers-0.5.9 |
| Read a => Read (Tree a) | |
| Read a => Read (Seq a) | |
| Read a => Read (ViewL a) | |
| Read a => Read (ViewR a) | |
| (Read a, Ord a) => Read (Set a) | |
| (Read a, Prim a) => Read (Vector a) | |
| (Read a, Storable a) => Read (Vector a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Read a => Read (Vector a) | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) # readList :: ReadS [SmallArray a] # readPrec :: ReadPrec (SmallArray a) # readListPrec :: ReadPrec [SmallArray a] # | |
| Read a => Read (Array a) | |
| Read1 f => Read (Fix f) | |
| (Functor f, Read1 f) => Read (Mu f) | |
| (Functor f, Read1 f) => Read (Nu f) | |
| Read a => Read (FromGeneric a) | |
Defined in TextShow.Generic Methods readsPrec :: Int -> ReadS (FromGeneric a) # readList :: ReadS [FromGeneric a] # readPrec :: ReadPrec (FromGeneric a) # readListPrec :: ReadPrec [FromGeneric a] # | |
| Read a => Read (FromStringShow a) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromStringShow a) # readList :: ReadS [FromStringShow a] # readPrec :: ReadPrec (FromStringShow a) # readListPrec :: ReadPrec [FromStringShow a] # | |
| Read a => Read (FromTextShow a) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromTextShow a) # readList :: ReadS [FromTextShow a] # readPrec :: ReadPrec (FromTextShow a) # readListPrec :: ReadPrec [FromTextShow a] # | |
| Read a => Read (PrimitiveGuard a) Source # | |
Defined in Clash.Annotations.Primitive Methods readsPrec :: Int -> ReadS (PrimitiveGuard a) # readList :: ReadS [PrimitiveGuard a] # readPrec :: ReadPrec (PrimitiveGuard a) # readListPrec :: ReadPrec [PrimitiveGuard a] # | |
| KnownNat n => Read (Index n) Source # | None of the |
| KnownNat n => Read (Unsigned n) Source # | None of the |
| KnownNat n => Read (Signed n) Source # | None of the |
| (Read a) :=> (Read (Complex a)) | |
| (Read a) :=> (Read [a]) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Read a) :=> (Read (Identity a)) | |
| (Read a) :=> (Read (Const a b)) | |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| Read (V1 p) | Since: base-4.9.0.0 |
| Read (U1 p) | Since: base-4.9.0.0 |
| (Read a, Read b) => Read (a, b) | Since: base-2.1 |
| (Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Arg a b) | Since: base-4.9.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Read1 f, Read a) => Read (Cofree f a) | |
| (Read1 f, Read a) => Read (Free f a) | |
| (Functor f, Read (f a)) => Read (Yoneda f a) | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Read i, Read a) => Read (Level i a) | |
| (Read a, Read b) => Read (ListF a b) | |
| (Read a, Read b) => Read (NonEmptyF a b) | |
| (Integral a, Read a) :=> (Read (Ratio a)) | |
| (Read a, Read b) :=> (Read (a, b)) | |
| (Read a, Read b) :=> (Read (Either a b)) | |
| Read (f p) => Read (Rec1 f p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c) => Read (a, b, c) | Since: base-2.1 |
| Read a => Read (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Read (f a) => Read (Ap f a) | Since: base-4.12.0.0 |
| Read (f a) => Read (Alt f a) | Since: base-4.8.0.0 |
| Coercible a b => Read (Coercion a b) | Since: base-4.7.0.0 |
| a ~ b => Read (a :~: b) | Since: base-4.7.0.0 |
| Read (p a a) => Read (Join p a) | |
| Read (p (Fix p a) a) => Read (Fix p a) | |
| (Read a, Read (f b)) => Read (FreeF f a b) | |
| (Read1 f, Read1 m, Read a) => Read (FreeT f m a) | |
| (Read a, Read (f b)) => Read (CofreeF f a b) | |
| Read (w (CofreeF f a (CofreeT f w a))) => Read (CofreeT f w a) | |
| (Read e, Read1 m, Read a) => Read (ErrorT e m a) | |
| Read b => Read (Tagged s b) | |
| Read (f a) => Read (FromGeneric1 f a) | |
Defined in TextShow.Generic Methods readsPrec :: Int -> ReadS (FromGeneric1 f a) # readList :: ReadS [FromGeneric1 f a] # readPrec :: ReadPrec (FromGeneric1 f a) # readListPrec :: ReadPrec [FromGeneric1 f a] # | |
| Read (f a) => Read (FromStringShow1 f a) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromStringShow1 f a) # readList :: ReadS [FromStringShow1 f a] # readPrec :: ReadPrec (FromStringShow1 f a) # readListPrec :: ReadPrec [FromStringShow1 f a] # | |
| Read (f a) => Read (FromTextShow1 f a) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromTextShow1 f a) # readList :: ReadS [FromTextShow1 f a] # readPrec :: ReadPrec (FromTextShow1 f a) # readListPrec :: ReadPrec [FromTextShow1 f a] # | |
| Read a => Read (Constant a b) | |
| (size ~ (int + frac), KnownNat frac, Bounded (rep size), Integral (rep size)) => Read (Fixed rep int frac) Source # | None of the |
| Read c => Read (K1 i c p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :+: g) p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :*: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d) => Read (a, b, c, d) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Product f g a) | Since: base-4.9.0.0 |
| (Read1 f, Read1 g, Read a) => Read (Sum f g a) | Since: base-4.9.0.0 |
| a ~~ b => Read (a :~~: b) | Since: base-4.10.0.0 |
| Read (f p) => Read (M1 i c f p) | Since: base-4.7.0.0 |
| Read (f (g p)) => Read ((f :.: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Compose f g a) | Since: base-4.9.0.0 |
| Read (p a b) => Read (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS (WrappedBifunctor p a b) # readList :: ReadS [WrappedBifunctor p a b] # readPrec :: ReadPrec (WrappedBifunctor p a b) # readListPrec :: ReadPrec [WrappedBifunctor p a b] # | |
| Read (g b) => Read (Joker g a b) | |
| Read (p b a) => Read (Flip p a b) | |
| Read (f a) => Read (Clown f a b) | |
| Read (f a b) => Read (FromStringShow2 f a b) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromStringShow2 f a b) # readList :: ReadS [FromStringShow2 f a b] # readPrec :: ReadPrec (FromStringShow2 f a b) # readListPrec :: ReadPrec [FromStringShow2 f a b] # | |
| Read (f a b) => Read (FromTextShow2 f a b) | |
Defined in TextShow.FromStringTextShow Methods readsPrec :: Int -> ReadS (FromTextShow2 f a b) # readList :: ReadS [FromTextShow2 f a b] # readPrec :: ReadPrec (FromTextShow2 f a b) # readListPrec :: ReadPrec [FromTextShow2 f a b] # | |
| (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | Since: base-2.1 |
| (Read (p a b), Read (q a b)) => Read (Sum p q a b) | |
| (Read (f a b), Read (g a b)) => Read (Product f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | Since: base-2.1 |
| Read (f (p a b)) => Read (Tannen f p a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| Read (p (f a) (g b)) => Read (Biff p f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Defined in GHC.Read | |
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
the rational equivalent of its real argument with full precision
Instances
class (RealFrac a, Floating a) => RealFloat a where #
Efficient, machine-independent access to the components of a floating-point number.
Minimal complete definition
floatRadix, floatDigits, floatRange, decodeFloat, encodeFloat, isNaN, isInfinite, isDenormalized, isNegativeZero, isIEEE
Methods
floatRadix :: a -> Integer #
a constant function, returning the radix of the representation
(often 2)
floatDigits :: a -> Int #
a constant function, returning the number of digits of
floatRadix in the significand
floatRange :: a -> (Int, Int) #
a constant function, returning the lowest and highest values the exponent may assume
decodeFloat :: a -> (Integer, Int) #
The function decodeFloat applied to a real floating-point
number returns the significand expressed as an Integer and an
appropriately scaled exponent (an Int). If decodeFloat x(m,n), then x is equal in value to m*b^^n, where b
is the floating-point radix, and furthermore, either m and n
are both zero or else b^(d-1) <= , where abs m < b^dd is
the value of floatDigits xdecodeFloat 0 = (0,0)decodeFloat (-0.0) = (0,0)decodeFloat xisNaN xisInfinite xTrue.
encodeFloat :: Integer -> Int -> a #
encodeFloat performs the inverse of decodeFloat in the
sense that for finite x with the exception of -0.0,
uncurry encodeFloat (decodeFloat x) = xencodeFloat m nm*b^^n (or ±Infinity if overflow
occurs); usually the closer, but if m contains too many bits,
the result may be rounded in the wrong direction.
exponent corresponds to the second component of decodeFloat.
exponent 0 = 0x,
exponent x = snd (decodeFloat x) + floatDigits xx is a finite floating-point number, it is equal in value to
significand x * b ^^ exponent xb is the
floating-point radix.
The behaviour is unspecified on infinite or NaN values.
significand :: a -> a #
The first component of decodeFloat, scaled to lie in the open
interval (-1,1), either 0.0 or of absolute value >= 1/b,
where b is the floating-point radix.
The behaviour is unspecified on infinite or NaN values.
scaleFloat :: Int -> a -> a #
multiplies a floating-point number by an integer power of the radix
True if the argument is an IEEE "not-a-number" (NaN) value
isInfinite :: a -> Bool #
True if the argument is an IEEE infinity or negative infinity
isDenormalized :: a -> Bool #
True if the argument is too small to be represented in
normalized format
isNegativeZero :: a -> Bool #
True if the argument is an IEEE negative zero
True if the argument is an IEEE floating point number
a version of arctangent taking two real floating-point arguments.
For real floating x and y, atan2 y x(x,y). atan2 y x-pi,
pi]. It follows the Common Lisp semantics for the origin when
signed zeroes are supported. atan2 y 1y in a type
that is RealFloat, should return the same value as atan yatan2 is provided, but implementors
can provide a more accurate implementation.
Instances
class (Real a, Fractional a) => RealFrac a where #
Extracting components of fractions.
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) #
The function properFraction takes a real fractional number x
and returns a pair (n,f) such that x = n+f, and:
nis an integral number with the same sign asx; andfis a fraction with the same type and sign asx, and with absolute value less than1.
The default definitions of the ceiling, floor, truncate
and round functions are in terms of properFraction.
truncate :: Integral b => a -> b #
truncate xx between zero and x
round :: Integral b => a -> b #
round xx;
the even integer if x is equidistant between two integers
ceiling :: Integral b => a -> b #
ceiling xx
floor :: Integral b => a -> b #
floor xx
Instances
| RealFrac CFloat | |
| RealFrac CDouble | |
| RealFrac Half | |
| () :=> (RealFrac Double) | |
| () :=> (RealFrac Float) | |
| Integral a => RealFrac (Ratio a) | Since: base-2.0.1 |
| HasResolution a => RealFrac (Fixed a) | Since: base-2.1 |
| RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0 |
| (Integral a) :=> (RealFrac (Ratio a)) | |
| (RealFrac a) :=> (RealFrac (Identity a)) | |
| (RealFrac a) :=> (RealFrac (Const a b)) | |
| Class (Real a, Fractional a) (RealFrac a) | |
Defined in Data.Constraint | |
| Class (RealFrac a, Floating a) (RealFloat a) | |
| RealFrac a => RealFrac (Const a b) | Since: base-4.9.0.0 |
| RealFrac a => RealFrac (Tagged s a) | |
| (FracFixedC rep int frac, NumFixedC rep int frac, Integral (rep (int + frac))) => RealFrac (Fixed rep int frac) Source # | |
Defined in Clash.Sized.Fixed | |
Conversion of values to readable Strings.
Derived instances of Show have the following properties, which
are compatible with derived instances of Read:
- The result of
showis a syntactically correct Haskell expression containing only constants, given the fixity declarations in force at the point where the type is declared. It contains only the constructor names defined in the data type, parentheses, and spaces. When labelled constructor fields are used, braces, commas, field names, and equal signs are also used. - If the constructor is defined to be an infix operator, then
showsPrecwill produce infix applications of the constructor. - the representation will be enclosed in parentheses if the
precedence of the top-level constructor in
xis less thand(associativity is ignored). Thus, ifdis0then the result is never surrounded in parentheses; ifdis11it is always surrounded in parentheses, unless it is an atomic expression. - If the constructor is defined using record syntax, then
showwill produce the record-syntax form, with the fields given in the same order as the original declaration.
For example, given the declarations
infixr 5 :^: data Tree a = Leaf a | Tree a :^: Tree a
the derived instance of Show is equivalent to
instance (Show a) => Show (Tree a) where
showsPrec d (Leaf m) = showParen (d > app_prec) $
showString "Leaf " . showsPrec (app_prec+1) m
where app_prec = 10
showsPrec d (u :^: v) = showParen (d > up_prec) $
showsPrec (up_prec+1) u .
showString " :^: " .
showsPrec (up_prec+1) v
where up_prec = 5Note that right-associativity of :^: is ignored. For example,
show(Leaf 1 :^: Leaf 2 :^: Leaf 3)"Leaf 1 :^: (Leaf 2 :^: Leaf 3)".
Methods
Arguments
| :: Int | the operator precedence of the enclosing
context (a number from |
| -> a | the value to be converted to a |
| -> ShowS |
Convert a value to a readable String.
showsPrec should satisfy the law
showsPrec d x r ++ s == showsPrec d x (r ++ s)
Derived instances of Read and Show satisfy the following:
That is, readsPrec parses the string produced by
showsPrec, and delivers the value that showsPrec started with.
Instances
class Functor f => Applicative (f :: Type -> Type) where #
A functor with application, providing operations to
A minimal complete definition must include implementations of pure
and of either <*> or liftA2. If it defines both, then they must behave
the same as their default definitions:
(<*>) =liftA2id
liftA2f x y = f<$>x<*>y
Further, any definition must satisfy the following:
- identity
pureid<*>v = v- composition
pure(.)<*>u<*>v<*>w = u<*>(v<*>w)- homomorphism
puref<*>purex =pure(f x)- interchange
u
<*>purey =pure($y)<*>u
The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:
As a consequence of these laws, the Functor instance for f will satisfy
It may be useful to note that supposing
forall x y. p (q x y) = f x . g y
it follows from the above that
liftA2p (liftA2q u v) =liftA2f u .liftA2g v
If f is also a Monad, it should satisfy
(which implies that pure and <*> satisfy the applicative functor laws).
Methods
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*> that is more
efficient than the default one.
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
(<*) :: f a -> f b -> f a infixl 4 #
Sequence actions, discarding the value of the second argument.
Instances
| Applicative [] | Since: base-2.1 |
| Applicative Maybe | Since: base-2.1 |
| Applicative IO | Since: base-2.1 |
| Applicative Par1 | Since: base-4.9.0.0 |
| Applicative Q | |
| Applicative Rose | |
| Applicative Gen | |
| Applicative Complex | Since: base-4.9.0.0 |
| Applicative Min | Since: base-4.9.0.0 |
| Applicative Max | Since: base-4.9.0.0 |
| Applicative First | Since: base-4.9.0.0 |
| Applicative Last | Since: base-4.9.0.0 |
| Applicative Option | Since: base-4.9.0.0 |
| Applicative ZipList | f '<$>' 'ZipList' xs1 '<*>' ... '<*>' 'ZipList' xsN
= 'ZipList' (zipWithN f xs1 ... xsN)where (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
= ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
= ZipList {getZipList = ["a5","b6b6","c7c7c7"]}Since: base-2.1 |
| Applicative Identity | Since: base-4.8.0.0 |
| Applicative STM | Since: base-4.8.0.0 |
| Applicative First | Since: base-4.8.0.0 |
| Applicative Last | Since: base-4.8.0.0 |
| Applicative Dual | Since: base-4.8.0.0 |
| Applicative Sum | Since: base-4.8.0.0 |
| Applicative Product | Since: base-4.8.0.0 |
| Applicative Down | Since: base-4.11.0.0 |
| Applicative ReadPrec | Since: base-4.6.0.0 |
| Applicative ReadP | Since: base-4.6.0.0 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
| Applicative PutM | |
| Applicative Get | |
| Applicative Put | |
| Applicative Tree | |
| Applicative Seq | Since: containers-0.5.4 |
| Applicative Vector | |
| Applicative SmallArray | |
Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (*>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a # | |
| Applicative Array | |
| Applicative PprM | |
| Applicative Id | |
| Applicative Box | |
| Applicative P | Since: base-4.5.0.0 |
| Applicative SimIO Source # | |
| () :=> (Applicative ((->) a :: Type -> Type)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative ((->) a) # | |
| () :=> (Applicative []) | |
Defined in Data.Constraint Methods ins :: () :- Applicative [] # | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Applicative IO) | |
Defined in Data.Constraint Methods ins :: () :- Applicative IO # | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| Applicative (Either e) | Since: base-3.0 |
| Applicative (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monoid a => Applicative ((,) a) | For tuples, the ("hello ", (+15)) <*> ("world!", 2002)
("hello world!",2017)Since: base-2.1 |
| Applicative (ST s) | Since: base-4.4.0.0 |
| Representable f => Applicative (Co f) | |
| Monad m => Applicative (WrappedMonad m) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
| Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Alternative f => Applicative (Cofree f) | |
| Applicative (F f) | |
| Functor f => Applicative (Free f) | |
| Applicative f => Applicative (Yoneda f) | |
| Applicative (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a # | |
| Applicative (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a # | |
| Applicative f => Applicative (Indexing f) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative f => Applicative (Indexing64 f) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a # | |
| (Applicative (Rep p), Representable p) => Applicative (Prep p) | |
| KnownNat n => Applicative (Vec n) Source # | |
| Applicative (Signal dom) Source # | |
Defined in Clash.Signal.Internal | |
| Applicative (SetM s) | |
| KnownNat d => Applicative (RTree d) Source # | |
| Class (Functor f) (Applicative f) | |
Defined in Data.Constraint Methods cls :: Applicative f :- Functor f # | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint Methods cls :: Monad f :- Applicative f # | |
| Class (Applicative f) (Alternative f) | |
Defined in Data.Constraint Methods cls :: Alternative f :- Applicative f # | |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) # | |
| (Monoid a) :=> (Applicative ((,) a)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| Applicative f => Applicative (Rec1 f) | Since: base-4.9.0.0 |
| Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
| Applicative f => Applicative (Ap f) | Since: base-4.12.0.0 |
| Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
| Biapplicative p => Applicative (Join p) | |
| Biapplicative p => Applicative (Fix p) | |
| (Monoid e, Applicative m) => Applicative (EnvT e m) | |
| (Applicative f, Monad f) => Applicative (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
| (Functor f, Monad m) => Applicative (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| (Alternative f, Applicative w) => Applicative (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree | |
| (Applicative f, Applicative g) => Applicative (Day f g) | |
| (Functor m, Monad m) => Applicative (ErrorT e m) | |
Defined in Control.Monad.Trans.Error | |
| Applicative (Tagged s) | |
| Applicative (Mafic a b) | |
Defined in Control.Lens.Internal.Magma | |
| Applicative (Indexed i a) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative (Flows i b) | This is an illegal |
Defined in Control.Lens.Internal.Level | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy | |
| Monoid a => Applicative (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant | |
| Applicative (DSignal dom delay) Source # | |
Defined in Clash.Signal.Delayed.Internal Methods pure :: a -> DSignal dom delay a # (<*>) :: DSignal dom delay (a -> b) -> DSignal dom delay a -> DSignal dom delay b # liftA2 :: (a -> b -> c) -> DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay c # (*>) :: DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay b # (<*) :: DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay a # | |
| Applicative (Mag a b) | |
| Monoid m => Applicative (Holes t m) | |
| Applicative ((->) a :: Type -> Type) | Since: base-2.1 |
| Monoid c => Applicative (K1 i c :: Type -> Type) | Since: base-4.12.0.0 |
| (Applicative f, Applicative g) => Applicative (f :*: g) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
| Applicative (Cokleisli w a) | |
Defined in Control.Comonad Methods pure :: a0 -> Cokleisli w a a0 # (<*>) :: Cokleisli w a (a0 -> b) -> Cokleisli w a a0 -> Cokleisli w a b # liftA2 :: (a0 -> b -> c) -> Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a c # (*>) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a b # (<*) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a a0 # | |
| (Monad f, Applicative f) => Applicative (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
| Applicative (Molten i a b) | |
Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Molten i a b a0 # (<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 # liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c # (*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 # (<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 # | |
| Applicative (Bazaar p a b) | |
Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> Bazaar p a b a0 # (<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 # liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c # (*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 # (<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 # | |
| Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
| Applicative (TakingWhile p f a b) | |
Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> TakingWhile p f a b a0 # (<*>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 # liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c # (*>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 # (<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 # | |
| Applicative (BazaarT p g a b) | |
Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> BazaarT p g a b a0 # (<*>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 # liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c # (*>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 # (<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 # | |
| Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) | |
Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a # | |
class Foldable (t :: Type -> Type) where #
Data structures that can be folded.
For example, given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Foldable Tree where foldMap f Empty = mempty foldMap f (Leaf x) = f x foldMap f (Node l k r) = foldMap f l `mappend` f k `mappend` foldMap f r
This is suitable even for abstract types, as the monoid is assumed
to satisfy the monoid laws. Alternatively, one could define foldr:
instance Foldable Tree where foldr f z Empty = z foldr f z (Leaf x) = f x z foldr f z (Node l k r) = foldr f (f k (foldr f z r)) l
Foldable instances are expected to satisfy the following laws:
foldr f z t = appEndo (foldMap (Endo . f) t ) z
foldl f z t = appEndo (getDual (foldMap (Dual . Endo . flip f) t)) z
fold = foldMap id
length = getSum . foldMap (Sum . const 1)
sum, product, maximum, and minimum should all be essentially
equivalent to foldMap forms, such as
sum = getSum . foldMap Sum
but may be less defined.
If the type is also a Functor instance, it should satisfy
foldMap f = fold . fmap f
which implies that
foldMap f . fmap g = foldMap (f . g)
Methods
foldMap :: Monoid m => (a -> m) -> t a -> m #
Map each element of the structure to a monoid, and combine the results.
Test whether the structure is empty. The default implementation is optimized for structures that are similar to cons-lists, because there is no general way to do better.
elem :: Eq a => a -> t a -> Bool infix 4 #
Does the element occur in the structure?
maximum :: Ord a => t a -> a #
The largest element of a non-empty structure.
minimum :: Ord a => t a -> a #
The least element of a non-empty structure.
The sum function computes the sum of the numbers of a structure.
product :: Num a => t a -> a #
The product function computes the product of the numbers of a
structure.
Instances
| Foldable [] | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
| Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
| Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
| Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
| Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # | |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Foldable IntMap | |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
| Foldable SCC | Since: containers-0.5.9 |
Defined in Data.Graph Methods fold :: Monoid m => SCC m -> m # foldMap :: Monoid m => (a -> m) -> SCC a -> m # foldr :: (a -> b -> b) -> b -> SCC a -> b # foldr' :: (a -> b -> b) -> b -> SCC a -> b # foldl :: (b -> a -> b) -> b -> SCC a -> b # foldl' :: (b -> a -> b) -> b -> SCC a -> b # foldr1 :: (a -> a -> a) -> SCC a -> a # foldl1 :: (a -> a -> a) -> SCC a -> a # elem :: Eq a => a -> SCC a -> Bool # maximum :: Ord a => SCC a -> a # | |
| Foldable Tree | |
Defined in Data.Tree Methods fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # sum :: Num a => FingerTree a -> a # product :: Num a => FingerTree a -> a # | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
| Foldable Set | |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m # foldMap :: Monoid m => (a -> m) -> Hashed a -> m # foldr :: (a -> b -> b) -> b -> Hashed a -> b # foldr' :: (a -> b -> b) -> b -> Hashed a -> b # foldl :: (b -> a -> b) -> b -> Hashed a -> b # foldl' :: (b -> a -> b) -> b -> Hashed a -> b # foldr1 :: (a -> a -> a) -> Hashed a -> a # foldl1 :: (a -> a -> a) -> Hashed a -> a # elem :: Eq a => a -> Hashed a -> Bool # maximum :: Ord a => Hashed a -> a # minimum :: Ord a => Hashed a -> a # | |
| Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m # foldMap :: Monoid m => (a -> m) -> SmallArray a -> m # foldr :: (a -> b -> b) -> b -> SmallArray a -> b # foldr' :: (a -> b -> b) -> b -> SmallArray a -> b # foldl :: (b -> a -> b) -> b -> SmallArray a -> b # foldl' :: (b -> a -> b) -> b -> SmallArray a -> b # foldr1 :: (a -> a -> a) -> SmallArray a -> a # foldl1 :: (a -> a -> a) -> SmallArray a -> a # toList :: SmallArray a -> [a] # null :: SmallArray a -> Bool # length :: SmallArray a -> Int # elem :: Eq a => a -> SmallArray a -> Bool # maximum :: Ord a => SmallArray a -> a # minimum :: Ord a => SmallArray a -> a # sum :: Num a => SmallArray a -> a # product :: Num a => SmallArray a -> a # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
| Foldable FromGeneric | |
Defined in TextShow.Generic Methods fold :: Monoid m => FromGeneric m -> m # foldMap :: Monoid m => (a -> m) -> FromGeneric a -> m # foldr :: (a -> b -> b) -> b -> FromGeneric a -> b # foldr' :: (a -> b -> b) -> b -> FromGeneric a -> b # foldl :: (b -> a -> b) -> b -> FromGeneric a -> b # foldl' :: (b -> a -> b) -> b -> FromGeneric a -> b # foldr1 :: (a -> a -> a) -> FromGeneric a -> a # foldl1 :: (a -> a -> a) -> FromGeneric a -> a # toList :: FromGeneric a -> [a] # null :: FromGeneric a -> Bool # length :: FromGeneric a -> Int # elem :: Eq a => a -> FromGeneric a -> Bool # maximum :: Ord a => FromGeneric a -> a # minimum :: Ord a => FromGeneric a -> a # sum :: Num a => FromGeneric a -> a # product :: Num a => FromGeneric a -> a # | |
| Foldable FromStringShow | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromStringShow m -> m # foldMap :: Monoid m => (a -> m) -> FromStringShow a -> m # foldr :: (a -> b -> b) -> b -> FromStringShow a -> b # foldr' :: (a -> b -> b) -> b -> FromStringShow a -> b # foldl :: (b -> a -> b) -> b -> FromStringShow a -> b # foldl' :: (b -> a -> b) -> b -> FromStringShow a -> b # foldr1 :: (a -> a -> a) -> FromStringShow a -> a # foldl1 :: (a -> a -> a) -> FromStringShow a -> a # toList :: FromStringShow a -> [a] # null :: FromStringShow a -> Bool # length :: FromStringShow a -> Int # elem :: Eq a => a -> FromStringShow a -> Bool # maximum :: Ord a => FromStringShow a -> a # minimum :: Ord a => FromStringShow a -> a # sum :: Num a => FromStringShow a -> a # product :: Num a => FromStringShow a -> a # | |
| Foldable FromTextShow | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromTextShow m -> m # foldMap :: Monoid m => (a -> m) -> FromTextShow a -> m # foldr :: (a -> b -> b) -> b -> FromTextShow a -> b # foldr' :: (a -> b -> b) -> b -> FromTextShow a -> b # foldl :: (b -> a -> b) -> b -> FromTextShow a -> b # foldl' :: (b -> a -> b) -> b -> FromTextShow a -> b # foldr1 :: (a -> a -> a) -> FromTextShow a -> a # foldl1 :: (a -> a -> a) -> FromTextShow a -> a # toList :: FromTextShow a -> [a] # null :: FromTextShow a -> Bool # length :: FromTextShow a -> Int # elem :: Eq a => a -> FromTextShow a -> Bool # maximum :: Ord a => FromTextShow a -> a # minimum :: Ord a => FromTextShow a -> a # sum :: Num a => FromTextShow a -> a # product :: Num a => FromTextShow a -> a # | |
| Foldable PrimitiveGuard Source # | |
Defined in Clash.Annotations.Primitive Methods fold :: Monoid m => PrimitiveGuard m -> m # foldMap :: Monoid m => (a -> m) -> PrimitiveGuard a -> m # foldr :: (a -> b -> b) -> b -> PrimitiveGuard a -> b # foldr' :: (a -> b -> b) -> b -> PrimitiveGuard a -> b # foldl :: (b -> a -> b) -> b -> PrimitiveGuard a -> b # foldl' :: (b -> a -> b) -> b -> PrimitiveGuard a -> b # foldr1 :: (a -> a -> a) -> PrimitiveGuard a -> a # foldl1 :: (a -> a -> a) -> PrimitiveGuard a -> a # toList :: PrimitiveGuard a -> [a] # null :: PrimitiveGuard a -> Bool # length :: PrimitiveGuard a -> Int # elem :: Eq a => a -> PrimitiveGuard a -> Bool # maximum :: Ord a => PrimitiveGuard a -> a # minimum :: Ord a => PrimitiveGuard a -> a # sum :: Num a => PrimitiveGuard a -> a # product :: Num a => PrimitiveGuard a -> a # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # 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 (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
| Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
| Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
| Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
| Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Foldable (Map k) | |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m # foldMap :: Monoid m => (a -> m) -> Cofree f a -> m # foldr :: (a -> b -> b) -> b -> Cofree f a -> b # foldr' :: (a -> b -> b) -> b -> Cofree f a -> b # foldl :: (b -> a -> b) -> b -> Cofree f a -> b # foldl' :: (b -> a -> b) -> b -> Cofree f a -> b # foldr1 :: (a -> a -> a) -> Cofree f a -> a # foldl1 :: (a -> a -> a) -> Cofree f a -> a # elem :: Eq a => a -> Cofree f a -> Bool # maximum :: Ord a => Cofree f a -> a # minimum :: Ord a => Cofree f a -> a # | |
| Foldable f => Foldable (F f) | |
Defined in Control.Monad.Free.Church Methods fold :: Monoid m => F f m -> m # foldMap :: Monoid m => (a -> m) -> F f a -> m # foldr :: (a -> b -> b) -> b -> F f a -> b # foldr' :: (a -> b -> b) -> b -> F f a -> b # foldl :: (b -> a -> b) -> b -> F f a -> b # foldl' :: (b -> a -> b) -> b -> F f a -> b # foldr1 :: (a -> a -> a) -> F f a -> a # foldl1 :: (a -> a -> a) -> F f a -> a # elem :: Eq a => a -> F f a -> Bool # maximum :: Ord a => F f a -> a # | |
| Foldable f => Foldable (Free f) | |
Defined in Control.Monad.Free Methods fold :: Monoid m => Free f m -> m # foldMap :: Monoid m => (a -> m) -> Free f a -> m # foldr :: (a -> b -> b) -> b -> Free f a -> b # foldr' :: (a -> b -> b) -> b -> Free f a -> b # foldl :: (b -> a -> b) -> b -> Free f a -> b # foldl' :: (b -> a -> b) -> b -> Free f a -> b # foldr1 :: (a -> a -> a) -> Free f a -> a # foldl1 :: (a -> a -> a) -> Free f a -> a # elem :: Eq a => a -> Free f a -> Bool # maximum :: Ord a => Free f a -> a # minimum :: Ord a => Free f a -> a # | |
| Foldable f => Foldable (Yoneda f) | |
Defined in Data.Functor.Yoneda Methods fold :: Monoid m => Yoneda f m -> m # foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m # foldr :: (a -> b -> b) -> b -> Yoneda f a -> b # foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b # foldl :: (b -> a -> b) -> b -> Yoneda f a -> b # foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b # foldr1 :: (a -> a -> a) -> Yoneda f a -> a # foldl1 :: (a -> a -> a) -> Yoneda f a -> a # elem :: Eq a => a -> Yoneda f a -> Bool # maximum :: Ord a => Yoneda f a -> a # minimum :: Ord a => Yoneda f a -> a # | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Foldable (Level i) | |
Defined in Control.Lens.Internal.Level Methods fold :: Monoid m => Level i m -> m # foldMap :: Monoid m => (a -> m) -> Level i a -> m # foldr :: (a -> b -> b) -> b -> Level i a -> b # foldr' :: (a -> b -> b) -> b -> Level i a -> b # foldl :: (b -> a -> b) -> b -> Level i a -> b # foldl' :: (b -> a -> b) -> b -> Level i a -> b # foldr1 :: (a -> a -> a) -> Level i a -> a # foldl1 :: (a -> a -> a) -> Level i a -> a # elem :: Eq a => a -> Level i a -> Bool # maximum :: Ord a => Level i a -> a # minimum :: Ord a => Level i a -> a # | |
| Foldable (ListF a) | |
Defined in Data.Functor.Foldable Methods fold :: Monoid m => ListF a m -> m # foldMap :: Monoid m => (a0 -> m) -> ListF a a0 -> m # foldr :: (a0 -> b -> b) -> b -> ListF a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> ListF a a0 -> b # foldl :: (b -> a0 -> b) -> b -> ListF a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> ListF a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 # toList :: ListF a a0 -> [a0] # elem :: Eq a0 => a0 -> ListF a a0 -> Bool # maximum :: Ord a0 => ListF a a0 -> a0 # minimum :: Ord a0 => ListF a a0 -> a0 # | |
| Foldable (NonEmptyF a) | |
Defined in Data.Functor.Base Methods fold :: Monoid m => NonEmptyF a m -> m # foldMap :: Monoid m => (a0 -> m) -> NonEmptyF a a0 -> m # foldr :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b # foldl :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 # toList :: NonEmptyF a a0 -> [a0] # null :: NonEmptyF a a0 -> Bool # length :: NonEmptyF a a0 -> Int # elem :: Eq a0 => a0 -> NonEmptyF a a0 -> Bool # maximum :: Ord a0 => NonEmptyF a a0 -> a0 # minimum :: Ord a0 => NonEmptyF a a0 -> a0 # | |
| (KnownNat n, 1 <= n) => Foldable (Vec n) Source # | |
Defined in Clash.Sized.Vector Methods fold :: Monoid m => Vec n m -> m # foldMap :: Monoid m => (a -> m) -> Vec n a -> m # foldr :: (a -> b -> b) -> b -> Vec n a -> b # foldr' :: (a -> b -> b) -> b -> Vec n a -> b # foldl :: (b -> a -> b) -> b -> Vec n a -> b # foldl' :: (b -> a -> b) -> b -> Vec n a -> b # foldr1 :: (a -> a -> a) -> Vec n a -> a # foldl1 :: (a -> a -> a) -> Vec n a -> a # elem :: Eq a => a -> Vec n a -> Bool # maximum :: Ord a => Vec n a -> a # minimum :: Ord a => Vec n a -> a # | |
| Foldable (Signal dom) Source # | NB: Not synthesizable NB: In "
|
Defined in Clash.Signal.Internal Methods fold :: Monoid m => Signal dom m -> m # foldMap :: Monoid m => (a -> m) -> Signal dom a -> m # foldr :: (a -> b -> b) -> b -> Signal dom a -> b # foldr' :: (a -> b -> b) -> b -> Signal dom a -> b # foldl :: (b -> a -> b) -> b -> Signal dom a -> b # foldl' :: (b -> a -> b) -> b -> Signal dom a -> b # foldr1 :: (a -> a -> a) -> Signal dom a -> a # foldl1 :: (a -> a -> a) -> Signal dom a -> a # toList :: Signal dom a -> [a] # null :: Signal dom a -> Bool # length :: Signal dom a -> Int # elem :: Eq a => a -> Signal dom a -> Bool # maximum :: Ord a => Signal dom a -> a # minimum :: Ord a => Signal dom a -> a # | |
| KnownNat d => Foldable (RTree d) Source # | |
Defined in Clash.Sized.RTree Methods fold :: Monoid m => RTree d m -> m # foldMap :: Monoid m => (a -> m) -> RTree d a -> m # foldr :: (a -> b -> b) -> b -> RTree d a -> b # foldr' :: (a -> b -> b) -> b -> RTree d a -> b # foldl :: (b -> a -> b) -> b -> RTree d a -> b # foldl' :: (b -> a -> b) -> b -> RTree d a -> b # foldr1 :: (a -> a -> a) -> RTree d a -> a # foldl1 :: (a -> a -> a) -> RTree d a -> a # elem :: Eq a => a -> RTree d a -> Bool # maximum :: Ord a => RTree d a -> a # minimum :: Ord a => RTree d a -> a # | |
| Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
| Foldable (URec Char :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Char m -> m # foldMap :: Monoid m => (a -> m) -> URec Char a -> m # foldr :: (a -> b -> b) -> b -> URec Char a -> b # foldr' :: (a -> b -> b) -> b -> URec Char a -> b # foldl :: (b -> a -> b) -> b -> URec Char a -> b # foldl' :: (b -> a -> b) -> b -> URec Char a -> b # foldr1 :: (a -> a -> a) -> URec Char a -> a # foldl1 :: (a -> a -> a) -> URec Char a -> a # toList :: URec Char a -> [a] # length :: URec Char a -> Int # elem :: Eq a => a -> URec Char a -> Bool # maximum :: Ord a => URec Char a -> a # minimum :: Ord a => URec Char a -> a # | |
| Foldable (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m # foldMap :: Monoid m => (a -> m) -> URec Double a -> m # foldr :: (a -> b -> b) -> b -> URec Double a -> b # foldr' :: (a -> b -> b) -> b -> URec Double a -> b # foldl :: (b -> a -> b) -> b -> URec Double a -> b # foldl' :: (b -> a -> b) -> b -> URec Double a -> b # foldr1 :: (a -> a -> a) -> URec Double a -> a # foldl1 :: (a -> a -> a) -> URec Double a -> a # toList :: URec Double a -> [a] # null :: URec Double a -> Bool # length :: URec Double a -> Int # elem :: Eq a => a -> URec Double a -> Bool # maximum :: Ord a => URec Double a -> a # minimum :: Ord a => URec Double a -> a # | |
| Foldable (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m # foldMap :: Monoid m => (a -> m) -> URec Float a -> m # foldr :: (a -> b -> b) -> b -> URec Float a -> b # foldr' :: (a -> b -> b) -> b -> URec Float a -> b # foldl :: (b -> a -> b) -> b -> URec Float a -> b # foldl' :: (b -> a -> b) -> b -> URec Float a -> b # foldr1 :: (a -> a -> a) -> URec Float a -> a # foldl1 :: (a -> a -> a) -> URec Float a -> a # toList :: URec Float a -> [a] # null :: URec Float a -> Bool # length :: URec Float a -> Int # elem :: Eq a => a -> URec Float a -> Bool # maximum :: Ord a => URec Float a -> a # minimum :: Ord a => URec Float a -> a # | |
| Foldable (URec Int :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Int m -> m # foldMap :: Monoid m => (a -> m) -> URec Int a -> m # foldr :: (a -> b -> b) -> b -> URec Int a -> b # foldr' :: (a -> b -> b) -> b -> URec Int a -> b # foldl :: (b -> a -> b) -> b -> URec Int a -> b # foldl' :: (b -> a -> b) -> b -> URec Int a -> b # foldr1 :: (a -> a -> a) -> URec Int a -> a # foldl1 :: (a -> a -> a) -> URec Int a -> a # elem :: Eq a => a -> URec Int a -> Bool # maximum :: Ord a => URec Int a -> a # minimum :: Ord a => URec Int a -> a # | |
| Foldable (URec Word :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Word m -> m # foldMap :: Monoid m => (a -> m) -> URec Word a -> m # foldr :: (a -> b -> b) -> b -> URec Word a -> b # foldr' :: (a -> b -> b) -> b -> URec Word a -> b # foldl :: (b -> a -> b) -> b -> URec Word a -> b # foldl' :: (b -> a -> b) -> b -> URec Word a -> b # foldr1 :: (a -> a -> a) -> URec Word a -> a # foldl1 :: (a -> a -> a) -> URec Word a -> a # toList :: URec Word a -> [a] # length :: URec Word a -> Int # elem :: Eq a => a -> URec Word a -> Bool # maximum :: Ord a => URec Word a -> a # minimum :: Ord a => URec Word a -> a # | |
| Foldable (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec (Ptr ()) m -> m # foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # toList :: URec (Ptr ()) a -> [a] # null :: URec (Ptr ()) a -> Bool # length :: URec (Ptr ()) a -> Int # elem :: Eq a => a -> URec (Ptr ()) a -> Bool # maximum :: Ord a => URec (Ptr ()) a -> a # minimum :: Ord a => URec (Ptr ()) a -> a # | |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # 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) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m # foldMap :: Monoid m => (a -> m) -> Join p a -> m # foldr :: (a -> b -> b) -> b -> Join p a -> b # foldr' :: (a -> b -> b) -> b -> Join p a -> b # foldl :: (b -> a -> b) -> b -> Join p a -> b # foldl' :: (b -> a -> b) -> b -> Join p a -> b # foldr1 :: (a -> a -> a) -> Join p a -> a # foldl1 :: (a -> a -> a) -> Join p a -> a # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # | |
| Bifoldable p => Foldable (Fix p) | |
Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m # foldMap :: Monoid m => (a -> m) -> Fix p a -> m # foldr :: (a -> b -> b) -> b -> Fix p a -> b # foldr' :: (a -> b -> b) -> b -> Fix p a -> b # foldl :: (b -> a -> b) -> b -> Fix p a -> b # foldl' :: (b -> a -> b) -> b -> Fix p a -> b # foldr1 :: (a -> a -> a) -> Fix p a -> a # foldl1 :: (a -> a -> a) -> Fix p a -> a # elem :: Eq a => a -> Fix p a -> Bool # maximum :: Ord a => Fix p a -> a # minimum :: Ord a => Fix p a -> a # | |
| Foldable w => Foldable (EnvT e w) | |
Defined in Control.Comonad.Trans.Env Methods fold :: Monoid m => EnvT e w m -> m # foldMap :: Monoid m => (a -> m) -> EnvT e w a -> m # foldr :: (a -> b -> b) -> b -> EnvT e w a -> b # foldr' :: (a -> b -> b) -> b -> EnvT e w a -> b # foldl :: (b -> a -> b) -> b -> EnvT e w a -> b # foldl' :: (b -> a -> b) -> b -> EnvT e w a -> b # foldr1 :: (a -> a -> a) -> EnvT e w a -> a # foldl1 :: (a -> a -> a) -> EnvT e w a -> a # elem :: Eq a => a -> EnvT e w a -> Bool # maximum :: Ord a => EnvT e w a -> a # minimum :: Ord a => EnvT e w a -> a # | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # toList :: FreeF f a a0 -> [a0] # null :: FreeF f a a0 -> Bool # length :: FreeF f a a0 -> Int # elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool # maximum :: Ord a0 => FreeF f a a0 -> a0 # minimum :: Ord a0 => FreeF f a a0 -> a0 # | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldr :: (a -> b -> b) -> b -> FreeT f m a -> b # foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b # foldl :: (b -> a -> b) -> b -> FreeT f m a -> b # foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b # foldr1 :: (a -> a -> a) -> FreeT f m a -> a # foldl1 :: (a -> a -> a) -> FreeT f m a -> a # toList :: FreeT f m a -> [a] # length :: FreeT f m a -> Int # elem :: Eq a => a -> FreeT f m a -> Bool # maximum :: Ord a => FreeT f m a -> a # minimum :: Ord a => FreeT f m a -> a # | |
| Foldable f => Foldable (CofreeF f a) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # toList :: CofreeF f a a0 -> [a0] # null :: CofreeF f a a0 -> Bool # length :: CofreeF f a a0 -> Int # elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool # maximum :: Ord a0 => CofreeF f a a0 -> a0 # minimum :: Ord a0 => CofreeF f a a0 -> a0 # | |
| (Foldable f, Foldable w) => Foldable (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeT f w m -> m # foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldr1 :: (a -> a -> a) -> CofreeT f w a -> a # foldl1 :: (a -> a -> a) -> CofreeT f w a -> a # toList :: CofreeT f w a -> [a] # null :: CofreeT f w a -> Bool # length :: CofreeT f w a -> Int # elem :: Eq a => a -> CofreeT f w a -> Bool # maximum :: Ord a => CofreeT f w a -> a # minimum :: Ord a => CofreeT f w a -> a # | |
| Foldable f => Foldable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error Methods fold :: Monoid m => ErrorT e f m -> m # foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m # foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldr1 :: (a -> a -> a) -> ErrorT e f a -> a # foldl1 :: (a -> a -> a) -> ErrorT e f a -> a # toList :: ErrorT e f a -> [a] # null :: ErrorT e f a -> Bool # length :: ErrorT e f a -> Int # elem :: Eq a => a -> ErrorT e f a -> Bool # maximum :: Ord a => ErrorT e f a -> a # minimum :: Ord a => ErrorT e f a -> a # | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m # foldMap :: Monoid m => (a -> m) -> Tagged s a -> m # foldr :: (a -> b -> b) -> b -> Tagged s a -> b # foldr' :: (a -> b -> b) -> b -> Tagged s a -> b # foldl :: (b -> a -> b) -> b -> Tagged s a -> b # foldl' :: (b -> a -> b) -> b -> Tagged s a -> b # foldr1 :: (a -> a -> a) -> Tagged s a -> a # foldl1 :: (a -> a -> a) -> Tagged s a -> a # elem :: Eq a => a -> Tagged s a -> Bool # maximum :: Ord a => Tagged s a -> a # minimum :: Ord a => Tagged s a -> a # | |
| Foldable f => Foldable (FromGeneric1 f) | |
Defined in TextShow.Generic Methods fold :: Monoid m => FromGeneric1 f m -> m # foldMap :: Monoid m => (a -> m) -> FromGeneric1 f a -> m # foldr :: (a -> b -> b) -> b -> FromGeneric1 f a -> b # foldr' :: (a -> b -> b) -> b -> FromGeneric1 f a -> b # foldl :: (b -> a -> b) -> b -> FromGeneric1 f a -> b # foldl' :: (b -> a -> b) -> b -> FromGeneric1 f a -> b # foldr1 :: (a -> a -> a) -> FromGeneric1 f a -> a # foldl1 :: (a -> a -> a) -> FromGeneric1 f a -> a # toList :: FromGeneric1 f a -> [a] # null :: FromGeneric1 f a -> Bool # length :: FromGeneric1 f a -> Int # elem :: Eq a => a -> FromGeneric1 f a -> Bool # maximum :: Ord a => FromGeneric1 f a -> a # minimum :: Ord a => FromGeneric1 f a -> a # sum :: Num a => FromGeneric1 f a -> a # product :: Num a => FromGeneric1 f a -> a # | |
| Foldable f => Foldable (FromStringShow1 f) | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromStringShow1 f m -> m # foldMap :: Monoid m => (a -> m) -> FromStringShow1 f a -> m # foldr :: (a -> b -> b) -> b -> FromStringShow1 f a -> b # foldr' :: (a -> b -> b) -> b -> FromStringShow1 f a -> b # foldl :: (b -> a -> b) -> b -> FromStringShow1 f a -> b # foldl' :: (b -> a -> b) -> b -> FromStringShow1 f a -> b # foldr1 :: (a -> a -> a) -> FromStringShow1 f a -> a # foldl1 :: (a -> a -> a) -> FromStringShow1 f a -> a # toList :: FromStringShow1 f a -> [a] # null :: FromStringShow1 f a -> Bool # length :: FromStringShow1 f a -> Int # elem :: Eq a => a -> FromStringShow1 f a -> Bool # maximum :: Ord a => FromStringShow1 f a -> a # minimum :: Ord a => FromStringShow1 f a -> a # sum :: Num a => FromStringShow1 f a -> a # product :: Num a => FromStringShow1 f a -> a # | |
| Foldable f => Foldable (FromTextShow1 f) | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromTextShow1 f m -> m # foldMap :: Monoid m => (a -> m) -> FromTextShow1 f a -> m # foldr :: (a -> b -> b) -> b -> FromTextShow1 f a -> b # foldr' :: (a -> b -> b) -> b -> FromTextShow1 f a -> b # foldl :: (b -> a -> b) -> b -> FromTextShow1 f a -> b # foldl' :: (b -> a -> b) -> b -> FromTextShow1 f a -> b # foldr1 :: (a -> a -> a) -> FromTextShow1 f a -> a # foldl1 :: (a -> a -> a) -> FromTextShow1 f a -> a # toList :: FromTextShow1 f a -> [a] # null :: FromTextShow1 f a -> Bool # length :: FromTextShow1 f a -> Int # elem :: Eq a => a -> FromTextShow1 f a -> Bool # maximum :: Ord a => FromTextShow1 f a -> a # minimum :: Ord a => FromTextShow1 f a -> a # sum :: Num a => FromTextShow1 f a -> a # product :: Num a => FromTextShow1 f a -> a # | |
| Foldable (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant Methods fold :: Monoid m => Constant a m -> m # foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 # toList :: Constant a a0 -> [a0] # null :: Constant a a0 -> Bool # length :: Constant a a0 -> Int # elem :: Eq a0 => a0 -> Constant a a0 -> Bool # maximum :: Ord a0 => Constant a a0 -> a0 # minimum :: Ord a0 => Constant a a0 -> a0 # | |
| Foldable (DSignal dom delay) Source # | |
Defined in Clash.Signal.Delayed.Internal Methods fold :: Monoid m => DSignal dom delay m -> m # foldMap :: Monoid m => (a -> m) -> DSignal dom delay a -> m # foldr :: (a -> b -> b) -> b -> DSignal dom delay a -> b # foldr' :: (a -> b -> b) -> b -> DSignal dom delay a -> b # foldl :: (b -> a -> b) -> b -> DSignal dom delay a -> b # foldl' :: (b -> a -> b) -> b -> DSignal dom delay a -> b # foldr1 :: (a -> a -> a) -> DSignal dom delay a -> a # foldl1 :: (a -> a -> a) -> DSignal dom delay a -> a # toList :: DSignal dom delay a -> [a] # null :: DSignal dom delay a -> Bool # length :: DSignal dom delay a -> Int # elem :: Eq a => a -> DSignal dom delay a -> Bool # maximum :: Ord a => DSignal dom delay a -> a # minimum :: Ord a => DSignal dom delay a -> a # | |
| Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # 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) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # 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 (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # 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 (Magma i t b) | |
Defined in Control.Lens.Internal.Magma Methods fold :: Monoid m => Magma i t b m -> m # foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m # foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 # foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 # foldr1 :: (a -> a -> a) -> Magma i t b a -> a # foldl1 :: (a -> a -> a) -> Magma i t b a -> a # toList :: Magma i t b a -> [a] # null :: Magma i t b a -> Bool # length :: Magma i t b a -> Int # elem :: Eq a => a -> Magma i t b a -> Bool # maximum :: Ord a => Magma i t b a -> a # minimum :: Ord a => Magma i t b a -> a # | |
| Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # 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 # | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # 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 (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # toList :: WrappedBifunctor p a a0 -> [a0] # null :: WrappedBifunctor p a a0 -> Bool # length :: WrappedBifunctor p a a0 -> Int # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 # product :: Num a0 => WrappedBifunctor p a a0 -> a0 # | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # toList :: Joker g a a0 -> [a0] # null :: Joker g a a0 -> Bool # length :: Joker g a a0 -> Int # elem :: Eq a0 => a0 -> Joker g a a0 -> Bool # maximum :: Ord a0 => Joker g a a0 -> a0 # minimum :: Ord a0 => Joker g a a0 -> a0 # | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # toList :: Flip p a a0 -> [a0] # length :: Flip p a a0 -> Int # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool # maximum :: Ord a0 => Flip p a a0 -> a0 # minimum :: Ord a0 => Flip p a a0 -> a0 # | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # toList :: Clown f a a0 -> [a0] # null :: Clown f a a0 -> Bool # length :: Clown f a a0 -> Int # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool # maximum :: Ord a0 => Clown f a a0 -> a0 # minimum :: Ord a0 => Clown f a a0 -> a0 # | |
| Foldable (f a) => Foldable (FromStringShow2 f a) | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromStringShow2 f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FromStringShow2 f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FromStringShow2 f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FromStringShow2 f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FromStringShow2 f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FromStringShow2 f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FromStringShow2 f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FromStringShow2 f a a0 -> a0 # toList :: FromStringShow2 f a a0 -> [a0] # null :: FromStringShow2 f a a0 -> Bool # length :: FromStringShow2 f a a0 -> Int # elem :: Eq a0 => a0 -> FromStringShow2 f a a0 -> Bool # maximum :: Ord a0 => FromStringShow2 f a a0 -> a0 # minimum :: Ord a0 => FromStringShow2 f a a0 -> a0 # sum :: Num a0 => FromStringShow2 f a a0 -> a0 # product :: Num a0 => FromStringShow2 f a a0 -> a0 # | |
| Foldable (f a) => Foldable (FromTextShow2 f a) | |
Defined in TextShow.FromStringTextShow Methods fold :: Monoid m => FromTextShow2 f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FromTextShow2 f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FromTextShow2 f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FromTextShow2 f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FromTextShow2 f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FromTextShow2 f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FromTextShow2 f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FromTextShow2 f a a0 -> a0 # toList :: FromTextShow2 f a a0 -> [a0] # null :: FromTextShow2 f a a0 -> Bool # length :: FromTextShow2 f a a0 -> Int # elem :: Eq a0 => a0 -> FromTextShow2 f a a0 -> Bool # maximum :: Ord a0 => FromTextShow2 f a a0 -> a0 # minimum :: Ord a0 => FromTextShow2 f a a0 -> a0 # sum :: Num a0 => FromTextShow2 f a a0 -> a0 # product :: Num a0 => FromTextShow2 f a a0 -> a0 # | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # toList :: Tannen f p a a0 -> [a0] # null :: Tannen f p a a0 -> Bool # length :: Tannen f p a a0 -> Int # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool # maximum :: Ord a0 => Tannen f p a a0 -> a0 # minimum :: Ord a0 => Tannen f p a a0 -> a0 # | |
| (Bifoldable p, Foldable g) => Foldable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # toList :: Biff p f g a a0 -> [a0] # null :: Biff p f g a a0 -> Bool # length :: Biff p f g a a0 -> Int # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool # maximum :: Ord a0 => Biff p f g a a0 -> a0 # minimum :: Ord a0 => Biff p f g a a0 -> a0 # | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Functors representing data structures that can be traversed from left to right.
A definition of traverse must satisfy the following laws:
- naturality
t .for every applicative transformationtraversef =traverse(t . f)t- identity
traverseIdentity = Identity- composition
traverse(Compose .fmapg . f) = Compose .fmap(traverseg) .traversef
A definition of sequenceA must satisfy the following laws:
- naturality
t .for every applicative transformationsequenceA=sequenceA.fmaptt- identity
sequenceA.fmapIdentity = Identity- composition
sequenceA.fmapCompose = Compose .fmapsequenceA.sequenceA
where an applicative transformation is a function
t :: (Applicative f, Applicative g) => f a -> g a
preserving the Applicative operations, i.e.
and the identity functor Identity and composition of functors Compose
are defined as
newtype Identity a = Identity a
instance Functor Identity where
fmap f (Identity x) = Identity (f x)
instance Applicative Identity where
pure x = Identity x
Identity f <*> Identity x = Identity (f x)
newtype Compose f g a = Compose (f (g a))
instance (Functor f, Functor g) => Functor (Compose f g) where
fmap f (Compose x) = Compose (fmap (fmap f) x)
instance (Applicative f, Applicative g) => Applicative (Compose f g) where
pure x = Compose (pure (pure x))
Compose f <*> Compose x = Compose ((<*>) <$> f <*> x)(The naturality law is implied by parametricity.)
Instances are similar to Functor, e.g. given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Traversable Tree where traverse f Empty = pure Empty traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r
This is suitable even for abstract types, as the laws for <*>
imply a form of associativity.
The superclass instances should satisfy the following:
- In the
Functorinstance,fmapshould be equivalent to traversal with the identity applicative functor (fmapDefault). - In the
Foldableinstance,foldMapshould be equivalent to traversal with a constant applicative functor (foldMapDefault).
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
Map each element of a structure to an action, evaluate these actions
from left to right, and collect the results. For a version that ignores
the results see traverse_.
sequenceA :: Applicative f => t (f a) -> f (t a) #
Evaluate each action in the structure from left to right, and
collect the results. For a version that ignores the results
see sequenceA_.
mapM :: Monad m => (a -> m b) -> t a -> m (t b) #
Map each element of a structure to a monadic action, evaluate
these actions from left to right, and collect the results. For
a version that ignores the results see mapM_.
sequence :: Monad m => t (m a) -> m (t a) #
Evaluate each monadic action in the structure from left to
right, and collect the results. For a version that ignores the
results see sequence_.
Instances
The class of semigroups (types with an associative binary operation).
Instances should satisfy the associativity law:
Since: base-4.9.0.0
Instances
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:
x
<>mempty= xmempty<>x = xx(<>(y<>z) = (x<>y)<>zSemigrouplaw)mconcat=foldr'(<>)'mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtypes and make those instances
of Monoid, e.g. Sum and Product.
NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.
Minimal complete definition
Methods
Identity of mappend
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = '(<>)'
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
Instances
| Monoid Ordering | Since: base-2.1 |
| Monoid () | Since: base-2.1 |
| Monoid All | Since: base-2.1 |
| Monoid Any | Since: base-2.1 |
| Monoid ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods mappend :: ShortByteString -> ShortByteString -> ShortByteString # mconcat :: [ShortByteString] -> ShortByteString # | |
| Monoid ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid ByteString | |
Defined in Data.ByteString.Internal Methods mempty :: ByteString # mappend :: ByteString -> ByteString -> ByteString # mconcat :: [ByteString] -> ByteString # | |
| Monoid Builder | |
| Monoid IntSet | |
| Monoid PluginRecompile | |
Defined in Plugins Methods mappend :: PluginRecompile -> PluginRecompile -> PluginRecompile # mconcat :: [PluginRecompile] -> PluginRecompile # | |
| Monoid Builder | |
| Monoid Doc | |
| Monoid ByteArray | |
| Monoid PromDPatInfos | |
| Monoid ULetDecEnv | |
| a :=> (Monoid (Dict a)) | |
| () :=> (Monoid [a]) | |
Defined in Data.Constraint | |
| () :=> (Monoid Ordering) | |
| () :=> (Monoid ()) | |
Defined in Data.Constraint | |
| Monoid [a] | Since: base-2.1 |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Monoid a => Monoid (IO a) | Since: base-4.9.0.0 |
| Monoid p => Monoid (Par1 p) | Since: base-4.12.0.0 |
| Monoid (Predicate a) | |
| Monoid (Comparison a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Comparison a # mappend :: Comparison a -> Comparison a -> Comparison a # mconcat :: [Comparison a] -> Comparison a # | |
| Monoid (Equivalence a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a # mappend :: Equivalence a -> Equivalence a -> Equivalence a # mconcat :: [Equivalence a] -> Equivalence a # | |
| (Ord a, Bounded a) => Monoid (Min a) | Since: base-4.9.0.0 |
| (Ord a, Bounded a) => Monoid (Max a) | Since: base-4.9.0.0 |
| Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
| Semigroup a => Monoid (Option a) | Since: base-4.9.0.0 |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| Monoid (First a) | Since: base-2.1 |
| Monoid (Last a) | Since: base-2.1 |
| Monoid a => Monoid (Dual a) | Since: base-2.1 |
| Monoid (Endo a) | Since: base-2.1 |
| Num a => Monoid (Sum a) | Since: base-2.1 |
| Num a => Monoid (Product a) | Since: base-2.1 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| Monoid (PutM ()) | |
| a => Monoid (Dict a) | |
| Monoid (IntMap a) | |
| Monoid (Seq a) | |
| Ord a => Monoid (Set a) | |
| Prim a => Monoid (Vector a) | |
| Storable a => Monoid (Vector a) | |
| (Hashable a, Eq a) => Monoid (HashSet a) | |
| Monoid (Vector a) | |
| Ord a => Monoid (Min a) | |
| Ord a => Monoid (Max a) | |
| Monoid (Leftmost a) | |
| Monoid (Rightmost a) | |
| Monoid (Doc a) | |
| Monoid (PrimArray a) | Since: primitive-0.6.4.0 |
| Monoid (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods mempty :: SmallArray a # mappend :: SmallArray a -> SmallArray a -> SmallArray a # mconcat :: [SmallArray a] -> SmallArray a # | |
| Monoid (Array a) | |
| Monoid (MergeSet a) | |
| Class (Semigroup a) (Monoid a) | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| (Monoid a) :=> (Monoid (Const a b)) | |
| (Monoid a) :=> (Monoid (Identity a)) | |
| (Monoid a) :=> (Monoid (IO a)) | |
| (Monoid a) :=> (Applicative ((,) a)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| Monoid b => Monoid (a -> b) | Since: base-2.1 |
| Monoid (U1 p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b) => Monoid (a, b) | Since: base-2.1 |
| Monoid a => Monoid (ST s a) | Since: base-4.11.0.0 |
| Monoid a => Monoid (Op a b) | |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Ord k => Monoid (Map k v) | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | |
| Monoid (ReifiedFold s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a # mconcat :: [ReifiedFold s a] -> ReifiedFold s a # | |
| (Contravariant f, Applicative f) => Monoid (Folding f a) | |
| Applicative f => Monoid (Traversed a f) | |
| (Apply f, Applicative f) => Monoid (TraversedF a f) | |
Defined in Control.Lens.Internal.Fold Methods mempty :: TraversedF a f # mappend :: TraversedF a f -> TraversedF a f -> TraversedF a f # mconcat :: [TraversedF a f] -> TraversedF a f # | |
| Monad m => Monoid (Sequenced a m) | |
| Monoid (f a) => Monoid (Indexing f a) |
|
| Monoid (Deepening i a) | This is an illegal |
| (Monoid a, Monoid b) :=> (Monoid (a, b)) | |
| Monoid (f p) => Monoid (Rec1 f p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | Since: base-2.1 |
| Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Monoid a) => Monoid (Ap f a) | Since: base-4.12.0.0 |
| Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
| (Semigroup a, Monoid a) => Monoid (Tagged s a) | |
| Monoid (ReifiedIndexedFold i s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a # | |
| Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) | |
Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s # | |
| Monoid a => Monoid (Constant a b) | |
| Monoid (BiSignalOut defaultState dom n) Source # | Monoid instance to support concatenating NB Not synthesizable |
Defined in Clash.Signal.BiSignal Methods mempty :: BiSignalOut defaultState dom n # mappend :: BiSignalOut defaultState dom n -> BiSignalOut defaultState dom n -> BiSignalOut defaultState dom n # mconcat :: [BiSignalOut defaultState dom n] -> BiSignalOut defaultState dom n # | |
| Monoid c => Monoid (K1 i c p) | Since: base-4.12.0.0 |
| (Monoid (f p), Monoid (g p)) => Monoid ((f :*: g) p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | Since: base-2.1 |
| Monoid (f p) => Monoid (M1 i c f p) | Since: base-4.12.0.0 |
| Monoid (f (g p)) => Monoid ((f :.: g) p) | Since: base-4.12.0.0 |
| (Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | Since: base-2.1 |
| Contravariant g => Monoid (BazaarT p g a b t) | |
Instances
| Bounded Bool | Since: base-2.1 |
| Enum Bool | Since: base-2.1 |
| Eq Bool | |
| Data Bool | Since: base-4.0.0.0 |
Defined in 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 :: (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 # | |
| Ord Bool | |
| Read Bool | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| Ix Bool | Since: base-2.1 |
| Generic Bool | |
| Lift Bool | |
| Testable Bool | |
| Arbitrary Bool | |
| CoArbitrary Bool | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Bool -> Gen b -> Gen b # | |
| SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable | |
| Bits Bool | Interpret Since: base-4.7.0.0 |
Defined in Data.Bits Methods (.&.) :: Bool -> Bool -> Bool # (.|.) :: Bool -> Bool -> Bool # complement :: Bool -> Bool # shift :: Bool -> Int -> Bool # rotate :: Bool -> Int -> Bool # setBit :: Bool -> Int -> Bool # clearBit :: Bool -> Int -> Bool # complementBit :: Bool -> Int -> Bool # testBit :: Bool -> Int -> Bool # bitSizeMaybe :: Bool -> Maybe Int # shiftL :: Bool -> Int -> Bool # unsafeShiftL :: Bool -> Int -> Bool # shiftR :: Bool -> Int -> Bool # unsafeShiftR :: Bool -> Int -> Bool # rotateL :: Bool -> Int -> Bool # | |
| FiniteBits Bool | Since: base-4.7.0.0 |
Defined in Data.Bits Methods finiteBitSize :: Bool -> Int # countLeadingZeros :: Bool -> Int # countTrailingZeros :: Bool -> Int # | |
| Binary Bool | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| Hashable Bool | |
Defined in Data.Hashable.Class | |
| Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
| PShow Bool | |
| SShow Bool | |
| PEnum Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Bool | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: Sing t -> Sing (Apply SuccSym0 t) # sPred :: Sing t -> Sing (Apply PredSym0 t) # sToEnum :: Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Bool | |
| SOrd Bool | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Bool | |
| PEq Bool | |
| NFDataX Bool Source # | |
Defined in Clash.XException | |
| ShowX Bool Source # | |
| BitPack Bool Source # | |
| Parity Bool Source # | |
| Bundle Bool Source # | |
| Bundle Bool Source # | |
| AutoReg Bool Source # | |
Defined in Clash.Class.AutoReg.Internal | |
| IArray UArray Bool | |
Defined in Data.Array.Base Methods bounds :: Ix i => UArray i Bool -> (i, i) # numElements :: Ix i => UArray i Bool -> Int unsafeArray :: Ix i => (i, i) -> [(Int, Bool)] -> UArray i Bool unsafeAt :: Ix i => UArray i Bool -> Int -> Bool unsafeReplace :: Ix i => UArray i Bool -> [(Int, Bool)] -> UArray i Bool unsafeAccum :: Ix i => (Bool -> e' -> Bool) -> UArray i Bool -> [(Int, e')] -> UArray i Bool unsafeAccumArray :: Ix i => (Bool -> e' -> Bool) -> Bool -> (i, i) -> [(Int, e')] -> UArray i Bool | |
| SingI False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Vector Vector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # | |
| 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 :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) # | |
| LockStep Bool c Source # | |
| () :=> (Bounded Bool) | |
| () :=> (Enum Bool) | |
| () :=> (Eq Bool) | |
| () :=> (Ord Bool) | |
| () :=> (Read Bool) | |
| () :=> (Show Bool) | |
| () :=> (Bits Bool) | |
| MArray (STUArray s) Bool (ST s) | |
Defined in Data.Array.Base Methods getBounds :: Ix i => STUArray s i Bool -> ST s (i, i) # getNumElements :: Ix i => STUArray s i Bool -> ST s Int newArray :: Ix i => (i, i) -> Bool -> ST s (STUArray s i Bool) # newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool) # unsafeNewArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool) unsafeRead :: Ix i => STUArray s i Bool -> Int -> ST s Bool unsafeWrite :: Ix i => STUArray s i Bool -> Int -> Bool -> ST s () | |
| Clocks (Clock c1, Signal pllLock Bool) Source # | |
| SuppressUnusedWarnings NotSym0 | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680105191Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679846452Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680105185Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680611496Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI NotSym0 | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
| SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 # | |
| SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SuppressUnusedWarnings ((||@#@$$) a6989586621679798527 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((&&@#@$$) a6989586621679797931 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846452Sym1 a6989586621679846450 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679948674 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611496Sym1 a6989586621680611492 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679948708 () ~> f6989586621679948708 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621681072693 () ~> f6989586621681072693 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680581488] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680581511] ([a6989586621680581511] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621680319480] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621680319445] ([a6989586621680319445] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621680319446] ([a6989586621680319446] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621680319444] ([a6989586621680319444] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680066246) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680066248) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680581499 ([a6989586621680581499] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680319442 ([a6989586621680319442] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680319443 ([a6989586621680319443] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680728485 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729054Scrutinee_6989586621680728812Sym0 :: TyFun (t6989586621680728565 Bool) All -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729045Scrutinee_6989586621680728814Sym0 :: TyFun (t6989586621680728565 Bool) Any -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720382Scrutinee_6989586621680720320Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720355Scrutinee_6989586621680720318Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680728486 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679803559 (k6989586621679803559 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679803565 (a6989586621679803565 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679803565 (a6989586621679803565 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679796791 (a6989586621679796791 ~> (Bool ~> a6989586621679796791)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832329Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832308Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832278Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832258Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832360Scrutinee_6989586621679831995Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832339Scrutinee_6989586621679831993Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832222Scrutinee_6989586621679831970Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832212Scrutinee_6989586621679831968Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680899930Sym0 :: TyFun a6989586621680728582 (Identity a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680900077Sym0 :: TyFun (Identity a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680581517 ~> Bool) ([a6989586621680581517] ~> [a6989586621680581517]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680581515 ~> Bool) ([a6989586621680581515] ~> ([a6989586621680581515], [a6989586621680581515])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680581513 ~> Bool) ([a6989586621680581513] ~> ([a6989586621680581513], [a6989586621680581513])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680581505 ~> (a6989586621680581505 ~> Bool)) ([a6989586621680581505] ~> [a6989586621680581505]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680581514 ~> Bool) ([a6989586621680581514] ~> [a6989586621680581514]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680581516 ~> Bool) ([a6989586621680581516] ~> [a6989586621680581516]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621680319359 ~> (a6989586621680319359 ~> Bool)) ([a6989586621680319359] ~> ([a6989586621680319359] ~> [a6989586621680319359])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621680319386 ~> Bool) ([a6989586621680319386] ~> [a6989586621680319386]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621680319383 ~> Bool) ([a6989586621680319383] ~> ([a6989586621680319383], [a6989586621680319383])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621680319369 ~> Bool) (a6989586621680319369 ~> (([a6989586621680319369], [a6989586621680319369]) ~> ([a6989586621680319369], [a6989586621680319369]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621680319370 ~> Bool) ([a6989586621680319370] ~> ([a6989586621680319370], [a6989586621680319370])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621680319361 ~> (a6989586621680319361 ~> Bool)) ([a6989586621680319361] ~> [a6989586621680319361]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328844ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328844YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328844X_6989586621680328845Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328801ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328801YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328801X_6989586621680328802Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621680319387 ~> (a6989586621680319387 ~> Bool)) ([a6989586621680319387] ~> ([a6989586621680319387] ~> [a6989586621680319387])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621680319373 ~> (a6989586621680319373 ~> Bool)) ([a6989586621680319373] ~> [[a6989586621680319373]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680319393 ~> Bool) ([a6989586621680319393] ~> Maybe a6989586621680319393) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621680319389 ~> Bool) ([a6989586621680319389] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680319390 ~> Bool) ([a6989586621680319390] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621680319394 ~> Bool) ([a6989586621680319394] ~> [a6989586621680319394]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621680319360 ~> (a6989586621680319360 ~> Bool)) (a6989586621680319360 ~> ([a6989586621680319360] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621680319385 ~> Bool) ([a6989586621680319385] ~> [a6989586621680319385]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621680319384 ~> Bool) ([a6989586621680319384] ~> [a6989586621680319384]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621680319399 ~> (a6989586621680319399 ~> Bool)) ([a6989586621680319399] ~> ([a6989586621680319399] ~> [a6989586621680319399])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621680319400 ~> (a6989586621680319400 ~> Bool)) (a6989586621680319400 ~> ([a6989586621680319400] ~> [a6989586621680319400])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621680319382 ~> Bool) ([a6989586621680319382] ~> ([a6989586621680319382], [a6989586621680319382])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680319463 ~> Bool) ([a6989586621680319463] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680319464 ~> Bool) ([a6989586621680319464] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679807805 ~> Bool) ((a6989586621679807805 ~> a6989586621679807805) ~> (a6989586621679807805 ~> a6989586621679807805)) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) # | |
| SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 # | |
| SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
| SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
| SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 # | |
| SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 # | |
| SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
| SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
| SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 # | |
| SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 # | |
| SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 # | |
| SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 # | |
| SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 # | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 # | |
| SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 # | |
| SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 # | |
| SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
| SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680584651 :: TyFun [a6989586621680581511] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym1 a6989586621680584566 :: TyFun [a6989586621680581499] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680329326 :: TyFun [a6989586621680319442] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680329951 :: TyFun [a6989586621680319445] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680329360 :: TyFun [a6989586621680319446] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680329598 :: TyFun [a6989586621680319444] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680329333 :: TyFun [a6989586621680319443] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680329591 :: TyFun [a6989586621680319463] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680329646 :: TyFun [a6989586621680319464] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679871408 b6989586621679871412) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679871414 b6989586621679871415) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328673Scrutinee_6989586621680320061Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym1 a6989586621680328618 :: TyFun a6989586621680319360 ([a6989586621680319360] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680728476 (t6989586621680728475 a6989586621680728476 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720382Scrutinee_6989586621680720320Sym1 x6989586621680720375 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720355Scrutinee_6989586621680720318Sym1 x6989586621680720348 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680730282Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680730115Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729948Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729611Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729491Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym1 a6989586621679803560 :: TyFun k6989586621679803559 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$$) x6989586621679803566 :: TyFun a6989586621679803565 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$$) x6989586621679803568 :: TyFun a6989586621679803565 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym1 a6989586621679796836 :: TyFun a6989586621679796791 (Bool ~> a6989586621679796791) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832329Sym1 a6989586621679832327 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832308Sym1 a6989586621679832306 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832278Sym1 a6989586621679832276 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679832258Sym1 a6989586621679832256 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832360Scrutinee_6989586621679831995Sym1 x6989586621679832358 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832339Scrutinee_6989586621679831993Sym1 x6989586621679832337 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832222Scrutinee_6989586621679831970Sym1 x6989586621679832209 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832212Scrutinee_6989586621679831968Sym1 x6989586621679832209 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$$) arg6989586621679832184 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$$) arg6989586621679832189 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$$) arg6989586621679832174 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$$) arg6989586621679832180 :: TyFun a6989586621679831948 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681120131Sym0 :: TyFun (Arg a6989586621681110463 b6989586621681110464) (Arg a6989586621681110463 b6989586621681110464 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680899930Sym1 a6989586621680899928 :: TyFun (Identity a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328876ZsSym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] [a6989586621680319383] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328876YsSym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] [a6989586621680319383] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328876X_6989586621680328877Sym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] ([a6989586621680319383], [a6989586621680319383]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328634NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680329967Sym0 :: TyFun (a6989586621680319480 ~> Bool) (TyFun k (TyFun a6989586621680319480 (TyFun [a6989586621680319480] [a6989586621680319480] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729035Scrutinee_6989586621680728816Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) Any -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729022Scrutinee_6989586621680728818Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) All -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680728937Scrutinee_6989586621680728824Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) (First a6989586621680728568) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680728938Sym0 :: TyFun (a6989586621679077271 ~> Bool) (TyFun k (TyFun a6989586621679077271 (First a6989586621679077271) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680728484 ~> Bool) (t6989586621680728483 a6989586621680728484 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680728482 ~> Bool) (t6989586621680728481 a6989586621680728482 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679808731GoSym0 :: TyFun (k2 ~> Bool) (TyFun (k2 ~> k2) (TyFun k1 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621681072689 ~> Bool) (m6989586621681072688 a6989586621681072689 ~> m6989586621681072688 a6989586621681072689) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621681072727 ~> m6989586621681072726 Bool) ([a6989586621681072727] ~> m6989586621681072726 [a6989586621681072727]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 # | |
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| (SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 # | |
| SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 # | |
| SuppressUnusedWarnings (Bool_Sym2 a6989586621679796837 a6989586621679796836 :: TyFun Bool a6989586621679796791 -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym2 a6989586621680328619 a6989586621680328618 :: TyFun [a6989586621680319360] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329352Scrutinee_6989586621680320065Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328770Scrutinee_6989586621680320045Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328756Scrutinee_6989586621680320047Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328741Scrutinee_6989586621680320057Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328673Scrutinee_6989586621680320061Sym1 n6989586621680328671 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328660Scrutinee_6989586621680320063Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680730405Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680730238Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680730071Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680729925Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680729749Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680729454Sym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680728565 a6989586621680728580) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680728958 t6989586621680728475 :: TyFun (t6989586621680728475 a6989586621680728476) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680729441Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680730282Sym1 a6989586621680730280 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680730115Sym1 a6989586621680730113 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729948Sym1 a6989586621680729946 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729611Sym1 a6989586621680729609 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680729491Sym1 a6989586621680729489 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 arg6989586621680729232 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680729029 t6989586621680728483 :: TyFun (t6989586621680728483 a6989586621680728484) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680729016 t6989586621680728481 :: TyFun (t6989586621680728481 a6989586621680728482) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077970Sym0 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun Bool (TyFun [k3] [k3] -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681120131Sym1 a6989586621681120127 :: TyFun (Arg a6989586621681110463 b6989586621681110464) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329971Scrutinee_6989586621680320039Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328644Scrutinee_6989586621680320067Sym0 :: TyFun (k3 ~> (k3 ~> Bool)) (TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077967Sym0 :: TyFun (k3 ~> f6989586621679948779 Bool) (TyFun k2 (TyFun k3 (TyFun (f6989586621679948779 [k3]) (f6989586621679948779 [k3]) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077648Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679948819 k1) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d t) # | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (Let6989586621680329971Scrutinee_6989586621680320039Sym1 p6989586621680329965 :: TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329352Scrutinee_6989586621680320065Sym1 l6989586621680329342 :: TyFun k2 (TyFun k1 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328770Scrutinee_6989586621680320045Sym1 n6989586621680328767 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328756Scrutinee_6989586621680320047Sym1 n6989586621680328753 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328741Scrutinee_6989586621680320057Sym1 key6989586621680328737 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328660Scrutinee_6989586621680320063Sym1 x6989586621680328657 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328644Scrutinee_6989586621680320067Sym1 eq6989586621680328632 :: TyFun k1 (TyFun k3 (TyFun k2 (TyFun [k3] Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680074069Scrutinee_6989586621680073731Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680729441Sym1 a_69895866216807294366989586621680729440 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077970Sym1 p6989586621681077965 :: TyFun k2 (TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329971Scrutinee_6989586621680320039Sym2 x6989586621680329969 p6989586621680329965 :: TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329352Scrutinee_6989586621680320065Sym2 x6989586621680329349 l6989586621680329342 :: TyFun k1 (TyFun [k2] Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328770Scrutinee_6989586621680320045Sym2 x6989586621680328768 n6989586621680328767 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328756Scrutinee_6989586621680320047Sym2 x6989586621680328754 n6989586621680328753 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328741Scrutinee_6989586621680320057Sym2 x6989586621680328738 key6989586621680328737 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328660Scrutinee_6989586621680320063Sym2 xs6989586621680328658 x6989586621680328657 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328644Scrutinee_6989586621680320067Sym2 l6989586621680328633 eq6989586621680328632 :: TyFun k3 (TyFun k1 (TyFun [k3] Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680074069Scrutinee_6989586621680073731Sym1 x06989586621680074059 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym0 :: TyFun k2 (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680729441Sym2 t6989586621680729448 a_69895866216807294366989586621680729440 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077970Sym2 x6989586621681077969 p6989586621681077965 :: TyFun k1 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680329626Sym0 :: TyFun (b6989586621679948823 ~> (a6989586621680319463 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680319463 (TyFun [a6989586621680319463] (TyFun b6989586621679948823 (m6989586621679948819 b6989586621679948823) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681077970Sym3 a_69895866216810779636989586621681077966 x6989586621681077969 p6989586621681077965 :: TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329352Scrutinee_6989586621680320065Sym3 xs6989586621680329350 x6989586621680329349 l6989586621680329342 :: TyFun [k2] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329971Scrutinee_6989586621680320039Sym3 xs6989586621680329970 x6989586621680329969 p6989586621680329965 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328741Scrutinee_6989586621680320057Sym3 y6989586621680328739 x6989586621680328738 key6989586621680328737 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328644Scrutinee_6989586621680320067Sym3 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun k1 (TyFun [k3] Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680074069Scrutinee_6989586621680073731Sym2 y6989586621680074060 x06989586621680074059 :: TyFun k3 (TyFun k1 (TyFun k2 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym1 x16989586621680073983 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym1 x16989586621680073924 :: TyFun k1 (TyFun k5 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680328644Scrutinee_6989586621680320067Sym4 ys6989586621680328642 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun [k3] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680074069Scrutinee_6989586621680073731Sym3 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym2 x26989586621680073984 x16989586621680073983 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym2 x26989586621680073925 x16989586621680073924 :: TyFun k5 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680074069Scrutinee_6989586621680073731Sym4 arg_69895866216800737276989586621680074055 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym3 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym3 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym4 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym4 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k1 (TyFun k2 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073988Scrutinee_6989586621680073758Sym5 arg_69895866216800737546989586621680073979 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680073929Scrutinee_6989586621680073772Sym5 arg_69895866216800737686989586621680073920 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| Clocks (Clock c1, Clock c2, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks Associated Types type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool) :: Constraint Source # Methods clocks :: (KnownDomain domIn, ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool)) => Clock domIn -> Reset domIn -> (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool) Source # | |
| type Rep Bool | Since: base-4.6.0.0 |
| data Sing (a :: Bool) | |
| type DemoteRep Bool | |
Defined in GHC.Generics | |
| newtype Vector Bool | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680064457Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680064452Sym0 | |
| data Sing (a :: Bool) | |
| type Demote Bool | |
Defined in Data.Singletons.Prelude.Instances | |
| type BitSize Bool Source # | |
Defined in Clash.Class.BitPack | |
| type Show_ (arg :: Bool) | |
| type FromEnum (a :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg :: Bool) | |
| type Succ (arg :: Bool) | |
| newtype MVector s Bool | |
| type TryDomain t Bool Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| type Unbundled dom Bool Source # | |
Defined in Clash.Signal.Bundle | |
| type ShowList (arg1 :: [Bool]) arg2 | |
| type EnumFromTo (arg1 :: Bool) (arg2 :: Bool) | |
| type Min (arg1 :: Bool) (arg2 :: Bool) | |
| type Max (arg1 :: Bool) (arg2 :: Bool) | |
| type (arg1 :: Bool) >= (arg2 :: Bool) | |
| type (arg1 :: Bool) > (arg2 :: Bool) | |
| type (arg1 :: Bool) <= (arg2 :: Bool) | |
| type (arg1 :: Bool) < (arg2 :: Bool) | |
| type Compare (a1 :: Bool) (a2 :: Bool) | |
| type (x :: Bool) /= (y :: Bool) | |
| type (a :: Bool) == (b :: Bool) | |
Defined in Data.Singletons.Prelude.Eq | |
| type Unbundled dom d Bool Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| type ShowsPrec a1 (a2 :: Bool) a3 | |
| type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) | |
| type Apply NotSym0 (a6989586621679799100 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply ToEnum_6989586621680105185Sym0 (a6989586621680105184 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply GetAllSym0 (a6989586621680207694 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAnySym0 (a6989586621680207707 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply FromEnum_6989586621680105191Sym0 (a6989586621680105190 :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply All_Sym0 (a6989586621680244899 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AllSym0 (t6989586621680207697 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Any_Sym0 (a6989586621680244898 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AnySym0 (t6989586621680207711 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ((||@#@$$) a6989586621679798527 :: TyFun Bool Bool -> Type) (b6989586621679798528 :: Bool) | |
| type Apply ((&&@#@$$) a6989586621679797931 :: TyFun Bool Bool -> Type) (b6989586621679797933 :: Bool) | |
| type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (Compare_6989586621679846452Sym1 a6989586621679846450 :: TyFun Bool Ordering -> Type) (a6989586621679846451 :: Bool) | |
| type Apply (Let6989586621680720355Scrutinee_6989586621680720318Sym1 x6989586621680720348 :: TyFun k1 Bool -> Type) (y6989586621680720349 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680720382Scrutinee_6989586621680720320Sym1 x6989586621680720375 :: TyFun k1 Bool -> Type) (y6989586621680720376 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply ((==@#@$$) x6989586621679803566 :: TyFun a Bool -> Type) (y6989586621679803567 :: a) | |
| type Apply ((/=@#@$$) x6989586621679803568 :: TyFun a Bool -> Type) (y6989586621679803569 :: a) | |
| type Apply (DefaultEqSym1 a6989586621679803560 :: TyFun k Bool -> Type) (b6989586621679803561 :: k) | |
Defined in Data.Singletons.Prelude.Eq | |
| type Apply (Let6989586621679832212Scrutinee_6989586621679831968Sym1 x6989586621679832209 :: TyFun k1 Bool -> Type) (y6989586621679832210 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679832329Sym1 a6989586621679832327 :: TyFun a Bool -> Type) (a6989586621679832328 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679832308Sym1 a6989586621679832306 :: TyFun a Bool -> Type) (a6989586621679832307 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679832278Sym1 a6989586621679832276 :: TyFun a Bool -> Type) (a6989586621679832277 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679832258Sym1 a6989586621679832256 :: TyFun a Bool -> Type) (a6989586621679832257 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<=@#@$$) arg6989586621679832180 :: TyFun a Bool -> Type) (arg6989586621679832181 :: a) | |
| type Apply ((>=@#@$$) arg6989586621679832189 :: TyFun a Bool -> Type) (arg6989586621679832190 :: a) | |
| type Apply ((>@#@$$) arg6989586621679832184 :: TyFun a Bool -> Type) (arg6989586621679832185 :: a) | |
| type Apply (Let6989586621679832360Scrutinee_6989586621679831995Sym1 x6989586621679832358 :: TyFun k1 Bool -> Type) (y6989586621679832359 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832339Scrutinee_6989586621679831993Sym1 x6989586621679832337 :: TyFun k1 Bool -> Type) (y6989586621679832338 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832222Scrutinee_6989586621679831970Sym1 x6989586621679832209 :: TyFun k1 Bool -> Type) (y6989586621679832210 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<@#@$$) arg6989586621679832174 :: TyFun a Bool -> Type) (arg6989586621679832176 :: a) | |
| type Apply (Let6989586621680328673Scrutinee_6989586621680320061Sym1 n6989586621680328671 :: TyFun k Bool -> Type) (x6989586621680328672 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Bool_Sym2 a6989586621679796837 a6989586621679796836 :: TyFun Bool a -> Type) (a6989586621679796838 :: Bool) | |
| type Apply (Let6989586621680328660Scrutinee_6989586621680320063Sym2 xs6989586621680328658 x6989586621680328657 :: TyFun k3 Bool -> Type) (n6989586621680328659 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328756Scrutinee_6989586621680320047Sym2 x6989586621680328754 n6989586621680328753 :: TyFun k3 Bool -> Type) (xs6989586621680328755 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328770Scrutinee_6989586621680320045Sym2 x6989586621680328768 n6989586621680328767 :: TyFun k3 Bool -> Type) (xs6989586621680328769 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680729441Sym2 t6989586621680729448 a_69895866216807294366989586621680729440 :: TyFun k3 Bool -> Type) (t6989586621680729449 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym3 y6989586621680328739 x6989586621680328738 key6989586621680328737 :: TyFun k3 Bool -> Type) (xys6989586621680328740 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym3 y6989586621680328739 x6989586621680328738 key6989586621680328737 :: TyFun k3 Bool -> Type) (xys6989586621680328740 :: k3) = Let6989586621680328741Scrutinee_6989586621680320057 y6989586621680328739 x6989586621680328738 key6989586621680328737 xys6989586621680328740 | |
| type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym3 xs6989586621680329970 x6989586621680329969 p6989586621680329965 :: TyFun k Bool -> Type) (a_69895866216803299636989586621680329966 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym3 xs6989586621680329970 x6989586621680329969 p6989586621680329965 :: TyFun k Bool -> Type) (a_69895866216803299636989586621680329966 :: k) = Let6989586621680329971Scrutinee_6989586621680320039 xs6989586621680329970 x6989586621680329969 p6989586621680329965 a_69895866216803299636989586621680329966 | |
| type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym4 arg_69895866216800737276989586621680074055 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k4 Bool -> Type) (arg_69895866216800737296989586621680074056 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym4 arg_69895866216800737276989586621680074055 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k4 Bool -> Type) (arg_69895866216800737296989586621680074056 :: k4) = Let6989586621680074069Scrutinee_6989586621680073731 arg_69895866216800737276989586621680074055 x6989586621680074068 y6989586621680074060 x06989586621680074059 arg_69895866216800737296989586621680074056 | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym5 arg_69895866216800737686989586621680073920 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k5 Bool -> Type) (arg_69895866216800737706989586621680073921 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym5 arg_69895866216800737686989586621680073920 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k5 Bool -> Type) (arg_69895866216800737706989586621680073921 :: k5) = Let6989586621680073929Scrutinee_6989586621680073772 arg_69895866216800737686989586621680073920 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 arg_69895866216800737706989586621680073921 | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym5 arg_69895866216800737546989586621680073979 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k5 Bool -> Type) (arg_69895866216800737566989586621680073980 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym5 arg_69895866216800737546989586621680073979 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k5 Bool -> Type) (arg_69895866216800737566989586621680073980 :: k5) = Let6989586621680073988Scrutinee_6989586621680073758 arg_69895866216800737546989586621680073979 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 arg_69895866216800737566989586621680073980 | |
| type Eval (Not False) | |
Defined in Fcf.Data.Bool | |
| type Eval (Not True) | |
Defined in Fcf.Data.Bool | |
| type Apply OrSym0 (a6989586621680329653 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply AndSym0 (a6989586621680329657 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680584449 :: [a]) | |
| type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680329957 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680067087 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680067098 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680729051 :: t Bool) | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680729042 :: t Bool) | |
| type Apply (Null_6989586621680900077Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680900076 :: Identity a) | |
| type Apply (Let6989586621680729054Scrutinee_6989586621680728812Sym0 :: TyFun (t6989586621680728565 Bool) All -> Type) (x6989586621680729053 :: t6989586621680728565 Bool) | |
| type Apply (Let6989586621680729045Scrutinee_6989586621680728814Sym0 :: TyFun (t6989586621680728565 Bool) Any -> Type) (x6989586621680729044 :: t6989586621680728565 Bool) | |
| type Apply (ListelemSym1 a6989586621680584566 :: TyFun [a] Bool -> Type) (a6989586621680584568 :: [a]) | |
| type Apply (ListisPrefixOfSym1 a6989586621680584651 :: TyFun [a] Bool -> Type) (a6989586621680584652 :: [a]) | |
| type Apply (NotElemSym1 a6989586621680329326 :: TyFun [a] Bool -> Type) (a6989586621680329327 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemSym1 a6989586621680329333 :: TyFun [a] Bool -> Type) (a6989586621680329334 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsPrefixOfSym1 a6989586621680329360 :: TyFun [a] Bool -> Type) (a6989586621680329361 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680329360 :: TyFun [a] Bool -> Type) (a6989586621680329361 :: [a]) = IsPrefixOf a6989586621680329360 a6989586621680329361 | |
| type Apply (AnySym1 a6989586621680329591 :: TyFun [a] Bool -> Type) (a6989586621680329592 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsInfixOfSym1 a6989586621680329598 :: TyFun [a] Bool -> Type) (a6989586621680329599 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AllSym1 a6989586621680329646 :: TyFun [a] Bool -> Type) (a6989586621680329647 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsSuffixOfSym1 a6989586621680329951 :: TyFun [a] Bool -> Type) (a6989586621680329952 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680329951 :: TyFun [a] Bool -> Type) (a6989586621680329952 :: [a]) = IsSuffixOf a6989586621680329951 a6989586621680329952 | |
| type Apply (Elem_6989586621680899930Sym1 a6989586621680899928 :: TyFun (Identity a) Bool -> Type) (a6989586621680899929 :: Identity a) | |
| type Apply (Elem_bySym2 a6989586621680328619 a6989586621680328618 :: TyFun [a] Bool -> Type) (a6989586621680328620 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Elem_6989586621680729491Sym1 a6989586621680729489 t :: TyFun (t a) Bool -> Type) (a6989586621680729490 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680729454Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680729453 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AnySym1 a6989586621680729029 t :: TyFun (t a) Bool -> Type) (a6989586621680729030 :: t a) | |
| type Apply (ElemSym1 arg6989586621680729232 t :: TyFun (t a) Bool -> Type) (arg6989586621680729233 :: t a) | |
| type Apply (NotElemSym1 a6989586621680728958 t :: TyFun (t a) Bool -> Type) (a6989586621680728959 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680729228 :: t a) | |
| type Apply (AllSym1 a6989586621680729016 t :: TyFun (t a) Bool -> Type) (a6989586621680729017 :: t a) | |
| type Apply (Elem_6989586621680729611Sym1 a6989586621680729609 t :: TyFun (t a) Bool -> Type) (a6989586621680729610 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680729749Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680729748 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680729925Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680729924 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680729948Sym1 a6989586621680729946 t :: TyFun (t a) Bool -> Type) (a6989586621680729947 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680730071Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680730070 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680730115Sym1 a6989586621680730113 t :: TyFun (t a) Bool -> Type) (a6989586621680730114 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680730238Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680730237 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680730282Sym1 a6989586621680730280 t :: TyFun (t a) Bool -> Type) (a6989586621680730281 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680730405Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680730404 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym3 xs6989586621680329350 x6989586621680329349 l6989586621680329342 :: TyFun [k1] Bool -> Type) (ls6989586621680329351 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym3 xs6989586621680329350 x6989586621680329349 l6989586621680329342 :: TyFun [k1] Bool -> Type) (ls6989586621680329351 :: [k1]) = Let6989586621680329352Scrutinee_6989586621680320065 xs6989586621680329350 x6989586621680329349 l6989586621680329342 ls6989586621680329351 | |
| type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym4 ys6989586621680328642 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun [k2] Bool -> Type) (xs6989586621680328643 :: [k2]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym4 ys6989586621680328642 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun [k2] Bool -> Type) (xs6989586621680328643 :: [k2]) = Let6989586621680328644Scrutinee_6989586621680320067 ys6989586621680328642 y6989586621680328641 l6989586621680328633 eq6989586621680328632 xs6989586621680328643 | |
| type Eval (Null (a2 ': as) :: Bool -> Type) | |
| type Eval (Null ([] :: [a]) :: Bool -> Type) | |
| type Eval (And lst :: Bool -> Type) | |
| type Eval (Or lst :: Bool -> Type) | |
| type Eval (a <= b :: Bool -> Type) | |
| type Eval (a >= b :: Bool -> Type) | |
| type Eval (a < b :: Bool -> Type) | |
| type Eval (a > b :: Bool -> Type) | |
| type Eval (IsNothing (Nothing :: Maybe a) :: Bool -> Type) | |
| type Eval (IsNothing (Just _a) :: Bool -> Type) | |
| type Eval (IsJust (Nothing :: Maybe a) :: Bool -> Type) | |
| type Eval (IsJust (Just _a) :: Bool -> Type) | |
| type Eval (False || b :: Bool -> Type) | |
| type Eval (True || b :: Bool -> Type) | |
| type Eval (a || False :: Bool -> Type) | |
| type Eval (a || True :: Bool -> Type) | |
| type Eval (False && b :: Bool -> Type) | |
| type Eval (True && b :: Bool -> Type) | |
| type Eval (a && True :: Bool -> Type) | |
| type Eval (a && False :: Bool -> Type) | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679872656 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679872678 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (TFHelper_6989586621681120131Sym1 a6989586621681120127 :: TyFun (Arg a b) Bool -> Type) (a6989586621681120128 :: Arg a b) | |
| type Eval (IsPrefixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
| type Eval (IsSuffixOf xs ys :: Bool -> Type) | |
Defined in Fcf.Data.List | |
| type Eval (IsInfixOf xs ys :: Bool -> Type) | |
| type Eval (Elem a2 as :: Bool -> Type) | |
| type Eval (IsLeft (Right _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsLeft (Left _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsRight (Right _a :: Either a b) :: Bool -> Type) | |
| type Eval (IsRight (Left _a :: Either a b) :: Bool -> Type) | |
| type Eval (TyEq a b :: Bool -> Type) | |
| type Eval (All p lst :: Bool -> Type) | |
| type Eval (Any p lst :: Bool -> Type) | |
| type Apply (GuardSym0 :: TyFun Bool (f6989586621679948674 ()) -> Type) (a6989586621679950002 :: Bool) | |
| type ClocksCxt (Clock c1, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
| type Apply (||@#@$) (a6989586621679798527 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply (&&@#@$) (a6989586621679797931 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply Compare_6989586621679846452Sym0 (a6989586621679846450 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680611496Sym0 (a6989586621680611492 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (<=?@#@$) (a3530822107858468865 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply ShowParenSym0 (a6989586621680584298 :: Bool) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (Let6989586621680720355Scrutinee_6989586621680720318Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680720348 :: k1) | |
| type Apply (Let6989586621680720382Scrutinee_6989586621680720320Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680720375 :: k1) | |
| type Apply (Let6989586621679832212Scrutinee_6989586621679831968Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832209 :: k1) | |
| type Apply (Let6989586621679832360Scrutinee_6989586621679831995Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832358 :: k1) | |
| type Apply (Let6989586621679832339Scrutinee_6989586621679831993Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832337 :: k1) | |
| type Apply (Let6989586621679832222Scrutinee_6989586621679831970Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679832209 :: k1) | |
| type Apply (ListelemSym0 :: TyFun a6989586621680581499 ([a6989586621680581499] ~> Bool) -> Type) (a6989586621680584566 :: a6989586621680581499) | |
| type Apply (NotElemSym0 :: TyFun a6989586621680319442 ([a6989586621680319442] ~> Bool) -> Type) (a6989586621680329326 :: a6989586621680319442) | |
| type Apply (ElemSym0 :: TyFun a6989586621680319443 ([a6989586621680319443] ~> Bool) -> Type) (a6989586621680329333 :: a6989586621680319443) | |
| type Apply (ShowsPrec_6989586621680611496Sym1 a6989586621680611492 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680611494 :: Bool) | |
| type Apply ((==@#@$) :: TyFun a6989586621679803565 (a6989586621679803565 ~> Bool) -> Type) (x6989586621679803566 :: a6989586621679803565) | |
| type Apply ((/=@#@$) :: TyFun a6989586621679803565 (a6989586621679803565 ~> Bool) -> Type) (x6989586621679803568 :: a6989586621679803565) | |
| type Apply (DefaultEqSym0 :: TyFun k6989586621679803559 (k6989586621679803559 ~> Bool) -> Type) (a6989586621679803560 :: k6989586621679803559) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679803559 (k6989586621679803559 ~> Bool) -> Type) (a6989586621679803560 :: k6989586621679803559) = DefaultEqSym1 a6989586621679803560 | |
| type Apply (Bool_Sym0 :: TyFun a6989586621679796791 (a6989586621679796791 ~> (Bool ~> a6989586621679796791)) -> Type) (a6989586621679796836 :: a6989586621679796791) | |
| type Apply (WhenSym0 :: TyFun Bool (f6989586621679948708 () ~> f6989586621679948708 ()) -> Type) (a6989586621679950303 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (TFHelper_6989586621679832329Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (a6989586621679832327 :: a6989586621679831948) | |
| type Apply (TFHelper_6989586621679832308Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (a6989586621679832306 :: a6989586621679831948) | |
| type Apply (TFHelper_6989586621679832278Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (a6989586621679832276 :: a6989586621679831948) | |
| type Apply (TFHelper_6989586621679832258Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (a6989586621679832256 :: a6989586621679831948) | |
| type Apply ((<=@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (arg6989586621679832180 :: a6989586621679831948) | |
| type Apply ((>=@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (arg6989586621679832189 :: a6989586621679831948) | |
| type Apply ((>@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (arg6989586621679832184 :: a6989586621679831948) | |
| type Apply ((<@#@$) :: TyFun a6989586621679831948 (a6989586621679831948 ~> Bool) -> Type) (arg6989586621679832174 :: a6989586621679831948) | |
| type Apply (UnlessSym0 :: TyFun Bool (f6989586621681072693 () ~> f6989586621681072693 ()) -> Type) (a6989586621681077733 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621681072693 () ~> f6989586621681072693 ()) -> Type) (a6989586621681077733 :: Bool) = (UnlessSym1 a6989586621681077733 f6989586621681072693 :: TyFun (f6989586621681072693 ()) (f6989586621681072693 ()) -> Type) | |
| type Apply (Elem_6989586621680899930Sym0 :: TyFun a6989586621680728582 (Identity a6989586621680728582 ~> Bool) -> Type) (a6989586621680899928 :: a6989586621680728582) | |
| type Apply (Let6989586621680328673Scrutinee_6989586621680320061Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680328671 :: k1) | |
| type Apply (Bool_Sym1 a6989586621679796836 :: TyFun a6989586621679796791 (Bool ~> a6989586621679796791) -> Type) (a6989586621679796837 :: a6989586621679796791) | |
| type Apply (Elem_bySym1 a6989586621680328618 :: TyFun a6989586621680319360 ([a6989586621680319360] ~> Bool) -> Type) (a6989586621680328619 :: a6989586621680319360) | |
| type Apply (Elem_6989586621680729491Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729489 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680729491Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729489 :: a6989586621680728582) = (Elem_6989586621680729491Sym1 a6989586621680729489 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
| type Apply (ElemSym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (arg6989586621680729232 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NotElemSym0 :: TyFun a6989586621680728476 (t6989586621680728475 a6989586621680728476 ~> Bool) -> Type) (a6989586621680728958 :: a6989586621680728476) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680728476 (t6989586621680728475 a6989586621680728476 ~> Bool) -> Type) (a6989586621680728958 :: a6989586621680728476) = (NotElemSym1 a6989586621680728958 t6989586621680728475 :: TyFun (t6989586621680728475 a6989586621680728476) Bool -> Type) | |
| type Apply (Elem_6989586621680729611Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729609 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680729611Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729609 :: a6989586621680728582) = (Elem_6989586621680729611Sym1 a6989586621680729609 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
| type Apply (Elem_6989586621680729948Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729946 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680729948Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680729946 :: a6989586621680728582) = (Elem_6989586621680729948Sym1 a6989586621680729946 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
| type Apply (Elem_6989586621680730115Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680730113 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680730115Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680730113 :: a6989586621680728582) = (Elem_6989586621680730115Sym1 a6989586621680730113 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
| type Apply (Elem_6989586621680730282Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680730280 :: a6989586621680728582) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680730282Sym0 :: TyFun a6989586621680728582 (t6989586621680728565 a6989586621680728582 ~> Bool) -> Type) (a6989586621680730280 :: a6989586621680728582) = (Elem_6989586621680730282Sym1 a6989586621680730280 t6989586621680728565 :: TyFun (t6989586621680728565 a6989586621680728582) Bool -> Type) | |
| type Apply (Let6989586621680328660Scrutinee_6989586621680320063Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680328657 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680328737 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680328737 :: k1) = (Let6989586621680328741Scrutinee_6989586621680320057Sym1 key6989586621680328737 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680328756Scrutinee_6989586621680320047Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680328753 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328770Scrutinee_6989586621680320045Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680328767 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680329342 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680329342 :: k1) = (Let6989586621680329352Scrutinee_6989586621680320065Sym1 l6989586621680329342 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680729441Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216807294366989586621680729440 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621681077970Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681077965 :: k1) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681077970Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) -> Type) (p6989586621681077965 :: k1) = (Lambda_6989586621681077970Sym1 p6989586621681077965 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k2] [k2] -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym1 p6989586621680329965 :: TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680329969 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym1 p6989586621680329965 :: TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) (x6989586621680329969 :: k1) = (Let6989586621680329971Scrutinee_6989586621680320039Sym2 p6989586621680329965 x6989586621680329969 :: TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) | |
| type Apply (Let6989586621680328660Scrutinee_6989586621680320063Sym1 x6989586621680328657 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680328658 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym1 key6989586621680328737 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680328738 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym1 key6989586621680328737 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680328738 :: k1) = (Let6989586621680328741Scrutinee_6989586621680320057Sym2 key6989586621680328737 x6989586621680328738 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680328756Scrutinee_6989586621680320047Sym1 n6989586621680328753 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680328754 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328770Scrutinee_6989586621680320045Sym1 n6989586621680328767 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (x6989586621680328768 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym1 eq6989586621680328632 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680328633 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym1 eq6989586621680328632 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) -> Type) (l6989586621680328633 :: k1) = (Let6989586621680328644Scrutinee_6989586621680320067Sym2 eq6989586621680328632 l6989586621680328633 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym1 l6989586621680329342 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680329349 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym1 l6989586621680329342 :: TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) (x6989586621680329349 :: k1) = (Let6989586621680329352Scrutinee_6989586621680320065Sym2 l6989586621680329342 x6989586621680329349 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) | |
| type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680074059 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym0 :: TyFun k1 (TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x06989586621680074059 :: k1) = (Let6989586621680074069Scrutinee_6989586621680073731Sym1 x06989586621680074059 :: TyFun k2 (TyFun k2 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680729441Sym1 a_69895866216807294366989586621680729440 :: TyFun k1 (TyFun k3 Bool -> Type) -> Type) (t6989586621680729448 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621681077970Sym1 p6989586621681077965 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681077969 :: k1) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681077970Sym1 p6989586621681077965 :: TyFun k1 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (x6989586621681077969 :: k1) = (Lambda_6989586621681077970Sym2 p6989586621681077965 x6989586621681077969 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621681077970Sym2 x6989586621681077969 p6989586621681077965 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810779636989586621681077966 :: k3) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681077970Sym2 x6989586621681077969 p6989586621681077965 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216810779636989586621681077966 :: k3) = Lambda_6989586621681077970Sym3 x6989586621681077969 p6989586621681077965 a_69895866216810779636989586621681077966 | |
| type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym2 x6989586621680329349 l6989586621680329342 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680329350 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329352Scrutinee_6989586621680320065Sym2 x6989586621680329349 l6989586621680329342 :: TyFun k3 (TyFun [k1] Bool -> Type) -> Type) (xs6989586621680329350 :: k3) = Let6989586621680329352Scrutinee_6989586621680320065Sym3 x6989586621680329349 l6989586621680329342 xs6989586621680329350 | |
| type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym2 x6989586621680328738 key6989586621680328737 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680328739 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328741Scrutinee_6989586621680320057Sym2 x6989586621680328738 key6989586621680328737 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680328739 :: k2) = (Let6989586621680328741Scrutinee_6989586621680320057Sym3 x6989586621680328738 key6989586621680328737 y6989586621680328739 :: TyFun k3 Bool -> Type) | |
| type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym2 l6989586621680328633 eq6989586621680328632 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680328641 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym2 l6989586621680328633 eq6989586621680328632 :: TyFun k2 (TyFun k3 (TyFun [k2] Bool -> Type) -> Type) -> Type) (y6989586621680328641 :: k2) = (Let6989586621680328644Scrutinee_6989586621680320067Sym3 l6989586621680328633 eq6989586621680328632 y6989586621680328641 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680073924 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680073924 :: k1) = (Let6989586621680073929Scrutinee_6989586621680073772Sym1 x16989586621680073924 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680073983 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680073983 :: k1) = (Let6989586621680073988Scrutinee_6989586621680073758Sym1 x16989586621680073983 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym1 x06989586621680074059 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680074060 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym1 x06989586621680074059 :: TyFun k1 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680074060 :: k1) = (Let6989586621680074069Scrutinee_6989586621680073731Sym2 x06989586621680074059 y6989586621680074060 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym3 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680328642 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym3 y6989586621680328641 l6989586621680328633 eq6989586621680328632 :: TyFun k3 (TyFun [k2] Bool -> Type) -> Type) (ys6989586621680328642 :: k3) = Let6989586621680328644Scrutinee_6989586621680320067Sym4 y6989586621680328641 l6989586621680328633 eq6989586621680328632 ys6989586621680328642 | |
| type Apply (Lambda_6989586621681077970Sym3 a_69895866216810779636989586621681077966 x6989586621681077969 p6989586621681077965 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681077976 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681077970Sym3 a_69895866216810779636989586621681077966 x6989586621681077969 p6989586621681077965 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681077976 :: Bool) = Lambda_6989586621681077970 a_69895866216810779636989586621681077966 x6989586621681077969 p6989586621681077965 t6989586621681077976 | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym1 x16989586621680073924 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680073925 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym1 x16989586621680073924 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680073925 :: k1) = (Let6989586621680073929Scrutinee_6989586621680073772Sym2 x16989586621680073924 x26989586621680073925 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym1 x16989586621680073983 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680073984 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym1 x16989586621680073983 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680073984 :: k1) = (Let6989586621680073988Scrutinee_6989586621680073758Sym2 x16989586621680073983 x26989586621680073984 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym2 y6989586621680074060 x06989586621680074059 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680074068 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym2 y6989586621680074060 x06989586621680074059 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (x6989586621680074068 :: k1) = (Let6989586621680074069Scrutinee_6989586621680073731Sym3 y6989586621680074060 x06989586621680074059 x6989586621680074068 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym2 x26989586621680073925 x16989586621680073924 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680073926 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym2 x26989586621680073925 x16989586621680073924 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680073926 :: k2) = (Let6989586621680073929Scrutinee_6989586621680073772Sym3 x26989586621680073925 x16989586621680073924 y6989586621680073926 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym2 x26989586621680073984 x16989586621680073983 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680073985 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym2 x26989586621680073984 x16989586621680073983 :: TyFun k2 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680073985 :: k2) = (Let6989586621680073988Scrutinee_6989586621680073758Sym3 x26989586621680073984 x16989586621680073983 y6989586621680073985 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym3 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800737276989586621680074055 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680074069Scrutinee_6989586621680073731Sym3 x6989586621680074068 y6989586621680074060 x06989586621680074059 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216800737276989586621680074055 :: k3) = (Let6989586621680074069Scrutinee_6989586621680073731Sym4 x6989586621680074068 y6989586621680074060 x06989586621680074059 arg_69895866216800737276989586621680074055 :: TyFun k4 Bool -> Type) | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym3 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800737666989586621680073919 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym3 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800737666989586621680073919 :: k3) = (Let6989586621680073929Scrutinee_6989586621680073772Sym4 y6989586621680073926 x26989586621680073925 x16989586621680073924 arg_69895866216800737666989586621680073919 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym3 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800737526989586621680073978 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym3 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216800737526989586621680073978 :: k3) = (Let6989586621680073988Scrutinee_6989586621680073758Sym4 y6989586621680073985 x26989586621680073984 x16989586621680073983 arg_69895866216800737526989586621680073978 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
| type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym4 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800737686989586621680073920 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073929Scrutinee_6989586621680073772Sym4 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800737686989586621680073920 :: k4) = (Let6989586621680073929Scrutinee_6989586621680073772Sym5 arg_69895866216800737666989586621680073919 y6989586621680073926 x26989586621680073925 x16989586621680073924 arg_69895866216800737686989586621680073920 :: TyFun k5 Bool -> Type) | |
| type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym4 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800737546989586621680073979 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680073988Scrutinee_6989586621680073758Sym4 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216800737546989586621680073979 :: k4) = (Let6989586621680073988Scrutinee_6989586621680073758Sym5 arg_69895866216800737526989586621680073978 y6989586621680073985 x26989586621680073984 x16989586621680073983 arg_69895866216800737546989586621680073979 :: TyFun k5 Bool -> Type) | |
| type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680581511] ([a6989586621680581511] ~> Bool) -> Type) (a6989586621680584651 :: [a6989586621680581511]) | |
| type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680319446] ([a6989586621680319446] ~> Bool) -> Type) (a6989586621680329360 :: [a6989586621680319446]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680319446] ([a6989586621680319446] ~> Bool) -> Type) (a6989586621680329360 :: [a6989586621680319446]) = IsPrefixOfSym1 a6989586621680329360 | |
| type Apply (IsInfixOfSym0 :: TyFun [a6989586621680319444] ([a6989586621680319444] ~> Bool) -> Type) (a6989586621680329598 :: [a6989586621680319444]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621680319444] ([a6989586621680319444] ~> Bool) -> Type) (a6989586621680329598 :: [a6989586621680319444]) = IsInfixOfSym1 a6989586621680329598 | |
| type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680319445] ([a6989586621680319445] ~> Bool) -> Type) (a6989586621680329951 :: [a6989586621680319445]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680319445] ([a6989586621680319445] ~> Bool) -> Type) (a6989586621680329951 :: [a6989586621680319445]) = IsSuffixOfSym1 a6989586621680329951 | |
| type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym2 x6989586621680329969 p6989586621680329965 :: TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) (xs6989586621680329970 :: [a6989586621680319480]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym2 x6989586621680329969 p6989586621680329965 :: TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) (xs6989586621680329970 :: [a6989586621680319480]) = (Let6989586621680329971Scrutinee_6989586621680320039Sym3 x6989586621680329969 p6989586621680329965 xs6989586621680329970 :: TyFun k Bool -> Type) | |
| type Apply (Let6989586621680328801ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680328788 :: k ~> Bool) | |
| type Apply (Let6989586621680328801YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680328788 :: k ~> Bool) | |
| type Apply (Let6989586621680328801X_6989586621680328802Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680328788 :: k ~> Bool) | |
| type Apply (Let6989586621680328844ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680328831 :: k ~> Bool) | |
| type Apply (Let6989586621680328844YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680328831 :: k ~> Bool) | |
| type Apply (Let6989586621680328844X_6989586621680328845Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680328831 :: k ~> Bool) | |
| type Apply (ListnubBySym0 :: TyFun (a6989586621680581505 ~> (a6989586621680581505 ~> Bool)) ([a6989586621680581505] ~> [a6989586621680581505]) -> Type) (a6989586621680584598 :: a6989586621680581505 ~> (a6989586621680581505 ~> Bool)) | |
| type Apply (ListpartitionSym0 :: TyFun (a6989586621680581513 ~> Bool) ([a6989586621680581513] ~> ([a6989586621680581513], [a6989586621680581513])) -> Type) (a6989586621680584671 :: a6989586621680581513 ~> Bool) | |
| type Apply (ListfilterSym0 :: TyFun (a6989586621680581514 ~> Bool) ([a6989586621680581514] ~> [a6989586621680581514]) -> Type) (a6989586621680584681 :: a6989586621680581514 ~> Bool) | |
| type Apply (ListspanSym0 :: TyFun (a6989586621680581515 ~> Bool) ([a6989586621680581515] ~> ([a6989586621680581515], [a6989586621680581515])) -> Type) (a6989586621680584691 :: a6989586621680581515 ~> Bool) | |
| type Apply (ListdropWhileSym0 :: TyFun (a6989586621680581516 ~> Bool) ([a6989586621680581516] ~> [a6989586621680581516]) -> Type) (a6989586621680584710 :: a6989586621680581516 ~> Bool) | |
| type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680581517 ~> Bool) ([a6989586621680581517] ~> [a6989586621680581517]) -> Type) (a6989586621680584728 :: a6989586621680581517 ~> Bool) | |
| type Apply (NubBySym0 :: TyFun (a6989586621680319361 ~> (a6989586621680319361 ~> Bool)) ([a6989586621680319361] ~> [a6989586621680319361]) -> Type) (a6989586621680328628 :: a6989586621680319361 ~> (a6989586621680319361 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (PartitionSym0 :: TyFun (a6989586621680319370 ~> Bool) ([a6989586621680319370] ~> ([a6989586621680319370], [a6989586621680319370])) -> Type) (a6989586621680328726 :: a6989586621680319370 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621680319370 ~> Bool) ([a6989586621680319370] ~> ([a6989586621680319370], [a6989586621680319370])) -> Type) (a6989586621680328726 :: a6989586621680319370 ~> Bool) = PartitionSym1 a6989586621680328726 | |
| type Apply (BreakSym0 :: TyFun (a6989586621680319382 ~> Bool) ([a6989586621680319382] ~> ([a6989586621680319382], [a6989586621680319382])) -> Type) (a6989586621680328783 :: a6989586621680319382 ~> Bool) | |
| type Apply (SpanSym0 :: TyFun (a6989586621680319383 ~> Bool) ([a6989586621680319383] ~> ([a6989586621680319383], [a6989586621680319383])) -> Type) (a6989586621680328826 :: a6989586621680319383 ~> Bool) | |
| type Apply (GroupBySym0 :: TyFun (a6989586621680319373 ~> (a6989586621680319373 ~> Bool)) ([a6989586621680319373] ~> [[a6989586621680319373]]) -> Type) (a6989586621680328869 :: a6989586621680319373 ~> (a6989586621680319373 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DropWhileSym0 :: TyFun (a6989586621680319385 ~> Bool) ([a6989586621680319385] ~> [a6989586621680319385]) -> Type) (a6989586621680328903 :: a6989586621680319385 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621680319385 ~> Bool) ([a6989586621680319385] ~> [a6989586621680319385]) -> Type) (a6989586621680328903 :: a6989586621680319385 ~> Bool) = DropWhileSym1 a6989586621680328903 | |
| type Apply (TakeWhileSym0 :: TyFun (a6989586621680319386 ~> Bool) ([a6989586621680319386] ~> [a6989586621680319386]) -> Type) (a6989586621680328921 :: a6989586621680319386 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621680319386 ~> Bool) ([a6989586621680319386] ~> [a6989586621680319386]) -> Type) (a6989586621680328921 :: a6989586621680319386 ~> Bool) = TakeWhileSym1 a6989586621680328921 | |
| type Apply (FilterSym0 :: TyFun (a6989586621680319394 ~> Bool) ([a6989586621680319394] ~> [a6989586621680319394]) -> Type) (a6989586621680328935 :: a6989586621680319394 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621680319394 ~> Bool) ([a6989586621680319394] ~> [a6989586621680319394]) -> Type) (a6989586621680328935 :: a6989586621680319394 ~> Bool) = FilterSym1 a6989586621680328935 | |
| type Apply (FindSym0 :: TyFun (a6989586621680319393 ~> Bool) ([a6989586621680319393] ~> Maybe a6989586621680319393) -> Type) (a6989586621680328950 :: a6989586621680319393 ~> Bool) | |
| type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680319399 ~> (a6989586621680319399 ~> Bool)) ([a6989586621680319399] ~> ([a6989586621680319399] ~> [a6989586621680319399])) -> Type) (a6989586621680329019 :: a6989586621680319399 ~> (a6989586621680319399 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680319399 ~> (a6989586621680319399 ~> Bool)) ([a6989586621680319399] ~> ([a6989586621680319399] ~> [a6989586621680319399])) -> Type) (a6989586621680329019 :: a6989586621680319399 ~> (a6989586621680319399 ~> Bool)) = DeleteFirstsBySym1 a6989586621680329019 | |
| type Apply (UnionBySym0 :: TyFun (a6989586621680319359 ~> (a6989586621680319359 ~> Bool)) ([a6989586621680319359] ~> ([a6989586621680319359] ~> [a6989586621680319359])) -> Type) (a6989586621680329032 :: a6989586621680319359 ~> (a6989586621680319359 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndicesSym0 :: TyFun (a6989586621680319389 ~> Bool) ([a6989586621680319389] ~> [Nat]) -> Type) (a6989586621680329276 :: a6989586621680319389 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680319390 ~> Bool) ([a6989586621680319390] ~> Maybe Nat) -> Type) (a6989586621680329310 :: a6989586621680319390 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AnySym0 :: TyFun (a6989586621680319463 ~> Bool) ([a6989586621680319463] ~> Bool) -> Type) (a6989586621680329591 :: a6989586621680319463 ~> Bool) | |
| type Apply (IntersectBySym0 :: TyFun (a6989586621680319387 ~> (a6989586621680319387 ~> Bool)) ([a6989586621680319387] ~> ([a6989586621680319387] ~> [a6989586621680319387])) -> Type) (a6989586621680329604 :: a6989586621680319387 ~> (a6989586621680319387 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621680319387 ~> (a6989586621680319387 ~> Bool)) ([a6989586621680319387] ~> ([a6989586621680319387] ~> [a6989586621680319387])) -> Type) (a6989586621680329604 :: a6989586621680319387 ~> (a6989586621680319387 ~> Bool)) = IntersectBySym1 a6989586621680329604 | |
| type Apply (AllSym0 :: TyFun (a6989586621680319464 ~> Bool) ([a6989586621680319464] ~> Bool) -> Type) (a6989586621680329646 :: a6989586621680319464 ~> Bool) | |
| type Apply (DropWhileEndSym0 :: TyFun (a6989586621680319384 ~> Bool) ([a6989586621680319384] ~> [a6989586621680319384]) -> Type) (a6989586621680329959 :: a6989586621680319384 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621680319384 ~> Bool) ([a6989586621680319384] ~> [a6989586621680319384]) -> Type) (a6989586621680329959 :: a6989586621680319384 ~> Bool) = DropWhileEndSym1 a6989586621680329959 | |
| type Apply (Elem_bySym0 :: TyFun (a6989586621680319360 ~> (a6989586621680319360 ~> Bool)) (a6989586621680319360 ~> ([a6989586621680319360] ~> Bool)) -> Type) (a6989586621680328618 :: a6989586621680319360 ~> (a6989586621680319360 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (SelectSym0 :: TyFun (a6989586621680319369 ~> Bool) (a6989586621680319369 ~> (([a6989586621680319369], [a6989586621680319369]) ~> ([a6989586621680319369], [a6989586621680319369]))) -> Type) (a6989586621680328708 :: a6989586621680319369 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DeleteBySym0 :: TyFun (a6989586621680319400 ~> (a6989586621680319400 ~> Bool)) (a6989586621680319400 ~> ([a6989586621680319400] ~> [a6989586621680319400])) -> Type) (a6989586621680329001 :: a6989586621680319400 ~> (a6989586621680319400 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (UntilSym0 :: TyFun (a6989586621679807805 ~> Bool) ((a6989586621679807805 ~> a6989586621679807805) ~> (a6989586621679807805 ~> a6989586621679807805)) -> Type) (a6989586621679808716 :: a6989586621679807805 ~> Bool) | |
| type Apply (Let6989586621680328634NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680328632 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328876ZsSym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] [a6989586621680319383] -> Type) -> Type) -> Type) (eq6989586621680328873 :: k1 ~> (a6989586621680319383 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328876YsSym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] [a6989586621680319383] -> Type) -> Type) -> Type) (eq6989586621680328873 :: k1 ~> (a6989586621680319383 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680328876X_6989586621680328877Sym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] ([a6989586621680319383], [a6989586621680319383]) -> Type) -> Type) -> Type) (eq6989586621680328873 :: k1 ~> (a6989586621680319383 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328876X_6989586621680328877Sym0 :: TyFun (k1 ~> (a6989586621680319383 ~> Bool)) (TyFun k1 (TyFun [a6989586621680319383] ([a6989586621680319383], [a6989586621680319383]) -> Type) -> Type) -> Type) (eq6989586621680328873 :: k1 ~> (a6989586621680319383 ~> Bool)) = Let6989586621680328876X_6989586621680328877Sym1 eq6989586621680328873 | |
| type Apply (Lambda_6989586621680329967Sym0 :: TyFun (a6989586621680319480 ~> Bool) (TyFun k (TyFun a6989586621680319480 (TyFun [a6989586621680319480] [a6989586621680319480] -> Type) -> Type) -> Type) -> Type) (p6989586621680329965 :: a6989586621680319480 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680329967Sym0 :: TyFun (a6989586621680319480 ~> Bool) (TyFun k (TyFun a6989586621680319480 (TyFun [a6989586621680319480] [a6989586621680319480] -> Type) -> Type) -> Type) -> Type) (p6989586621680329965 :: a6989586621680319480 ~> Bool) = (Lambda_6989586621680329967Sym1 p6989586621680329965 :: TyFun k (TyFun a6989586621680319480 (TyFun [a6989586621680319480] [a6989586621680319480] -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680728938Sym0 :: TyFun (a6989586621679077271 ~> Bool) (TyFun k (TyFun a6989586621679077271 (First a6989586621679077271) -> Type) -> Type) -> Type) (p6989586621680728935 :: a6989586621679077271 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680728938Sym0 :: TyFun (a6989586621679077271 ~> Bool) (TyFun k (TyFun a6989586621679077271 (First a6989586621679077271) -> Type) -> Type) -> Type) (p6989586621680728935 :: a6989586621679077271 ~> Bool) = (Lambda_6989586621680728938Sym1 p6989586621680728935 :: TyFun k (TyFun a6989586621679077271 (First a6989586621679077271) -> Type) -> Type) | |
| type Apply (Let6989586621680729035Scrutinee_6989586621680728816Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) Any -> Type) -> Type) (p6989586621680729033 :: a6989586621680728568 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680729035Scrutinee_6989586621680728816Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) Any -> Type) -> Type) (p6989586621680729033 :: a6989586621680728568 ~> Bool) = (Let6989586621680729035Scrutinee_6989586621680728816Sym1 p6989586621680729033 :: TyFun (t6989586621680728565 a6989586621680728568) Any -> Type) | |
| type Apply (Let6989586621680729022Scrutinee_6989586621680728818Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) All -> Type) -> Type) (p6989586621680729020 :: a6989586621680728568 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680729022Scrutinee_6989586621680728818Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) All -> Type) -> Type) (p6989586621680729020 :: a6989586621680728568 ~> Bool) = (Let6989586621680729022Scrutinee_6989586621680728818Sym1 p6989586621680729020 :: TyFun (t6989586621680728565 a6989586621680728568) All -> Type) | |
| type Apply (Let6989586621680728937Scrutinee_6989586621680728824Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) (First a6989586621680728568) -> Type) -> Type) (p6989586621680728935 :: a6989586621680728568 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680728937Scrutinee_6989586621680728824Sym0 :: TyFun (a6989586621680728568 ~> Bool) (TyFun (t6989586621680728565 a6989586621680728568) (First a6989586621680728568) -> Type) -> Type) (p6989586621680728935 :: a6989586621680728568 ~> Bool) = (Let6989586621680728937Scrutinee_6989586621680728824Sym1 p6989586621680728935 :: TyFun (t6989586621680728565 a6989586621680728568) (First a6989586621680728568) -> Type) | |
| type Apply (Let6989586621679808731GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679808728 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Base | |
| type Apply (FilterMSym0 :: TyFun (a6989586621681072727 ~> m6989586621681072726 Bool) ([a6989586621681072727] ~> m6989586621681072726 [a6989586621681072727]) -> Type) (a6989586621681077959 :: a6989586621681072727 ~> m6989586621681072726 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621681072727 ~> m6989586621681072726 Bool) ([a6989586621681072727] ~> m6989586621681072726 [a6989586621681072727]) -> Type) (a6989586621681077959 :: a6989586621681072727 ~> m6989586621681072726 Bool) = FilterMSym1 a6989586621681077959 | |
| type Apply (AnySym0 :: TyFun (a6989586621680728484 ~> Bool) (t6989586621680728483 a6989586621680728484 ~> Bool) -> Type) (a6989586621680729029 :: a6989586621680728484 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AllSym0 :: TyFun (a6989586621680728482 ~> Bool) (t6989586621680728481 a6989586621680728482 ~> Bool) -> Type) (a6989586621680729016 :: a6989586621680728482 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) (a6989586621680728931 :: a6989586621680728474 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) (a6989586621680728931 :: a6989586621680728474 ~> Bool) = (FindSym1 a6989586621680728931 t6989586621680728473 :: TyFun (t6989586621680728473 a6989586621680728474) (Maybe a6989586621680728474) -> Type) | |
| type Apply (MfilterSym0 :: TyFun (a6989586621681072689 ~> Bool) (m6989586621681072688 a6989586621681072689 ~> m6989586621681072688 a6989586621681072689) -> Type) (a6989586621681077630 :: a6989586621681072689 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621681072689 ~> Bool) (m6989586621681072688 a6989586621681072689 ~> m6989586621681072688 a6989586621681072689) -> Type) (a6989586621681077630 :: a6989586621681072689 ~> Bool) = (MfilterSym1 a6989586621681077630 m6989586621681072688 :: TyFun (m6989586621681072688 a6989586621681072689) (m6989586621681072688 a6989586621681072689) -> Type) | |
| type Apply (TFHelper_6989586621681120131Sym0 :: TyFun (Arg a6989586621681110463 b6989586621681110464) (Arg a6989586621681110463 b6989586621681110464 ~> Bool) -> Type) (a6989586621681120127 :: Arg a6989586621681110463 b6989586621681110464) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680328632 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680328644Scrutinee_6989586621680320067Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680328632 :: k1 ~> (k1 ~> Bool)) = (Let6989586621680328644Scrutinee_6989586621680320067Sym1 eq6989586621680328632 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun [k1] Bool -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680329965 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329971Scrutinee_6989586621680320039Sym0 :: TyFun (k1 ~> Bool) (TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (p6989586621680329965 :: k1 ~> Bool) = (Let6989586621680329971Scrutinee_6989586621680320039Sym1 p6989586621680329965 :: TyFun k1 (TyFun [a6989586621680319480] (TyFun k Bool -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621681077648Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679948819 k1) -> Type) -> Type) -> Type) (p6989586621681077640 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad | |
| type Apply (Lambda_6989586621681077967Sym0 :: TyFun (k2 ~> f6989586621679948779 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679948779 [k2]) (f6989586621679948779 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681077965 :: k2 ~> f6989586621679948779 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681077967Sym0 :: TyFun (k2 ~> f6989586621679948779 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679948779 [k2]) (f6989586621679948779 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681077965 :: k2 ~> f6989586621679948779 Bool) = (Lambda_6989586621681077967Sym1 p6989586621681077965 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679948779 [k2]) (f6989586621679948779 [k2]) -> Type) -> Type) -> Type) | |
| type Apply (Lambda_6989586621680329626Sym0 :: TyFun (b6989586621679948823 ~> (a6989586621680319463 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680319463 (TyFun [a6989586621680319463] (TyFun b6989586621679948823 (m6989586621679948819 b6989586621679948823) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680329610 :: b6989586621679948823 ~> (a6989586621680319463 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680329626Sym0 :: TyFun (b6989586621679948823 ~> (a6989586621680319463 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680319463 (TyFun [a6989586621680319463] (TyFun b6989586621679948823 (m6989586621679948819 b6989586621679948823) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680329610 :: b6989586621679948823 ~> (a6989586621680319463 ~> Bool)) = (Lambda_6989586621680329626Sym1 eq6989586621680329610 :: TyFun k1 (TyFun k2 (TyFun a6989586621680319463 (TyFun [a6989586621680319463] (TyFun b6989586621679948823 (m6989586621679948819 b6989586621679948823) -> Type) -> Type) -> Type) -> Type) -> Type) | |
| type ClocksCxt (Clock c1, Clock c2, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11, KnownDomain c12) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11, KnownDomain c12, KnownDomain c13) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11, KnownDomain c12, KnownDomain c13, KnownDomain c14) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11, KnownDomain c12, KnownDomain c13, KnownDomain c14, KnownDomain c15) | |
| type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Clock c3, Clock c4, Clock c5, Clock c6, Clock c7, Clock c8, Clock c9, Clock c10, Clock c11, Clock c12, Clock c13, Clock c14, Clock c15, Clock c16, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain c3, KnownDomain c4, KnownDomain c5, KnownDomain c6, KnownDomain c7, KnownDomain c8, KnownDomain c9, KnownDomain c10, KnownDomain c11, KnownDomain c12, KnownDomain c13, KnownDomain c14, KnownDomain c15, KnownDomain c16) | |
The character type Char is an enumeration whose values represent
Unicode (or equivalently ISO/IEC 10646) code points (i.e. characters, see
http://www.unicode.org/ for details). This set extends the ISO 8859-1
(Latin-1) character set (the first 256 characters), which is itself an extension
of the ASCII character set (the first 128 characters). A character literal in
Haskell has type Char.
To convert a Char to or from the corresponding Int value defined
by Unicode, use toEnum and fromEnum from the
Enum class respectively (or equivalently ord and chr).
Instances
Double-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE double-precision type.
Instances
Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.
Instances
A fixed-precision integer type with at least the range [-2^29 .. 2^29-1].
The exact range for a given implementation can be determined by using
minBound and maxBound from the Bounded class.
Instances
Invariant: Jn# and Jp# are used iff value doesn't fit in S#
Useful properties resulting from the invariants:
Instances
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| Monad Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
| Applicative Maybe | Since: base-2.1 |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Traversable Maybe | Since: base-2.1 |
| Arbitrary1 Maybe | |
Defined in Test.QuickCheck.Arbitrary | |
| Eq1 Maybe | Since: base-4.9.0.0 |
| Ord1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read1 Maybe | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Show1 Maybe | Since: base-4.9.0.0 |
| Alternative Maybe | Since: base-2.1 |
| MonadPlus Maybe | Since: base-2.1 |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| PTraversable Maybe | |
| STraversable Maybe | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative Maybe | |
| PMonad Maybe | |
| PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SFunctor Maybe | |
| SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad Maybe | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| FunctorWithIndex () Maybe | |
Defined in Control.Lens.Indexed | |
| FoldableWithIndex () Maybe | |
| TraversableWithIndex () Maybe | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f => (() -> a -> f b) -> Maybe a -> f (Maybe b) # itraversed :: IndexedTraversal () (Maybe a) (Maybe b) a b # | |
| () :=> (Functor Maybe) | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (MonadPlus Maybe) | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Data a => Data (Maybe a) | Since: base-4.0.0.0 |
Defined in 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) # toConstr :: Maybe a -> Constr # 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 :: (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) # | |
| Ord a => Ord (Maybe a) | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| Show a => Show (Maybe a) | Since: base-2.1 |
| Generic (Maybe a) | |
| Semigroup a => Semigroup (Maybe a) | Since: base-4.9.0.0 |
| Semigroup a => Monoid (Maybe a) | Lift a semigroup into Since 4.11.0: constraint on inner Since: base-2.1 |
| Lift a => Lift (Maybe a) | |
| Testable prop => Testable (Maybe prop) | |
| Arbitrary a => Arbitrary (Maybe a) | |
| CoArbitrary a => CoArbitrary (Maybe a) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Maybe a -> Gen b -> Gen b # | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Binary a => Binary (Maybe a) | |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| At (Maybe a) | |
| AsEmpty (Maybe a) | |
Defined in Control.Lens.Empty | |
| Recursive (Maybe a) | |
Defined in Data.Functor.Foldable Methods project :: Maybe a -> Base (Maybe a) (Maybe a) # cata :: (Base (Maybe a) a0 -> a0) -> Maybe a -> a0 # para :: (Base (Maybe a) (Maybe a, a0) -> a0) -> Maybe a -> a0 # gpara :: (Corecursive (Maybe a), Comonad w) => (forall b. Base (Maybe a) (w b) -> w (Base (Maybe a) b)) -> (Base (Maybe a) (EnvT (Maybe a) w a0) -> a0) -> Maybe a -> a0 # prepro :: Corecursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (Base (Maybe a) a0 -> a0) -> Maybe a -> a0 # gprepro :: (Corecursive (Maybe a), Comonad w) => (forall b. Base (Maybe a) (w b) -> w (Base (Maybe a) b)) -> (forall c. Base (Maybe a) c -> Base (Maybe a) c) -> (Base (Maybe a) (w a0) -> a0) -> Maybe a -> a0 # | |
| Corecursive (Maybe a) | |
Defined in Data.Functor.Foldable Methods embed :: Base (Maybe a) (Maybe a) -> Maybe a # ana :: (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a # apo :: (a0 -> Base (Maybe a) (Either (Maybe a) a0)) -> a0 -> Maybe a # postpro :: Recursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a # gpostpro :: (Recursive (Maybe a), Monad m) => (forall b. m (Base (Maybe a) b) -> Base (Maybe a) (m b)) -> (forall c. Base (Maybe a) c -> Base (Maybe a) c) -> (a0 -> Base (Maybe a) (m a0)) -> a0 -> Maybe a # | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
| PSemigroup (Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| NFDataX a => NFDataX (Maybe a) Source # | |
Defined in Clash.XException | |
| ShowX a => ShowX (Maybe a) Source # | |
| BitPack a => BitPack (Maybe a) Source # | |
| Bundle (Maybe a) Source # | |
| Bundle (Maybe a) Source # | |
| AutoReg a => AutoReg (Maybe a) Source # | |
Defined in Clash.Class.AutoReg.Internal | |
| Generic1 Maybe | |
| SingI (Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Eq a) :=> (Eq (Maybe a)) | |
| (Ord a) :=> (Ord (Maybe a)) | |
| (Read a) :=> (Read (Maybe a)) | |
| (Show a) :=> (Show (Maybe a)) | |
| (Semigroup a) :=> (Semigroup (Maybe a)) | |
| (Monoid a) :=> (Monoid (Maybe a)) | |
| Each (Maybe a) (Maybe b) a b |
|
| SingI a2 => SingI (Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621680066240] [a6989586621680066240] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621680066241] (Maybe a6989586621680066241) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680445610] ([a6989586621680445610] ~> Maybe [a6989586621680445610]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621680066243) [a6989586621680066243] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621680066246) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621680066248) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621680066245) a6989586621680066245 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680719572) (MinInternal a6989586621680719572) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680718886) (MaxInternal a6989586621680718886) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035976Sym0 :: TyFun (Maybe a6989586621679948885) (Maybe a6989586621679948885 ~> Maybe a6989586621679948885) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679845938Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679058768) (Option a6989586621679058768) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679077246) (Last a6989586621679077246) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679077271) (First a6989586621679077271) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611150Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fail_6989586621680035883Sym0 :: TyFun Symbol (Maybe a6989586621679948825) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621680066244 (Maybe a6989586621680066244 ~> a6989586621680066244) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680319392 ([a6989586621680319392] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680035676Sym0 :: TyFun a6989586621679948780 (Maybe a6989586621679948780) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680035972LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679058768) (Maybe a6989586621679058768) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679077271) (Maybe a6989586621679077271) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679077246) (Maybe a6989586621679077246) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680319393 ~> Bool) ([a6989586621680319393] ~> Maybe a6989586621680319393) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680319390 ~> Bool) ([a6989586621680319390] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 # | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680458320 :: TyFun [a6989586621680445610] (Maybe [a6989586621680445610]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680328950 :: TyFun [a6989586621680319393] (Maybe a6989586621680319393) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680329310 :: TyFun [a6989586621680319390] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680329318 :: TyFun [a6989586621680319392] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621680067052 :: TyFun (Maybe a6989586621680066244) a6989586621680066244 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611150Sym1 a6989586621680611147 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035976Sym1 a6989586621680035974 :: TyFun (Maybe a6989586621679948885) (Maybe a6989586621679948885) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035876Sym0 :: TyFun (Maybe a6989586621679948822) (Maybe b6989586621679948823 ~> Maybe b6989586621679948823) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035860Sym0 :: TyFun (Maybe a6989586621679948820) ((a6989586621679948820 ~> Maybe b6989586621679948821) ~> Maybe b6989586621679948821) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035718Sym0 :: TyFun (Maybe a6989586621679948787) (Maybe b6989586621679948789 ~> Maybe b6989586621679948789) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679845938Sym1 a6989586621679845936 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035688Sym0 :: TyFun (Maybe (a6989586621679948781 ~> b6989586621679948782)) (Maybe a6989586621679948781 ~> Maybe b6989586621679948782) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621680063437 ((a6989586621680063438 ~> b6989586621680063437) ~> (Maybe a6989586621680063438 ~> b6989586621680063437)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680319371 ([(a6989586621680319371, b6989586621680319372)] ~> Maybe b6989586621680319372) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720377NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720377MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720350NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720350MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035547Sym0 :: TyFun a6989586621679948773 (Maybe b6989586621679948775 ~> Maybe a6989586621679948773) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621680962589 a6989586621680962591) (f6989586621680962589 (Maybe a6989586621680962591)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621680066238 ~> Maybe b6989586621680066239) ([a6989586621680066238] ~> [b6989586621680066239]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680319449 ~> Maybe (a6989586621680319450, b6989586621680319449)) (b6989586621680319449 ~> [a6989586621680319450]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680035527Sym0 :: TyFun (a6989586621679948770 ~> b6989586621679948772) (Maybe a6989586621679948770 ~> Maybe b6989586621679948772) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680328732 b6989586621680319372 :: TyFun [(a6989586621680319371, b6989586621680319372)] (Maybe b6989586621680319372) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035876Sym1 a6989586621680035874 b6989586621679948823 :: TyFun (Maybe b6989586621679948823) (Maybe b6989586621679948823) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035718Sym1 a6989586621680035716 b6989586621679948789 :: TyFun (Maybe b6989586621679948789) (Maybe b6989586621679948789) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035688Sym1 a6989586621680035686 :: TyFun (Maybe a6989586621679948781) (Maybe b6989586621679948782) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035547Sym1 a6989586621680035545 b6989586621679948775 :: TyFun (Maybe b6989586621679948775) (Maybe a6989586621679948773) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680035527Sym1 a6989586621680035525 :: TyFun (Maybe a6989586621679948770) (Maybe b6989586621679948772) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720377NSym1 x6989586621680720375 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720377MSym1 x6989586621680720375 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720350NSym1 x6989586621680720348 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680720350MSym1 x6989586621680720348 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680728931 t6989586621680728473 :: TyFun (t6989586621680728473 a6989586621680728474) (Maybe a6989586621680728474) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677690Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677602Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680973774Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Maybe a6989586621680962759 ~> f6989586621680962758 (Maybe b6989586621680962760)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621680063460 a6989586621680063438 :: TyFun (a6989586621680063438 ~> b6989586621680063437) (Maybe a6989586621680063438 ~> b6989586621680063437) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680066982RsSym0 :: TyFun (a6989586621680066238 ~> Maybe k1) (TyFun k (TyFun [a6989586621680066238] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729408MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729383MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035860Sym1 a6989586621680035858 b6989586621679948821 :: TyFun (a6989586621679948820 ~> Maybe b6989586621679948821) (Maybe b6989586621679948821) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680035704Sym0 :: TyFun (a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (Maybe a6989586621679948783 ~> (Maybe b6989586621679948784 ~> Maybe c6989586621679948785)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) # | |
| SuppressUnusedWarnings (Traverse_6989586621680973774Sym1 a6989586621680973772 :: TyFun (Maybe a6989586621680962759) (f6989586621680962758 (Maybe b6989586621680962760)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621680063461 a6989586621680063460 :: TyFun (Maybe a6989586621680063438) b6989586621680063437 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680035704Sym1 a6989586621680035701 :: TyFun (Maybe a6989586621679948783) (Maybe b6989586621679948784 ~> Maybe c6989586621679948785) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729408MfSym1 f6989586621680729406 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729383MfSym1 f6989586621680729381 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677690Sym1 a6989586621680677688 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677602Sym1 a6989586621680677600 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Let6989586621680729408MfSym2 xs6989586621680729407 f6989586621680729406 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680035704Sym2 a6989586621680035702 a6989586621680035701 :: TyFun (Maybe b6989586621679948784) (Maybe c6989586621679948785) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729383MfSym2 xs6989586621680729382 f6989586621680729381 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677690Sym2 k6989586621680677689 a6989586621680677688 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680677602Sym2 k6989586621680677601 a6989586621680677600 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729383MfSym3 a6989586621680729384 xs6989586621680729382 f6989586621680729381 :: TyFun (Maybe k2) (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680729408MfSym3 a6989586621680729409 xs6989586621680729407 f6989586621680729406 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Product (arg :: Maybe a) | |
| type Sum (arg :: Maybe a) | |
| type Minimum (arg :: Maybe a) | |
| type Maximum (arg :: Maybe a) | |
| type Length (arg :: Maybe a) | |
| type Null (arg :: Maybe a) | |
| type ToList (arg :: Maybe a) | |
| type Fold (arg :: Maybe m) | |
| type Pure (a :: k1) | |
| type Fail a2 | |
| type Return (arg :: a) | |
| type Sequence (arg :: Maybe (m a)) | |
| type SequenceA (arg :: Maybe (f a)) | |
| type Elem (arg1 :: a) (arg2 :: Maybe a) | |
| type Foldl1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type Foldr1 (arg1 :: a ~> (a ~> a)) (arg2 :: Maybe a) | |
| type (a1 :: Maybe a6989586621679948885) <|> (a2 :: Maybe a6989586621679948885) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type FoldMap (a1 :: a6989586621680728568 ~> k2) (a2 :: Maybe a6989586621680728568) | |
| type (a1 :: k1) <$ (a2 :: Maybe b6989586621679948775) | |
| type Fmap (a1 :: a6989586621679948770 ~> b6989586621679948772) (a2 :: Maybe a6989586621679948770) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a1 :: Maybe a6989586621679948787) *> (a2 :: Maybe b6989586621679948789) | |
| type (a1 :: Maybe (a6989586621679948781 ~> b6989586621679948782)) <*> (a2 :: Maybe a6989586621679948781) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (a1 :: Maybe a6989586621679948822) >> (a2 :: Maybe b6989586621679948823) | |
| type (a1 :: Maybe a6989586621679948820) >>= (a2 :: a6989586621679948820 ~> Maybe b6989586621679948821) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a1 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (a2 :: Maybe a6989586621680962759) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (a2 :: Maybe a6989586621680962759) = Apply (Apply (Traverse_6989586621680973774Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Maybe a6989586621680962759 ~> f6989586621680962758 (Maybe b6989586621680962760)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldl (a1 :: k2 ~> (a6989586621680728574 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680728574) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a1 :: a6989586621680728569 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680728569) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (a2 :: Maybe a6989586621679948783) (a3 :: Maybe b6989586621679948784) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (a2 :: Maybe a6989586621679948783) (a3 :: Maybe b6989586621679948784) = Apply (Apply (Apply (LiftA2_6989586621680035704Sym0 :: TyFun (a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (Maybe a6989586621679948783 ~> (Maybe b6989586621679948784 ~> Maybe c6989586621679948785)) -> Type) a1) a2) a3 | |
| type Unbundled dom d (Maybe a) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| type TryDomain t (Maybe a) Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| type Unbundled dom (Maybe a) Source # | |
Defined in Clash.Signal.Bundle | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680067087 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680067098 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680067076 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Compare_6989586621679845938Sym1 a6989586621679845936 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679845937 :: Maybe a) | |
| type Apply (FromMaybeSym1 a6989586621680067052 :: TyFun (Maybe a) a -> Type) (a6989586621680067053 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Maybe_Sym2 a6989586621680063461 a6989586621680063460 :: TyFun (Maybe a) b -> Type) (a6989586621680063462 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Eval (FoldMap f (Just x) :: a2 -> Type) | |
| type Eval (FoldMap f (Nothing :: Maybe a1) :: a2 -> Type) | |
| type Eval (Foldr f y (Just x) :: a2 -> Type) | |
| type Eval (Foldr f y (Nothing :: Maybe a1) :: a2 -> Type) | |
| type Rep (Maybe a) | Since: base-4.6.0.0 |
| data Sing (b :: Maybe a) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type Base (Maybe a) | Example boring stub for non-recursive data types |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| data Sing (b :: Maybe a) | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type BitSize (Maybe a) Source # | |
Defined in Clash.Class.BitPack | |
| type Rep1 Maybe | Since: base-4.6.0.0 |
| type Mconcat (arg :: [Maybe a]) | |
| type Show_ (arg :: Maybe a) | |
| type Sconcat (arg :: NonEmpty (Maybe a)) | |
| type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
| type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
| type (x :: Maybe a) /= (y :: Maybe a) | |
| type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type (a2 :: Maybe a1) <> (Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
| type Apply (Pure_6989586621680035676Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680035675 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Fail_6989586621680035883Sym0 :: TyFun Symbol (Maybe a6989586621679948825) -> Type) (a6989586621680035882 :: Symbol) | |
| type Apply (Let6989586621680035972LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800349216989586621680035971 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679740858 :: a) | |
| type Apply (Let6989586621680720350MSym1 x6989586621680720348 :: TyFun k (Maybe k1) -> Type) (y6989586621680720349 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680720350NSym1 x6989586621680720348 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680720349 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680720377MSym1 x6989586621680720375 :: TyFun k (Maybe k1) -> Type) (y6989586621680720376 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680720377NSym1 x6989586621680720375 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680720376 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680677602Sym2 k6989586621680677601 a6989586621680677600 :: TyFun k1 (Maybe a) -> Type) (t6989586621680677613 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680677690Sym2 k6989586621680677689 a6989586621680677688 :: TyFun k1 (Maybe a) -> Type) (t6989586621680677701 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680729408MfSym3 a6989586621680729409 xs6989586621680729407 f6989586621680729406 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680729410 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type (Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680067011 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680067043 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680067043 :: Maybe a) = MaybeToList a6989586621680067043 | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680067027 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680067027 :: [a]) = ListToMaybe a6989586621680067027 | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680207661 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680671498 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680671519 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680207664 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680671501 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680671522 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680719771 :: Maybe a) | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680719564 :: Maybe a) | |
| type Apply (StripPrefixSym1 a6989586621680458320 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680458321 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680458320 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680458321 :: [a]) = StripPrefix a6989586621680458320 a6989586621680458321 | |
| type Apply (FindIndexSym1 a6989586621680329310 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680329311 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemIndexSym1 a6989586621680329318 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680329319 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindSym1 a6989586621680328950 :: TyFun [a] (Maybe a) -> Type) (a6989586621680328951 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (TFHelper_6989586621680035976Sym1 a6989586621680035974 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680035975 :: Maybe a) | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621680963136 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (LookupSym1 a6989586621680328732 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680328733 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindSym1 a6989586621680728931 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680728932 :: t a) | |
| type Apply (Fmap_6989586621680035527Sym1 a6989586621680035525 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680035526 :: Maybe a) | |
| type Apply (TFHelper_6989586621680035547Sym1 a6989586621680035545 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680035546 :: Maybe b) | |
| type Apply (TFHelper_6989586621680035688Sym1 a6989586621680035686 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680035687 :: Maybe a) | |
| type Apply (TFHelper_6989586621680035718Sym1 a6989586621680035716 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680035717 :: Maybe b) | |
| type Apply (TFHelper_6989586621680035876Sym1 a6989586621680035874 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680035875 :: Maybe b) | |
| type Apply (Traverse_6989586621680973774Sym1 a6989586621680973772 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680973773 :: Maybe a) | |
| type Apply (LiftA2_6989586621680035704Sym2 a6989586621680035702 a6989586621680035701 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680035703 :: Maybe b) | |
| type Apply (Let6989586621680729383MfSym3 a6989586621680729384 xs6989586621680729382 f6989586621680729381 :: TyFun (Maybe k2) (Maybe k3) -> Type) (a6989586621680729385 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Eval (Init (a2 ': ([] :: [a1])) :: Maybe [a1] -> Type) | |
| type Eval (Init ([] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Tail (_a ': as) :: Maybe [a] -> Type) | |
| type Eval (Tail ([] :: [a]) :: Maybe [a] -> Type) | |
| type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
| type Eval (Head (a2 ': _as) :: Maybe a1 -> Type) | |
| type Eval (Head ([] :: [a]) :: Maybe a -> Type) | |
| type Eval (Last (a2 ': (b ': as)) :: Maybe a1 -> Type) | |
| type Eval (Last (a2 ': ([] :: [a1])) :: Maybe a1 -> Type) | |
| type Eval (Last ([] :: [a]) :: Maybe a -> Type) | |
| type (Just a2 :: Maybe a1) <> (Just b :: Maybe a1) | |
| type Apply (TFHelper_6989586621680035860Sym1 a6989586621680035858 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680035859 :: a ~> Maybe b) | |
| type Eval (FindIndex p (a2 ': as) :: Maybe Nat -> Type) | |
| type Eval (FindIndex _p ([] :: [a]) :: Maybe Nat -> Type) | |
| type Eval (NumIter a s :: Maybe (k, Nat) -> Type) | |
| type Eval (Find p (a2 ': as) :: Maybe a1 -> Type) | |
| type Eval (Find _p ([] :: [a]) :: Maybe a -> Type) | |
| type Eval (Lookup a as :: Maybe b -> Type) | |
| type Eval (Map f (Just a3) :: Maybe a2 -> Type) | |
| type Eval (Map f (Nothing :: Maybe a) :: Maybe b -> Type) | |
| type Apply (ElemIndexSym0 :: TyFun a6989586621680319392 ([a6989586621680319392] ~> Maybe Nat) -> Type) (a6989586621680329318 :: a6989586621680319392) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680319392 ([a6989586621680319392] ~> Maybe Nat) -> Type) (a6989586621680329318 :: a6989586621680319392) = ElemIndexSym1 a6989586621680329318 | |
| type Apply (FromMaybeSym0 :: TyFun a6989586621680066244 (Maybe a6989586621680066244 ~> a6989586621680066244) -> Type) (a6989586621680067052 :: a6989586621680066244) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621680066244 (Maybe a6989586621680066244 ~> a6989586621680066244) -> Type) (a6989586621680067052 :: a6989586621680066244) = FromMaybeSym1 a6989586621680067052 | |
| type Apply (ShowsPrec_6989586621680611150Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680611147 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (Let6989586621680720350MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680720348 :: k1) | |
| type Apply (Let6989586621680720350NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680720348 :: k) | |
| type Apply (Let6989586621680720377MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680720375 :: k1) | |
| type Apply (Let6989586621680720377NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680720375 :: k) | |
| type Apply (LookupSym0 :: TyFun a6989586621680319371 ([(a6989586621680319371, b6989586621680319372)] ~> Maybe b6989586621680319372) -> Type) (a6989586621680328732 :: a6989586621680319371) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680319371 ([(a6989586621680319371, b6989586621680319372)] ~> Maybe b6989586621680319372) -> Type) (a6989586621680328732 :: a6989586621680319371) = (LookupSym1 a6989586621680328732 b6989586621680319372 :: TyFun [(a6989586621680319371, b6989586621680319372)] (Maybe b6989586621680319372) -> Type) | |
| type Apply (TFHelper_6989586621680035547Sym0 :: TyFun a6989586621679948773 (Maybe b6989586621679948775 ~> Maybe a6989586621679948773) -> Type) (a6989586621680035545 :: a6989586621679948773) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035547Sym0 :: TyFun a6989586621679948773 (Maybe b6989586621679948775 ~> Maybe a6989586621679948773) -> Type) (a6989586621680035545 :: a6989586621679948773) = (TFHelper_6989586621680035547Sym1 a6989586621680035545 b6989586621679948775 :: TyFun (Maybe b6989586621679948775) (Maybe a6989586621679948773) -> Type) | |
| type Apply (Maybe_Sym0 :: TyFun b6989586621680063437 ((a6989586621680063438 ~> b6989586621680063437) ~> (Maybe a6989586621680063438 ~> b6989586621680063437)) -> Type) (a6989586621680063460 :: b6989586621680063437) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621680063437 ((a6989586621680063438 ~> b6989586621680063437) ~> (Maybe a6989586621680063438 ~> b6989586621680063437)) -> Type) (a6989586621680063460 :: b6989586621680063437) = (Maybe_Sym1 a6989586621680063460 a6989586621680063438 :: TyFun (a6989586621680063438 ~> b6989586621680063437) (Maybe a6989586621680063438 ~> b6989586621680063437) -> Type) | |
| type Apply (Lambda_6989586621680677602Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680677600 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680677690Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680677688 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680729408MfSym1 f6989586621680729406 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680729407 :: k) | |
| type Apply (Let6989586621680729383MfSym1 f6989586621680729381 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680729382 :: k) | |
| type Apply (Let6989586621680729383MfSym2 xs6989586621680729382 f6989586621680729381 :: TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) (a6989586621680729384 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (StripPrefixSym0 :: TyFun [a6989586621680445610] ([a6989586621680445610] ~> Maybe [a6989586621680445610]) -> Type) (a6989586621680458320 :: [a6989586621680445610]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680445610] ([a6989586621680445610] ~> Maybe [a6989586621680445610]) -> Type) (a6989586621680458320 :: [a6989586621680445610]) = StripPrefixSym1 a6989586621680458320 | |
| type Apply (TFHelper_6989586621680035976Sym0 :: TyFun (Maybe a6989586621679948885) (Maybe a6989586621679948885 ~> Maybe a6989586621679948885) -> Type) (a6989586621680035974 :: Maybe a6989586621679948885) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679845938Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679845936 :: Maybe a3530822107858468865) | |
| type Apply (TFHelper_6989586621680035688Sym0 :: TyFun (Maybe (a6989586621679948781 ~> b6989586621679948782)) (Maybe a6989586621679948781 ~> Maybe b6989586621679948782) -> Type) (a6989586621680035686 :: Maybe (a6989586621679948781 ~> b6989586621679948782)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035688Sym0 :: TyFun (Maybe (a6989586621679948781 ~> b6989586621679948782)) (Maybe a6989586621679948781 ~> Maybe b6989586621679948782) -> Type) (a6989586621680035686 :: Maybe (a6989586621679948781 ~> b6989586621679948782)) = TFHelper_6989586621680035688Sym1 a6989586621680035686 | |
| type Apply (TFHelper_6989586621680035718Sym0 :: TyFun (Maybe a6989586621679948787) (Maybe b6989586621679948789 ~> Maybe b6989586621679948789) -> Type) (a6989586621680035716 :: Maybe a6989586621679948787) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035718Sym0 :: TyFun (Maybe a6989586621679948787) (Maybe b6989586621679948789 ~> Maybe b6989586621679948789) -> Type) (a6989586621680035716 :: Maybe a6989586621679948787) = (TFHelper_6989586621680035718Sym1 a6989586621680035716 b6989586621679948789 :: TyFun (Maybe b6989586621679948789) (Maybe b6989586621679948789) -> Type) | |
| type Apply (TFHelper_6989586621680035876Sym0 :: TyFun (Maybe a6989586621679948822) (Maybe b6989586621679948823 ~> Maybe b6989586621679948823) -> Type) (a6989586621680035874 :: Maybe a6989586621679948822) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035876Sym0 :: TyFun (Maybe a6989586621679948822) (Maybe b6989586621679948823 ~> Maybe b6989586621679948823) -> Type) (a6989586621680035874 :: Maybe a6989586621679948822) = (TFHelper_6989586621680035876Sym1 a6989586621680035874 b6989586621679948823 :: TyFun (Maybe b6989586621679948823) (Maybe b6989586621679948823) -> Type) | |
| type Apply (ShowsPrec_6989586621680611150Sym1 a6989586621680611147 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680611148 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680035860Sym0 :: TyFun (Maybe a6989586621679948820) ((a6989586621679948820 ~> Maybe b6989586621679948821) ~> Maybe b6989586621679948821) -> Type) (a6989586621680035858 :: Maybe a6989586621679948820) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035860Sym0 :: TyFun (Maybe a6989586621679948820) ((a6989586621679948820 ~> Maybe b6989586621679948821) ~> Maybe b6989586621679948821) -> Type) (a6989586621680035858 :: Maybe a6989586621679948820) = (TFHelper_6989586621680035860Sym1 a6989586621680035858 b6989586621679948821 :: TyFun (a6989586621679948820 ~> Maybe b6989586621679948821) (Maybe b6989586621679948821) -> Type) | |
| type Apply (LiftA2_6989586621680035704Sym1 a6989586621680035701 :: TyFun (Maybe a6989586621679948783) (Maybe b6989586621679948784 ~> Maybe c6989586621679948785) -> Type) (a6989586621680035702 :: Maybe a6989586621679948783) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680729408MfSym2 xs6989586621680729407 f6989586621680729406 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680729409 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym0 :: TyFun (a6989586621680319393 ~> Bool) ([a6989586621680319393] ~> Maybe a6989586621680319393) -> Type) (a6989586621680328950 :: a6989586621680319393 ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680319390 ~> Bool) ([a6989586621680319390] ~> Maybe Nat) -> Type) (a6989586621680329310 :: a6989586621680319390 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a6989586621680066238 ~> Maybe b6989586621680066239) ([a6989586621680066238] ~> [b6989586621680066239]) -> Type) (a6989586621680066968 :: a6989586621680066238 ~> Maybe b6989586621680066239) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621680066238 ~> Maybe b6989586621680066239) ([a6989586621680066238] ~> [b6989586621680066239]) -> Type) (a6989586621680066968 :: a6989586621680066238 ~> Maybe b6989586621680066239) = MapMaybeSym1 a6989586621680066968 | |
| type Apply (Fmap_6989586621680035527Sym0 :: TyFun (a6989586621679948770 ~> b6989586621679948772) (Maybe a6989586621679948770 ~> Maybe b6989586621679948772) -> Type) (a6989586621680035525 :: a6989586621679948770 ~> b6989586621679948772) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (UnfoldrSym0 :: TyFun (b6989586621680319449 ~> Maybe (a6989586621680319450, b6989586621680319449)) (b6989586621680319449 ~> [a6989586621680319450]) -> Type) (a6989586621680329383 :: b6989586621680319449 ~> Maybe (a6989586621680319450, b6989586621680319449)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680319449 ~> Maybe (a6989586621680319450, b6989586621680319449)) (b6989586621680319449 ~> [a6989586621680319450]) -> Type) (a6989586621680329383 :: b6989586621680319449 ~> Maybe (a6989586621680319450, b6989586621680319449)) = UnfoldrSym1 a6989586621680329383 | |
| type Apply (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) (a6989586621680728931 :: a6989586621680728474 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680728474 ~> Bool) (t6989586621680728473 a6989586621680728474 ~> Maybe a6989586621680728474) -> Type) (a6989586621680728931 :: a6989586621680728474 ~> Bool) = (FindSym1 a6989586621680728931 t6989586621680728473 :: TyFun (t6989586621680728473 a6989586621680728474) (Maybe a6989586621680728474) -> Type) | |
| type Apply (Let6989586621680066982RsSym0 :: TyFun (a6989586621680066238 ~> Maybe k1) (TyFun k (TyFun [a6989586621680066238] [k1] -> Type) -> Type) -> Type) (f6989586621680066978 :: a6989586621680066238 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621680066982RsSym0 :: TyFun (a6989586621680066238 ~> Maybe k1) (TyFun k (TyFun [a6989586621680066238] [k1] -> Type) -> Type) -> Type) (f6989586621680066978 :: a6989586621680066238 ~> Maybe k1) = (Let6989586621680066982RsSym1 f6989586621680066978 :: TyFun k (TyFun [a6989586621680066238] [k1] -> Type) -> Type) | |
| type Apply (Let6989586621680729383MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680729381 :: k3 ~> (k2 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680729383MfSym0 :: TyFun (k3 ~> (k2 ~> k3)) (TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680729381 :: k3 ~> (k2 ~> k3)) = (Let6989586621680729383MfSym1 f6989586621680729381 :: TyFun k (TyFun k3 (TyFun (Maybe k2) (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680729408MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680729406 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680729408MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680729406 :: k2 ~> (k3 ~> k3)) = (Let6989586621680729408MfSym1 f6989586621680729406 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
| type Apply (Traverse_6989586621680973774Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Maybe a6989586621680962759 ~> f6989586621680962758 (Maybe b6989586621680962760)) -> Type) (a6989586621680973772 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680973774Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Maybe a6989586621680962759 ~> f6989586621680962758 (Maybe b6989586621680962760)) -> Type) (a6989586621680973772 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) = Traverse_6989586621680973774Sym1 a6989586621680973772 | |
| type Apply (Maybe_Sym1 a6989586621680063460 a6989586621680063438 :: TyFun (a6989586621680063438 ~> b6989586621680063437) (Maybe a6989586621680063438 ~> b6989586621680063437) -> Type) (a6989586621680063461 :: a6989586621680063438 ~> b6989586621680063437) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621680063460 a6989586621680063438 :: TyFun (a6989586621680063438 ~> b6989586621680063437) (Maybe a6989586621680063438 ~> b6989586621680063437) -> Type) (a6989586621680063461 :: a6989586621680063438 ~> b6989586621680063437) = Maybe_Sym2 a6989586621680063460 a6989586621680063461 | |
| type Apply (LiftA2_6989586621680035704Sym0 :: TyFun (a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (Maybe a6989586621679948783 ~> (Maybe b6989586621679948784 ~> Maybe c6989586621679948785)) -> Type) (a6989586621680035701 :: a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680035704Sym0 :: TyFun (a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) (Maybe a6989586621679948783 ~> (Maybe b6989586621679948784 ~> Maybe c6989586621679948785)) -> Type) (a6989586621680035701 :: a6989586621679948783 ~> (b6989586621679948784 ~> c6989586621679948785)) = LiftA2_6989586621680035704Sym1 a6989586621680035701 | |
| type Apply (Lambda_6989586621680677602Sym1 a6989586621680677600 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680677601 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680677690Sym1 a6989586621680677688 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680677689 :: k1 ~> Last a) | |
Instances
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Eq Ordering | |
| Data Ordering | Since: base-4.0.0.0 |
Defined in 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 :: (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 # | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| Ix Ordering | Since: base-2.1 |
Defined in GHC.Arr | |
| Generic Ordering | |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Monoid Ordering | Since: base-2.1 |
| Arbitrary Ordering | |
| CoArbitrary Ordering | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Ordering -> Gen b -> Gen b # | |
| Binary Ordering | |
| Default Ordering | |
Defined in Data.Default.Class | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| AsEmpty Ordering | |
Defined in Control.Lens.Empty | |
| PMonoid Ordering | |
| SMonoid Ordering | |
Defined in Data.Singletons.Prelude.Monoid | |
| PShow Ordering | |
| SShow Ordering | |
| PSemigroup Ordering | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup Ordering | |
| PEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: Sing t -> Sing (Apply SuccSym0 t) # sPred :: Sing t -> Sing (Apply PredSym0 t) # sToEnum :: Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Ordering | |
| SOrd Ordering | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Ordering | |
| PEq Ordering | |
| () :=> (Bounded Ordering) | |
| () :=> (Enum Ordering) | |
| () :=> (Read Ordering) | |
| () :=> (Show Ordering) | |
| () :=> (Semigroup Ordering) | |
| () :=> (Monoid Ordering) | |
| SuppressUnusedWarnings Compare_6989586621679846452Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680105215Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679846462Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680105209Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680611535Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679846472Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679846064Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680217668Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680217689Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679846452Sym1 a6989586621679846450 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679845972Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679845938Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ThenCmpSym1 a6989586621679845552 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846462Sym1 a6989586621679846460 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611535Sym1 a6989586621680611532 :: TyFun Ordering (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846472Sym1 a6989586621679846470 :: TyFun () Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832318Scrutinee_6989586621679831989Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832291Scrutinee_6989586621679831986Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832268Scrutinee_6989586621679831983Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832248Scrutinee_6989586621679831979Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679832235Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846064Sym1 a6989586621679846062 :: TyFun Void Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217755Sym0 :: TyFun (Min a6989586621679058608) (Min a6989586621679058608 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217776Sym0 :: TyFun (Max a6989586621679058640) (Max a6989586621679058640 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217803Sym0 :: TyFun (First a6989586621679058688) (First a6989586621679058688 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217824Sym0 :: TyFun (Last a6989586621679058710) (Last a6989586621679058710 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217845Sym0 :: TyFun (WrappedMonoid m6989586621679058736) (WrappedMonoid m6989586621679058736 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217629Sym0 :: TyFun (Option a6989586621679058768) (Option a6989586621679058768 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846440Sym0 :: TyFun (Identity a6989586621679077197) (Identity a6989586621679077197 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680673144Sym0 :: TyFun (First a6989586621679077271) (First a6989586621679077271 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680673165Sym0 :: TyFun (Last a6989586621679077246) (Last a6989586621679077246 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217650Sym0 :: TyFun (Dual a6989586621679076705) (Dual a6989586621679076705 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217668Sym1 a6989586621680217666 :: TyFun All Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217689Sym1 a6989586621680217687 :: TyFun Any Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217713Sym0 :: TyFun (Sum a6989586621679076678) (Sum a6989586621679076678 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217734Sym0 :: TyFun (Product a6989586621679076686) (Product a6989586621679076686 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679844713Sym0 :: TyFun (Down a6989586621679844685) (Down a6989586621679844685 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846050Sym0 :: TyFun (NonEmpty a6989586621679077374) (NonEmpty a6989586621679077374 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a6989586621680581512 ~> (a6989586621680581512 ~> Ordering)) ([a6989586621680581512] ~> [a6989586621680581512]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SortBySym0 :: TyFun (a6989586621680319398 ~> (a6989586621680319398 ~> Ordering)) ([a6989586621680319398] ~> [a6989586621680319398]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680319395 ~> (a6989586621680319395 ~> Ordering)) ([a6989586621680319395] ~> a6989586621680319395) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680319396 ~> (a6989586621680319396 ~> Ordering)) ([a6989586621680319396] ~> a6989586621680319396) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (InsertBySym0 :: TyFun (a6989586621680319397 ~> (a6989586621680319397 ~> Ordering)) (a6989586621680319397 ~> ([a6989586621680319397] ~> [a6989586621680319397])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) # | |
| SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 # | |
| SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
| SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SortBySym0 # | |
| SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing InsertBySym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679845972Sym1 a6989586621679845970 :: TyFun [a3530822107858468865] Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679845938Sym1 a6989586621679845936 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846092Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832318Scrutinee_6989586621679831989Sym1 x6989586621679832316 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832291Scrutinee_6989586621679831986Sym1 x6989586621679832288 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832268Scrutinee_6989586621679831983Sym1 x6989586621679832266 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679832248Scrutinee_6989586621679831979Sym1 x6989586621679832245 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679832235Sym1 a6989586621679832233 :: TyFun a6989586621679831948 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym1 arg6989586621679832169 :: TyFun a6989586621679831948 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217755Sym1 a6989586621680217753 :: TyFun (Min a6989586621679058608) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217776Sym1 a6989586621680217774 :: TyFun (Max a6989586621679058640) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681121607Sym0 :: TyFun (Arg a6989586621681110468 b6989586621681110469) (Arg a6989586621681110468 b6989586621681110469 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217803Sym1 a6989586621680217801 :: TyFun (First a6989586621679058688) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217824Sym1 a6989586621680217822 :: TyFun (Last a6989586621679058710) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217845Sym1 a6989586621680217843 :: TyFun (WrappedMonoid m6989586621679058736) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217629Sym1 a6989586621680217627 :: TyFun (Option a6989586621679058768) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846440Sym1 a6989586621679846438 :: TyFun (Identity a6989586621679077197) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680673144Sym1 a6989586621680673142 :: TyFun (First a6989586621679077271) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680673165Sym1 a6989586621680673163 :: TyFun (Last a6989586621679077246) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217650Sym1 a6989586621680217648 :: TyFun (Dual a6989586621679076705) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217713Sym1 a6989586621680217711 :: TyFun (Sum a6989586621679076678) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680217734Sym1 a6989586621680217732 :: TyFun (Product a6989586621679076686) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679844713Sym1 a6989586621679844711 :: TyFun (Down a6989586621679844685) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846050Sym1 a6989586621679846048 :: TyFun (NonEmpty a6989586621679077374) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680728478 ~> (a6989586621680728478 ~> Ordering)) (t6989586621680728477 a6989586621680728478 ~> a6989586621680728478) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680728480 ~> (a6989586621680728480 ~> Ordering)) (t6989586621680728479 a6989586621680728480 ~> a6989586621680728480) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680728999Max'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680728974Min'Sym0 :: TyFun (k2 ~> (k2 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k2 k2 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym0 :: TyFun (b6989586621679831937 ~> a6989586621679831936) (b6989586621679831937 ~> (b6989586621679831937 ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) # | |
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinimumBySym0 # | |
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaximumBySym0 # | |
| SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ComparingSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679846018Sym1 a6989586621679846016 :: TyFun (Either a6989586621679076728 b6989586621679076729) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846092Sym1 a6989586621679846090 :: TyFun (a3530822107858468865, b3530822107858468866) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846133Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym1 a6989586621679832159 :: TyFun b6989586621679831937 (b6989586621679831937 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681121607Sym1 a6989586621681121605 :: TyFun (Arg a6989586621681110468 b6989586621681110469) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680900284Sym0 :: TyFun (Const a6989586621680899005 b6989586621680899006) (Const a6989586621680899005 b6989586621680899006 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329736MinBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680329706MaxBySym0 :: TyFun (k3 ~> (k3 ~> Ordering)) (TyFun k1 (TyFun k2 (TyFun k3 (TyFun k3 k3 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym1 d) # | |
| SuppressUnusedWarnings (Compare_6989586621679846133Sym1 a6989586621679846131 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846185Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym2 a6989586621679832160 a6989586621679832159 :: TyFun b6989586621679831937 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680900284Sym1 a6989586621680900282 :: TyFun (Const a6989586621680899005 b6989586621680899006) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym2 d1 d2) # | |
| SuppressUnusedWarnings (Compare_6989586621679846185Sym1 a6989586621679846183 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846248Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846248Sym1 a6989586621679846246 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846322Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846322Sym1 a6989586621679846320 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846407Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846407Sym1 a6989586621679846405 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| type Rep Ordering | Since: base-4.6.0.0 |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680064517Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680064511Sym0 | |
| data Sing (a :: Ordering) | |
| type Demote Ordering | |
Defined in Data.Singletons.Prelude.Instances | |
| type Mconcat (arg :: [Ordering]) | |
| type Show_ (arg :: Ordering) | |
| type Sconcat (arg :: NonEmpty Ordering) | |
| type FromEnum (a :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg :: Ordering) | |
| type Succ (arg :: Ordering) | |
| type LT <> (_b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type EQ <> (b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type GT <> (_b :: Ordering) | |
Defined in Fcf.Class.Monoid | |
| type (a :: Ordering) <> EQ | |
Defined in Fcf.Class.Monoid | |
| type Mappend (arg1 :: Ordering) (arg2 :: Ordering) | |
| type ShowList (arg1 :: [Ordering]) arg2 | |
| type (a1 :: Ordering) <> (a2 :: Ordering) | |
| type EnumFromTo (arg1 :: Ordering) (arg2 :: Ordering) | |
| type Min (arg1 :: Ordering) (arg2 :: Ordering) | |
| type Max (arg1 :: Ordering) (arg2 :: Ordering) | |
| type (arg1 :: Ordering) >= (arg2 :: Ordering) | |
| type (arg1 :: Ordering) > (arg2 :: Ordering) | |
| type (arg1 :: Ordering) <= (arg2 :: Ordering) | |
| type (arg1 :: Ordering) < (arg2 :: Ordering) | |
| type Compare (a1 :: Ordering) (a2 :: Ordering) | |
| type (x :: Ordering) /= (y :: Ordering) | |
| type (a :: Ordering) == (b :: Ordering) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a1 (a2 :: Ordering) a3 | |
| type EnumFromThenTo (arg1 :: Ordering) (arg2 :: Ordering) (arg3 :: Ordering) | |
| type Apply ToEnum_6989586621680105209Sym0 (a6989586621680105208 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply FromEnum_6989586621680105215Sym0 (a6989586621680105214 :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply (Compare_6989586621679846452Sym1 a6989586621679846450 :: TyFun Bool Ordering -> Type) (a6989586621679846451 :: Bool) | |
| type Apply (ThenCmpSym1 a6989586621679845552 :: TyFun Ordering Ordering -> Type) (a6989586621679845553 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679846462Sym1 a6989586621679846460 :: TyFun Ordering Ordering -> Type) (a6989586621679846461 :: Ordering) | |
| type Apply (Compare_6989586621679846472Sym1 a6989586621679846470 :: TyFun () Ordering -> Type) (a6989586621679846471 :: ()) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679846064Sym1 a6989586621679846062 :: TyFun Void Ordering -> Type) (a6989586621679846063 :: Void) | |
| type Apply (Compare_6989586621680217668Sym1 a6989586621680217666 :: TyFun All Ordering -> Type) (a6989586621680217667 :: All) | |
| type Apply (Compare_6989586621680217689Sym1 a6989586621680217687 :: TyFun Any Ordering -> Type) (a6989586621680217688 :: Any) | |
| type Apply (Compare_6989586621679832235Sym1 a6989586621679832233 :: TyFun a Ordering -> Type) (a6989586621679832234 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (CompareSym1 arg6989586621679832169 :: TyFun a Ordering -> Type) (arg6989586621679832170 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832318Scrutinee_6989586621679831989Sym1 x6989586621679832316 :: TyFun k1 Ordering -> Type) (y6989586621679832317 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832291Scrutinee_6989586621679831986Sym1 x6989586621679832288 :: TyFun k1 Ordering -> Type) (y6989586621679832289 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832268Scrutinee_6989586621679831983Sym1 x6989586621679832266 :: TyFun k1 Ordering -> Type) (y6989586621679832267 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679832248Scrutinee_6989586621679831979Sym1 x6989586621679832245 :: TyFun k1 Ordering -> Type) (y6989586621679832247 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (ComparingSym2 a6989586621679832160 a6989586621679832159 :: TyFun b Ordering -> Type) (a6989586621679832161 :: b) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679845972Sym1 a6989586621679845970 :: TyFun [a] Ordering -> Type) (a6989586621679845971 :: [a]) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679845938Sym1 a6989586621679845936 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679845937 :: Maybe a) | |
| type Apply (Compare_6989586621680217755Sym1 a6989586621680217753 :: TyFun (Min a) Ordering -> Type) (a6989586621680217754 :: Min a) | |
| type Apply (Compare_6989586621680217776Sym1 a6989586621680217774 :: TyFun (Max a) Ordering -> Type) (a6989586621680217775 :: Max a) | |
| type Apply (Compare_6989586621680217803Sym1 a6989586621680217801 :: TyFun (First a) Ordering -> Type) (a6989586621680217802 :: First a) | |
| type Apply (Compare_6989586621680217824Sym1 a6989586621680217822 :: TyFun (Last a) Ordering -> Type) (a6989586621680217823 :: Last a) | |
| type Apply (Compare_6989586621680217845Sym1 a6989586621680217843 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680217844 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680217845Sym1 a6989586621680217843 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680217844 :: WrappedMonoid m) = Compare_6989586621680217845 a6989586621680217843 a6989586621680217844 | |
| type Apply (Compare_6989586621680217629Sym1 a6989586621680217627 :: TyFun (Option a) Ordering -> Type) (a6989586621680217628 :: Option a) | |
| type Apply (Compare_6989586621679846440Sym1 a6989586621679846438 :: TyFun (Identity a) Ordering -> Type) (a6989586621679846439 :: Identity a) | |
| type Apply (Compare_6989586621680673144Sym1 a6989586621680673142 :: TyFun (First a) Ordering -> Type) (a6989586621680673143 :: First a) | |
| type Apply (Compare_6989586621680673165Sym1 a6989586621680673163 :: TyFun (Last a) Ordering -> Type) (a6989586621680673164 :: Last a) | |
| type Apply (Compare_6989586621680217650Sym1 a6989586621680217648 :: TyFun (Dual a) Ordering -> Type) (a6989586621680217649 :: Dual a) | |
| type Apply (Compare_6989586621680217713Sym1 a6989586621680217711 :: TyFun (Sum a) Ordering -> Type) (a6989586621680217712 :: Sum a) | |
| type Apply (Compare_6989586621680217734Sym1 a6989586621680217732 :: TyFun (Product a) Ordering -> Type) (a6989586621680217733 :: Product a) | |
| type Apply (Compare_6989586621679844713Sym1 a6989586621679844711 :: TyFun (Down a) Ordering -> Type) (a6989586621679844712 :: Down a) | |
| type Apply (Compare_6989586621679846050Sym1 a6989586621679846048 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679846049 :: NonEmpty a) | |
| type Apply (Compare_6989586621679846018Sym1 a6989586621679846016 :: TyFun (Either a b) Ordering -> Type) (a6989586621679846017 :: Either a b) | |
| type Apply (Compare_6989586621679846092Sym1 a6989586621679846090 :: TyFun (a, b) Ordering -> Type) (a6989586621679846091 :: (a, b)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681121607Sym1 a6989586621681121605 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681121606 :: Arg a b) | |
| type Apply (Compare_6989586621679846133Sym1 a6989586621679846131 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679846132 :: (a, b, c)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621680900284Sym1 a6989586621680900282 :: TyFun (Const a b) Ordering -> Type) (a6989586621680900283 :: Const a b) | |
| type Apply (Compare_6989586621679846185Sym1 a6989586621679846183 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679846184 :: (a, b, c, d)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679846248Sym1 a6989586621679846246 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679846247 :: (a, b, c, d, e)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679846322Sym1 a6989586621679846320 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679846321 :: (a, b, c, d, e, f)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679846407Sym1 a6989586621679846405 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679846406 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679846452Sym0 (a6989586621679846450 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ThenCmpSym0 (a6989586621679845552 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679846462Sym0 (a6989586621679846460 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680611535Sym0 (a6989586621680611532 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply Compare_6989586621679846472Sym0 (a6989586621679846470 :: ()) | |
Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679846472Sym0 (a6989586621679846470 :: ()) = Compare_6989586621679846472Sym1 a6989586621679846470 | |
| type Apply Compare_6989586621679846064Sym0 (a6989586621679846062 :: Void) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621680217668Sym0 (a6989586621680217666 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621680217689Sym0 (a6989586621680217687 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Let6989586621679832318Scrutinee_6989586621679831989Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832316 :: k1) | |
| type Apply (Let6989586621679832291Scrutinee_6989586621679831986Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832288 :: k1) | |
| type Apply (Let6989586621679832268Scrutinee_6989586621679831983Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832266 :: k1) | |
| type Apply (Let6989586621679832248Scrutinee_6989586621679831979Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679832245 :: k1) | |
| type Apply (ShowsPrec_6989586621680611535Sym1 a6989586621680611532 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680611533 :: Ordering) | |
| type Apply (Compare_6989586621679832235Sym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Ordering) -> Type) (a6989586621679832233 :: a6989586621679831948) | |
| type Apply (CompareSym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Ordering) -> Type) (arg6989586621679832169 :: a6989586621679831948) | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a6989586621679831948 (a6989586621679831948 ~> Ordering) -> Type) (arg6989586621679832169 :: a6989586621679831948) = CompareSym1 arg6989586621679832169 | |
| type Apply (ComparingSym1 a6989586621679832159 :: TyFun b6989586621679831937 (b6989586621679831937 ~> Ordering) -> Type) (a6989586621679832160 :: b6989586621679831937) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym1 a6989586621679832159 :: TyFun b6989586621679831937 (b6989586621679831937 ~> Ordering) -> Type) (a6989586621679832160 :: b6989586621679831937) = ComparingSym2 a6989586621679832159 a6989586621679832160 | |
| type Apply (Compare_6989586621679845972Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) (a6989586621679845970 :: [a3530822107858468865]) | |
| type Apply (Compare_6989586621679845938Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679845936 :: Maybe a3530822107858468865) | |
| type Apply (Compare_6989586621680217755Sym0 :: TyFun (Min a6989586621679058608) (Min a6989586621679058608 ~> Ordering) -> Type) (a6989586621680217753 :: Min a6989586621679058608) | |
| type Apply (Compare_6989586621680217776Sym0 :: TyFun (Max a6989586621679058640) (Max a6989586621679058640 ~> Ordering) -> Type) (a6989586621680217774 :: Max a6989586621679058640) | |
| type Apply (Compare_6989586621680217803Sym0 :: TyFun (First a6989586621679058688) (First a6989586621679058688 ~> Ordering) -> Type) (a6989586621680217801 :: First a6989586621679058688) | |
| type Apply (Compare_6989586621680217824Sym0 :: TyFun (Last a6989586621679058710) (Last a6989586621679058710 ~> Ordering) -> Type) (a6989586621680217822 :: Last a6989586621679058710) | |
| type Apply (Compare_6989586621680217845Sym0 :: TyFun (WrappedMonoid m6989586621679058736) (WrappedMonoid m6989586621679058736 ~> Ordering) -> Type) (a6989586621680217843 :: WrappedMonoid m6989586621679058736) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680217845Sym0 :: TyFun (WrappedMonoid m6989586621679058736) (WrappedMonoid m6989586621679058736 ~> Ordering) -> Type) (a6989586621680217843 :: WrappedMonoid m6989586621679058736) = Compare_6989586621680217845Sym1 a6989586621680217843 | |
| type Apply (Compare_6989586621680217629Sym0 :: TyFun (Option a6989586621679058768) (Option a6989586621679058768 ~> Ordering) -> Type) (a6989586621680217627 :: Option a6989586621679058768) | |
| type Apply (Compare_6989586621679846440Sym0 :: TyFun (Identity a6989586621679077197) (Identity a6989586621679077197 ~> Ordering) -> Type) (a6989586621679846438 :: Identity a6989586621679077197) | |
| type Apply (Compare_6989586621680673144Sym0 :: TyFun (First a6989586621679077271) (First a6989586621679077271 ~> Ordering) -> Type) (a6989586621680673142 :: First a6989586621679077271) | |
| type Apply (Compare_6989586621680673165Sym0 :: TyFun (Last a6989586621679077246) (Last a6989586621679077246 ~> Ordering) -> Type) (a6989586621680673163 :: Last a6989586621679077246) | |
| type Apply (Compare_6989586621680217650Sym0 :: TyFun (Dual a6989586621679076705) (Dual a6989586621679076705 ~> Ordering) -> Type) (a6989586621680217648 :: Dual a6989586621679076705) | |
| type Apply (Compare_6989586621680217713Sym0 :: TyFun (Sum a6989586621679076678) (Sum a6989586621679076678 ~> Ordering) -> Type) (a6989586621680217711 :: Sum a6989586621679076678) | |
| type Apply (Compare_6989586621680217734Sym0 :: TyFun (Product a6989586621679076686) (Product a6989586621679076686 ~> Ordering) -> Type) (a6989586621680217732 :: Product a6989586621679076686) | |
| type Apply (Compare_6989586621679844713Sym0 :: TyFun (Down a6989586621679844685) (Down a6989586621679844685 ~> Ordering) -> Type) (a6989586621679844711 :: Down a6989586621679844685) | |
| type Apply (Compare_6989586621679846050Sym0 :: TyFun (NonEmpty a6989586621679077374) (NonEmpty a6989586621679077374 ~> Ordering) -> Type) (a6989586621679846048 :: NonEmpty a6989586621679077374) | |
| type Apply (ListsortBySym0 :: TyFun (a6989586621680581512 ~> (a6989586621680581512 ~> Ordering)) ([a6989586621680581512] ~> [a6989586621680581512]) -> Type) (a6989586621680584661 :: a6989586621680581512 ~> (a6989586621680581512 ~> Ordering)) | |
| type Apply (SortBySym0 :: TyFun (a6989586621680319398 ~> (a6989586621680319398 ~> Ordering)) ([a6989586621680319398] ~> [a6989586621680319398]) -> Type) (a6989586621680328988 :: a6989586621680319398 ~> (a6989586621680319398 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680319396 ~> (a6989586621680319396 ~> Ordering)) ([a6989586621680319396] ~> a6989586621680319396) -> Type) (a6989586621680329695 :: a6989586621680319396 ~> (a6989586621680319396 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680319395 ~> (a6989586621680319395 ~> Ordering)) ([a6989586621680319395] ~> a6989586621680319395) -> Type) (a6989586621680329725 :: a6989586621680319395 ~> (a6989586621680319395 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (InsertBySym0 :: TyFun (a6989586621680319397 ~> (a6989586621680319397 ~> Ordering)) (a6989586621680319397 ~> ([a6989586621680319397] ~> [a6989586621680319397])) -> Type) (a6989586621680328958 :: a6989586621680319397 ~> (a6989586621680319397 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (InsertBySym0 :: TyFun (a6989586621680319397 ~> (a6989586621680319397 ~> Ordering)) (a6989586621680319397 ~> ([a6989586621680319397] ~> [a6989586621680319397])) -> Type) (a6989586621680328958 :: a6989586621680319397 ~> (a6989586621680319397 ~> Ordering)) = InsertBySym1 a6989586621680328958 | |
| type Apply (Let6989586621680728974Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680728972 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680728974Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680728972 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680728974Min'Sym1 cmp6989586621680728972 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680728999Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680728997 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680728999Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680728997 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680728999Max'Sym1 cmp6989586621680728997 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) | |
| type Apply (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) (a6989586621679846016 :: Either a6989586621679076728 b6989586621679076729) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) (a6989586621679846016 :: Either a6989586621679076728 b6989586621679076729) = Compare_6989586621679846018Sym1 a6989586621679846016 | |
| type Apply (Compare_6989586621679846092Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) (a6989586621679846090 :: (a3530822107858468865, b3530822107858468866)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680728480 ~> (a6989586621680728480 ~> Ordering)) (t6989586621680728479 a6989586621680728480 ~> a6989586621680728480) -> Type) (a6989586621680728991 :: a6989586621680728480 ~> (a6989586621680728480 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MaximumBySym0 :: TyFun (a6989586621680728480 ~> (a6989586621680728480 ~> Ordering)) (t6989586621680728479 a6989586621680728480 ~> a6989586621680728480) -> Type) (a6989586621680728991 :: a6989586621680728480 ~> (a6989586621680728480 ~> Ordering)) = (MaximumBySym1 a6989586621680728991 t6989586621680728479 :: TyFun (t6989586621680728479 a6989586621680728480) a6989586621680728480 -> Type) | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680728478 ~> (a6989586621680728478 ~> Ordering)) (t6989586621680728477 a6989586621680728478 ~> a6989586621680728478) -> Type) (a6989586621680728966 :: a6989586621680728478 ~> (a6989586621680728478 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MinimumBySym0 :: TyFun (a6989586621680728478 ~> (a6989586621680728478 ~> Ordering)) (t6989586621680728477 a6989586621680728478 ~> a6989586621680728478) -> Type) (a6989586621680728966 :: a6989586621680728478 ~> (a6989586621680728478 ~> Ordering)) = (MinimumBySym1 a6989586621680728966 t6989586621680728477 :: TyFun (t6989586621680728477 a6989586621680728478) a6989586621680728478 -> Type) | |
| type Apply (ComparingSym0 :: TyFun (b6989586621679831937 ~> a6989586621679831936) (b6989586621679831937 ~> (b6989586621679831937 ~> Ordering)) -> Type) (a6989586621679832159 :: b6989586621679831937 ~> a6989586621679831936) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym0 :: TyFun (b6989586621679831937 ~> a6989586621679831936) (b6989586621679831937 ~> (b6989586621679831937 ~> Ordering)) -> Type) (a6989586621679832159 :: b6989586621679831937 ~> a6989586621679831936) = ComparingSym1 a6989586621679832159 | |
| type Apply (Compare_6989586621681121607Sym0 :: TyFun (Arg a6989586621681110468 b6989586621681110469) (Arg a6989586621681110468 b6989586621681110469 ~> Ordering) -> Type) (a6989586621681121605 :: Arg a6989586621681110468 b6989586621681110469) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680329706MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680329699 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329706MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680329699 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680329706MaxBySym1 cmp6989586621680329699 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Let6989586621680329736MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680329729 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680329736MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680329729 :: k1 ~> (k1 ~> Ordering)) = (Let6989586621680329736MinBySym1 cmp6989586621680329729 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
| type Apply (Compare_6989586621679846133Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679846131 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846133Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679846131 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) = Compare_6989586621679846133Sym1 a6989586621679846131 | |
| type Apply (Compare_6989586621680900284Sym0 :: TyFun (Const a6989586621680899005 b6989586621680899006) (Const a6989586621680899005 b6989586621680899006 ~> Ordering) -> Type) (a6989586621680900282 :: Const a6989586621680899005 b6989586621680899006) | |
Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680900284Sym0 :: TyFun (Const a6989586621680899005 b6989586621680899006) (Const a6989586621680899005 b6989586621680899006 ~> Ordering) -> Type) (a6989586621680900282 :: Const a6989586621680899005 b6989586621680899006) = Compare_6989586621680900284Sym1 a6989586621680900282 | |
| type Apply (Compare_6989586621679846185Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679846183 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846185Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679846183 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) = Compare_6989586621679846185Sym1 a6989586621679846183 | |
| type Apply (Compare_6989586621679846248Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679846246 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846248Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679846246 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) = Compare_6989586621679846248Sym1 a6989586621679846246 | |
| type Apply (Compare_6989586621679846322Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679846320 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846322Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679846320 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) = Compare_6989586621679846322Sym1 a6989586621679846320 | |
| type Apply (Compare_6989586621679846407Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679846405 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846407Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679846405 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) = Compare_6989586621679846407Sym1 a6989586621679846405 | |
A value of type IO aa.
There is really only one way to "perform" an I/O action: bind it to
Main.main in your program. When your program is run, the I/O will
be performed. It isn't possible to perform I/O from an arbitrary
function, unless that function is itself in the IO monad and called
at some point, directly or indirectly, from Main.main.
IO is a monad, so IO actions can be combined using either the do-notation
or the >> and >>= operations from the Monad class.
Instances
Instances
The Either type represents values with two possibilities: a value of
type Either a bLeft aRight b
The Either type is sometimes used to represent a value which is
either correct or an error; by convention, the Left constructor is
used to hold an error value and the Right constructor is used to
hold a correct value (mnemonic: "right" also means "correct").
Examples
The type Either String IntString or an Int. The Left constructor can be used only on
Strings, and the Right constructor can be used only on Ints:
>>>let s = Left "foo" :: Either String Int>>>sLeft "foo">>>let n = Right 3 :: Either String Int>>>nRight 3>>>:type ss :: Either String Int>>>:type nn :: Either String Int
The fmap from our Functor instance will ignore Left values, but
will apply the supplied function to values contained in a Right:
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>fmap (*2) sLeft "foo">>>fmap (*2) nRight 6
The Monad instance for Either allows us to chain together multiple
actions which may fail, and fail overall if any of the individual
steps failed. First we'll write a function that can either parse an
Int from a Char, or fail.
>>>import Data.Char ( digitToInt, isDigit )>>>:{let parseEither :: Char -> Either String Int parseEither c | isDigit c = Right (digitToInt c) | otherwise = Left "parse error">>>:}
The following should work, since both '1' and '2' can be
parsed as Ints.
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither '1' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleRight 3
But the following should fail overall, since the first operation where
we attempt to parse 'm' as an Int will fail:
>>>:{let parseMultiple :: Either String Int parseMultiple = do x <- parseEither 'm' y <- parseEither '2' return (x + y)>>>:}
>>>parseMultipleLeft "parse error"
Instances
| Arbitrary2 Either | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary2 :: Gen a -> Gen b -> Gen (Either a b) # liftShrink2 :: (a -> [a]) -> (b -> [b]) -> Either a b -> [Either a b] # | |
| Bitraversable Either | Since: base-4.10.0.0 |
Defined in Data.Bitraversable Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Either a b -> f (Either c d) # | |
| Bifoldable Either | Since: base-4.10.0.0 |
| Bifunctor Either | Since: base-4.8.0.0 |
| Eq2 Either | Since: base-4.9.0.0 |
| Ord2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (Either a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] # | |
| Show2 Either | Since: base-4.9.0.0 |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| Bitraversable1 Either | |
Defined in Data.Semigroup.Traversable.Class Methods bitraverse1 :: Apply f => (a -> f b) -> (c -> f d) -> Either a c -> f (Either b d) # bisequence1 :: Apply f => Either (f a) (f b) -> f (Either a b) # | |
| Swapped Either | |
| () :=> (Monad (Either a)) | |
| () :=> (Functor (Either a)) | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Functor (Either a) | Since: base-3.0 |
| Applicative (Either e) | Since: base-3.0 |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # 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) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| Arbitrary a => Arbitrary1 (Either a) | |
Defined in Test.QuickCheck.Arbitrary Methods liftArbitrary :: Gen a0 -> Gen (Either a a0) # liftShrink :: (a0 -> [a0]) -> Either a a0 -> [Either a a0] # | |
| Eq a => Eq1 (Either a) | Since: base-4.9.0.0 |
| Ord a => Ord1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| Read a => Read1 (Either a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (Either a a0) # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] # | |
| Show a => Show1 (Either a) | Since: base-4.9.0.0 |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable a => Hashable1 (Either a) | |
Defined in Data.Hashable.Class | |
| PTraversable (Either a) | |
| STraversable (Either a) | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) # sMapM :: SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) # sFoldMap :: SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: Sing t1 -> Sing (Apply ToListSym0 t1) # sNull :: Sing t1 -> Sing (Apply NullSym0 t1) # sLength :: Sing t1 -> Sing (Apply LengthSym0 t1) # sElem :: SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) # sMinimum :: SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) # sSum :: SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) # sProduct :: SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) # | |
| PFunctor (Either a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative (Either e) | |
| PMonad (Either e) | |
| SFunctor (Either a) | |
| SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad (Either e) | |
| Generic1 (Either a :: Type -> Type) | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 |
Defined in 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 :: (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) # | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| Generic (Either a b) | |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| (Lift a, Lift b) => Lift (Either a b) | |
| (Arbitrary a, Arbitrary b) => Arbitrary (Either a b) | |
| (CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) | |
Defined in Test.QuickCheck.Arbitrary Methods coarbitrary :: Either a b -> Gen b0 -> Gen b0 # | |
| (Binary a, Binary b) => Binary (Either a b) | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| Recursive (Either a b) | |
Defined in Data.Functor.Foldable Methods project :: Either a b -> Base (Either a b) (Either a b) # cata :: (Base (Either a b) a0 -> a0) -> Either a b -> a0 # para :: (Base (Either a b) (Either a b, a0) -> a0) -> Either a b -> a0 # gpara :: (Corecursive (Either a b), Comonad w) => (forall b0. Base (Either a b) (w b0) -> w (Base (Either a b) b0)) -> (Base (Either a b) (EnvT (Either a b) w a0) -> a0) -> Either a b -> a0 # prepro :: Corecursive (Either a b) => (forall b0. Base (Either a b) b0 -> Base (Either a b) b0) -> (Base (Either a b) a0 -> a0) -> Either a b -> a0 # gprepro :: (Corecursive (Either a b), Comonad w) => (forall b0. Base (Either a b) (w b0) -> w (Base (Either a b) b0)) -> (forall c. Base (Either a b) c -> Base (Either a b) c) -> (Base (Either a b) (w a0) -> a0) -> Either a b -> a0 # | |
| Corecursive (Either a b) | |
Defined in Data.Functor.Foldable Methods embed :: Base (Either a b) (Either a b) -> Either a b # ana :: (a0 -> Base (Either a b) a0) -> a0 -> Either a b # apo :: (a0 -> Base (Either a b) (Either (Either a b) a0)) -> a0 -> Either a b # postpro :: Recursive (Either a b) => (forall b0. Base (Either a b) b0 -> Base (Either a b) b0) -> (a0 -> Base (Either a b) a0) -> a0 -> Either a b # gpostpro :: (Recursive (Either a b), Monad m) => (forall b0. m (Base (Either a b) b0) -> Base (Either a b) (m b0)) -> (forall c. Base (Either a b) c -> Base (Either a b) c) -> (a0 -> Base (Either a b) (m a0)) -> a0 -> Either a b # | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
| PSemigroup (Either a b) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq b) => SEq (Either a b) | |
| PEq (Either a b) | |
| (NFDataX a, NFDataX b) => NFDataX (Either a b) Source # | |
Defined in Clash.XException | |
| (ShowX a, ShowX b) => ShowX (Either a b) Source # | |
| (BitPack a, BitPack b) => BitPack (Either a b) Source # | |
| Bundle (Either a b) Source # | |
| Bundle (Either a b) Source # | |
| (Eq a, Eq b) :=> (Eq (Either a b)) | |
| (Ord a, Ord b) :=> (Ord (Either a b)) | |
| (Read a, Read b) :=> (Read (Either a b)) | |
| (Show a, Show b) :=> (Show (Either a b)) | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621679871419 b6989586621679871420] [b6989586621679871420] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621679871416 b6989586621679871417] ([a6989586621679871416], [b6989586621679871417]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621679871421 b6989586621679871422] [a6989586621679871421] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621679871408 b6989586621679871412) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621679871414 b6989586621679871415) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611241Sym0 :: TyFun Nat (Either a6989586621679076728 b6989586621679076729 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680035836Sym0 :: TyFun a6989586621679948780 (Either e6989586621680034892 a6989586621679948780) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679076729 (Either a6989586621679076728 b6989586621679076729) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679076728 (Either a6989586621679076728 b6989586621679076729) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680193021ASym0 :: TyFun k1 (Either a6989586621679076728 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (a ~ a', b ~ b') => Each (Either a a') (Either b b') a b |
Since: lens-4.18 |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Sum f g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (Product f g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :+: g) | |
| (FunctorWithIndex i f, FunctorWithIndex j g) => FunctorWithIndex (Either i j) (f :*: g) | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Sum f g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m # ifolded :: IndexedFold (Either i j) (Sum f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m # ifolded :: IndexedFold (Either i j) (Product f g a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :+: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) | |
Defined in Control.Lens.Indexed Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m # ifolded :: IndexedFold (Either i j) ((f :*: g) a) a # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Sum f g a -> f0 (Sum f g b) # itraversed :: IndexedTraversal (Either i j) (Sum f g a) (Sum f g b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> Product f g a -> f0 (Product f g b) # itraversed :: IndexedTraversal (Either i j) (Product f g a) (Product f g b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :+: g) a -> f0 ((f :+: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :+: g) a) ((f :+: g) b) a b # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) | |
Defined in Control.Lens.Indexed Methods itraverse :: Applicative f0 => (Either i j -> a -> f0 b) -> (f :*: g) a -> f0 ((f :*: g) b) # itraversed :: IndexedTraversal (Either i j) ((f :*: g) a) ((f :*: g) b) a b # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680611241Sym1 a6989586621680611238 a6989586621679076728 b6989586621679076729 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035960Sym0 :: TyFun (Either e6989586621680034909 a6989586621679948820) ((a6989586621679948820 ~> Either e6989586621680034909 b6989586621679948821) ~> Either e6989586621680034909 b6989586621679948821) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035848Sym0 :: TyFun (Either e6989586621680034892 (a6989586621679948781 ~> b6989586621679948782)) (Either e6989586621680034892 a6989586621679948781 ~> Either e6989586621680034892 b6989586621679948782) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679846018Sym1 a6989586621679846016 :: TyFun (Either a6989586621679076728 b6989586621679076729) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035666Sym0 :: TyFun a6989586621679948773 (Either a6989586621680034880 b6989586621679948775 ~> Either a6989586621680034880 a6989586621679948773) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621679867312 ~> c6989586621679867313) ((b6989586621679867314 ~> c6989586621679867313) ~> (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680035638Sym0 :: TyFun (a6989586621679948770 ~> b6989586621679948772) (Either a6989586621680034880 a6989586621679948770 ~> Either a6989586621680034880 b6989586621679948772) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035848Sym1 a6989586621680035846 :: TyFun (Either e6989586621680034892 a6989586621679948781) (Either e6989586621680034892 b6989586621679948782) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035666Sym1 a6989586621680035664 a6989586621680034880 b6989586621679948775 :: TyFun (Either a6989586621680034880 b6989586621679948775) (Either a6989586621680034880 a6989586621679948773) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680035638Sym1 a6989586621680035636 a6989586621680034880 :: TyFun (Either a6989586621680034880 a6989586621679948770) (Either a6989586621680034880 b6989586621679948772) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680973815Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Either a6989586621680972982 a6989586621680962759 ~> f6989586621680962758 (Either a6989586621680972982 b6989586621680962760)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621679867373 b6989586621679867314 :: TyFun (b6989586621679867314 ~> c6989586621679867313) (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680035960Sym1 a6989586621680035958 b6989586621679948821 :: TyFun (a6989586621679948820 ~> Either e6989586621680034909 b6989586621679948821) (Either e6989586621680034909 b6989586621679948821) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) # | |
| SuppressUnusedWarnings (Traverse_6989586621680973815Sym1 a6989586621680973813 a6989586621680972982 :: TyFun (Either a6989586621680972982 a6989586621680962759) (f6989586621680962758 (Either a6989586621680972982 b6989586621680962760)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621679867374 a6989586621679867373 :: TyFun (Either a6989586621679867312 b6989586621679867314) c6989586621679867313 -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| type Unbundled dom d (Either a b) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| type TryDomain t (Either a b) Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| type Unbundled dom (Either a b) Source # | |
Defined in Clash.Signal.Bundle | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679872656 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679872678 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679846018Sym1 a6989586621679846016 :: TyFun (Either a b) Ordering -> Type) (a6989586621679846017 :: Either a b) | |
| type Apply (Either_Sym2 a6989586621679867374 a6989586621679867373 :: TyFun (Either a b) c -> Type) (a6989586621679867375 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Eval (FoldMap f (Right x :: Either a3 a1) :: a2 -> Type) | |
| type Eval (FoldMap f (Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y (Right x :: Either a3 a1) :: a2 -> Type) | |
| type Eval (Foldr f y (Left _a :: Either a3 a1) :: a2 -> Type) | |
| type Product (arg :: Either a1 a2) | |
| type Sum (arg :: Either a1 a2) | |
| type Minimum (arg :: Either a1 a2) | |
| type Maximum (arg :: Either a1 a2) | |
| type Length (a2 :: Either a1 a6989586621680728581) | |
| type Null (a2 :: Either a1 a6989586621680728580) | |
| type ToList (arg :: Either a1 a2) | |
| type Fold (arg :: Either a m) | |
| type Pure (a :: k1) | |
| type Fail arg | |
| type Return (arg :: a) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type Elem (arg1 :: a1) (arg2 :: Either a2 a1) | |
| type Foldl1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type Foldr1 (arg1 :: a1 ~> (a1 ~> a1)) (arg2 :: Either a2 a1) | |
| type FoldMap (a2 :: a6989586621680728568 ~> k2) (a3 :: Either a1 a6989586621680728568) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679948775) | |
| type Fmap (a2 :: a6989586621679948770 ~> b6989586621679948772) (a3 :: Either a1 a6989586621679948770) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (a1 :: Either e (a6989586621679948781 ~> b6989586621679948782)) <*> (a2 :: Either e a6989586621679948781) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679948781 ~> b6989586621679948782)) <*> (a2 :: Either e a6989586621679948781) = Apply (Apply (TFHelper_6989586621680035848Sym0 :: TyFun (Either e (a6989586621679948781 ~> b6989586621679948782)) (Either e a6989586621679948781 ~> Either e b6989586621679948782) -> Type) a1) a2 | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a1 :: Either e a6989586621679948820) >>= (a2 :: a6989586621679948820 ~> Either e b6989586621679948821) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679948820) >>= (a2 :: a6989586621679948820 ~> Either e b6989586621679948821) = Apply (Apply (TFHelper_6989586621680035960Sym0 :: TyFun (Either e a6989586621679948820) ((a6989586621679948820 ~> Either e b6989586621679948821) ~> Either e b6989586621679948821) -> Type) a1) a2 | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a2 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (a3 :: Either a1 a6989586621680962759) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (a3 :: Either a1 a6989586621680962759) = Apply (Apply (Traverse_6989586621680973815Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Either a1 a6989586621680962759 ~> f6989586621680962758 (Either a1 b6989586621680962760)) -> Type) a2) a3 | |
| type Foldl' (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldl (arg1 :: b ~> (a1 ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr' (arg1 :: a1 ~> (b ~> b)) (arg2 :: b) (arg3 :: Either a2 a1) | |
| type Foldr (a2 :: a6989586621680728569 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680728569) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type Rep1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep1 (Either a :: Type -> Type) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) Par1)) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679872794 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679872838 :: [Either a b]) | |
| type Apply (Traverse_6989586621680973815Sym1 a6989586621680973813 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680973814 :: Either a2 a1) | |
| type Rep (Either a b) | Since: base-4.6.0.0 |
Defined in GHC.Generics type Rep (Either a b) = D1 (MetaData "Either" "Data.Either" "base" False) (C1 (MetaCons "Left" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)) :+: C1 (MetaCons "Right" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 b))) | |
| type Base (Either a b) | Example boring stub for non-recursive data types |
| data Sing (c :: Either a b) | |
| type Demote (Either a b) | |
| type BitSize (Either a b) Source # | |
Defined in Clash.Class.BitPack | |
| type Show_ (arg :: Either a b) | |
| type Sconcat (arg :: NonEmpty (Either a b)) | |
| type ShowList (arg1 :: [Either a b]) arg2 | |
| type (a2 :: Either a1 b) <> (a3 :: Either a1 b) | |
| type Min (arg1 :: Either a b) (arg2 :: Either a b) | |
| type Max (arg1 :: Either a b) (arg2 :: Either a b) | |
| type (arg1 :: Either a b) >= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) > (arg2 :: Either a b) | |
| type (arg1 :: Either a b) <= (arg2 :: Either a b) | |
| type (arg1 :: Either a b) < (arg2 :: Either a b) | |
| type Compare (a2 :: Either a1 b) (a3 :: Either a1 b) | |
| type (x :: Either a b) /= (y :: Either a b) | |
| type (a2 :: Either a1 b1) == (b2 :: Either a1 b1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Either a1 b) a4 | |
| type Apply (Pure_6989586621680035836Sym0 :: TyFun a (Either e6989586621680034892 a) -> Type) (a6989586621680035835 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b6989586621679076729) -> Type) (t6989586621679740925 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a6989586621679076728 b) -> Type) (t6989586621679740927 :: b) | |
| type Apply (Let6989586621680193021ASym0 :: TyFun k1 (Either a6989586621679076728 k1) -> Type) (wild_69895866216801905796989586621680193020 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621680611241Sym0 :: TyFun Nat (Either a6989586621679076728 b6989586621679076729 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680611238 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680611241Sym0 :: TyFun Nat (Either a6989586621679076728 b6989586621679076729 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680611238 :: Nat) = (ShowsPrec_6989586621680611241Sym1 a6989586621680611238 a6989586621679076728 b6989586621679076729 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Symbol ~> Symbol) -> Type) | |
| type Apply (TFHelper_6989586621680035666Sym0 :: TyFun a6989586621679948773 (Either a6989586621680034880 b6989586621679948775 ~> Either a6989586621680034880 a6989586621679948773) -> Type) (a6989586621680035664 :: a6989586621679948773) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035666Sym0 :: TyFun a6989586621679948773 (Either a6989586621680034880 b6989586621679948775 ~> Either a6989586621680034880 a6989586621679948773) -> Type) (a6989586621680035664 :: a6989586621679948773) = (TFHelper_6989586621680035666Sym1 a6989586621680035664 a6989586621680034880 b6989586621679948775 :: TyFun (Either a6989586621680034880 b6989586621679948775) (Either a6989586621680034880 a6989586621679948773) -> Type) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679872702 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) (a6989586621679846016 :: Either a6989586621679076728 b6989586621679076729) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679846018Sym0 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Either a6989586621679076728 b6989586621679076729 ~> Ordering) -> Type) (a6989586621679846016 :: Either a6989586621679076728 b6989586621679076729) = Compare_6989586621679846018Sym1 a6989586621679846016 | |
| type Apply (Fmap_6989586621680035638Sym0 :: TyFun (a6989586621679948770 ~> b6989586621679948772) (Either a6989586621680034880 a6989586621679948770 ~> Either a6989586621680034880 b6989586621679948772) -> Type) (a6989586621680035636 :: a6989586621679948770 ~> b6989586621679948772) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680035638Sym0 :: TyFun (a6989586621679948770 ~> b6989586621679948772) (Either a6989586621680034880 a6989586621679948770 ~> Either a6989586621680034880 b6989586621679948772) -> Type) (a6989586621680035636 :: a6989586621679948770 ~> b6989586621679948772) = (Fmap_6989586621680035638Sym1 a6989586621680035636 a6989586621680034880 :: TyFun (Either a6989586621680034880 a6989586621679948770) (Either a6989586621680034880 b6989586621679948772) -> Type) | |
| type Apply (TFHelper_6989586621680035848Sym0 :: TyFun (Either e6989586621680034892 (a6989586621679948781 ~> b6989586621679948782)) (Either e6989586621680034892 a6989586621679948781 ~> Either e6989586621680034892 b6989586621679948782) -> Type) (a6989586621680035846 :: Either e6989586621680034892 (a6989586621679948781 ~> b6989586621679948782)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035848Sym0 :: TyFun (Either e6989586621680034892 (a6989586621679948781 ~> b6989586621679948782)) (Either e6989586621680034892 a6989586621679948781 ~> Either e6989586621680034892 b6989586621679948782) -> Type) (a6989586621680035846 :: Either e6989586621680034892 (a6989586621679948781 ~> b6989586621679948782)) = TFHelper_6989586621680035848Sym1 a6989586621680035846 | |
| type Apply (ShowsPrec_6989586621680611241Sym1 a6989586621680611238 a6989586621679076728 b6989586621679076729 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Symbol ~> Symbol) -> Type) (a6989586621680611239 :: Either a6989586621679076728 b6989586621679076729) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680611241Sym1 a6989586621680611238 a6989586621679076728 b6989586621679076729 :: TyFun (Either a6989586621679076728 b6989586621679076729) (Symbol ~> Symbol) -> Type) (a6989586621680611239 :: Either a6989586621679076728 b6989586621679076729) = ShowsPrec_6989586621680611241Sym2 a6989586621680611238 a6989586621680611239 | |
| type Apply (Either_Sym0 :: TyFun (a6989586621679867312 ~> c6989586621679867313) ((b6989586621679867314 ~> c6989586621679867313) ~> (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313)) -> Type) (a6989586621679867373 :: a6989586621679867312 ~> c6989586621679867313) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621679867312 ~> c6989586621679867313) ((b6989586621679867314 ~> c6989586621679867313) ~> (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313)) -> Type) (a6989586621679867373 :: a6989586621679867312 ~> c6989586621679867313) = (Either_Sym1 a6989586621679867373 b6989586621679867314 :: TyFun (b6989586621679867314 ~> c6989586621679867313) (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313) -> Type) | |
| type Apply (TFHelper_6989586621680035960Sym0 :: TyFun (Either e6989586621680034909 a6989586621679948820) ((a6989586621679948820 ~> Either e6989586621680034909 b6989586621679948821) ~> Either e6989586621680034909 b6989586621679948821) -> Type) (a6989586621680035958 :: Either e6989586621680034909 a6989586621679948820) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680035960Sym0 :: TyFun (Either e6989586621680034909 a6989586621679948820) ((a6989586621679948820 ~> Either e6989586621680034909 b6989586621679948821) ~> Either e6989586621680034909 b6989586621679948821) -> Type) (a6989586621680035958 :: Either e6989586621680034909 a6989586621679948820) = (TFHelper_6989586621680035960Sym1 a6989586621680035958 b6989586621679948821 :: TyFun (a6989586621679948820 ~> Either e6989586621680034909 b6989586621679948821) (Either e6989586621680034909 b6989586621679948821) -> Type) | |
| type Apply (Fmap_6989586621680035638Sym1 a6989586621680035636 a1 :: TyFun (Either a1 a2) (Either a1 b) -> Type) (a6989586621680035637 :: Either a1 a2) | |
| type Apply (TFHelper_6989586621680035666Sym1 a6989586621680035664 a1 b :: TyFun (Either a1 b) (Either a1 a2) -> Type) (a6989586621680035665 :: Either a1 b) | |
| type Apply (TFHelper_6989586621680035848Sym1 a6989586621680035846 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680035847 :: Either e a) | |
| type Apply (TFHelper_6989586621680035960Sym1 a6989586621680035958 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680035959 :: a ~> Either e b) | |
| type Apply (Traverse_6989586621680973815Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Either a6989586621680972982 a6989586621680962759 ~> f6989586621680962758 (Either a6989586621680972982 b6989586621680962760)) -> Type) (a6989586621680973813 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680973815Sym0 :: TyFun (a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) (Either a6989586621680972982 a6989586621680962759 ~> f6989586621680962758 (Either a6989586621680972982 b6989586621680962760)) -> Type) (a6989586621680973813 :: a6989586621680962759 ~> f6989586621680962758 b6989586621680962760) = (Traverse_6989586621680973815Sym1 a6989586621680973813 a6989586621680972982 :: TyFun (Either a6989586621680972982 a6989586621680962759) (f6989586621680962758 (Either a6989586621680972982 b6989586621680962760)) -> Type) | |
| type Apply (Either_Sym1 a6989586621679867373 b6989586621679867314 :: TyFun (b6989586621679867314 ~> c6989586621679867313) (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313) -> Type) (a6989586621679867374 :: b6989586621679867314 ~> c6989586621679867313) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621679867373 b6989586621679867314 :: TyFun (b6989586621679867314 ~> c6989586621679867313) (Either a6989586621679867312 b6989586621679867314 ~> c6989586621679867313) -> Type) (a6989586621679867374 :: b6989586621679867314 ~> c6989586621679867313) = Either_Sym2 a6989586621679867373 a6989586621679867374 | |
| type Eval (Map f (Right a3 :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Map f (Left x :: Either a2 a1) :: Either a2 b -> Type) | |
| type Eval (Bimap f g (Right y :: Either a b1) :: Either a' b2 -> Type) | |
| type Eval (Bimap f g (Left x :: Either a1 b) :: Either a2 b' -> Type) | |
either :: (a -> c) -> (b -> c) -> Either a b -> c #
Case analysis for the Either type.
If the value is Left aa;
if it is Right bb.
Examples
We create two values of type Either String IntLeft constructor and another using the Right constructor. Then
we apply "either" the length function (if we have a String)
or the "times-two" function (if we have an Int):
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>either length (*2) s3>>>either length (*2) n6
appendFile :: FilePath -> String -> IO () #
The computation appendFile file str function appends the string str,
to the file file.
Note that writeFile and appendFile write a literal string
to a file. To write a value of any printable type, as with print,
use the show function to convert the value to a string first.
main = appendFile "squares" (show [(x,x*x) | x <- [0,0.1..2]])
writeFile :: FilePath -> String -> IO () #
The computation writeFile file str function writes the string str,
to the file file.
readFile :: FilePath -> IO String #
The readFile function reads a file and
returns the contents of the file as a string.
The file is read lazily, on demand, as with getContents.
interact :: (String -> String) -> IO () #
The interact function takes a function of type String->String
as its argument. The entire input from the standard input device is
passed to this function as its argument, and the resulting string is
output on the standard output device.
getContents :: IO String #
The getContents operation returns all user input as a single string,
which is read lazily as it is needed
(same as hGetContents stdin).
File and directory names are values of type String, whose precise
meaning is operating system dependent. Files can be opened, yielding a
handle which can then be used to operate on the contents of that file.
userError :: String -> IOError #
Construct an IOException value with a string describing the error.
The fail method of the IO instance of the Monad class raises a
userError, thus:
instance Monad IO where ... fail s = ioError (userError s)
type IOError = IOException #
The Haskell 2010 type for exceptions in the IO monad.
Any I/O operation may raise an IOException instead of returning a result.
For a more general type of exception, including also those that arise
in pure code, see Exception.
In Haskell 2010, this is an opaque type.
all :: Foldable t => (a -> Bool) -> t a -> Bool #
Determines whether all elements of the structure satisfy the predicate.
any :: Foldable t => (a -> Bool) -> t a -> Bool #
Determines whether any element of the structure satisfies the predicate.
sequence_ :: (Foldable t, Monad m) => t (m a) -> m () #
Evaluate each monadic action in the structure from left to right,
and ignore the results. For a version that doesn't ignore the
results see sequence.
As of base 4.8.0.0, sequence_ is just sequenceA_, specialized
to Monad.
words breaks a string up into a list of words, which were delimited
by white space.
>>>words "Lorem ipsum\ndolor"["Lorem","ipsum","dolor"]
lines breaks a string up into a list of strings at newline
characters. The resulting strings do not contain newlines.
Note that after splitting the string at newline characters, the last part of the string is considered a line even if it doesn't end with a newline. For example,
>>>lines ""[]
>>>lines "\n"[""]
>>>lines "one"["one"]
>>>lines "one\n"["one"]
>>>lines "one\n\n"["one",""]
>>>lines "one\ntwo"["one","two"]
>>>lines "one\ntwo\n"["one","two"]
Thus lines ss.
read :: Read a => String -> a #
The read function reads input from a string, which must be
completely consumed by the input process. read fails with an error if the
parse is unsuccessful, and it is therefore discouraged from being used in
real applications. Use readMaybe or readEither for safe alternatives.
>>>read "123" :: Int123
>>>read "hello" :: Int*** Exception: Prelude.read: no parse
The lex function reads a single lexeme from the input, discarding
initial white space, and returning the characters that constitute the
lexeme. If the input string contains only white space, lex returns a
single successful `lexeme' consisting of the empty string. (Thus
lex "" = [("","")]lex fails (i.e. returns []).
This lexer is not completely faithful to the Haskell lexical syntax in the following respects:
- Qualified names are not handled properly
- Octal and hexadecimal numerics are not recognized as a single token
- Comments are not treated properly
(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #
An infix synonym for fmap.
The name of this operator is an allusion to $.
Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function
application lifted over a Functor.
Examples
Convert from a Maybe IntMaybe Stringshow:
>>>show <$> NothingNothing>>>show <$> Just 3Just "3"
Convert from an Either Int IntEither IntString using show:
>>>show <$> Left 17Left 17>>>show <$> Right 17Right "17"
Double each element of a list:
>>>(*2) <$> [1,2,3][2,4,6]
Apply even to the second element of a pair:
>>>even <$> (2,2)(2,True)
lcm :: Integral a => a -> a -> a #
lcm x yx and y divide.
gcd :: Integral a => a -> a -> a #
gcd x yx and y of which
every common factor of x and y is also a factor; for example
gcd 4 2 = 2gcd (-4) 6 = 2gcd 0 44. gcd 0 00.
(That is, the common divisor that is "greatest" in the divisibility
preordering.)
Note: Since for signed fixed-width integer types, abs minBound < 0minBound0 or minBound
(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 #
raise a number to an integral power
showString :: String -> ShowS #
utility function converting a String to a show function that
simply prepends the string unchanged.
utility function converting a Char to a show function that
simply prepends the character unchanged.
lookup :: Eq a => a -> [(a, b)] -> Maybe b #
lookup key assocs looks up a key in an association list.
break :: (a -> Bool) -> [a] -> ([a], [a]) #
break, applied to a predicate p and a list xs, returns a tuple where
first element is longest prefix (possibly empty) of xs of elements that
do not satisfy p and second element is the remainder of the list:
break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4]) break (< 9) [1,2,3] == ([],[1,2,3]) break (> 9) [1,2,3] == ([1,2,3],[])
span :: (a -> Bool) -> [a] -> ([a], [a]) #
span, applied to a predicate p and a list xs, returns a tuple where
first element is longest prefix (possibly empty) of xs of elements that
satisfy p and second element is the remainder of the list:
span (< 3) [1,2,3,4,1,2,3,4] == ([1,2],[3,4,1,2,3,4]) span (< 9) [1,2,3] == ([1,2,3],[]) span (< 0) [1,2,3] == ([],[1,2,3])
takeWhile :: (a -> Bool) -> [a] -> [a] #
takeWhile, applied to a predicate p and a list xs, returns the
longest prefix (possibly empty) of xs of elements that satisfy p:
takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2] takeWhile (< 9) [1,2,3] == [1,2,3] takeWhile (< 0) [1,2,3] == []
cycle ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity
on infinite lists.
maybe :: b -> (a -> b) -> Maybe a -> b #
The maybe function takes a default value, a function, and a Maybe
value. If the Maybe value is Nothing, the function returns the
default value. Otherwise, it applies the function to the value inside
the Just and returns the result.
Examples
Basic usage:
>>>maybe False odd (Just 3)True
>>>maybe False odd NothingFalse
Read an integer from a string using readMaybe. If we succeed,
return twice the integer; that is, apply (*2) to it. If instead
we fail to parse an integer, return 0 by default:
>>>import Text.Read ( readMaybe )>>>maybe 0 (*2) (readMaybe "5")10>>>maybe 0 (*2) (readMaybe "")0
Apply show to a Maybe Int. If we have Just n, we want to show
the underlying Int n. But if we have Nothing, we return the
empty string instead of (for example) "Nothing":
>>>maybe "" show (Just 5)"5">>>maybe "" show Nothing""
uncurry :: (a -> b -> c) -> (a, b) -> c #
uncurry converts a curried function to a function on pairs.
Examples
>>>uncurry (+) (1,2)3
>>>uncurry ($) (show, 1)"1"
>>>map (uncurry max) [(1,2), (3,4), (6,8)][2,4,8]
until :: (a -> Bool) -> (a -> a) -> a -> a #
until p ff until p holds.
($!) :: (a -> b) -> a -> b infixr 0 #
Strict (call-by-value) application operator. It takes a function and an argument, evaluates the argument to weak head normal form (WHNF), then calls the function with that value.
flip :: (a -> b -> c) -> b -> a -> c #
flip ff.
>>>flip (++) "hello" "world""worldhello"
const x is a unary function which evaluates to x for all inputs.
>>>const 42 "hello"42
>>>map (const 42) [0..3][42,42,42,42]
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=, but with the arguments interchanged.
errorWithoutStackTrace :: [Char] -> a #
A variant of error that does not produce a stack trace.
Since: base-4.9.0.0
error :: HasCallStack => [Char] -> a #
error stops execution and displays an error message.