| Copyright | (C) 2019 QBayLogic B.V. (C) 2021 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 those functions that the Clash API defines to work on
Vec from Clash.Sized.Vector instead of on lists as the
Haskell Prelude does. In addition, for the odd and
even functions a type class called
Parity is available at Clash.Class.Parity.
Synopsis
- seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b
- filter :: (a -> Bool) -> [a] -> [a]
- print :: Show a => a -> IO ()
- fst :: (a, b) -> a
- snd :: (a, b) -> b
- otherwise :: Bool
- ($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (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 Monad m => MonadFail (m :: Type -> Type) 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)]
- 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]
- maybe :: b -> (a -> b) -> Maybe a -> b
- (<$>) :: Functor f => (a -> b) -> f a -> f 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
- ($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (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 :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a
- error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a
- (&&) :: Bool -> Bool -> Bool
- (||) :: Bool -> Bool -> Bool
- not :: Bool -> Bool
Documentation
seq :: forall (r :: RuntimeRep) a (b :: TYPE r). a -> b -> b infixr 0 Source #
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] Source #
\(\mathcal{O}(n)\). 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]
>>>filter odd [1, 2, 3][1,3]
print :: Show a => a -> IO () Source #
The print function outputs a value of any printable type to the
standard output device.
Printable types are those that are instances of class Show; print
converts values to strings for output using the show operation and
adds a newline.
For example, a program to print the first 20 integers and their powers of 2 could be written as:
main = print ([(n, 2^n) | n <- [0..19]])
($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b infixr 0 Source #
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 where $ Truefoo :: Bool -> Int# is well-typed.
fromIntegral :: (Integral a, Num b) => a -> b Source #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b Source #
general coercion to fractional types
class Bounded a where Source #
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
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] Source #
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] Source #
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] Source #
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 Source #
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 Source #
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
(/) :: a -> a -> a infixl 7 Source #
Fractional division.
Reciprocal fraction.
fromRational :: Rational -> a Source #
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 Source #
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 Source #
integer division truncated toward zero
rem :: a -> a -> a infixl 7 Source #
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
div :: a -> a -> a infixl 7 Source #
integer division truncated toward negative infinity
mod :: a -> a -> a infixl 7 Source #
integer modulus, satisfying
(x `div` y)*y + (x `mod` y) == x
quotRem :: a -> a -> (a, a) Source #
divMod :: a -> a -> (a, a) Source #
toInteger :: a -> Integer Source #
conversion to Integer
Instances
class Applicative m => Monad (m :: Type -> Type) where Source #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following:
- Left identity
returna>>=k = k a- Right identity
m>>=return= m- Associativity
m>>=(\x -> k x>>=h) = (m>>=k)>>=h
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 Source #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
'as ' can be understood as the >>= bsdo expression
do a <- as bs a
(>>) :: m a -> m b -> m b infixl 1 Source #
Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.
'as ' can be understood as the >> bsdo expression
do as bs
Inject a value into the monadic type.
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 Solo | |
| 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 Source # (>>) :: SmallArray a -> SmallArray b -> SmallArray b Source # return :: a -> SmallArray a Source # | |
| Monad Array | |
| Monad PprM | |
| Monad Vector | |
| Monad Id | |
| Monad P | Since: base-2.1 |
| Monad SimOnly Source # | |
| Monad SimIO Source # | |
| () :=> (Monad ((->) a :: Type -> Type)) | |
| () :=> (Monad []) | |
| () :=> (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 Source # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source # return :: a -> WrappedMonad m a Source # | |
| ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b Source # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b Source # return :: a0 -> ArrowMonad a a0 Source # | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad m => Monad (MaybeT m) | |
| Monad (F f) | |
| Functor f => Monad (Free f) | |
| Alternative f => Monad (Cofree 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 Source # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b Source # return :: a -> ReifiedGetter s a Source # | |
| Monad (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b Source # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b Source # return :: a -> ReifiedFold s a Source # | |
| Semigroup a => Monad (These a) | |
| Semigroup a => Monad (These a) | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint | |
| (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) Source # | |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| (Monoid a, Monoid b) => Monad ((,,) a b) | Since: base-4.14.0.0 |
| Monad m => Monad (Kleisli m a) | Since: base-4.14.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| Monad m => Monad (IdentityT m) | |
| (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 Source # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source # return :: a -> WhenMissing f x a Source # | |
| Monad m => Monad (ExceptT e m) | |
| (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 m => Monad (StateT s m) | |
| Monad (Tagged s) | |
| Monad (Indexed i a) | |
| Monad m => Monad (ReaderT r m) | |
| Monad m => Monad (StateT s m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monoid w, Monad m) => Monad (WriterT w m) | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad m => Monad (Reverse m) | Derived instance. |
| (Monoid w, Functor m, Monad m) => Monad (AccumT w m) | |
| Monad m => Monad (SelectT r 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 |
| (Monoid a, Monoid b, Monoid c) => Monad ((,,,) a b c) | Since: base-4.14.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 Source # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source # return :: a -> WhenMatched f x y a Source # | |
| (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 Source # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source # return :: a -> WhenMissing f k x a Source # | |
| Monad (ContT r m) | |
| 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 Source # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source # return :: a -> WhenMatched f k x y a Source # | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
| (Monoid w, Monad m) => Monad (RWST r w s m) | |
class Functor (f :: Type -> Type) where Source #
A type f is a Functor if it provides a function fmap which, given any types a and b
lets you apply any function from (a -> b) to turn an f a into an f b, preserving the
structure of f. Furthermore f needs to adhere to the following:
Note, that the second law follows from the free theorem of the type fmap and
the first law, so you need only check that the former condition holds.
Minimal complete definition
Methods
fmap :: (a -> b) -> f a -> f b Source #
Using ApplicativeDo: 'fmap f asdo expression
do a <- as pure (f a)
with an inferred Functor constraint.
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 + xfromInteger0x + fromInteger 0=xnegategives the additive inversex + negate x=fromInteger 0- Associativity of
(*) (x * y) * z=x * (y * z)fromInteger1x * 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
(+) :: a -> a -> a infixl 6 Source #
(-) :: a -> a -> a infixl 6 Source #
(*) :: a -> a -> a infixl 7 Source #
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 Source #
Conversion from an Integer.
An integer literal represents the application of the function
fromInteger to the appropriate value of type Integer,
so such literals have type (.Num a) => a
Instances
class Eq a => Ord a where Source #
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
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
Note that (7.) and (8.) do not require min and max to return either of
their arguments. The result is merely required to equal one of the
arguments in terms of (==).
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
Methods
compare :: a -> a -> Ordering Source #
(<) :: a -> a -> Bool infix 4 Source #
(<=) :: a -> a -> Bool infix 4 Source #
(>) :: a -> a -> Bool infix 4 Source #
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 CDev | |
| Read CIno | |
| Read CMode | |
| Read COff | |
| Read CPid | |
| Read CSsize | |
| Read CGid | |
| Read CNlink | |
| Read CUid | |
| Read CCc | |
| Read CSpeed | |
| Read CTcflag | |
| Read CRLim | |
| Read CBlkSize | |
| Read CBlkCnt | |
| Read CClockId | |
| Read CFsBlkCnt | |
| Read CFsFilCnt | |
| Read CId | |
| Read CKey | |
| Read CSocklen | |
| Read CNfds | |
| Read Fd | |
| Read ExitCode | |
| Read BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types | |
| Read Newline | Since: base-4.3.0.0 |
| Read NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types | |
| 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 | |
| Read SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Read SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Read DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Read SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits | |
| 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 | |
| Read CClock | |
| Read CTime | |
| Read CUSeconds | |
| Read CSUSeconds | |
Defined in Foreign.C.Types | |
| 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 |
| Read ByteString | |
Defined in Data.ByteString.Lazy.Internal | |
| Read ByteString | |
Defined in Data.ByteString.Internal | |
| Read ShortByteString | |
Defined in Data.ByteString.Short.Internal | |
| Read IntSet | |
| Read Half | |
| Read DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype | |
| Read PrimitiveWarning Source # | |
Defined in Clash.Annotations.Primitive | |
| Read Primitive Source # | |
| Read HDL Source # | |
| Read VDomainConfiguration Source # | |
Defined in Clash.Signal.Internal | |
| Read InitBehavior Source # | |
Defined in Clash.Signal.Internal | |
| Read ResetPolarity Source # | |
Defined in Clash.Signal.Internal | |
| Read ResetKind Source # | |
| Read ActiveEdge Source # | |
Defined in Clash.Signal.Internal | |
| Class () (Read a) | |
| a :=> (Read (Dict a)) | |
| () :=> (Read Bool) | |
| () :=> (Read Char) | |
| () :=> (Read Int) | |
| () :=> (Read Natural) | |
| () :=> (Read Ordering) | |
| () :=> (Read Word) | |
| () :=> (Read ()) | |
| 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 (Solo a) | |
| Read a => Read (Complex a) | Since: base-2.1 |
| 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) Source # readList :: ReadS [WrappedMonoid m] Source # readPrec :: ReadPrec (WrappedMonoid m) Source # readListPrec :: ReadPrec [WrappedMonoid m] Source # | |
| 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) | This instance would be equivalent to the derived instances of the
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 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) | |
| Read1 f => Read (Fix f) | |
| (Functor f, Read1 f) => Read (Mu f) | |
| (Functor f, Read1 f) => Read (Nu f) | |
| (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) | |
| (Ord a, Read a) => Read (OSet a) | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) Source # readList :: ReadS [SmallArray a] Source # readPrec :: ReadPrec (SmallArray a) Source # readListPrec :: ReadPrec [SmallArray a] Source # | |
| Read a => Read (Array a) | |
| Read a => Read (Maybe a) | |
| Read a => Read (Vector a) | |
| Read a => Read (PrimitiveGuard a) Source # | |
Defined in Clash.Annotations.Primitive Methods readsPrec :: Int -> ReadS (PrimitiveGuard a) Source # readList :: ReadS [PrimitiveGuard a] Source # readPrec :: ReadPrec (PrimitiveGuard a) Source # readListPrec :: ReadPrec [PrimitiveGuard a] Source # | |
| 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 ix, Read ix, Read e, IArray UArray e) => Read (UArray ix e) | |
| (Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
| HasResolution a => Read (Fixed a) | Since: base-4.3.0.0 |
| (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 m, Read a) => Read (MaybeT m a) | |
| (Read1 f, Read a) => Read (Free f a) | |
| (Read1 f, Read a) => Read (Cofree 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) | |
| (Ord k, Read k, Read v) => Read (OMap k v) | Value-lazy |
| (Read a, Read b) => Read (ListF a b) | |
| (Read a, Read b) => Read (NonEmptyF a b) | |
| (Read a, Read b) => Read (TreeF a b) | |
| (Read a, Read b) => Read (Pair a b) | |
| (Read a, Read b) => Read (These a b) | |
| (Read a, Read b) => Read (Either a b) | |
| (Read a, Read b) => Read (These a b) | |
| (Read1 f, Read a) => Read (Lift f a) | |
| (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) | |
| (Read1 f, Read a) => Read (IdentityT f a) | |
| (Read e, Read1 m, Read a) => Read (ExceptT e m 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) | |
| (Read1 f, Read a) => Read (Backwards f a) | |
| Read b => Read (Tagged s b) | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
| (Read w, Read1 m, Read a) => Read (WriterT w m a) | |
| Read a => Read (Constant a b) | |
| (Read1 f, Read a) => Read (Reverse f a) | |
| (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) Source # readList :: ReadS [WrappedBifunctor p a b] Source # readPrec :: ReadPrec (WrappedBifunctor p a b) Source # readListPrec :: ReadPrec [WrappedBifunctor p a b] Source # | |
| 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 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 |
Defined in GHC.Read | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
Defined in GHC.Read | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n)] Source # | |
| (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 Methods readsPrec :: Int -> ReadS (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # readList :: ReadS [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] Source # readPrec :: ReadPrec (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # readListPrec :: ReadPrec [(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)] Source # | |
class (Num a, Ord a) => Real a where Source #
Methods
toRational :: a -> Rational Source #
the rational equivalent of its real argument with full precision
Instances
class (RealFrac a, Floating a) => RealFloat a where Source #
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 Source #
a constant function, returning the radix of the representation
(often 2)
floatDigits :: a -> Int Source #
a constant function, returning the number of digits of
floatRadix in the significand
floatRange :: a -> (Int, Int) Source #
a constant function, returning the lowest and highest values the exponent may assume
decodeFloat :: a -> (Integer, Int) Source #
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 Source #
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 Source #
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 Source #
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 Source #
True if the argument is an IEEE infinity or negative infinity
isDenormalized :: a -> Bool Source #
True if the argument is too small to be represented in
normalized format
isNegativeZero :: a -> Bool Source #
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 Source #
Extracting components of fractions.
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) Source #
The function properFraction takes a real fractional number x
and returns a pair (n,f) such that x = n+f, and:
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 Source #
truncate xx between zero and x
round :: Integral b => a -> b Source #
round xx;
the even integer if x is equidistant between two integers
ceiling :: Integral b => a -> b Source #
ceiling xx
floor :: Integral b => a -> b Source #
floor xx
Instances
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 Monad m => MonadFail (m :: Type -> Type) where Source #
When a value is bound in do-notation, the pattern on the left
hand side of <- might not match. In this case, this class
provides a function to recover.
A Monad without a MonadFail instance may only be used in conjunction
with pattern that always match, such as newtypes, tuples, data types with
only a single data constructor, and irrefutable patterns (~pat).
Instances of MonadFail should satisfy the following law: fail s should
be a left zero for >>=,
fail s >>= f = fail s
If your Monad is also MonadPlus, a popular definition is
fail _ = mzero
Since: base-4.9.0.0
Instances
class Functor f => Applicative (f :: Type -> Type) where Source #
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 Source #
Sequential application.
A few functors support an implementation of <*> that is more
efficient than the default one.
Using ApplicativeDo: 'fs ' can be understood as
the <*> asdo expression
do f <- fs a <- as pure (f a)
(*>) :: f a -> f b -> f b infixl 4 Source #
Sequence actions, discarding the value of the first argument.
'as ' can be understood as the *> bsdo expression
do as bs
This is a tad complicated for our ApplicativeDo extension
which will give it a Monad constraint. For an Applicative
constraint we write it of the form
do _ <- as b <- bs pure b
(<*) :: f a -> f b -> f a infixl 4 Source #
Sequence actions, discarding the value of the second argument.
Using ApplicativeDo: 'as ' can be understood as
the <* bsdo expression
do a <- as bs pure a
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 Solo | |
| 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 |
Defined in Control.Applicative | |
| Applicative Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| 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 |
Defined in Data.Semigroup.Internal | |
| Applicative Down | Since: base-4.11.0.0 |
| Applicative ReadPrec | Since: base-4.6.0.0 |
Defined in Text.ParserCombinators.ReadPrec | |
| Applicative ReadP | Since: base-4.6.0.0 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
Defined in GHC.Base | |
| 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 Source # (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b Source # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c Source # (*>) :: SmallArray a -> SmallArray b -> SmallArray b Source # (<*) :: SmallArray a -> SmallArray b -> SmallArray a Source # | |
| Applicative Array | |
| Applicative PprM | |
| Applicative Vector | |
| Applicative Id | |
| Applicative P | Since: base-4.5.0.0 |
| Applicative MaybeX Source # | Note that |
| Applicative SimOnly Source # | |
| Applicative SimIO Source # | |
| () :=> (Applicative ((->) a :: Type -> Type)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative ((->) a) Source # | |
| () :=> (Applicative []) | |
Defined in Data.Constraint Methods ins :: () :- Applicative [] Source # | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint | |
| () :=> (Applicative IO) | |
Defined in Data.Constraint | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint | |
| Applicative (Either e) | Since: base-3.0 |
Defined in Data.Either | |
| 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 Source # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b Source # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c Source # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b Source # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a Source # | |
| Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 Source # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b Source # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c Source # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b Source # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 Source # | |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| (Functor m, Monad m) => Applicative (MaybeT m) | |
Defined in Control.Monad.Trans.Maybe | |
| Applicative (F f) | |
| Functor f => Applicative (Free f) | |
| Alternative f => Applicative (Cofree f) | |
Defined in Control.Comonad.Cofree | |
| Applicative f => Applicative (Yoneda f) | |
Defined in Data.Functor.Yoneda | |
| Applicative (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a Source # (<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b Source # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c Source # (*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b Source # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a Source # | |
| Applicative (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a Source # (<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b Source # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c Source # (*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b Source # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a Source # | |
| Applicative f => Applicative (Indexing f) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing f a Source # (<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b Source # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c Source # (*>) :: Indexing f a -> Indexing f b -> Indexing f b Source # (<*) :: Indexing f a -> Indexing f b -> Indexing f a Source # | |
| Applicative f => Applicative (Indexing64 f) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a Source # (<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b Source # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c Source # (*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b Source # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a Source # | |
| Semigroup a => Applicative (These a) | |
Defined in Data.Strict.These | |
| Semigroup a => Applicative (These a) | |
Defined in Data.These | |
| Applicative f => Applicative (Lift f) | A combination is |
| KnownNat n => Applicative (Vec n) Source # | |
| Applicative (Signal dom) Source # | |
Defined in Clash.Signal.Internal Methods pure :: a -> Signal dom a Source # (<*>) :: Signal dom (a -> b) -> Signal dom a -> Signal dom b Source # liftA2 :: (a -> b -> c) -> Signal dom a -> Signal dom b -> Signal dom c Source # (*>) :: Signal dom a -> Signal dom b -> Signal dom b Source # (<*) :: Signal dom a -> Signal dom b -> Signal dom a Source # | |
| KnownNat d => Applicative (RTree d) Source # | |
Defined in Clash.Sized.RTree | |
| Class (Functor f) (Applicative f) | |
Defined in Data.Constraint | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint | |
| Class (Applicative f) (Alternative f) | |
Defined in Data.Constraint Methods cls :: Alternative f :- Applicative f Source # | |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) Source # | |
| (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 |
| (Monoid a, Monoid b) => Applicative ((,,) a b) | Since: base-4.14.0.0 |
Defined in GHC.Base | |
| Applicative m => Applicative (Kleisli m a) | Since: base-4.14.0.0 |
Defined in Control.Arrow Methods pure :: a0 -> Kleisli m a a0 Source # (<*>) :: Kleisli m a (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b Source # liftA2 :: (a0 -> b -> c) -> Kleisli m a a0 -> Kleisli m a b -> Kleisli m a c Source # (*>) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a b Source # (<*) :: Kleisli m a a0 -> Kleisli m a b -> Kleisli m a a0 Source # | |
| Arrow a => Applicative (Automaton a b) | |
Defined in Control.Arrow.Transformer.Automaton Methods pure :: a0 -> Automaton a b a0 Source # (<*>) :: Automaton a b (a0 -> b0) -> Automaton a b a0 -> Automaton a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> Automaton a b a0 -> Automaton a b b0 -> Automaton a b c Source # (*>) :: Automaton a b a0 -> Automaton a b b0 -> Automaton a b b0 Source # (<*) :: Automaton a b a0 -> Automaton a b b0 -> Automaton a b a0 Source # | |
| Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 Source # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c Source # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 Source # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 Source # | |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
Defined in Data.Functor.Const | |
| 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) | |
Defined in Control.Comonad.Trans.Env | |
| Applicative m => Applicative (IdentityT m) | |
Defined in Control.Monad.Trans.Identity Methods pure :: a -> IdentityT m a Source # (<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b Source # liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c Source # (*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b Source # (<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a Source # | |
| (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 Source # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b Source # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c Source # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b Source # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a Source # | |
| (Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except Methods pure :: a -> ExceptT e m a Source # (<*>) :: ExceptT e m (a -> b) -> ExceptT e m a -> ExceptT e m b Source # liftA2 :: (a -> b -> c) -> ExceptT e m a -> ExceptT e m b -> ExceptT e m c Source # (*>) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m b Source # (<*) :: ExceptT e m a -> ExceptT e m b -> ExceptT e m a Source # | |
| (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 Methods pure :: a -> CofreeT f w a Source # (<*>) :: CofreeT f w (a -> b) -> CofreeT f w a -> CofreeT f w b Source # liftA2 :: (a -> b -> c) -> CofreeT f w a -> CofreeT f w b -> CofreeT f w c Source # (*>) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w b Source # (<*) :: CofreeT f w a -> CofreeT f w b -> CofreeT f w a Source # | |
| Applicative f => Applicative (Indexing f) | |
Defined in WithIndex Methods pure :: a -> Indexing f a Source # (<*>) :: Indexing f (a -> b) -> Indexing f a -> Indexing f b Source # liftA2 :: (a -> b -> c) -> Indexing f a -> Indexing f b -> Indexing f c Source # (*>) :: Indexing f a -> Indexing f b -> Indexing f b Source # (<*) :: Indexing f a -> Indexing f b -> Indexing f a Source # | |
| (Applicative f, Applicative g) => Applicative (Day f g) | |
Defined in Data.Functor.Day | |
| (Functor m, Monad m) => Applicative (ErrorT e m) | |
Defined in Control.Monad.Trans.Error Methods pure :: a -> ErrorT e m a Source # (<*>) :: ErrorT e m (a -> b) -> ErrorT e m a -> ErrorT e m b Source # liftA2 :: (a -> b -> c) -> ErrorT e m a -> ErrorT e m b -> ErrorT e m c Source # (*>) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m b Source # (<*) :: ErrorT e m a -> ErrorT e m b -> ErrorT e m a Source # | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a Source # (<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b Source # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c Source # (*>) :: StateT s m a -> StateT s m b -> StateT s m b Source # (<*) :: StateT s m a -> StateT s m b -> StateT s m a Source # | |
| Applicative f => Applicative (Backwards f) | Apply |
Defined in Control.Applicative.Backwards Methods pure :: a -> Backwards f a Source # (<*>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b Source # liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c Source # (*>) :: Backwards f a -> Backwards f b -> Backwards f b Source # (<*) :: Backwards f a -> Backwards f b -> Backwards f a Source # | |
| Applicative (Tagged s) | |
Defined in Data.Tagged | |
| Applicative (Mafic a b) | |
Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Mafic a b a0 Source # (<*>) :: Mafic a b (a0 -> b0) -> Mafic a b a0 -> Mafic a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> Mafic a b a0 -> Mafic a b b0 -> Mafic a b c Source # (*>) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b b0 Source # (<*) :: Mafic a b a0 -> Mafic a b b0 -> Mafic a b a0 Source # | |
| Applicative (Indexed i a) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a0 -> Indexed i a a0 Source # (<*>) :: Indexed i a (a0 -> b) -> Indexed i a a0 -> Indexed i a b Source # liftA2 :: (a0 -> b -> c) -> Indexed i a a0 -> Indexed i a b -> Indexed i a c Source # (*>) :: Indexed i a a0 -> Indexed i a b -> Indexed i a b Source # (<*) :: Indexed i a a0 -> Indexed i a b -> Indexed i a a0 Source # | |
| Applicative (Flows i b) | This is an illegal |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader Methods pure :: a -> ReaderT r m a Source # (<*>) :: ReaderT r m (a -> b) -> ReaderT r m a -> ReaderT r m b Source # liftA2 :: (a -> b -> c) -> ReaderT r m a -> ReaderT r m b -> ReaderT r m c Source # (*>) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m b Source # (<*) :: ReaderT r m a -> ReaderT r m b -> ReaderT r m a Source # | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a Source # (<*>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b Source # liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c Source # (*>) :: StateT s m a -> StateT s m b -> StateT s m b Source # (<*) :: StateT s m a -> StateT s m b -> StateT s m a Source # | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a Source # (<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b Source # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c Source # (*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a Source # | |
| (Monoid w, Applicative m) => Applicative (WriterT w m) | |
Defined in Control.Monad.Trans.Writer.Strict Methods pure :: a -> WriterT w m a Source # (<*>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b Source # liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c Source # (*>) :: WriterT w m a -> WriterT w m b -> WriterT w m b Source # (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a Source # | |
| (Applicative (Rep p), Representable p) => Applicative (Prep p) | |
| Monoid a => Applicative (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant Methods pure :: a0 -> Constant a a0 Source # (<*>) :: Constant a (a0 -> b) -> Constant a a0 -> Constant a b Source # liftA2 :: (a0 -> b -> c) -> Constant a a0 -> Constant a b -> Constant a c Source # (*>) :: Constant a a0 -> Constant a b -> Constant a b Source # (<*) :: Constant a a0 -> Constant a b -> Constant a a0 Source # | |
| Applicative f => Applicative (Reverse f) | Derived instance. |
Defined in Data.Functor.Reverse | |
| (Monoid w, Functor m, Monad m) => Applicative (AccumT w m) | |
Defined in Control.Monad.Trans.Accum Methods pure :: a -> AccumT w m a Source # (<*>) :: AccumT w m (a -> b) -> AccumT w m a -> AccumT w m b Source # liftA2 :: (a -> b -> c) -> AccumT w m a -> AccumT w m b -> AccumT w m c Source # (*>) :: AccumT w m a -> AccumT w m b -> AccumT w m b Source # (<*) :: AccumT w m a -> AccumT w m b -> AccumT w m a Source # | |
| (Functor m, Monad m) => Applicative (SelectT r m) | |
Defined in Control.Monad.Trans.Select Methods pure :: a -> SelectT r m a Source # (<*>) :: SelectT r m (a -> b) -> SelectT r m a -> SelectT r m b Source # liftA2 :: (a -> b -> c) -> SelectT r m a -> SelectT r m b -> SelectT r m c Source # (*>) :: SelectT r m a -> SelectT r m b -> SelectT r m b Source # (<*) :: SelectT r m a -> SelectT r m b -> SelectT r m a Source # | |
| Applicative (DSignal dom delay) Source # | |
Defined in Clash.Signal.Delayed.Internal Methods pure :: a -> DSignal dom delay a Source # (<*>) :: DSignal dom delay (a -> b) -> DSignal dom delay a -> DSignal dom delay b Source # liftA2 :: (a -> b -> c) -> DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay c Source # (*>) :: DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay b Source # (<*) :: DSignal dom delay a -> DSignal dom delay b -> DSignal dom delay a Source # | |
| Applicative (Mag a b) | |
Defined in Data.Biapplicative | |
| Monoid m => Applicative (Holes t m) | |
Defined in Control.Lens.Traversal | |
| Applicative ((->) r :: 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 |
Defined in GHC.Generics | |
| (Monoid a, Monoid b, Monoid c) => Applicative ((,,,) a b c) | Since: base-4.14.0.0 |
Defined in GHC.Base Methods pure :: a0 -> (a, b, c, a0) Source # (<*>) :: (a, b, c, a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) Source # liftA2 :: (a0 -> b0 -> c0) -> (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, c0) Source # (*>) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, b0) Source # (<*) :: (a, b, c, a0) -> (a, b, c, b0) -> (a, b, c, a0) Source # | |
| (Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods pure :: a -> Product f g a Source # (<*>) :: Product f g (a -> b) -> Product f g a -> Product f g b Source # liftA2 :: (a -> b -> c) -> Product f g a -> Product f g b -> Product f g c Source # (*>) :: Product f g a -> Product f g b -> Product f g b Source # (<*) :: Product f g a -> Product f g b -> Product f g a Source # | |
| Applicative (Cokleisli w a) | |
Defined in Control.Comonad Methods pure :: a0 -> Cokleisli w a a0 Source # (<*>) :: Cokleisli w a (a0 -> b) -> Cokleisli w a a0 -> Cokleisli w a b Source # liftA2 :: (a0 -> b -> c) -> Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a c Source # (*>) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a b Source # (<*) :: Cokleisli w a a0 -> Cokleisli w a b -> Cokleisli w a a0 Source # | |
| (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 Source # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b Source # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c Source # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b Source # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a Source # | |
| (Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a Source # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b Source # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c Source # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b Source # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a Source # | |
| Applicative (Molten i a b) | |
Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> Molten i a b a0 Source # (<*>) :: Molten i a b (a0 -> b0) -> Molten i a b a0 -> Molten i a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> Molten i a b a0 -> Molten i a b b0 -> Molten i a b c Source # (*>) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b b0 Source # (<*) :: Molten i a b a0 -> Molten i a b b0 -> Molten i a b a0 Source # | |
| Applicative (Bazaar p a b) | |
Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> Bazaar p a b a0 Source # (<*>) :: Bazaar p a b (a0 -> b0) -> Bazaar p a b a0 -> Bazaar p a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b c Source # (*>) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b b0 Source # (<*) :: Bazaar p a b a0 -> Bazaar p a b b0 -> Bazaar p a b a0 Source # | |
| Applicative (ContT r m) | |
Defined in Control.Monad.Trans.Cont | |
| Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| (Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a Source # (<*>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b Source # liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c Source # (*>) :: Compose f g a -> Compose f g b -> Compose f g b Source # (<*) :: Compose f g a -> Compose f g b -> Compose f g a Source # | |
| (Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a Source # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b Source # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c Source # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b Source # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a Source # | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Strict Methods pure :: a -> RWST r w s m a Source # (<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b Source # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c Source # (*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a Source # | |
| Applicative (TakingWhile p f a b) | |
Defined in Control.Lens.Internal.Magma Methods pure :: a0 -> TakingWhile p f a b a0 Source # (<*>) :: TakingWhile p f a b (a0 -> b0) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b c Source # (*>) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b b0 Source # (<*) :: TakingWhile p f a b a0 -> TakingWhile p f a b b0 -> TakingWhile p f a b a0 Source # | |
| Applicative (BazaarT p g a b) | |
Defined in Control.Lens.Internal.Bazaar Methods pure :: a0 -> BazaarT p g a b a0 Source # (<*>) :: BazaarT p g a b (a0 -> b0) -> BazaarT p g a b a0 -> BazaarT p g a b b0 Source # liftA2 :: (a0 -> b0 -> c) -> BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b c Source # (*>) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b b0 Source # (<*) :: BazaarT p g a b a0 -> BazaarT p g a b b0 -> BazaarT p g a b a0 Source # | |
| (Monoid w, Functor m, Monad m) => Applicative (RWST r w s m) | |
Defined in Control.Monad.Trans.RWS.Lazy Methods pure :: a -> RWST r w s m a Source # (<*>) :: RWST r w s m (a -> b) -> RWST r w s m a -> RWST r w s m b Source # liftA2 :: (a -> b -> c) -> RWST r w s m a -> RWST r w s m b -> RWST r w s m c Source # (*>) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m b Source # (<*) :: RWST r w s m a -> RWST r w s m b -> RWST r w s m a Source # | |
| Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) | |
Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a Source # (<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b Source # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c Source # (*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b Source # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a Source # | |
class Foldable (t :: Type -> Type) where Source #
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 Source #
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.
Since: base-4.8.0.0
elem :: Eq a => a -> t a -> Bool infix 4 Source #
Does the element occur in the structure?
Since: base-4.8.0.0
sum :: Num a => t a -> a Source #
The sum function computes the sum of the numbers of a structure.
Since: base-4.8.0.0
product :: Num a => t a -> a Source #
The product function computes the product of the numbers of a
structure.
Since: base-4.8.0.0
Instances
| Foldable [] | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => [m] -> m Source # foldMap :: Monoid m => (a -> m) -> [a] -> m Source # foldMap' :: Monoid m => (a -> m) -> [a] -> m Source # foldr :: (a -> b -> b) -> b -> [a] -> b Source # foldr' :: (a -> b -> b) -> b -> [a] -> b Source # foldl :: (b -> a -> b) -> b -> [a] -> b Source # foldl' :: (b -> a -> b) -> b -> [a] -> b Source # foldr1 :: (a -> a -> a) -> [a] -> a Source # foldl1 :: (a -> a -> a) -> [a] -> a Source # elem :: Eq a => a -> [a] -> Bool Source # maximum :: Ord a => [a] -> a Source # minimum :: Ord a => [a] -> a Source # | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m Source # foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source # foldr :: (a -> b -> b) -> b -> Maybe a -> b Source # foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source # foldl :: (b -> a -> b) -> b -> Maybe a -> b Source # foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source # foldr1 :: (a -> a -> a) -> Maybe a -> a Source # foldl1 :: (a -> a -> a) -> Maybe a -> a Source # toList :: Maybe a -> [a] Source # null :: Maybe a -> Bool Source # length :: Maybe a -> Int Source # elem :: Eq a => a -> Maybe a -> Bool Source # maximum :: Ord a => Maybe a -> a Source # minimum :: Ord a => Maybe a -> a Source # | |
| Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m Source # foldMap :: Monoid m => (a -> m) -> Par1 a -> m Source # foldMap' :: Monoid m => (a -> m) -> Par1 a -> m Source # foldr :: (a -> b -> b) -> b -> Par1 a -> b Source # foldr' :: (a -> b -> b) -> b -> Par1 a -> b Source # foldl :: (b -> a -> b) -> b -> Par1 a -> b Source # foldl' :: (b -> a -> b) -> b -> Par1 a -> b Source # foldr1 :: (a -> a -> a) -> Par1 a -> a Source # foldl1 :: (a -> a -> a) -> Par1 a -> a Source # toList :: Par1 a -> [a] Source # null :: Par1 a -> Bool Source # length :: Par1 a -> Int Source # elem :: Eq a => a -> Par1 a -> Bool Source # maximum :: Ord a => Par1 a -> a Source # minimum :: Ord a => Par1 a -> a Source # | |
| Foldable Solo | |
Defined in Data.Tuple.Solo Methods fold :: Monoid m => Solo m -> m Source # foldMap :: Monoid m => (a -> m) -> Solo a -> m Source # foldMap' :: Monoid m => (a -> m) -> Solo a -> m Source # foldr :: (a -> b -> b) -> b -> Solo a -> b Source # foldr' :: (a -> b -> b) -> b -> Solo a -> b Source # foldl :: (b -> a -> b) -> b -> Solo a -> b Source # foldl' :: (b -> a -> b) -> b -> Solo a -> b Source # foldr1 :: (a -> a -> a) -> Solo a -> a Source # foldl1 :: (a -> a -> a) -> Solo a -> a Source # toList :: Solo a -> [a] Source # null :: Solo a -> Bool Source # length :: Solo a -> Int Source # elem :: Eq a => a -> Solo a -> Bool Source # maximum :: Ord a => Solo a -> a Source # minimum :: Ord a => Solo a -> a Source # | |
| Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m Source # foldMap :: Monoid m => (a -> m) -> Complex a -> m Source # foldMap' :: Monoid m => (a -> m) -> Complex a -> m Source # foldr :: (a -> b -> b) -> b -> Complex a -> b Source # foldr' :: (a -> b -> b) -> b -> Complex a -> b Source # foldl :: (b -> a -> b) -> b -> Complex a -> b Source # foldl' :: (b -> a -> b) -> b -> Complex a -> b Source # foldr1 :: (a -> a -> a) -> Complex a -> a Source # foldl1 :: (a -> a -> a) -> Complex a -> a Source # toList :: Complex a -> [a] Source # null :: Complex a -> Bool Source # length :: Complex a -> Int Source # elem :: Eq a => a -> Complex a -> Bool Source # maximum :: Ord a => Complex a -> a Source # minimum :: Ord a => Complex a -> a Source # | |
| Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m Source # foldMap :: Monoid m => (a -> m) -> Min a -> m Source # foldMap' :: Monoid m => (a -> m) -> Min a -> m Source # foldr :: (a -> b -> b) -> b -> Min a -> b Source # foldr' :: (a -> b -> b) -> b -> Min a -> b Source # foldl :: (b -> a -> b) -> b -> Min a -> b Source # foldl' :: (b -> a -> b) -> b -> Min a -> b Source # foldr1 :: (a -> a -> a) -> Min a -> a Source # foldl1 :: (a -> a -> a) -> Min a -> a Source # toList :: Min a -> [a] Source # null :: Min a -> Bool Source # length :: Min a -> Int Source # elem :: Eq a => a -> Min a -> Bool Source # maximum :: Ord a => Min a -> a Source # minimum :: Ord a => Min a -> a Source # | |
| Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m Source # foldMap :: Monoid m => (a -> m) -> Max a -> m Source # foldMap' :: Monoid m => (a -> m) -> Max a -> m Source # foldr :: (a -> b -> b) -> b -> Max a -> b Source # foldr' :: (a -> b -> b) -> b -> Max a -> b Source # foldl :: (b -> a -> b) -> b -> Max a -> b Source # foldl' :: (b -> a -> b) -> b -> Max a -> b Source # foldr1 :: (a -> a -> a) -> Max a -> a Source # foldl1 :: (a -> a -> a) -> Max a -> a Source # toList :: Max a -> [a] Source # null :: Max a -> Bool Source # length :: Max a -> Int Source # elem :: Eq a => a -> Max a -> Bool Source # maximum :: Ord a => Max a -> a Source # minimum :: Ord a => Max a -> a Source # | |
| Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m Source # foldMap :: Monoid m => (a -> m) -> First a -> m Source # foldMap' :: Monoid m => (a -> m) -> First a -> m Source # foldr :: (a -> b -> b) -> b -> First a -> b Source # foldr' :: (a -> b -> b) -> b -> First a -> b Source # foldl :: (b -> a -> b) -> b -> First a -> b Source # foldl' :: (b -> a -> b) -> b -> First a -> b Source # foldr1 :: (a -> a -> a) -> First a -> a Source # foldl1 :: (a -> a -> a) -> First a -> a Source # toList :: First a -> [a] Source # null :: First a -> Bool Source # length :: First a -> Int Source # elem :: Eq a => a -> First a -> Bool Source # maximum :: Ord a => First a -> a Source # minimum :: Ord a => First a -> a Source # | |
| Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m Source # foldMap :: Monoid m => (a -> m) -> Last a -> m Source # foldMap' :: Monoid m => (a -> m) -> Last a -> m Source # foldr :: (a -> b -> b) -> b -> Last a -> b Source # foldr' :: (a -> b -> b) -> b -> Last a -> b Source # foldl :: (b -> a -> b) -> b -> Last a -> b Source # foldl' :: (b -> a -> b) -> b -> Last a -> b Source # foldr1 :: (a -> a -> a) -> Last a -> a Source # foldl1 :: (a -> a -> a) -> Last a -> a Source # toList :: Last a -> [a] Source # null :: Last a -> Bool Source # length :: Last a -> Int Source # elem :: Eq a => a -> Last a -> Bool Source # maximum :: Ord a => Last a -> a Source # minimum :: Ord a => Last a -> a Source # | |
| Foldable Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m Source # foldMap :: Monoid m => (a -> m) -> Option a -> m Source # foldMap' :: Monoid m => (a -> m) -> Option a -> m Source # foldr :: (a -> b -> b) -> b -> Option a -> b Source # foldr' :: (a -> b -> b) -> b -> Option a -> b Source # foldl :: (b -> a -> b) -> b -> Option a -> b Source # foldl' :: (b -> a -> b) -> b -> Option a -> b Source # foldr1 :: (a -> a -> a) -> Option a -> a Source # foldl1 :: (a -> a -> a) -> Option a -> a Source # toList :: Option a -> [a] Source # null :: Option a -> Bool Source # length :: Option a -> Int Source # elem :: Eq a => a -> Option a -> Bool Source # maximum :: Ord a => Option a -> a Source # minimum :: Ord a => Option a -> a Source # | |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m Source # foldMap :: Monoid m => (a -> m) -> ZipList a -> m Source # foldMap' :: Monoid m => (a -> m) -> ZipList a -> m Source # foldr :: (a -> b -> b) -> b -> ZipList a -> b Source # foldr' :: (a -> b -> b) -> b -> ZipList a -> b Source # foldl :: (b -> a -> b) -> b -> ZipList a -> b Source # foldl' :: (b -> a -> b) -> b -> ZipList a -> b Source # foldr1 :: (a -> a -> a) -> ZipList a -> a Source # foldl1 :: (a -> a -> a) -> ZipList a -> a Source # toList :: ZipList a -> [a] Source # null :: ZipList a -> Bool Source # length :: ZipList a -> Int Source # elem :: Eq a => a -> ZipList a -> Bool Source # maximum :: Ord a => ZipList a -> a Source # minimum :: Ord a => ZipList a -> a Source # | |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m Source # foldMap :: Monoid m => (a -> m) -> Identity a -> m Source # foldMap' :: Monoid m => (a -> m) -> Identity a -> m Source # foldr :: (a -> b -> b) -> b -> Identity a -> b Source # foldr' :: (a -> b -> b) -> b -> Identity a -> b Source # foldl :: (b -> a -> b) -> b -> Identity a -> b Source # foldl' :: (b -> a -> b) -> b -> Identity a -> b Source # foldr1 :: (a -> a -> a) -> Identity a -> a Source # foldl1 :: (a -> a -> a) -> Identity a -> a Source # toList :: Identity a -> [a] Source # null :: Identity a -> Bool Source # length :: Identity a -> Int Source # elem :: Eq a => a -> Identity a -> Bool Source # maximum :: Ord a => Identity a -> a Source # minimum :: Ord a => Identity a -> a Source # | |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m Source # foldMap :: Monoid m => (a -> m) -> First a -> m Source # foldMap' :: Monoid m => (a -> m) -> First a -> m Source # foldr :: (a -> b -> b) -> b -> First a -> b Source # foldr' :: (a -> b -> b) -> b -> First a -> b Source # foldl :: (b -> a -> b) -> b -> First a -> b Source # foldl' :: (b -> a -> b) -> b -> First a -> b Source # foldr1 :: (a -> a -> a) -> First a -> a Source # foldl1 :: (a -> a -> a) -> First a -> a Source # toList :: First a -> [a] Source # null :: First a -> Bool Source # length :: First a -> Int Source # elem :: Eq a => a -> First a -> Bool Source # maximum :: Ord a => First a -> a Source # minimum :: Ord a => First a -> a Source # | |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m Source # foldMap :: Monoid m => (a -> m) -> Last a -> m Source # foldMap' :: Monoid m => (a -> m) -> Last a -> m Source # foldr :: (a -> b -> b) -> b -> Last a -> b Source # foldr' :: (a -> b -> b) -> b -> Last a -> b Source # foldl :: (b -> a -> b) -> b -> Last a -> b Source # foldl' :: (b -> a -> b) -> b -> Last a -> b Source # foldr1 :: (a -> a -> a) -> Last a -> a Source # foldl1 :: (a -> a -> a) -> Last a -> a Source # toList :: Last a -> [a] Source # null :: Last a -> Bool Source # length :: Last a -> Int Source # elem :: Eq a => a -> Last a -> Bool Source # maximum :: Ord a => Last a -> a Source # minimum :: Ord a => Last a -> a Source # | |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m Source # foldMap :: Monoid m => (a -> m) -> Dual a -> m Source # foldMap' :: Monoid m => (a -> m) -> Dual a -> m Source # foldr :: (a -> b -> b) -> b -> Dual a -> b Source # foldr' :: (a -> b -> b) -> b -> Dual a -> b Source # foldl :: (b -> a -> b) -> b -> Dual a -> b Source # foldl' :: (b -> a -> b) -> b -> Dual a -> b Source # foldr1 :: (a -> a -> a) -> Dual a -> a Source # foldl1 :: (a -> a -> a) -> Dual a -> a Source # toList :: Dual a -> [a] Source # null :: Dual a -> Bool Source # length :: Dual a -> Int Source # elem :: Eq a => a -> Dual a -> Bool Source # maximum :: Ord a => Dual a -> a Source # minimum :: Ord a => Dual a -> a Source # | |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m Source # foldMap :: Monoid m => (a -> m) -> Sum a -> m Source # foldMap' :: Monoid m => (a -> m) -> Sum a -> m Source # foldr :: (a -> b -> b) -> b -> Sum a -> b Source # foldr' :: (a -> b -> b) -> b -> Sum a -> b Source # foldl :: (b -> a -> b) -> b -> Sum a -> b Source # foldl' :: (b -> a -> b) -> b -> Sum a -> b Source # foldr1 :: (a -> a -> a) -> Sum a -> a Source # foldl1 :: (a -> a -> a) -> Sum a -> a Source # toList :: Sum a -> [a] Source # null :: Sum a -> Bool Source # length :: Sum a -> Int Source # elem :: Eq a => a -> Sum a -> Bool Source # maximum :: Ord a => Sum a -> a Source # minimum :: Ord a => Sum a -> a Source # | |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m Source # foldMap :: Monoid m => (a -> m) -> Product a -> m Source # foldMap' :: Monoid m => (a -> m) -> Product a -> m Source # foldr :: (a -> b -> b) -> b -> Product a -> b Source # foldr' :: (a -> b -> b) -> b -> Product a -> b Source # foldl :: (b -> a -> b) -> b -> Product a -> b Source # foldl' :: (b -> a -> b) -> b -> Product a -> b Source # foldr1 :: (a -> a -> a) -> Product a -> a Source # foldl1 :: (a -> a -> a) -> Product a -> a Source # toList :: Product a -> [a] Source # null :: Product a -> Bool Source # length :: Product a -> Int Source # elem :: Eq a => a -> Product a -> Bool Source # maximum :: Ord a => Product a -> a Source # minimum :: Ord a => Product a -> a Source # | |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m Source # foldMap :: Monoid m => (a -> m) -> Down a -> m Source # foldMap' :: Monoid m => (a -> m) -> Down a -> m Source # foldr :: (a -> b -> b) -> b -> Down a -> b Source # foldr' :: (a -> b -> b) -> b -> Down a -> b Source # foldl :: (b -> a -> b) -> b -> Down a -> b Source # foldl' :: (b -> a -> b) -> b -> Down a -> b Source # foldr1 :: (a -> a -> a) -> Down a -> a Source # foldl1 :: (a -> a -> a) -> Down a -> a Source # toList :: Down a -> [a] Source # null :: Down a -> Bool Source # length :: Down a -> Int Source # elem :: Eq a => a -> Down a -> Bool Source # maximum :: Ord a => Down a -> a Source # minimum :: Ord a => Down a -> a Source # | |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m Source # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m Source # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m Source # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b Source # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b Source # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b Source # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b Source # foldr1 :: (a -> a -> a) -> NonEmpty a -> a Source # foldl1 :: (a -> a -> a) -> NonEmpty a -> a Source # toList :: NonEmpty a -> [a] Source # null :: NonEmpty a -> Bool Source # length :: NonEmpty a -> Int Source # elem :: Eq a => a -> NonEmpty a -> Bool Source # maximum :: Ord a => NonEmpty a -> a Source # minimum :: Ord a => NonEmpty a -> a Source # | |
| Foldable IntMap | Folds in order of increasing key. |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m Source # foldMap :: Monoid m => (a -> m) -> IntMap a -> m Source # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m Source # foldr :: (a -> b -> b) -> b -> IntMap a -> b Source # foldr' :: (a -> b -> b) -> b -> IntMap a -> b Source # foldl :: (b -> a -> b) -> b -> IntMap a -> b Source # foldl' :: (b -> a -> b) -> b -> IntMap a -> b Source # foldr1 :: (a -> a -> a) -> IntMap a -> a Source # foldl1 :: (a -> a -> a) -> IntMap a -> a Source # toList :: IntMap a -> [a] Source # null :: IntMap a -> Bool Source # length :: IntMap a -> Int Source # elem :: Eq a => a -> IntMap a -> Bool Source # maximum :: Ord a => IntMap a -> a Source # minimum :: Ord a => IntMap a -> a Source # | |
| Foldable Tree | |
Defined in Data.Tree Methods fold :: Monoid m => Tree m -> m Source # foldMap :: Monoid m => (a -> m) -> Tree a -> m Source # foldMap' :: Monoid m => (a -> m) -> Tree a -> m Source # foldr :: (a -> b -> b) -> b -> Tree a -> b Source # foldr' :: (a -> b -> b) -> b -> Tree a -> b Source # foldl :: (b -> a -> b) -> b -> Tree a -> b Source # foldl' :: (b -> a -> b) -> b -> Tree a -> b Source # foldr1 :: (a -> a -> a) -> Tree a -> a Source # foldl1 :: (a -> a -> a) -> Tree a -> a Source # toList :: Tree a -> [a] Source # null :: Tree a -> Bool Source # length :: Tree a -> Int Source # elem :: Eq a => a -> Tree a -> Bool Source # maximum :: Ord a => Tree a -> a Source # minimum :: Ord a => Tree a -> a Source # | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m Source # foldMap :: Monoid m => (a -> m) -> Seq a -> m Source # foldMap' :: Monoid m => (a -> m) -> Seq a -> m Source # foldr :: (a -> b -> b) -> b -> Seq a -> b Source # foldr' :: (a -> b -> b) -> b -> Seq a -> b Source # foldl :: (b -> a -> b) -> b -> Seq a -> b Source # foldl' :: (b -> a -> b) -> b -> Seq a -> b Source # foldr1 :: (a -> a -> a) -> Seq a -> a Source # foldl1 :: (a -> a -> a) -> Seq a -> a Source # toList :: Seq a -> [a] Source # null :: Seq a -> Bool Source # length :: Seq a -> Int Source # elem :: Eq a => a -> Seq a -> Bool Source # maximum :: Ord a => Seq a -> a Source # minimum :: Ord a => Seq a -> a Source # | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m Source # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m Source # foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m Source # foldr :: (a -> b -> b) -> b -> FingerTree a -> b Source # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b Source # foldl :: (b -> a -> b) -> b -> FingerTree a -> b Source # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b Source # foldr1 :: (a -> a -> a) -> FingerTree a -> a Source # foldl1 :: (a -> a -> a) -> FingerTree a -> a Source # toList :: FingerTree a -> [a] Source # null :: FingerTree a -> Bool Source # length :: FingerTree a -> Int Source # elem :: Eq a => a -> FingerTree a -> Bool Source # maximum :: Ord a => FingerTree a -> a Source # minimum :: Ord a => FingerTree a -> a Source # sum :: Num a => FingerTree a -> a Source # product :: Num a => FingerTree a -> a Source # | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m Source # foldMap :: Monoid m => (a -> m) -> Digit a -> m Source # foldMap' :: Monoid m => (a -> m) -> Digit a -> m Source # foldr :: (a -> b -> b) -> b -> Digit a -> b Source # foldr' :: (a -> b -> b) -> b -> Digit a -> b Source # foldl :: (b -> a -> b) -> b -> Digit a -> b Source # foldl' :: (b -> a -> b) -> b -> Digit a -> b Source # foldr1 :: (a -> a -> a) -> Digit a -> a Source # foldl1 :: (a -> a -> a) -> Digit a -> a Source # toList :: Digit a -> [a] Source # null :: Digit a -> Bool Source # length :: Digit a -> Int Source # elem :: Eq a => a -> Digit a -> Bool Source # maximum :: Ord a => Digit a -> a Source # minimum :: Ord a => Digit a -> a Source # | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m Source # foldMap :: Monoid m => (a -> m) -> Node a -> m Source # foldMap' :: Monoid m => (a -> m) -> Node a -> m Source # foldr :: (a -> b -> b) -> b -> Node a -> b Source # foldr' :: (a -> b -> b) -> b -> Node a -> b Source # foldl :: (b -> a -> b) -> b -> Node a -> b Source # foldl' :: (b -> a -> b) -> b -> Node a -> b Source # foldr1 :: (a -> a -> a) -> Node a -> a Source # foldl1 :: (a -> a -> a) -> Node a -> a Source # toList :: Node a -> [a] Source # null :: Node a -> Bool Source # length :: Node a -> Int Source # elem :: Eq a => a -> Node a -> Bool Source # maximum :: Ord a => Node a -> a Source # minimum :: Ord a => Node a -> a Source # | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m Source # foldMap :: Monoid m => (a -> m) -> Elem a -> m Source # foldMap' :: Monoid m => (a -> m) -> Elem a -> m Source # foldr :: (a -> b -> b) -> b -> Elem a -> b Source # foldr' :: (a -> b -> b) -> b -> Elem a -> b Source # foldl :: (b -> a -> b) -> b -> Elem a -> b Source # foldl' :: (b -> a -> b) -> b -> Elem a -> b Source # foldr1 :: (a -> a -> a) -> Elem a -> a Source # foldl1 :: (a -> a -> a) -> Elem a -> a Source # toList :: Elem a -> [a] Source # null :: Elem a -> Bool Source # length :: Elem a -> Int Source # elem :: Eq a => a -> Elem a -> Bool Source # maximum :: Ord a => Elem a -> a Source # minimum :: Ord a => Elem a -> a Source # | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m Source # foldMap :: Monoid m => (a -> m) -> ViewL a -> m Source # foldMap' :: Monoid m => (a -> m) -> ViewL a -> m Source # foldr :: (a -> b -> b) -> b -> ViewL a -> b Source # foldr' :: (a -> b -> b) -> b -> ViewL a -> b Source # foldl :: (b -> a -> b) -> b -> ViewL a -> b Source # foldl' :: (b -> a -> b) -> b -> ViewL a -> b Source # foldr1 :: (a -> a -> a) -> ViewL a -> a Source # foldl1 :: (a -> a -> a) -> ViewL a -> a Source # toList :: ViewL a -> [a] Source # null :: ViewL a -> Bool Source # length :: ViewL a -> Int Source # elem :: Eq a => a -> ViewL a -> Bool Source # maximum :: Ord a => ViewL a -> a Source # minimum :: Ord a => ViewL a -> a Source # | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m Source # foldMap :: Monoid m => (a -> m) -> ViewR a -> m Source # foldMap' :: Monoid m => (a -> m) -> ViewR a -> m Source # foldr :: (a -> b -> b) -> b -> ViewR a -> b Source # foldr' :: (a -> b -> b) -> b -> ViewR a -> b Source # foldl :: (b -> a -> b) -> b -> ViewR a -> b Source # foldl' :: (b -> a -> b) -> b -> ViewR a -> b Source # foldr1 :: (a -> a -> a) -> ViewR a -> a Source # foldl1 :: (a -> a -> a) -> ViewR a -> a Source # toList :: ViewR a -> [a] Source # null :: ViewR a -> Bool Source # length :: ViewR a -> Int Source # elem :: Eq a => a -> ViewR a -> Bool Source # maximum :: Ord a => ViewR a -> a Source # minimum :: Ord a => ViewR a -> a Source # | |
| Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m Source # foldMap :: Monoid m => (a -> m) -> Set a -> m Source # foldMap' :: Monoid m => (a -> m) -> Set a -> m Source # foldr :: (a -> b -> b) -> b -> Set a -> b Source # foldr' :: (a -> b -> b) -> b -> Set a -> b Source # foldl :: (b -> a -> b) -> b -> Set a -> b Source # foldl' :: (b -> a -> b) -> b -> Set a -> b Source # foldr1 :: (a -> a -> a) -> Set a -> a Source # foldl1 :: (a -> a -> a) -> Set a -> a Source # toList :: Set a -> [a] Source # null :: Set a -> Bool Source # length :: Set a -> Int Source # elem :: Eq a => a -> Set a -> Bool Source # maximum :: Ord a => Set a -> a Source # minimum :: Ord a => Set a -> a Source # | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m Source # foldMap :: Monoid m => (a -> m) -> Hashed a -> m Source # foldMap' :: Monoid m => (a -> m) -> Hashed a -> m Source # foldr :: (a -> b -> b) -> b -> Hashed a -> b Source # foldr' :: (a -> b -> b) -> b -> Hashed a -> b Source # foldl :: (b -> a -> b) -> b -> Hashed a -> b Source # foldl' :: (b -> a -> b) -> b -> Hashed a -> b Source # foldr1 :: (a -> a -> a) -> Hashed a -> a Source # foldl1 :: (a -> a -> a) -> Hashed a -> a Source # toList :: Hashed a -> [a] Source # null :: Hashed a -> Bool Source # length :: Hashed a -> Int Source # elem :: Eq a => a -> Hashed a -> Bool Source # maximum :: Ord a => Hashed a -> a Source # minimum :: Ord a => Hashed a -> a Source # | |
| Foldable ModuleName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleName m -> m Source # foldMap :: Monoid m => (a -> m) -> ModuleName a -> m Source # foldMap' :: Monoid m => (a -> m) -> ModuleName a -> m Source # foldr :: (a -> b -> b) -> b -> ModuleName a -> b Source # foldr' :: (a -> b -> b) -> b -> ModuleName a -> b Source # foldl :: (b -> a -> b) -> b -> ModuleName a -> b Source # foldl' :: (b -> a -> b) -> b -> ModuleName a -> b Source # foldr1 :: (a -> a -> a) -> ModuleName a -> a Source # foldl1 :: (a -> a -> a) -> ModuleName a -> a Source # toList :: ModuleName a -> [a] Source # null :: ModuleName a -> Bool Source # length :: ModuleName a -> Int Source # elem :: Eq a => a -> ModuleName a -> Bool Source # maximum :: Ord a => ModuleName a -> a Source # minimum :: Ord a => ModuleName a -> a Source # sum :: Num a => ModuleName a -> a Source # product :: Num a => ModuleName a -> a Source # | |
| Foldable SpecialCon | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => SpecialCon m -> m Source # foldMap :: Monoid m => (a -> m) -> SpecialCon a -> m Source # foldMap' :: Monoid m => (a -> m) -> SpecialCon a -> m Source # foldr :: (a -> b -> b) -> b -> SpecialCon a -> b Source # foldr' :: (a -> b -> b) -> b -> SpecialCon a -> b Source # foldl :: (b -> a -> b) -> b -> SpecialCon a -> b Source # foldl' :: (b -> a -> b) -> b -> SpecialCon a -> b Source # foldr1 :: (a -> a -> a) -> SpecialCon a -> a Source # foldl1 :: (a -> a -> a) -> SpecialCon a -> a Source # toList :: SpecialCon a -> [a] Source # null :: SpecialCon a -> Bool Source # length :: SpecialCon a -> Int Source # elem :: Eq a => a -> SpecialCon a -> Bool Source # maximum :: Ord a => SpecialCon a -> a Source # minimum :: Ord a => SpecialCon a -> a Source # sum :: Num a => SpecialCon a -> a Source # product :: Num a => SpecialCon a -> a Source # | |
| Foldable QName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QName m -> m Source # foldMap :: Monoid m => (a -> m) -> QName a -> m Source # foldMap' :: Monoid m => (a -> m) -> QName a -> m Source # foldr :: (a -> b -> b) -> b -> QName a -> b Source # foldr' :: (a -> b -> b) -> b -> QName a -> b Source # foldl :: (b -> a -> b) -> b -> QName a -> b Source # foldl' :: (b -> a -> b) -> b -> QName a -> b Source # foldr1 :: (a -> a -> a) -> QName a -> a Source # foldl1 :: (a -> a -> a) -> QName a -> a Source # toList :: QName a -> [a] Source # null :: QName a -> Bool Source # length :: QName a -> Int Source # elem :: Eq a => a -> QName a -> Bool Source # maximum :: Ord a => QName a -> a Source # minimum :: Ord a => QName a -> a Source # | |
| Foldable Name | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Name m -> m Source # foldMap :: Monoid m => (a -> m) -> Name a -> m Source # foldMap' :: Monoid m => (a -> m) -> Name a -> m Source # foldr :: (a -> b -> b) -> b -> Name a -> b Source # foldr' :: (a -> b -> b) -> b -> Name a -> b Source # foldl :: (b -> a -> b) -> b -> Name a -> b Source # foldl' :: (b -> a -> b) -> b -> Name a -> b Source # foldr1 :: (a -> a -> a) -> Name a -> a Source # foldl1 :: (a -> a -> a) -> Name a -> a Source # toList :: Name a -> [a] Source # null :: Name a -> Bool Source # length :: Name a -> Int Source # elem :: Eq a => a -> Name a -> Bool Source # maximum :: Ord a => Name a -> a Source # minimum :: Ord a => Name a -> a Source # | |
| Foldable IPName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPName m -> m Source # foldMap :: Monoid m => (a -> m) -> IPName a -> m Source # foldMap' :: Monoid m => (a -> m) -> IPName a -> m Source # foldr :: (a -> b -> b) -> b -> IPName a -> b Source # foldr' :: (a -> b -> b) -> b -> IPName a -> b Source # foldl :: (b -> a -> b) -> b -> IPName a -> b Source # foldl' :: (b -> a -> b) -> b -> IPName a -> b Source # foldr1 :: (a -> a -> a) -> IPName a -> a Source # foldl1 :: (a -> a -> a) -> IPName a -> a Source # toList :: IPName a -> [a] Source # null :: IPName a -> Bool Source # length :: IPName a -> Int Source # elem :: Eq a => a -> IPName a -> Bool Source # maximum :: Ord a => IPName a -> a Source # minimum :: Ord a => IPName a -> a Source # | |
| Foldable QOp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QOp m -> m Source # foldMap :: Monoid m => (a -> m) -> QOp a -> m Source # foldMap' :: Monoid m => (a -> m) -> QOp a -> m Source # foldr :: (a -> b -> b) -> b -> QOp a -> b Source # foldr' :: (a -> b -> b) -> b -> QOp a -> b Source # foldl :: (b -> a -> b) -> b -> QOp a -> b Source # foldl' :: (b -> a -> b) -> b -> QOp a -> b Source # foldr1 :: (a -> a -> a) -> QOp a -> a Source # foldl1 :: (a -> a -> a) -> QOp a -> a Source # toList :: QOp a -> [a] Source # null :: QOp a -> Bool Source # length :: QOp a -> Int Source # elem :: Eq a => a -> QOp a -> Bool Source # maximum :: Ord a => QOp a -> a Source # minimum :: Ord a => QOp a -> a Source # | |
| Foldable Op | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Op m -> m Source # foldMap :: Monoid m => (a -> m) -> Op a -> m Source # foldMap' :: Monoid m => (a -> m) -> Op a -> m Source # foldr :: (a -> b -> b) -> b -> Op a -> b Source # foldr' :: (a -> b -> b) -> b -> Op a -> b Source # foldl :: (b -> a -> b) -> b -> Op a -> b Source # foldl' :: (b -> a -> b) -> b -> Op a -> b Source # foldr1 :: (a -> a -> a) -> Op a -> a Source # foldl1 :: (a -> a -> a) -> Op a -> a Source # toList :: Op a -> [a] Source # length :: Op a -> Int Source # elem :: Eq a => a -> Op a -> Bool Source # maximum :: Ord a => Op a -> a Source # minimum :: Ord a => Op a -> a Source # | |
| Foldable CName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CName m -> m Source # foldMap :: Monoid m => (a -> m) -> CName a -> m Source # foldMap' :: Monoid m => (a -> m) -> CName a -> m Source # foldr :: (a -> b -> b) -> b -> CName a -> b Source # foldr' :: (a -> b -> b) -> b -> CName a -> b Source # foldl :: (b -> a -> b) -> b -> CName a -> b Source # foldl' :: (b -> a -> b) -> b -> CName a -> b Source # foldr1 :: (a -> a -> a) -> CName a -> a Source # foldl1 :: (a -> a -> a) -> CName a -> a Source # toList :: CName a -> [a] Source # null :: CName a -> Bool Source # length :: CName a -> Int Source # elem :: Eq a => a -> CName a -> Bool Source # maximum :: Ord a => CName a -> a Source # minimum :: Ord a => CName a -> a Source # | |
| Foldable Module | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Module m -> m Source # foldMap :: Monoid m => (a -> m) -> Module a -> m Source # foldMap' :: Monoid m => (a -> m) -> Module a -> m Source # foldr :: (a -> b -> b) -> b -> Module a -> b Source # foldr' :: (a -> b -> b) -> b -> Module a -> b Source # foldl :: (b -> a -> b) -> b -> Module a -> b Source # foldl' :: (b -> a -> b) -> b -> Module a -> b Source # foldr1 :: (a -> a -> a) -> Module a -> a Source # foldl1 :: (a -> a -> a) -> Module a -> a Source # toList :: Module a -> [a] Source # null :: Module a -> Bool Source # length :: Module a -> Int Source # elem :: Eq a => a -> Module a -> Bool Source # maximum :: Ord a => Module a -> a Source # minimum :: Ord a => Module a -> a Source # | |
| Foldable ModuleHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleHead m -> m Source # foldMap :: Monoid m => (a -> m) -> ModuleHead a -> m Source # foldMap' :: Monoid m => (a -> m) -> ModuleHead a -> m Source # foldr :: (a -> b -> b) -> b -> ModuleHead a -> b Source # foldr' :: (a -> b -> b) -> b -> ModuleHead a -> b Source # foldl :: (b -> a -> b) -> b -> ModuleHead a -> b Source # foldl' :: (b -> a -> b) -> b -> ModuleHead a -> b Source # foldr1 :: (a -> a -> a) -> ModuleHead a -> a Source # foldl1 :: (a -> a -> a) -> ModuleHead a -> a Source # toList :: ModuleHead a -> [a] Source # null :: ModuleHead a -> Bool Source # length :: ModuleHead a -> Int Source # elem :: Eq a => a -> ModuleHead a -> Bool Source # maximum :: Ord a => ModuleHead a -> a Source # minimum :: Ord a => ModuleHead a -> a Source # sum :: Num a => ModuleHead a -> a Source # product :: Num a => ModuleHead a -> a Source # | |
| Foldable ExportSpecList | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpecList m -> m Source # foldMap :: Monoid m => (a -> m) -> ExportSpecList a -> m Source # foldMap' :: Monoid m => (a -> m) -> ExportSpecList a -> m Source # foldr :: (a -> b -> b) -> b -> ExportSpecList a -> b Source # foldr' :: (a -> b -> b) -> b -> ExportSpecList a -> b Source # foldl :: (b -> a -> b) -> b -> ExportSpecList a -> b Source # foldl' :: (b -> a -> b) -> b -> ExportSpecList a -> b Source # foldr1 :: (a -> a -> a) -> ExportSpecList a -> a Source # foldl1 :: (a -> a -> a) -> ExportSpecList a -> a Source # toList :: ExportSpecList a -> [a] Source # null :: ExportSpecList a -> Bool Source # length :: ExportSpecList a -> Int Source # elem :: Eq a => a -> ExportSpecList a -> Bool Source # maximum :: Ord a => ExportSpecList a -> a Source # minimum :: Ord a => ExportSpecList a -> a Source # sum :: Num a => ExportSpecList a -> a Source # product :: Num a => ExportSpecList a -> a Source # | |
| Foldable ExportSpec | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpec m -> m Source # foldMap :: Monoid m => (a -> m) -> ExportSpec a -> m Source # foldMap' :: Monoid m => (a -> m) -> ExportSpec a -> m Source # foldr :: (a -> b -> b) -> b -> ExportSpec a -> b Source # foldr' :: (a -> b -> b) -> b -> ExportSpec a -> b Source # foldl :: (b -> a -> b) -> b -> ExportSpec a -> b Source # foldl' :: (b -> a -> b) -> b -> ExportSpec a -> b Source # foldr1 :: (a -> a -> a) -> ExportSpec a -> a Source # foldl1 :: (a -> a -> a) -> ExportSpec a -> a Source # toList :: ExportSpec a -> [a] Source # null :: ExportSpec a -> Bool Source # length :: ExportSpec a -> Int Source # elem :: Eq a => a -> ExportSpec a -> Bool Source # maximum :: Ord a => ExportSpec a -> a Source # minimum :: Ord a => ExportSpec a -> a Source # sum :: Num a => ExportSpec a -> a Source # product :: Num a => ExportSpec a -> a Source # | |
| Foldable EWildcard | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => EWildcard m -> m Source # foldMap :: Monoid m => (a -> m) -> EWildcard a -> m Source # foldMap' :: Monoid m => (a -> m) -> EWildcard a -> m Source # foldr :: (a -> b -> b) -> b -> EWildcard a -> b Source # foldr' :: (a -> b -> b) -> b -> EWildcard a -> b Source # foldl :: (b -> a -> b) -> b -> EWildcard a -> b Source # foldl' :: (b -> a -> b) -> b -> EWildcard a -> b Source # foldr1 :: (a -> a -> a) -> EWildcard a -> a Source # foldl1 :: (a -> a -> a) -> EWildcard a -> a Source # toList :: EWildcard a -> [a] Source # null :: EWildcard a -> Bool Source # length :: EWildcard a -> Int Source # elem :: Eq a => a -> EWildcard a -> Bool Source # maximum :: Ord a => EWildcard a -> a Source # minimum :: Ord a => EWildcard a -> a Source # | |
| Foldable Namespace | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Namespace m -> m Source # foldMap :: Monoid m => (a -> m) -> Namespace a -> m Source # foldMap' :: Monoid m => (a -> m) -> Namespace a -> m Source # foldr :: (a -> b -> b) -> b -> Namespace a -> b Source # foldr' :: (a -> b -> b) -> b -> Namespace a -> b Source # foldl :: (b -> a -> b) -> b -> Namespace a -> b Source # foldl' :: (b -> a -> b) -> b -> Namespace a -> b Source # foldr1 :: (a -> a -> a) -> Namespace a -> a Source # foldl1 :: (a -> a -> a) -> Namespace a -> a Source # toList :: Namespace a -> [a] Source # null :: Namespace a -> Bool Source # length :: Namespace a -> Int Source # elem :: Eq a => a -> Namespace a -> Bool Source # maximum :: Ord a => Namespace a -> a Source # minimum :: Ord a => Namespace a -> a Source # | |
| Foldable ImportDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> ImportDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> ImportDecl a -> m Source # foldr :: (a -> b -> b) -> b -> ImportDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> ImportDecl a -> b Source # foldl :: (b -> a -> b) -> b -> ImportDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> ImportDecl a -> b Source # foldr1 :: (a -> a -> a) -> ImportDecl a -> a Source # foldl1 :: (a -> a -> a) -> ImportDecl a -> a Source # toList :: ImportDecl a -> [a] Source # null :: ImportDecl a -> Bool Source # length :: ImportDecl a -> Int Source # elem :: Eq a => a -> ImportDecl a -> Bool Source # maximum :: Ord a => ImportDecl a -> a Source # minimum :: Ord a => ImportDecl a -> a Source # sum :: Num a => ImportDecl a -> a Source # product :: Num a => ImportDecl a -> a Source # | |
| Foldable ImportSpecList | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpecList m -> m Source # foldMap :: Monoid m => (a -> m) -> ImportSpecList a -> m Source # foldMap' :: Monoid m => (a -> m) -> ImportSpecList a -> m Source # foldr :: (a -> b -> b) -> b -> ImportSpecList a -> b Source # foldr' :: (a -> b -> b) -> b -> ImportSpecList a -> b Source # foldl :: (b -> a -> b) -> b -> ImportSpecList a -> b Source # foldl' :: (b -> a -> b) -> b -> ImportSpecList a -> b Source # foldr1 :: (a -> a -> a) -> ImportSpecList a -> a Source # foldl1 :: (a -> a -> a) -> ImportSpecList a -> a Source # toList :: ImportSpecList a -> [a] Source # null :: ImportSpecList a -> Bool Source # length :: ImportSpecList a -> Int Source # elem :: Eq a => a -> ImportSpecList a -> Bool Source # maximum :: Ord a => ImportSpecList a -> a Source # minimum :: Ord a => ImportSpecList a -> a Source # sum :: Num a => ImportSpecList a -> a Source # product :: Num a => ImportSpecList a -> a Source # | |
| Foldable ImportSpec | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpec m -> m Source # foldMap :: Monoid m => (a -> m) -> ImportSpec a -> m Source # foldMap' :: Monoid m => (a -> m) -> ImportSpec a -> m Source # foldr :: (a -> b -> b) -> b -> ImportSpec a -> b Source # foldr' :: (a -> b -> b) -> b -> ImportSpec a -> b Source # foldl :: (b -> a -> b) -> b -> ImportSpec a -> b Source # foldl' :: (b -> a -> b) -> b -> ImportSpec a -> b Source # foldr1 :: (a -> a -> a) -> ImportSpec a -> a Source # foldl1 :: (a -> a -> a) -> ImportSpec a -> a Source # toList :: ImportSpec a -> [a] Source # null :: ImportSpec a -> Bool Source # length :: ImportSpec a -> Int Source # elem :: Eq a => a -> ImportSpec a -> Bool Source # maximum :: Ord a => ImportSpec a -> a Source # minimum :: Ord a => ImportSpec a -> a Source # sum :: Num a => ImportSpec a -> a Source # product :: Num a => ImportSpec a -> a Source # | |
| Foldable Assoc | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Assoc m -> m Source # foldMap :: Monoid m => (a -> m) -> Assoc a -> m Source # foldMap' :: Monoid m => (a -> m) -> Assoc a -> m Source # foldr :: (a -> b -> b) -> b -> Assoc a -> b Source # foldr' :: (a -> b -> b) -> b -> Assoc a -> b Source # foldl :: (b -> a -> b) -> b -> Assoc a -> b Source # foldl' :: (b -> a -> b) -> b -> Assoc a -> b Source # foldr1 :: (a -> a -> a) -> Assoc a -> a Source # foldl1 :: (a -> a -> a) -> Assoc a -> a Source # toList :: Assoc a -> [a] Source # null :: Assoc a -> Bool Source # length :: Assoc a -> Int Source # elem :: Eq a => a -> Assoc a -> Bool Source # maximum :: Ord a => Assoc a -> a Source # minimum :: Ord a => Assoc a -> a Source # | |
| Foldable Decl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Decl m -> m Source # foldMap :: Monoid m => (a -> m) -> Decl a -> m Source # foldMap' :: Monoid m => (a -> m) -> Decl a -> m Source # foldr :: (a -> b -> b) -> b -> Decl a -> b Source # foldr' :: (a -> b -> b) -> b -> Decl a -> b Source # foldl :: (b -> a -> b) -> b -> Decl a -> b Source # foldl' :: (b -> a -> b) -> b -> Decl a -> b Source # foldr1 :: (a -> a -> a) -> Decl a -> a Source # foldl1 :: (a -> a -> a) -> Decl a -> a Source # toList :: Decl a -> [a] Source # null :: Decl a -> Bool Source # length :: Decl a -> Int Source # elem :: Eq a => a -> Decl a -> Bool Source # maximum :: Ord a => Decl a -> a Source # minimum :: Ord a => Decl a -> a Source # | |
| Foldable PatternSynDirection | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatternSynDirection m -> m Source # foldMap :: Monoid m => (a -> m) -> PatternSynDirection a -> m Source # foldMap' :: Monoid m => (a -> m) -> PatternSynDirection a -> m Source # foldr :: (a -> b -> b) -> b -> PatternSynDirection a -> b Source # foldr' :: (a -> b -> b) -> b -> PatternSynDirection a -> b Source # foldl :: (b -> a -> b) -> b -> PatternSynDirection a -> b Source # foldl' :: (b -> a -> b) -> b -> PatternSynDirection a -> b Source # foldr1 :: (a -> a -> a) -> PatternSynDirection a -> a Source # foldl1 :: (a -> a -> a) -> PatternSynDirection a -> a Source # toList :: PatternSynDirection a -> [a] Source # null :: PatternSynDirection a -> Bool Source # length :: PatternSynDirection a -> Int Source # elem :: Eq a => a -> PatternSynDirection a -> Bool Source # maximum :: Ord a => PatternSynDirection a -> a Source # minimum :: Ord a => PatternSynDirection a -> a Source # sum :: Num a => PatternSynDirection a -> a Source # product :: Num a => PatternSynDirection a -> a Source # | |
| Foldable TypeEqn | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TypeEqn m -> m Source # foldMap :: Monoid m => (a -> m) -> TypeEqn a -> m Source # foldMap' :: Monoid m => (a -> m) -> TypeEqn a -> m Source # foldr :: (a -> b -> b) -> b -> TypeEqn a -> b Source # foldr' :: (a -> b -> b) -> b -> TypeEqn a -> b Source # foldl :: (b -> a -> b) -> b -> TypeEqn a -> b Source # foldl' :: (b -> a -> b) -> b -> TypeEqn a -> b Source # foldr1 :: (a -> a -> a) -> TypeEqn a -> a Source # foldl1 :: (a -> a -> a) -> TypeEqn a -> a Source # toList :: TypeEqn a -> [a] Source # null :: TypeEqn a -> Bool Source # length :: TypeEqn a -> Int Source # elem :: Eq a => a -> TypeEqn a -> Bool Source # maximum :: Ord a => TypeEqn a -> a Source # minimum :: Ord a => TypeEqn a -> a Source # | |
| Foldable Annotation | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Annotation m -> m Source # foldMap :: Monoid m => (a -> m) -> Annotation a -> m Source # foldMap' :: Monoid m => (a -> m) -> Annotation a -> m Source # foldr :: (a -> b -> b) -> b -> Annotation a -> b Source # foldr' :: (a -> b -> b) -> b -> Annotation a -> b Source # foldl :: (b -> a -> b) -> b -> Annotation a -> b Source # foldl' :: (b -> a -> b) -> b -> Annotation a -> b Source # foldr1 :: (a -> a -> a) -> Annotation a -> a Source # foldl1 :: (a -> a -> a) -> Annotation a -> a Source # toList :: Annotation a -> [a] Source # null :: Annotation a -> Bool Source # length :: Annotation a -> Int Source # elem :: Eq a => a -> Annotation a -> Bool Source # maximum :: Ord a => Annotation a -> a Source # minimum :: Ord a => Annotation a -> a Source # sum :: Num a => Annotation a -> a Source # product :: Num a => Annotation a -> a Source # | |
| Foldable BooleanFormula | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BooleanFormula m -> m Source # foldMap :: Monoid m => (a -> m) -> BooleanFormula a -> m Source # foldMap' :: Monoid m => (a -> m) -> BooleanFormula a -> m Source # foldr :: (a -> b -> b) -> b -> BooleanFormula a -> b Source # foldr' :: (a -> b -> b) -> b -> BooleanFormula a -> b Source # foldl :: (b -> a -> b) -> b -> BooleanFormula a -> b Source # foldl' :: (b -> a -> b) -> b -> BooleanFormula a -> b Source # foldr1 :: (a -> a -> a) -> BooleanFormula a -> a Source # foldl1 :: (a -> a -> a) -> BooleanFormula a -> a Source # toList :: BooleanFormula a -> [a] Source # null :: BooleanFormula a -> Bool Source # length :: BooleanFormula a -> Int Source # elem :: Eq a => a -> BooleanFormula a -> Bool Source # maximum :: Ord a => BooleanFormula a -> a Source # minimum :: Ord a => BooleanFormula a -> a Source # sum :: Num a => BooleanFormula a -> a Source # product :: Num a => BooleanFormula a -> a Source # | |
| Foldable Role | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Role m -> m Source # foldMap :: Monoid m => (a -> m) -> Role a -> m Source # foldMap' :: Monoid m => (a -> m) -> Role a -> m Source # foldr :: (a -> b -> b) -> b -> Role a -> b Source # foldr' :: (a -> b -> b) -> b -> Role a -> b Source # foldl :: (b -> a -> b) -> b -> Role a -> b Source # foldl' :: (b -> a -> b) -> b -> Role a -> b Source # foldr1 :: (a -> a -> a) -> Role a -> a Source # foldl1 :: (a -> a -> a) -> Role a -> a Source # toList :: Role a -> [a] Source # null :: Role a -> Bool Source # length :: Role a -> Int Source # elem :: Eq a => a -> Role a -> Bool Source # maximum :: Ord a => Role a -> a Source # minimum :: Ord a => Role a -> a Source # | |
| Foldable DataOrNew | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DataOrNew m -> m Source # foldMap :: Monoid m => (a -> m) -> DataOrNew a -> m Source # foldMap' :: Monoid m => (a -> m) -> DataOrNew a -> m Source # foldr :: (a -> b -> b) -> b -> DataOrNew a -> b Source # foldr' :: (a -> b -> b) -> b -> DataOrNew a -> b Source # foldl :: (b -> a -> b) -> b -> DataOrNew a -> b Source # foldl' :: (b -> a -> b) -> b -> DataOrNew a -> b Source # foldr1 :: (a -> a -> a) -> DataOrNew a -> a Source # foldl1 :: (a -> a -> a) -> DataOrNew a -> a Source # toList :: DataOrNew a -> [a] Source # null :: DataOrNew a -> Bool Source # length :: DataOrNew a -> Int Source # elem :: Eq a => a -> DataOrNew a -> Bool Source # maximum :: Ord a => DataOrNew a -> a Source # minimum :: Ord a => DataOrNew a -> a Source # | |
| Foldable InjectivityInfo | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InjectivityInfo m -> m Source # foldMap :: Monoid m => (a -> m) -> InjectivityInfo a -> m Source # foldMap' :: Monoid m => (a -> m) -> InjectivityInfo a -> m Source # foldr :: (a -> b -> b) -> b -> InjectivityInfo a -> b Source # foldr' :: (a -> b -> b) -> b -> InjectivityInfo a -> b Source # foldl :: (b -> a -> b) -> b -> InjectivityInfo a -> b Source # foldl' :: (b -> a -> b) -> b -> InjectivityInfo a -> b Source # foldr1 :: (a -> a -> a) -> InjectivityInfo a -> a Source # foldl1 :: (a -> a -> a) -> InjectivityInfo a -> a Source # toList :: InjectivityInfo a -> [a] Source # null :: InjectivityInfo a -> Bool Source # length :: InjectivityInfo a -> Int Source # elem :: Eq a => a -> InjectivityInfo a -> Bool Source # maximum :: Ord a => InjectivityInfo a -> a Source # minimum :: Ord a => InjectivityInfo a -> a Source # sum :: Num a => InjectivityInfo a -> a Source # product :: Num a => InjectivityInfo a -> a Source # | |
| Foldable ResultSig | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ResultSig m -> m Source # foldMap :: Monoid m => (a -> m) -> ResultSig a -> m Source # foldMap' :: Monoid m => (a -> m) -> ResultSig a -> m Source # foldr :: (a -> b -> b) -> b -> ResultSig a -> b Source # foldr' :: (a -> b -> b) -> b -> ResultSig a -> b Source # foldl :: (b -> a -> b) -> b -> ResultSig a -> b Source # foldl' :: (b -> a -> b) -> b -> ResultSig a -> b Source # foldr1 :: (a -> a -> a) -> ResultSig a -> a Source # foldl1 :: (a -> a -> a) -> ResultSig a -> a Source # toList :: ResultSig a -> [a] Source # null :: ResultSig a -> Bool Source # length :: ResultSig a -> Int Source # elem :: Eq a => a -> ResultSig a -> Bool Source # maximum :: Ord a => ResultSig a -> a Source # minimum :: Ord a => ResultSig a -> a Source # | |
| Foldable DeclHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DeclHead m -> m Source # foldMap :: Monoid m => (a -> m) -> DeclHead a -> m Source # foldMap' :: Monoid m => (a -> m) -> DeclHead a -> m Source # foldr :: (a -> b -> b) -> b -> DeclHead a -> b Source # foldr' :: (a -> b -> b) -> b -> DeclHead a -> b Source # foldl :: (b -> a -> b) -> b -> DeclHead a -> b Source # foldl' :: (b -> a -> b) -> b -> DeclHead a -> b Source # foldr1 :: (a -> a -> a) -> DeclHead a -> a Source # foldl1 :: (a -> a -> a) -> DeclHead a -> a Source # toList :: DeclHead a -> [a] Source # null :: DeclHead a -> Bool Source # length :: DeclHead a -> Int Source # elem :: Eq a => a -> DeclHead a -> Bool Source # maximum :: Ord a => DeclHead a -> a Source # minimum :: Ord a => DeclHead a -> a Source # | |
| Foldable InstRule | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstRule m -> m Source # foldMap :: Monoid m => (a -> m) -> InstRule a -> m Source # foldMap' :: Monoid m => (a -> m) -> InstRule a -> m Source # foldr :: (a -> b -> b) -> b -> InstRule a -> b Source # foldr' :: (a -> b -> b) -> b -> InstRule a -> b Source # foldl :: (b -> a -> b) -> b -> InstRule a -> b Source # foldl' :: (b -> a -> b) -> b -> InstRule a -> b Source # foldr1 :: (a -> a -> a) -> InstRule a -> a Source # foldl1 :: (a -> a -> a) -> InstRule a -> a Source # toList :: InstRule a -> [a] Source # null :: InstRule a -> Bool Source # length :: InstRule a -> Int Source # elem :: Eq a => a -> InstRule a -> Bool Source # maximum :: Ord a => InstRule a -> a Source # minimum :: Ord a => InstRule a -> a Source # | |
| Foldable InstHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstHead m -> m Source # foldMap :: Monoid m => (a -> m) -> InstHead a -> m Source # foldMap' :: Monoid m => (a -> m) -> InstHead a -> m Source # foldr :: (a -> b -> b) -> b -> InstHead a -> b Source # foldr' :: (a -> b -> b) -> b -> InstHead a -> b Source # foldl :: (b -> a -> b) -> b -> InstHead a -> b Source # foldl' :: (b -> a -> b) -> b -> InstHead a -> b Source # foldr1 :: (a -> a -> a) -> InstHead a -> a Source # foldl1 :: (a -> a -> a) -> InstHead a -> a Source # toList :: InstHead a -> [a] Source # null :: InstHead a -> Bool Source # length :: InstHead a -> Int Source # elem :: Eq a => a -> InstHead a -> Bool Source # maximum :: Ord a => InstHead a -> a Source # minimum :: Ord a => InstHead a -> a Source # | |
| Foldable Deriving | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Deriving m -> m Source # foldMap :: Monoid m => (a -> m) -> Deriving a -> m Source # foldMap' :: Monoid m => (a -> m) -> Deriving a -> m Source # foldr :: (a -> b -> b) -> b -> Deriving a -> b Source # foldr' :: (a -> b -> b) -> b -> Deriving a -> b Source # foldl :: (b -> a -> b) -> b -> Deriving a -> b Source # foldl' :: (b -> a -> b) -> b -> Deriving a -> b Source # foldr1 :: (a -> a -> a) -> Deriving a -> a Source # foldl1 :: (a -> a -> a) -> Deriving a -> a Source # toList :: Deriving a -> [a] Source # null :: Deriving a -> Bool Source # length :: Deriving a -> Int Source # elem :: Eq a => a -> Deriving a -> Bool Source # maximum :: Ord a => Deriving a -> a Source # minimum :: Ord a => Deriving a -> a Source # | |
| Foldable DerivStrategy | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DerivStrategy m -> m Source # foldMap :: Monoid m => (a -> m) -> DerivStrategy a -> m Source # foldMap' :: Monoid m => (a -> m) -> DerivStrategy a -> m Source # foldr :: (a -> b -> b) -> b -> DerivStrategy a -> b Source # foldr' :: (a -> b -> b) -> b -> DerivStrategy a -> b Source # foldl :: (b -> a -> b) -> b -> DerivStrategy a -> b Source # foldl' :: (b -> a -> b) -> b -> DerivStrategy a -> b Source # foldr1 :: (a -> a -> a) -> DerivStrategy a -> a Source # foldl1 :: (a -> a -> a) -> DerivStrategy a -> a Source # toList :: DerivStrategy a -> [a] Source # null :: DerivStrategy a -> Bool Source # length :: DerivStrategy a -> Int Source # elem :: Eq a => a -> DerivStrategy a -> Bool Source # maximum :: Ord a => DerivStrategy a -> a Source # minimum :: Ord a => DerivStrategy a -> a Source # sum :: Num a => DerivStrategy a -> a Source # product :: Num a => DerivStrategy a -> a Source # | |
| Foldable Binds | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Binds m -> m Source # foldMap :: Monoid m => (a -> m) -> Binds a -> m Source # foldMap' :: Monoid m => (a -> m) -> Binds a -> m Source # foldr :: (a -> b -> b) -> b -> Binds a -> b Source # foldr' :: (a -> b -> b) -> b -> Binds a -> b Source # foldl :: (b -> a -> b) -> b -> Binds a -> b Source # foldl' :: (b -> a -> b) -> b -> Binds a -> b Source # foldr1 :: (a -> a -> a) -> Binds a -> a Source # foldl1 :: (a -> a -> a) -> Binds a -> a Source # toList :: Binds a -> [a] Source # null :: Binds a -> Bool Source # length :: Binds a -> Int Source # elem :: Eq a => a -> Binds a -> Bool Source # maximum :: Ord a => Binds a -> a Source # minimum :: Ord a => Binds a -> a Source # | |
| Foldable IPBind | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPBind m -> m Source # foldMap :: Monoid m => (a -> m) -> IPBind a -> m Source # foldMap' :: Monoid m => (a -> m) -> IPBind a -> m Source # foldr :: (a -> b -> b) -> b -> IPBind a -> b Source # foldr' :: (a -> b -> b) -> b -> IPBind a -> b Source # foldl :: (b -> a -> b) -> b -> IPBind a -> b Source # foldl' :: (b -> a -> b) -> b -> IPBind a -> b Source # foldr1 :: (a -> a -> a) -> IPBind a -> a Source # foldl1 :: (a -> a -> a) -> IPBind a -> a Source # toList :: IPBind a -> [a] Source # null :: IPBind a -> Bool Source # length :: IPBind a -> Int Source # elem :: Eq a => a -> IPBind a -> Bool Source # maximum :: Ord a => IPBind a -> a Source # minimum :: Ord a => IPBind a -> a Source # | |
| Foldable Match | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Match m -> m Source # foldMap :: Monoid m => (a -> m) -> Match a -> m Source # foldMap' :: Monoid m => (a -> m) -> Match a -> m Source # foldr :: (a -> b -> b) -> b -> Match a -> b Source # foldr' :: (a -> b -> b) -> b -> Match a -> b Source # foldl :: (b -> a -> b) -> b -> Match a -> b Source # foldl' :: (b -> a -> b) -> b -> Match a -> b Source # foldr1 :: (a -> a -> a) -> Match a -> a Source # foldl1 :: (a -> a -> a) -> Match a -> a Source # toList :: Match a -> [a] Source # null :: Match a -> Bool Source # length :: Match a -> Int Source # elem :: Eq a => a -> Match a -> Bool Source # maximum :: Ord a => Match a -> a Source # minimum :: Ord a => Match a -> a Source # | |
| Foldable QualConDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualConDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> QualConDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> QualConDecl a -> m Source # foldr :: (a -> b -> b) -> b -> QualConDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> QualConDecl a -> b Source # foldl :: (b -> a -> b) -> b -> QualConDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> QualConDecl a -> b Source # foldr1 :: (a -> a -> a) -> QualConDecl a -> a Source # foldl1 :: (a -> a -> a) -> QualConDecl a -> a Source # toList :: QualConDecl a -> [a] Source # null :: QualConDecl a -> Bool Source # length :: QualConDecl a -> Int Source # elem :: Eq a => a -> QualConDecl a -> Bool Source # maximum :: Ord a => QualConDecl a -> a Source # minimum :: Ord a => QualConDecl a -> a Source # sum :: Num a => QualConDecl a -> a Source # product :: Num a => QualConDecl a -> a Source # | |
| Foldable ConDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ConDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> ConDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> ConDecl a -> m Source # foldr :: (a -> b -> b) -> b -> ConDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> ConDecl a -> b Source # foldl :: (b -> a -> b) -> b -> ConDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> ConDecl a -> b Source # foldr1 :: (a -> a -> a) -> ConDecl a -> a Source # foldl1 :: (a -> a -> a) -> ConDecl a -> a Source # toList :: ConDecl a -> [a] Source # null :: ConDecl a -> Bool Source # length :: ConDecl a -> Int Source # elem :: Eq a => a -> ConDecl a -> Bool Source # maximum :: Ord a => ConDecl a -> a Source # minimum :: Ord a => ConDecl a -> a Source # | |
| Foldable FieldDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> FieldDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> FieldDecl a -> m Source # foldr :: (a -> b -> b) -> b -> FieldDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> FieldDecl a -> b Source # foldl :: (b -> a -> b) -> b -> FieldDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> FieldDecl a -> b Source # foldr1 :: (a -> a -> a) -> FieldDecl a -> a Source # foldl1 :: (a -> a -> a) -> FieldDecl a -> a Source # toList :: FieldDecl a -> [a] Source # null :: FieldDecl a -> Bool Source # length :: FieldDecl a -> Int Source # elem :: Eq a => a -> FieldDecl a -> Bool Source # maximum :: Ord a => FieldDecl a -> a Source # minimum :: Ord a => FieldDecl a -> a Source # | |
| Foldable GadtDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GadtDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> GadtDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> GadtDecl a -> m Source # foldr :: (a -> b -> b) -> b -> GadtDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> GadtDecl a -> b Source # foldl :: (b -> a -> b) -> b -> GadtDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> GadtDecl a -> b Source # foldr1 :: (a -> a -> a) -> GadtDecl a -> a Source # foldl1 :: (a -> a -> a) -> GadtDecl a -> a Source # toList :: GadtDecl a -> [a] Source # null :: GadtDecl a -> Bool Source # length :: GadtDecl a -> Int Source # elem :: Eq a => a -> GadtDecl a -> Bool Source # maximum :: Ord a => GadtDecl a -> a Source # minimum :: Ord a => GadtDecl a -> a Source # | |
| Foldable ClassDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ClassDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> ClassDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> ClassDecl a -> m Source # foldr :: (a -> b -> b) -> b -> ClassDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> ClassDecl a -> b Source # foldl :: (b -> a -> b) -> b -> ClassDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> ClassDecl a -> b Source # foldr1 :: (a -> a -> a) -> ClassDecl a -> a Source # foldl1 :: (a -> a -> a) -> ClassDecl a -> a Source # toList :: ClassDecl a -> [a] Source # null :: ClassDecl a -> Bool Source # length :: ClassDecl a -> Int Source # elem :: Eq a => a -> ClassDecl a -> Bool Source # maximum :: Ord a => ClassDecl a -> a Source # minimum :: Ord a => ClassDecl a -> a Source # | |
| Foldable InstDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstDecl m -> m Source # foldMap :: Monoid m => (a -> m) -> InstDecl a -> m Source # foldMap' :: Monoid m => (a -> m) -> InstDecl a -> m Source # foldr :: (a -> b -> b) -> b -> InstDecl a -> b Source # foldr' :: (a -> b -> b) -> b -> InstDecl a -> b Source # foldl :: (b -> a -> b) -> b -> InstDecl a -> b Source # foldl' :: (b -> a -> b) -> b -> InstDecl a -> b Source # foldr1 :: (a -> a -> a) -> InstDecl a -> a Source # foldl1 :: (a -> a -> a) -> InstDecl a -> a Source # toList :: InstDecl a -> [a] Source # null :: InstDecl a -> Bool Source # length :: InstDecl a -> Int Source # elem :: Eq a => a -> InstDecl a -> Bool Source # maximum :: Ord a => InstDecl a -> a Source # minimum :: Ord a => InstDecl a -> a Source # | |
| Foldable BangType | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BangType m -> m Source # foldMap :: Monoid m => (a -> m) -> BangType a -> m Source # foldMap' :: Monoid m => (a -> m) -> BangType a -> m Source # foldr :: (a -> b -> b) -> b -> BangType a -> b Source # foldr' :: (a -> b -> b) -> b -> BangType a -> b Source # foldl :: (b -> a -> b) -> b -> BangType a -> b Source # foldl' :: (b -> a -> b) -> b -> BangType a -> b Source # foldr1 :: (a -> a -> a) -> BangType a -> a Source # foldl1 :: (a -> a -> a) -> BangType a -> a Source # toList :: BangType a -> [a] Source # null :: BangType a -> Bool Source # length :: BangType a -> Int Source # elem :: Eq a => a -> BangType a -> Bool Source # maximum :: Ord a => BangType a -> a Source # minimum :: Ord a => BangType a -> a Source # | |
| Foldable Unpackedness | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Unpackedness m -> m Source # foldMap :: Monoid m => (a -> m) -> Unpackedness a -> m Source # foldMap' :: Monoid m => (a -> m) -> Unpackedness a -> m Source # foldr :: (a -> b -> b) -> b -> Unpackedness a -> b Source # foldr' :: (a -> b -> b) -> b -> Unpackedness a -> b Source # foldl :: (b -> a -> b) -> b -> Unpackedness a -> b Source # foldl' :: (b -> a -> b) -> b -> Unpackedness a -> b Source # foldr1 :: (a -> a -> a) -> Unpackedness a -> a Source # foldl1 :: (a -> a -> a) -> Unpackedness a -> a Source # toList :: Unpackedness a -> [a] Source # null :: Unpackedness a -> Bool Source # length :: Unpackedness a -> Int Source # elem :: Eq a => a -> Unpackedness a -> Bool Source # maximum :: Ord a => Unpackedness a -> a Source # minimum :: Ord a => Unpackedness a -> a Source # sum :: Num a => Unpackedness a -> a Source # product :: Num a => Unpackedness a -> a Source # | |
| Foldable Rhs | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rhs m -> m Source # foldMap :: Monoid m => (a -> m) -> Rhs a -> m Source # foldMap' :: Monoid m => (a -> m) -> Rhs a -> m Source # foldr :: (a -> b -> b) -> b -> Rhs a -> b Source # foldr' :: (a -> b -> b) -> b -> Rhs a -> b Source # foldl :: (b -> a -> b) -> b -> Rhs a -> b Source # foldl' :: (b -> a -> b) -> b -> Rhs a -> b Source # foldr1 :: (a -> a -> a) -> Rhs a -> a Source # foldl1 :: (a -> a -> a) -> Rhs a -> a Source # toList :: Rhs a -> [a] Source # null :: Rhs a -> Bool Source # length :: Rhs a -> Int Source # elem :: Eq a => a -> Rhs a -> Bool Source # maximum :: Ord a => Rhs a -> a Source # minimum :: Ord a => Rhs a -> a Source # | |
| Foldable GuardedRhs | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GuardedRhs m -> m Source # foldMap :: Monoid m => (a -> m) -> GuardedRhs a -> m Source # foldMap' :: Monoid m => (a -> m) -> GuardedRhs a -> m Source # foldr :: (a -> b -> b) -> b -> GuardedRhs a -> b Source # foldr' :: (a -> b -> b) -> b -> GuardedRhs a -> b Source # foldl :: (b -> a -> b) -> b -> GuardedRhs a -> b Source # foldl' :: (b -> a -> b) -> b -> GuardedRhs a -> b Source # foldr1 :: (a -> a -> a) -> GuardedRhs a -> a Source # foldl1 :: (a -> a -> a) -> GuardedRhs a -> a Source # toList :: GuardedRhs a -> [a] Source # null :: GuardedRhs a -> Bool Source # length :: GuardedRhs a -> Int Source # elem :: Eq a => a -> GuardedRhs a -> Bool Source # maximum :: Ord a => GuardedRhs a -> a Source # minimum :: Ord a => GuardedRhs a -> a Source # sum :: Num a => GuardedRhs a -> a Source # product :: Num a => GuardedRhs a -> a Source # | |
| Foldable Type | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Type m -> m Source # foldMap :: Monoid m => (a -> m) -> Type a -> m Source # foldMap' :: Monoid m => (a -> m) -> Type a -> m Source # foldr :: (a -> b -> b) -> b -> Type a -> b Source # foldr' :: (a -> b -> b) -> b -> Type a -> b Source # foldl :: (b -> a -> b) -> b -> Type a -> b Source # foldl' :: (b -> a -> b) -> b -> Type a -> b Source # foldr1 :: (a -> a -> a) -> Type a -> a Source # foldl1 :: (a -> a -> a) -> Type a -> a Source # toList :: Type a -> [a] Source # null :: Type a -> Bool Source # length :: Type a -> Int Source # elem :: Eq a => a -> Type a -> Bool Source # maximum :: Ord a => Type a -> a Source # minimum :: Ord a => Type a -> a Source # | |
| Foldable MaybePromotedName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => MaybePromotedName m -> m Source # foldMap :: Monoid m => (a -> m) -> MaybePromotedName a -> m Source # foldMap' :: Monoid m => (a -> m) -> MaybePromotedName a -> m Source # foldr :: (a -> b -> b) -> b -> MaybePromotedName a -> b Source # foldr' :: (a -> b -> b) -> b -> MaybePromotedName a -> b Source # foldl :: (b -> a -> b) -> b -> MaybePromotedName a -> b Source # foldl' :: (b -> a -> b) -> b -> MaybePromotedName a -> b Source # foldr1 :: (a -> a -> a) -> MaybePromotedName a -> a Source # foldl1 :: (a -> a -> a) -> MaybePromotedName a -> a Source # toList :: MaybePromotedName a -> [a] Source # null :: MaybePromotedName a -> Bool Source # length :: MaybePromotedName a -> Int Source # elem :: Eq a => a -> MaybePromotedName a -> Bool Source # maximum :: Ord a => MaybePromotedName a -> a Source # minimum :: Ord a => MaybePromotedName a -> a Source # sum :: Num a => MaybePromotedName a -> a Source # product :: Num a => MaybePromotedName a -> a Source # | |
| Foldable Promoted | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Promoted m -> m Source # foldMap :: Monoid m => (a -> m) -> Promoted a -> m Source # foldMap' :: Monoid m => (a -> m) -> Promoted a -> m Source # foldr :: (a -> b -> b) -> b -> Promoted a -> b Source # foldr' :: (a -> b -> b) -> b -> Promoted a -> b Source # foldl :: (b -> a -> b) -> b -> Promoted a -> b Source # foldl' :: (b -> a -> b) -> b -> Promoted a -> b Source # foldr1 :: (a -> a -> a) -> Promoted a -> a Source # foldl1 :: (a -> a -> a) -> Promoted a -> a Source # toList :: Promoted a -> [a] Source # null :: Promoted a -> Bool Source # length :: Promoted a -> Int Source # elem :: Eq a => a -> Promoted a -> Bool Source # maximum :: Ord a => Promoted a -> a Source # minimum :: Ord a => Promoted a -> a Source # | |
| Foldable TyVarBind | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TyVarBind m -> m Source # foldMap :: Monoid m => (a -> m) -> TyVarBind a -> m Source # foldMap' :: Monoid m => (a -> m) -> TyVarBind a -> m Source # foldr :: (a -> b -> b) -> b -> TyVarBind a -> b Source # foldr' :: (a -> b -> b) -> b -> TyVarBind a -> b Source # foldl :: (b -> a -> b) -> b -> TyVarBind a -> b Source # foldl' :: (b -> a -> b) -> b -> TyVarBind a -> b Source # foldr1 :: (a -> a -> a) -> TyVarBind a -> a Source # foldl1 :: (a -> a -> a) -> TyVarBind a -> a Source # toList :: TyVarBind a -> [a] Source # null :: TyVarBind a -> Bool Source # length :: TyVarBind a -> Int Source # elem :: Eq a => a -> TyVarBind a -> Bool Source # maximum :: Ord a => TyVarBind a -> a Source # minimum :: Ord a => TyVarBind a -> a Source # | |
| Foldable FunDep | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FunDep m -> m Source # foldMap :: Monoid m => (a -> m) -> FunDep a -> m Source # foldMap' :: Monoid m => (a -> m) -> FunDep a -> m Source # foldr :: (a -> b -> b) -> b -> FunDep a -> b Source # foldr' :: (a -> b -> b) -> b -> FunDep a -> b Source # foldl :: (b -> a -> b) -> b -> FunDep a -> b Source # foldl' :: (b -> a -> b) -> b -> FunDep a -> b Source # foldr1 :: (a -> a -> a) -> FunDep a -> a Source # foldl1 :: (a -> a -> a) -> FunDep a -> a Source # toList :: FunDep a -> [a] Source # null :: FunDep a -> Bool Source # length :: FunDep a -> Int Source # elem :: Eq a => a -> FunDep a -> Bool Source # maximum :: Ord a => FunDep a -> a Source # minimum :: Ord a => FunDep a -> a Source # | |
| Foldable Context | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Context m -> m Source # foldMap :: Monoid m => (a -> m) -> Context a -> m Source # foldMap' :: Monoid m => (a -> m) -> Context a -> m Source # foldr :: (a -> b -> b) -> b -> Context a -> b Source # foldr' :: (a -> b -> b) -> b -> Context a -> b Source # foldl :: (b -> a -> b) -> b -> Context a -> b Source # foldl' :: (b -> a -> b) -> b -> Context a -> b Source # foldr1 :: (a -> a -> a) -> Context a -> a Source # foldl1 :: (a -> a -> a) -> Context a -> a Source # toList :: Context a -> [a] Source # null :: Context a -> Bool Source # length :: Context a -> Int Source # elem :: Eq a => a -> Context a -> Bool Source # maximum :: Ord a => Context a -> a Source # minimum :: Ord a => Context a -> a Source # | |
| Foldable Asst | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Asst m -> m Source # foldMap :: Monoid m => (a -> m) -> Asst a -> m Source # foldMap' :: Monoid m => (a -> m) -> Asst a -> m Source # foldr :: (a -> b -> b) -> b -> Asst a -> b Source # foldr' :: (a -> b -> b) -> b -> Asst a -> b Source # foldl :: (b -> a -> b) -> b -> Asst a -> b Source # foldl' :: (b -> a -> b) -> b -> Asst a -> b Source # foldr1 :: (a -> a -> a) -> Asst a -> a Source # foldl1 :: (a -> a -> a) -> Asst a -> a Source # toList :: Asst a -> [a] Source # null :: Asst a -> Bool Source # length :: Asst a -> Int Source # elem :: Eq a => a -> Asst a -> Bool Source # maximum :: Ord a => Asst a -> a Source # minimum :: Ord a => Asst a -> a Source # | |
| Foldable Literal | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Literal m -> m Source # foldMap :: Monoid m => (a -> m) -> Literal a -> m Source # foldMap' :: Monoid m => (a -> m) -> Literal a -> m Source # foldr :: (a -> b -> b) -> b -> Literal a -> b Source # foldr' :: (a -> b -> b) -> b -> Literal a -> b Source # foldl :: (b -> a -> b) -> b -> Literal a -> b Source # foldl' :: (b -> a -> b) -> b -> Literal a -> b Source # foldr1 :: (a -> a -> a) -> Literal a -> a Source # foldl1 :: (a -> a -> a) -> Literal a -> a Source # toList :: Literal a -> [a] Source # null :: Literal a -> Bool Source # length :: Literal a -> Int Source # elem :: Eq a => a -> Literal a -> Bool Source # maximum :: Ord a => Literal a -> a Source # minimum :: Ord a => Literal a -> a Source # | |
| Foldable Sign | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Sign m -> m Source # foldMap :: Monoid m => (a -> m) -> Sign a -> m Source # foldMap' :: Monoid m => (a -> m) -> Sign a -> m Source # foldr :: (a -> b -> b) -> b -> Sign a -> b Source # foldr' :: (a -> b -> b) -> b -> Sign a -> b Source # foldl :: (b -> a -> b) -> b -> Sign a -> b Source # foldl' :: (b -> a -> b) -> b -> Sign a -> b Source # foldr1 :: (a -> a -> a) -> Sign a -> a Source # foldl1 :: (a -> a -> a) -> Sign a -> a Source # toList :: Sign a -> [a] Source # null :: Sign a -> Bool Source # length :: Sign a -> Int Source # elem :: Eq a => a -> Sign a -> Bool Source # maximum :: Ord a => Sign a -> a Source # minimum :: Ord a => Sign a -> a Source # | |
| Foldable Exp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Exp m -> m Source # foldMap :: Monoid m => (a -> m) -> Exp a -> m Source # foldMap' :: Monoid m => (a -> m) -> Exp a -> m Source # foldr :: (a -> b -> b) -> b -> Exp a -> b Source # foldr' :: (a -> b -> b) -> b -> Exp a -> b Source # foldl :: (b -> a -> b) -> b -> Exp a -> b Source # foldl' :: (b -> a -> b) -> b -> Exp a -> b Source # foldr1 :: (a -> a -> a) -> Exp a -> a Source # foldl1 :: (a -> a -> a) -> Exp a -> a Source # toList :: Exp a -> [a] Source # null :: Exp a -> Bool Source # length :: Exp a -> Int Source # elem :: Eq a => a -> Exp a -> Bool Source # maximum :: Ord a => Exp a -> a Source # minimum :: Ord a => Exp a -> a Source # | |
| Foldable XName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XName m -> m Source # foldMap :: Monoid m => (a -> m) -> XName a -> m Source # foldMap' :: Monoid m => (a -> m) -> XName a -> m Source # foldr :: (a -> b -> b) -> b -> XName a -> b Source # foldr' :: (a -> b -> b) -> b -> XName a -> b Source # foldl :: (b -> a -> b) -> b -> XName a -> b Source # foldl' :: (b -> a -> b) -> b -> XName a -> b Source # foldr1 :: (a -> a -> a) -> XName a -> a Source # foldl1 :: (a -> a -> a) -> XName a -> a Source # toList :: XName a -> [a] Source # null :: XName a -> Bool Source # length :: XName a -> Int Source # elem :: Eq a => a -> XName a -> Bool Source # maximum :: Ord a => XName a -> a Source # minimum :: Ord a => XName a -> a Source # | |
| Foldable XAttr | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XAttr m -> m Source # foldMap :: Monoid m => (a -> m) -> XAttr a -> m Source # foldMap' :: Monoid m => (a -> m) -> XAttr a -> m Source # foldr :: (a -> b -> b) -> b -> XAttr a -> b Source # foldr' :: (a -> b -> b) -> b -> XAttr a -> b Source # foldl :: (b -> a -> b) -> b -> XAttr a -> b Source # foldl' :: (b -> a -> b) -> b -> XAttr a -> b Source # foldr1 :: (a -> a -> a) -> XAttr a -> a Source # foldl1 :: (a -> a -> a) -> XAttr a -> a Source # toList :: XAttr a -> [a] Source # null :: XAttr a -> Bool Source # length :: XAttr a -> Int Source # elem :: Eq a => a -> XAttr a -> Bool Source # maximum :: Ord a => XAttr a -> a Source # minimum :: Ord a => XAttr a -> a Source # | |
| Foldable Bracket | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Bracket m -> m Source # foldMap :: Monoid m => (a -> m) -> Bracket a -> m Source # foldMap' :: Monoid m => (a -> m) -> Bracket a -> m Source # foldr :: (a -> b -> b) -> b -> Bracket a -> b Source # foldr' :: (a -> b -> b) -> b -> Bracket a -> b Source # foldl :: (b -> a -> b) -> b -> Bracket a -> b Source # foldl' :: (b -> a -> b) -> b -> Bracket a -> b Source # foldr1 :: (a -> a -> a) -> Bracket a -> a Source # foldl1 :: (a -> a -> a) -> Bracket a -> a Source # toList :: Bracket a -> [a] Source # null :: Bracket a -> Bool Source # length :: Bracket a -> Int Source # elem :: Eq a => a -> Bracket a -> Bool Source # maximum :: Ord a => Bracket a -> a Source # minimum :: Ord a => Bracket a -> a Source # | |
| Foldable Splice | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Splice m -> m Source # foldMap :: Monoid m => (a -> m) -> Splice a -> m Source # foldMap' :: Monoid m => (a -> m) -> Splice a -> m Source # foldr :: (a -> b -> b) -> b -> Splice a -> b Source # foldr' :: (a -> b -> b) -> b -> Splice a -> b Source # foldl :: (b -> a -> b) -> b -> Splice a -> b Source # foldl' :: (b -> a -> b) -> b -> Splice a -> b Source # foldr1 :: (a -> a -> a) -> Splice a -> a Source # foldl1 :: (a -> a -> a) -> Splice a -> a Source # toList :: Splice a -> [a] Source # null :: Splice a -> Bool Source # length :: Splice a -> Int Source # elem :: Eq a => a -> Splice a -> Bool Source # maximum :: Ord a => Splice a -> a Source # minimum :: Ord a => Splice a -> a Source # | |
| Foldable Safety | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Safety m -> m Source # foldMap :: Monoid m => (a -> m) -> Safety a -> m Source # foldMap' :: Monoid m => (a -> m) -> Safety a -> m Source # foldr :: (a -> b -> b) -> b -> Safety a -> b Source # foldr' :: (a -> b -> b) -> b -> Safety a -> b Source # foldl :: (b -> a -> b) -> b -> Safety a -> b Source # foldl' :: (b -> a -> b) -> b -> Safety a -> b Source # foldr1 :: (a -> a -> a) -> Safety a -> a Source # foldl1 :: (a -> a -> a) -> Safety a -> a Source # toList :: Safety a -> [a] Source # null :: Safety a -> Bool Source # length :: Safety a -> Int Source # elem :: Eq a => a -> Safety a -> Bool Source # maximum :: Ord a => Safety a -> a Source # minimum :: Ord a => Safety a -> a Source # | |
| Foldable CallConv | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CallConv m -> m Source # foldMap :: Monoid m => (a -> m) -> CallConv a -> m Source # foldMap' :: Monoid m => (a -> m) -> CallConv a -> m Source # foldr :: (a -> b -> b) -> b -> CallConv a -> b Source # foldr' :: (a -> b -> b) -> b -> CallConv a -> b Source # foldl :: (b -> a -> b) -> b -> CallConv a -> b Source # foldl' :: (b -> a -> b) -> b -> CallConv a -> b Source # foldr1 :: (a -> a -> a) -> CallConv a -> a Source # foldl1 :: (a -> a -> a) -> CallConv a -> a Source # toList :: CallConv a -> [a] Source # null :: CallConv a -> Bool Source # length :: CallConv a -> Int Source # elem :: Eq a => a -> CallConv a -> Bool Source # maximum :: Ord a => CallConv a -> a Source # minimum :: Ord a => CallConv a -> a Source # | |
| Foldable ModulePragma | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModulePragma m -> m Source # foldMap :: Monoid m => (a -> m) -> ModulePragma a -> m Source # foldMap' :: Monoid m => (a -> m) -> ModulePragma a -> m Source # foldr :: (a -> b -> b) -> b -> ModulePragma a -> b Source # foldr' :: (a -> b -> b) -> b -> ModulePragma a -> b Source # foldl :: (b -> a -> b) -> b -> ModulePragma a -> b Source # foldl' :: (b -> a -> b) -> b -> ModulePragma a -> b Source # foldr1 :: (a -> a -> a) -> ModulePragma a -> a Source # foldl1 :: (a -> a -> a) -> ModulePragma a -> a Source # toList :: ModulePragma a -> [a] Source # null :: ModulePragma a -> Bool Source # length :: ModulePragma a -> Int Source # elem :: Eq a => a -> ModulePragma a -> Bool Source # maximum :: Ord a => ModulePragma a -> a Source # minimum :: Ord a => ModulePragma a -> a Source # sum :: Num a => ModulePragma a -> a Source # product :: Num a => ModulePragma a -> a Source # | |
| Foldable Overlap | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Overlap m -> m Source # foldMap :: Monoid m => (a -> m) -> Overlap a -> m Source # foldMap' :: Monoid m => (a -> m) -> Overlap a -> m Source # foldr :: (a -> b -> b) -> b -> Overlap a -> b Source # foldr' :: (a -> b -> b) -> b -> Overlap a -> b Source # foldl :: (b -> a -> b) -> b -> Overlap a -> b Source # foldl' :: (b -> a -> b) -> b -> Overlap a -> b Source # foldr1 :: (a -> a -> a) -> Overlap a -> a Source # foldl1 :: (a -> a -> a) -> Overlap a -> a Source # toList :: Overlap a -> [a] Source # null :: Overlap a -> Bool Source # length :: Overlap a -> Int Source # elem :: Eq a => a -> Overlap a -> Bool Source # maximum :: Ord a => Overlap a -> a Source # minimum :: Ord a => Overlap a -> a Source # | |
| Foldable Activation | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Activation m -> m Source # foldMap :: Monoid m => (a -> m) -> Activation a -> m Source # foldMap' :: Monoid m => (a -> m) -> Activation a -> m Source # foldr :: (a -> b -> b) -> b -> Activation a -> b Source # foldr' :: (a -> b -> b) -> b -> Activation a -> b Source # foldl :: (b -> a -> b) -> b -> Activation a -> b Source # foldl' :: (b -> a -> b) -> b -> Activation a -> b Source # foldr1 :: (a -> a -> a) -> Activation a -> a Source # foldl1 :: (a -> a -> a) -> Activation a -> a Source # toList :: Activation a -> [a] Source # null :: Activation a -> Bool Source # length :: Activation a -> Int Source # elem :: Eq a => a -> Activation a -> Bool Source # maximum :: Ord a => Activation a -> a Source # minimum :: Ord a => Activation a -> a Source # sum :: Num a => Activation a -> a Source # product :: Num a => Activation a -> a Source # | |
| Foldable Rule | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rule m -> m Source # foldMap :: Monoid m => (a -> m) -> Rule a -> m Source # foldMap' :: Monoid m => (a -> m) -> Rule a -> m Source # foldr :: (a -> b -> b) -> b -> Rule a -> b Source # foldr' :: (a -> b -> b) -> b -> Rule a -> b Source # foldl :: (b -> a -> b) -> b -> Rule a -> b Source # foldl' :: (b -> a -> b) -> b -> Rule a -> b Source # foldr1 :: (a -> a -> a) -> Rule a -> a Source # foldl1 :: (a -> a -> a) -> Rule a -> a Source # toList :: Rule a -> [a] Source # null :: Rule a -> Bool Source # length :: Rule a -> Int Source # elem :: Eq a => a -> Rule a -> Bool Source # maximum :: Ord a => Rule a -> a Source # minimum :: Ord a => Rule a -> a Source # | |
| Foldable RuleVar | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RuleVar m -> m Source # foldMap :: Monoid m => (a -> m) -> RuleVar a -> m Source # foldMap' :: Monoid m => (a -> m) -> RuleVar a -> m Source # foldr :: (a -> b -> b) -> b -> RuleVar a -> b Source # foldr' :: (a -> b -> b) -> b -> RuleVar a -> b Source # foldl :: (b -> a -> b) -> b -> RuleVar a -> b Source # foldl' :: (b -> a -> b) -> b -> RuleVar a -> b Source # foldr1 :: (a -> a -> a) -> RuleVar a -> a Source # foldl1 :: (a -> a -> a) -> RuleVar a -> a Source # toList :: RuleVar a -> [a] Source # null :: RuleVar a -> Bool Source # length :: RuleVar a -> Int Source # elem :: Eq a => a -> RuleVar a -> Bool Source # maximum :: Ord a => RuleVar a -> a Source # minimum :: Ord a => RuleVar a -> a Source # | |
| Foldable WarningText | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => WarningText m -> m Source # foldMap :: Monoid m => (a -> m) -> WarningText a -> m Source # foldMap' :: Monoid m => (a -> m) -> WarningText a -> m Source # foldr :: (a -> b -> b) -> b -> WarningText a -> b Source # foldr' :: (a -> b -> b) -> b -> WarningText a -> b Source # foldl :: (b -> a -> b) -> b -> WarningText a -> b Source # foldl' :: (b -> a -> b) -> b -> WarningText a -> b Source # foldr1 :: (a -> a -> a) -> WarningText a -> a Source # foldl1 :: (a -> a -> a) -> WarningText a -> a Source # toList :: WarningText a -> [a] Source # null :: WarningText a -> Bool Source # length :: WarningText a -> Int Source # elem :: Eq a => a -> WarningText a -> Bool Source # maximum :: Ord a => WarningText a -> a Source # minimum :: Ord a => WarningText a -> a Source # sum :: Num a => WarningText a -> a Source # product :: Num a => WarningText a -> a Source # | |
| Foldable Pat | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Pat m -> m Source # foldMap :: Monoid m => (a -> m) -> Pat a -> m Source # foldMap' :: Monoid m => (a -> m) -> Pat a -> m Source # foldr :: (a -> b -> b) -> b -> Pat a -> b Source # foldr' :: (a -> b -> b) -> b -> Pat a -> b Source # foldl :: (b -> a -> b) -> b -> Pat a -> b Source # foldl' :: (b -> a -> b) -> b -> Pat a -> b Source # foldr1 :: (a -> a -> a) -> Pat a -> a Source # foldl1 :: (a -> a -> a) -> Pat a -> a Source # toList :: Pat a -> [a] Source # null :: Pat a -> Bool Source # length :: Pat a -> Int Source # elem :: Eq a => a -> Pat a -> Bool Source # maximum :: Ord a => Pat a -> a Source # minimum :: Ord a => Pat a -> a Source # | |
| Foldable PXAttr | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PXAttr m -> m Source # foldMap :: Monoid m => (a -> m) -> PXAttr a -> m Source # foldMap' :: Monoid m => (a -> m) -> PXAttr a -> m Source # foldr :: (a -> b -> b) -> b -> PXAttr a -> b Source # foldr' :: (a -> b -> b) -> b -> PXAttr a -> b Source # foldl :: (b -> a -> b) -> b -> PXAttr a -> b Source # foldl' :: (b -> a -> b) -> b -> PXAttr a -> b Source # foldr1 :: (a -> a -> a) -> PXAttr a -> a Source # foldl1 :: (a -> a -> a) -> PXAttr a -> a Source # toList :: PXAttr a -> [a] Source # null :: PXAttr a -> Bool Source # length :: PXAttr a -> Int Source # elem :: Eq a => a -> PXAttr a -> Bool Source # maximum :: Ord a => PXAttr a -> a Source # minimum :: Ord a => PXAttr a -> a Source # | |
| Foldable RPatOp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPatOp m -> m Source # foldMap :: Monoid m => (a -> m) -> RPatOp a -> m Source # foldMap' :: Monoid m => (a -> m) -> RPatOp a -> m Source # foldr :: (a -> b -> b) -> b -> RPatOp a -> b Source # foldr' :: (a -> b -> b) -> b -> RPatOp a -> b Source # foldl :: (b -> a -> b) -> b -> RPatOp a -> b Source # foldl' :: (b -> a -> b) -> b -> RPatOp a -> b Source # foldr1 :: (a -> a -> a) -> RPatOp a -> a Source # foldl1 :: (a -> a -> a) -> RPatOp a -> a Source # toList :: RPatOp a -> [a] Source # null :: RPatOp a -> Bool Source # length :: RPatOp a -> Int Source # elem :: Eq a => a -> RPatOp a -> Bool Source # maximum :: Ord a => RPatOp a -> a Source # minimum :: Ord a => RPatOp a -> a Source # | |
| Foldable RPat | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPat m -> m Source # foldMap :: Monoid m => (a -> m) -> RPat a -> m Source # foldMap' :: Monoid m => (a -> m) -> RPat a -> m Source # foldr :: (a -> b -> b) -> b -> RPat a -> b Source # foldr' :: (a -> b -> b) -> b -> RPat a -> b Source # foldl :: (b -> a -> b) -> b -> RPat a -> b Source # foldl' :: (b -> a -> b) -> b -> RPat a -> b Source # foldr1 :: (a -> a -> a) -> RPat a -> a Source # foldl1 :: (a -> a -> a) -> RPat a -> a Source # toList :: RPat a -> [a] Source # null :: RPat a -> Bool Source # length :: RPat a -> Int Source # elem :: Eq a => a -> RPat a -> Bool Source # maximum :: Ord a => RPat a -> a Source # minimum :: Ord a => RPat a -> a Source # | |
| Foldable PatField | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatField m -> m Source # foldMap :: Monoid m => (a -> m) -> PatField a -> m Source # foldMap' :: Monoid m => (a -> m) -> PatField a -> m Source # foldr :: (a -> b -> b) -> b -> PatField a -> b Source # foldr' :: (a -> b -> b) -> b -> PatField a -> b Source # foldl :: (b -> a -> b) -> b -> PatField a -> b Source # foldl' :: (b -> a -> b) -> b -> PatField a -> b Source # foldr1 :: (a -> a -> a) -> PatField a -> a Source # foldl1 :: (a -> a -> a) -> PatField a -> a Source # toList :: PatField a -> [a] Source # null :: PatField a -> Bool Source # length :: PatField a -> Int Source # elem :: Eq a => a -> PatField a -> Bool Source # maximum :: Ord a => PatField a -> a Source # minimum :: Ord a => PatField a -> a Source # | |
| Foldable Stmt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Stmt m -> m Source # foldMap :: Monoid m => (a -> m) -> Stmt a -> m Source # foldMap' :: Monoid m => (a -> m) -> Stmt a -> m Source # foldr :: (a -> b -> b) -> b -> Stmt a -> b Source # foldr' :: (a -> b -> b) -> b -> Stmt a -> b Source # foldl :: (b -> a -> b) -> b -> Stmt a -> b Source # foldl' :: (b -> a -> b) -> b -> Stmt a -> b Source # foldr1 :: (a -> a -> a) -> Stmt a -> a Source # foldl1 :: (a -> a -> a) -> Stmt a -> a Source # toList :: Stmt a -> [a] Source # null :: Stmt a -> Bool Source # length :: Stmt a -> Int Source # elem :: Eq a => a -> Stmt a -> Bool Source # maximum :: Ord a => Stmt a -> a Source # minimum :: Ord a => Stmt a -> a Source # | |
| Foldable QualStmt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualStmt m -> m Source # foldMap :: Monoid m => (a -> m) -> QualStmt a -> m Source # foldMap' :: Monoid m => (a -> m) -> QualStmt a -> m Source # foldr :: (a -> b -> b) -> b -> QualStmt a -> b Source # foldr' :: (a -> b -> b) -> b -> QualStmt a -> b Source # foldl :: (b -> a -> b) -> b -> QualStmt a -> b Source # foldl' :: (b -> a -> b) -> b -> QualStmt a -> b Source # foldr1 :: (a -> a -> a) -> QualStmt a -> a Source # foldl1 :: (a -> a -> a) -> QualStmt a -> a Source # toList :: QualStmt a -> [a] Source # null :: QualStmt a -> Bool Source # length :: QualStmt a -> Int Source # elem :: Eq a => a -> QualStmt a -> Bool Source # maximum :: Ord a => QualStmt a -> a Source # minimum :: Ord a => QualStmt a -> a Source # | |
| Foldable FieldUpdate | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldUpdate m -> m Source # foldMap :: Monoid m => (a -> m) -> FieldUpdate a -> m Source # foldMap' :: Monoid m => (a -> m) -> FieldUpdate a -> m Source # foldr :: (a -> b -> b) -> b -> FieldUpdate a -> b Source # foldr' :: (a -> b -> b) -> b -> FieldUpdate a -> b Source # foldl :: (b -> a -> b) -> b -> FieldUpdate a -> b Source # foldl' :: (b -> a -> b) -> b -> FieldUpdate a -> b Source # foldr1 :: (a -> a -> a) -> FieldUpdate a -> a Source # foldl1 :: (a -> a -> a) -> FieldUpdate a -> a Source # toList :: FieldUpdate a -> [a] Source # null :: FieldUpdate a -> Bool Source # length :: FieldUpdate a -> Int Source # elem :: Eq a => a -> FieldUpdate a -> Bool Source # maximum :: Ord a => FieldUpdate a -> a Source # minimum :: Ord a => FieldUpdate a -> a Source # sum :: Num a => FieldUpdate a -> a Source # product :: Num a => FieldUpdate a -> a Source # | |
| Foldable Alt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Alt m -> m Source # foldMap :: Monoid m => (a -> m) -> Alt a -> m Source # foldMap' :: Monoid m => (a -> m) -> Alt a -> m Source # foldr :: (a -> b -> b) -> b -> Alt a -> b Source # foldr' :: (a -> b -> b) -> b -> Alt a -> b Source # foldl :: (b -> a -> b) -> b -> Alt a -> b Source # foldl' :: (b -> a -> b) -> b -> Alt a -> b Source # foldr1 :: (a -> a -> a) -> Alt a -> a Source # foldl1 :: (a -> a -> a) -> Alt a -> a Source # toList :: Alt a -> [a] Source # null :: Alt a -> Bool Source # length :: Alt a -> Int Source # elem :: Eq a => a -> Alt a -> Bool Source # maximum :: Ord a => Alt a -> a Source # minimum :: Ord a => Alt a -> a Source # | |
| Foldable HashSet | |
Defined in Data.HashSet.Internal Methods fold :: Monoid m => HashSet m -> m Source # foldMap :: Monoid m => (a -> m) -> HashSet a -> m Source # foldMap' :: Monoid m => (a -> m) -> HashSet a -> m Source # foldr :: (a -> b -> b) -> b -> HashSet a -> b Source # foldr' :: (a -> b -> b) -> b -> HashSet a -> b Source # foldl :: (b -> a -> b) -> b -> HashSet a -> b Source # foldl' :: (b -> a -> b) -> b -> HashSet a -> b Source # foldr1 :: (a -> a -> a) -> HashSet a -> a Source # foldl1 :: (a -> a -> a) -> HashSet a -> a Source # toList :: HashSet a -> [a] Source # null :: HashSet a -> Bool Source # length :: HashSet a -> Int Source # elem :: Eq a => a -> HashSet a -> Bool Source # maximum :: Ord a => HashSet a -> a Source # minimum :: Ord a => HashSet a -> a Source # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m Source # foldMap :: Monoid m => (a -> m) -> Vector a -> m Source # foldMap' :: Monoid m => (a -> m) -> Vector a -> m Source # foldr :: (a -> b -> b) -> b -> Vector a -> b Source # foldr' :: (a -> b -> b) -> b -> Vector a -> b Source # foldl :: (b -> a -> b) -> b -> Vector a -> b Source # foldl' :: (b -> a -> b) -> b -> Vector a -> b Source # foldr1 :: (a -> a -> a) -> Vector a -> a Source # foldl1 :: (a -> a -> a) -> Vector a -> a Source # toList :: Vector a -> [a] Source # null :: Vector a -> Bool Source # length :: Vector a -> Int Source # elem :: Eq a => a -> Vector a -> Bool Source # maximum :: Ord a => Vector a -> a Source # minimum :: Ord a => Vector a -> a Source # | |
| Foldable OSet | Values appear in insertion order, not ascending order. |
Defined in Data.Set.Ordered Methods fold :: Monoid m => OSet m -> m Source # foldMap :: Monoid m => (a -> m) -> OSet a -> m Source # foldMap' :: Monoid m => (a -> m) -> OSet a -> m Source # foldr :: (a -> b -> b) -> b -> OSet a -> b Source # foldr' :: (a -> b -> b) -> b -> OSet a -> b Source # foldl :: (b -> a -> b) -> b -> OSet a -> b Source # foldl' :: (b -> a -> b) -> b -> OSet a -> b Source # foldr1 :: (a -> a -> a) -> OSet a -> a Source # foldl1 :: (a -> a -> a) -> OSet a -> a Source # toList :: OSet a -> [a] Source # null :: OSet a -> Bool Source # length :: OSet a -> Int Source # elem :: Eq a => a -> OSet a -> Bool Source # maximum :: Ord a => OSet a -> a Source # minimum :: Ord a => OSet a -> a Source # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m Source # foldMap :: Monoid m => (a -> m) -> SmallArray a -> m Source # foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m Source # foldr :: (a -> b -> b) -> b -> SmallArray a -> b Source # foldr' :: (a -> b -> b) -> b -> SmallArray a -> b Source # foldl :: (b -> a -> b) -> b -> SmallArray a -> b Source # foldl' :: (b -> a -> b) -> b -> SmallArray a -> b Source # foldr1 :: (a -> a -> a) -> SmallArray a -> a Source # foldl1 :: (a -> a -> a) -> SmallArray a -> a Source # toList :: SmallArray a -> [a] Source # null :: SmallArray a -> Bool Source # length :: SmallArray a -> Int Source # elem :: Eq a => a -> SmallArray a -> Bool Source # maximum :: Ord a => SmallArray a -> a Source # minimum :: Ord a => SmallArray a -> a Source # sum :: Num a => SmallArray a -> a Source # product :: Num a => SmallArray a -> a Source # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m Source # foldMap :: Monoid m => (a -> m) -> Array a -> m Source # foldMap' :: Monoid m => (a -> m) -> Array a -> m Source # foldr :: (a -> b -> b) -> b -> Array a -> b Source # foldr' :: (a -> b -> b) -> b -> Array a -> b Source # foldl :: (b -> a -> b) -> b -> Array a -> b Source # foldl' :: (b -> a -> b) -> b -> Array a -> b Source # foldr1 :: (a -> a -> a) -> Array a -> a Source # foldl1 :: (a -> a -> a) -> Array a -> a Source # toList :: Array a -> [a] Source # null :: Array a -> Bool Source # length :: Array a -> Int Source # elem :: Eq a => a -> Array a -> Bool Source # maximum :: Ord a => Array a -> a Source # minimum :: Ord a => Array a -> a Source # | |
| Foldable Maybe | |
Defined in Data.Strict.Maybe Methods fold :: Monoid m => Maybe m -> m Source # foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source # foldr :: (a -> b -> b) -> b -> Maybe a -> b Source # foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source # foldl :: (b -> a -> b) -> b -> Maybe a -> b Source # foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source # foldr1 :: (a -> a -> a) -> Maybe a -> a Source # foldl1 :: (a -> a -> a) -> Maybe a -> a Source # toList :: Maybe a -> [a] Source # null :: Maybe a -> Bool Source # length :: Maybe a -> Int Source # elem :: Eq a => a -> Maybe a -> Bool Source # maximum :: Ord a => Maybe a -> a Source # minimum :: Ord a => Maybe a -> a Source # | |
| Foldable Vector | |
Defined in Data.Vector.Strict Methods fold :: Monoid m => Vector m -> m Source # foldMap :: Monoid m => (a -> m) -> Vector a -> m Source # foldMap' :: Monoid m => (a -> m) -> Vector a -> m Source # foldr :: (a -> b -> b) -> b -> Vector a -> b Source # foldr' :: (a -> b -> b) -> b -> Vector a -> b Source # foldl :: (b -> a -> b) -> b -> Vector a -> b Source # foldl' :: (b -> a -> b) -> b -> Vector a -> b Source # foldr1 :: (a -> a -> a) -> Vector a -> a Source # foldl1 :: (a -> a -> a) -> Vector a -> a Source # toList :: Vector a -> [a] Source # null :: Vector a -> Bool Source # length :: Vector a -> Int Source # elem :: Eq a => a -> Vector a -> Bool Source # maximum :: Ord a => Vector a -> a Source # minimum :: Ord a => Vector a -> a Source # | |
| Foldable PrimitiveGuard Source # | |
Defined in Clash.Annotations.Primitive Methods fold :: Monoid m => PrimitiveGuard m -> m Source # foldMap :: Monoid m => (a -> m) -> PrimitiveGuard a -> m Source # foldMap' :: Monoid m => (a -> m) -> PrimitiveGuard a -> m Source # foldr :: (a -> b -> b) -> b -> PrimitiveGuard a -> b Source # foldr' :: (a -> b -> b) -> b -> PrimitiveGuard a -> b Source # foldl :: (b -> a -> b) -> b -> PrimitiveGuard a -> b Source # foldl' :: (b -> a -> b) -> b -> PrimitiveGuard a -> b Source # foldr1 :: (a -> a -> a) -> PrimitiveGuard a -> a Source # foldl1 :: (a -> a -> a) -> PrimitiveGuard a -> a Source # toList :: PrimitiveGuard a -> [a] Source # null :: PrimitiveGuard a -> Bool Source # length :: PrimitiveGuard a -> Int Source # elem :: Eq a => a -> PrimitiveGuard a -> Bool Source # maximum :: Ord a => PrimitiveGuard a -> a Source # minimum :: Ord a => PrimitiveGuard a -> a Source # sum :: Num a => PrimitiveGuard a -> a Source # product :: Num a => PrimitiveGuard a -> a Source # | |
| Foldable SimOnly Source # | |
Defined in Clash.Magic Methods fold :: Monoid m => SimOnly m -> m Source # foldMap :: Monoid m => (a -> m) -> SimOnly a -> m Source # foldMap' :: Monoid m => (a -> m) -> SimOnly a -> m Source # foldr :: (a -> b -> b) -> b -> SimOnly a -> b Source # foldr' :: (a -> b -> b) -> b -> SimOnly a -> b Source # foldl :: (b -> a -> b) -> b -> SimOnly a -> b Source # foldl' :: (b -> a -> b) -> b -> SimOnly a -> b Source # foldr1 :: (a -> a -> a) -> SimOnly a -> a Source # foldl1 :: (a -> a -> a) -> SimOnly a -> a Source # toList :: SimOnly a -> [a] Source # null :: SimOnly a -> Bool Source # length :: SimOnly a -> Int Source # elem :: Eq a => a -> SimOnly a -> Bool Source # maximum :: Ord a => SimOnly a -> a Source # minimum :: Ord a => SimOnly a -> a Source # | |
| Foldable Property' Source # | |
Defined in Clash.Verification.Internal Methods fold :: Monoid m => Property' m -> m Source # foldMap :: Monoid m => (a -> m) -> Property' a -> m Source # foldMap' :: Monoid m => (a -> m) -> Property' a -> m Source # foldr :: (a -> b -> b) -> b -> Property' a -> b Source # foldr' :: (a -> b -> b) -> b -> Property' a -> b Source # foldl :: (b -> a -> b) -> b -> Property' a -> b Source # foldl' :: (b -> a -> b) -> b -> Property' a -> b Source # foldr1 :: (a -> a -> a) -> Property' a -> a Source # foldl1 :: (a -> a -> a) -> Property' a -> a Source # toList :: Property' a -> [a] Source # null :: Property' a -> Bool Source # length :: Property' a -> Int Source # elem :: Eq a => a -> Property' a -> Bool Source # maximum :: Ord a => Property' a -> a Source # minimum :: Ord a => Property' a -> a Source # | |
| Foldable Assertion' Source # | |
Defined in Clash.Verification.Internal Methods fold :: Monoid m => Assertion' m -> m Source # foldMap :: Monoid m => (a -> m) -> Assertion' a -> m Source # foldMap' :: Monoid m => (a -> m) -> Assertion' a -> m Source # foldr :: (a -> b -> b) -> b -> Assertion' a -> b Source # foldr' :: (a -> b -> b) -> b -> Assertion' a -> b Source # foldl :: (b -> a -> b) -> b -> Assertion' a -> b Source # foldl' :: (b -> a -> b) -> b -> Assertion' a -> b Source # foldr1 :: (a -> a -> a) -> Assertion' a -> a Source # foldl1 :: (a -> a -> a) -> Assertion' a -> a Source # toList :: Assertion' a -> [a] Source # null :: Assertion' a -> Bool Source # length :: Assertion' a -> Int Source # elem :: Eq a => a -> Assertion' a -> Bool Source # maximum :: Ord a => Assertion' a -> a Source # minimum :: Ord a => Assertion' a -> a Source # sum :: Num a => Assertion' a -> a Source # product :: Num a => Assertion' a -> a Source # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source # toList :: Either a a0 -> [a0] Source # null :: Either a a0 -> Bool Source # length :: Either a a0 -> Int Source # elem :: Eq a0 => a0 -> Either a a0 -> Bool Source # maximum :: Ord a0 => Either a a0 -> a0 Source # minimum :: Ord a0 => Either a a0 -> a0 Source # | |
| Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => V1 m -> m Source # foldMap :: Monoid m => (a -> m) -> V1 a -> m Source # foldMap' :: Monoid m => (a -> m) -> V1 a -> m Source # foldr :: (a -> b -> b) -> b -> V1 a -> b Source # foldr' :: (a -> b -> b) -> b -> V1 a -> b Source # foldl :: (b -> a -> b) -> b -> V1 a -> b Source # foldl' :: (b -> a -> b) -> b -> V1 a -> b Source # foldr1 :: (a -> a -> a) -> V1 a -> a Source # foldl1 :: (a -> a -> a) -> V1 a -> a Source # toList :: V1 a -> [a] Source # length :: V1 a -> Int Source # elem :: Eq a => a -> V1 a -> Bool Source # maximum :: Ord a => V1 a -> a Source # minimum :: Ord a => V1 a -> a Source # | |
| Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => U1 m -> m Source # foldMap :: Monoid m => (a -> m) -> U1 a -> m Source # foldMap' :: Monoid m => (a -> m) -> U1 a -> m Source # foldr :: (a -> b -> b) -> b -> U1 a -> b Source # foldr' :: (a -> b -> b) -> b -> U1 a -> b Source # foldl :: (b -> a -> b) -> b -> U1 a -> b Source # foldl' :: (b -> a -> b) -> b -> U1 a -> b Source # foldr1 :: (a -> a -> a) -> U1 a -> a Source # foldl1 :: (a -> a -> a) -> U1 a -> a Source # toList :: U1 a -> [a] Source # length :: U1 a -> Int Source # elem :: Eq a => a -> U1 a -> Bool Source # maximum :: Ord a => U1 a -> a Source # minimum :: Ord a => U1 a -> a Source # | |
| Foldable (UAddr :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UAddr m -> m Source # foldMap :: Monoid m => (a -> m) -> UAddr a -> m Source # foldMap' :: Monoid m => (a -> m) -> UAddr a -> m Source # foldr :: (a -> b -> b) -> b -> UAddr a -> b Source # foldr' :: (a -> b -> b) -> b -> UAddr a -> b Source # foldl :: (b -> a -> b) -> b -> UAddr a -> b Source # foldl' :: (b -> a -> b) -> b -> UAddr a -> b Source # foldr1 :: (a -> a -> a) -> UAddr a -> a Source # foldl1 :: (a -> a -> a) -> UAddr a -> a Source # toList :: UAddr a -> [a] Source # null :: UAddr a -> Bool Source # length :: UAddr a -> Int Source # elem :: Eq a => a -> UAddr a -> Bool Source # maximum :: Ord a => UAddr a -> a Source # minimum :: Ord a => UAddr a -> a Source # | |
| Foldable (UChar :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UChar m -> m Source # foldMap :: Monoid m => (a -> m) -> UChar a -> m Source # foldMap' :: Monoid m => (a -> m) -> UChar a -> m Source # foldr :: (a -> b -> b) -> b -> UChar a -> b Source # foldr' :: (a -> b -> b) -> b -> UChar a -> b Source # foldl :: (b -> a -> b) -> b -> UChar a -> b Source # foldl' :: (b -> a -> b) -> b -> UChar a -> b Source # foldr1 :: (a -> a -> a) -> UChar a -> a Source # foldl1 :: (a -> a -> a) -> UChar a -> a Source # toList :: UChar a -> [a] Source # null :: UChar a -> Bool Source # length :: UChar a -> Int Source # elem :: Eq a => a -> UChar a -> Bool Source # maximum :: Ord a => UChar a -> a Source # minimum :: Ord a => UChar a -> a Source # | |
| Foldable (UDouble :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UDouble m -> m Source # foldMap :: Monoid m => (a -> m) -> UDouble a -> m Source # foldMap' :: Monoid m => (a -> m) -> UDouble a -> m Source # foldr :: (a -> b -> b) -> b -> UDouble a -> b Source # foldr' :: (a -> b -> b) -> b -> UDouble a -> b Source # foldl :: (b -> a -> b) -> b -> UDouble a -> b Source # foldl' :: (b -> a -> b) -> b -> UDouble a -> b Source # foldr1 :: (a -> a -> a) -> UDouble a -> a Source # foldl1 :: (a -> a -> a) -> UDouble a -> a Source # toList :: UDouble a -> [a] Source # null :: UDouble a -> Bool Source # length :: UDouble a -> Int Source # elem :: Eq a => a -> UDouble a -> Bool Source # maximum :: Ord a => UDouble a -> a Source # minimum :: Ord a => UDouble a -> a Source # | |
| Foldable (UFloat :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UFloat m -> m Source # foldMap :: Monoid m => (a -> m) -> UFloat a -> m Source # foldMap' :: Monoid m => (a -> m) -> UFloat a -> m Source # foldr :: (a -> b -> b) -> b -> UFloat a -> b Source # foldr' :: (a -> b -> b) -> b -> UFloat a -> b Source # foldl :: (b -> a -> b) -> b -> UFloat a -> b Source # foldl' :: (b -> a -> b) -> b -> UFloat a -> b Source # foldr1 :: (a -> a -> a) -> UFloat a -> a Source # foldl1 :: (a -> a -> a) -> UFloat a -> a Source # toList :: UFloat a -> [a] Source # null :: UFloat a -> Bool Source # length :: UFloat a -> Int Source # elem :: Eq a => a -> UFloat a -> Bool Source # maximum :: Ord a => UFloat a -> a Source # minimum :: Ord a => UFloat a -> a Source # | |
| Foldable (UInt :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UInt m -> m Source # foldMap :: Monoid m => (a -> m) -> UInt a -> m Source # foldMap' :: Monoid m => (a -> m) -> UInt a -> m Source # foldr :: (a -> b -> b) -> b -> UInt a -> b Source # foldr' :: (a -> b -> b) -> b -> UInt a -> b Source # foldl :: (b -> a -> b) -> b -> UInt a -> b Source # foldl' :: (b -> a -> b) -> b -> UInt a -> b Source # foldr1 :: (a -> a -> a) -> UInt a -> a Source # foldl1 :: (a -> a -> a) -> UInt a -> a Source # toList :: UInt a -> [a] Source # null :: UInt a -> Bool Source # length :: UInt a -> Int Source # elem :: Eq a => a -> UInt a -> Bool Source # maximum :: Ord a => UInt a -> a Source # minimum :: Ord a => UInt a -> a Source # | |
| Foldable (UWord :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => UWord m -> m Source # foldMap :: Monoid m => (a -> m) -> UWord a -> m Source # foldMap' :: Monoid m => (a -> m) -> UWord a -> m Source # foldr :: (a -> b -> b) -> b -> UWord a -> b Source # foldr' :: (a -> b -> b) -> b -> UWord a -> b Source # foldl :: (b -> a -> b) -> b -> UWord a -> b Source # foldl' :: (b -> a -> b) -> b -> UWord a -> b Source # foldr1 :: (a -> a -> a) -> UWord a -> a Source # foldl1 :: (a -> a -> a) -> UWord a -> a Source # toList :: UWord a -> [a] Source # null :: UWord a -> Bool Source # length :: UWord a -> Int Source # elem :: Eq a => a -> UWord a -> Bool Source # maximum :: Ord a => UWord a -> a Source # minimum :: Ord a => UWord a -> a Source # | |
| Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m Source # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m Source # foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m Source # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b Source # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b Source # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b Source # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b Source # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 Source # toList :: (a, a0) -> [a0] Source # null :: (a, a0) -> Bool Source # length :: (a, a0) -> Int Source # elem :: Eq a0 => a0 -> (a, a0) -> Bool Source # maximum :: Ord a0 => (a, a0) -> a0 Source # minimum :: Ord a0 => (a, a0) -> a0 Source # | |
| Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m Source # foldMap :: Monoid m => (a -> m) -> Array i a -> m Source # foldMap' :: Monoid m => (a -> m) -> Array i a -> m Source # foldr :: (a -> b -> b) -> b -> Array i a -> b Source # foldr' :: (a -> b -> b) -> b -> Array i a -> b Source # foldl :: (b -> a -> b) -> b -> Array i a -> b Source # foldl' :: (b -> a -> b) -> b -> Array i a -> b Source # foldr1 :: (a -> a -> a) -> Array i a -> a Source # foldl1 :: (a -> a -> a) -> Array i a -> a Source # toList :: Array i a -> [a] Source # null :: Array i a -> Bool Source # length :: Array i a -> Int Source # elem :: Eq a => a -> Array i a -> Bool Source # maximum :: Ord a => Array i a -> a Source # minimum :: Ord a => Array i a -> a Source # | |
| Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 Source # toList :: Arg a a0 -> [a0] Source # null :: Arg a a0 -> Bool Source # length :: Arg a a0 -> Int Source # elem :: Eq a0 => a0 -> Arg a a0 -> Bool Source # maximum :: Ord a0 => Arg a a0 -> a0 Source # minimum :: Ord a0 => Arg a a0 -> a0 Source # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m Source # foldMap :: Monoid m => (a -> m) -> Proxy a -> m Source # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m Source # foldr :: (a -> b -> b) -> b -> Proxy a -> b Source # foldr' :: (a -> b -> b) -> b -> Proxy a -> b Source # foldl :: (b -> a -> b) -> b -> Proxy a -> b Source # foldl' :: (b -> a -> b) -> b -> Proxy a -> b Source # foldr1 :: (a -> a -> a) -> Proxy a -> a Source # foldl1 :: (a -> a -> a) -> Proxy a -> a Source # toList :: Proxy a -> [a] Source # null :: Proxy a -> Bool Source # length :: Proxy a -> Int Source # elem :: Eq a => a -> Proxy a -> Bool Source # maximum :: Ord a => Proxy a -> a Source # minimum :: Ord a => Proxy a -> a Source # | |
| Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m Source # foldMap :: Monoid m => (a -> m) -> Map k a -> m Source # foldMap' :: Monoid m => (a -> m) -> Map k a -> m Source # foldr :: (a -> b -> b) -> b -> Map k a -> b Source # foldr' :: (a -> b -> b) -> b -> Map k a -> b Source # foldl :: (b -> a -> b) -> b -> Map k a -> b Source # foldl' :: (b -> a -> b) -> b -> Map k a -> b Source # foldr1 :: (a -> a -> a) -> Map k a -> a Source # foldl1 :: (a -> a -> a) -> Map k a -> a Source # toList :: Map k a -> [a] Source # null :: Map k a -> Bool Source # length :: Map k a -> Int Source # elem :: Eq a => a -> Map k a -> Bool Source # maximum :: Ord a => Map k a -> a Source # minimum :: Ord a => Map k a -> a Source # | |
| Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe Methods fold :: Monoid m => MaybeT f m -> m Source # foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m Source # foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m Source # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b Source # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b Source # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b Source # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b Source # foldr1 :: (a -> a -> a) -> MaybeT f a -> a Source # foldl1 :: (a -> a -> a) -> MaybeT f a -> a Source # toList :: MaybeT f a -> [a] Source # null :: MaybeT f a -> Bool Source # length :: MaybeT f a -> Int Source # elem :: Eq a => a -> MaybeT f a -> Bool Source # maximum :: Ord a => MaybeT f a -> a Source # minimum :: Ord a => MaybeT f a -> a Source # | |
| Foldable f => Foldable (F f) | |
Defined in Control.Monad.Free.Church Methods fold :: Monoid m => F f m -> m Source # foldMap :: Monoid m => (a -> m) -> F f a -> m Source # foldMap' :: Monoid m => (a -> m) -> F f a -> m Source # foldr :: (a -> b -> b) -> b -> F f a -> b Source # foldr' :: (a -> b -> b) -> b -> F f a -> b Source # foldl :: (b -> a -> b) -> b -> F f a -> b Source # foldl' :: (b -> a -> b) -> b -> F f a -> b Source # foldr1 :: (a -> a -> a) -> F f a -> a Source # foldl1 :: (a -> a -> a) -> F f a -> a Source # toList :: F f a -> [a] Source # null :: F f a -> Bool Source # length :: F f a -> Int Source # elem :: Eq a => a -> F f a -> Bool Source # maximum :: Ord a => F f a -> a Source # minimum :: Ord a => F f a -> a Source # | |
| Foldable f => Foldable (Free f) | |
Defined in Control.Monad.Free Methods fold :: Monoid m => Free f m -> m Source # foldMap :: Monoid m => (a -> m) -> Free f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Free f a -> m Source # foldr :: (a -> b -> b) -> b -> Free f a -> b Source # foldr' :: (a -> b -> b) -> b -> Free f a -> b Source # foldl :: (b -> a -> b) -> b -> Free f a -> b Source # foldl' :: (b -> a -> b) -> b -> Free f a -> b Source # foldr1 :: (a -> a -> a) -> Free f a -> a Source # foldl1 :: (a -> a -> a) -> Free f a -> a Source # toList :: Free f a -> [a] Source # null :: Free f a -> Bool Source # length :: Free f a -> Int Source # elem :: Eq a => a -> Free f a -> Bool Source # maximum :: Ord a => Free f a -> a Source # minimum :: Ord a => Free f a -> a Source # | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m Source # foldMap :: Monoid m => (a -> m) -> Cofree f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Cofree f a -> m Source # foldr :: (a -> b -> b) -> b -> Cofree f a -> b Source # foldr' :: (a -> b -> b) -> b -> Cofree f a -> b Source # foldl :: (b -> a -> b) -> b -> Cofree f a -> b Source # foldl' :: (b -> a -> b) -> b -> Cofree f a -> b Source # foldr1 :: (a -> a -> a) -> Cofree f a -> a Source # foldl1 :: (a -> a -> a) -> Cofree f a -> a Source # toList :: Cofree f a -> [a] Source # null :: Cofree f a -> Bool Source # length :: Cofree f a -> Int Source # elem :: Eq a => a -> Cofree f a -> Bool Source # maximum :: Ord a => Cofree f a -> a Source # minimum :: Ord a => Cofree f a -> a Source # | |
| Foldable f => Foldable (Yoneda f) | |
Defined in Data.Functor.Yoneda Methods fold :: Monoid m => Yoneda f m -> m Source # foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Yoneda f a -> m Source # foldr :: (a -> b -> b) -> b -> Yoneda f a -> b Source # foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b Source # foldl :: (b -> a -> b) -> b -> Yoneda f a -> b Source # foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b Source # foldr1 :: (a -> a -> a) -> Yoneda f a -> a Source # foldl1 :: (a -> a -> a) -> Yoneda f a -> a Source # toList :: Yoneda f a -> [a] Source # null :: Yoneda f a -> Bool Source # length :: Yoneda f a -> Int Source # elem :: Eq a => a -> Yoneda f a -> Bool Source # maximum :: Ord a => Yoneda f a -> a Source # minimum :: Ord a => Yoneda f a -> a Source # | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Internal Methods fold :: Monoid m => HashMap k m -> m Source # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m Source # foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m Source # foldr :: (a -> b -> b) -> b -> HashMap k a -> b Source # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b Source # foldl :: (b -> a -> b) -> b -> HashMap k a -> b Source # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b Source # foldr1 :: (a -> a -> a) -> HashMap k a -> a Source # foldl1 :: (a -> a -> a) -> HashMap k a -> a Source # toList :: HashMap k a -> [a] Source # null :: HashMap k a -> Bool Source # length :: HashMap k a -> Int Source # elem :: Eq a => a -> HashMap k a -> Bool Source # maximum :: Ord a => HashMap k a -> a Source # minimum :: Ord a => HashMap k a -> a Source # | |
| Foldable (Level i) | |
Defined in Control.Lens.Internal.Level Methods fold :: Monoid m => Level i m -> m Source # foldMap :: Monoid m => (a -> m) -> Level i a -> m Source # foldMap' :: Monoid m => (a -> m) -> Level i a -> m Source # foldr :: (a -> b -> b) -> b -> Level i a -> b Source # foldr' :: (a -> b -> b) -> b -> Level i a -> b Source # foldl :: (b -> a -> b) -> b -> Level i a -> b Source # foldl' :: (b -> a -> b) -> b -> Level i a -> b Source # foldr1 :: (a -> a -> a) -> Level i a -> a Source # foldl1 :: (a -> a -> a) -> Level i a -> a Source # toList :: Level i a -> [a] Source # null :: Level i a -> Bool Source # length :: Level i a -> Int Source # elem :: Eq a => a -> Level i a -> Bool Source # maximum :: Ord a => Level i a -> a Source # minimum :: Ord a => Level i a -> a Source # | |
| Foldable (OMap k) | Values are produced in insertion order, not key order. |
Defined in Data.Map.Ordered.Internal Methods fold :: Monoid m => OMap k m -> m Source # foldMap :: Monoid m => (a -> m) -> OMap k a -> m Source # foldMap' :: Monoid m => (a -> m) -> OMap k a -> m Source # foldr :: (a -> b -> b) -> b -> OMap k a -> b Source # foldr' :: (a -> b -> b) -> b -> OMap k a -> b Source # foldl :: (b -> a -> b) -> b -> OMap k a -> b Source # foldl' :: (b -> a -> b) -> b -> OMap k a -> b Source # foldr1 :: (a -> a -> a) -> OMap k a -> a Source # foldl1 :: (a -> a -> a) -> OMap k a -> a Source # toList :: OMap k a -> [a] Source # null :: OMap k a -> Bool Source # length :: OMap k a -> Int Source # elem :: Eq a => a -> OMap k a -> Bool Source # maximum :: Ord a => OMap k a -> a Source # minimum :: Ord a => OMap k a -> a Source # | |
| Foldable (ListF a) | |
Defined in Data.Functor.Base Methods fold :: Monoid m => ListF a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> ListF a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> ListF a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> ListF a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> ListF a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> ListF a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> ListF a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> ListF a a0 -> a0 Source # toList :: ListF a a0 -> [a0] Source # null :: ListF a a0 -> Bool Source # length :: ListF a a0 -> Int Source # elem :: Eq a0 => a0 -> ListF a a0 -> Bool Source # maximum :: Ord a0 => ListF a a0 -> a0 Source # minimum :: Ord a0 => ListF a a0 -> a0 Source # | |
| Foldable (NonEmptyF a) | |
Defined in Data.Functor.Base Methods fold :: Monoid m => NonEmptyF a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> NonEmptyF a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> NonEmptyF a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> NonEmptyF a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> NonEmptyF a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> NonEmptyF a a0 -> a0 Source # toList :: NonEmptyF a a0 -> [a0] Source # null :: NonEmptyF a a0 -> Bool Source # length :: NonEmptyF a a0 -> Int Source # elem :: Eq a0 => a0 -> NonEmptyF a a0 -> Bool Source # maximum :: Ord a0 => NonEmptyF a a0 -> a0 Source # minimum :: Ord a0 => NonEmptyF a a0 -> a0 Source # | |
| Foldable (TreeF a) | |
Defined in Data.Functor.Base Methods fold :: Monoid m => TreeF a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> TreeF a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> TreeF a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> TreeF a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> TreeF a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> TreeF a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> TreeF a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> TreeF a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> TreeF a a0 -> a0 Source # toList :: TreeF a a0 -> [a0] Source # null :: TreeF a a0 -> Bool Source # length :: TreeF a a0 -> Int Source # elem :: Eq a0 => a0 -> TreeF a a0 -> Bool Source # maximum :: Ord a0 => TreeF a a0 -> a0 Source # minimum :: Ord a0 => TreeF a a0 -> a0 Source # | |
| Foldable (Pair e) | |
Defined in Data.Strict.Tuple Methods fold :: Monoid m => Pair e m -> m Source # foldMap :: Monoid m => (a -> m) -> Pair e a -> m Source # foldMap' :: Monoid m => (a -> m) -> Pair e a -> m Source # foldr :: (a -> b -> b) -> b -> Pair e a -> b Source # foldr' :: (a -> b -> b) -> b -> Pair e a -> b Source # foldl :: (b -> a -> b) -> b -> Pair e a -> b Source # foldl' :: (b -> a -> b) -> b -> Pair e a -> b Source # foldr1 :: (a -> a -> a) -> Pair e a -> a Source # foldl1 :: (a -> a -> a) -> Pair e a -> a Source # toList :: Pair e a -> [a] Source # null :: Pair e a -> Bool Source # length :: Pair e a -> Int Source # elem :: Eq a => a -> Pair e a -> Bool Source # maximum :: Ord a => Pair e a -> a Source # minimum :: Ord a => Pair e a -> a Source # | |
| Foldable (These a) | |
Defined in Data.Strict.These Methods fold :: Monoid m => These a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source # toList :: These a a0 -> [a0] Source # null :: These a a0 -> Bool Source # length :: These a a0 -> Int Source # elem :: Eq a0 => a0 -> These a a0 -> Bool Source # maximum :: Ord a0 => These a a0 -> a0 Source # minimum :: Ord a0 => These a a0 -> a0 Source # | |
| Foldable (Either e) | |
Defined in Data.Strict.Either Methods fold :: Monoid m => Either e m -> m Source # foldMap :: Monoid m => (a -> m) -> Either e a -> m Source # foldMap' :: Monoid m => (a -> m) -> Either e a -> m Source # foldr :: (a -> b -> b) -> b -> Either e a -> b Source # foldr' :: (a -> b -> b) -> b -> Either e a -> b Source # foldl :: (b -> a -> b) -> b -> Either e a -> b Source # foldl' :: (b -> a -> b) -> b -> Either e a -> b Source # foldr1 :: (a -> a -> a) -> Either e a -> a Source # foldl1 :: (a -> a -> a) -> Either e a -> a Source # toList :: Either e a -> [a] Source # null :: Either e a -> Bool Source # length :: Either e a -> Int Source # elem :: Eq a => a -> Either e a -> Bool Source # maximum :: Ord a => Either e a -> a Source # minimum :: Ord a => Either e a -> a Source # | |
| Foldable (These a) | |
Defined in Data.These Methods fold :: Monoid m => These a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> These a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> These a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> These a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> These a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> These a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> These a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> These a a0 -> a0 Source # toList :: These a a0 -> [a0] Source # null :: These a a0 -> Bool Source # length :: These a a0 -> Int Source # elem :: Eq a0 => a0 -> These a a0 -> Bool Source # maximum :: Ord a0 => These a a0 -> a0 Source # minimum :: Ord a0 => These a a0 -> a0 Source # | |
| Foldable f => Foldable (Lift f) | |
Defined in Control.Applicative.Lift Methods fold :: Monoid m => Lift f m -> m Source # foldMap :: Monoid m => (a -> m) -> Lift f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Lift f a -> m Source # foldr :: (a -> b -> b) -> b -> Lift f a -> b Source # foldr' :: (a -> b -> b) -> b -> Lift f a -> b Source # foldl :: (b -> a -> b) -> b -> Lift f a -> b Source # foldl' :: (b -> a -> b) -> b -> Lift f a -> b Source # foldr1 :: (a -> a -> a) -> Lift f a -> a Source # foldl1 :: (a -> a -> a) -> Lift f a -> a Source # toList :: Lift f a -> [a] Source # null :: Lift f a -> Bool Source # length :: Lift f a -> Int Source # elem :: Eq a => a -> Lift f a -> Bool Source # maximum :: Ord a => Lift f a -> a Source # minimum :: Ord a => Lift f a -> a Source # | |
| KnownNat n => Foldable (Vec n) Source # | |
Defined in Clash.Sized.Vector Methods fold :: Monoid m => Vec n m -> m Source # foldMap :: Monoid m => (a -> m) -> Vec n a -> m Source # foldMap' :: Monoid m => (a -> m) -> Vec n a -> m Source # foldr :: (a -> b -> b) -> b -> Vec n a -> b Source # foldr' :: (a -> b -> b) -> b -> Vec n a -> b Source # foldl :: (b -> a -> b) -> b -> Vec n a -> b Source # foldl' :: (b -> a -> b) -> b -> Vec n a -> b Source # foldr1 :: (a -> a -> a) -> Vec n a -> a Source # foldl1 :: (a -> a -> a) -> Vec n a -> a Source # toList :: Vec n a -> [a] Source # null :: Vec n a -> Bool Source # length :: Vec n a -> Int Source # elem :: Eq a => a -> Vec n a -> Bool Source # maximum :: Ord a => Vec n a -> a Source # minimum :: Ord a => Vec n a -> a Source # | |
| Foldable (Signal dom) Source # | NB: Not synthesizable NB: In "
|
Defined in Clash.Signal.Internal Methods fold :: Monoid m => Signal dom m -> m Source # foldMap :: Monoid m => (a -> m) -> Signal dom a -> m Source # foldMap' :: Monoid m => (a -> m) -> Signal dom a -> m Source # foldr :: (a -> b -> b) -> b -> Signal dom a -> b Source # foldr' :: (a -> b -> b) -> b -> Signal dom a -> b Source # foldl :: (b -> a -> b) -> b -> Signal dom a -> b Source # foldl' :: (b -> a -> b) -> b -> Signal dom a -> b Source # foldr1 :: (a -> a -> a) -> Signal dom a -> a Source # foldl1 :: (a -> a -> a) -> Signal dom a -> a Source # toList :: Signal dom a -> [a] Source # null :: Signal dom a -> Bool Source # length :: Signal dom a -> Int Source # elem :: Eq a => a -> Signal dom a -> Bool Source # maximum :: Ord a => Signal dom a -> a Source # minimum :: Ord a => Signal dom a -> a Source # | |
| KnownNat d => Foldable (RTree d) Source # | |
Defined in Clash.Sized.RTree Methods fold :: Monoid m => RTree d m -> m Source # foldMap :: Monoid m => (a -> m) -> RTree d a -> m Source # foldMap' :: Monoid m => (a -> m) -> RTree d a -> m Source # foldr :: (a -> b -> b) -> b -> RTree d a -> b Source # foldr' :: (a -> b -> b) -> b -> RTree d a -> b Source # foldl :: (b -> a -> b) -> b -> RTree d a -> b Source # foldl' :: (b -> a -> b) -> b -> RTree d a -> b Source # foldr1 :: (a -> a -> a) -> RTree d a -> a Source # foldl1 :: (a -> a -> a) -> RTree d a -> a Source # toList :: RTree d a -> [a] Source # null :: RTree d a -> Bool Source # length :: RTree d a -> Int Source # elem :: Eq a => a -> RTree d a -> Bool Source # maximum :: Ord a => RTree d a -> a Source # minimum :: Ord a => RTree d a -> a Source # | |
| Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m Source # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m Source # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b Source # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b Source # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b Source # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b Source # foldr1 :: (a -> a -> a) -> Rec1 f a -> a Source # foldl1 :: (a -> a -> a) -> Rec1 f a -> a Source # toList :: Rec1 f a -> [a] Source # null :: Rec1 f a -> Bool Source # length :: Rec1 f a -> Int Source # elem :: Eq a => a -> Rec1 f a -> Bool Source # maximum :: Ord a => Rec1 f a -> a Source # minimum :: Ord a => Rec1 f a -> a Source # | |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 Source # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source # foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 Source # foldr :: (a -> b -> b) -> b -> Const m a -> b Source # foldr' :: (a -> b -> b) -> b -> Const m a -> b Source # foldl :: (b -> a -> b) -> b -> Const m a -> b Source # foldl' :: (b -> a -> b) -> b -> Const m a -> b Source # foldr1 :: (a -> a -> a) -> Const m a -> a Source # foldl1 :: (a -> a -> a) -> Const m a -> a Source # toList :: Const m a -> [a] Source # null :: Const m a -> Bool Source # length :: Const m a -> Int Source # elem :: Eq a => a -> Const m a -> Bool Source # maximum :: Ord a => Const m a -> a Source # minimum :: Ord a => Const m a -> a Source # | |
| Foldable f => Foldable (Ap f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m Source # foldMap :: Monoid m => (a -> m) -> Ap f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m Source # foldr :: (a -> b -> b) -> b -> Ap f a -> b Source # foldr' :: (a -> b -> b) -> b -> Ap f a -> b Source # foldl :: (b -> a -> b) -> b -> Ap f a -> b Source # foldl' :: (b -> a -> b) -> b -> Ap f a -> b Source # foldr1 :: (a -> a -> a) -> Ap f a -> a Source # foldl1 :: (a -> a -> a) -> Ap f a -> a Source # toList :: Ap f a -> [a] Source # null :: Ap f a -> Bool Source # length :: Ap f a -> Int Source # elem :: Eq a => a -> Ap f a -> Bool Source # maximum :: Ord a => Ap f a -> a Source # minimum :: Ord a => Ap f a -> a Source # | |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m Source # foldMap :: Monoid m => (a -> m) -> Alt f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m Source # foldr :: (a -> b -> b) -> b -> Alt f a -> b Source # foldr' :: (a -> b -> b) -> b -> Alt f a -> b Source # foldl :: (b -> a -> b) -> b -> Alt f a -> b Source # foldl' :: (b -> a -> b) -> b -> Alt f a -> b Source # foldr1 :: (a -> a -> a) -> Alt f a -> a Source # foldl1 :: (a -> a -> a) -> Alt f a -> a Source # toList :: Alt f a -> [a] Source # null :: Alt f a -> Bool Source # length :: Alt f a -> Int Source # elem :: Eq a => a -> Alt f a -> Bool Source # maximum :: Ord a => Alt f a -> a Source # minimum :: Ord a => Alt f a -> a Source # | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m Source # foldMap :: Monoid m => (a -> m) -> Join p a -> m Source # foldMap' :: Monoid m => (a -> m) -> Join p a -> m Source # foldr :: (a -> b -> b) -> b -> Join p a -> b Source # foldr' :: (a -> b -> b) -> b -> Join p a -> b Source # foldl :: (b -> a -> b) -> b -> Join p a -> b Source # foldl' :: (b -> a -> b) -> b -> Join p a -> b Source # foldr1 :: (a -> a -> a) -> Join p a -> a Source # foldl1 :: (a -> a -> a) -> Join p a -> a Source # toList :: Join p a -> [a] Source # null :: Join p a -> Bool Source # length :: Join p a -> Int Source # elem :: Eq a => a -> Join p a -> Bool Source # maximum :: Ord a => Join p a -> a Source # minimum :: Ord a => Join p a -> a Source # | |
| Bifoldable p => Foldable (Fix p) | |
Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m Source # foldMap :: Monoid m => (a -> m) -> Fix p a -> m Source # foldMap' :: Monoid m => (a -> m) -> Fix p a -> m Source # foldr :: (a -> b -> b) -> b -> Fix p a -> b Source # foldr' :: (a -> b -> b) -> b -> Fix p a -> b Source # foldl :: (b -> a -> b) -> b -> Fix p a -> b Source # foldl' :: (b -> a -> b) -> b -> Fix p a -> b Source # foldr1 :: (a -> a -> a) -> Fix p a -> a Source # foldl1 :: (a -> a -> a) -> Fix p a -> a Source # toList :: Fix p a -> [a] Source # null :: Fix p a -> Bool Source # length :: Fix p a -> Int Source # elem :: Eq a => a -> Fix p a -> Bool Source # maximum :: Ord a => Fix p a -> a Source # minimum :: Ord a => Fix p a -> a Source # | |
| Foldable w => Foldable (EnvT e w) | |
Defined in Control.Comonad.Trans.Env Methods fold :: Monoid m => EnvT e w m -> m Source # foldMap :: Monoid m => (a -> m) -> EnvT e w a -> m Source # foldMap' :: Monoid m => (a -> m) -> EnvT e w a -> m Source # foldr :: (a -> b -> b) -> b -> EnvT e w a -> b Source # foldr' :: (a -> b -> b) -> b -> EnvT e w a -> b Source # foldl :: (b -> a -> b) -> b -> EnvT e w a -> b Source # foldl' :: (b -> a -> b) -> b -> EnvT e w a -> b Source # foldr1 :: (a -> a -> a) -> EnvT e w a -> a Source # foldl1 :: (a -> a -> a) -> EnvT e w a -> a Source # toList :: EnvT e w a -> [a] Source # null :: EnvT e w a -> Bool Source # length :: EnvT e w a -> Int Source # elem :: Eq a => a -> EnvT e w a -> Bool Source # maximum :: Ord a => EnvT e w a -> a Source # minimum :: Ord a => EnvT e w a -> a Source # | |
| Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity Methods fold :: Monoid m => IdentityT f m -> m Source # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m Source # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m Source # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b Source # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b Source # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b Source # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b Source # foldr1 :: (a -> a -> a) -> IdentityT f a -> a Source # foldl1 :: (a -> a -> a) -> IdentityT f a -> a Source # toList :: IdentityT f a -> [a] Source # null :: IdentityT f a -> Bool Source # length :: IdentityT f a -> Int Source # elem :: Eq a => a -> IdentityT f a -> Bool Source # maximum :: Ord a => IdentityT f a -> a Source # minimum :: Ord a => IdentityT f a -> a Source # | |
| Foldable f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except Methods fold :: Monoid m => ExceptT e f m -> m Source # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m Source # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m Source # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b Source # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b Source # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b Source # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b Source # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a Source # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a Source # toList :: ExceptT e f a -> [a] Source # null :: ExceptT e f a -> Bool Source # length :: ExceptT e f a -> Int Source # elem :: Eq a => a -> ExceptT e f a -> Bool Source # maximum :: Ord a => ExceptT e f a -> a Source # minimum :: Ord a => ExceptT e f a -> a Source # | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 Source # toList :: FreeF f a a0 -> [a0] Source # null :: FreeF f a a0 -> Bool Source # length :: FreeF f a a0 -> Int Source # elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool Source # maximum :: Ord a0 => FreeF f a a0 -> a0 Source # minimum :: Ord a0 => FreeF f a a0 -> a0 Source # | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 Source # foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 Source # foldMap' :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 Source # foldr :: (a -> b -> b) -> b -> FreeT f m a -> b Source # foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b Source # foldl :: (b -> a -> b) -> b -> FreeT f m a -> b Source # foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b Source # foldr1 :: (a -> a -> a) -> FreeT f m a -> a Source # foldl1 :: (a -> a -> a) -> FreeT f m a -> a Source # toList :: FreeT f m a -> [a] Source # null :: FreeT f m a -> Bool Source # length :: FreeT f m a -> Int Source # elem :: Eq a => a -> FreeT f m a -> Bool Source # maximum :: Ord a => FreeT f m a -> a Source # minimum :: Ord a => FreeT f m a -> a Source # | |
| Foldable f => Foldable (CofreeF f a) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeF f a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 Source # toList :: CofreeF f a a0 -> [a0] Source # null :: CofreeF f a a0 -> Bool Source # length :: CofreeF f a a0 -> Int Source # elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool Source # maximum :: Ord a0 => CofreeF f a a0 -> a0 Source # minimum :: Ord a0 => CofreeF f a a0 -> a0 Source # | |
| (Foldable f, Foldable w) => Foldable (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeT f w m -> m Source # foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m Source # foldMap' :: Monoid m => (a -> m) -> CofreeT f w a -> m Source # foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b Source # foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b Source # foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b Source # foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b Source # foldr1 :: (a -> a -> a) -> CofreeT f w a -> a Source # foldl1 :: (a -> a -> a) -> CofreeT f w a -> a Source # toList :: CofreeT f w a -> [a] Source # null :: CofreeT f w a -> Bool Source # length :: CofreeT f w a -> Int Source # elem :: Eq a => a -> CofreeT f w a -> Bool Source # maximum :: Ord a => CofreeT f w a -> a Source # minimum :: Ord a => CofreeT f w a -> a Source # | |
| Foldable f => Foldable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error Methods fold :: Monoid m => ErrorT e f m -> m Source # foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m Source # foldMap' :: Monoid m => (a -> m) -> ErrorT e f a -> m Source # foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b Source # foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b Source # foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b Source # foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b Source # foldr1 :: (a -> a -> a) -> ErrorT e f a -> a Source # foldl1 :: (a -> a -> a) -> ErrorT e f a -> a Source # toList :: ErrorT e f a -> [a] Source # null :: ErrorT e f a -> Bool Source # length :: ErrorT e f a -> Int Source # elem :: Eq a => a -> ErrorT e f a -> Bool Source # maximum :: Ord a => ErrorT e f a -> a Source # minimum :: Ord a => ErrorT e f a -> a Source # | |
| Foldable f => Foldable (Backwards f) | Derived instance. |
Defined in Control.Applicative.Backwards Methods fold :: Monoid m => Backwards f m -> m Source # foldMap :: Monoid m => (a -> m) -> Backwards f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Backwards f a -> m Source # foldr :: (a -> b -> b) -> b -> Backwards f a -> b Source # foldr' :: (a -> b -> b) -> b -> Backwards f a -> b Source # foldl :: (b -> a -> b) -> b -> Backwards f a -> b Source # foldl' :: (b -> a -> b) -> b -> Backwards f a -> b Source # foldr1 :: (a -> a -> a) -> Backwards f a -> a Source # foldl1 :: (a -> a -> a) -> Backwards f a -> a Source # toList :: Backwards f a -> [a] Source # null :: Backwards f a -> Bool Source # length :: Backwards f a -> Int Source # elem :: Eq a => a -> Backwards f a -> Bool Source # maximum :: Ord a => Backwards f a -> a Source # minimum :: Ord a => Backwards f a -> a Source # | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m Source # foldMap :: Monoid m => (a -> m) -> Tagged s a -> m Source # foldMap' :: Monoid m => (a -> m) -> Tagged s a -> m Source # foldr :: (a -> b -> b) -> b -> Tagged s a -> b Source # foldr' :: (a -> b -> b) -> b -> Tagged s a -> b Source # foldl :: (b -> a -> b) -> b -> Tagged s a -> b Source # foldl' :: (b -> a -> b) -> b -> Tagged s a -> b Source # foldr1 :: (a -> a -> a) -> Tagged s a -> a Source # foldl1 :: (a -> a -> a) -> Tagged s a -> a Source # toList :: Tagged s a -> [a] Source # null :: Tagged s a -> Bool Source # length :: Tagged s a -> Int Source # elem :: Eq a => a -> Tagged s a -> Bool Source # maximum :: Ord a => Tagged s a -> a Source # minimum :: Ord a => Tagged s a -> a Source # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Lazy Methods fold :: Monoid m => WriterT w f m -> m Source # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m Source # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m Source # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b Source # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b Source # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b Source # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b Source # foldr1 :: (a -> a -> a) -> WriterT w f a -> a Source # foldl1 :: (a -> a -> a) -> WriterT w f a -> a Source # toList :: WriterT w f a -> [a] Source # null :: WriterT w f a -> Bool Source # length :: WriterT w f a -> Int Source # elem :: Eq a => a -> WriterT w f a -> Bool Source # maximum :: Ord a => WriterT w f a -> a Source # minimum :: Ord a => WriterT w f a -> a Source # | |
| Foldable f => Foldable (WriterT w f) | |
Defined in Control.Monad.Trans.Writer.Strict Methods fold :: Monoid m => WriterT w f m -> m Source # foldMap :: Monoid m => (a -> m) -> WriterT w f a -> m Source # foldMap' :: Monoid m => (a -> m) -> WriterT w f a -> m Source # foldr :: (a -> b -> b) -> b -> WriterT w f a -> b Source # foldr' :: (a -> b -> b) -> b -> WriterT w f a -> b Source # foldl :: (b -> a -> b) -> b -> WriterT w f a -> b Source # foldl' :: (b -> a -> b) -> b -> WriterT w f a -> b Source # foldr1 :: (a -> a -> a) -> WriterT w f a -> a Source # foldl1 :: (a -> a -> a) -> WriterT w f a -> a Source # toList :: WriterT w f a -> [a] Source # null :: WriterT w f a -> Bool Source # length :: WriterT w f a -> Int Source # elem :: Eq a => a -> WriterT w f a -> Bool Source # maximum :: Ord a => WriterT w f a -> a Source # minimum :: Ord a => WriterT w f a -> a Source # | |
| Foldable (Constant a :: Type -> Type) | |
Defined in Data.Functor.Constant Methods fold :: Monoid m => Constant a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Constant a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Constant a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Constant a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Constant a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Constant a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Constant a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Constant a a0 -> a0 Source # toList :: Constant a a0 -> [a0] Source # null :: Constant a a0 -> Bool Source # length :: Constant a a0 -> Int Source # elem :: Eq a0 => a0 -> Constant a a0 -> Bool Source # maximum :: Ord a0 => Constant a a0 -> a0 Source # minimum :: Ord a0 => Constant a a0 -> a0 Source # | |
| Foldable f => Foldable (Reverse f) | Fold from right to left. |
Defined in Data.Functor.Reverse Methods fold :: Monoid m => Reverse f m -> m Source # foldMap :: Monoid m => (a -> m) -> Reverse f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Reverse f a -> m Source # foldr :: (a -> b -> b) -> b -> Reverse f a -> b Source # foldr' :: (a -> b -> b) -> b -> Reverse f a -> b Source # foldl :: (b -> a -> b) -> b -> Reverse f a -> b Source # foldl' :: (b -> a -> b) -> b -> Reverse f a -> b Source # foldr1 :: (a -> a -> a) -> Reverse f a -> a Source # foldl1 :: (a -> a -> a) -> Reverse f a -> a Source # toList :: Reverse f a -> [a] Source # null :: Reverse f a -> Bool Source # length :: Reverse f a -> Int Source # elem :: Eq a => a -> Reverse f a -> Bool Source # maximum :: Ord a => Reverse f a -> a Source # minimum :: Ord a => Reverse f a -> a Source # | |
| Foldable (DSignal dom delay) Source # | |
Defined in Clash.Signal.Delayed.Internal Methods fold :: Monoid m => DSignal dom delay m -> m Source # foldMap :: Monoid m => (a -> m) -> DSignal dom delay a -> m Source # foldMap' :: Monoid m => (a -> m) -> DSignal dom delay a -> m Source # foldr :: (a -> b -> b) -> b -> DSignal dom delay a -> b Source # foldr' :: (a -> b -> b) -> b -> DSignal dom delay a -> b Source # foldl :: (b -> a -> b) -> b -> DSignal dom delay a -> b Source # foldl' :: (b -> a -> b) -> b -> DSignal dom delay a -> b Source # foldr1 :: (a -> a -> a) -> DSignal dom delay a -> a Source # foldl1 :: (a -> a -> a) -> DSignal dom delay a -> a Source # toList :: DSignal dom delay a -> [a] Source # null :: DSignal dom delay a -> Bool Source # length :: DSignal dom delay a -> Int Source # elem :: Eq a => a -> DSignal dom delay a -> Bool Source # maximum :: Ord a => DSignal dom delay a -> a Source # minimum :: Ord a => DSignal dom delay a -> a Source # | |
| 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 Source # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m Source # foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m Source # foldr :: (a -> b -> b) -> b -> K1 i c a -> b Source # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b Source # foldl :: (b -> a -> b) -> b -> K1 i c a -> b Source # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b Source # foldr1 :: (a -> a -> a) -> K1 i c a -> a Source # foldl1 :: (a -> a -> a) -> K1 i c a -> a Source # toList :: K1 i c a -> [a] Source # null :: K1 i c a -> Bool Source # length :: K1 i c a -> Int Source # elem :: Eq a => a -> K1 i c a -> Bool Source # maximum :: Ord a => K1 i c a -> a Source # minimum :: Ord a => K1 i c a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m Source # foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m Source # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b Source # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b Source # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b Source # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b Source # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a Source # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a Source # toList :: (f :+: g) a -> [a] Source # null :: (f :+: g) a -> Bool Source # length :: (f :+: g) a -> Int Source # elem :: Eq a => a -> (f :+: g) a -> Bool Source # maximum :: Ord a => (f :+: g) a -> a Source # minimum :: Ord a => (f :+: g) a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m Source # foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m Source # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b Source # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b Source # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b Source # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b Source # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a Source # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a Source # toList :: (f :*: g) a -> [a] Source # null :: (f :*: g) a -> Bool Source # length :: (f :*: g) a -> Int Source # elem :: Eq a => a -> (f :*: g) a -> Bool Source # maximum :: Ord a => (f :*: g) a -> a Source # minimum :: Ord a => (f :*: g) a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> Product f g a -> m Source # foldMap' :: Monoid m => (a -> m) -> Product f g a -> m Source # foldr :: (a -> b -> b) -> b -> Product f g a -> b Source # foldr' :: (a -> b -> b) -> b -> Product f g a -> b Source # foldl :: (b -> a -> b) -> b -> Product f g a -> b Source # foldl' :: (b -> a -> b) -> b -> Product f g a -> b Source # foldr1 :: (a -> a -> a) -> Product f g a -> a Source # foldl1 :: (a -> a -> a) -> Product f g a -> a Source # toList :: Product f g a -> [a] Source # null :: Product f g a -> Bool Source # length :: Product f g a -> Int Source # elem :: Eq a => a -> Product f g a -> Bool Source # maximum :: Ord a => Product f g a -> a Source # minimum :: Ord a => Product f g a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m Source # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m Source # foldr :: (a -> b -> b) -> b -> Sum f g a -> b Source # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b Source # foldl :: (b -> a -> b) -> b -> Sum f g a -> b Source # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b Source # foldr1 :: (a -> a -> a) -> Sum f g a -> a Source # foldl1 :: (a -> a -> a) -> Sum f g a -> a Source # toList :: Sum f g a -> [a] Source # null :: Sum f g a -> Bool Source # length :: Sum f g a -> Int Source # elem :: Eq a => a -> Sum f g a -> Bool Source # maximum :: Ord a => Sum f g a -> a Source # minimum :: Ord a => Sum f g a -> a Source # | |
| Foldable (Magma i t b) | |
Defined in Control.Lens.Internal.Magma Methods fold :: Monoid m => Magma i t b m -> m Source # foldMap :: Monoid m => (a -> m) -> Magma i t b a -> m Source # foldMap' :: Monoid m => (a -> m) -> Magma i t b a -> m Source # foldr :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 Source # foldr' :: (a -> b0 -> b0) -> b0 -> Magma i t b a -> b0 Source # foldl :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 Source # foldl' :: (b0 -> a -> b0) -> b0 -> Magma i t b a -> b0 Source # foldr1 :: (a -> a -> a) -> Magma i t b a -> a Source # foldl1 :: (a -> a -> a) -> Magma i t b a -> a Source # toList :: Magma i t b a -> [a] Source # null :: Magma i t b a -> Bool Source # length :: Magma i t b a -> Int Source # elem :: Eq a => a -> Magma i t b a -> Bool Source # maximum :: Ord a => Magma i t b a -> a Source # minimum :: Ord a => Magma i t b a -> a Source # | |
| 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 Source # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m Source # foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m Source # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b Source # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b Source # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b Source # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b Source # foldr1 :: (a -> a -> a) -> M1 i c f a -> a Source # foldl1 :: (a -> a -> a) -> M1 i c f a -> a Source # toList :: M1 i c f a -> [a] Source # null :: M1 i c f a -> Bool Source # length :: M1 i c f a -> Int Source # elem :: Eq a => a -> M1 i c f a -> Bool Source # maximum :: Ord a => M1 i c f a -> a Source # minimum :: Ord a => M1 i c f a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m Source # foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m Source # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b Source # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b Source # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b Source # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b Source # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a Source # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a Source # toList :: (f :.: g) a -> [a] Source # null :: (f :.: g) a -> Bool Source # length :: (f :.: g) a -> Int Source # elem :: Eq a => a -> (f :.: g) a -> Bool Source # maximum :: Ord a => (f :.: g) a -> a Source # minimum :: Ord a => (f :.: g) a -> a Source # | |
| (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 Source # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m Source # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m Source # foldr :: (a -> b -> b) -> b -> Compose f g a -> b Source # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b Source # foldl :: (b -> a -> b) -> b -> Compose f g a -> b Source # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b Source # foldr1 :: (a -> a -> a) -> Compose f g a -> a Source # foldl1 :: (a -> a -> a) -> Compose f g a -> a Source # toList :: Compose f g a -> [a] Source # null :: Compose f g a -> Bool Source # length :: Compose f g a -> Int Source # elem :: Eq a => a -> Compose f g a -> Bool Source # maximum :: Ord a => Compose f g a -> a Source # minimum :: Ord a => Compose f g a -> a Source # | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 Source # toList :: WrappedBifunctor p a a0 -> [a0] Source # null :: WrappedBifunctor p a a0 -> Bool Source # length :: WrappedBifunctor p a a0 -> Int Source # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool Source # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 Source # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 Source # product :: Num a0 => WrappedBifunctor p a a0 -> a0 Source # | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Joker g a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 Source # toList :: Joker g a a0 -> [a0] Source # null :: Joker g a a0 -> Bool Source # length :: Joker g a a0 -> Int Source # elem :: Eq a0 => a0 -> Joker g a a0 -> Bool Source # maximum :: Ord a0 => Joker g a a0 -> a0 Source # minimum :: Ord a0 => Joker g a a0 -> a0 Source # | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 Source # toList :: Flip p a a0 -> [a0] Source # null :: Flip p a a0 -> Bool Source # length :: Flip p a a0 -> Int Source # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool Source # maximum :: Ord a0 => Flip p a a0 -> a0 Source # minimum :: Ord a0 => Flip p a a0 -> a0 Source # | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 Source # toList :: Clown f a a0 -> [a0] Source # null :: Clown f a a0 -> Bool Source # length :: Clown f a a0 -> Int Source # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool Source # maximum :: Ord a0 => Clown f a a0 -> a0 Source # minimum :: Ord a0 => Clown f a a0 -> a0 Source # | |
| (Foldable (f a), Foldable (g a)) => Foldable (Sum f g a) | |
Defined in Data.Bifunctor.Sum Methods fold :: Monoid m => Sum f g a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Sum f g a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Sum f g a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Sum f g a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Sum f g a a0 -> a0 Source # toList :: Sum f g a a0 -> [a0] Source # null :: Sum f g a a0 -> Bool Source # length :: Sum f g a a0 -> Int Source # elem :: Eq a0 => a0 -> Sum f g a a0 -> Bool Source # maximum :: Ord a0 => Sum f g a a0 -> a0 Source # minimum :: Ord a0 => Sum f g a a0 -> a0 Source # | |
| (Foldable (f a), Foldable (g a)) => Foldable (Product f g a) | |
Defined in Data.Bifunctor.Product Methods fold :: Monoid m => Product f g a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Product f g a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Product f g a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Product f g a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Product f g a a0 -> a0 Source # toList :: Product f g a a0 -> [a0] Source # null :: Product f g a a0 -> Bool Source # length :: Product f g a a0 -> Int Source # elem :: Eq a0 => a0 -> Product f g a a0 -> Bool Source # maximum :: Ord a0 => Product f g a a0 -> a0 Source # minimum :: Ord a0 => Product f g a a0 -> a0 Source # | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 Source # toList :: Tannen f p a a0 -> [a0] Source # null :: Tannen f p a a0 -> Bool Source # length :: Tannen f p a a0 -> Int Source # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool Source # maximum :: Ord a0 => Tannen f p a a0 -> a0 Source # minimum :: Ord a0 => Tannen f p a a0 -> a0 Source # | |
| (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 Source # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 Source # toList :: Biff p f g a a0 -> [a0] Source # null :: Biff p f g a a0 -> Bool Source # length :: Biff p f g a a0 -> Int Source # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool Source # maximum :: Ord a0 => Biff p f g a a0 -> a0 Source # minimum :: Ord a0 => Biff p f g a a0 -> a0 Source # | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where Source #
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.
t (purex) =purex t (f<*>x) = t f<*>t x
and the identity functor Identity and composition functors
Compose are from Data.Functor.Identity and
Data.Functor.Compose.
A result of the naturality law is a purity law for traverse
traversepure=pure
(The naturality law is implied by parametricity and thus so is the purity law [1, p15].)
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).
References: [1] The Essence of the Iterator Pattern, Jeremy Gibbons and Bruno C. d. S. Oliveira
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) Source #
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) Source #
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) Source #
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) Source #
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
class Semigroup a where Source #
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
Since: base-4.9.0.0
Methods
(<>) :: a -> a -> a infixr 6 Source #
An associative operation.
>>>[1,2,3] <> [4,5,6][1,2,3,4,5,6]
Instances
class Semigroup a => Monoid a where Source #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:
- Right identity
x<>mempty= x- Left identity
mempty<>x = x- Associativity
x(<>(y<>z) = (x<>y)<>zSemigrouplaw)- Concatenation
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
>>>"Hello world" <> mempty"Hello world"
mappend :: a -> a -> a Source #
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = (<>)mappend is a synonym for
(<>), it is expected that the two functions are defined the same
way. In a future GHC release mappend will be removed from Monoid.
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.
>>>mconcat ["Hello", " ", "Haskell", "!"]"Hello Haskell!"
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 ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods mempty :: ByteString Source # mappend :: ByteString -> ByteString -> ByteString Source # mconcat :: [ByteString] -> ByteString Source # | |
| Monoid ByteString | |
Defined in Data.ByteString.Internal Methods mempty :: ByteString Source # mappend :: ByteString -> ByteString -> ByteString Source # mconcat :: [ByteString] -> ByteString Source # | |
| Monoid ShortByteString | |
Defined in Data.ByteString.Short.Internal Methods mempty :: ShortByteString Source # mappend :: ShortByteString -> ShortByteString -> ShortByteString Source # mconcat :: [ShortByteString] -> ShortByteString Source # | |
| Monoid Builder | |
| Monoid IntSet | |
| Monoid ByteArray | |
| Monoid PluginRecompile | |
Defined in Plugins Methods mempty :: PluginRecompile Source # mappend :: PluginRecompile -> PluginRecompile -> PluginRecompile Source # mconcat :: [PluginRecompile] -> PluginRecompile Source # | |
| Monoid Builder | |
| Monoid Doc | |
| Monoid PromDPatInfos | |
| Monoid ULetDecEnv | |
| a :=> (Monoid (Dict a)) | |
| () :=> (Monoid [a]) | |
| () :=> (Monoid Ordering) | |
| () :=> (Monoid ()) | |
| 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 a => Monoid (Solo a) | |
| Monoid (Predicate a) | |
| Monoid (Comparison a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Comparison a Source # mappend :: Comparison a -> Comparison a -> Comparison a Source # mconcat :: [Comparison a] -> Comparison a Source # | |
| Monoid (Equivalence a) | |
Defined in Data.Functor.Contravariant Methods mempty :: Equivalence a Source # mappend :: Equivalence a -> Equivalence a -> Equivalence a Source # mconcat :: [Equivalence a] -> Equivalence a Source # | |
| (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 Source # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m Source # mconcat :: [WrappedMonoid m] -> WrappedMonoid m Source # | |
| 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) | \(O(n+m)\) To obtain good performance, the smaller set must be presented as the first argument. Examples
|
| Monoid (Vector 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 Source # mappend :: SmallArray a -> SmallArray a -> SmallArray a Source # mconcat :: [SmallArray a] -> SmallArray a Source # | |
| Monoid (Array a) | |
| Semigroup a => Monoid (Maybe a) | |
| Monoid (Vector a) | |
| Monoid (MergeSet a) | |
| Monoid a => Monoid (SimOnly a) Source # | |
| 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) | If a key occurs in both maps, the mapping from the first will be the mapping in the result. Examples
|
| Monoid (ReifiedFold s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedFold s a Source # mappend :: ReifiedFold s a -> ReifiedFold s a -> ReifiedFold s a Source # mconcat :: [ReifiedFold s a] -> ReifiedFold s a Source # | |
| (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 Source # mappend :: TraversedF a f -> TraversedF a f -> TraversedF a f Source # mconcat :: [TraversedF a f] -> TraversedF a f Source # | |
| Monad m => Monoid (Sequenced a m) | |
| Monoid (f a) => Monoid (Indexing f a) |
|
| Monoid (Deepening i a) | This is an illegal |
| Ord a => Monoid (Bias L (OSet a)) | Empty sets and set union. When combining two sets that share elements, the indices of the left argument are preferred. See the asymptotics of ( Since: ordered-containers-0.2 |
| (Ord k, Monoid v) => Monoid (Bias L (OMap k v)) | Empty maps and map union. When combining two sets that share elements, the
indices of the left argument are preferred, and the values are combined with
See the asymptotics of Since: ordered-containers-0.2 |
| Ord a => Monoid (Bias R (OSet a)) | Empty sets and set union. When combining two sets that share elements, the indices of the right argument are preferred. See the asymptotics of ( Since: ordered-containers-0.2 |
| (Ord k, Monoid v) => Monoid (Bias R (OMap k v)) | Empty maps and map union. When combining two sets that share elements, the
indices of the right argument are preferred, and the values are combined
with See the asymptotics of Since: ordered-containers-0.2 |
| (Monoid a, Monoid b) => Monoid (Pair a b) | |
| (KnownNat n, Monoid a) => Monoid (Vec n a) Source # | |
| (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 |
| ArrowPlus a => Monoid (Automaton a b c) | |
| 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 |
| Applicative f => Monoid (Traversed a f) | |
| Monad m => Monoid (Sequenced a m) | |
| (Semigroup a, Monoid a) => Monoid (Tagged s a) | |
| Monoid (ReifiedIndexedFold i s a) | |
Defined in Control.Lens.Reified Methods mempty :: ReifiedIndexedFold i s a Source # mappend :: ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a -> ReifiedIndexedFold i s a Source # mconcat :: [ReifiedIndexedFold i s a] -> ReifiedIndexedFold i s a Source # | |
| Reifies s (ReifiedMonoid a) => Monoid (ReflectedMonoid a s) | |
Defined in Data.Reflection Methods mempty :: ReflectedMonoid a s Source # mappend :: ReflectedMonoid a s -> ReflectedMonoid a s -> ReflectedMonoid a s Source # mconcat :: [ReflectedMonoid a s] -> ReflectedMonoid a s Source # | |
| 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 Source # mappend :: BiSignalOut defaultState dom n -> BiSignalOut defaultState dom n -> BiSignalOut defaultState dom n Source # mconcat :: [BiSignalOut defaultState dom n] -> BiSignalOut defaultState dom n Source # | |
| 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 Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool Source # toConstr :: Bool -> Constr Source # dataTypeOf :: Bool -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) Source # gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool Source # | |
| Ord Bool | |
| Read Bool | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| Ix Bool | Since: base-2.1 |
| Generic Bool | Since: base-4.6.0.0 |
| Testable Bool | |
| Arbitrary Bool | |
| CoArbitrary Bool | |
Defined in Test.QuickCheck.Arbitrary | |
| Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable Methods sizeOf :: Bool -> Int Source # alignment :: Bool -> Int Source # peekElemOff :: Ptr Bool -> Int -> IO Bool Source # pokeElemOff :: Ptr Bool -> Int -> Bool -> IO () Source # peekByteOff :: Ptr b -> Int -> IO Bool Source # pokeByteOff :: Ptr b -> Int -> Bool -> IO () Source # | |
| Bits Bool | Interpret Since: base-4.7.0.0 |
Defined in Data.Bits Methods (.&.) :: Bool -> Bool -> Bool Source # (.|.) :: Bool -> Bool -> Bool Source # xor :: Bool -> Bool -> Bool Source # complement :: Bool -> Bool Source # shift :: Bool -> Int -> Bool Source # rotate :: Bool -> Int -> Bool Source # setBit :: Bool -> Int -> Bool Source # clearBit :: Bool -> Int -> Bool Source # complementBit :: Bool -> Int -> Bool Source # testBit :: Bool -> Int -> Bool Source # bitSizeMaybe :: Bool -> Maybe Int Source # bitSize :: Bool -> Int Source # isSigned :: Bool -> Bool Source # shiftL :: Bool -> Int -> Bool Source # unsafeShiftL :: Bool -> Int -> Bool Source # shiftR :: Bool -> Int -> Bool Source # unsafeShiftR :: Bool -> Int -> Bool Source # rotateL :: Bool -> Int -> Bool Source # | |
| FiniteBits Bool | Since: base-4.7.0.0 |
| Binary Bool | |
| Default Bool | |
Defined in Data.Default.Internal | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| Hashable Bool | |
| Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
| Uniform Bool | |
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m Bool Source # | |
| UniformRange Bool | |
| PShow Bool | |
| SShow Bool | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Bool) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source # sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t1 :: [Bool]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source # | |
| PEnum Bool | |
| SEnum Bool | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: forall (t :: Bool). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Bool). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source # sEnumFromThenTo :: forall (t1 :: Bool) (t2 :: Bool) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source # | |
| PBounded Bool | |
| SBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Bool | |
| SOrd Bool | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source # (%<) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source # (%<=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source # (%>) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source # (%>=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source # sMax :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source # sMin :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source # | |
| SEq Bool | |
| PEq Bool | |
| SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep Bool | |
| NFDataX Bool Source # | |
Defined in Clash.XException | |
| ShowX Bool Source # | |
| BitPack Bool Source # | |
| Parity Bool Source # | |
| Bundle Bool Source # | |
| Counter Bool Source # | Since: 1.8.2 |
| AutoReg Bool Source # | |
Defined in Clash.Class.AutoReg.Internal | |
| Bundle Bool Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| Lift Bool | |
| IArray UArray Bool | |
Defined in Data.Array.Base Methods bounds :: Ix i => UArray i Bool -> (i, i) Source # 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 | |
| TestCoercion SBool | |
Defined in Data.Singletons.Prelude.Instances | |
| TestEquality SBool | |
Defined in Data.Singletons.Prelude.Instances | |
| Vector Vector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: Mutable Vector s Bool -> ST s (Vector Bool) Source # basicUnsafeThaw :: Vector Bool -> ST s (Mutable Vector s Bool) Source # basicLength :: Vector Bool -> Int Source # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool Source # basicUnsafeIndexM :: Vector Bool -> Int -> Box Bool Source # basicUnsafeCopy :: Mutable Vector s Bool -> Vector Bool -> ST s () Source # | |
| MVector MVector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int Source # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool Source # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool Source # basicUnsafeNew :: Int -> ST s (MVector s Bool) Source # basicInitialize :: MVector s Bool -> ST s () Source # basicUnsafeReplicate :: Int -> Bool -> ST s (MVector s Bool) Source # basicUnsafeRead :: MVector s Bool -> Int -> ST s Bool Source # basicUnsafeWrite :: MVector s Bool -> Int -> Bool -> ST s () Source # basicClear :: MVector s Bool -> ST s () Source # basicSet :: MVector s Bool -> Bool -> ST s () Source # basicUnsafeCopy :: MVector s Bool -> MVector s Bool -> ST s () Source # basicUnsafeMove :: MVector s Bool -> MVector s Bool -> ST s () Source # basicUnsafeGrow :: MVector s Bool -> Int -> ST s (MVector s Bool) Source # | |
| SingI 'False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI 'True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| LockStep Bool c Source # | |
| () :=> (Bounded Bool) | |
| () :=> (Enum Bool) | |
| () :=> (Eq Bool) | |
| () :=> (Ord Bool) | |
| () :=> (Read Bool) | |
| () :=> (Show Bool) | |
| () :=> (Bits Bool) | |
| AssertionValue dom (Signal dom Bool) Source # | Stream of booleans, originating from a circuit |
Defined in Clash.Verification.Internal | |
| MArray (STUArray s) Bool (ST s) | |
Defined in Data.Array.Base Methods getBounds :: Ix i => STUArray s i Bool -> ST s (i, i) Source # getNumElements :: Ix i => STUArray s i Bool -> ST s Int newArray :: Ix i => (i, i) -> Bool -> ST s (STUArray s i Bool) Source # newArray_ :: Ix i => (i, i) -> ST s (STUArray s i Bool) Source # 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 :: () Source # | |
| SuppressUnusedWarnings FromEnum_6989586621680147033Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621679864260Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ToEnum_6989586621680147019Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680670501Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI NotSym0 | |
| SingI (||@#@$) | |
| SingI (&&@#@$) | |
| SingI (<=?@#@$) | |
| SingI All_Sym0 | |
| SingI AllSym0 | |
| SingI Any_Sym0 | |
| SingI AnySym0 | |
| SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 Source # | |
| SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAllSym0 Source # | |
| SingI GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetAnySym0 Source # | |
| SuppressUnusedWarnings ((||@#@$$) a6989586621679810921 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((&&@#@$$) a6989586621679810111 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864260Sym1 a6989586621679864265 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670501Sym1 a6989586621680670511 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListnullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680814639Sym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((<=?@#@$$) a6989586621680044246 :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798090Scrutinee_6989586621680796834Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797727Scrutinee_6989586621680796832Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680815266Sym0 :: TyFun a (Product a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680815091Sym0 :: TyFun a (Sum a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814916Sym0 :: TyFun a (Dual a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814884Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814505Sym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846632Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846613Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846591Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846573Sym0 :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846682Scrutinee_6989586621679846361Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846664Scrutinee_6989586621679846359Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846563Scrutinee_6989586621679846307Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846558Scrutinee_6989586621679846302Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680795897Scrutinee_6989586621680793470Sym0 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621681012024Sym0 :: TyFun a (Identity a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621681012237Sym0 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680815048Sym0 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680815223Sym0 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680815398Sym0 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386048ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386048YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386048X_6989586621680386049Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386013ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386013YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386013X_6989586621680386014Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source # | |
| SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
| SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
| SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) Source # | |
| SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
| SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
| 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 | |
| SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 Source # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 Source # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 Source # | |
| 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) | |
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
| SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
| SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
| 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 Source # | |
| SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 Source # | |
| SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| 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 Source # | |
| SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
| SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 Source # | |
| 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 | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 Source # | |
| SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 Source # | |
| 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 Source # | |
| 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 Source # | |
| SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| 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) | |
| SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680646801 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListelemSym1 a6989586621680646729 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680386531 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680386554 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680386561 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680386547 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680386539 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680386756 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680386764 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814505Sym1 a6989586621680814514 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680814803Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385836Scrutinee_6989586621680382281Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_bySym1 a6989586621680385767 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798090Scrutinee_6989586621680796834Sym1 x6989586621680798079 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797727Scrutinee_6989586621680796832Sym1 x6989586621680797705 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814395Sym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (DefaultEqSym1 a6989586621679816985 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((==@#@$$) a6989586621679816978 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((/=@#@$$) a6989586621679816982 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Bool_Sym1 a6989586621679808344 :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846632Sym1 a6989586621679846638 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846613Sym1 a6989586621679846618 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846591Sym1 a6989586621679846597 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679846573Sym1 a6989586621679846578 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846682Scrutinee_6989586621679846361Sym1 x6989586621679846680 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846664Scrutinee_6989586621679846359Sym1 x6989586621679846661 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846563Scrutinee_6989586621679846307Sym1 x6989586621679846556 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846558Scrutinee_6989586621679846302Sym1 x6989586621679846556 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((>@#@$$) a6989586621679846527 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((>=@#@$$) a6989586621679846532 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((<@#@$$) a6989586621679846517 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ((<=@#@$$) a6989586621679846522 :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621681239218Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621681012024Sym1 a6989586621681012029 :: TyFun (Identity a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814916Sym1 a6989586621680814925 :: TyFun (Dual a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680815091Sym1 a6989586621680815100 :: TyFun (Sum a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680815266Sym1 a6989586621680815275 :: TyFun (Product a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814884Sym1 a6989586621680814889 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680814877Sym0 :: TyFun (Proxy a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680795192Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385915ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385915YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385915X_6989586621680385916Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385781NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680386076Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680813928Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679821005GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () Source # | |
| (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) Source # | |
| (SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) Source # | |
| (SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) Source # | |
| (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 Source # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 Source # | |
| 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 Source # | |
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
| (SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) | |
| (SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type) | |
| SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
| (SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
| (SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
| (SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
| (SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
| SuppressUnusedWarnings (Bool_Sym2 a6989586621679808344 a6989586621679808345 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_bySym2 a6989586621680385767 a6989586621680385768 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386080Scrutinee_6989586621680382259Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385992Scrutinee_6989586621680382265Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385979Scrutinee_6989586621680382267Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385902Scrutinee_6989586621680382277Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385836Scrutinee_6989586621680382281Sym1 n6989586621680385834 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385817Scrutinee_6989586621680382283Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385804Scrutinee_6989586621680382285Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385788Scrutinee_6989586621680382287Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680814359Sym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680813942 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680814367Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Elem_6989586621680814395Sym1 a6989586621680814404 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680814195 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680814000 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680813991 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621681239218Sym1 a6989586621681239223 :: TyFun (Arg a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680795192Sym1 a6989586621680795198 :: TyFun (Proxy s) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source # | |
| (SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
| (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) | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d) Source # | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d :: TyFun (t a) Bool -> Type) | |
| (SFoldable t, SingI d) => SingI (AnySym1 d :: TyFun (t a) Bool -> Type) | |
| (SFoldable t, SingI d) => SingI (AllSym1 d :: TyFun (t a) Bool -> Type) | |
| SuppressUnusedWarnings (Let6989586621680386080Scrutinee_6989586621680382259Sym1 x6989586621680386078 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385992Scrutinee_6989586621680382265Sym1 n6989586621680385989 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385979Scrutinee_6989586621680382267Sym1 n6989586621680385976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385902Scrutinee_6989586621680382277Sym1 key6989586621680385898 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385817Scrutinee_6989586621680382283Sym1 x6989586621680385814 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385804Scrutinee_6989586621680382285Sym1 x6989586621680385801 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385788Scrutinee_6989586621680382287Sym1 y6989586621680385785 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680120066Scrutinee_6989586621680118859Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680814367Sym1 a_69895866216808143616989586621680814366 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385804Scrutinee_6989586621680382285Sym2 x6989586621680385801 xs6989586621680385802 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385788Scrutinee_6989586621680382287Sym2 y6989586621680385785 ys6989586621680385786 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385992Scrutinee_6989586621680382265Sym2 n6989586621680385989 x6989586621680385990 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385979Scrutinee_6989586621680382267Sym2 n6989586621680385976 x6989586621680385977 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385902Scrutinee_6989586621680382277Sym2 key6989586621680385898 x6989586621680385899 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385817Scrutinee_6989586621680382283Sym2 x6989586621680385814 xs6989586621680385815 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680120066Scrutinee_6989586621680118859Sym1 x6989586621680120064 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680814367Sym2 a_69895866216808143616989586621680814366 arg_69895866216808136996989586621680814369 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386080Scrutinee_6989586621680382259Sym2 x6989586621680386078 xs6989586621680386079 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680386129Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386080Scrutinee_6989586621680382259Sym3 x6989586621680386078 xs6989586621680386079 p6989586621680386074 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385902Scrutinee_6989586621680382277Sym3 key6989586621680385898 x6989586621680385899 y6989586621680385900 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385804Scrutinee_6989586621680382285Sym3 x6989586621680385801 xs6989586621680385802 ls6989586621680385803 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680120066Scrutinee_6989586621680118859Sym2 x6989586621680120064 x06989586621680120057 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym1 x16989586621680119934 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym1 x16989586621680119852 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385788Scrutinee_6989586621680382287Sym3 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680385788Scrutinee_6989586621680382287Sym4 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 eq6989586621680385779 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680120066Scrutinee_6989586621680118859Sym3 x6989586621680120064 x06989586621680120057 y6989586621680120058 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym2 x16989586621680119934 x26989586621680119936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym2 x16989586621680119852 x26989586621680119853 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680120066Scrutinee_6989586621680118859Sym4 x6989586621680120064 x06989586621680120057 y6989586621680120058 arg_69895866216801188556989586621680120052 :: TyFun k4 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym3 x16989586621680119934 x26989586621680119936 y6989586621680119938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym3 x16989586621680119852 x26989586621680119853 y6989586621680119854 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym4 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym4 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119946Scrutinee_6989586621680118885Sym5 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 arg_69895866216801188806989586621680119923 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680119862Scrutinee_6989586621680118913Sym5 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 arg_69895866216801189066989586621680119843 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| Clocks (Clock c1, Clock c2, Signal pllLock Bool) Source # | |
| Clocks (Clock c1, Clock c2, Clock c3, Signal pllLock Bool) Source # | |
| type Rep Bool | |
| newtype Vector Bool | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680113700Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680113694Sym0 | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Demote Bool | |
Defined in Data.Singletons.Prelude.Instances | |
| type DemoteRep Bool | |
Defined in GHC.Generics | |
| data Sing (a :: Bool) | |
| type BitSize Bool Source # | |
Defined in Clash.Class.BitPack.Internal | |
| 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 Unbundled dom Bool Source # | |
Defined in Clash.Signal.Bundle | |
| type TryDomain t Bool Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| 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 (a6989586621679811576 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply FromEnum_6989586621680147033Sym0 (a6989586621680147037 :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply All_Sym0 (a6989586621680369413 :: Bool) | |
| type Apply AllSym0 (a6989586621680256599 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Any_Sym0 (a6989586621680369407 :: Bool) | |
| type Apply AnySym0 (a6989586621680256616 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ToEnum_6989586621680147019Sym0 (a6989586621680147023 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply GetAllSym0 (a6989586621680256602 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAnySym0 (a6989586621680256619 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ((||@#@$$) a6989586621679810921 :: TyFun Bool Bool -> Type) (a6989586621679810922 :: Bool) | |
| type Apply ((&&@#@$$) a6989586621679810111 :: TyFun Bool Bool -> Type) (a6989586621679810112 :: Bool) | |
| type Apply (Compare_6989586621679864260Sym1 a6989586621679864265 :: TyFun Bool Ordering -> Type) (a6989586621679864266 :: Bool) | |
| type Apply ((<=?@#@$$) a6989586621680044246 :: TyFun Nat Bool -> Type) (a6989586621680044247 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (Let6989586621680795897Scrutinee_6989586621680793470Sym0 :: TyFun k1 Bool -> Type) (n6989586621680795896 :: k1) | |
Defined in Data.Singletons.Prelude.Proxy | |
| type Apply (Let6989586621680797727Scrutinee_6989586621680796832Sym1 x6989586621680797705 :: TyFun k1 Bool -> Type) (y6989586621680797706 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680798090Scrutinee_6989586621680796834Sym1 x6989586621680798079 :: TyFun k1 Bool -> Type) (y6989586621680798080 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply ((==@#@$$) a6989586621679816978 :: TyFun a Bool -> Type) (a6989586621679816979 :: a) | |
| type Apply ((/=@#@$$) a6989586621679816982 :: TyFun a Bool -> Type) (a6989586621679816983 :: a) | |
| type Apply (DefaultEqSym1 a6989586621679816985 :: TyFun k Bool -> Type) (a6989586621679816986 :: k) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym1 a6989586621679816985 :: TyFun k Bool -> Type) (a6989586621679816986 :: k) = DefaultEqSym2 a6989586621679816985 a6989586621679816986 | |
| type Apply (Let6989586621679846558Scrutinee_6989586621679846302Sym1 x6989586621679846556 :: TyFun k1 Bool -> Type) (y6989586621679846557 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679846632Sym1 a6989586621679846638 :: TyFun a Bool -> Type) (a6989586621679846639 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679846613Sym1 a6989586621679846618 :: TyFun a Bool -> Type) (a6989586621679846619 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679846591Sym1 a6989586621679846597 :: TyFun a Bool -> Type) (a6989586621679846598 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679846573Sym1 a6989586621679846578 :: TyFun a Bool -> Type) (a6989586621679846579 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<=@#@$$) a6989586621679846522 :: TyFun a Bool -> Type) (a6989586621679846523 :: a) | |
| type Apply ((>=@#@$$) a6989586621679846532 :: TyFun a Bool -> Type) (a6989586621679846533 :: a) | |
| type Apply ((>@#@$$) a6989586621679846527 :: TyFun a Bool -> Type) (a6989586621679846528 :: a) | |
| type Apply (Let6989586621679846682Scrutinee_6989586621679846361Sym1 x6989586621679846680 :: TyFun k1 Bool -> Type) (y6989586621679846681 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679846664Scrutinee_6989586621679846359Sym1 x6989586621679846661 :: TyFun k1 Bool -> Type) (y6989586621679846662 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679846563Scrutinee_6989586621679846307Sym1 x6989586621679846556 :: TyFun k1 Bool -> Type) (y6989586621679846557 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<@#@$$) a6989586621679846517 :: TyFun a Bool -> Type) (a6989586621679846518 :: a) | |
| type Apply (Bool_Sym2 a6989586621679808344 a6989586621679808345 :: TyFun Bool a -> Type) (a6989586621679808346 :: Bool) | |
| type Apply (Let6989586621680385836Scrutinee_6989586621680382281Sym1 n6989586621680385834 :: TyFun k Bool -> Type) (x6989586621680385835 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385817Scrutinee_6989586621680382283Sym2 x6989586621680385814 xs6989586621680385815 :: TyFun k3 Bool -> Type) (n6989586621680385816 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385979Scrutinee_6989586621680382267Sym2 n6989586621680385976 x6989586621680385977 :: TyFun k3 Bool -> Type) (xs6989586621680385978 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385992Scrutinee_6989586621680382265Sym2 n6989586621680385989 x6989586621680385990 :: TyFun k3 Bool -> Type) (xs6989586621680385991 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680814367Sym2 a_69895866216808143616989586621680814366 arg_69895866216808136996989586621680814369 :: TyFun k3 Bool -> Type) (arg_69895866216808137016989586621680814370 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680814367Sym2 a_69895866216808143616989586621680814366 arg_69895866216808136996989586621680814369 :: TyFun k3 Bool -> Type) (arg_69895866216808137016989586621680814370 :: k3) = Lambda_6989586621680814367Sym3 a_69895866216808143616989586621680814366 arg_69895866216808136996989586621680814369 arg_69895866216808137016989586621680814370 | |
| type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym3 key6989586621680385898 x6989586621680385899 y6989586621680385900 :: TyFun k3 Bool -> Type) (xys6989586621680385901 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym3 key6989586621680385898 x6989586621680385899 y6989586621680385900 :: TyFun k3 Bool -> Type) (xys6989586621680385901 :: k3) = Let6989586621680385902Scrutinee_6989586621680382277Sym4 key6989586621680385898 x6989586621680385899 y6989586621680385900 xys6989586621680385901 | |
| type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym3 x6989586621680385801 xs6989586621680385802 ls6989586621680385803 :: TyFun k3 Bool -> Type) (l6989586621680385796 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym3 x6989586621680385801 xs6989586621680385802 ls6989586621680385803 :: TyFun k3 Bool -> Type) (l6989586621680385796 :: k3) = Let6989586621680385804Scrutinee_6989586621680382285Sym4 x6989586621680385801 xs6989586621680385802 ls6989586621680385803 l6989586621680385796 | |
| type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym3 x6989586621680386078 xs6989586621680386079 p6989586621680386074 :: TyFun k Bool -> Type) (a_69895866216803860676989586621680386075 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym3 x6989586621680386078 xs6989586621680386079 p6989586621680386074 :: TyFun k Bool -> Type) (a_69895866216803860676989586621680386075 :: k) = Let6989586621680386080Scrutinee_6989586621680382259Sym4 x6989586621680386078 xs6989586621680386079 p6989586621680386074 a_69895866216803860676989586621680386075 | |
| type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym4 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 eq6989586621680385779 :: TyFun k3 Bool -> Type) (l6989586621680385780 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym4 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 eq6989586621680385779 :: TyFun k3 Bool -> Type) (l6989586621680385780 :: k3) = Let6989586621680385788Scrutinee_6989586621680382287Sym5 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 eq6989586621680385779 l6989586621680385780 | |
| type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym4 x6989586621680120064 x06989586621680120057 y6989586621680120058 arg_69895866216801188556989586621680120052 :: TyFun k4 Bool -> Type) (arg_69895866216801188576989586621680120053 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym4 x6989586621680120064 x06989586621680120057 y6989586621680120058 arg_69895866216801188556989586621680120052 :: TyFun k4 Bool -> Type) (arg_69895866216801188576989586621680120053 :: k4) = Let6989586621680120066Scrutinee_6989586621680118859Sym5 x6989586621680120064 x06989586621680120057 y6989586621680120058 arg_69895866216801188556989586621680120052 arg_69895866216801188576989586621680120053 | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym5 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 arg_69895866216801189066989586621680119843 :: TyFun k5 Bool -> Type) (arg_69895866216801189086989586621680119845 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym5 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 arg_69895866216801189066989586621680119843 :: TyFun k5 Bool -> Type) (arg_69895866216801189086989586621680119845 :: k5) = Let6989586621680119862Scrutinee_6989586621680118913Sym6 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 arg_69895866216801189066989586621680119843 arg_69895866216801189086989586621680119845 | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym5 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 arg_69895866216801188806989586621680119923 :: TyFun k5 Bool -> Type) (arg_69895866216801188826989586621680119924 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym5 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 arg_69895866216801188806989586621680119923 :: TyFun k5 Bool -> Type) (arg_69895866216801188826989586621680119924 :: k5) = Let6989586621680119946Scrutinee_6989586621680118885Sym6 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 arg_69895866216801188806989586621680119923 arg_69895866216801188826989586621680119924 | |
| type Eval (Not 'False) | |
Defined in Fcf.Data.Bool | |
| type Eval (Not 'True) | |
Defined in Fcf.Data.Bool | |
| type Apply (GuardSym0 :: TyFun Bool (f ()) -> Type) (a6989586621679893520 :: Bool) | |
| 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 (||@#@$) (a6989586621679810921 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply (&&@#@$) (a6989586621679810111 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply Compare_6989586621679864260Sym0 (a6989586621679864265 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowParenSym0 (a6989586621680644704 :: Bool) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply ShowsPrec_6989586621680670501Sym0 (a6989586621680670511 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (<=?@#@$) (a6989586621680044246 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (ShowsPrec_6989586621680670501Sym1 a6989586621680670511 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680670512 :: Bool) | |
| type Apply (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) (a6989586621679893728 :: Bool) | |
| type Apply (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680646729 :: a) | |
| type Apply (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680386531 :: a) | |
| type Apply (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680386539 :: a) | |
| type Apply (Let6989586621680797727Scrutinee_6989586621680796832Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680797705 :: k1) | |
| type Apply (Let6989586621680798090Scrutinee_6989586621680796834Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680798079 :: k1) | |
| type Apply (Elem_6989586621680814505Sym0 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680814514 :: a) | |
| type Apply (Elem_6989586621680814884Sym0 :: TyFun a (Proxy a ~> Bool) -> Type) (a6989586621680814889 :: a) | |
| type Apply (Elem_6989586621680814916Sym0 :: TyFun a (Dual a ~> Bool) -> Type) (a6989586621680814925 :: a) | |
| type Apply (Elem_6989586621680815091Sym0 :: TyFun a (Sum a ~> Bool) -> Type) (a6989586621680815100 :: a) | |
| type Apply (Elem_6989586621680815266Sym0 :: TyFun a (Product a ~> Bool) -> Type) (a6989586621680815275 :: a) | |
| type Apply ((==@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679816978 :: a) | |
| type Apply ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679816982 :: a) | |
| type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679816985 :: k) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k (k ~> Bool) -> Type) (a6989586621679816985 :: k) = DefaultEqSym1 a6989586621679816985 | |
| type Apply (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) (a6989586621679808344 :: a) | |
| type Apply (Let6989586621679846558Scrutinee_6989586621679846302Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679846556 :: k1) | |
| type Apply (TFHelper_6989586621679846632Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679846638 :: a) | |
| type Apply (TFHelper_6989586621679846613Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679846618 :: a) | |
| type Apply (TFHelper_6989586621679846591Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679846597 :: a) | |
| type Apply (TFHelper_6989586621679846573Sym0 :: TyFun a (a ~> Bool) -> Type) (a6989586621679846578 :: a) | |
| type Apply ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679846522 :: a) | |
| type Apply ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679846532 :: a) | |
| type Apply ((>@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679846527 :: a) | |
| type Apply (Let6989586621679846682Scrutinee_6989586621679846361Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679846680 :: k1) | |
| type Apply (Let6989586621679846664Scrutinee_6989586621679846359Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679846661 :: k1) | |
| type Apply (Let6989586621679846563Scrutinee_6989586621679846307Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679846556 :: k1) | |
| type Apply ((<@#@$) :: TyFun a (a ~> Bool) -> Type) (a6989586621679846517 :: a) | |
| type Apply (Elem_6989586621681012024Sym0 :: TyFun a (Identity a ~> Bool) -> Type) (a6989586621681012029 :: a) | |
| type Apply (Let6989586621680385836Scrutinee_6989586621680382281Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680385834 :: k1) | |
| type Apply (Elem_bySym1 a6989586621680385767 :: TyFun a ([a] ~> Bool) -> Type) (a6989586621680385768 :: a) | |
| type Apply (Elem_6989586621680814395Sym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680814404 :: a) | |
| type Apply (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680814195 :: a) | |
| type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680813942 :: a) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) (a6989586621680813942 :: a) = NotElemSym1 a6989586621680813942 :: TyFun (t a) Bool -> Type | |
| type Apply (Bool_Sym1 a6989586621679808344 :: TyFun a (Bool ~> a) -> Type) (a6989586621679808345 :: a) | |
| type Apply (Let6989586621680385817Scrutinee_6989586621680382283Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680385814 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680385898 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680385898 :: k1) = Let6989586621680385902Scrutinee_6989586621680382277Sym1 key6989586621680385898 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680385979Scrutinee_6989586621680382267Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680385976 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385992Scrutinee_6989586621680382265Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680385989 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680385785 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680385785 :: k1) = Let6989586621680385788Scrutinee_6989586621680382287Sym1 y6989586621680385785 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680385801 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680385801 :: k1) = Let6989586621680385804Scrutinee_6989586621680382285Sym1 x6989586621680385801 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680386078 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym0 :: TyFun k1 (TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680386078 :: k1) = Let6989586621680386080Scrutinee_6989586621680382259Sym1 x6989586621680386078 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680814367Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216808143616989586621680814366 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680385817Scrutinee_6989586621680382283Sym1 x6989586621680385814 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680385815 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym1 key6989586621680385898 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680385899 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym1 key6989586621680385898 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680385899 :: k1) = Let6989586621680385902Scrutinee_6989586621680382277Sym2 key6989586621680385898 x6989586621680385899 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621680385979Scrutinee_6989586621680382267Sym1 n6989586621680385976 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680385977 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385992Scrutinee_6989586621680382265Sym1 n6989586621680385989 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680385990 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym1 y6989586621680385785 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680385786 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym1 y6989586621680385785 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680385786 :: k2) = Let6989586621680385788Scrutinee_6989586621680382287Sym2 y6989586621680385785 ys6989586621680385786 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym1 x6989586621680385801 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680385802 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym1 x6989586621680385801 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680385802 :: k2) = Let6989586621680385804Scrutinee_6989586621680382285Sym2 x6989586621680385801 xs6989586621680385802 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680120064 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680120064 :: k1) = Let6989586621680120066Scrutinee_6989586621680118859Sym1 x6989586621680120064 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680814367Sym1 a_69895866216808143616989586621680814366 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808136996989586621680814369 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680814367Sym1 a_69895866216808143616989586621680814366 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (arg_69895866216808136996989586621680814369 :: k2) = Lambda_6989586621680814367Sym2 a_69895866216808143616989586621680814366 arg_69895866216808136996989586621680814369 :: TyFun k3 Bool -> Type | |
| type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym2 key6989586621680385898 x6989586621680385899 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680385900 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385902Scrutinee_6989586621680382277Sym2 key6989586621680385898 x6989586621680385899 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680385900 :: k2) = Let6989586621680385902Scrutinee_6989586621680382277Sym3 key6989586621680385898 x6989586621680385899 y6989586621680385900 :: TyFun k3 Bool -> Type | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680119852 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680119852 :: k1) = Let6989586621680119862Scrutinee_6989586621680118913Sym1 x16989586621680119852 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680119934 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680119934 :: k1) = Let6989586621680119946Scrutinee_6989586621680118885Sym1 x16989586621680119934 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym1 x6989586621680120064 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680120057 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym1 x6989586621680120064 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680120057 :: k2) = Let6989586621680120066Scrutinee_6989586621680118859Sym2 x6989586621680120064 x06989586621680120057 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym1 x16989586621680119852 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680119853 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym1 x16989586621680119852 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680119853 :: k2) = Let6989586621680119862Scrutinee_6989586621680118913Sym2 x16989586621680119852 x26989586621680119853 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym1 x16989586621680119934 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680119936 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym1 x16989586621680119934 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680119936 :: k2) = Let6989586621680119946Scrutinee_6989586621680118885Sym2 x16989586621680119934 x26989586621680119936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym2 x6989586621680120064 x06989586621680120057 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680120058 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym2 x6989586621680120064 x06989586621680120057 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680120058 :: k1) = Let6989586621680120066Scrutinee_6989586621680118859Sym3 x6989586621680120064 x06989586621680120057 y6989586621680120058 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym2 x16989586621680119852 x26989586621680119853 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680119854 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym2 x16989586621680119852 x26989586621680119853 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680119854 :: k1) = Let6989586621680119862Scrutinee_6989586621680118913Sym3 x16989586621680119852 x26989586621680119853 y6989586621680119854 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym2 x16989586621680119934 x26989586621680119936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680119938 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym2 x16989586621680119934 x26989586621680119936 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680119938 :: k1) = Let6989586621680119946Scrutinee_6989586621680118885Sym3 x16989586621680119934 x26989586621680119936 y6989586621680119938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym3 x6989586621680120064 x06989586621680120057 y6989586621680120058 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801188556989586621680120052 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680120066Scrutinee_6989586621680118859Sym3 x6989586621680120064 x06989586621680120057 y6989586621680120058 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801188556989586621680120052 :: k3) = Let6989586621680120066Scrutinee_6989586621680118859Sym4 x6989586621680120064 x06989586621680120057 y6989586621680120058 arg_69895866216801188556989586621680120052 :: TyFun k4 Bool -> Type | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym3 x16989586621680119852 x26989586621680119853 y6989586621680119854 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801189046989586621680119842 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym3 x16989586621680119852 x26989586621680119853 y6989586621680119854 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801189046989586621680119842 :: k3) = Let6989586621680119862Scrutinee_6989586621680118913Sym4 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym3 x16989586621680119934 x26989586621680119936 y6989586621680119938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801188786989586621680119922 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym3 x16989586621680119934 x26989586621680119936 y6989586621680119938 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801188786989586621680119922 :: k3) = Let6989586621680119946Scrutinee_6989586621680118885Sym4 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym4 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801189066989586621680119843 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119862Scrutinee_6989586621680118913Sym4 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801189066989586621680119843 :: k4) = Let6989586621680119862Scrutinee_6989586621680118913Sym5 x16989586621680119852 x26989586621680119853 y6989586621680119854 arg_69895866216801189046989586621680119842 arg_69895866216801189066989586621680119843 :: TyFun k5 Bool -> Type | |
| type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym4 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801188806989586621680119923 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680119946Scrutinee_6989586621680118885Sym4 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801188806989586621680119923 :: k4) = Let6989586621680119946Scrutinee_6989586621680118885Sym5 x16989586621680119934 x26989586621680119936 y6989586621680119938 arg_69895866216801188786989586621680119922 arg_69895866216801188806989586621680119923 :: TyFun k5 Bool -> Type | |
| 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 OrSym0 (a6989586621680386771 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply AndSym0 (a6989586621680386776 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680646638 :: [a]) | |
| type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680386949 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Null_6989586621680814639Sym0 :: TyFun [a] Bool -> Type) (a6989586621680814645 :: [a]) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118347 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118347 :: Maybe a) = IsNothingSym1 a6989586621680118347 | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118350 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118350 :: Maybe a) = IsJustSym1 a6989586621680118350 | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680814014 :: t Bool) | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680814008 :: t Bool) | |
| type Apply (Null_6989586621681012237Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621681012243 :: Identity a) | |
| type Apply (Null_6989586621680815048Sym0 :: TyFun (Dual a) Bool -> Type) (a6989586621680815052 :: Dual a) | |
| type Apply (Null_6989586621680815223Sym0 :: TyFun (Sum a) Bool -> Type) (a6989586621680815227 :: Sum a) | |
| type Apply (Null_6989586621680815398Sym0 :: TyFun (Product a) Bool -> Type) (a6989586621680815402 :: Product a) | |
| type Apply (ListelemSym1 a6989586621680646729 :: TyFun [a] Bool -> Type) (a6989586621680646730 :: [a]) | |
| type Apply (ListisPrefixOfSym1 a6989586621680646801 :: TyFun [a] Bool -> Type) (a6989586621680646802 :: [a]) | |
| type Apply (NotElemSym1 a6989586621680386531 :: TyFun [a] Bool -> Type) (a6989586621680386532 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemSym1 a6989586621680386539 :: TyFun [a] Bool -> Type) (a6989586621680386540 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsPrefixOfSym1 a6989586621680386561 :: TyFun [a] Bool -> Type) (a6989586621680386562 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680386561 :: TyFun [a] Bool -> Type) (a6989586621680386562 :: [a]) = IsPrefixOfSym2 a6989586621680386561 a6989586621680386562 | |
| type Apply (AnySym1 a6989586621680386756 :: TyFun [a] Bool -> Type) (a6989586621680386757 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsInfixOfSym1 a6989586621680386547 :: TyFun [a] Bool -> Type) (a6989586621680386548 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym1 a6989586621680386547 :: TyFun [a] Bool -> Type) (a6989586621680386548 :: [a]) = IsInfixOfSym2 a6989586621680386547 a6989586621680386548 | |
| type Apply (AllSym1 a6989586621680386764 :: TyFun [a] Bool -> Type) (a6989586621680386765 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsSuffixOfSym1 a6989586621680386554 :: TyFun [a] Bool -> Type) (a6989586621680386555 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680386554 :: TyFun [a] Bool -> Type) (a6989586621680386555 :: [a]) = IsSuffixOfSym2 a6989586621680386554 a6989586621680386555 | |
| type Apply (Elem_6989586621680814505Sym1 a6989586621680814514 :: TyFun [a] Bool -> Type) (a6989586621680814515 :: [a]) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621681012024Sym1 a6989586621681012029 :: TyFun (Identity a) Bool -> Type) (a6989586621681012030 :: Identity a) | |
| type Apply (Elem_6989586621680814916Sym1 a6989586621680814925 :: TyFun (Dual a) Bool -> Type) (a6989586621680814926 :: Dual a) | |
| type Apply (Elem_6989586621680815091Sym1 a6989586621680815100 :: TyFun (Sum a) Bool -> Type) (a6989586621680815101 :: Sum a) | |
| type Apply (Elem_6989586621680815266Sym1 a6989586621680815275 :: TyFun (Product a) Bool -> Type) (a6989586621680815276 :: Product a) | |
| type Apply (Elem_bySym2 a6989586621680385767 a6989586621680385768 :: TyFun [a] Bool -> Type) (a6989586621680385769 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Elem_6989586621680814395Sym1 a6989586621680814404 :: TyFun (t a) Bool -> Type) (a6989586621680814405 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680814359Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680814365 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AnySym1 a6989586621680814000 :: TyFun (t a) Bool -> Type) (a6989586621680814001 :: t a) | |
| type Apply (ElemSym1 a6989586621680814195 :: TyFun (t a) Bool -> Type) (a6989586621680814196 :: t a) | |
| type Apply (NotElemSym1 a6989586621680813942 :: TyFun (t a) Bool -> Type) (a6989586621680813943 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym1 a6989586621680813942 :: TyFun (t a) Bool -> Type) (a6989586621680813943 :: t a) = NotElemSym2 a6989586621680813942 a6989586621680813943 | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (a6989586621680814188 :: t a) | |
| type Apply (AllSym1 a6989586621680813991 :: TyFun (t a) Bool -> Type) (a6989586621680813992 :: t a) | |
| type Apply (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680646801 :: [a]) | |
| type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386561 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386561 :: [a]) = IsPrefixOfSym1 a6989586621680386561 | |
| type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386547 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386547 :: [a]) = IsInfixOfSym1 a6989586621680386547 | |
| type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386554 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) (a6989586621680386554 :: [a]) = IsSuffixOfSym1 a6989586621680386554 | |
| type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym1 x6989586621680386078 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680386079 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym1 x6989586621680386078 :: TyFun [a] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680386079 :: [a]) = Let6989586621680386080Scrutinee_6989586621680382259Sym2 x6989586621680386078 xs6989586621680386079 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type | |
| type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym2 y6989586621680385785 ys6989586621680385786 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680385787 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym2 y6989586621680385785 ys6989586621680385786 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680385787 :: [k1]) = Let6989586621680385788Scrutinee_6989586621680382287Sym3 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym2 x6989586621680385801 xs6989586621680385802 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680385803 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385804Scrutinee_6989586621680382285Sym2 x6989586621680385801 xs6989586621680385802 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680385803 :: [k1]) = Let6989586621680385804Scrutinee_6989586621680382285Sym3 x6989586621680385801 xs6989586621680385802 ls6989586621680385803 :: TyFun k3 Bool -> Type | |
| type ClocksCxt (Clock c1, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
| type NumOutClocks (Clock c1, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888451 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888451 :: Either a b) = IsRightSym1 a6989586621679888451 | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888476 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888476 :: Either a b) = IsLeftSym1 a6989586621679888476 | |
| type Apply (Null_6989586621680814803Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680814809 :: Either a1 a2) | |
| type Apply (Elem_6989586621680814884Sym1 a6989586621680814889 :: TyFun (Proxy a) Bool -> Type) (a6989586621680814890 :: Proxy a) | |
| type Apply (Null_6989586621680814877Sym0 :: TyFun (Proxy a) Bool -> Type) (a6989586621680814881 :: Proxy a) | |
| type Apply (TFHelper_6989586621681239218Sym1 a6989586621681239223 :: TyFun (Arg a b) Bool -> Type) (a6989586621681239224 :: Arg a b) | |
| type Apply (TFHelper_6989586621680795192Sym1 a6989586621680795198 :: TyFun (Proxy s) Bool -> Type) (a6989586621680795199 :: Proxy s) | |
| type Apply (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680646763 :: a ~> (a ~> Bool)) | |
| type Apply (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680646823 :: a ~> Bool) | |
| type Apply (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680646834 :: a ~> Bool) | |
| type Apply (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680646845 :: a ~> Bool) | |
| type Apply (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680646856 :: a ~> Bool) | |
| type Apply (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680646867 :: a ~> Bool) | |
| type Apply (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) (a6989586621680385767 :: a ~> (a ~> Bool)) | |
| type Apply (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) (a6989586621680385777 :: a ~> (a ~> Bool)) | |
| type Apply (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) (a6989586621680385873 :: a ~> Bool) | |
| type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680385888 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680385888 :: a ~> Bool) = PartitionSym1 a6989586621680385888 | |
| type Apply (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680386000 :: a ~> Bool) | |
| type Apply (Let6989586621680386013YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680386004 :: k ~> Bool) | |
| type Apply (Let6989586621680386013ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680386004 :: k ~> Bool) | |
| type Apply (Let6989586621680386013X_6989586621680386014Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680386004 :: k ~> Bool) | |
| type Apply (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) (a6989586621680386035 :: a ~> Bool) | |
| type Apply (Let6989586621680386048YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680386039 :: k ~> Bool) | |
| type Apply (Let6989586621680386048ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680386039 :: k ~> Bool) | |
| type Apply (Let6989586621680386048X_6989586621680386049Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680386039 :: k ~> Bool) | |
| type Apply (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) (a6989586621680385910 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386089 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386089 :: a ~> Bool) = DropWhileSym1 a6989586621680386089 | |
| type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386104 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386104 :: a ~> Bool) = TakeWhileSym1 a6989586621680386104 | |
| type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386204 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386204 :: a ~> Bool) = FilterSym1 a6989586621680386204 | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680386197 :: a ~> Bool) | |
| type Apply (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) (a6989586621680386303 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680386293 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680385757 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) (a6989586621680386147 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680386170 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680386756 :: a ~> Bool) | |
| type Apply (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) (a6989586621680386118 :: a ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) (a6989586621680386764 :: a ~> Bool) | |
| type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386072 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) (a6989586621680386072 :: a ~> Bool) = DropWhileEndSym1 a6989586621680386072 | |
| type Apply (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) (a6989586621679820994 :: a ~> Bool) | |
| type Apply (TFHelper_6989586621681239218Sym0 :: TyFun (Arg a b) (Arg a b ~> Bool) -> Type) (a6989586621681239223 :: Arg a b) | |
| type Apply (TFHelper_6989586621680795192Sym0 :: TyFun (Proxy s) (Proxy s ~> Bool) -> Type) (a6989586621680795198 :: Proxy s) | |
| type Apply (Let6989586621680385781NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680385779 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680385915YsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680385912 :: k1 ~> (a ~> Bool)) | |
| type Apply (Let6989586621680385915ZsSym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] [a] -> Type) -> Type) -> Type) (eq6989586621680385912 :: k1 ~> (a ~> Bool)) | |
| type Apply (Let6989586621680385915X_6989586621680385916Sym0 :: TyFun (k1 ~> (a ~> Bool)) (TyFun k1 (TyFun [a] ([a], [a]) -> Type) -> Type) -> Type) (eq6989586621680385912 :: k1 ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680386076Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (TyFun [a] [a] -> Type) -> Type) -> Type) -> Type) (p6989586621680386074 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680813928Sym0 :: TyFun (a ~> Bool) (TyFun k (TyFun a (First a) -> Type) -> Type) -> Type) (p6989586621680813926 :: a ~> Bool) | |
| type Apply (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680814000 :: a ~> Bool) | |
| type Apply (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) (a6989586621680813991 :: a ~> Bool) | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680813924 :: a ~> Bool) | |
| type Apply (Let6989586621679821005GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679820999 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Base | |
| type Apply (Lambda_6989586621680386129Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680386121 :: b ~> (a ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680386129Sym0 :: TyFun (b ~> (a ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680386121 :: b ~> (a ~> Bool)) = Lambda_6989586621680386129Sym1 eq6989586621680386121 :: TyFun k1 (TyFun k2 (TyFun a (TyFun [a] (TyFun b (m b) -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym2 x6989586621680386078 xs6989586621680386079 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680386074 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386080Scrutinee_6989586621680382259Sym2 x6989586621680386078 xs6989586621680386079 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680386074 :: k1 ~> Bool) = Let6989586621680386080Scrutinee_6989586621680382259Sym3 x6989586621680386078 xs6989586621680386079 p6989586621680386074 :: TyFun k Bool -> Type | |
| type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym3 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680385779 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680385788Scrutinee_6989586621680382287Sym3 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680385779 :: k1 ~> (k1 ~> Bool)) = Let6989586621680385788Scrutinee_6989586621680382287Sym4 y6989586621680385785 ys6989586621680385786 xs6989586621680385787 eq6989586621680385779 :: TyFun k3 Bool -> Type | |
| type ClocksCxt (Clock c1, Clock c2, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks type ClocksCxt (Clock c1, Clock c2, Signal pllLock Bool) = (KnownDomain c1, KnownDomain c2, KnownDomain pllLock) | |
| type NumOutClocks (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, KnownDomain pllLock) | |
| type NumOutClocks (Clock c1, Clock c2, Clock c3, Signal pllLock Bool) Source # | |
Defined in Clash.Clocks | |
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
Arbitrary precision integers. In contrast with fixed-size integral types
such as Int, the Integer type represents the entire infinite range of
integers.
For more information about this type's representation, see the comments in its implementation.
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 |
| Applicative Maybe | Since: base-2.1 |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m Source # foldMap :: Monoid m => (a -> m) -> Maybe a -> m Source # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m Source # foldr :: (a -> b -> b) -> b -> Maybe a -> b Source # foldr' :: (a -> b -> b) -> b -> Maybe a -> b Source # foldl :: (b -> a -> b) -> b -> Maybe a -> b Source # foldl' :: (b -> a -> b) -> b -> Maybe a -> b Source # foldr1 :: (a -> a -> a) -> Maybe a -> a Source # foldl1 :: (a -> a -> a) -> Maybe a -> a Source # toList :: Maybe a -> [a] Source # null :: Maybe a -> Bool Source # length :: Maybe a -> Int Source # elem :: Eq a => a -> Maybe a -> Bool Source # maximum :: Ord a => Maybe a -> a Source # minimum :: Ord a => Maybe a -> a Source # | |
| 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 Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Maybe a) Source # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Maybe a] Source # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Maybe a) Source # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Maybe a] Source # | |
| 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 :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Maybe a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a (t1 :: Maybe (f a)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) Source # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Maybe a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) Source # sSequence :: forall (m :: Type -> Type) a (t1 :: Maybe (m a)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) Source # | |
| PFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Maybe m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Maybe a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a (t1 :: Maybe a). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a (t1 :: Maybe a). SOrd a => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a (t1 :: Maybe a). SNum a => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| PFunctor Maybe | |
| PApplicative Maybe | |
| PMonad Maybe | |
| SFunctor Maybe | |
| SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) Source # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Maybe a) (t3 :: Maybe b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) Source # (%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) Source # (%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) Source # | |
| SMonad Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Maybe a) (t2 :: a ~> Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) Source # (%>>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| FunctorWithIndex () Maybe | |
| FoldableWithIndex () Maybe | |
Defined in WithIndex Methods ifoldMap :: Monoid m => (() -> a -> m) -> Maybe a -> m Source # ifoldMap' :: Monoid m => (() -> a -> m) -> Maybe a -> m Source # ifoldr :: (() -> a -> b -> b) -> b -> Maybe a -> b Source # ifoldl :: (() -> b -> a -> b) -> b -> Maybe a -> b Source # ifoldr' :: (() -> a -> b -> b) -> b -> Maybe a -> b Source # ifoldl' :: (() -> b -> a -> b) -> b -> Maybe a -> b Source # | |
| TraversableWithIndex () Maybe | |
| Lift a => Lift (Maybe a :: Type) | |
| () :=> (Functor Maybe) | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint | |
| () :=> (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) Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) Source # toConstr :: Maybe a -> Constr Source # dataTypeOf :: Maybe a -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) Source # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) Source # | |
| 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) | Since: base-4.6.0.0 |
| 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 |
| Testable prop => Testable (Maybe prop) | |
| Arbitrary a => Arbitrary (Maybe a) | |
| CoArbitrary a => CoArbitrary (Maybe a) | |
Defined in Test.QuickCheck.Arbitrary | |
| Binary a => Binary (Maybe a) | |
| Default (Maybe a) | |
Defined in Data.Default.Internal | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Hashable a => Hashable (Maybe a) | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| At (Maybe a) | |
| AsEmpty (Maybe a) | |
| (Finite a, Uniform a) => Uniform (Maybe a) | |
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m (Maybe a) Source # | |
| Recursive (Maybe a) | |
Defined in Data.Functor.Foldable Methods project :: Maybe a -> Base (Maybe a) (Maybe a) Source # cata :: (Base (Maybe a) a0 -> a0) -> Maybe a -> a0 Source # para :: (Base (Maybe a) (Maybe a, a0) -> a0) -> Maybe a -> a0 Source # 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 Source # prepro :: Corecursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (Base (Maybe a) a0 -> a0) -> Maybe a -> a0 Source # 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 Source # | |
| Corecursive (Maybe a) | |
Defined in Data.Functor.Foldable Methods embed :: Base (Maybe a) (Maybe a) -> Maybe a Source # ana :: (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a Source # apo :: (a0 -> Base (Maybe a) (Either (Maybe a) a0)) -> a0 -> Maybe a Source # postpro :: Recursive (Maybe a) => (forall b. Base (Maybe a) b -> Base (Maybe a) b) -> (a0 -> Base (Maybe a) a0) -> a0 -> Maybe a Source # 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 Source # | |
| PMonoid (Maybe a) | |
| SSemigroup a => SMonoid (Maybe a) | |
| PShow (Maybe a) | |
| SShow a => SShow (Maybe a) | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Maybe a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source # | |
| PSemigroup (Maybe a) | |
| SSemigroup a => SSemigroup (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep (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 # | |
| Counter a => Counter (Maybe a) Source # |
Since: 1.8.2 |
| AutoReg a => AutoReg (Maybe a) Source # | |
Defined in Clash.Class.AutoReg.Internal | |
| Bundle (Maybe a) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| Generic1 Maybe | Since: base-4.6.0.0 |
| PAlternative Maybe | |
| PMonadPlus Maybe | |
| SDecide a => TestCoercion (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SDecide a => TestEquality (SMaybe :: Maybe a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (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)) | |
| SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| 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 a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967697Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863337Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680247356Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670259Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Pure_6989586621679967439Sym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679967706LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 Source # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 Source # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 Source # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 Source # | |
| SingI (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 Source # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 Source # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 Source # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
| SingI (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing GetOptionSym0 Source # | |
| SingI (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetFirstSym0 Source # | |
| SingI (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods sing :: Sing GetLastSym0 Source # | |
| 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 Source # | |
| SingI (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680505519 :: TyFun [a] (Maybe [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680386197 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680386170 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680386188 :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621680118333 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670259Sym1 a6989586621680670269 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967697Sym1 a6989586621679967702 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967621Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967610Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967476Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863337Sym1 a6989586621679863343 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680247356Sym1 a6989586621680247361 :: TyFun (Maybe a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967449Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814432MkJustSym0 :: TyFun k (TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814417MkJustSym0 :: TyFun k (TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798081NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798081MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797707NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797707MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967328Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814474Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldl_6989586621680814490Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FoldMap_6989586621680814458Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Fmap_6989586621679967316Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| 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) Source # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) Source # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) Source # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 Source # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 Source # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 Source # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 Source # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680385895 :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FoldMap_6989586621680814458Sym1 a6989586621680814467 :: TyFun (Maybe a) m -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967621Sym1 a6989586621679967630 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967476Sym1 a6989586621679967481 :: TyFun (Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967449Sym1 a6989586621679967454 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967328Sym1 a6989586621679967333 :: TyFun (Maybe b) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Fmap_6989586621679967316Sym1 a6989586621679967321 :: TyFun (Maybe a) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814432MkJustSym1 a_69895866216808144266989586621680814431 :: TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814417MkJustSym1 a_69895866216808144116989586621680814416 :: TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798081NSym1 x6989586621680798079 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680798081MSym1 x6989586621680798079 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797707NSym1 x6989586621680797705 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680797707MSym1 x6989586621680797705 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814474Sym1 a6989586621680814480 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldl_6989586621680814490Sym1 a6989586621680814496 :: TyFun b (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680813924 :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746215Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746136Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Traverse_6989586621681092026Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621680112624 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680118308RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814339MfSym0 :: 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 :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814318MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967610Sym1 a6989586621679967615 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LiftA2_6989586621679967462Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| (SEq a, SingI d) => SingI (LookupSym1 d :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d) Source # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d :: TyFun (t a) (Maybe a) -> Type) | |
| SingI d => SingI (Maybe_Sym1 d :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d) Source # | |
| SuppressUnusedWarnings (Traverse_6989586621681092026Sym1 a6989586621681092031 :: TyFun (Maybe a) (f (Maybe b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621680112624 a6989586621680112625 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814474Sym2 a6989586621680814480 a6989586621680814481 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldl_6989586621680814490Sym2 a6989586621680814496 a6989586621680814497 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LiftA2_6989586621679967462Sym1 a6989586621679967468 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814339MfSym1 f6989586621680814337 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814318MfSym1 f6989586621680814316 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746215Sym1 a6989586621680746213 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746136Sym1 a6989586621680746134 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| (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) Source # | |
| SuppressUnusedWarnings (Let6989586621680814339MfSym2 f6989586621680814337 xs6989586621680814338 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LiftA2_6989586621679967462Sym2 a6989586621679967468 a6989586621679967469 :: TyFun (Maybe b) (Maybe c) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814318MfSym2 f6989586621680814316 xs6989586621680814317 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746215Sym2 a6989586621680746213 k6989586621680746214 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Lambda_6989586621680746136Sym2 a6989586621680746134 k6989586621680746135 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814318MfSym3 f6989586621680814316 xs6989586621680814317 a6989586621680814319 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680814339MfSym3 f6989586621680814337 xs6989586621680814338 a6989586621680814340 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| 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 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 FoldMap (a2 :: a1 ~> k2) (a3 :: Maybe a1) | |
| type (a1 :: k1) <$ (a2 :: Maybe b) | |
| type Fmap (a2 :: a1 ~> b) (a3 :: Maybe a1) | |
| type (arg1 :: Maybe a) <* (arg2 :: Maybe b) | |
| type (a2 :: Maybe a1) *> (a3 :: Maybe b) | |
| type (a2 :: Maybe (a1 ~> b)) <*> (a3 :: Maybe a1) | |
| type (a2 :: Maybe a1) >> (a3 :: Maybe b) | |
| type (a2 :: Maybe a1) >>= (a3 :: a1 ~> Maybe b) | |
| type MapM (arg1 :: a ~> m b) (arg2 :: Maybe a) | |
| type Traverse (a2 :: a1 ~> f b) (a3 :: Maybe a1) | |
| type Foldl' (arg1 :: b ~> (a ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldl (a2 :: k2 ~> (a1 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type Foldr' (arg1 :: a ~> (b ~> b)) (arg2 :: b) (arg3 :: Maybe a) | |
| type Foldr (a2 :: a1 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Maybe a1) | |
| type LiftA2 (a2 :: a1 ~> (b ~> c)) (a3 :: Maybe a1) (a4 :: Maybe b) | |
| type Unbundled dom d (Maybe a) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| type Unbundled dom (Maybe a) Source # | |
Defined in Clash.Signal.Bundle | |
| type TryDomain t (Maybe a) Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| type Apply (Pure_6989586621679967439Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621679967445 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621679967706LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216799668046989586621679967705 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (a6989586621679748324 :: a) | |
| type Apply (Let6989586621680797707NSym1 x6989586621680797705 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680797706 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680797707MSym1 x6989586621680797705 :: TyFun k (Maybe k1) -> Type) (y6989586621680797706 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680798081NSym1 x6989586621680798079 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680798080 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680798081MSym1 x6989586621680798079 :: TyFun k (Maybe k1) -> Type) (y6989586621680798080 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680814417MkJustSym1 a_69895866216808144116989586621680814416 :: TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type) (a6989586621680814420 :: a6989586621680813535) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680814432MkJustSym1 a_69895866216808144266989586621680814431 :: TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type) (a6989586621680814435 :: a6989586621680813536) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680746136Sym2 a6989586621680746134 k6989586621680746135 :: TyFun k1 (Maybe a) -> Type) (x6989586621680746138 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680746215Sym2 a6989586621680746213 k6989586621680746214 :: TyFun k1 (Maybe a) -> Type) (x6989586621680746217 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680814339MfSym3 f6989586621680814337 xs6989586621680814338 a6989586621680814340 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680814341 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ShowsPrec_6989586621680670259Sym0 :: TyFun Nat (Maybe a ~> (Symbol ~> Symbol)) -> Type) (a6989586621680670269 :: Nat) | |
| type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621680118333 :: a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) (a6989586621680118333 :: a) = FromMaybeSym1 a6989586621680118333 | |
| type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680386188 :: a) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) (a6989586621680386188 :: a) = ElemIndexSym1 a6989586621680386188 | |
| type Apply (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) (a6989586621680112624 :: b) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680385895 :: a) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) (a6989586621680385895 :: a) = LookupSym1 a6989586621680385895 :: TyFun [(a, b)] (Maybe b) -> Type | |
| type Apply (Let6989586621680797707NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680797705 :: k) | |
| type Apply (Let6989586621680797707MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680797705 :: k1) | |
| type Apply (Let6989586621680798081NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680798079 :: k) | |
| type Apply (Let6989586621680798081MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680798079 :: k1) | |
| type Apply (Let6989586621680814417MkJustSym0 :: TyFun k (TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type) -> Type) (a_69895866216808144116989586621680814416 :: k) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814417MkJustSym0 :: TyFun k (TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type) -> Type) (a_69895866216808144116989586621680814416 :: k) = Let6989586621680814417MkJustSym1 a_69895866216808144116989586621680814416 :: TyFun a6989586621680813535 (Maybe a6989586621680813535) -> Type | |
| type Apply (Let6989586621680814432MkJustSym0 :: TyFun k (TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type) -> Type) (a_69895866216808144266989586621680814431 :: k) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814432MkJustSym0 :: TyFun k (TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type) -> Type) (a_69895866216808144266989586621680814431 :: k) = Let6989586621680814432MkJustSym1 a_69895866216808144266989586621680814431 :: TyFun a6989586621680813536 (Maybe a6989586621680813536) -> Type | |
| type Apply (TFHelper_6989586621679967328Sym0 :: TyFun a (Maybe b ~> Maybe a) -> Type) (a6989586621679967333 :: a) | |
| type Apply (Foldr_6989586621680814474Sym1 a6989586621680814480 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680814481 :: b) | |
| type Apply (Foldl_6989586621680814490Sym1 a6989586621680814496 :: TyFun b (Maybe a ~> b) -> Type) (a6989586621680814497 :: b) | |
| type Apply (Lambda_6989586621680746136Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680746134 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680746215Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680746213 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680814318MfSym1 f6989586621680814316 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680814317 :: k) | |
| type Apply (Let6989586621680814339MfSym1 f6989586621680814337 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680814338 :: k) | |
| type Apply (Let6989586621680814318MfSym2 f6989586621680814316 xs6989586621680814317 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680814319 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| 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) | |
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 | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type BitSize (Maybe a) Source # | |
Defined in Clash.Class.BitPack.Internal | |
| type Rep1 Maybe | |
| 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 Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| 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) <|> (a3 :: Maybe a1) | |
| type Mplus (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (a2 :: Maybe a1) <> ('Nothing :: Maybe a1) | |
Defined in Fcf.Class.Monoid | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680118343 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621680118343 :: Maybe a) = FromJustSym1 a6989586621680118343 | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118347 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118347 :: Maybe a) = IsNothingSym1 a6989586621680118347 | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118350 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621680118350 :: Maybe a) = IsJustSym1 a6989586621680118350 | |
| type Apply (FromMaybeSym1 a6989586621680118333 :: TyFun (Maybe a) a -> Type) (a6989586621680118334 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym1 a6989586621680118333 :: TyFun (Maybe a) a -> Type) (a6989586621680118334 :: Maybe a) = FromMaybeSym2 a6989586621680118333 a6989586621680118334 | |
| type Apply (Compare_6989586621679863337Sym1 a6989586621679863343 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679863344 :: Maybe a) | |
| type Apply (FoldMap_6989586621680814458Sym1 a6989586621680814467 :: TyFun (Maybe a) m -> Type) (a6989586621680814468 :: Maybe a) | |
| type Apply (Maybe_Sym2 a6989586621680112624 a6989586621680112625 :: TyFun (Maybe a) b -> Type) (a6989586621680112626 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym2 a6989586621680112624 a6989586621680112625 :: TyFun (Maybe a) b -> Type) (a6989586621680112626 :: Maybe a) = Maybe_Sym3 a6989586621680112624 a6989586621680112625 a6989586621680112626 | |
| type Apply (Foldr_6989586621680814474Sym2 a6989586621680814480 a6989586621680814481 :: TyFun (Maybe a) b -> Type) (a6989586621680814482 :: Maybe a) | |
| type Apply (Foldl_6989586621680814490Sym2 a6989586621680814496 a6989586621680814497 :: TyFun (Maybe a) b -> Type) (a6989586621680814498 :: Maybe a) | |
| type ('Nothing :: Maybe a) <> (b :: Maybe a) | |
Defined in Fcf.Class.Monoid | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680118318 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621680118318 :: [Maybe a]) = CatMaybesSym1 a6989586621680118318 | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680118324 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621680118324 :: [a]) = ListToMaybeSym1 a6989586621680118324 | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680118328 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621680118328 :: Maybe a) = MaybeToListSym1 a6989586621680118328 | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (a6989586621680795118 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (a6989586621680795121 :: Maybe a) | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680256559 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (a6989586621680256559 :: Maybe a) = OptionSym1 a6989586621680256559 | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (a6989586621680739910 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (a6989586621680739937 :: Maybe a) | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680256562 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680256562 :: Option a) = GetOptionSym1 a6989586621680256562 | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680739913 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680739913 :: First a) = GetFirstSym1 a6989586621680739913 | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680739940 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680739940 :: Last a) = GetLastSym1 a6989586621680739940 | |
| type Apply (GetMaxInternalSym0 :: TyFun (MaxInternal a) (Maybe a) -> Type) (a6989586621680795128 :: MaxInternal a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (GetMinInternalSym0 :: TyFun (MinInternal a) (Maybe a) -> Type) (a6989586621680795124 :: MinInternal a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (FindSym1 a6989586621680386197 :: TyFun [a] (Maybe a) -> Type) (a6989586621680386198 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym1 a6989586621680386170 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680386171 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FindIndexSym1 a6989586621680386170 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680386171 :: [a]) = FindIndexSym2 a6989586621680386170 a6989586621680386171 | |
| type Apply (ElemIndexSym1 a6989586621680386188 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680386189 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym1 a6989586621680386188 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680386189 :: [a]) = ElemIndexSym2 a6989586621680386188 a6989586621680386189 | |
| type Apply (StripPrefixSym1 a6989586621680505519 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680505520 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680505519 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680505520 :: [a]) = StripPrefixSym2 a6989586621680505519 a6989586621680505520 | |
| type Apply (TFHelper_6989586621679967697Sym1 a6989586621679967702 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621679967703 :: Maybe a) | |
| type Apply (TFHelper_6989586621680247356Sym1 a6989586621680247361 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680247362 :: Maybe a) | |
| type Apply (LookupSym1 a6989586621680385895 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680385896 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym1 a6989586621680385895 :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680385896 :: [(a, b)]) = LookupSym2 a6989586621680385895 a6989586621680385896 | |
| type Apply (Fmap_6989586621679967316Sym1 a6989586621679967321 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679967322 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967328Sym1 a6989586621679967333 :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621679967334 :: Maybe b) | |
| type Apply (TFHelper_6989586621679967449Sym1 a6989586621679967454 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621679967455 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967476Sym1 a6989586621679967481 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679967482 :: Maybe b) | |
| type Apply (TFHelper_6989586621679967621Sym1 a6989586621679967630 :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621679967631 :: Maybe b) | |
| type Apply (FindSym1 a6989586621680813924 :: TyFun (t a) (Maybe a) -> Type) (a6989586621680813925 :: t a) | |
| type Apply (Traverse_6989586621681092026Sym1 a6989586621681092031 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621681092032 :: Maybe a) | |
| type Apply (LiftA2_6989586621679967462Sym2 a6989586621679967468 a6989586621679967469 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621679967470 :: Maybe b) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680814318MfSym3 f6989586621680814316 xs6989586621680814317 a6989586621680814319 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680814320 :: Maybe k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Eval (Init '[a2] :: 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] :: Maybe a1 -> Type) | |
| type Eval (Last ('[] :: [a]) :: Maybe a -> Type) | |
| type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680505519 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a] ([a] ~> Maybe [a]) -> Type) (a6989586621680505519 :: [a]) = StripPrefixSym1 a6989586621680505519 | |
| type Apply (TFHelper_6989586621679967697Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621679967702 :: Maybe a) | |
| type Apply (Compare_6989586621679863337Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679863343 :: Maybe a) | |
| type Apply (TFHelper_6989586621680247356Sym0 :: TyFun (Maybe a) (Maybe a ~> Maybe a) -> Type) (a6989586621680247361 :: Maybe a) | |
| type ('Just a2 :: Maybe a1) <> ('Just b :: Maybe a1) | |
| type Apply (ShowsPrec_6989586621680670259Sym1 a6989586621680670269 :: TyFun (Maybe a) (Symbol ~> Symbol) -> Type) (a6989586621680670270 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967476Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679967481 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967610Sym0 :: TyFun (Maybe a) ((a ~> Maybe b) ~> Maybe b) -> Type) (a6989586621679967615 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967621Sym0 :: TyFun (Maybe a) (Maybe b ~> Maybe b) -> Type) (a6989586621679967630 :: Maybe a) | |
| type Apply (TFHelper_6989586621679967449Sym0 :: TyFun (Maybe (a ~> b)) (Maybe a ~> Maybe b) -> Type) (a6989586621679967454 :: Maybe (a ~> b)) | |
| type Apply (LiftA2_6989586621679967462Sym1 a6989586621679967468 :: TyFun (Maybe a) (Maybe b ~> Maybe c) -> Type) (a6989586621679967469 :: Maybe a) | |
| type Apply (Let6989586621680814339MfSym2 f6989586621680814337 xs6989586621680814338 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680814340 :: Maybe k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| 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 (TFHelper_6989586621679967610Sym1 a6989586621679967615 :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621679967616 :: a ~> Maybe b) | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) (a6989586621680386197 :: a ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) (a6989586621680386170 :: a ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621680118303 :: a ~> Maybe b) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) (a6989586621680118303 :: a ~> Maybe b) = MapMaybeSym1 a6989586621680118303 | |
| type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680386587 :: b ~> Maybe (a, b)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) (a6989586621680386587 :: b ~> Maybe (a, b)) = UnfoldrSym1 a6989586621680386587 | |
| type Apply (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) (a6989586621680813924 :: a ~> Bool) | |
| type Apply (FoldMap_6989586621680814458Sym0 :: TyFun (a ~> m) (Maybe a ~> m) -> Type) (a6989586621680814467 :: a ~> m) | |
| type Apply (Foldr_6989586621680814474Sym0 :: TyFun (a ~> (b ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680814480 :: a ~> (b ~> b)) | |
| type Apply (Foldl_6989586621680814490Sym0 :: TyFun (b ~> (a ~> b)) (b ~> (Maybe a ~> b)) -> Type) (a6989586621680814496 :: b ~> (a ~> b)) | |
| type Apply (Fmap_6989586621679967316Sym0 :: TyFun (a ~> b) (Maybe a ~> Maybe b) -> Type) (a6989586621679967321 :: a ~> b) | |
| type Apply (Traverse_6989586621681092026Sym0 :: TyFun (a ~> f b) (Maybe a ~> f (Maybe b)) -> Type) (a6989586621681092031 :: a ~> f b) | |
| type Apply (Maybe_Sym1 a6989586621680112624 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621680112625 :: a ~> b) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621680112624 :: TyFun (a ~> b) (Maybe a ~> b) -> Type) (a6989586621680112625 :: a ~> b) = Maybe_Sym2 a6989586621680112624 a6989586621680112625 | |
| type Apply (Let6989586621680118308RsSym0 :: TyFun (a ~> Maybe k1) (TyFun k (TyFun [a] [k1] -> Type) -> Type) -> Type) (f6989586621680118305 :: a ~> Maybe k1) | |
| type Apply (Let6989586621680814318MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680814316 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814318MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680814316 :: k2 ~> (k3 ~> k2)) = Let6989586621680814318MfSym1 f6989586621680814316 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680814339MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680814337 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680814339MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680814337 :: k2 ~> (k3 ~> k3)) = Let6989586621680814339MfSym1 f6989586621680814337 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
| type Apply (LiftA2_6989586621679967462Sym0 :: TyFun (a ~> (b ~> c)) (Maybe a ~> (Maybe b ~> Maybe c)) -> Type) (a6989586621679967468 :: a ~> (b ~> c)) | |
| type Apply (Lambda_6989586621680746136Sym1 a6989586621680746134 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680746135 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680746215Sym1 a6989586621680746213 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680746214 :: k1 ~> Last a) | |
Instances
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
Defined in GHC.Enum Methods succ :: Ordering -> Ordering Source # pred :: Ordering -> Ordering Source # toEnum :: Int -> Ordering Source # fromEnum :: Ordering -> Int Source # enumFrom :: Ordering -> [Ordering] Source # enumFromThen :: Ordering -> Ordering -> [Ordering] Source # enumFromTo :: Ordering -> Ordering -> [Ordering] Source # enumFromThenTo :: Ordering -> Ordering -> Ordering -> [Ordering] Source # | |
| 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 Source # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ordering Source # toConstr :: Ordering -> Constr Source # dataTypeOf :: Ordering -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Ordering) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ordering) Source # gmapT :: (forall b. Data b => b -> b) -> Ordering -> Ordering Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Ordering -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordering -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering Source # | |
| 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.Ix | |
| Generic Ordering | Since: base-4.6.0.0 |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Monoid Ordering | Since: base-2.1 |
| Arbitrary Ordering | |
| CoArbitrary Ordering | |
Defined in Test.QuickCheck.Arbitrary | |
| Binary Ordering | |
| Default Ordering | |
Defined in Data.Default.Internal | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Hashable Ordering | |
| AsEmpty Ordering | |
| PMonoid Ordering | |
| SMonoid Ordering | |
| PShow Ordering | |
| SShow Ordering | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Ordering) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source # sShow_ :: forall (t :: Ordering). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t1 :: [Ordering]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source # | |
| PSemigroup Ordering | |
| SSemigroup Ordering | |
| PEnum Ordering | |
| SEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: forall (t :: Ordering). Sing t -> Sing (Apply SuccSym0 t) Source # sPred :: forall (t :: Ordering). Sing t -> Sing (Apply PredSym0 t) Source # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) Source # sFromEnum :: forall (t :: Ordering). Sing t -> Sing (Apply FromEnumSym0 t) Source # sEnumFromTo :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) Source # sEnumFromThenTo :: forall (t1 :: Ordering) (t2 :: Ordering) (t3 :: Ordering). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) Source # | |
| PBounded Ordering | |
| SBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Ordering | |
| SOrd Ordering | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source # (%<) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source # (%<=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source # (%>) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source # (%>=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source # sMax :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source # sMin :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source # | |
| SEq Ordering | |
| PEq Ordering | |
| NFDataX Ordering Source # | |
Defined in Clash.XException | |
| ShowX Ordering Source # | |
| BitPack Ordering Source # | |
| TestCoercion SOrdering | |
Defined in Data.Singletons.Prelude.Instances | |
| TestEquality SOrdering | |
Defined in Data.Singletons.Prelude.Instances | |
| () :=> (Bounded Ordering) | |
| () :=> (Enum Ordering) | |
| () :=> (Read Ordering) | |
| () :=> (Show Ordering) | |
| () :=> (Semigroup Ordering) | |
| () :=> (Monoid Ordering) | |
| SuppressUnusedWarnings Compare_6989586621679864260Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings FromEnum_6989586621680147060Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings TFHelper_6989586621680247346Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621679864269Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ToEnum_6989586621680147044Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680670531Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621679864278Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621679863734Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621680267408Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings Compare_6989586621680267425Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864260Sym1 a6989586621679864265 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863434Sym0 :: TyFun [a] ([a] ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863337Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ThenCmpSym1 a6989586621679862749 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680247346Sym1 a6989586621680247351 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864269Sym1 a6989586621679864274 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670531Sym1 a6989586621680670547 :: TyFun Ordering (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864278Sym1 a6989586621679864283 :: TyFun () Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846643Scrutinee_6989586621679846353Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846623Scrutinee_6989586621679846345Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846602Scrutinee_6989586621679846334Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846582Scrutinee_6989586621679846324Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679846549Sym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863734Sym1 a6989586621679863740 :: TyFun Void Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267485Sym0 :: TyFun (Min a) (Min a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267505Sym0 :: TyFun (Max a) (Max a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267525Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267545Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267565Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267371Sym0 :: TyFun (Option a) (Option a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864247Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680741861Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680741881Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267391Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267408Sym1 a6989586621680267413 :: TyFun All Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267425Sym1 a6989586621680267430 :: TyFun Any Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267445Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267465Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679861360Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863656Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) Source # | |
| SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 Source # | |
| 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 Source # | |
| 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 Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863434Sym1 a6989586621679863439 :: TyFun [a] Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863337Sym1 a6989586621679863343 :: TyFun (Maybe a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863557Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863784Sym0 :: TyFun (a, b) ((a, b) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846643Scrutinee_6989586621679846353Sym1 x6989586621679846640 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846623Scrutinee_6989586621679846345Sym1 x6989586621679846620 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846602Scrutinee_6989586621679846334Sym1 x6989586621679846599 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621679846582Scrutinee_6989586621679846324Sym1 x6989586621679846580 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679846549Sym1 a6989586621679846554 :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (CompareSym1 a6989586621679846512 :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267485Sym1 a6989586621680267490 :: TyFun (Min a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267505Sym1 a6989586621680267510 :: TyFun (Max a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621681239705Sym0 :: TyFun (Arg a b) (Arg a b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267525Sym1 a6989586621680267530 :: TyFun (First a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267545Sym1 a6989586621680267550 :: TyFun (Last a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267565Sym1 a6989586621680267570 :: TyFun (WrappedMonoid m) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267371Sym1 a6989586621680267376 :: TyFun (Option a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864247Sym1 a6989586621679864252 :: TyFun (Identity a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680741861Sym1 a6989586621680741866 :: TyFun (First a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680741881Sym1 a6989586621680741886 :: TyFun (Last a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267391Sym1 a6989586621680267396 :: TyFun (Dual a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267445Sym1 a6989586621680267450 :: TyFun (Sum a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680267465Sym1 a6989586621680267470 :: TyFun (Product a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679861360Sym1 a6989586621679861367 :: TyFun (Down a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680795522Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863656Sym1 a6989586621679863663 :: TyFun (NonEmpty a) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680813975Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680813955Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| (SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) Source # | |
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinimumBySym0 Source # | |
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaximumBySym0 Source # | |
| SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ComparingSym0 Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863557Sym1 a6989586621679863562 :: TyFun (Either a b) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863784Sym1 a6989586621679863790 :: TyFun (a, b) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863886Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ComparingSym1 a6989586621679846503 :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621681239705Sym1 a6989586621681239711 :: TyFun (Arg a b) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621681012306Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621680795522Sym1 a6989586621680795529 :: TyFun (Proxy s) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Proxy Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386246MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680386225MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () Source # | |
| (SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym1 d) Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863886Sym1 a6989586621679863891 :: TyFun (a, b, c) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863990Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ComparingSym2 a6989586621679846503 a6989586621679846504 :: TyFun b Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621681012306Sym1 a6989586621681012315 :: TyFun (Const a b) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () Source # | |
| (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) Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863990Sym1 a6989586621679863995 :: TyFun (a, b, c, d) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864050Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864050Sym1 a6989586621679864055 :: TyFun (a, b, c, d, e) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864121Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864121Sym1 a6989586621679864126 :: TyFun (a, b, c, d, e, f) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864203Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679864203Sym1 a6989586621679864208 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| type Rep Ordering | |
| type MEmpty | |
Defined in Fcf.Class.Monoid | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid type Mempty = Mempty_6989586621680736512Sym0 | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680113721Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680113718Sym0 | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Demote Ordering | |
Defined in Data.Singletons.Prelude.Instances | |
| type BitSize Ordering Source # | |
Defined in Clash.Class.BitPack.Internal | |
| 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 FromEnum_6989586621680147060Sym0 (a6989586621680147064 :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply ToEnum_6989586621680147044Sym0 (a6989586621680147048 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply (Compare_6989586621679864260Sym1 a6989586621679864265 :: TyFun Bool Ordering -> Type) (a6989586621679864266 :: Bool) | |
| type Apply (ThenCmpSym1 a6989586621679862749 :: TyFun Ordering Ordering -> Type) (a6989586621679862750 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ThenCmpSym1 a6989586621679862749 :: TyFun Ordering Ordering -> Type) (a6989586621679862750 :: Ordering) = ThenCmpSym2 a6989586621679862749 a6989586621679862750 | |
| type Apply (TFHelper_6989586621680247346Sym1 a6989586621680247351 :: TyFun Ordering Ordering -> Type) (a6989586621680247352 :: Ordering) | |
| type Apply (Compare_6989586621679864269Sym1 a6989586621679864274 :: TyFun Ordering Ordering -> Type) (a6989586621679864275 :: Ordering) | |
| type Apply (Compare_6989586621679864278Sym1 a6989586621679864283 :: TyFun () Ordering -> Type) (a6989586621679864284 :: ()) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679863734Sym1 a6989586621679863740 :: TyFun Void Ordering -> Type) (a6989586621679863741 :: Void) | |
| type Apply (Compare_6989586621680267408Sym1 a6989586621680267413 :: TyFun All Ordering -> Type) (a6989586621680267414 :: All) | |
| type Apply (Compare_6989586621680267425Sym1 a6989586621680267430 :: TyFun Any Ordering -> Type) (a6989586621680267431 :: Any) | |
| type Apply (Compare_6989586621679846549Sym1 a6989586621679846554 :: TyFun a Ordering -> Type) (a6989586621679846555 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (CompareSym1 a6989586621679846512 :: TyFun a Ordering -> Type) (a6989586621679846513 :: a) | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym1 a6989586621679846512 :: TyFun a Ordering -> Type) (a6989586621679846513 :: a) = CompareSym2 a6989586621679846512 a6989586621679846513 | |
| type Apply (Let6989586621679846643Scrutinee_6989586621679846353Sym1 x6989586621679846640 :: TyFun k1 Ordering -> Type) (y6989586621679846641 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679846623Scrutinee_6989586621679846345Sym1 x6989586621679846620 :: TyFun k1 Ordering -> Type) (y6989586621679846622 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679846602Scrutinee_6989586621679846334Sym1 x6989586621679846599 :: TyFun k1 Ordering -> Type) (y6989586621679846601 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679846582Scrutinee_6989586621679846324Sym1 x6989586621679846580 :: TyFun k1 Ordering -> Type) (y6989586621679846581 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (ComparingSym2 a6989586621679846503 a6989586621679846504 :: TyFun b Ordering -> Type) (a6989586621679846505 :: b) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym2 a6989586621679846503 a6989586621679846504 :: TyFun b Ordering -> Type) (a6989586621679846505 :: b) = ComparingSym3 a6989586621679846503 a6989586621679846504 a6989586621679846505 | |
| type Apply Compare_6989586621679864260Sym0 (a6989586621679864265 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ThenCmpSym0 (a6989586621679862749 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply TFHelper_6989586621680247346Sym0 (a6989586621680247351 :: Ordering) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621679864269Sym0 (a6989586621679864274 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680670531Sym0 (a6989586621680670547 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply Compare_6989586621679864278Sym0 (a6989586621679864283 :: ()) | |
Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679864278Sym0 (a6989586621679864283 :: ()) = Compare_6989586621679864278Sym1 a6989586621679864283 | |
| type Apply Compare_6989586621679863734Sym0 (a6989586621679863740 :: Void) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621680267408Sym0 (a6989586621680267413 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621680267425Sym0 (a6989586621680267430 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621680670531Sym1 a6989586621680670547 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680670548 :: Ordering) | |
| type Apply (Compare_6989586621679846549Sym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679846554 :: a) | |
| type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679846512 :: a) | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) (a6989586621679846512 :: a) = CompareSym1 a6989586621679846512 | |
| type Apply (Let6989586621679846643Scrutinee_6989586621679846353Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679846640 :: k1) | |
| type Apply (Let6989586621679846623Scrutinee_6989586621679846345Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679846620 :: k1) | |
| type Apply (Let6989586621679846602Scrutinee_6989586621679846334Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679846599 :: k1) | |
| type Apply (Let6989586621679846582Scrutinee_6989586621679846324Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679846580 :: k1) | |
| type Apply (ComparingSym1 a6989586621679846503 :: TyFun b (b ~> Ordering) -> Type) (a6989586621679846504 :: b) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym1 a6989586621679846503 :: TyFun b (b ~> Ordering) -> Type) (a6989586621679846504 :: b) = ComparingSym2 a6989586621679846503 a6989586621679846504 | |
| type Apply (Compare_6989586621679863434Sym1 a6989586621679863439 :: TyFun [a] Ordering -> Type) (a6989586621679863440 :: [a]) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679863337Sym1 a6989586621679863343 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679863344 :: Maybe a) | |
| type Apply (Compare_6989586621680267485Sym1 a6989586621680267490 :: TyFun (Min a) Ordering -> Type) (a6989586621680267491 :: Min a) | |
| type Apply (Compare_6989586621680267505Sym1 a6989586621680267510 :: TyFun (Max a) Ordering -> Type) (a6989586621680267511 :: Max a) | |
| type Apply (Compare_6989586621680267525Sym1 a6989586621680267530 :: TyFun (First a) Ordering -> Type) (a6989586621680267531 :: First a) | |
| type Apply (Compare_6989586621680267545Sym1 a6989586621680267550 :: TyFun (Last a) Ordering -> Type) (a6989586621680267551 :: Last a) | |
| type Apply (Compare_6989586621680267565Sym1 a6989586621680267570 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680267571 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680267565Sym1 a6989586621680267570 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680267571 :: WrappedMonoid m) = Compare_6989586621680267565Sym2 a6989586621680267570 a6989586621680267571 | |
| type Apply (Compare_6989586621680267371Sym1 a6989586621680267376 :: TyFun (Option a) Ordering -> Type) (a6989586621680267377 :: Option a) | |
| type Apply (Compare_6989586621679864247Sym1 a6989586621679864252 :: TyFun (Identity a) Ordering -> Type) (a6989586621679864253 :: Identity a) | |
| type Apply (Compare_6989586621680741861Sym1 a6989586621680741866 :: TyFun (First a) Ordering -> Type) (a6989586621680741867 :: First a) | |
| type Apply (Compare_6989586621680741881Sym1 a6989586621680741886 :: TyFun (Last a) Ordering -> Type) (a6989586621680741887 :: Last a) | |
| type Apply (Compare_6989586621680267391Sym1 a6989586621680267396 :: TyFun (Dual a) Ordering -> Type) (a6989586621680267397 :: Dual a) | |
| type Apply (Compare_6989586621680267445Sym1 a6989586621680267450 :: TyFun (Sum a) Ordering -> Type) (a6989586621680267451 :: Sum a) | |
| type Apply (Compare_6989586621680267465Sym1 a6989586621680267470 :: TyFun (Product a) Ordering -> Type) (a6989586621680267471 :: Product a) | |
| type Apply (Compare_6989586621679861360Sym1 a6989586621679861367 :: TyFun (Down a) Ordering -> Type) (a6989586621679861368 :: Down a) | |
| type Apply (Compare_6989586621679863656Sym1 a6989586621679863663 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679863664 :: NonEmpty a) | |
| type Apply (Compare_6989586621679863434Sym0 :: TyFun [a] ([a] ~> Ordering) -> Type) (a6989586621679863439 :: [a]) | |
| type Apply (Compare_6989586621679863337Sym0 :: TyFun (Maybe a) (Maybe a ~> Ordering) -> Type) (a6989586621679863343 :: Maybe a) | |
| type Apply (Compare_6989586621680267485Sym0 :: TyFun (Min a) (Min a ~> Ordering) -> Type) (a6989586621680267490 :: Min a) | |
| type Apply (Compare_6989586621680267505Sym0 :: TyFun (Max a) (Max a ~> Ordering) -> Type) (a6989586621680267510 :: Max a) | |
| type Apply (Compare_6989586621680267525Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) (a6989586621680267530 :: First a) | |
| type Apply (Compare_6989586621680267545Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) (a6989586621680267550 :: Last a) | |
| type Apply (Compare_6989586621680267565Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621680267570 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680267565Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) (a6989586621680267570 :: WrappedMonoid m) = Compare_6989586621680267565Sym1 a6989586621680267570 | |
| type Apply (Compare_6989586621680267371Sym0 :: TyFun (Option a) (Option a ~> Ordering) -> Type) (a6989586621680267376 :: Option a) | |
| type Apply (Compare_6989586621679864247Sym0 :: TyFun (Identity a) (Identity a ~> Ordering) -> Type) (a6989586621679864252 :: Identity a) | |
| type Apply (Compare_6989586621680741861Sym0 :: TyFun (First a) (First a ~> Ordering) -> Type) (a6989586621680741866 :: First a) | |
| type Apply (Compare_6989586621680741881Sym0 :: TyFun (Last a) (Last a ~> Ordering) -> Type) (a6989586621680741886 :: Last a) | |
| type Apply (Compare_6989586621680267391Sym0 :: TyFun (Dual a) (Dual a ~> Ordering) -> Type) (a6989586621680267396 :: Dual a) | |
| type Apply (Compare_6989586621680267445Sym0 :: TyFun (Sum a) (Sum a ~> Ordering) -> Type) (a6989586621680267450 :: Sum a) | |
| type Apply (Compare_6989586621680267465Sym0 :: TyFun (Product a) (Product a ~> Ordering) -> Type) (a6989586621680267470 :: Product a) | |
| type Apply (Compare_6989586621679861360Sym0 :: TyFun (Down a) (Down a ~> Ordering) -> Type) (a6989586621679861367 :: Down a) | |
| type Apply (Compare_6989586621679863656Sym0 :: TyFun (NonEmpty a) (NonEmpty a ~> Ordering) -> Type) (a6989586621679863663 :: NonEmpty a) | |
| type Apply (Compare_6989586621679863557Sym1 a6989586621679863562 :: TyFun (Either a b) Ordering -> Type) (a6989586621679863563 :: Either a b) | |
| type Apply (Compare_6989586621679863784Sym1 a6989586621679863790 :: TyFun (a, b) Ordering -> Type) (a6989586621679863792 :: (a, b)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681239705Sym1 a6989586621681239711 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681239712 :: Arg a b) | |
| type Apply (Compare_6989586621680795522Sym1 a6989586621680795529 :: TyFun (Proxy s) Ordering -> Type) (a6989586621680795530 :: Proxy s) | |
| type Apply (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) (a6989586621680646812 :: a ~> (a ~> Ordering)) | |
| type Apply (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) (a6989586621680386261 :: a ~> (a ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) (a6989586621680386281 :: a ~> (a ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) (a6989586621680386239 :: a ~> (a ~> Ordering)) | |
| type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) (a6989586621680386218 :: a ~> (a ~> Ordering)) | |
| type Apply (Compare_6989586621679863557Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679863562 :: Either a b) | |
| type Apply (Compare_6989586621679863784Sym0 :: TyFun (a, b) ((a, b) ~> Ordering) -> Type) (a6989586621679863790 :: (a, b)) | |
| type Apply (Compare_6989586621681239705Sym0 :: TyFun (Arg a b) (Arg a b ~> Ordering) -> Type) (a6989586621681239711 :: Arg a b) | |
| type Apply (Compare_6989586621680795522Sym0 :: TyFun (Proxy s) (Proxy s ~> Ordering) -> Type) (a6989586621680795529 :: Proxy s) | |
| type Apply (Let6989586621680813955Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680813953 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680813955Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680813953 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680813955Min'Sym1 cmp6989586621680813953 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680813975Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680813973 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680813975Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680813973 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680813975Max'Sym1 cmp6989586621680813973 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680813971 :: a ~> (a ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) (a6989586621680813951 :: a ~> (a ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) (a6989586621679846503 :: b ~> a) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) (a6989586621679846503 :: b ~> a) = ComparingSym1 a6989586621679846503 | |
| type Apply (Let6989586621680386225MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680386220 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386225MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680386220 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680386225MinBySym1 cmp6989586621680386220 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680386246MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680386241 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680386246MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680386241 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680386246MaxBySym1 cmp6989586621680386241 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Compare_6989586621679863886Sym1 a6989586621679863891 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679863892 :: (a, b, c)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681012306Sym1 a6989586621681012315 :: TyFun (Const a b) Ordering -> Type) (a6989586621681012316 :: Const a b) | |
| type Apply (Compare_6989586621679863886Sym0 :: TyFun (a, b, c) ((a, b, c) ~> Ordering) -> Type) (a6989586621679863891 :: (a, b, c)) | |
| type Apply (Compare_6989586621681012306Sym0 :: TyFun (Const a b) (Const a b ~> Ordering) -> Type) (a6989586621681012315 :: Const a b) | |
| type Apply (Compare_6989586621679863990Sym1 a6989586621679863995 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679863996 :: (a, b, c, d)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679863990Sym0 :: TyFun (a, b, c, d) ((a, b, c, d) ~> Ordering) -> Type) (a6989586621679863995 :: (a, b, c, d)) | |
| type Apply (Compare_6989586621679864050Sym1 a6989586621679864055 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679864056 :: (a, b, c, d, e)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679864050Sym0 :: TyFun (a, b, c, d, e) ((a, b, c, d, e) ~> Ordering) -> Type) (a6989586621679864055 :: (a, b, c, d, e)) | |
| type Apply (Compare_6989586621679864121Sym1 a6989586621679864126 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679864127 :: (a, b, c, d, e, f)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679864121Sym0 :: TyFun (a, b, c, d, e, f) ((a, b, c, d, e, f) ~> Ordering) -> Type) (a6989586621679864126 :: (a, b, c, d, e, f)) | |
| type Apply (Compare_6989586621679864203Sym1 a6989586621679864208 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679864209 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679864203Sym0 :: TyFun (a, b, c, d, e, f, g) ((a, b, c, d, e, f, g) ~> Ordering) -> Type) (a6989586621679864208 :: (a, b, c, d, e, f, g)) | |
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 | |
| Bifunctor Either | Since: base-4.8.0.0 |
| 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) Source # | |
| Bifoldable Either | Since: base-4.10.0.0 |
Defined in Data.Bifoldable | |
| 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) Source # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [Either a b] Source # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (Either a b) Source # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [Either a b] Source # | |
| Show2 Either | Since: base-4.9.0.0 |
Defined in Data.Functor.Classes | |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
| Bitraversable1 Either | |
Defined in Data.Semigroup.Traversable.Class | |
| () :=> (Monad (Either a)) | |
| () :=> (Functor (Either a)) | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint | |
| (Lift a, Lift b) => Lift (Either a b :: Type) | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Functor (Either a) | Since: base-3.0 |
| Applicative (Either e) | Since: base-3.0 |
Defined in Data.Either | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 Source # toList :: Either a a0 -> [a0] Source # null :: Either a a0 -> Bool Source # length :: Either a a0 -> Int Source # elem :: Eq a0 => a0 -> Either a a0 -> Bool Source # maximum :: Ord a0 => Either a a0 -> a0 Source # minimum :: Ord a0 => Either a a0 -> a0 Source # | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable Methods traverse :: Applicative f => (a0 -> f b) -> Either a a0 -> f (Either a b) Source # sequenceA :: Applicative f => Either a (f a0) -> f (Either a a0) Source # mapM :: Monad m => (a0 -> m b) -> Either a a0 -> m (Either a b) Source # sequence :: Monad m => Either a (m a0) -> m (Either a a0) Source # | |
| Arbitrary a => Arbitrary1 (Either a) | |
Defined in Test.QuickCheck.Arbitrary | |
| 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) Source # liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [Either a a0] Source # liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (Either a a0) Source # liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [Either a a0] Source # | |
| 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 :: forall a0 (f :: Type -> Type) b (t1 :: a0 ~> f b) (t2 :: Either a a0). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) Source # sSequenceA :: forall (f :: Type -> Type) a0 (t1 :: Either a (f a0)). SApplicative f => Sing t1 -> Sing (Apply SequenceASym0 t1) Source # sMapM :: forall a0 (m :: Type -> Type) b (t1 :: a0 ~> m b) (t2 :: Either a a0). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) Source # sSequence :: forall (m :: Type -> Type) a0 (t1 :: Either a (m a0)). SMonad m => Sing t1 -> Sing (Apply SequenceSym0 t1) Source # | |
| PFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Associated Types type FoldMap arg arg1 :: m Source # type Foldr arg arg1 arg2 :: b Source # type Foldr' arg arg1 arg2 :: b Source # type Foldl arg arg1 arg2 :: b Source # type Foldl' arg arg1 arg2 :: b Source # type Foldr1 arg arg1 :: a Source # type Foldl1 arg arg1 :: a Source # type ToList arg :: [a] Source # type Null arg :: Bool Source # type Length arg :: Nat Source # type Elem arg arg1 :: Bool Source # type Maximum arg :: a Source # | |
| SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t1 :: Either a m). SMonoid m => Sing t1 -> Sing (Apply FoldSym0 t1) Source # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) Source # sFoldr :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) Source # sFoldr' :: forall a0 b (t1 :: a0 ~> (b ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) Source # sFoldl :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) Source # sFoldl' :: forall b a0 (t1 :: b ~> (a0 ~> b)) (t2 :: b) (t3 :: Either a a0). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) Source # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) Source # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) Source # sToList :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply ToListSym0 t1) Source # sNull :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply NullSym0 t1) Source # sLength :: forall a0 (t1 :: Either a a0). Sing t1 -> Sing (Apply LengthSym0 t1) Source # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) Source # sMaximum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MaximumSym0 t1) Source # sMinimum :: forall a0 (t1 :: Either a a0). SOrd a0 => Sing t1 -> Sing (Apply MinimumSym0 t1) Source # sSum :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply SumSym0 t1) Source # sProduct :: forall a0 (t1 :: Either a a0). SNum a0 => Sing t1 -> Sing (Apply ProductSym0 t1) Source # | |
| PFunctor (Either a) | |
| PApplicative (Either e) | |
| PMonad (Either e) | |
| SFunctor (Either a) | |
| SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) Source # (%<*>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) Source # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: Either e a) (t3 :: Either e b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) Source # (%*>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) Source # (%<*) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) Source # | |
| SMonad (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: Either e a) (t2 :: a ~> Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) Source # (%>>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) Source # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) Source # | |
| Generic1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
| (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) Source # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) Source # toConstr :: Either a b -> Constr Source # dataTypeOf :: Either a b -> DataType Source # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) Source # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) Source # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b Source # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r Source # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r Source # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] Source # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u Source # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) Source # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) Source # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) Source # | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
Defined in Data.Either Methods compare :: Either a b -> Either a b -> Ordering Source # (<) :: Either a b -> Either a b -> Bool Source # (<=) :: Either a b -> Either a b -> Bool Source # (>) :: Either a b -> Either a b -> Bool Source # (>=) :: Either a b -> Either a b -> Bool Source # | |
| (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) | Since: base-4.6.0.0 |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| (Arbitrary a, Arbitrary b) => Arbitrary (Either a b) | |
| (CoArbitrary a, CoArbitrary b) => CoArbitrary (Either a b) | |
Defined in Test.QuickCheck.Arbitrary | |
| (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) | |
| (Finite a, Uniform a, Finite b, Uniform b) => Uniform (Either a b) | |
Defined in System.Random.Internal Methods uniformM :: StatefulGen g m => g -> m (Either a b) Source # | |
| Recursive (Either a b) | |
Defined in Data.Functor.Foldable Methods project :: Either a b -> Base (Either a b) (Either a b) Source # cata :: (Base (Either a b) a0 -> a0) -> Either a b -> a0 Source # para :: (Base (Either a b) (Either a b, a0) -> a0) -> Either a b -> a0 Source # 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 Source # 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 Source # 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 Source # | |
| Corecursive (Either a b) | |
Defined in Data.Functor.Foldable Methods embed :: Base (Either a b) (Either a b) -> Either a b Source # ana :: (a0 -> Base (Either a b) a0) -> a0 -> Either a b Source # apo :: (a0 -> Base (Either a b) (Either (Either a b) a0)) -> a0 -> Either a b Source # 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 Source # 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 Source # | |
| PShow (Either a b) | |
| (SShow a, SShow b) => SShow (Either a b) | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Either a b) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) Source # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) Source # sShowList :: forall (t1 :: [Either a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) Source # | |
| PSemigroup (Either a b) | |
| SSemigroup (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) Source # (%<) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) Source # (%<=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) Source # (%>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) Source # (%>=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) Source # sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) Source # sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) Source # | |
| (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 # | |
Defined in Clash.Signal.Bundle | |
| (Counter a, Counter b) => Counter (Either a b) Source # | Counter instance that flip-flops between
|
| Bundle (Either a b) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| (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)) | |
| (SDecide a, SDecide b) => TestCoercion (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (SDecide a, SDecide b) => TestEquality (SEither :: Either a b -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Null_6989586621680814803Sym0 :: TyFun (Either a1 a2) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Length_6989586621680814797Sym0 :: TyFun (Either a1 a2) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863557Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680247369Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670313Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Pure_6989586621679967588Sym0 :: TyFun a (Either e a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Let6989586621680247378ASym0 :: TyFun k1 (Either a k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 Source # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 Source # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 Source # | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
| (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 WithIndex Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m Source # ifoldMap' :: Monoid m => (Either i j -> a -> m) -> Sum f g a -> m Source # ifoldr :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b Source # ifoldl :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b Source # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Sum f g a -> b Source # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Sum f g a -> b Source # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (Product f g) | |
Defined in WithIndex Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m Source # ifoldMap' :: Monoid m => (Either i j -> a -> m) -> Product f g a -> m Source # ifoldr :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b Source # ifoldl :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b Source # ifoldr' :: (Either i j -> a -> b -> b) -> b -> Product f g a -> b Source # ifoldl' :: (Either i j -> b -> a -> b) -> b -> Product f g a -> b Source # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :+: g) | |
Defined in WithIndex Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m Source # ifoldMap' :: Monoid m => (Either i j -> a -> m) -> (f :+: g) a -> m Source # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b Source # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b Source # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :+: g) a -> b Source # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :+: g) a -> b Source # | |
| (FoldableWithIndex i f, FoldableWithIndex j g) => FoldableWithIndex (Either i j) (f :*: g) | |
Defined in WithIndex Methods ifoldMap :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m Source # ifoldMap' :: Monoid m => (Either i j -> a -> m) -> (f :*: g) a -> m Source # ifoldr :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b Source # ifoldl :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b Source # ifoldr' :: (Either i j -> a -> b -> b) -> b -> (f :*: g) a -> b Source # ifoldl' :: (Either i j -> b -> a -> b) -> b -> (f :*: g) a -> b Source # | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Sum f g) | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (Product f g) | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :+: g) | |
| (TraversableWithIndex i f, TraversableWithIndex j g) => TraversableWithIndex (Either i j) (f :*: g) | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680670313Sym1 a6989586621680670323 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967682Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967598Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Compare_6989586621679863557Sym1 a6989586621679863562 :: TyFun (Either a b) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621680247369Sym1 a6989586621680247374 :: TyFun (Either a b) (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967419Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814783Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (FoldMap_6989586621680814768Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Fmap_6989586621679967402Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 Source # | |
| SuppressUnusedWarnings (FoldMap_6989586621680814768Sym1 a6989586621680814773 :: TyFun (Either a2 a1) m -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967598Sym1 a6989586621679967603 :: TyFun (Either e a) (Either e b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967419Sym1 a6989586621679967424 :: TyFun (Either a2 b) (Either a2 a1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Fmap_6989586621679967402Sym1 a6989586621679967407 :: TyFun (Either a2 a1) (Either a2 b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814783Sym1 a6989586621680814789 :: TyFun b (Either a2 a1 ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Traverse_6989586621681092063Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621679881417 :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (TFHelper_6989586621679967682Sym1 a6989586621679967687 :: TyFun (a ~> Either e b) (Either e b) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () Source # | |
| SingI d => SingI (Either_Sym1 d :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d) Source # | |
| SuppressUnusedWarnings (Traverse_6989586621681092063Sym1 a6989586621681092068 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621679881417 a6989586621679881418 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () Source # | |
| SuppressUnusedWarnings (Foldr_6989586621680814783Sym2 a6989586621680814789 a6989586621680814790 :: TyFun (Either a2 a1) b -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () Source # | |
| (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) Source # | |
| type MapM (arg1 :: a1 ~> m b) (arg2 :: Either a2 a1) | |
| type Traverse (a3 :: a1 ~> f b) (a4 :: Either a2 a1) | |
| type LiftA2 (arg1 :: a ~> (b ~> c)) (arg2 :: Either e a) (arg3 :: Either e b) | |
| type FoldMap (a3 :: a1 ~> k2) (a4 :: Either a2 a1) | |
| type Fmap (a3 :: a1 ~> b) (a4 :: Either a2 a1) | |
| 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 (a3 :: a1 ~> (k2 ~> k2)) (a4 :: k2) (a5 :: Either a2 a1) | |
| type Unbundled dom d (Either a b) Source # | |
Defined in Clash.Signal.Delayed.Bundle | |
| type Pure (a :: k1) | |
| type Return (arg :: a) | |
| 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 (a2 :: k1) <$ (a3 :: Either a1 b) | |
| type Unbundled dom (Either a b) Source # | |
Defined in Clash.Signal.Bundle | |
| type TryDomain t (Either a b) Source # | |
Defined in Clash.Class.HasDomain.HasSingleDomain | |
| type Apply (ShowsPrec_6989586621680670313Sym0 :: TyFun Nat (Either a b ~> (Symbol ~> Symbol)) -> Type) (a6989586621680670323 :: Nat) | |
| type Apply (Pure_6989586621679967588Sym0 :: TyFun a (Either e a) -> Type) (a6989586621679967594 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b) -> Type) (a6989586621679748393 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a b) -> Type) (a6989586621679748395 :: b) | |
| type Apply (Let6989586621680247378ASym0 :: TyFun k1 (Either a k1) -> Type) (wild_69895866216802470426989586621680247377 :: k1) | |
| type Apply (TFHelper_6989586621679967419Sym0 :: TyFun a1 (Either a2 b ~> Either a2 a1) -> Type) (a6989586621679967424 :: a1) | |
| type Apply (Foldr_6989586621680814783Sym1 a6989586621680814789 :: TyFun b (Either a2 a1 ~> b) -> Type) (a6989586621680814790 :: b) | |
| 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 (a3 :: Either a1 a2) | |
| type Null (a3 :: Either a1 a2) | |
| type ToList (arg :: Either a1 a2) | |
| type Fold (arg :: Either a m) | |
| type Sequence (arg :: Either a1 (m a2)) | |
| type SequenceA (arg :: Either a1 (f a2)) | |
| type (arg1 :: Either e a) <* (arg2 :: Either e b) | |
| type (arg1 :: Either e a) *> (arg2 :: Either e b) | |
| type (a2 :: Either e (a1 ~> b)) <*> (a3 :: Either e a1) | |
| type (arg1 :: Either e a) >> (arg2 :: Either e b) | |
| type (a2 :: Either e a1) >>= (a3 :: a1 ~> Either e b) | |
| type Rep1 (Either a :: Type -> Type) | |
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) (a6989586621679888633 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621679888633 :: [Either a b]) = RightsSym1 a6989586621679888633 | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621679888688 :: [Either a b]) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621679888510 :: [Either a b]) | |
| type Rep (Either a b) | |
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 |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Demote (Either a b) | |
| type BitSize (Either a b) Source # | |
Defined in Clash.Class.BitPack.Internal type BitSize (Either a b) = CLog 2 (GConstructorCount (Rep (Either a b))) + GFieldSize (Rep (Either a b)) | |
| 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 (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888451 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888451 :: Either a b) = IsRightSym1 a6989586621679888451 | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888476 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621679888476 :: Either a b) = IsLeftSym1 a6989586621679888476 | |
| type Apply (Length_6989586621680814797Sym0 :: TyFun (Either a1 a2) Nat -> Type) (a6989586621680814801 :: Either a1 a2) | |
| type Apply (Null_6989586621680814803Sym0 :: TyFun (Either a1 a2) Bool -> Type) (a6989586621680814809 :: Either a1 a2) | |
| type Apply (Compare_6989586621679863557Sym1 a6989586621679863562 :: TyFun (Either a b) Ordering -> Type) (a6989586621679863563 :: Either a b) | |
| type Apply (FoldMap_6989586621680814768Sym1 a6989586621680814773 :: TyFun (Either a2 a1) m -> Type) (a6989586621680814774 :: Either a2 a1) | |
| type Apply (Either_Sym2 a6989586621679881417 a6989586621679881418 :: TyFun (Either a b) c -> Type) (a6989586621679881419 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym2 a6989586621679881417 a6989586621679881418 :: TyFun (Either a b) c -> Type) (a6989586621679881419 :: Either a b) = Either_Sym3 a6989586621679881417 a6989586621679881418 a6989586621679881419 | |
| type Apply (Foldr_6989586621680814783Sym2 a6989586621680814789 a6989586621680814790 :: TyFun (Either a2 a1) b -> Type) (a6989586621680814791 :: Either a2 a1) | |
| type Apply (Traverse_6989586621681092063Sym1 a6989586621681092068 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621681092069 :: Either a2 a1) | |
| type Apply (Compare_6989586621679863557Sym0 :: TyFun (Either a b) (Either a b ~> Ordering) -> Type) (a6989586621679863562 :: Either a b) | |
| type Apply (TFHelper_6989586621680247369Sym0 :: TyFun (Either a b) (Either a b ~> Either a b) -> Type) (a6989586621680247374 :: Either a b) | |
| type Apply (ShowsPrec_6989586621680670313Sym1 a6989586621680670323 :: TyFun (Either a b) (Symbol ~> Symbol) -> Type) (a6989586621680670324 :: Either a b) | |
| type Apply (TFHelper_6989586621679967598Sym0 :: TyFun (Either e (a ~> b)) (Either e a ~> Either e b) -> Type) (a6989586621679967603 :: Either e (a ~> b)) | |
| type Apply (TFHelper_6989586621679967682Sym0 :: TyFun (Either e a) ((a ~> Either e b) ~> Either e b) -> Type) (a6989586621679967687 :: Either e a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (TFHelper_6989586621680247369Sym1 a6989586621680247374 :: TyFun (Either a b) (Either a b) -> Type) (a6989586621680247375 :: Either a b) | |
| type Apply (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) (a6989586621679881417 :: a ~> c) | |
| type Apply (FoldMap_6989586621680814768Sym0 :: TyFun (a1 ~> m) (Either a2 a1 ~> m) -> Type) (a6989586621680814773 :: a1 ~> m) | |
| type Apply (Foldr_6989586621680814783Sym0 :: TyFun (a1 ~> (b ~> b)) (b ~> (Either a2 a1 ~> b)) -> Type) (a6989586621680814789 :: a1 ~> (b ~> b)) | |
| type Apply (Fmap_6989586621679967402Sym0 :: TyFun (a1 ~> b) (Either a2 a1 ~> Either a2 b) -> Type) (a6989586621679967407 :: a1 ~> b) | |
| type Apply (Fmap_6989586621679967402Sym1 a6989586621679967407 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621679967408 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621679967419Sym1 a6989586621679967424 :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621679967425 :: Either a2 b) | |
| type Apply (TFHelper_6989586621679967598Sym1 a6989586621679967603 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621679967604 :: Either e a) | |
| type Apply (Traverse_6989586621681092063Sym0 :: TyFun (a1 ~> f b) (Either a2 a1 ~> f (Either a2 b)) -> Type) (a6989586621681092068 :: a1 ~> f b) | |
| type Apply (Either_Sym1 a6989586621679881417 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679881418 :: b ~> c) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621679881417 :: TyFun (b ~> c) (Either a b ~> c) -> Type) (a6989586621679881418 :: b ~> c) = Either_Sym2 a6989586621679881417 a6989586621679881418 | |
| type Apply (TFHelper_6989586621679967682Sym1 a6989586621679967687 :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621679967688 :: a ~> Either e b) | |
| 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 Source #
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 () Source #
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 () Source #
The computation writeFile file str function writes the string str,
to the file file.
readFile :: FilePath -> IO String Source #
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 () Source #
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 Source #
The getContents operation returns all user input as a single string,
which is read lazily as it is needed
(same as hGetContents stdin).
type FilePath = String Source #
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.
type IOError = IOException Source #
all :: Foldable t => (a -> Bool) -> t a -> Bool Source #
Determines whether all elements of the structure satisfy the predicate.
any :: Foldable t => (a -> Bool) -> t a -> Bool Source #
Determines whether any element of the structure satisfies the predicate.
sequence_ :: (Foldable t, Monad m) => t (m a) -> m () Source #
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 :: String -> [String] Source #
words breaks a string up into a list of words, which were delimited
by white space.
>>>words "Lorem ipsum\ndolor"["Lorem","ipsum","dolor"]
lines :: String -> [String] Source #
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 Source #
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
lcm :: Integral a => a -> a -> a Source #
lcm x yx and y divide.
gcd :: Integral a => a -> a -> a Source #
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 Source #
raise a number to an integral power
showString :: String -> ShowS Source #
utility function converting a String to a show function that
simply prepends the string unchanged.
showChar :: Char -> ShowS Source #
utility function converting a Char to a show function that
simply prepends the character unchanged.
lookup :: Eq a => a -> [(a, b)] -> Maybe b Source #
\(\mathcal{O}(n)\). lookup key assocs looks up a key in an association
list.
>>>lookup 2 [(1, "first"), (2, "second"), (3, "third")]Just "second"
break :: (a -> Bool) -> [a] -> ([a], [a]) Source #
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]) Source #
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] Source #
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 Source #
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""
(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 Source #
An infix synonym for fmap.
The name of this operator is an allusion to $.
Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function
application lifted over a Functor.
Examples
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)
uncurry :: (a -> b -> c) -> (a, b) -> c Source #
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 Source #
until p ff until p holds.
($!) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b infixr 0 Source #
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 Source #
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 Source #
Same as >>=, but with the arguments interchanged.
errorWithoutStackTrace :: forall (r :: RuntimeRep) (a :: TYPE r). [Char] -> a Source #
A variant of error that does not produce a stack trace.
Since: base-4.9.0.0
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => [Char] -> a Source #
error stops execution and displays an error message.