| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Indigo.Prelude
Description
This module serves the purpose of listing hiding rules of
Prelude that conflicts with Indigo exported functions.
Synopsis
- (++) :: [a] -> [a] -> [a]
- seq :: a -> b -> b
- filter :: (a -> Bool) -> [a] -> [a]
- zip :: [a] -> [b] -> [(a, 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
- guard :: Alternative f => Bool -> f ()
- join :: Monad m => m (m a) -> m a
- 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
- class Fractional a => Floating a where
- class Num a => Fractional a where
- 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
- class (Num a, Ord a) => Real a where
- toRational :: a -> Rational
- class (Real a, Fractional a) => RealFrac a where
- class Show a
- class Typeable (a :: k)
- class Monad m => MonadFail (m :: Type -> Type) where
- class IsString a where
- fromString :: String -> a
- class Functor f => Applicative (f :: Type -> Type) where
- class Foldable (t :: Type -> Type)
- 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 Generic a
- class KnownNat (n :: Nat)
- class IsLabel (x :: Symbol) a where
- fromLabel :: a
- class Semigroup a where
- class Semigroup a => Monoid a where
- data Bool
- data Char
- data Double = D# Double#
- data Float = F# Float#
- data Int
- data Int8
- data Int16
- data Int32
- data Int64
- data Integer
- data Natural
- data Maybe a
- data Ordering
- data Ratio a = !a :% !a
- type Rational = Ratio Integer
- data IO a
- data Word
- data Word8
- data Word16
- data Word32
- data Word64
- data Ptr a
- data FunPtr a
- data Either a b
- data Constraint
- type family CmpNat (a :: Nat) (b :: Nat) :: Ordering where ...
- class a ~R# b => Coercible (a :: k) (b :: k)
- data CallStack
- type String = [Char]
- id :: a -> a
- either :: (a -> c) -> (b -> c) -> Either a b -> c
- class Monad m => MonadReader r (m :: Type -> Type) | m -> r where
- class Monad m => MonadState s (m :: Type -> Type) | m -> s where
- data ByteString
- (<$>) :: Functor f => (a -> b) -> f a -> f b
- class Hashable a where
- hashWithSalt :: Int -> a -> Int
- data Text
- const :: a -> b -> a
- (.) :: (b -> c) -> (a -> b) -> a -> c
- data HashMap k v
- data Map k a
- stdout :: Handle
- data Handle
- class Applicative f => Alternative (f :: Type -> Type) where
- class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where
- newtype Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) = Compose {
- getCompose :: f (g a)
- vacuous :: Functor f => f Void -> f a
- absurd :: Void -> a
- data Void
- mtimesDefault :: (Integral b, Monoid a) => b -> a -> a
- cycle1 :: Semigroup m => m -> m
- data WrappedMonoid m
- newtype Option a = Option {}
- sortWith :: Ord b => (a -> b) -> [a] -> [a]
- class Bifunctor (p :: Type -> Type -> Type) where
- init :: NonEmpty a -> [a]
- last :: NonEmpty a -> a
- tail :: NonEmpty a -> [a]
- head :: NonEmpty a -> a
- nonEmpty :: [a] -> Maybe (NonEmpty a)
- showStackTrace :: IO (Maybe String)
- getStackTrace :: IO (Maybe [Location])
- class Monad m => MonadIO (m :: Type -> Type) where
- mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
- (<$!>) :: Monad m => (a -> b) -> m a -> m b
- replicateM_ :: Applicative m => Int -> m a -> m ()
- replicateM :: Applicative m => Int -> m a -> m [a]
- foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
- foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
- zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
- mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])
- forever :: Applicative f => f a -> f b
- (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
- (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
- filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
- foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m
- fmapDefault :: Traversable t => (a -> b) -> t a -> t b
- mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
- mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
- forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b)
- optional :: Alternative f => f a -> f (Maybe a)
- newtype ZipList a = ZipList {
- getZipList :: [a]
- (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- newtype Identity a = Identity {
- runIdentity :: a
- stderr :: Handle
- stdin :: Handle
- withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a
- callStack :: HasCallStack => CallStack
- writeTVar :: TVar a -> a -> STM ()
- readTVar :: TVar a -> STM a
- newTVar :: a -> STM (TVar a)
- data STM a
- data TVar a
- data IORef a
- type FilePath = String
- prettyCallStack :: CallStack -> String
- prettySrcLoc :: SrcLoc -> String
- class (Typeable e, Show e) => Exception e where
- toException :: e -> SomeException
- fromException :: SomeException -> Maybe e
- displayException :: e -> String
- newtype Const a (b :: k) = Const {
- getConst :: a
- minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
- concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
- foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
- foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b
- newtype First a = First {}
- newtype Last a = Last {}
- stimesMonoid :: (Integral b, Monoid a) => b -> a -> a
- stimesIdempotent :: Integral b => b -> a -> a
- newtype Dual a = Dual {
- getDual :: a
- newtype Endo a = Endo {
- appEndo :: a -> a
- newtype All = All {}
- newtype Any = Any {}
- newtype Sum a = Sum {
- getSum :: a
- newtype Product a = Product {
- getProduct :: a
- newtype Alt (f :: k -> Type) (a :: k) = Alt {
- getAlt :: f a
- someNatVal :: Natural -> SomeNat
- natVal :: forall (n :: Nat) proxy. KnownNat n => proxy n -> Natural
- data SomeNat = KnownNat n => SomeNat (Proxy n)
- unfoldr :: (b -> Maybe (a, b)) -> b -> [a]
- sortOn :: Ord b => (a -> b) -> [a] -> [a]
- sortBy :: (a -> a -> Ordering) -> [a] -> [a]
- sort :: Ord a => [a] -> [a]
- permutations :: [a] -> [[a]]
- subsequences :: [a] -> [[a]]
- tails :: [a] -> [[a]]
- inits :: [a] -> [[a]]
- group :: Eq a => [a] -> [[a]]
- genericReplicate :: Integral i => i -> a -> [a]
- genericSplitAt :: Integral i => i -> [a] -> ([a], [a])
- genericDrop :: Integral i => i -> [a] -> [a]
- genericTake :: Integral i => i -> [a] -> [a]
- genericLength :: Num i => [a] -> i
- transpose :: [[a]] -> [[a]]
- intercalate :: [a] -> [[a]] -> [a]
- intersperse :: a -> [a] -> [a]
- isPrefixOf :: Eq a => [a] -> [a] -> Bool
- readMaybe :: Read a => String -> Maybe a
- reads :: Read a => ReadS a
- isRight :: Either a b -> Bool
- isLeft :: Either a b -> Bool
- partitionEithers :: [Either a b] -> ([a], [b])
- rights :: [Either a b] -> [b]
- lefts :: [Either a b] -> [a]
- comparing :: Ord a => (b -> a) -> b -> b -> Ordering
- newtype Down a = Down a
- data Proxy (t :: k) = Proxy
- data IOMode
- byteSwap64 :: Word64 -> Word64
- byteSwap32 :: Word32 -> Word32
- byteSwap16 :: Word16 -> Word16
- integralEnumFromThenTo :: Integral a => a -> a -> a -> [a]
- integralEnumFromTo :: Integral a => a -> a -> [a]
- integralEnumFromThen :: (Integral a, Bounded a) => a -> a -> [a]
- integralEnumFrom :: (Integral a, Bounded a) => a -> [a]
- gcdWord' :: Word -> Word -> Word
- gcdInt' :: Int -> Int -> Int
- lcm :: Integral a => a -> a -> a
- gcd :: Integral a => a -> a -> a
- (^^%^^) :: Integral a => Rational -> a -> Rational
- (^%^) :: Integral a => Rational -> a -> Rational
- (^^) :: (Fractional a, Integral b) => a -> b -> a
- odd :: Integral a => a -> Bool
- even :: Integral a => a -> Bool
- numericEnumFromThenTo :: (Ord a, Fractional a) => a -> a -> a -> [a]
- numericEnumFromTo :: (Ord a, Fractional a) => a -> a -> [a]
- numericEnumFromThen :: Fractional a => a -> a -> [a]
- numericEnumFrom :: Fractional a => a -> [a]
- denominator :: Ratio a -> a
- numerator :: Ratio a -> a
- reduce :: Integral a => a -> a -> Ratio a
- notANumber :: Rational
- infinity :: Rational
- ratioPrec1 :: Int
- ratioPrec :: Int
- underflowError :: a
- overflowError :: a
- ratioZeroDenominatorError :: a
- divZeroError :: a
- boundedEnumFromThen :: (Enum a, Bounded a) => a -> a -> [a]
- boundedEnumFrom :: (Enum a, Bounded a) => a -> [a]
- chr :: Int -> Char
- unzip3 :: [(a, b, c)] -> ([a], [b], [c])
- unzip :: [(a, b)] -> ([a], [b])
- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
- zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
- reverse :: [a] -> [a]
- break :: (a -> Bool) -> [a] -> ([a], [a])
- splitAt :: Int -> [a] -> ([a], [a])
- drop :: Int -> [a] -> [a]
- take :: Int -> [a] -> [a]
- dropWhile :: (a -> Bool) -> [a] -> [a]
- takeWhile :: (a -> Bool) -> [a] -> [a]
- cycle :: [a] -> [a]
- replicate :: Int -> a -> [a]
- repeat :: a -> [a]
- iterate :: (a -> a) -> a -> [a]
- scanr :: (a -> b -> b) -> b -> [a] -> [b]
- scanl :: (b -> a -> b) -> b -> [a] -> [b]
- mapMaybe :: (a -> Maybe b) -> [a] -> [b]
- catMaybes :: [Maybe a] -> [a]
- listToMaybe :: [a] -> Maybe a
- maybeToList :: Maybe a -> [a]
- fromMaybe :: a -> Maybe a -> a
- isNothing :: Maybe a -> Bool
- isJust :: Maybe a -> Bool
- maybe :: b -> (a -> b) -> Maybe a -> b
- bool :: a -> a -> Bool -> a
- (&) :: a -> (a -> b) -> b
- on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
- fix :: (a -> a) -> a
- void :: Functor f => f a -> f ()
- ($>) :: Functor f => f a -> b -> f b
- (<&>) :: Functor f => f a -> (a -> b) -> f b
- swap :: (a, b) -> (b, a)
- uncurry :: (a -> b -> c) -> (a, b) -> c
- curry :: ((a, b) -> c) -> a -> b -> c
- data MVar a
- subtract :: Num a => a -> a -> a
- currentCallStack :: IO [String]
- asTypeOf :: a -> a -> a
- flip :: (a -> b -> c) -> b -> a -> c
- maxInt :: Int
- minInt :: Int
- ord :: Char -> Int
- ap :: Monad m => m (a -> b) -> m a -> m b
- liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r
- liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r
- liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r
- liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
- (=<<) :: Monad m => (a -> m b) -> m a -> m b
- liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
- (<**>) :: Applicative f => f a -> f (a -> b) -> f b
- data NonEmpty a = a :| [a]
- getCallStack :: CallStack -> [([Char], SrcLoc)]
- type HasCallStack = ?callStack :: CallStack
- stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a
- data SomeException = Exception e => SomeException e
- data IdentityT (f :: k -> Type) (a :: k)
- data IntMap a
- data IntSet
- data Seq a
- data Set a
- class NFData a where
- rnf :: a -> ()
- force :: NFData a => a -> a
- ($!!) :: NFData a => (a -> b) -> a -> b
- deepseq :: NFData a => a -> b -> b
- newtype MaybeT (m :: Type -> Type) a = MaybeT {}
- newtype ExceptT e (m :: Type -> Type) a = ExceptT (m (Either e a))
- class Monad m => MonadThrow (m :: Type -> Type)
- class MonadThrow m => MonadCatch (m :: Type -> Type)
- class MonadCatch m => MonadMask (m :: Type -> Type) where
- mask :: ((forall a. m a -> m a) -> m b) -> m b
- uninterruptibleMask :: ((forall a. m a -> m a) -> m b) -> m b
- generalBracket :: m a -> (a -> ExitCase b -> m c) -> (a -> m b) -> m (b, c)
- toStrict :: Text -> Text
- data HashSet a
- newtype StateT s (m :: Type -> Type) a = StateT {
- runStateT :: s -> m (a, s)
- type State s = StateT s Identity
- data Vector a
- type Reader r = ReaderT r Identity
- gets :: MonadState s m => (s -> a) -> m a
- type ($) (f :: k1 -> k) (a :: k1) = f a
- undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a
- error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a
- (^..) :: s -> Getting (Endo [a]) s a -> [a]
- set :: ASetter s t a b -> b -> s -> t
- (.~) :: ASetter s t a b -> b -> s -> t
- over :: ASetter s t a b -> (a -> b) -> s -> t
- _1 :: Field1 s t a b => Lens s t a b
- _2 :: Field2 s t a b => Lens s t a b
- _3 :: Field3 s t a b => Lens s t a b
- _4 :: Field4 s t a b => Lens s t a b
- _5 :: Field5 s t a b => Lens s t a b
- type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t
- type Lens' s a = Lens s s a a
- type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t
- type Traversal' s a = Traversal s s a a
- modify :: MonadState s m => (s -> s) -> m ()
- asks :: MonadReader r m => (r -> a) -> m a
- newtype ReaderT r (m :: Type -> Type) a = ReaderT {
- runReaderT :: r -> m a
- preuse :: MonadState s m => Getting (First a) s a -> m (Maybe a)
- use :: MonadState s m => Getting a s a -> m a
- preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a)
- view :: MonadReader s m => Getting a s a -> m a
- show :: forall b a. (Show a, IsString b) => a -> b
- type family Each (c :: [k -> Constraint]) (as :: [k]) where ...
- pass :: Applicative f => f ()
- ($!) :: (a -> b) -> a -> b
- map :: Functor f => (a -> b) -> f a -> f b
- (<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b)
- newEmptyMVar :: MonadIO m => m (MVar a)
- newMVar :: MonadIO m => a -> m (MVar a)
- putMVar :: MonadIO m => MVar a -> a -> m ()
- readMVar :: MonadIO m => MVar a -> m a
- swapMVar :: MonadIO m => MVar a -> a -> m a
- takeMVar :: MonadIO m => MVar a -> m a
- tryPutMVar :: MonadIO m => MVar a -> a -> m Bool
- tryReadMVar :: MonadIO m => MVar a -> m (Maybe a)
- tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a)
- atomically :: MonadIO m => STM a -> m a
- newTVarIO :: MonadIO m => a -> m (TVar a)
- readTVarIO :: MonadIO m => TVar a -> m a
- exitWith :: MonadIO m => ExitCode -> m a
- exitFailure :: MonadIO m => m a
- exitSuccess :: MonadIO m => m a
- die :: MonadIO m => String -> m a
- appendFile :: MonadIO m => FilePath -> Text -> m ()
- getLine :: MonadIO m => m Text
- openFile :: MonadIO m => FilePath -> IOMode -> m Handle
- hClose :: MonadIO m => Handle -> m ()
- withFile :: (MonadIO m, MonadMask m) => FilePath -> IOMode -> (Handle -> m a) -> m a
- newIORef :: MonadIO m => a -> m (IORef a)
- readIORef :: MonadIO m => IORef a -> m a
- writeIORef :: MonadIO m => IORef a -> a -> m ()
- modifyIORef :: MonadIO m => IORef a -> (a -> a) -> m ()
- modifyIORef' :: MonadIO m => IORef a -> (a -> a) -> m ()
- atomicModifyIORef :: MonadIO m => IORef a -> (a -> (a, b)) -> m b
- atomicModifyIORef' :: MonadIO m => IORef a -> (a -> (a, b)) -> m b
- atomicWriteIORef :: MonadIO m => IORef a -> a -> m ()
- whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f ()
- whenJustM :: Monad m => m (Maybe a) -> (a -> m ()) -> m ()
- whenNothing :: Applicative f => Maybe a -> f a -> f a
- whenNothing_ :: Applicative f => Maybe a -> f () -> f ()
- whenNothingM :: Monad m => m (Maybe a) -> m a -> m a
- whenNothingM_ :: Monad m => m (Maybe a) -> m () -> m ()
- fromLeft :: a -> Either a b -> a
- fromRight :: b -> Either a b -> b
- leftToMaybe :: Either l r -> Maybe l
- rightToMaybe :: Either l r -> Maybe r
- maybeToRight :: l -> Maybe r -> Either l r
- maybeToLeft :: r -> Maybe l -> Either l r
- whenLeftM :: Monad m => m (Either l r) -> (l -> m ()) -> m ()
- whenRightM :: Monad m => m (Either l r) -> (r -> m ()) -> m ()
- usingReaderT :: r -> ReaderT r m a -> m a
- usingReader :: r -> Reader r a -> a
- usingStateT :: s -> StateT s m a -> m (a, s)
- usingState :: s -> State s a -> (a, s)
- evaluatingStateT :: Functor f => s -> StateT s f a -> f a
- evaluatingState :: s -> State s a -> a
- executingStateT :: Functor f => s -> StateT s f a -> f s
- executingState :: s -> State s a -> s
- maybeToMonoid :: Monoid m => Maybe m -> m
- class One x where
- type family OneItem x
- class Container t where
- type Element t
- toList :: t -> [Element t]
- null :: t -> Bool
- foldr :: (Element t -> b -> b) -> b -> t -> b
- foldl :: (b -> Element t -> b) -> b -> t -> b
- foldl' :: (b -> Element t -> b) -> b -> t -> b
- length :: t -> Int
- elem :: Element t -> t -> Bool
- maximum :: t -> Element t
- minimum :: t -> Element t
- foldMap :: Monoid m => (Element t -> m) -> t -> m
- fold :: t -> Element t
- foldr' :: (Element t -> b -> b) -> b -> t -> b
- foldr1 :: (Element t -> Element t -> Element t) -> t -> Element t
- foldl1 :: (Element t -> Element t -> Element t) -> t -> Element t
- notElem :: Element t -> t -> Bool
- all :: (Element t -> Bool) -> t -> Bool
- any :: (Element t -> Bool) -> t -> Bool
- find :: (Element t -> Bool) -> t -> Maybe (Element t)
- safeHead :: t -> Maybe (Element t)
- type family Element t
- class ToPairs t where
- flipfoldl' :: (Container t, Element t ~ a) => (a -> b -> b) -> b -> t -> b
- sum :: (Container t, Num (Element t)) => t -> Element t
- product :: (Container t, Num (Element t)) => t -> Element t
- traverse_ :: (Container t, Applicative f) => (Element t -> f b) -> t -> f ()
- for_ :: (Container t, Applicative f) => t -> (Element t -> f b) -> f ()
- mapM_ :: (Container t, Monad m) => (Element t -> m b) -> t -> m ()
- forM_ :: (Container t, Monad m) => t -> (Element t -> m b) -> m ()
- sequenceA_ :: (Container t, Applicative f, Element t ~ f a) => t -> f ()
- sequence_ :: (Container t, Monad m, Element t ~ m a) => t -> m ()
- asum :: (Container t, Alternative f, Element t ~ f a) => t -> f a
- concatMapM :: (Applicative f, Monoid m, Container (l m), Element (l m) ~ m, Traversable l) => (a -> f m) -> l a -> f m
- concatForM :: (Applicative f, Monoid m, Container (l m), Element (l m) ~ m, Traversable l) => l a -> (a -> f m) -> f m
- andM :: (Container f, Element f ~ m Bool, Monad m) => f -> m Bool
- orM :: (Container f, Element f ~ m Bool, Monad m) => f -> m Bool
- allM :: (Container f, Monad m) => (Element f -> m Bool) -> f -> m Bool
- anyM :: (Container f, Monad m) => (Element f -> m Bool) -> f -> m Bool
- uncons :: [a] -> Maybe (a, [a])
- whenNotNull :: Applicative f => [a] -> (NonEmpty a -> f ()) -> f ()
- whenNotNullM :: Monad m => m [a] -> (NonEmpty a -> m ()) -> m ()
- data Bug = Bug SomeException CallStack
- pattern Exc :: Exception e => e -> SomeException
- bug :: (HasCallStack, Exception e) => e -> a
- note :: MonadError e m => e -> Maybe a -> m a
- evaluateWHNF :: MonadIO m => a -> m a
- evaluateWHNF_ :: MonadIO m => a -> m ()
- evaluateNF :: (NFData a, MonadIO m) => a -> m a
- evaluateNF_ :: (NFData a, MonadIO m) => a -> m ()
- whenM :: Monad m => m Bool -> m () -> m ()
- unlessM :: Monad m => m Bool -> m () -> m ()
- ifM :: Monad m => m Bool -> m a -> m a -> m a
- guardM :: MonadPlus m => m Bool -> m ()
- ordNub :: Ord a => [a] -> [a]
- hashNub :: (Eq a, Hashable a) => [a] -> [a]
- sortNub :: Ord a => [a] -> [a]
- unstableNub :: (Eq a, Hashable a) => [a] -> [a]
- class Print a
- hPutStr :: (Print a, MonadIO m) => Handle -> a -> m ()
- hPutStrLn :: (Print a, MonadIO m) => Handle -> a -> m ()
- putStr :: (Print a, MonadIO m) => a -> m ()
- putStrLn :: (Print a, MonadIO m) => a -> m ()
- print :: forall a m. (MonadIO m, Show a) => a -> m ()
- hPrint :: (MonadIO m, Show a) => Handle -> a -> m ()
- putText :: MonadIO m => Text -> m ()
- putTextLn :: MonadIO m => Text -> m ()
- putLText :: MonadIO m => Text -> m ()
- putLTextLn :: MonadIO m => Text -> m ()
- data Undefined = Undefined
- trace :: Text -> a -> a
- traceShow :: Show a => a -> b -> b
- traceShowId :: Show a => a -> a
- traceIdWith :: (a -> Text) -> a -> a
- traceShowIdWith :: Show s => (a -> s) -> a -> a
- traceShowM :: (Show a, Monad m) => a -> m ()
- traceM :: Monad m => Text -> m ()
- traceId :: Text -> Text
- class ToString a where
- class ToLText a where
- class ToText a where
- class ConvertUtf8 a b where
- encodeUtf8 :: a -> b
- decodeUtf8 :: b -> a
- decodeUtf8Strict :: b -> Either UnicodeException a
- type LByteString = ByteString
- type LText = Text
- readEither :: (ToString a, Read b) => a -> Either Text b
- type With (a :: [k -> Constraint]) (b :: k) = a <+> b
- class SuperComposition a b c | a b -> c where
- (...) :: a -> b -> c
- maybeToExceptT :: forall (m :: Type -> Type) e a. Functor m => e -> MaybeT m a -> ExceptT e m a
- exceptToMaybeT :: forall (m :: Type -> Type) e a. Functor m => ExceptT e m a -> MaybeT m a
- data UnicodeException
- type OnDecodeError = OnError Word8 Char
- type OnError a b = String -> Maybe a -> Maybe b
- strictDecode :: OnDecodeError
- lenientDecode :: OnDecodeError
- decodeUtf8With :: OnDecodeError -> ByteString -> Text
- decodeUtf8' :: ByteString -> Either UnicodeException Text
- words :: Text -> [Text]
- lines :: Text -> [Text]
- unlines :: [Text] -> Text
- unwords :: [Text] -> Text
- fromStrict :: Text -> Text
- modifyTVar' :: TVar a -> (a -> a) -> STM ()
- throwM :: (MonadThrow m, Exception e) => e -> m a
- catch :: (MonadCatch m, Exception e) => m a -> (e -> m a) -> m a
- catchAny :: MonadCatch m => m a -> (SomeException -> m a) -> m a
- handleAny :: MonadCatch m => (SomeException -> m a) -> m a -> m a
- try :: (MonadCatch m, Exception e) => m a -> m (Either e a)
- tryAny :: MonadCatch m => m a -> m (Either SomeException a)
- onException :: MonadMask m => m a -> m b -> m a
- bracket :: MonadMask m => m a -> (a -> m b) -> (a -> m c) -> m c
- bracket_ :: MonadMask m => m a -> m b -> m c -> m c
- finally :: MonadMask m => m a -> m b -> m a
- bracketOnError :: MonadMask m => m a -> (a -> m b) -> (a -> m c) -> m c
- execStateT :: Monad m => StateT s m a -> s -> m s
- evalStateT :: Monad m => StateT s m a -> s -> m a
- withState :: (s -> s) -> State s a -> State s a
- execState :: State s a -> s -> s
- evalState :: State s a -> s -> a
- runState :: State s a -> s -> (a, s)
- runReader :: Reader r a -> r -> a
- runExceptT :: ExceptT e m a -> m (Either e a)
- modify' :: MonadState s m => (s -> s) -> m ()
- class MonadTrans (t :: (Type -> Type) -> Type -> Type) where
Documentation
(++) :: [a] -> [a] -> [a] infixr 5 #
Append two lists, i.e.,
[x1, ..., xm] ++ [y1, ..., yn] == [x1, ..., xm, y1, ..., yn] [x1, ..., xm] ++ [y1, ...] == [x1, ..., xm, y1, ...]
If the first list is not finite, the result is the first list.
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] #
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]
zip :: [a] -> [b] -> [(a, b)] #
O(min(m,n)). zip takes two lists and returns a list of corresponding
pairs.
zip [1, 2] ['a', 'b'] = [(1, 'a'), (2, 'b')]
If one input list is short, excess elements of the longer list are discarded:
zip [1] ['a', 'b'] = [(1, 'a')] zip [1, 2] ['a'] = [(1, 'a')]
zip is right-lazy:
zip [] _|_ = [] zip _|_ [] = _|_
zip is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
($) :: forall (r :: RuntimeRep) a (b :: TYPE r). (a -> b) -> a -> b infixr 0 #
Application operator. This operator is redundant, since ordinary
application (f x) means the same as (f . However, $ x)$ has
low, right-associative binding precedence, so it sometimes allows
parentheses to be omitted; for example:
f $ g $ h x = f (g (h x))
It is also useful in higher-order situations, such as map ($ 0) xszipWith ($) fs xs
Note that ( is levity-polymorphic in its result type, so that
$)foo where $ Truefoo :: Bool -> Int# is well-typed.
fromIntegral :: (Integral a, Num b) => a -> b #
general coercion from integral types
realToFrac :: (Real a, Fractional b) => a -> b #
general coercion to fractional types
guard :: Alternative f => Bool -> f () #
Conditional failure of Alternative computations. Defined by
guard True =pure() guard False =empty
Examples
Common uses of guard include conditionally signaling an error in
an error monad and conditionally rejecting the current choice in an
Alternative-based parser.
As an example of signaling an error in the error monad Maybe,
consider a safe division function safeDiv x y that returns
Nothing when the denominator y is zero and Just (x `div`
y)
>>> safeDiv 4 0 Nothing >>> safeDiv 4 2 Just 2
A definition of safeDiv using guards, but not guard:
safeDiv :: Int -> Int -> Maybe Int
safeDiv x y | y /= 0 = Just (x `div` y)
| otherwise = Nothing
A definition of safeDiv using guard and Monad do-notation:
safeDiv :: Int -> Int -> Maybe Int safeDiv x y = do guard (y /= 0) return (x `div` y)
join :: Monad m => m (m a) -> m a #
The join function is the conventional monad join operator. It
is used to remove one level of monadic structure, projecting its
bound argument into the outer level.
Examples
A common use of join is to run an IO computation returned from
an STM transaction, since STM transactions
can't perform IO directly. Recall that
atomically :: STM a -> IO a
is used to run STM transactions atomically. So, by
specializing the types of atomically and join to
atomically:: STM (IO b) -> IO (IO b)join:: IO (IO b) -> IO b
we can compose them as
join.atomically:: STM (IO b) -> IO b
The Bounded class is used to name the upper and lower limits of a
type. Ord is not a superclass of Bounded since types that are not
totally ordered may also have upper and lower bounds.
The Bounded class may be derived for any enumeration type;
minBound is the first constructor listed in the data declaration
and maxBound is the last.
Bounded may also be derived for single-constructor datatypes whose
constituent types are in Bounded.
Instances
| Bounded Bool | Since: base-2.1 |
| Bounded Char | Since: base-2.1 |
| Bounded Int | Since: base-2.1 |
| Bounded Int8 | Since: base-2.1 |
| Bounded Int16 | Since: base-2.1 |
| Bounded Int32 | Since: base-2.1 |
| Bounded Int64 | Since: base-2.1 |
| Bounded Ordering | Since: base-2.1 |
| Bounded Word | Since: base-2.1 |
| Bounded Word8 | Since: base-2.1 |
| Bounded Word16 | Since: base-2.1 |
| Bounded Word32 | Since: base-2.1 |
| Bounded Word64 | Since: base-2.1 |
| Bounded VecCount | Since: base-4.10.0.0 |
| Bounded VecElem | Since: base-4.10.0.0 |
| Bounded () | Since: base-2.1 |
| Bounded All | Since: base-2.1 |
| Bounded Any | Since: base-2.1 |
| Bounded Associativity | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| Bounded UTF32_Invalid | |
Defined in Basement.String.Encoding.UTF32 | |
| Bounded Encoding | |
| Bounded Extension | |
| Bounded Mutez | |
| Bounded KeyHashTag | |
Defined in Tezos.Crypto | |
| Bounded EntriesOrder | |
Defined in Michelson.Untyped.Contract | |
| Bounded Undefined | |
| Class () (Bounded a) | |
Defined in Data.Constraint | |
| a :=> (Bounded (Dict a)) | |
| () :=> (Bounded Bool) | |
| () :=> (Bounded Char) | |
| () :=> (Bounded Int) | |
| () :=> (Bounded Ordering) | |
| () :=> (Bounded Word) | |
| () :=> (Bounded ()) | |
Defined in Data.Constraint | |
| Bounded a => Bounded (Min a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Max a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (First a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Last a) | Since: base-4.9.0.0 |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| a => Bounded (Dict a) | |
| (Bounded a) :=> (Bounded (Identity a)) | |
| (Bounded a) :=> (Bounded (Const a b)) | |
| (Bounded a, Bounded b) => Bounded (a, b) | Since: base-2.1 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| (Bounded a, Bounded b) :=> (Bounded (a, b)) | |
| (Bounded a, Bounded b, Bounded c) => Bounded (a, b, c) | Since: base-2.1 |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| (Applicative f, Bounded a) => Bounded (Ap f a) | Since: base-4.12.0.0 |
| Coercible a b => Bounded (Coercion a b) | Since: base-4.7.0.0 |
| a ~ b => Bounded (a :~: b) | Since: base-4.7.0.0 |
| Bounded b => Bounded (Tagged s b) | |
| (Bounded a, Bounded b, Bounded c, Bounded d) => Bounded (a, b, c, d) | Since: base-2.1 |
| a ~~ b => Bounded (a :~~: b) | Since: base-4.10.0.0 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e) => Bounded (a, b, c, d, e) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f) => Bounded (a, b, c, d, e, f) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g) => Bounded (a, b, c, d, e, f, g) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h) => Bounded (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i) => Bounded (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j) => Bounded (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k) => Bounded (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Bounded a, Bounded b, Bounded c, Bounded d, Bounded e, Bounded f, Bounded g, Bounded h, Bounded i, Bounded j, Bounded k, Bounded l, Bounded m, Bounded n, Bounded o) => Bounded (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Class Enum defines operations on sequentially ordered types.
The enumFrom... methods are used in Haskell's translation of
arithmetic sequences.
Instances of Enum may be derived for any enumeration type (types
whose constructors have no fields). The nullary constructors are
assumed to be numbered left-to-right by fromEnum from 0 through n-1.
See Chapter 10 of the Haskell Report for more details.
For any type that is an instance of class Bounded as well as Enum,
the following should hold:
- The calls
succmaxBoundpredminBound fromEnumandtoEnumshould give a runtime error if the result value is not representable in the result type. For example,toEnum7 ::BoolenumFromandenumFromThenshould be defined with an implicit bound, thus:
enumFrom x = enumFromTo x maxBound
enumFromThen x y = enumFromThenTo x y bound
where
bound | fromEnum y >= fromEnum x = maxBound
| otherwise = minBoundMethods
the successor of a value. For numeric types, succ adds 1.
the predecessor of a value. For numeric types, pred subtracts 1.
Convert from an Int.
Convert to an Int.
It is implementation-dependent what fromEnum returns when
applied to a value that is too large to fit in an Int.
Used in Haskell's translation of [n..] with [n..] = enumFrom n,
a possible implementation being enumFrom n = n : enumFrom (succ n).
For example:
enumFrom 4 :: [Integer] = [4,5,6,7,...]
enumFrom 6 :: [Int] = [6,7,8,9,...,maxBound :: Int]
enumFromThen :: a -> a -> [a] #
Used in Haskell's translation of [n,n'..]
with [n,n'..] = enumFromThen n n', a possible implementation being
enumFromThen n n' = n : n' : worker (f x) (f x n'),
worker s v = v : worker s (s v), x = fromEnum n' - fromEnum n and
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y
For example:
enumFromThen 4 6 :: [Integer] = [4,6,8,10...]
enumFromThen 6 2 :: [Int] = [6,2,-2,-6,...,minBound :: Int]
enumFromTo :: a -> a -> [a] #
Used in Haskell's translation of [n..m] with
[n..m] = enumFromTo n m, a possible implementation being
enumFromTo n m
| n <= m = n : enumFromTo (succ n) m
| otherwise = [].
For example:
enumFromTo 6 10 :: [Int] = [6,7,8,9,10]
enumFromTo 42 1 :: [Integer] = []
enumFromThenTo :: a -> a -> a -> [a] #
Used in Haskell's translation of [n,n'..m] with
[n,n'..m] = enumFromThenTo n n' m, a possible implementation
being enumFromThenTo n n' m = worker (f x) (c x) n m,
x = fromEnum n' - fromEnum n, c x = bool (>=) ((x 0)
f n y
| n > 0 = f (n - 1) (succ y)
| n < 0 = f (n + 1) (pred y)
| otherwise = y and
worker s c v m
| c v m = v : worker s c (s v) m
| otherwise = []
For example:
enumFromThenTo 4 2 -6 :: [Integer] = [4,2,0,-2,-4,-6]
enumFromThenTo 6 8 2 :: [Int] = []
Instances
The Eq class defines equality (==) and inequality (/=).
All the basic datatypes exported by the Prelude are instances of Eq,
and Eq may be derived for any datatype whose constituents are also
instances of Eq.
The Haskell Report defines no laws for Eq. However, == is customarily
expected to implement an equivalence relationship where two values comparing
equal are indistinguishable by "public" functions, with a "public" function
being one not allowing to see implementation details. For example, for a
type representing non-normalised natural numbers modulo 100, a "public"
function doesn't make the difference between 1 and 201. It is expected to
have the following properties:
Instances
class Fractional a => Floating a where #
Trigonometric and hyperbolic functions and related functions.
The Haskell Report defines no laws for Floating. However, (, +)(
and *)exp are customarily expected to define an exponential field and have
the following properties:
exp (a + b)=exp a * exp bexp (fromInteger 0)=fromInteger 1
Minimal complete definition
pi, exp, log, sin, cos, asin, acos, atan, sinh, cosh, asinh, acosh, atanh
Instances
class Num a => Fractional a where #
Fractional numbers, supporting real division.
The Haskell Report defines no laws for Fractional. However, ( and
+)( are customarily expected to define a division ring and have the
following properties:*)
recipgives the multiplicative inversex * recip x=recip x * x=fromInteger 1
Note that it isn't customarily expected that a type instance of
Fractional implement a field. However, all instances in base do.
Minimal complete definition
fromRational, (recip | (/))
Methods
Reciprocal fraction.
fromRational :: Rational -> a #
Conversion from a Rational (that is Ratio IntegerfromRational
to a value of type Rational, so such literals have type
(.Fractional a) => a
Instances
class (Real a, Enum a) => Integral a where #
Integral numbers, supporting integer division.
The Haskell Report defines no laws for Integral. However, Integral
instances are customarily expected to define a Euclidean domain and have the
following properties for the div/mod and quot/rem pairs, given
suitable Euclidean functions f and g:
x=y * quot x y + rem x ywithrem x y=fromInteger 0org (rem x y)<g yx=y * div x y + mod x ywithmod x y=fromInteger 0orf (mod x y)<f y
An example of a suitable Euclidean function, for Integer's instance, is
abs.
Methods
quot :: a -> a -> a infixl 7 #
integer division truncated toward zero
integer remainder, satisfying
(x `quot` y)*y + (x `rem` y) == x
conversion to Integer
Instances
class Applicative m => Monad (m :: Type -> Type) where #
The Monad class defines the basic operations over a monad,
a concept from a branch of mathematics known as category theory.
From the perspective of a Haskell programmer, however, it is best to
think of a monad as an abstract datatype of actions.
Haskell's do expressions provide a convenient syntax for writing
monadic expressions.
Instances of Monad should satisfy the following:
- 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 #
Sequentially compose two actions, passing any value produced by the first as an argument to the second.
(>>) :: m a -> m b -> m b infixl 1 #
Sequentially compose two actions, discarding any value produced by the first, like sequencing operators (such as the semicolon) in imperative languages.
Inject a value into the monadic type.
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 IResult | |
| Monad Result | |
| Monad Parser | |
| 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 ReadP | Since: base-2.1 |
| Monad NonEmpty | Since: base-4.9.0.0 |
| Monad Put | |
| Monad Tree | |
| Monad Seq | |
| Monad CryptoFailable | |
Defined in Crypto.Error.Types Methods (>>=) :: CryptoFailable a -> (a -> CryptoFailable b) -> CryptoFailable b # (>>) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable b # return :: a -> CryptoFailable a # | |
| Monad DList | |
| Monad Vector | |
| Monad SmallArray | |
Defined in Data.Primitive.SmallArray Methods (>>=) :: SmallArray a -> (a -> SmallArray b) -> SmallArray b # (>>) :: SmallArray a -> SmallArray b -> SmallArray b # return :: a -> SmallArray a # | |
| Monad Array | |
| Monad Identity | |
| Monad Thunk | |
| Monad P | Since: base-2.1 |
| Monad IndigoM Source # | |
| () :=> (Monad ((->) a :: Type -> Type)) | |
Defined in Data.Constraint | |
| () :=> (Monad []) | |
Defined in Data.Constraint | |
| () :=> (Monad IO) | |
| () :=> (Monad (Either a)) | |
| () :=> (Monad Identity) | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Monad (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monoid a => Monad ((,) a) | Since: base-4.9.0.0 |
| Representable f => Monad (Co f) | |
| Monad (Parser i) | |
| Monad m => Monad (WrappedMonad m) | Since: base-4.7.0.0 |
Defined in Control.Applicative Methods (>>=) :: WrappedMonad m a -> (a -> WrappedMonad m b) -> WrappedMonad m b # (>>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # return :: a -> WrappedMonad m a # | |
| ArrowApply a => Monad (ArrowMonad a) | Since: base-2.1 |
Defined in Control.Arrow Methods (>>=) :: ArrowMonad a a0 -> (a0 -> ArrowMonad a b) -> ArrowMonad a b # (>>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # return :: a0 -> ArrowMonad a a0 # | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Monad m => Monad (MaybeT m) | |
| Alternative f => Monad (Cofree f) | |
| Functor f => Monad (Free f) | |
| Monad m => Monad (Yoneda m) | |
| Monad (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedGetter s a -> (a -> ReifiedGetter s b) -> ReifiedGetter s b # (>>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # return :: a -> ReifiedGetter s a # | |
| Monad (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods (>>=) :: ReifiedFold s a -> (a -> ReifiedFold s b) -> ReifiedFold s b # (>>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # return :: a -> ReifiedFold s a # | |
| (Monad (Rep p), Representable p) => Monad (Prep p) | |
| Monad (Program instr) Source # | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint Methods cls :: Monad f :- Applicative f # | |
| (Monad m) :=> (Functor (WrappedMonad m)) | |
Defined in Data.Constraint | |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) # | |
| Monad f => Monad (Rec1 f) | Since: base-4.9.0.0 |
| Monad f => Monad (Ap f) | Since: base-4.12.0.0 |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| 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 # (>>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # return :: a -> WhenMissing f x a # | |
| 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 (Indexed i a) | |
| Monad m => Monad (ReaderT r m) | |
| Monad (Tagged s) | |
| Monad m => Monad (StateT s m) | |
| Class (Monad f, Alternative f) (MonadPlus f) | |
Defined in Data.Constraint | |
| Monad ((->) r :: Type -> Type) | Since: base-2.1 |
| (Monad f, Monad g) => Monad (f :*: g) | Since: base-4.9.0.0 |
| (Monad f, Monad g) => Monad (Product f g) | Since: base-4.9.0.0 |
| (Monad f, Applicative f) => Monad (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods (>>=) :: WhenMatched f x y a -> (a -> WhenMatched f x y b) -> WhenMatched f x y b # (>>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # return :: a -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Monad (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMissing f k x a -> (a -> WhenMissing f k x b) -> WhenMissing f k x b # (>>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # return :: a -> WhenMissing f k x a # | |
| Monad f => Monad (M1 i c f) | Since: base-4.9.0.0 |
| (Monad f, Applicative f) => Monad (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods (>>=) :: WhenMatched f k x y a -> (a -> WhenMatched f k x y b) -> WhenMatched f k x y b # (>>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # return :: a -> WhenMatched f k x y a # | |
| Monad state => Monad (Builder collection mutCollection step state err) | |
Defined in Basement.MutableBuilder Methods (>>=) :: Builder collection mutCollection step state err a -> (a -> Builder collection mutCollection step state err b) -> Builder collection mutCollection step state err b # (>>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b # return :: a -> Builder collection mutCollection step state err a # | |
class Functor (f :: Type -> Type) where #
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
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
Unary negation.
Instances
| Num Int | Since: base-2.1 |
| Num Int8 | Since: base-2.1 |
| Num Int16 | Since: base-2.1 |
| Num Int32 | Since: base-2.1 |
| Num Int64 | Since: base-2.1 |
| Num Integer | Since: base-2.1 |
| Num Natural | Note that Since: base-4.8.0.0 |
| Num Word | Since: base-2.1 |
| Num Word8 | Since: base-2.1 |
| Num Word16 | Since: base-2.1 |
| Num Word32 | Since: base-2.1 |
| Num Word64 | Since: base-2.1 |
| Num Scientific | WARNING: |
Defined in Data.Scientific Methods (+) :: Scientific -> Scientific -> Scientific # (-) :: Scientific -> Scientific -> Scientific # (*) :: Scientific -> Scientific -> Scientific # negate :: Scientific -> Scientific # abs :: Scientific -> Scientific # signum :: Scientific -> Scientific # fromInteger :: Integer -> Scientific # | |
| Num Pos | |
| Num RemainingSteps | |
Defined in Michelson.Interpret Methods (+) :: RemainingSteps -> RemainingSteps -> RemainingSteps # (-) :: RemainingSteps -> RemainingSteps -> RemainingSteps # (*) :: RemainingSteps -> RemainingSteps -> RemainingSteps # negate :: RemainingSteps -> RemainingSteps # abs :: RemainingSteps -> RemainingSteps # signum :: RemainingSteps -> RemainingSteps # fromInteger :: Integer -> RemainingSteps # | |
| Num CodePoint | |
Defined in Data.Text.Encoding | |
| Num DecoderState | |
Defined in Data.Text.Encoding Methods (+) :: DecoderState -> DecoderState -> DecoderState # (-) :: DecoderState -> DecoderState -> DecoderState # (*) :: DecoderState -> DecoderState -> DecoderState # negate :: DecoderState -> DecoderState # abs :: DecoderState -> DecoderState # signum :: DecoderState -> DecoderState # fromInteger :: Integer -> DecoderState # | |
| Num RefId Source # | |
| Class () (Num a) | |
Defined in Data.Constraint | |
| () :=> (Num Double) | |
| () :=> (Num Float) | |
| () :=> (Num Int) | |
| () :=> (Num Integer) | |
| () :=> (Num Natural) | |
| () :=> (Num Word) | |
| Integral a => Num (Ratio a) | Since: base-2.0.1 |
| RealFloat a => Num (Complex a) | Since: base-2.1 |
| Num a => Num (Min a) | Since: base-4.9.0.0 |
| Num a => Num (Max a) | Since: base-4.9.0.0 |
| Num a => Num (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity | |
| Num a => Num (Sum a) | Since: base-4.7.0.0 |
| Num a => Num (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| Num (Offset ty) | |
Defined in Basement.Types.OffsetSize | |
| Num (CountOf ty) | |
Defined in Basement.Types.OffsetSize | |
| (KnownNat n, NatWithinBound Word64 n) => Num (Zn64 n) | |
| KnownNat n => Num (Zn n) | |
| (Num t, KnownSymbol s) => Num (ElField '(s, t)) | |
Defined in Data.Vinyl.Functor Methods (+) :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # (-) :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # (*) :: ElField '(s, t) -> ElField '(s, t) -> ElField '(s, t) # negate :: ElField '(s, t) -> ElField '(s, t) # abs :: ElField '(s, t) -> ElField '(s, t) # signum :: ElField '(s, t) -> ElField '(s, t) # fromInteger :: Integer -> ElField '(s, t) # | |
| Class (Num a) (Fractional a) | |
Defined in Data.Constraint Methods cls :: Fractional a :- Num a # | |
| (Integral a) :=> (Num (Ratio a)) | |
| (Num a) :=> (Num (Identity a)) | |
| (Num a) :=> (Num (Const a b)) | |
| (RealFloat a) :=> (Num (Complex a)) | |
| Class (Num a, Ord a) (Real a) | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| (Applicative f, Num a) => Num (Ap f a) | Since: base-4.12.0.0 |
| Num (f a) => Num (Alt f a) | Since: base-4.8.0.0 |
| Num a => Num (Tagged s a) | |
Defined in Data.Tagged | |
The Ord class is used for totally ordered datatypes.
Instances of Ord can be derived for any user-defined datatype whose
constituent types are in Ord. The declared order of the constructors in
the data declaration determines the ordering in derived Ord instances. The
Ordering datatype allows a single comparison to determine the precise
ordering of two objects.
The Haskell Report defines no laws for Ord. However, <= is customarily
expected to implement a non-strict partial order and have the following
properties:
- Transitivity
- if
x <= y && y <= z=True, thenx <= z=True - Reflexivity
x <= x=True- Antisymmetry
- if
x <= y && y <= x=True, thenx == y=True
Note that the following operator interactions are expected to hold:
x >= y=y <= xx < y=x <= y && x /= yx > y=y < xx < y=compare x y == LTx > y=compare x y == GTx == y=compare x y == EQmin x y == if x <= y then x else y=Truemax x y == if x >= y then x else y=True
Minimal complete definition: either compare or <=.
Using compare can be more efficient for complex types.
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
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 ByteString | |
Defined in Data.ByteString.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read ByteString | |
Defined in Data.ByteString.Lazy.Internal Methods readsPrec :: Int -> ReadS ByteString # readList :: ReadS [ByteString] # readPrec :: ReadPrec ByteString # readListPrec :: ReadPrec [ByteString] # | |
| Read Scientific | Supports the skipping of parentheses and whitespaces. Example: > read " ( (( -1.0e+3 ) ))" :: Scientific -1000.0 (Note: This |
Defined in Data.Scientific Methods readsPrec :: Int -> ReadS Scientific # readList :: ReadS [Scientific] # readPrec :: ReadPrec Scientific # readListPrec :: ReadPrec [Scientific] # | |
| Read Value | |
| Read DotNetTime | |
Defined in Data.Aeson.Types.Internal Methods readsPrec :: Int -> ReadS DotNetTime # readList :: ReadS [DotNetTime] # readPrec :: ReadPrec DotNetTime # readListPrec :: ReadPrec [DotNetTime] # | |
| Read Void | Reading a Since: base-4.8.0.0 |
| Read ExitCode | |
| Read BufferMode | Since: base-4.2.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS BufferMode # readList :: ReadS [BufferMode] # readPrec :: ReadPrec BufferMode # readListPrec :: ReadPrec [BufferMode] # | |
| Read Newline | Since: base-4.3.0.0 |
| Read NewlineMode | Since: base-4.3.0.0 |
Defined in GHC.IO.Handle.Types Methods readsPrec :: Int -> ReadS NewlineMode # readList :: ReadS [NewlineMode] # readPrec :: ReadPrec NewlineMode # readListPrec :: ReadPrec [NewlineMode] # | |
| Read All | Since: base-2.1 |
| Read Any | Since: base-2.1 |
| Read Fixity | Since: base-4.6.0.0 |
| Read Associativity | Since: base-4.6.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # | |
| Read SourceUnpackedness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceUnpackedness # readList :: ReadS [SourceUnpackedness] # | |
| Read SourceStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS SourceStrictness # readList :: ReadS [SourceStrictness] # | |
| Read DecidedStrictness | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS DecidedStrictness # readList :: ReadS [DecidedStrictness] # | |
| Read SomeSymbol | Since: base-4.7.0.0 |
Defined in GHC.TypeLits Methods readsPrec :: Int -> ReadS SomeSymbol # readList :: ReadS [SomeSymbol] # readPrec :: ReadPrec SomeSymbol # readListPrec :: ReadPrec [SomeSymbol] # | |
| Read SomeNat | Since: base-4.7.0.0 |
| Read IOMode | Since: base-4.2.0.0 |
| Read Lexeme | Since: base-2.1 |
| Read GeneralCategory | Since: base-2.1 |
Defined in GHC.Read Methods readsPrec :: Int -> ReadS GeneralCategory # readList :: ReadS [GeneralCategory] # | |
| Read IntSet | |
| Read Signature | |
| Read PrivateKey | |
Defined in Crypto.PubKey.ECC.ECDSA Methods readsPrec :: Int -> ReadS PrivateKey # readList :: ReadS [PrivateKey] # readPrec :: ReadPrec PrivateKey # readListPrec :: ReadPrec [PrivateKey] # | |
| Read PublicKey | |
| Read KeyPair | |
| Read Pos | |
| Read SourcePos | |
| Read Undefined | |
| Read DatatypeVariant | |
Defined in Language.Haskell.TH.Datatype Methods readsPrec :: Int -> ReadS DatatypeVariant # readList :: ReadS [DatatypeVariant] # | |
| Read UnpackedUUID | |
| Read UUID | |
| Class () (Read a) | |
Defined in Data.Constraint | |
| a :=> (Read (Dict a)) | |
| () :=> (Read Bool) | |
| () :=> (Read Char) | |
| () :=> (Read Int) | |
| () :=> (Read Natural) | |
| () :=> (Read Ordering) | |
| () :=> (Read Word) | |
| () :=> (Read ()) | |
Defined in Data.Constraint | |
| Read a => Read [a] | Since: base-2.1 |
| Read a => Read (Maybe a) | Since: base-2.1 |
| (Integral a, Read a) => Read (Ratio a) | Since: base-2.1 |
| Read p => Read (Par1 p) | Since: base-4.7.0.0 |
| Read a => Read (Complex a) | Since: base-2.1 |
| Read a => Read (Min a) | Since: base-4.9.0.0 |
| Read a => Read (Max a) | Since: base-4.9.0.0 |
| Read a => Read (First a) | Since: base-4.9.0.0 |
| Read a => Read (Last a) | Since: base-4.9.0.0 |
| Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
| Read a => Read (Option a) | Since: base-4.9.0.0 |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Read a => Read (First a) | Since: base-2.1 |
| Read a => Read (Last a) | Since: base-2.1 |
| Read a => Read (Dual a) | Since: base-2.1 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Read a => Read (Product a) | Since: base-2.1 |
| Read a => Read (Down a) | Since: base-4.7.0.0 |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| a => Read (Dict a) | |
| Read e => Read (IntMap e) | |
| Read a => Read (Tree a) | |
| Read a => Read (Seq a) | |
| Read a => Read (ViewL a) | |
| Read a => Read (ViewR a) | |
| (Read a, Ord a) => Read (Set a) | |
| Read a => Read (DList a) | |
| (Read a, Prim a) => Read (Vector a) | |
| (Read a, Storable a) => Read (Vector a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Read a => Read (Vector a) | |
| Read t => Read (ErrorItem t) | |
| Read e => Read (ErrorFancy e) | |
Defined in Text.Megaparsec.Error Methods readsPrec :: Int -> ReadS (ErrorFancy e) # readList :: ReadS [ErrorFancy e] # readPrec :: ReadPrec (ErrorFancy e) # readListPrec :: ReadPrec [ErrorFancy e] # | |
| Read a => Read (SmallArray a) | |
Defined in Data.Primitive.SmallArray Methods readsPrec :: Int -> ReadS (SmallArray a) # readList :: ReadS [SmallArray a] # readPrec :: ReadPrec (SmallArray a) # readListPrec :: ReadPrec [SmallArray a] # | |
| Read a => Read (Array a) | |
| (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 |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Ix a, Read a, Read b) => Read (Array a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Arg a b) | Since: base-4.9.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| (Read1 m, Read a) => Read (MaybeT m a) | |
| (Read1 f, Read a) => Read (Cofree f a) | |
| (Read1 f, Read a) => Read (Free f a) | |
| (Functor f, Read (f a)) => Read (Yoneda f a) | |
| (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) | |
| Read b => Read (Tagged s b) | |
| Read c => Read (K1 i c p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :+: g) p) | Since: base-4.7.0.0 |
| (Read (f p), Read (g p)) => Read ((f :*: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d) => Read (a, b, c, d) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Product f g a) | Since: base-4.9.0.0 |
| (Read1 f, Read1 g, Read a) => Read (Sum f g a) | Since: base-4.9.0.0 |
| a ~~ b => Read (a :~~: b) | Since: base-4.10.0.0 |
| Read (f p) => Read (M1 i c f p) | Since: base-4.7.0.0 |
| Read (f (g p)) => Read ((f :.: g) p) | Since: base-4.7.0.0 |
| (Read a, Read b, Read c, Read d, Read e) => Read (a, b, c, d, e) | Since: base-2.1 |
| (Read1 f, Read1 g, Read a) => Read (Compose f g a) | Since: base-4.9.0.0 |
| Read (p a b) => Read (WrappedBifunctor p a b) | |
Defined in Data.Bifunctor.Wrapped Methods readsPrec :: Int -> ReadS (WrappedBifunctor p a b) # readList :: ReadS [WrappedBifunctor p a b] # readPrec :: ReadPrec (WrappedBifunctor p a b) # readListPrec :: ReadPrec [WrappedBifunctor p a b] # | |
| Read (g b) => Read (Joker g a b) | |
| Read (p b a) => Read (Flip p a b) | |
| Read (f a) => Read (Clown f a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f) => Read (a, b, c, d, e, f) | Since: base-2.1 |
| (Read (p a b), Read (q a b)) => Read (Sum p q a b) | |
| (Read (f a b), Read (g a b)) => Read (Product f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g) => Read (a, b, c, d, e, f, g) | Since: base-2.1 |
| Read (f (p a b)) => Read (Tannen f p a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h) => Read (a, b, c, d, e, f, g, h) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i) => Read (a, b, c, d, e, f, g, h, i) | Since: base-2.1 |
| Read (p (f a) (g b)) => Read (Biff p f g a b) | |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j) => Read (a, b, c, d, e, f, g, h, i, j) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k) => Read (a, b, c, d, e, f, g, h, i, j, k) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l) => Read (a, b, c, d, e, f, g, h, i, j, k, l) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n) | Since: base-2.1 |
| (Read a, Read b, Read c, Read d, Read e, Read f, Read g, Read h, Read i, Read j, Read k, Read l, Read m, Read n, Read o) => Read (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) | Since: base-2.1 |
Defined in GHC.Read | |
class (Num a, Ord a) => Real a where #
Methods
toRational :: a -> Rational #
the rational equivalent of its real argument with full precision
Instances
| Real Int | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Int -> Rational # | |
| Real Int8 | Since: base-2.1 |
Defined in GHC.Int Methods toRational :: Int8 -> Rational # | |
| Real Int16 | Since: base-2.1 |
Defined in GHC.Int Methods toRational :: Int16 -> Rational # | |
| Real Int32 | Since: base-2.1 |
Defined in GHC.Int Methods toRational :: Int32 -> Rational # | |
| Real Int64 | Since: base-2.1 |
Defined in GHC.Int Methods toRational :: Int64 -> Rational # | |
| Real Integer | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Integer -> Rational # | |
| Real Natural | Since: base-4.8.0.0 |
Defined in GHC.Real Methods toRational :: Natural -> Rational # | |
| Real Word | Since: base-2.1 |
Defined in GHC.Real Methods toRational :: Word -> Rational # | |
| Real Word8 | Since: base-2.1 |
Defined in GHC.Word Methods toRational :: Word8 -> Rational # | |
| Real Word16 | Since: base-2.1 |
Defined in GHC.Word Methods toRational :: Word16 -> Rational # | |
| Real Word32 | Since: base-2.1 |
Defined in GHC.Word Methods toRational :: Word32 -> Rational # | |
| Real Word64 | Since: base-2.1 |
Defined in GHC.Word Methods toRational :: Word64 -> Rational # | |
| Real Scientific | WARNING: Avoid applying |
Defined in Data.Scientific Methods toRational :: Scientific -> Rational # | |
| Real RefId Source # | |
Defined in Indigo.Internal.State Methods toRational :: RefId -> Rational # | |
| () :=> (Real Double) | |
| () :=> (Real Float) | |
| () :=> (Real Int) | |
| () :=> (Real Integer) | |
| () :=> (Real Natural) | |
| () :=> (Real Word) | |
| Integral a => Real (Ratio a) | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Ratio a -> Rational # | |
| Real a => Real (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| (Real t, KnownSymbol s) => Real (ElField '(s, t)) | |
Defined in Data.Vinyl.Functor Methods toRational :: ElField '(s, t) -> Rational # | |
| (Integral a) :=> (Real (Ratio a)) | |
| (Real a) :=> (Real (Identity a)) | |
| (Real a) :=> (Real (Const a b)) | |
| Class (Num a, Ord a) (Real a) | |
| Class (Real a, Fractional a) (RealFrac a) | |
Defined in Data.Constraint | |
| Class (Real a, Enum a) (Integral a) | |
| Real a => Real (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods toRational :: Const a b -> Rational # | |
| Real a => Real (Tagged s a) | |
Defined in Data.Tagged Methods toRational :: Tagged s a -> Rational # | |
class (Real a, Fractional a) => RealFrac a where #
Extracting components of fractions.
Minimal complete definition
Methods
properFraction :: Integral b => a -> (b, a) #
The function properFraction takes a real fractional number x
and returns a pair (n,f) such that x = n+f, and:
nis an integral number with the same sign asx; andfis a fraction with the same type and sign asx, and with absolute value less than1.
The default definitions of the ceiling, floor, truncate
and round functions are in terms of properFraction.
truncate :: Integral b => a -> b #
truncate xx between zero and x
round :: Integral b => a -> b #
round xx;
the even integer if x is equidistant between two integers
ceiling :: Integral b => a -> b #
ceiling xx
floor :: Integral b => a -> b #
floor xx
Instances
| RealFrac Scientific | WARNING: the methods of the |
Defined in Data.Scientific Methods properFraction :: Integral b => Scientific -> (b, Scientific) # truncate :: Integral b => Scientific -> b # round :: Integral b => Scientific -> b # ceiling :: Integral b => Scientific -> b # floor :: Integral b => Scientific -> b # | |
| () :=> (RealFrac Double) | |
| () :=> (RealFrac Float) | |
| Integral a => RealFrac (Ratio a) | Since: base-2.0.1 |
| RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0 |
| (RealFrac t, KnownSymbol s) => RealFrac (ElField '(s, t)) | |
| (Integral a) :=> (RealFrac (Ratio a)) | |
| (RealFrac a) :=> (RealFrac (Identity a)) | |
| (RealFrac a) :=> (RealFrac (Const a b)) | |
| Class (Real a, Fractional a) (RealFrac a) | |
Defined in Data.Constraint | |
| Class (RealFrac a, Floating a) (RealFloat a) | |
| RealFrac a => RealFrac (Const a b) | Since: base-4.9.0.0 |
| RealFrac a => RealFrac (Tagged s a) | |
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)".
Instances
The class Typeable allows a concrete representation of a type to
be calculated.
Minimal complete definition
typeRep#
class Monad m => MonadFail (m :: Type -> Type) where #
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 for string-like datastructures; used by the overloaded string extension (-XOverloadedStrings in GHC).
Methods
fromString :: String -> a #
Instances
class Functor f => Applicative (f :: Type -> Type) where #
A functor with application, providing operations to
A minimal complete definition must include implementations of pure
and of either <*> or liftA2. If it defines both, then they must behave
the same as their default definitions:
(<*>) =liftA2id
liftA2f x y = f<$>x<*>y
Further, any definition must satisfy the following:
- Identity
pureid<*>v = v- Composition
pure(.)<*>u<*>v<*>w = u<*>(v<*>w)- Homomorphism
puref<*>purex =pure(f x)- Interchange
u
<*>purey =pure($y)<*>u
The other methods have the following default definitions, which may be overridden with equivalent specialized implementations:
As a consequence of these laws, the Functor instance for f will satisfy
It may be useful to note that supposing
forall x y. p (q x y) = f x . g y
it follows from the above that
liftA2p (liftA2q u v) =liftA2f u .liftA2g v
If f is also a Monad, it should satisfy
(which implies that pure and <*> satisfy the applicative functor laws).
Methods
Lift a value.
(<*>) :: f (a -> b) -> f a -> f b infixl 4 #
Sequential application.
A few functors support an implementation of <*> that is more
efficient than the default one.
liftA2 :: (a -> b -> c) -> f a -> f b -> f c #
Lift a binary function to actions.
Some functors support an implementation of liftA2 that is more
efficient than the default one. In particular, if fmap is an
expensive operation, it is likely better to use liftA2 than to
fmap over the structure and then use <*>.
(*>) :: f a -> f b -> f b infixl 4 #
Sequence actions, discarding the value of the first argument.
(<*) :: f a -> f b -> f a infixl 4 #
Sequence actions, discarding the value of the second argument.
Instances
| Applicative [] | Since: base-2.1 |
| Applicative Maybe | Since: base-2.1 |
| Applicative IO | Since: base-2.1 |
| Applicative Par1 | Since: base-4.9.0.0 |
| Applicative Q | |
| Applicative IResult | |
| Applicative Result | |
| Applicative Parser | |
| Applicative Complex | Since: base-4.9.0.0 |
| Applicative Min | Since: base-4.9.0.0 |
| Applicative Max | Since: base-4.9.0.0 |
| Applicative First | Since: base-4.9.0.0 |
| Applicative Last | Since: base-4.9.0.0 |
| Applicative Option | Since: base-4.9.0.0 |
| Applicative ZipList | f <$> ZipList xs1 <*> ... <*> ZipList xsN
= ZipList (zipWithN f xs1 ... xsN)where (\a b c -> stimes c [a, b]) <$> ZipList "abcd" <*> ZipList "567" <*> ZipList [1..]
= ZipList (zipWith3 (\a b c -> stimes c [a, b]) "abcd" "567" [1..])
= ZipList {getZipList = ["a5","b6b6","c7c7c7"]}Since: base-2.1 |
| Applicative Identity | Since: base-4.8.0.0 |
| Applicative STM | Since: base-4.8.0.0 |
| Applicative First | Since: base-4.8.0.0 |
| Applicative Last | Since: base-4.8.0.0 |
| Applicative Dual | Since: base-4.8.0.0 |
| Applicative Sum | Since: base-4.8.0.0 |
| Applicative Product | Since: base-4.8.0.0 |
| Applicative Down | Since: base-4.11.0.0 |
| Applicative ReadP | Since: base-4.6.0.0 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
| Applicative Put | |
| Applicative Tree | |
| Applicative Seq | Since: containers-0.5.4 |
| Applicative CryptoFailable | |
Defined in Crypto.Error.Types Methods pure :: a -> CryptoFailable a # (<*>) :: CryptoFailable (a -> b) -> CryptoFailable a -> CryptoFailable b # liftA2 :: (a -> b -> c) -> CryptoFailable a -> CryptoFailable b -> CryptoFailable c # (*>) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable b # (<*) :: CryptoFailable a -> CryptoFailable b -> CryptoFailable a # | |
| Applicative DList | |
| Applicative Vector | |
| Applicative SmallArray | |
Defined in Data.Primitive.SmallArray Methods pure :: a -> SmallArray a # (<*>) :: SmallArray (a -> b) -> SmallArray a -> SmallArray b # liftA2 :: (a -> b -> c) -> SmallArray a -> SmallArray b -> SmallArray c # (*>) :: SmallArray a -> SmallArray b -> SmallArray b # (<*) :: SmallArray a -> SmallArray b -> SmallArray a # | |
| Applicative Array | |
| Applicative Identity | |
| Applicative Thunk | |
| Applicative P | Since: base-4.5.0.0 |
| Applicative IndigoM Source # | |
| () :=> (Applicative ((->) a :: Type -> Type)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative ((->) a) # | |
| () :=> (Applicative []) | |
Defined in Data.Constraint Methods ins :: () :- Applicative [] # | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Applicative IO) | |
Defined in Data.Constraint Methods ins :: () :- Applicative IO # | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| Applicative (Either e) | Since: base-3.0 |
| Applicative (U1 :: Type -> Type) | Since: base-4.9.0.0 |
| Monoid a => Applicative ((,) a) | For tuples, the ("hello ", (+15)) <*> ("world!", 2002)
("hello world!",2017)Since: base-2.1 |
| Representable f => Applicative (Co f) | |
| Applicative (Parser i) | |
| Monad m => Applicative (WrappedMonad m) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a # (<*>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b # liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c # (*>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b # (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a # | |
| Arrow a => Applicative (ArrowMonad a) | Since: base-4.6.0.0 |
Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 # (<*>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c # (*>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b # (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0 # | |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| (Functor m, Monad m) => Applicative (MaybeT m) | |
| Alternative f => Applicative (Cofree f) | |
| Functor f => Applicative (Free f) | |
| Applicative f => Applicative (Yoneda f) | |
| Applicative (ReifiedGetter s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedGetter s a # (<*>) :: ReifiedGetter s (a -> b) -> ReifiedGetter s a -> ReifiedGetter s b # liftA2 :: (a -> b -> c) -> ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s c # (*>) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s b # (<*) :: ReifiedGetter s a -> ReifiedGetter s b -> ReifiedGetter s a # | |
| Applicative (ReifiedFold s) | |
Defined in Control.Lens.Reified Methods pure :: a -> ReifiedFold s a # (<*>) :: ReifiedFold s (a -> b) -> ReifiedFold s a -> ReifiedFold s b # liftA2 :: (a -> b -> c) -> ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s c # (*>) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s b # (<*) :: ReifiedFold s a -> ReifiedFold s b -> ReifiedFold s a # | |
| Applicative f => Applicative (Indexing f) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative f => Applicative (Indexing64 f) | |
Defined in Control.Lens.Internal.Indexed Methods pure :: a -> Indexing64 f a # (<*>) :: Indexing64 f (a -> b) -> Indexing64 f a -> Indexing64 f b # liftA2 :: (a -> b -> c) -> Indexing64 f a -> Indexing64 f b -> Indexing64 f c # (*>) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f b # (<*) :: Indexing64 f a -> Indexing64 f b -> Indexing64 f a # | |
| (Applicative (Rep p), Representable p) => Applicative (Prep p) | |
| Applicative (Program instr) Source # | |
Defined in Indigo.Frontend.Program Methods pure :: a -> Program instr a # (<*>) :: Program instr (a -> b) -> Program instr a -> Program instr b # liftA2 :: (a -> b -> c) -> Program instr a -> Program instr b -> Program instr c # (*>) :: Program instr a -> Program instr b -> Program instr b # (<*) :: Program instr a -> Program instr b -> Program instr a # | |
| Class (Functor f) (Applicative f) | |
Defined in Data.Constraint Methods cls :: Applicative f :- Functor f # | |
| Class (Applicative f) (Monad f) | |
Defined in Data.Constraint Methods cls :: Monad f :- Applicative f # | |
| Class (Applicative f) (Alternative f) | |
Defined in Data.Constraint Methods cls :: Alternative f :- Applicative f # | |
| (Monad m) :=> (Applicative (WrappedMonad m)) | |
Defined in Data.Constraint Methods ins :: Monad m :- Applicative (WrappedMonad m) # | |
| (Monoid a) :=> (Applicative ((,) a)) | |
Defined in Data.Constraint | |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| Applicative f => Applicative (Rec1 f) | Since: base-4.9.0.0 |
| Arrow a => Applicative (WrappedArrow a b) | Since: base-2.1 |
Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 # (<*>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c # (*>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 # (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # | |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
| Applicative f => Applicative (Ap f) | Since: base-4.12.0.0 |
| Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
| Biapplicative p => Applicative (Join p) | |
| Biapplicative p => Applicative (Fix p) | |
| Applicative m => Applicative (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| (Applicative f, Monad f) => Applicative (WhenMissing f x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a # (<*>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b # liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c # (*>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b # (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a # | |
| (Functor m, Monad m) => Applicative (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| (Functor f, Monad m) => Applicative (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| (Alternative f, Applicative w) => Applicative (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree | |
| (Applicative f, Applicative g) => Applicative (Day f g) | |
| (Functor m, Monad m) => Applicative (ErrorT e m) | |
Defined in Control.Monad.Trans.Error | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| Applicative (Indexed i a) | |
Defined in Control.Lens.Internal.Indexed | |
| Applicative m => Applicative (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
| (Monad m, Monoid s) => Applicative (Focusing m s) | |
Defined in Lens.Micro.Mtl.Internal | |
| Applicative (k (May s)) => Applicative (FocusingMay k s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> FocusingMay k s a # (<*>) :: FocusingMay k s (a -> b) -> FocusingMay k s a -> FocusingMay k s b # liftA2 :: (a -> b -> c) -> FocusingMay k s a -> FocusingMay k s b -> FocusingMay k s c # (*>) :: FocusingMay k s a -> FocusingMay k s b -> FocusingMay k s b # (<*) :: FocusingMay k s a -> FocusingMay k s b -> FocusingMay k s a # | |
| (Monad m, Monoid r) => Applicative (Effect m r) | |
Defined in Lens.Micro.Mtl.Internal | |
| Applicative (Tagged s) | |
| Applicative (Bazaar a b) | |
Defined in Lens.Micro | |
| (Functor m, Monad m) => Applicative (StateT s m) | |
| Applicative ((->) a :: Type -> Type) | Since: base-2.1 |
| Monoid c => Applicative (K1 i c :: Type -> Type) | Since: base-4.12.0.0 |
| (Applicative f, Applicative g) => Applicative (f :*: g) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product | |
| (Monad f, Applicative f) => Applicative (WhenMatched f x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a # (<*>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c # (*>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b # (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a # | |
| (Applicative f, Monad f) => Applicative (WhenMissing f k x) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a # (<*>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c # (*>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b # (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a # | |
| (Monad m, Monoid s, Monoid w) => Applicative (FocusingWith w m s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> FocusingWith w m s a # (<*>) :: FocusingWith w m s (a -> b) -> FocusingWith w m s a -> FocusingWith w m s b # liftA2 :: (a -> b -> c) -> FocusingWith w m s a -> FocusingWith w m s b -> FocusingWith w m s c # (*>) :: FocusingWith w m s a -> FocusingWith w m s b -> FocusingWith w m s b # (<*) :: FocusingWith w m s a -> FocusingWith w m s b -> FocusingWith w m s a # | |
| Applicative (k (s, w)) => Applicative (FocusingPlus w k s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> FocusingPlus w k s a # (<*>) :: FocusingPlus w k s (a -> b) -> FocusingPlus w k s a -> FocusingPlus w k s b # liftA2 :: (a -> b -> c) -> FocusingPlus w k s a -> FocusingPlus w k s b -> FocusingPlus w k s c # (*>) :: FocusingPlus w k s a -> FocusingPlus w k s b -> FocusingPlus w k s b # (<*) :: FocusingPlus w k s a -> FocusingPlus w k s b -> FocusingPlus w k s a # | |
| Applicative (k (f s)) => Applicative (FocusingOn f k s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> FocusingOn f k s a # (<*>) :: FocusingOn f k s (a -> b) -> FocusingOn f k s a -> FocusingOn f k s b # liftA2 :: (a -> b -> c) -> FocusingOn f k s a -> FocusingOn f k s b -> FocusingOn f k s c # (*>) :: FocusingOn f k s a -> FocusingOn f k s b -> FocusingOn f k s b # (<*) :: FocusingOn f k s a -> FocusingOn f k s b -> FocusingOn f k s a # | |
| Applicative (k (Err e s)) => Applicative (FocusingErr e k s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> FocusingErr e k s a # (<*>) :: FocusingErr e k s (a -> b) -> FocusingErr e k s a -> FocusingErr e k s b # liftA2 :: (a -> b -> c) -> FocusingErr e k s a -> FocusingErr e k s b -> FocusingErr e k s c # (*>) :: FocusingErr e k s a -> FocusingErr e k s b -> FocusingErr e k s b # (<*) :: FocusingErr e k s a -> FocusingErr e k s b -> FocusingErr e k s a # | |
| Applicative f => Applicative (M1 i c f) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (f :.: g) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Monad f, Applicative f) => Applicative (WhenMatched f k x y) | Equivalent to Since: containers-0.5.9 |
Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a # (<*>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c # (*>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b # (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a # | |
| (Monoid s, Monoid w, Monad m) => Applicative (EffectRWS w st m s) | |
Defined in Lens.Micro.Mtl.Internal Methods pure :: a -> EffectRWS w st m s a # (<*>) :: EffectRWS w st m s (a -> b) -> EffectRWS w st m s a -> EffectRWS w st m s b # liftA2 :: (a -> b -> c) -> EffectRWS w st m s a -> EffectRWS w st m s b -> EffectRWS w st m s c # (*>) :: EffectRWS w st m s a -> EffectRWS w st m s b -> EffectRWS w st m s b # (<*) :: EffectRWS w st m s a -> EffectRWS w st m s b -> EffectRWS w st m s a # | |
| Reifies s (ReifiedApplicative f) => Applicative (ReflectedApplicative f s) | |
Defined in Data.Reflection Methods pure :: a -> ReflectedApplicative f s a # (<*>) :: ReflectedApplicative f s (a -> b) -> ReflectedApplicative f s a -> ReflectedApplicative f s b # liftA2 :: (a -> b -> c) -> ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s c # (*>) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s b # (<*) :: ReflectedApplicative f s a -> ReflectedApplicative f s b -> ReflectedApplicative f s a # | |
| (Applicative f, Applicative g) => Applicative (Compose f g) | |
Defined in Data.Vinyl.Functor | |
| Monad state => Applicative (Builder collection mutCollection step state err) | |
Defined in Basement.MutableBuilder Methods pure :: a -> Builder collection mutCollection step state err a # (<*>) :: Builder collection mutCollection step state err (a -> b) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b # liftA2 :: (a -> b -> c) -> Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err c # (*>) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err b # (<*) :: Builder collection mutCollection step state err a -> Builder collection mutCollection step state err b -> Builder collection mutCollection step state err a # | |
| (Applicative f, Applicative g) => Applicative (Lift (,) f g) | |
Defined in Data.Vinyl.Functor | |
class Foldable (t :: Type -> Type) #
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)
Instances
| Foldable [] | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => [m] -> m # foldMap :: Monoid m => (a -> m) -> [a] -> m # foldMap' :: Monoid m => (a -> m) -> [a] -> m # foldr :: (a -> b -> b) -> b -> [a] -> b # foldr' :: (a -> b -> b) -> b -> [a] -> b # foldl :: (b -> a -> b) -> b -> [a] -> b # foldl' :: (b -> a -> b) -> b -> [a] -> b # foldr1 :: (a -> a -> a) -> [a] -> a # foldl1 :: (a -> a -> a) -> [a] -> a # elem :: Eq a => a -> [a] -> Bool # maximum :: Ord a => [a] -> a # | |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Foldable Par1 | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Par1 m -> m # foldMap :: Monoid m => (a -> m) -> Par1 a -> m # foldMap' :: Monoid m => (a -> m) -> Par1 a -> m # foldr :: (a -> b -> b) -> b -> Par1 a -> b # foldr' :: (a -> b -> b) -> b -> Par1 a -> b # foldl :: (b -> a -> b) -> b -> Par1 a -> b # foldl' :: (b -> a -> b) -> b -> Par1 a -> b # foldr1 :: (a -> a -> a) -> Par1 a -> a # foldl1 :: (a -> a -> a) -> Par1 a -> a # elem :: Eq a => a -> Par1 a -> Bool # maximum :: Ord a => Par1 a -> a # | |
| Foldable IResult | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => IResult m -> m # foldMap :: Monoid m => (a -> m) -> IResult a -> m # foldMap' :: Monoid m => (a -> m) -> IResult a -> m # foldr :: (a -> b -> b) -> b -> IResult a -> b # foldr' :: (a -> b -> b) -> b -> IResult a -> b # foldl :: (b -> a -> b) -> b -> IResult a -> b # foldl' :: (b -> a -> b) -> b -> IResult a -> b # foldr1 :: (a -> a -> a) -> IResult a -> a # foldl1 :: (a -> a -> a) -> IResult a -> a # elem :: Eq a => a -> IResult a -> Bool # maximum :: Ord a => IResult a -> a # minimum :: Ord a => IResult a -> a # | |
| Foldable Result | |
Defined in Data.Aeson.Types.Internal Methods fold :: Monoid m => Result m -> m # foldMap :: Monoid m => (a -> m) -> Result a -> m # foldMap' :: Monoid m => (a -> m) -> Result a -> m # foldr :: (a -> b -> b) -> b -> Result a -> b # foldr' :: (a -> b -> b) -> b -> Result a -> b # foldl :: (b -> a -> b) -> b -> Result a -> b # foldl' :: (b -> a -> b) -> b -> Result a -> b # foldr1 :: (a -> a -> a) -> Result a -> a # foldl1 :: (a -> a -> a) -> Result a -> a # elem :: Eq a => a -> Result a -> Bool # maximum :: Ord a => Result a -> a # minimum :: Ord a => Result a -> a # | |
| Foldable Complex | Since: base-4.9.0.0 |
Defined in Data.Complex Methods fold :: Monoid m => Complex m -> m # foldMap :: Monoid m => (a -> m) -> Complex a -> m # foldMap' :: Monoid m => (a -> m) -> Complex a -> m # foldr :: (a -> b -> b) -> b -> Complex a -> b # foldr' :: (a -> b -> b) -> b -> Complex a -> b # foldl :: (b -> a -> b) -> b -> Complex a -> b # foldl' :: (b -> a -> b) -> b -> Complex a -> b # foldr1 :: (a -> a -> a) -> Complex a -> a # foldl1 :: (a -> a -> a) -> Complex a -> a # elem :: Eq a => a -> Complex a -> Bool # maximum :: Ord a => Complex a -> a # minimum :: Ord a => Complex a -> a # | |
| Foldable Min | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Min m -> m # foldMap :: Monoid m => (a -> m) -> Min a -> m # foldMap' :: Monoid m => (a -> m) -> Min a -> m # foldr :: (a -> b -> b) -> b -> Min a -> b # foldr' :: (a -> b -> b) -> b -> Min a -> b # foldl :: (b -> a -> b) -> b -> Min a -> b # foldl' :: (b -> a -> b) -> b -> Min a -> b # foldr1 :: (a -> a -> a) -> Min a -> a # foldl1 :: (a -> a -> a) -> Min a -> a # elem :: Eq a => a -> Min a -> Bool # maximum :: Ord a => Min a -> a # | |
| Foldable Max | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Max m -> m # foldMap :: Monoid m => (a -> m) -> Max a -> m # foldMap' :: Monoid m => (a -> m) -> Max a -> m # foldr :: (a -> b -> b) -> b -> Max a -> b # foldr' :: (a -> b -> b) -> b -> Max a -> b # foldl :: (b -> a -> b) -> b -> Max a -> b # foldl' :: (b -> a -> b) -> b -> Max a -> b # foldr1 :: (a -> a -> a) -> Max a -> a # foldl1 :: (a -> a -> a) -> Max a -> a # elem :: Eq a => a -> Max a -> Bool # maximum :: Ord a => Max a -> a # | |
| Foldable First | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldMap' :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # | |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldMap' :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldMap' :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldMap' :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldMap' :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Foldable IntMap | Folds in order of increasing key. |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
| Foldable Tree | |
Defined in Data.Tree Methods fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldMap' :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Foldable FingerTree | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => FingerTree m -> m # foldMap :: Monoid m => (a -> m) -> FingerTree a -> m # foldMap' :: Monoid m => (a -> m) -> FingerTree a -> m # foldr :: (a -> b -> b) -> b -> FingerTree a -> b # foldr' :: (a -> b -> b) -> b -> FingerTree a -> b # foldl :: (b -> a -> b) -> b -> FingerTree a -> b # foldl' :: (b -> a -> b) -> b -> FingerTree a -> b # foldr1 :: (a -> a -> a) -> FingerTree a -> a # foldl1 :: (a -> a -> a) -> FingerTree a -> a # toList :: FingerTree a -> [a] # null :: FingerTree a -> Bool # length :: FingerTree a -> Int # elem :: Eq a => a -> FingerTree a -> Bool # maximum :: Ord a => FingerTree a -> a # minimum :: Ord a => FingerTree a -> a # sum :: Num a => FingerTree a -> a # product :: Num a => FingerTree a -> a # | |
| Foldable Digit | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Digit m -> m # foldMap :: Monoid m => (a -> m) -> Digit a -> m # foldMap' :: Monoid m => (a -> m) -> Digit a -> m # foldr :: (a -> b -> b) -> b -> Digit a -> b # foldr' :: (a -> b -> b) -> b -> Digit a -> b # foldl :: (b -> a -> b) -> b -> Digit a -> b # foldl' :: (b -> a -> b) -> b -> Digit a -> b # foldr1 :: (a -> a -> a) -> Digit a -> a # foldl1 :: (a -> a -> a) -> Digit a -> a # elem :: Eq a => a -> Digit a -> Bool # maximum :: Ord a => Digit a -> a # minimum :: Ord a => Digit a -> a # | |
| Foldable Node | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Node m -> m # foldMap :: Monoid m => (a -> m) -> Node a -> m # foldMap' :: Monoid m => (a -> m) -> Node a -> m # foldr :: (a -> b -> b) -> b -> Node a -> b # foldr' :: (a -> b -> b) -> b -> Node a -> b # foldl :: (b -> a -> b) -> b -> Node a -> b # foldl' :: (b -> a -> b) -> b -> Node a -> b # foldr1 :: (a -> a -> a) -> Node a -> a # foldl1 :: (a -> a -> a) -> Node a -> a # elem :: Eq a => a -> Node a -> Bool # maximum :: Ord a => Node a -> a # | |
| Foldable Elem | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Elem m -> m # foldMap :: Monoid m => (a -> m) -> Elem a -> m # foldMap' :: Monoid m => (a -> m) -> Elem a -> m # foldr :: (a -> b -> b) -> b -> Elem a -> b # foldr' :: (a -> b -> b) -> b -> Elem a -> b # foldl :: (b -> a -> b) -> b -> Elem a -> b # foldl' :: (b -> a -> b) -> b -> Elem a -> b # foldr1 :: (a -> a -> a) -> Elem a -> a # foldl1 :: (a -> a -> a) -> Elem a -> a # elem :: Eq a => a -> Elem a -> Bool # maximum :: Ord a => Elem a -> a # | |
| Foldable ViewL | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewL m -> m # foldMap :: Monoid m => (a -> m) -> ViewL a -> m # foldMap' :: Monoid m => (a -> m) -> ViewL a -> m # foldr :: (a -> b -> b) -> b -> ViewL a -> b # foldr' :: (a -> b -> b) -> b -> ViewL a -> b # foldl :: (b -> a -> b) -> b -> ViewL a -> b # foldl' :: (b -> a -> b) -> b -> ViewL a -> b # foldr1 :: (a -> a -> a) -> ViewL a -> a # foldl1 :: (a -> a -> a) -> ViewL a -> a # elem :: Eq a => a -> ViewL a -> Bool # maximum :: Ord a => ViewL a -> a # minimum :: Ord a => ViewL a -> a # | |
| Foldable ViewR | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => ViewR m -> m # foldMap :: Monoid m => (a -> m) -> ViewR a -> m # foldMap' :: Monoid m => (a -> m) -> ViewR a -> m # foldr :: (a -> b -> b) -> b -> ViewR a -> b # foldr' :: (a -> b -> b) -> b -> ViewR a -> b # foldl :: (b -> a -> b) -> b -> ViewR a -> b # foldl' :: (b -> a -> b) -> b -> ViewR a -> b # foldr1 :: (a -> a -> a) -> ViewR a -> a # foldl1 :: (a -> a -> a) -> ViewR a -> a # elem :: Eq a => a -> ViewR a -> Bool # maximum :: Ord a => ViewR a -> a # minimum :: Ord a => ViewR a -> a # | |
| Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Foldable DList | |
Defined in Data.DList Methods fold :: Monoid m => DList m -> m # foldMap :: Monoid m => (a -> m) -> DList a -> m # foldMap' :: Monoid m => (a -> m) -> DList a -> m # foldr :: (a -> b -> b) -> b -> DList a -> b # foldr' :: (a -> b -> b) -> b -> DList a -> b # foldl :: (b -> a -> b) -> b -> DList a -> b # foldl' :: (b -> a -> b) -> b -> DList a -> b # foldr1 :: (a -> a -> a) -> DList a -> a # foldl1 :: (a -> a -> a) -> DList a -> a # elem :: Eq a => a -> DList a -> Bool # maximum :: Ord a => DList a -> a # minimum :: Ord a => DList a -> a # | |
| Foldable Hashed | |
Defined in Data.Hashable.Class Methods fold :: Monoid m => Hashed m -> m # foldMap :: Monoid m => (a -> m) -> Hashed a -> m # foldMap' :: Monoid m => (a -> m) -> Hashed a -> m # foldr :: (a -> b -> b) -> b -> Hashed a -> b # foldr' :: (a -> b -> b) -> b -> Hashed a -> b # foldl :: (b -> a -> b) -> b -> Hashed a -> b # foldl' :: (b -> a -> b) -> b -> Hashed a -> b # foldr1 :: (a -> a -> a) -> Hashed a -> a # foldl1 :: (a -> a -> a) -> Hashed a -> a # elem :: Eq a => a -> Hashed a -> Bool # maximum :: Ord a => Hashed a -> a # minimum :: Ord a => Hashed a -> a # | |
| Foldable ModuleName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleName m -> m # foldMap :: Monoid m => (a -> m) -> ModuleName a -> m # foldMap' :: Monoid m => (a -> m) -> ModuleName a -> m # foldr :: (a -> b -> b) -> b -> ModuleName a -> b # foldr' :: (a -> b -> b) -> b -> ModuleName a -> b # foldl :: (b -> a -> b) -> b -> ModuleName a -> b # foldl' :: (b -> a -> b) -> b -> ModuleName a -> b # foldr1 :: (a -> a -> a) -> ModuleName a -> a # foldl1 :: (a -> a -> a) -> ModuleName a -> a # toList :: ModuleName a -> [a] # null :: ModuleName a -> Bool # length :: ModuleName a -> Int # elem :: Eq a => a -> ModuleName a -> Bool # maximum :: Ord a => ModuleName a -> a # minimum :: Ord a => ModuleName a -> a # sum :: Num a => ModuleName a -> a # product :: Num a => ModuleName a -> a # | |
| Foldable SpecialCon | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => SpecialCon m -> m # foldMap :: Monoid m => (a -> m) -> SpecialCon a -> m # foldMap' :: Monoid m => (a -> m) -> SpecialCon a -> m # foldr :: (a -> b -> b) -> b -> SpecialCon a -> b # foldr' :: (a -> b -> b) -> b -> SpecialCon a -> b # foldl :: (b -> a -> b) -> b -> SpecialCon a -> b # foldl' :: (b -> a -> b) -> b -> SpecialCon a -> b # foldr1 :: (a -> a -> a) -> SpecialCon a -> a # foldl1 :: (a -> a -> a) -> SpecialCon a -> a # toList :: SpecialCon a -> [a] # null :: SpecialCon a -> Bool # length :: SpecialCon a -> Int # elem :: Eq a => a -> SpecialCon a -> Bool # maximum :: Ord a => SpecialCon a -> a # minimum :: Ord a => SpecialCon a -> a # sum :: Num a => SpecialCon a -> a # product :: Num a => SpecialCon a -> a # | |
| Foldable QName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QName m -> m # foldMap :: Monoid m => (a -> m) -> QName a -> m # foldMap' :: Monoid m => (a -> m) -> QName a -> m # foldr :: (a -> b -> b) -> b -> QName a -> b # foldr' :: (a -> b -> b) -> b -> QName a -> b # foldl :: (b -> a -> b) -> b -> QName a -> b # foldl' :: (b -> a -> b) -> b -> QName a -> b # foldr1 :: (a -> a -> a) -> QName a -> a # foldl1 :: (a -> a -> a) -> QName a -> a # elem :: Eq a => a -> QName a -> Bool # maximum :: Ord a => QName a -> a # minimum :: Ord a => QName a -> a # | |
| Foldable Name | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Name m -> m # foldMap :: Monoid m => (a -> m) -> Name a -> m # foldMap' :: Monoid m => (a -> m) -> Name a -> m # foldr :: (a -> b -> b) -> b -> Name a -> b # foldr' :: (a -> b -> b) -> b -> Name a -> b # foldl :: (b -> a -> b) -> b -> Name a -> b # foldl' :: (b -> a -> b) -> b -> Name a -> b # foldr1 :: (a -> a -> a) -> Name a -> a # foldl1 :: (a -> a -> a) -> Name a -> a # elem :: Eq a => a -> Name a -> Bool # maximum :: Ord a => Name a -> a # | |
| Foldable IPName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPName m -> m # foldMap :: Monoid m => (a -> m) -> IPName a -> m # foldMap' :: Monoid m => (a -> m) -> IPName a -> m # foldr :: (a -> b -> b) -> b -> IPName a -> b # foldr' :: (a -> b -> b) -> b -> IPName a -> b # foldl :: (b -> a -> b) -> b -> IPName a -> b # foldl' :: (b -> a -> b) -> b -> IPName a -> b # foldr1 :: (a -> a -> a) -> IPName a -> a # foldl1 :: (a -> a -> a) -> IPName a -> a # elem :: Eq a => a -> IPName a -> Bool # maximum :: Ord a => IPName a -> a # minimum :: Ord a => IPName a -> a # | |
| Foldable QOp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QOp m -> m # foldMap :: Monoid m => (a -> m) -> QOp a -> m # foldMap' :: Monoid m => (a -> m) -> QOp a -> m # foldr :: (a -> b -> b) -> b -> QOp a -> b # foldr' :: (a -> b -> b) -> b -> QOp a -> b # foldl :: (b -> a -> b) -> b -> QOp a -> b # foldl' :: (b -> a -> b) -> b -> QOp a -> b # foldr1 :: (a -> a -> a) -> QOp a -> a # foldl1 :: (a -> a -> a) -> QOp a -> a # elem :: Eq a => a -> QOp a -> Bool # maximum :: Ord a => QOp a -> a # | |
| Foldable Op | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Op m -> m # foldMap :: Monoid m => (a -> m) -> Op a -> m # foldMap' :: Monoid m => (a -> m) -> Op a -> m # foldr :: (a -> b -> b) -> b -> Op a -> b # foldr' :: (a -> b -> b) -> b -> Op a -> b # foldl :: (b -> a -> b) -> b -> Op a -> b # foldl' :: (b -> a -> b) -> b -> Op a -> b # foldr1 :: (a -> a -> a) -> Op a -> a # foldl1 :: (a -> a -> a) -> Op a -> a # elem :: Eq a => a -> Op a -> Bool # maximum :: Ord a => Op a -> a # | |
| Foldable CName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CName m -> m # foldMap :: Monoid m => (a -> m) -> CName a -> m # foldMap' :: Monoid m => (a -> m) -> CName a -> m # foldr :: (a -> b -> b) -> b -> CName a -> b # foldr' :: (a -> b -> b) -> b -> CName a -> b # foldl :: (b -> a -> b) -> b -> CName a -> b # foldl' :: (b -> a -> b) -> b -> CName a -> b # foldr1 :: (a -> a -> a) -> CName a -> a # foldl1 :: (a -> a -> a) -> CName a -> a # elem :: Eq a => a -> CName a -> Bool # maximum :: Ord a => CName a -> a # minimum :: Ord a => CName a -> a # | |
| Foldable Module | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Module m -> m # foldMap :: Monoid m => (a -> m) -> Module a -> m # foldMap' :: Monoid m => (a -> m) -> Module a -> m # foldr :: (a -> b -> b) -> b -> Module a -> b # foldr' :: (a -> b -> b) -> b -> Module a -> b # foldl :: (b -> a -> b) -> b -> Module a -> b # foldl' :: (b -> a -> b) -> b -> Module a -> b # foldr1 :: (a -> a -> a) -> Module a -> a # foldl1 :: (a -> a -> a) -> Module a -> a # elem :: Eq a => a -> Module a -> Bool # maximum :: Ord a => Module a -> a # minimum :: Ord a => Module a -> a # | |
| Foldable ModuleHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModuleHead m -> m # foldMap :: Monoid m => (a -> m) -> ModuleHead a -> m # foldMap' :: Monoid m => (a -> m) -> ModuleHead a -> m # foldr :: (a -> b -> b) -> b -> ModuleHead a -> b # foldr' :: (a -> b -> b) -> b -> ModuleHead a -> b # foldl :: (b -> a -> b) -> b -> ModuleHead a -> b # foldl' :: (b -> a -> b) -> b -> ModuleHead a -> b # foldr1 :: (a -> a -> a) -> ModuleHead a -> a # foldl1 :: (a -> a -> a) -> ModuleHead a -> a # toList :: ModuleHead a -> [a] # null :: ModuleHead a -> Bool # length :: ModuleHead a -> Int # elem :: Eq a => a -> ModuleHead a -> Bool # maximum :: Ord a => ModuleHead a -> a # minimum :: Ord a => ModuleHead a -> a # sum :: Num a => ModuleHead a -> a # product :: Num a => ModuleHead a -> a # | |
| Foldable ExportSpecList | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpecList m -> m # foldMap :: Monoid m => (a -> m) -> ExportSpecList a -> m # foldMap' :: Monoid m => (a -> m) -> ExportSpecList a -> m # foldr :: (a -> b -> b) -> b -> ExportSpecList a -> b # foldr' :: (a -> b -> b) -> b -> ExportSpecList a -> b # foldl :: (b -> a -> b) -> b -> ExportSpecList a -> b # foldl' :: (b -> a -> b) -> b -> ExportSpecList a -> b # foldr1 :: (a -> a -> a) -> ExportSpecList a -> a # foldl1 :: (a -> a -> a) -> ExportSpecList a -> a # toList :: ExportSpecList a -> [a] # null :: ExportSpecList a -> Bool # length :: ExportSpecList a -> Int # elem :: Eq a => a -> ExportSpecList a -> Bool # maximum :: Ord a => ExportSpecList a -> a # minimum :: Ord a => ExportSpecList a -> a # sum :: Num a => ExportSpecList a -> a # product :: Num a => ExportSpecList a -> a # | |
| Foldable ExportSpec | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ExportSpec m -> m # foldMap :: Monoid m => (a -> m) -> ExportSpec a -> m # foldMap' :: Monoid m => (a -> m) -> ExportSpec a -> m # foldr :: (a -> b -> b) -> b -> ExportSpec a -> b # foldr' :: (a -> b -> b) -> b -> ExportSpec a -> b # foldl :: (b -> a -> b) -> b -> ExportSpec a -> b # foldl' :: (b -> a -> b) -> b -> ExportSpec a -> b # foldr1 :: (a -> a -> a) -> ExportSpec a -> a # foldl1 :: (a -> a -> a) -> ExportSpec a -> a # toList :: ExportSpec a -> [a] # null :: ExportSpec a -> Bool # length :: ExportSpec a -> Int # elem :: Eq a => a -> ExportSpec a -> Bool # maximum :: Ord a => ExportSpec a -> a # minimum :: Ord a => ExportSpec a -> a # sum :: Num a => ExportSpec a -> a # product :: Num a => ExportSpec a -> a # | |
| Foldable EWildcard | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => EWildcard m -> m # foldMap :: Monoid m => (a -> m) -> EWildcard a -> m # foldMap' :: Monoid m => (a -> m) -> EWildcard a -> m # foldr :: (a -> b -> b) -> b -> EWildcard a -> b # foldr' :: (a -> b -> b) -> b -> EWildcard a -> b # foldl :: (b -> a -> b) -> b -> EWildcard a -> b # foldl' :: (b -> a -> b) -> b -> EWildcard a -> b # foldr1 :: (a -> a -> a) -> EWildcard a -> a # foldl1 :: (a -> a -> a) -> EWildcard a -> a # toList :: EWildcard a -> [a] # length :: EWildcard a -> Int # elem :: Eq a => a -> EWildcard a -> Bool # maximum :: Ord a => EWildcard a -> a # minimum :: Ord a => EWildcard a -> a # | |
| Foldable Namespace | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Namespace m -> m # foldMap :: Monoid m => (a -> m) -> Namespace a -> m # foldMap' :: Monoid m => (a -> m) -> Namespace a -> m # foldr :: (a -> b -> b) -> b -> Namespace a -> b # foldr' :: (a -> b -> b) -> b -> Namespace a -> b # foldl :: (b -> a -> b) -> b -> Namespace a -> b # foldl' :: (b -> a -> b) -> b -> Namespace a -> b # foldr1 :: (a -> a -> a) -> Namespace a -> a # foldl1 :: (a -> a -> a) -> Namespace a -> a # toList :: Namespace a -> [a] # length :: Namespace a -> Int # elem :: Eq a => a -> Namespace a -> Bool # maximum :: Ord a => Namespace a -> a # minimum :: Ord a => Namespace a -> a # | |
| Foldable ImportDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportDecl m -> m # foldMap :: Monoid m => (a -> m) -> ImportDecl a -> m # foldMap' :: Monoid m => (a -> m) -> ImportDecl a -> m # foldr :: (a -> b -> b) -> b -> ImportDecl a -> b # foldr' :: (a -> b -> b) -> b -> ImportDecl a -> b # foldl :: (b -> a -> b) -> b -> ImportDecl a -> b # foldl' :: (b -> a -> b) -> b -> ImportDecl a -> b # foldr1 :: (a -> a -> a) -> ImportDecl a -> a # foldl1 :: (a -> a -> a) -> ImportDecl a -> a # toList :: ImportDecl a -> [a] # null :: ImportDecl a -> Bool # length :: ImportDecl a -> Int # elem :: Eq a => a -> ImportDecl a -> Bool # maximum :: Ord a => ImportDecl a -> a # minimum :: Ord a => ImportDecl a -> a # sum :: Num a => ImportDecl a -> a # product :: Num a => ImportDecl a -> a # | |
| Foldable ImportSpecList | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpecList m -> m # foldMap :: Monoid m => (a -> m) -> ImportSpecList a -> m # foldMap' :: Monoid m => (a -> m) -> ImportSpecList a -> m # foldr :: (a -> b -> b) -> b -> ImportSpecList a -> b # foldr' :: (a -> b -> b) -> b -> ImportSpecList a -> b # foldl :: (b -> a -> b) -> b -> ImportSpecList a -> b # foldl' :: (b -> a -> b) -> b -> ImportSpecList a -> b # foldr1 :: (a -> a -> a) -> ImportSpecList a -> a # foldl1 :: (a -> a -> a) -> ImportSpecList a -> a # toList :: ImportSpecList a -> [a] # null :: ImportSpecList a -> Bool # length :: ImportSpecList a -> Int # elem :: Eq a => a -> ImportSpecList a -> Bool # maximum :: Ord a => ImportSpecList a -> a # minimum :: Ord a => ImportSpecList a -> a # sum :: Num a => ImportSpecList a -> a # product :: Num a => ImportSpecList a -> a # | |
| Foldable ImportSpec | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ImportSpec m -> m # foldMap :: Monoid m => (a -> m) -> ImportSpec a -> m # foldMap' :: Monoid m => (a -> m) -> ImportSpec a -> m # foldr :: (a -> b -> b) -> b -> ImportSpec a -> b # foldr' :: (a -> b -> b) -> b -> ImportSpec a -> b # foldl :: (b -> a -> b) -> b -> ImportSpec a -> b # foldl' :: (b -> a -> b) -> b -> ImportSpec a -> b # foldr1 :: (a -> a -> a) -> ImportSpec a -> a # foldl1 :: (a -> a -> a) -> ImportSpec a -> a # toList :: ImportSpec a -> [a] # null :: ImportSpec a -> Bool # length :: ImportSpec a -> Int # elem :: Eq a => a -> ImportSpec a -> Bool # maximum :: Ord a => ImportSpec a -> a # minimum :: Ord a => ImportSpec a -> a # sum :: Num a => ImportSpec a -> a # product :: Num a => ImportSpec a -> a # | |
| Foldable Assoc | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Assoc m -> m # foldMap :: Monoid m => (a -> m) -> Assoc a -> m # foldMap' :: Monoid m => (a -> m) -> Assoc a -> m # foldr :: (a -> b -> b) -> b -> Assoc a -> b # foldr' :: (a -> b -> b) -> b -> Assoc a -> b # foldl :: (b -> a -> b) -> b -> Assoc a -> b # foldl' :: (b -> a -> b) -> b -> Assoc a -> b # foldr1 :: (a -> a -> a) -> Assoc a -> a # foldl1 :: (a -> a -> a) -> Assoc a -> a # elem :: Eq a => a -> Assoc a -> Bool # maximum :: Ord a => Assoc a -> a # minimum :: Ord a => Assoc a -> a # | |
| Foldable Decl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Decl m -> m # foldMap :: Monoid m => (a -> m) -> Decl a -> m # foldMap' :: Monoid m => (a -> m) -> Decl a -> m # foldr :: (a -> b -> b) -> b -> Decl a -> b # foldr' :: (a -> b -> b) -> b -> Decl a -> b # foldl :: (b -> a -> b) -> b -> Decl a -> b # foldl' :: (b -> a -> b) -> b -> Decl a -> b # foldr1 :: (a -> a -> a) -> Decl a -> a # foldl1 :: (a -> a -> a) -> Decl a -> a # elem :: Eq a => a -> Decl a -> Bool # maximum :: Ord a => Decl a -> a # | |
| Foldable PatternSynDirection | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatternSynDirection m -> m # foldMap :: Monoid m => (a -> m) -> PatternSynDirection a -> m # foldMap' :: Monoid m => (a -> m) -> PatternSynDirection a -> m # foldr :: (a -> b -> b) -> b -> PatternSynDirection a -> b # foldr' :: (a -> b -> b) -> b -> PatternSynDirection a -> b # foldl :: (b -> a -> b) -> b -> PatternSynDirection a -> b # foldl' :: (b -> a -> b) -> b -> PatternSynDirection a -> b # foldr1 :: (a -> a -> a) -> PatternSynDirection a -> a # foldl1 :: (a -> a -> a) -> PatternSynDirection a -> a # toList :: PatternSynDirection a -> [a] # null :: PatternSynDirection a -> Bool # length :: PatternSynDirection a -> Int # elem :: Eq a => a -> PatternSynDirection a -> Bool # maximum :: Ord a => PatternSynDirection a -> a # minimum :: Ord a => PatternSynDirection a -> a # sum :: Num a => PatternSynDirection a -> a # product :: Num a => PatternSynDirection a -> a # | |
| Foldable TypeEqn | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TypeEqn m -> m # foldMap :: Monoid m => (a -> m) -> TypeEqn a -> m # foldMap' :: Monoid m => (a -> m) -> TypeEqn a -> m # foldr :: (a -> b -> b) -> b -> TypeEqn a -> b # foldr' :: (a -> b -> b) -> b -> TypeEqn a -> b # foldl :: (b -> a -> b) -> b -> TypeEqn a -> b # foldl' :: (b -> a -> b) -> b -> TypeEqn a -> b # foldr1 :: (a -> a -> a) -> TypeEqn a -> a # foldl1 :: (a -> a -> a) -> TypeEqn a -> a # elem :: Eq a => a -> TypeEqn a -> Bool # maximum :: Ord a => TypeEqn a -> a # minimum :: Ord a => TypeEqn a -> a # | |
| Foldable Annotation | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Annotation m -> m # foldMap :: Monoid m => (a -> m) -> Annotation a -> m # foldMap' :: Monoid m => (a -> m) -> Annotation a -> m # foldr :: (a -> b -> b) -> b -> Annotation a -> b # foldr' :: (a -> b -> b) -> b -> Annotation a -> b # foldl :: (b -> a -> b) -> b -> Annotation a -> b # foldl' :: (b -> a -> b) -> b -> Annotation a -> b # foldr1 :: (a -> a -> a) -> Annotation a -> a # foldl1 :: (a -> a -> a) -> Annotation a -> a # toList :: Annotation a -> [a] # null :: Annotation a -> Bool # length :: Annotation a -> Int # elem :: Eq a => a -> Annotation a -> Bool # maximum :: Ord a => Annotation a -> a # minimum :: Ord a => Annotation a -> a # sum :: Num a => Annotation a -> a # product :: Num a => Annotation a -> a # | |
| Foldable BooleanFormula | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BooleanFormula m -> m # foldMap :: Monoid m => (a -> m) -> BooleanFormula a -> m # foldMap' :: Monoid m => (a -> m) -> BooleanFormula a -> m # foldr :: (a -> b -> b) -> b -> BooleanFormula a -> b # foldr' :: (a -> b -> b) -> b -> BooleanFormula a -> b # foldl :: (b -> a -> b) -> b -> BooleanFormula a -> b # foldl' :: (b -> a -> b) -> b -> BooleanFormula a -> b # foldr1 :: (a -> a -> a) -> BooleanFormula a -> a # foldl1 :: (a -> a -> a) -> BooleanFormula a -> a # toList :: BooleanFormula a -> [a] # null :: BooleanFormula a -> Bool # length :: BooleanFormula a -> Int # elem :: Eq a => a -> BooleanFormula a -> Bool # maximum :: Ord a => BooleanFormula a -> a # minimum :: Ord a => BooleanFormula a -> a # sum :: Num a => BooleanFormula a -> a # product :: Num a => BooleanFormula a -> a # | |
| Foldable Role | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Role m -> m # foldMap :: Monoid m => (a -> m) -> Role a -> m # foldMap' :: Monoid m => (a -> m) -> Role a -> m # foldr :: (a -> b -> b) -> b -> Role a -> b # foldr' :: (a -> b -> b) -> b -> Role a -> b # foldl :: (b -> a -> b) -> b -> Role a -> b # foldl' :: (b -> a -> b) -> b -> Role a -> b # foldr1 :: (a -> a -> a) -> Role a -> a # foldl1 :: (a -> a -> a) -> Role a -> a # elem :: Eq a => a -> Role a -> Bool # maximum :: Ord a => Role a -> a # | |
| Foldable DataOrNew | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DataOrNew m -> m # foldMap :: Monoid m => (a -> m) -> DataOrNew a -> m # foldMap' :: Monoid m => (a -> m) -> DataOrNew a -> m # foldr :: (a -> b -> b) -> b -> DataOrNew a -> b # foldr' :: (a -> b -> b) -> b -> DataOrNew a -> b # foldl :: (b -> a -> b) -> b -> DataOrNew a -> b # foldl' :: (b -> a -> b) -> b -> DataOrNew a -> b # foldr1 :: (a -> a -> a) -> DataOrNew a -> a # foldl1 :: (a -> a -> a) -> DataOrNew a -> a # toList :: DataOrNew a -> [a] # length :: DataOrNew a -> Int # elem :: Eq a => a -> DataOrNew a -> Bool # maximum :: Ord a => DataOrNew a -> a # minimum :: Ord a => DataOrNew a -> a # | |
| Foldable InjectivityInfo | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InjectivityInfo m -> m # foldMap :: Monoid m => (a -> m) -> InjectivityInfo a -> m # foldMap' :: Monoid m => (a -> m) -> InjectivityInfo a -> m # foldr :: (a -> b -> b) -> b -> InjectivityInfo a -> b # foldr' :: (a -> b -> b) -> b -> InjectivityInfo a -> b # foldl :: (b -> a -> b) -> b -> InjectivityInfo a -> b # foldl' :: (b -> a -> b) -> b -> InjectivityInfo a -> b # foldr1 :: (a -> a -> a) -> InjectivityInfo a -> a # foldl1 :: (a -> a -> a) -> InjectivityInfo a -> a # toList :: InjectivityInfo a -> [a] # null :: InjectivityInfo a -> Bool # length :: InjectivityInfo a -> Int # elem :: Eq a => a -> InjectivityInfo a -> Bool # maximum :: Ord a => InjectivityInfo a -> a # minimum :: Ord a => InjectivityInfo a -> a # sum :: Num a => InjectivityInfo a -> a # product :: Num a => InjectivityInfo a -> a # | |
| Foldable ResultSig | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ResultSig m -> m # foldMap :: Monoid m => (a -> m) -> ResultSig a -> m # foldMap' :: Monoid m => (a -> m) -> ResultSig a -> m # foldr :: (a -> b -> b) -> b -> ResultSig a -> b # foldr' :: (a -> b -> b) -> b -> ResultSig a -> b # foldl :: (b -> a -> b) -> b -> ResultSig a -> b # foldl' :: (b -> a -> b) -> b -> ResultSig a -> b # foldr1 :: (a -> a -> a) -> ResultSig a -> a # foldl1 :: (a -> a -> a) -> ResultSig a -> a # toList :: ResultSig a -> [a] # length :: ResultSig a -> Int # elem :: Eq a => a -> ResultSig a -> Bool # maximum :: Ord a => ResultSig a -> a # minimum :: Ord a => ResultSig a -> a # | |
| Foldable DeclHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DeclHead m -> m # foldMap :: Monoid m => (a -> m) -> DeclHead a -> m # foldMap' :: Monoid m => (a -> m) -> DeclHead a -> m # foldr :: (a -> b -> b) -> b -> DeclHead a -> b # foldr' :: (a -> b -> b) -> b -> DeclHead a -> b # foldl :: (b -> a -> b) -> b -> DeclHead a -> b # foldl' :: (b -> a -> b) -> b -> DeclHead a -> b # foldr1 :: (a -> a -> a) -> DeclHead a -> a # foldl1 :: (a -> a -> a) -> DeclHead a -> a # elem :: Eq a => a -> DeclHead a -> Bool # maximum :: Ord a => DeclHead a -> a # minimum :: Ord a => DeclHead a -> a # | |
| Foldable InstRule | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstRule m -> m # foldMap :: Monoid m => (a -> m) -> InstRule a -> m # foldMap' :: Monoid m => (a -> m) -> InstRule a -> m # foldr :: (a -> b -> b) -> b -> InstRule a -> b # foldr' :: (a -> b -> b) -> b -> InstRule a -> b # foldl :: (b -> a -> b) -> b -> InstRule a -> b # foldl' :: (b -> a -> b) -> b -> InstRule a -> b # foldr1 :: (a -> a -> a) -> InstRule a -> a # foldl1 :: (a -> a -> a) -> InstRule a -> a # elem :: Eq a => a -> InstRule a -> Bool # maximum :: Ord a => InstRule a -> a # minimum :: Ord a => InstRule a -> a # | |
| Foldable InstHead | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstHead m -> m # foldMap :: Monoid m => (a -> m) -> InstHead a -> m # foldMap' :: Monoid m => (a -> m) -> InstHead a -> m # foldr :: (a -> b -> b) -> b -> InstHead a -> b # foldr' :: (a -> b -> b) -> b -> InstHead a -> b # foldl :: (b -> a -> b) -> b -> InstHead a -> b # foldl' :: (b -> a -> b) -> b -> InstHead a -> b # foldr1 :: (a -> a -> a) -> InstHead a -> a # foldl1 :: (a -> a -> a) -> InstHead a -> a # elem :: Eq a => a -> InstHead a -> Bool # maximum :: Ord a => InstHead a -> a # minimum :: Ord a => InstHead a -> a # | |
| Foldable Deriving | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Deriving m -> m # foldMap :: Monoid m => (a -> m) -> Deriving a -> m # foldMap' :: Monoid m => (a -> m) -> Deriving a -> m # foldr :: (a -> b -> b) -> b -> Deriving a -> b # foldr' :: (a -> b -> b) -> b -> Deriving a -> b # foldl :: (b -> a -> b) -> b -> Deriving a -> b # foldl' :: (b -> a -> b) -> b -> Deriving a -> b # foldr1 :: (a -> a -> a) -> Deriving a -> a # foldl1 :: (a -> a -> a) -> Deriving a -> a # elem :: Eq a => a -> Deriving a -> Bool # maximum :: Ord a => Deriving a -> a # minimum :: Ord a => Deriving a -> a # | |
| Foldable DerivStrategy | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => DerivStrategy m -> m # foldMap :: Monoid m => (a -> m) -> DerivStrategy a -> m # foldMap' :: Monoid m => (a -> m) -> DerivStrategy a -> m # foldr :: (a -> b -> b) -> b -> DerivStrategy a -> b # foldr' :: (a -> b -> b) -> b -> DerivStrategy a -> b # foldl :: (b -> a -> b) -> b -> DerivStrategy a -> b # foldl' :: (b -> a -> b) -> b -> DerivStrategy a -> b # foldr1 :: (a -> a -> a) -> DerivStrategy a -> a # foldl1 :: (a -> a -> a) -> DerivStrategy a -> a # toList :: DerivStrategy a -> [a] # null :: DerivStrategy a -> Bool # length :: DerivStrategy a -> Int # elem :: Eq a => a -> DerivStrategy a -> Bool # maximum :: Ord a => DerivStrategy a -> a # minimum :: Ord a => DerivStrategy a -> a # sum :: Num a => DerivStrategy a -> a # product :: Num a => DerivStrategy a -> a # | |
| Foldable Binds | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Binds m -> m # foldMap :: Monoid m => (a -> m) -> Binds a -> m # foldMap' :: Monoid m => (a -> m) -> Binds a -> m # foldr :: (a -> b -> b) -> b -> Binds a -> b # foldr' :: (a -> b -> b) -> b -> Binds a -> b # foldl :: (b -> a -> b) -> b -> Binds a -> b # foldl' :: (b -> a -> b) -> b -> Binds a -> b # foldr1 :: (a -> a -> a) -> Binds a -> a # foldl1 :: (a -> a -> a) -> Binds a -> a # elem :: Eq a => a -> Binds a -> Bool # maximum :: Ord a => Binds a -> a # minimum :: Ord a => Binds a -> a # | |
| Foldable IPBind | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => IPBind m -> m # foldMap :: Monoid m => (a -> m) -> IPBind a -> m # foldMap' :: Monoid m => (a -> m) -> IPBind a -> m # foldr :: (a -> b -> b) -> b -> IPBind a -> b # foldr' :: (a -> b -> b) -> b -> IPBind a -> b # foldl :: (b -> a -> b) -> b -> IPBind a -> b # foldl' :: (b -> a -> b) -> b -> IPBind a -> b # foldr1 :: (a -> a -> a) -> IPBind a -> a # foldl1 :: (a -> a -> a) -> IPBind a -> a # elem :: Eq a => a -> IPBind a -> Bool # maximum :: Ord a => IPBind a -> a # minimum :: Ord a => IPBind a -> a # | |
| Foldable Match | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Match m -> m # foldMap :: Monoid m => (a -> m) -> Match a -> m # foldMap' :: Monoid m => (a -> m) -> Match a -> m # foldr :: (a -> b -> b) -> b -> Match a -> b # foldr' :: (a -> b -> b) -> b -> Match a -> b # foldl :: (b -> a -> b) -> b -> Match a -> b # foldl' :: (b -> a -> b) -> b -> Match a -> b # foldr1 :: (a -> a -> a) -> Match a -> a # foldl1 :: (a -> a -> a) -> Match a -> a # elem :: Eq a => a -> Match a -> Bool # maximum :: Ord a => Match a -> a # minimum :: Ord a => Match a -> a # | |
| Foldable QualConDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualConDecl m -> m # foldMap :: Monoid m => (a -> m) -> QualConDecl a -> m # foldMap' :: Monoid m => (a -> m) -> QualConDecl a -> m # foldr :: (a -> b -> b) -> b -> QualConDecl a -> b # foldr' :: (a -> b -> b) -> b -> QualConDecl a -> b # foldl :: (b -> a -> b) -> b -> QualConDecl a -> b # foldl' :: (b -> a -> b) -> b -> QualConDecl a -> b # foldr1 :: (a -> a -> a) -> QualConDecl a -> a # foldl1 :: (a -> a -> a) -> QualConDecl a -> a # toList :: QualConDecl a -> [a] # null :: QualConDecl a -> Bool # length :: QualConDecl a -> Int # elem :: Eq a => a -> QualConDecl a -> Bool # maximum :: Ord a => QualConDecl a -> a # minimum :: Ord a => QualConDecl a -> a # sum :: Num a => QualConDecl a -> a # product :: Num a => QualConDecl a -> a # | |
| Foldable ConDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ConDecl m -> m # foldMap :: Monoid m => (a -> m) -> ConDecl a -> m # foldMap' :: Monoid m => (a -> m) -> ConDecl a -> m # foldr :: (a -> b -> b) -> b -> ConDecl a -> b # foldr' :: (a -> b -> b) -> b -> ConDecl a -> b # foldl :: (b -> a -> b) -> b -> ConDecl a -> b # foldl' :: (b -> a -> b) -> b -> ConDecl a -> b # foldr1 :: (a -> a -> a) -> ConDecl a -> a # foldl1 :: (a -> a -> a) -> ConDecl a -> a # elem :: Eq a => a -> ConDecl a -> Bool # maximum :: Ord a => ConDecl a -> a # minimum :: Ord a => ConDecl a -> a # | |
| Foldable FieldDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldDecl m -> m # foldMap :: Monoid m => (a -> m) -> FieldDecl a -> m # foldMap' :: Monoid m => (a -> m) -> FieldDecl a -> m # foldr :: (a -> b -> b) -> b -> FieldDecl a -> b # foldr' :: (a -> b -> b) -> b -> FieldDecl a -> b # foldl :: (b -> a -> b) -> b -> FieldDecl a -> b # foldl' :: (b -> a -> b) -> b -> FieldDecl a -> b # foldr1 :: (a -> a -> a) -> FieldDecl a -> a # foldl1 :: (a -> a -> a) -> FieldDecl a -> a # toList :: FieldDecl a -> [a] # length :: FieldDecl a -> Int # elem :: Eq a => a -> FieldDecl a -> Bool # maximum :: Ord a => FieldDecl a -> a # minimum :: Ord a => FieldDecl a -> a # | |
| Foldable GadtDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GadtDecl m -> m # foldMap :: Monoid m => (a -> m) -> GadtDecl a -> m # foldMap' :: Monoid m => (a -> m) -> GadtDecl a -> m # foldr :: (a -> b -> b) -> b -> GadtDecl a -> b # foldr' :: (a -> b -> b) -> b -> GadtDecl a -> b # foldl :: (b -> a -> b) -> b -> GadtDecl a -> b # foldl' :: (b -> a -> b) -> b -> GadtDecl a -> b # foldr1 :: (a -> a -> a) -> GadtDecl a -> a # foldl1 :: (a -> a -> a) -> GadtDecl a -> a # elem :: Eq a => a -> GadtDecl a -> Bool # maximum :: Ord a => GadtDecl a -> a # minimum :: Ord a => GadtDecl a -> a # | |
| Foldable ClassDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ClassDecl m -> m # foldMap :: Monoid m => (a -> m) -> ClassDecl a -> m # foldMap' :: Monoid m => (a -> m) -> ClassDecl a -> m # foldr :: (a -> b -> b) -> b -> ClassDecl a -> b # foldr' :: (a -> b -> b) -> b -> ClassDecl a -> b # foldl :: (b -> a -> b) -> b -> ClassDecl a -> b # foldl' :: (b -> a -> b) -> b -> ClassDecl a -> b # foldr1 :: (a -> a -> a) -> ClassDecl a -> a # foldl1 :: (a -> a -> a) -> ClassDecl a -> a # toList :: ClassDecl a -> [a] # length :: ClassDecl a -> Int # elem :: Eq a => a -> ClassDecl a -> Bool # maximum :: Ord a => ClassDecl a -> a # minimum :: Ord a => ClassDecl a -> a # | |
| Foldable InstDecl | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => InstDecl m -> m # foldMap :: Monoid m => (a -> m) -> InstDecl a -> m # foldMap' :: Monoid m => (a -> m) -> InstDecl a -> m # foldr :: (a -> b -> b) -> b -> InstDecl a -> b # foldr' :: (a -> b -> b) -> b -> InstDecl a -> b # foldl :: (b -> a -> b) -> b -> InstDecl a -> b # foldl' :: (b -> a -> b) -> b -> InstDecl a -> b # foldr1 :: (a -> a -> a) -> InstDecl a -> a # foldl1 :: (a -> a -> a) -> InstDecl a -> a # elem :: Eq a => a -> InstDecl a -> Bool # maximum :: Ord a => InstDecl a -> a # minimum :: Ord a => InstDecl a -> a # | |
| Foldable BangType | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => BangType m -> m # foldMap :: Monoid m => (a -> m) -> BangType a -> m # foldMap' :: Monoid m => (a -> m) -> BangType a -> m # foldr :: (a -> b -> b) -> b -> BangType a -> b # foldr' :: (a -> b -> b) -> b -> BangType a -> b # foldl :: (b -> a -> b) -> b -> BangType a -> b # foldl' :: (b -> a -> b) -> b -> BangType a -> b # foldr1 :: (a -> a -> a) -> BangType a -> a # foldl1 :: (a -> a -> a) -> BangType a -> a # elem :: Eq a => a -> BangType a -> Bool # maximum :: Ord a => BangType a -> a # minimum :: Ord a => BangType a -> a # | |
| Foldable Unpackedness | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Unpackedness m -> m # foldMap :: Monoid m => (a -> m) -> Unpackedness a -> m # foldMap' :: Monoid m => (a -> m) -> Unpackedness a -> m # foldr :: (a -> b -> b) -> b -> Unpackedness a -> b # foldr' :: (a -> b -> b) -> b -> Unpackedness a -> b # foldl :: (b -> a -> b) -> b -> Unpackedness a -> b # foldl' :: (b -> a -> b) -> b -> Unpackedness a -> b # foldr1 :: (a -> a -> a) -> Unpackedness a -> a # foldl1 :: (a -> a -> a) -> Unpackedness a -> a # toList :: Unpackedness a -> [a] # null :: Unpackedness a -> Bool # length :: Unpackedness a -> Int # elem :: Eq a => a -> Unpackedness a -> Bool # maximum :: Ord a => Unpackedness a -> a # minimum :: Ord a => Unpackedness a -> a # sum :: Num a => Unpackedness a -> a # product :: Num a => Unpackedness a -> a # | |
| Foldable Rhs | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rhs m -> m # foldMap :: Monoid m => (a -> m) -> Rhs a -> m # foldMap' :: Monoid m => (a -> m) -> Rhs a -> m # foldr :: (a -> b -> b) -> b -> Rhs a -> b # foldr' :: (a -> b -> b) -> b -> Rhs a -> b # foldl :: (b -> a -> b) -> b -> Rhs a -> b # foldl' :: (b -> a -> b) -> b -> Rhs a -> b # foldr1 :: (a -> a -> a) -> Rhs a -> a # foldl1 :: (a -> a -> a) -> Rhs a -> a # elem :: Eq a => a -> Rhs a -> Bool # maximum :: Ord a => Rhs a -> a # | |
| Foldable GuardedRhs | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => GuardedRhs m -> m # foldMap :: Monoid m => (a -> m) -> GuardedRhs a -> m # foldMap' :: Monoid m => (a -> m) -> GuardedRhs a -> m # foldr :: (a -> b -> b) -> b -> GuardedRhs a -> b # foldr' :: (a -> b -> b) -> b -> GuardedRhs a -> b # foldl :: (b -> a -> b) -> b -> GuardedRhs a -> b # foldl' :: (b -> a -> b) -> b -> GuardedRhs a -> b # foldr1 :: (a -> a -> a) -> GuardedRhs a -> a # foldl1 :: (a -> a -> a) -> GuardedRhs a -> a # toList :: GuardedRhs a -> [a] # null :: GuardedRhs a -> Bool # length :: GuardedRhs a -> Int # elem :: Eq a => a -> GuardedRhs a -> Bool # maximum :: Ord a => GuardedRhs a -> a # minimum :: Ord a => GuardedRhs a -> a # sum :: Num a => GuardedRhs a -> a # product :: Num a => GuardedRhs a -> a # | |
| Foldable Type | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Type m -> m # foldMap :: Monoid m => (a -> m) -> Type a -> m # foldMap' :: Monoid m => (a -> m) -> Type a -> m # foldr :: (a -> b -> b) -> b -> Type a -> b # foldr' :: (a -> b -> b) -> b -> Type a -> b # foldl :: (b -> a -> b) -> b -> Type a -> b # foldl' :: (b -> a -> b) -> b -> Type a -> b # foldr1 :: (a -> a -> a) -> Type a -> a # foldl1 :: (a -> a -> a) -> Type a -> a # elem :: Eq a => a -> Type a -> Bool # maximum :: Ord a => Type a -> a # | |
| Foldable MaybePromotedName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => MaybePromotedName m -> m # foldMap :: Monoid m => (a -> m) -> MaybePromotedName a -> m # foldMap' :: Monoid m => (a -> m) -> MaybePromotedName a -> m # foldr :: (a -> b -> b) -> b -> MaybePromotedName a -> b # foldr' :: (a -> b -> b) -> b -> MaybePromotedName a -> b # foldl :: (b -> a -> b) -> b -> MaybePromotedName a -> b # foldl' :: (b -> a -> b) -> b -> MaybePromotedName a -> b # foldr1 :: (a -> a -> a) -> MaybePromotedName a -> a # foldl1 :: (a -> a -> a) -> MaybePromotedName a -> a # toList :: MaybePromotedName a -> [a] # null :: MaybePromotedName a -> Bool # length :: MaybePromotedName a -> Int # elem :: Eq a => a -> MaybePromotedName a -> Bool # maximum :: Ord a => MaybePromotedName a -> a # minimum :: Ord a => MaybePromotedName a -> a # sum :: Num a => MaybePromotedName a -> a # product :: Num a => MaybePromotedName a -> a # | |
| Foldable Promoted | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Promoted m -> m # foldMap :: Monoid m => (a -> m) -> Promoted a -> m # foldMap' :: Monoid m => (a -> m) -> Promoted a -> m # foldr :: (a -> b -> b) -> b -> Promoted a -> b # foldr' :: (a -> b -> b) -> b -> Promoted a -> b # foldl :: (b -> a -> b) -> b -> Promoted a -> b # foldl' :: (b -> a -> b) -> b -> Promoted a -> b # foldr1 :: (a -> a -> a) -> Promoted a -> a # foldl1 :: (a -> a -> a) -> Promoted a -> a # elem :: Eq a => a -> Promoted a -> Bool # maximum :: Ord a => Promoted a -> a # minimum :: Ord a => Promoted a -> a # | |
| Foldable TyVarBind | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => TyVarBind m -> m # foldMap :: Monoid m => (a -> m) -> TyVarBind a -> m # foldMap' :: Monoid m => (a -> m) -> TyVarBind a -> m # foldr :: (a -> b -> b) -> b -> TyVarBind a -> b # foldr' :: (a -> b -> b) -> b -> TyVarBind a -> b # foldl :: (b -> a -> b) -> b -> TyVarBind a -> b # foldl' :: (b -> a -> b) -> b -> TyVarBind a -> b # foldr1 :: (a -> a -> a) -> TyVarBind a -> a # foldl1 :: (a -> a -> a) -> TyVarBind a -> a # toList :: TyVarBind a -> [a] # length :: TyVarBind a -> Int # elem :: Eq a => a -> TyVarBind a -> Bool # maximum :: Ord a => TyVarBind a -> a # minimum :: Ord a => TyVarBind a -> a # | |
| Foldable FunDep | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FunDep m -> m # foldMap :: Monoid m => (a -> m) -> FunDep a -> m # foldMap' :: Monoid m => (a -> m) -> FunDep a -> m # foldr :: (a -> b -> b) -> b -> FunDep a -> b # foldr' :: (a -> b -> b) -> b -> FunDep a -> b # foldl :: (b -> a -> b) -> b -> FunDep a -> b # foldl' :: (b -> a -> b) -> b -> FunDep a -> b # foldr1 :: (a -> a -> a) -> FunDep a -> a # foldl1 :: (a -> a -> a) -> FunDep a -> a # elem :: Eq a => a -> FunDep a -> Bool # maximum :: Ord a => FunDep a -> a # minimum :: Ord a => FunDep a -> a # | |
| Foldable Context | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Context m -> m # foldMap :: Monoid m => (a -> m) -> Context a -> m # foldMap' :: Monoid m => (a -> m) -> Context a -> m # foldr :: (a -> b -> b) -> b -> Context a -> b # foldr' :: (a -> b -> b) -> b -> Context a -> b # foldl :: (b -> a -> b) -> b -> Context a -> b # foldl' :: (b -> a -> b) -> b -> Context a -> b # foldr1 :: (a -> a -> a) -> Context a -> a # foldl1 :: (a -> a -> a) -> Context a -> a # elem :: Eq a => a -> Context a -> Bool # maximum :: Ord a => Context a -> a # minimum :: Ord a => Context a -> a # | |
| Foldable Asst | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Asst m -> m # foldMap :: Monoid m => (a -> m) -> Asst a -> m # foldMap' :: Monoid m => (a -> m) -> Asst a -> m # foldr :: (a -> b -> b) -> b -> Asst a -> b # foldr' :: (a -> b -> b) -> b -> Asst a -> b # foldl :: (b -> a -> b) -> b -> Asst a -> b # foldl' :: (b -> a -> b) -> b -> Asst a -> b # foldr1 :: (a -> a -> a) -> Asst a -> a # foldl1 :: (a -> a -> a) -> Asst a -> a # elem :: Eq a => a -> Asst a -> Bool # maximum :: Ord a => Asst a -> a # | |
| Foldable Literal | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Literal m -> m # foldMap :: Monoid m => (a -> m) -> Literal a -> m # foldMap' :: Monoid m => (a -> m) -> Literal a -> m # foldr :: (a -> b -> b) -> b -> Literal a -> b # foldr' :: (a -> b -> b) -> b -> Literal a -> b # foldl :: (b -> a -> b) -> b -> Literal a -> b # foldl' :: (b -> a -> b) -> b -> Literal a -> b # foldr1 :: (a -> a -> a) -> Literal a -> a # foldl1 :: (a -> a -> a) -> Literal a -> a # elem :: Eq a => a -> Literal a -> Bool # maximum :: Ord a => Literal a -> a # minimum :: Ord a => Literal a -> a # | |
| Foldable Sign | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Sign m -> m # foldMap :: Monoid m => (a -> m) -> Sign a -> m # foldMap' :: Monoid m => (a -> m) -> Sign a -> m # foldr :: (a -> b -> b) -> b -> Sign a -> b # foldr' :: (a -> b -> b) -> b -> Sign a -> b # foldl :: (b -> a -> b) -> b -> Sign a -> b # foldl' :: (b -> a -> b) -> b -> Sign a -> b # foldr1 :: (a -> a -> a) -> Sign a -> a # foldl1 :: (a -> a -> a) -> Sign a -> a # elem :: Eq a => a -> Sign a -> Bool # maximum :: Ord a => Sign a -> a # | |
| Foldable Exp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Exp m -> m # foldMap :: Monoid m => (a -> m) -> Exp a -> m # foldMap' :: Monoid m => (a -> m) -> Exp a -> m # foldr :: (a -> b -> b) -> b -> Exp a -> b # foldr' :: (a -> b -> b) -> b -> Exp a -> b # foldl :: (b -> a -> b) -> b -> Exp a -> b # foldl' :: (b -> a -> b) -> b -> Exp a -> b # foldr1 :: (a -> a -> a) -> Exp a -> a # foldl1 :: (a -> a -> a) -> Exp a -> a # elem :: Eq a => a -> Exp a -> Bool # maximum :: Ord a => Exp a -> a # | |
| Foldable XName | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XName m -> m # foldMap :: Monoid m => (a -> m) -> XName a -> m # foldMap' :: Monoid m => (a -> m) -> XName a -> m # foldr :: (a -> b -> b) -> b -> XName a -> b # foldr' :: (a -> b -> b) -> b -> XName a -> b # foldl :: (b -> a -> b) -> b -> XName a -> b # foldl' :: (b -> a -> b) -> b -> XName a -> b # foldr1 :: (a -> a -> a) -> XName a -> a # foldl1 :: (a -> a -> a) -> XName a -> a # elem :: Eq a => a -> XName a -> Bool # maximum :: Ord a => XName a -> a # minimum :: Ord a => XName a -> a # | |
| Foldable XAttr | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => XAttr m -> m # foldMap :: Monoid m => (a -> m) -> XAttr a -> m # foldMap' :: Monoid m => (a -> m) -> XAttr a -> m # foldr :: (a -> b -> b) -> b -> XAttr a -> b # foldr' :: (a -> b -> b) -> b -> XAttr a -> b # foldl :: (b -> a -> b) -> b -> XAttr a -> b # foldl' :: (b -> a -> b) -> b -> XAttr a -> b # foldr1 :: (a -> a -> a) -> XAttr a -> a # foldl1 :: (a -> a -> a) -> XAttr a -> a # elem :: Eq a => a -> XAttr a -> Bool # maximum :: Ord a => XAttr a -> a # minimum :: Ord a => XAttr a -> a # | |
| Foldable Bracket | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Bracket m -> m # foldMap :: Monoid m => (a -> m) -> Bracket a -> m # foldMap' :: Monoid m => (a -> m) -> Bracket a -> m # foldr :: (a -> b -> b) -> b -> Bracket a -> b # foldr' :: (a -> b -> b) -> b -> Bracket a -> b # foldl :: (b -> a -> b) -> b -> Bracket a -> b # foldl' :: (b -> a -> b) -> b -> Bracket a -> b # foldr1 :: (a -> a -> a) -> Bracket a -> a # foldl1 :: (a -> a -> a) -> Bracket a -> a # elem :: Eq a => a -> Bracket a -> Bool # maximum :: Ord a => Bracket a -> a # minimum :: Ord a => Bracket a -> a # | |
| Foldable Splice | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Splice m -> m # foldMap :: Monoid m => (a -> m) -> Splice a -> m # foldMap' :: Monoid m => (a -> m) -> Splice a -> m # foldr :: (a -> b -> b) -> b -> Splice a -> b # foldr' :: (a -> b -> b) -> b -> Splice a -> b # foldl :: (b -> a -> b) -> b -> Splice a -> b # foldl' :: (b -> a -> b) -> b -> Splice a -> b # foldr1 :: (a -> a -> a) -> Splice a -> a # foldl1 :: (a -> a -> a) -> Splice a -> a # elem :: Eq a => a -> Splice a -> Bool # maximum :: Ord a => Splice a -> a # minimum :: Ord a => Splice a -> a # | |
| Foldable Safety | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Safety m -> m # foldMap :: Monoid m => (a -> m) -> Safety a -> m # foldMap' :: Monoid m => (a -> m) -> Safety a -> m # foldr :: (a -> b -> b) -> b -> Safety a -> b # foldr' :: (a -> b -> b) -> b -> Safety a -> b # foldl :: (b -> a -> b) -> b -> Safety a -> b # foldl' :: (b -> a -> b) -> b -> Safety a -> b # foldr1 :: (a -> a -> a) -> Safety a -> a # foldl1 :: (a -> a -> a) -> Safety a -> a # elem :: Eq a => a -> Safety a -> Bool # maximum :: Ord a => Safety a -> a # minimum :: Ord a => Safety a -> a # | |
| Foldable CallConv | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => CallConv m -> m # foldMap :: Monoid m => (a -> m) -> CallConv a -> m # foldMap' :: Monoid m => (a -> m) -> CallConv a -> m # foldr :: (a -> b -> b) -> b -> CallConv a -> b # foldr' :: (a -> b -> b) -> b -> CallConv a -> b # foldl :: (b -> a -> b) -> b -> CallConv a -> b # foldl' :: (b -> a -> b) -> b -> CallConv a -> b # foldr1 :: (a -> a -> a) -> CallConv a -> a # foldl1 :: (a -> a -> a) -> CallConv a -> a # elem :: Eq a => a -> CallConv a -> Bool # maximum :: Ord a => CallConv a -> a # minimum :: Ord a => CallConv a -> a # | |
| Foldable ModulePragma | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => ModulePragma m -> m # foldMap :: Monoid m => (a -> m) -> ModulePragma a -> m # foldMap' :: Monoid m => (a -> m) -> ModulePragma a -> m # foldr :: (a -> b -> b) -> b -> ModulePragma a -> b # foldr' :: (a -> b -> b) -> b -> ModulePragma a -> b # foldl :: (b -> a -> b) -> b -> ModulePragma a -> b # foldl' :: (b -> a -> b) -> b -> ModulePragma a -> b # foldr1 :: (a -> a -> a) -> ModulePragma a -> a # foldl1 :: (a -> a -> a) -> ModulePragma a -> a # toList :: ModulePragma a -> [a] # null :: ModulePragma a -> Bool # length :: ModulePragma a -> Int # elem :: Eq a => a -> ModulePragma a -> Bool # maximum :: Ord a => ModulePragma a -> a # minimum :: Ord a => ModulePragma a -> a # sum :: Num a => ModulePragma a -> a # product :: Num a => ModulePragma a -> a # | |
| Foldable Overlap | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Overlap m -> m # foldMap :: Monoid m => (a -> m) -> Overlap a -> m # foldMap' :: Monoid m => (a -> m) -> Overlap a -> m # foldr :: (a -> b -> b) -> b -> Overlap a -> b # foldr' :: (a -> b -> b) -> b -> Overlap a -> b # foldl :: (b -> a -> b) -> b -> Overlap a -> b # foldl' :: (b -> a -> b) -> b -> Overlap a -> b # foldr1 :: (a -> a -> a) -> Overlap a -> a # foldl1 :: (a -> a -> a) -> Overlap a -> a # elem :: Eq a => a -> Overlap a -> Bool # maximum :: Ord a => Overlap a -> a # minimum :: Ord a => Overlap a -> a # | |
| Foldable Activation | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Activation m -> m # foldMap :: Monoid m => (a -> m) -> Activation a -> m # foldMap' :: Monoid m => (a -> m) -> Activation a -> m # foldr :: (a -> b -> b) -> b -> Activation a -> b # foldr' :: (a -> b -> b) -> b -> Activation a -> b # foldl :: (b -> a -> b) -> b -> Activation a -> b # foldl' :: (b -> a -> b) -> b -> Activation a -> b # foldr1 :: (a -> a -> a) -> Activation a -> a # foldl1 :: (a -> a -> a) -> Activation a -> a # toList :: Activation a -> [a] # null :: Activation a -> Bool # length :: Activation a -> Int # elem :: Eq a => a -> Activation a -> Bool # maximum :: Ord a => Activation a -> a # minimum :: Ord a => Activation a -> a # sum :: Num a => Activation a -> a # product :: Num a => Activation a -> a # | |
| Foldable Rule | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Rule m -> m # foldMap :: Monoid m => (a -> m) -> Rule a -> m # foldMap' :: Monoid m => (a -> m) -> Rule a -> m # foldr :: (a -> b -> b) -> b -> Rule a -> b # foldr' :: (a -> b -> b) -> b -> Rule a -> b # foldl :: (b -> a -> b) -> b -> Rule a -> b # foldl' :: (b -> a -> b) -> b -> Rule a -> b # foldr1 :: (a -> a -> a) -> Rule a -> a # foldl1 :: (a -> a -> a) -> Rule a -> a # elem :: Eq a => a -> Rule a -> Bool # maximum :: Ord a => Rule a -> a # | |
| Foldable RuleVar | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RuleVar m -> m # foldMap :: Monoid m => (a -> m) -> RuleVar a -> m # foldMap' :: Monoid m => (a -> m) -> RuleVar a -> m # foldr :: (a -> b -> b) -> b -> RuleVar a -> b # foldr' :: (a -> b -> b) -> b -> RuleVar a -> b # foldl :: (b -> a -> b) -> b -> RuleVar a -> b # foldl' :: (b -> a -> b) -> b -> RuleVar a -> b # foldr1 :: (a -> a -> a) -> RuleVar a -> a # foldl1 :: (a -> a -> a) -> RuleVar a -> a # elem :: Eq a => a -> RuleVar a -> Bool # maximum :: Ord a => RuleVar a -> a # minimum :: Ord a => RuleVar a -> a # | |
| Foldable WarningText | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => WarningText m -> m # foldMap :: Monoid m => (a -> m) -> WarningText a -> m # foldMap' :: Monoid m => (a -> m) -> WarningText a -> m # foldr :: (a -> b -> b) -> b -> WarningText a -> b # foldr' :: (a -> b -> b) -> b -> WarningText a -> b # foldl :: (b -> a -> b) -> b -> WarningText a -> b # foldl' :: (b -> a -> b) -> b -> WarningText a -> b # foldr1 :: (a -> a -> a) -> WarningText a -> a # foldl1 :: (a -> a -> a) -> WarningText a -> a # toList :: WarningText a -> [a] # null :: WarningText a -> Bool # length :: WarningText a -> Int # elem :: Eq a => a -> WarningText a -> Bool # maximum :: Ord a => WarningText a -> a # minimum :: Ord a => WarningText a -> a # sum :: Num a => WarningText a -> a # product :: Num a => WarningText a -> a # | |
| Foldable Pat | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Pat m -> m # foldMap :: Monoid m => (a -> m) -> Pat a -> m # foldMap' :: Monoid m => (a -> m) -> Pat a -> m # foldr :: (a -> b -> b) -> b -> Pat a -> b # foldr' :: (a -> b -> b) -> b -> Pat a -> b # foldl :: (b -> a -> b) -> b -> Pat a -> b # foldl' :: (b -> a -> b) -> b -> Pat a -> b # foldr1 :: (a -> a -> a) -> Pat a -> a # foldl1 :: (a -> a -> a) -> Pat a -> a # elem :: Eq a => a -> Pat a -> Bool # maximum :: Ord a => Pat a -> a # | |
| Foldable PXAttr | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PXAttr m -> m # foldMap :: Monoid m => (a -> m) -> PXAttr a -> m # foldMap' :: Monoid m => (a -> m) -> PXAttr a -> m # foldr :: (a -> b -> b) -> b -> PXAttr a -> b # foldr' :: (a -> b -> b) -> b -> PXAttr a -> b # foldl :: (b -> a -> b) -> b -> PXAttr a -> b # foldl' :: (b -> a -> b) -> b -> PXAttr a -> b # foldr1 :: (a -> a -> a) -> PXAttr a -> a # foldl1 :: (a -> a -> a) -> PXAttr a -> a # elem :: Eq a => a -> PXAttr a -> Bool # maximum :: Ord a => PXAttr a -> a # minimum :: Ord a => PXAttr a -> a # | |
| Foldable RPatOp | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPatOp m -> m # foldMap :: Monoid m => (a -> m) -> RPatOp a -> m # foldMap' :: Monoid m => (a -> m) -> RPatOp a -> m # foldr :: (a -> b -> b) -> b -> RPatOp a -> b # foldr' :: (a -> b -> b) -> b -> RPatOp a -> b # foldl :: (b -> a -> b) -> b -> RPatOp a -> b # foldl' :: (b -> a -> b) -> b -> RPatOp a -> b # foldr1 :: (a -> a -> a) -> RPatOp a -> a # foldl1 :: (a -> a -> a) -> RPatOp a -> a # elem :: Eq a => a -> RPatOp a -> Bool # maximum :: Ord a => RPatOp a -> a # minimum :: Ord a => RPatOp a -> a # | |
| Foldable RPat | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => RPat m -> m # foldMap :: Monoid m => (a -> m) -> RPat a -> m # foldMap' :: Monoid m => (a -> m) -> RPat a -> m # foldr :: (a -> b -> b) -> b -> RPat a -> b # foldr' :: (a -> b -> b) -> b -> RPat a -> b # foldl :: (b -> a -> b) -> b -> RPat a -> b # foldl' :: (b -> a -> b) -> b -> RPat a -> b # foldr1 :: (a -> a -> a) -> RPat a -> a # foldl1 :: (a -> a -> a) -> RPat a -> a # elem :: Eq a => a -> RPat a -> Bool # maximum :: Ord a => RPat a -> a # | |
| Foldable PatField | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => PatField m -> m # foldMap :: Monoid m => (a -> m) -> PatField a -> m # foldMap' :: Monoid m => (a -> m) -> PatField a -> m # foldr :: (a -> b -> b) -> b -> PatField a -> b # foldr' :: (a -> b -> b) -> b -> PatField a -> b # foldl :: (b -> a -> b) -> b -> PatField a -> b # foldl' :: (b -> a -> b) -> b -> PatField a -> b # foldr1 :: (a -> a -> a) -> PatField a -> a # foldl1 :: (a -> a -> a) -> PatField a -> a # elem :: Eq a => a -> PatField a -> Bool # maximum :: Ord a => PatField a -> a # minimum :: Ord a => PatField a -> a # | |
| Foldable Stmt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Stmt m -> m # foldMap :: Monoid m => (a -> m) -> Stmt a -> m # foldMap' :: Monoid m => (a -> m) -> Stmt a -> m # foldr :: (a -> b -> b) -> b -> Stmt a -> b # foldr' :: (a -> b -> b) -> b -> Stmt a -> b # foldl :: (b -> a -> b) -> b -> Stmt a -> b # foldl' :: (b -> a -> b) -> b -> Stmt a -> b # foldr1 :: (a -> a -> a) -> Stmt a -> a # foldl1 :: (a -> a -> a) -> Stmt a -> a # elem :: Eq a => a -> Stmt a -> Bool # maximum :: Ord a => Stmt a -> a # | |
| Foldable QualStmt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => QualStmt m -> m # foldMap :: Monoid m => (a -> m) -> QualStmt a -> m # foldMap' :: Monoid m => (a -> m) -> QualStmt a -> m # foldr :: (a -> b -> b) -> b -> QualStmt a -> b # foldr' :: (a -> b -> b) -> b -> QualStmt a -> b # foldl :: (b -> a -> b) -> b -> QualStmt a -> b # foldl' :: (b -> a -> b) -> b -> QualStmt a -> b # foldr1 :: (a -> a -> a) -> QualStmt a -> a # foldl1 :: (a -> a -> a) -> QualStmt a -> a # elem :: Eq a => a -> QualStmt a -> Bool # maximum :: Ord a => QualStmt a -> a # minimum :: Ord a => QualStmt a -> a # | |
| Foldable FieldUpdate | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => FieldUpdate m -> m # foldMap :: Monoid m => (a -> m) -> FieldUpdate a -> m # foldMap' :: Monoid m => (a -> m) -> FieldUpdate a -> m # foldr :: (a -> b -> b) -> b -> FieldUpdate a -> b # foldr' :: (a -> b -> b) -> b -> FieldUpdate a -> b # foldl :: (b -> a -> b) -> b -> FieldUpdate a -> b # foldl' :: (b -> a -> b) -> b -> FieldUpdate a -> b # foldr1 :: (a -> a -> a) -> FieldUpdate a -> a # foldl1 :: (a -> a -> a) -> FieldUpdate a -> a # toList :: FieldUpdate a -> [a] # null :: FieldUpdate a -> Bool # length :: FieldUpdate a -> Int # elem :: Eq a => a -> FieldUpdate a -> Bool # maximum :: Ord a => FieldUpdate a -> a # minimum :: Ord a => FieldUpdate a -> a # sum :: Num a => FieldUpdate a -> a # product :: Num a => FieldUpdate a -> a # | |
| Foldable Alt | |
Defined in Language.Haskell.Exts.Syntax Methods fold :: Monoid m => Alt m -> m # foldMap :: Monoid m => (a -> m) -> Alt a -> m # foldMap' :: Monoid m => (a -> m) -> Alt a -> m # foldr :: (a -> b -> b) -> b -> Alt a -> b # foldr' :: (a -> b -> b) -> b -> Alt a -> b # foldl :: (b -> a -> b) -> b -> Alt a -> b # foldl' :: (b -> a -> b) -> b -> Alt a -> b # foldr1 :: (a -> a -> a) -> Alt a -> a # foldl1 :: (a -> a -> a) -> Alt a -> a # elem :: Eq a => a -> Alt a -> Bool # maximum :: Ord a => Alt a -> a # | |
| Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldMap' :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldMap' :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
| Foldable SmallArray | |
Defined in Data.Primitive.SmallArray Methods fold :: Monoid m => SmallArray m -> m # foldMap :: Monoid m => (a -> m) -> SmallArray a -> m # foldMap' :: Monoid m => (a -> m) -> SmallArray a -> m # foldr :: (a -> b -> b) -> b -> SmallArray a -> b # foldr' :: (a -> b -> b) -> b -> SmallArray a -> b # foldl :: (b -> a -> b) -> b -> SmallArray a -> b # foldl' :: (b -> a -> b) -> b -> SmallArray a -> b # foldr1 :: (a -> a -> a) -> SmallArray a -> a # foldl1 :: (a -> a -> a) -> SmallArray a -> a # toList :: SmallArray a -> [a] # null :: SmallArray a -> Bool # length :: SmallArray a -> Int # elem :: Eq a => a -> SmallArray a -> Bool # maximum :: Ord a => SmallArray a -> a # minimum :: Ord a => SmallArray a -> a # sum :: Num a => SmallArray a -> a # product :: Num a => SmallArray a -> a # | |
| Foldable Array | |
Defined in Data.Primitive.Array Methods fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldMap' :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
| Foldable Identity | |
Defined in Data.Vinyl.Functor Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldMap' :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Foldable Thunk | |
Defined in Data.Vinyl.Functor Methods fold :: Monoid m => Thunk m -> m # foldMap :: Monoid m => (a -> m) -> Thunk a -> m # foldMap' :: Monoid m => (a -> m) -> Thunk a -> m # foldr :: (a -> b -> b) -> b -> Thunk a -> b # foldr' :: (a -> b -> b) -> b -> Thunk a -> b # foldl :: (b -> a -> b) -> b -> Thunk a -> b # foldl' :: (b -> a -> b) -> b -> Thunk a -> b # foldr1 :: (a -> a -> a) -> Thunk a -> a # foldl1 :: (a -> a -> a) -> Thunk a -> a # elem :: Eq a => a -> Thunk a -> Bool # maximum :: Ord a => Thunk a -> a # minimum :: Ord a => Thunk a -> a # | |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Foldable (V1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => V1 m -> m # foldMap :: Monoid m => (a -> m) -> V1 a -> m # foldMap' :: Monoid m => (a -> m) -> V1 a -> m # foldr :: (a -> b -> b) -> b -> V1 a -> b # foldr' :: (a -> b -> b) -> b -> V1 a -> b # foldl :: (b -> a -> b) -> b -> V1 a -> b # foldl' :: (b -> a -> b) -> b -> V1 a -> b # foldr1 :: (a -> a -> a) -> V1 a -> a # foldl1 :: (a -> a -> a) -> V1 a -> a # elem :: Eq a => a -> V1 a -> Bool # maximum :: Ord a => V1 a -> a # | |
| Foldable (U1 :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => U1 m -> m # foldMap :: Monoid m => (a -> m) -> U1 a -> m # foldMap' :: Monoid m => (a -> m) -> U1 a -> m # foldr :: (a -> b -> b) -> b -> U1 a -> b # foldr' :: (a -> b -> b) -> b -> U1 a -> b # foldl :: (b -> a -> b) -> b -> U1 a -> b # foldl' :: (b -> a -> b) -> b -> U1 a -> b # foldr1 :: (a -> a -> a) -> U1 a -> a # foldl1 :: (a -> a -> a) -> U1 a -> a # elem :: Eq a => a -> U1 a -> Bool # maximum :: Ord a => U1 a -> a # | |
| Foldable ((,) a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (a, m) -> m # foldMap :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldMap' :: Monoid m => (a0 -> m) -> (a, a0) -> m # foldr :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldr' :: (a0 -> b -> b) -> b -> (a, a0) -> b # foldl :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldl' :: (b -> a0 -> b) -> b -> (a, a0) -> b # foldr1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # foldl1 :: (a0 -> a0 -> a0) -> (a, a0) -> a0 # elem :: Eq a0 => a0 -> (a, a0) -> Bool # maximum :: Ord a0 => (a, a0) -> a0 # minimum :: Ord a0 => (a, a0) -> a0 # | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Foldable (Array i) | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Array i m -> m # foldMap :: Monoid m => (a -> m) -> Array i a -> m # foldMap' :: Monoid m => (a -> m) -> Array i a -> m # foldr :: (a -> b -> b) -> b -> Array i a -> b # foldr' :: (a -> b -> b) -> b -> Array i a -> b # foldl :: (b -> a -> b) -> b -> Array i a -> b # foldl' :: (b -> a -> b) -> b -> Array i a -> b # foldr1 :: (a -> a -> a) -> Array i a -> a # foldl1 :: (a -> a -> a) -> Array i a -> a # elem :: Eq a => a -> Array i a -> Bool # maximum :: Ord a => Array i a -> a # minimum :: Ord a => Array i a -> a # | |
| Foldable (Arg a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Arg a m -> m # foldMap :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Arg a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Arg a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Arg a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Arg a a0 -> a0 # elem :: Eq a0 => a0 -> Arg a a0 -> Bool # maximum :: Ord a0 => Arg a a0 -> a0 # minimum :: Ord a0 => Arg a a0 -> a0 # | |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Foldable f => Foldable (MaybeT f) | |
Defined in Control.Monad.Trans.Maybe Methods fold :: Monoid m => MaybeT f m -> m # foldMap :: Monoid m => (a -> m) -> MaybeT f a -> m # foldMap' :: Monoid m => (a -> m) -> MaybeT f a -> m # foldr :: (a -> b -> b) -> b -> MaybeT f a -> b # foldr' :: (a -> b -> b) -> b -> MaybeT f a -> b # foldl :: (b -> a -> b) -> b -> MaybeT f a -> b # foldl' :: (b -> a -> b) -> b -> MaybeT f a -> b # foldr1 :: (a -> a -> a) -> MaybeT f a -> a # foldl1 :: (a -> a -> a) -> MaybeT f a -> a # elem :: Eq a => a -> MaybeT f a -> Bool # maximum :: Ord a => MaybeT f a -> a # minimum :: Ord a => MaybeT f a -> a # | |
| Foldable f => Foldable (Cofree f) | |
Defined in Control.Comonad.Cofree Methods fold :: Monoid m => Cofree f m -> m # foldMap :: Monoid m => (a -> m) -> Cofree f a -> m # foldMap' :: Monoid m => (a -> m) -> Cofree f a -> m # foldr :: (a -> b -> b) -> b -> Cofree f a -> b # foldr' :: (a -> b -> b) -> b -> Cofree f a -> b # foldl :: (b -> a -> b) -> b -> Cofree f a -> b # foldl' :: (b -> a -> b) -> b -> Cofree f a -> b # foldr1 :: (a -> a -> a) -> Cofree f a -> a # foldl1 :: (a -> a -> a) -> Cofree f a -> a # elem :: Eq a => a -> Cofree f a -> Bool # maximum :: Ord a => Cofree f a -> a # minimum :: Ord a => Cofree f a -> a # | |
| Foldable f => Foldable (Free f) | |
Defined in Control.Monad.Free Methods fold :: Monoid m => Free f m -> m # foldMap :: Monoid m => (a -> m) -> Free f a -> m # foldMap' :: Monoid m => (a -> m) -> Free f a -> m # foldr :: (a -> b -> b) -> b -> Free f a -> b # foldr' :: (a -> b -> b) -> b -> Free f a -> b # foldl :: (b -> a -> b) -> b -> Free f a -> b # foldl' :: (b -> a -> b) -> b -> Free f a -> b # foldr1 :: (a -> a -> a) -> Free f a -> a # foldl1 :: (a -> a -> a) -> Free f a -> a # elem :: Eq a => a -> Free f a -> Bool # maximum :: Ord a => Free f a -> a # minimum :: Ord a => Free f a -> a # | |
| Foldable f => Foldable (Yoneda f) | |
Defined in Data.Functor.Yoneda Methods fold :: Monoid m => Yoneda f m -> m # foldMap :: Monoid m => (a -> m) -> Yoneda f a -> m # foldMap' :: Monoid m => (a -> m) -> Yoneda f a -> m # foldr :: (a -> b -> b) -> b -> Yoneda f a -> b # foldr' :: (a -> b -> b) -> b -> Yoneda f a -> b # foldl :: (b -> a -> b) -> b -> Yoneda f a -> b # foldl' :: (b -> a -> b) -> b -> Yoneda f a -> b # foldr1 :: (a -> a -> a) -> Yoneda f a -> a # foldl1 :: (a -> a -> a) -> Yoneda f a -> a # elem :: Eq a => a -> Yoneda f a -> Bool # maximum :: Ord a => Yoneda f a -> a # minimum :: Ord a => Yoneda f a -> a # | |
| Foldable f => Foldable (Rec1 f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Rec1 f m -> m # foldMap :: Monoid m => (a -> m) -> Rec1 f a -> m # foldMap' :: Monoid m => (a -> m) -> Rec1 f a -> m # foldr :: (a -> b -> b) -> b -> Rec1 f a -> b # foldr' :: (a -> b -> b) -> b -> Rec1 f a -> b # foldl :: (b -> a -> b) -> b -> Rec1 f a -> b # foldl' :: (b -> a -> b) -> b -> Rec1 f a -> b # foldr1 :: (a -> a -> a) -> Rec1 f a -> a # foldl1 :: (a -> a -> a) -> Rec1 f a -> a # elem :: Eq a => a -> Rec1 f a -> Bool # maximum :: Ord a => Rec1 f a -> a # minimum :: Ord a => Rec1 f a -> a # | |
| Foldable (URec Char :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Char m -> m # foldMap :: Monoid m => (a -> m) -> URec Char a -> m # foldMap' :: Monoid m => (a -> m) -> URec Char a -> m # foldr :: (a -> b -> b) -> b -> URec Char a -> b # foldr' :: (a -> b -> b) -> b -> URec Char a -> b # foldl :: (b -> a -> b) -> b -> URec Char a -> b # foldl' :: (b -> a -> b) -> b -> URec Char a -> b # foldr1 :: (a -> a -> a) -> URec Char a -> a # foldl1 :: (a -> a -> a) -> URec Char a -> a # toList :: URec Char a -> [a] # length :: URec Char a -> Int # elem :: Eq a => a -> URec Char a -> Bool # maximum :: Ord a => URec Char a -> a # minimum :: Ord a => URec Char a -> a # | |
| Foldable (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m # foldMap :: Monoid m => (a -> m) -> URec Double a -> m # foldMap' :: Monoid m => (a -> m) -> URec Double a -> m # foldr :: (a -> b -> b) -> b -> URec Double a -> b # foldr' :: (a -> b -> b) -> b -> URec Double a -> b # foldl :: (b -> a -> b) -> b -> URec Double a -> b # foldl' :: (b -> a -> b) -> b -> URec Double a -> b # foldr1 :: (a -> a -> a) -> URec Double a -> a # foldl1 :: (a -> a -> a) -> URec Double a -> a # toList :: URec Double a -> [a] # null :: URec Double a -> Bool # length :: URec Double a -> Int # elem :: Eq a => a -> URec Double a -> Bool # maximum :: Ord a => URec Double a -> a # minimum :: Ord a => URec Double a -> a # | |
| Foldable (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m # foldMap :: Monoid m => (a -> m) -> URec Float a -> m # foldMap' :: Monoid m => (a -> m) -> URec Float a -> m # foldr :: (a -> b -> b) -> b -> URec Float a -> b # foldr' :: (a -> b -> b) -> b -> URec Float a -> b # foldl :: (b -> a -> b) -> b -> URec Float a -> b # foldl' :: (b -> a -> b) -> b -> URec Float a -> b # foldr1 :: (a -> a -> a) -> URec Float a -> a # foldl1 :: (a -> a -> a) -> URec Float a -> a # toList :: URec Float a -> [a] # null :: URec Float a -> Bool # length :: URec Float a -> Int # elem :: Eq a => a -> URec Float a -> Bool # maximum :: Ord a => URec Float a -> a # minimum :: Ord a => URec Float a -> a # | |
| Foldable (URec Int :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Int m -> m # foldMap :: Monoid m => (a -> m) -> URec Int a -> m # foldMap' :: Monoid m => (a -> m) -> URec Int a -> m # foldr :: (a -> b -> b) -> b -> URec Int a -> b # foldr' :: (a -> b -> b) -> b -> URec Int a -> b # foldl :: (b -> a -> b) -> b -> URec Int a -> b # foldl' :: (b -> a -> b) -> b -> URec Int a -> b # foldr1 :: (a -> a -> a) -> URec Int a -> a # foldl1 :: (a -> a -> a) -> URec Int a -> a # elem :: Eq a => a -> URec Int a -> Bool # maximum :: Ord a => URec Int a -> a # minimum :: Ord a => URec Int a -> a # | |
| Foldable (URec Word :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Word m -> m # foldMap :: Monoid m => (a -> m) -> URec Word a -> m # foldMap' :: Monoid m => (a -> m) -> URec Word a -> m # foldr :: (a -> b -> b) -> b -> URec Word a -> b # foldr' :: (a -> b -> b) -> b -> URec Word a -> b # foldl :: (b -> a -> b) -> b -> URec Word a -> b # foldl' :: (b -> a -> b) -> b -> URec Word a -> b # foldr1 :: (a -> a -> a) -> URec Word a -> a # foldl1 :: (a -> a -> a) -> URec Word a -> a # toList :: URec Word a -> [a] # length :: URec Word a -> Int # elem :: Eq a => a -> URec Word a -> Bool # maximum :: Ord a => URec Word a -> a # minimum :: Ord a => URec Word a -> a # | |
| Foldable (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec (Ptr ()) m -> m # foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldMap' :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # toList :: URec (Ptr ()) a -> [a] # null :: URec (Ptr ()) a -> Bool # length :: URec (Ptr ()) a -> Int # elem :: Eq a => a -> URec (Ptr ()) a -> Bool # maximum :: Ord a => URec (Ptr ()) a -> a # minimum :: Ord a => URec (Ptr ()) a -> a # | |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
| Foldable f => Foldable (Ap f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Ap f m -> m # foldMap :: Monoid m => (a -> m) -> Ap f a -> m # foldMap' :: Monoid m => (a -> m) -> Ap f a -> m # foldr :: (a -> b -> b) -> b -> Ap f a -> b # foldr' :: (a -> b -> b) -> b -> Ap f a -> b # foldl :: (b -> a -> b) -> b -> Ap f a -> b # foldl' :: (b -> a -> b) -> b -> Ap f a -> b # foldr1 :: (a -> a -> a) -> Ap f a -> a # foldl1 :: (a -> a -> a) -> Ap f a -> a # elem :: Eq a => a -> Ap f a -> Bool # maximum :: Ord a => Ap f a -> a # | |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
| Bifoldable p => Foldable (Join p) | |
Defined in Data.Bifunctor.Join Methods fold :: Monoid m => Join p m -> m # foldMap :: Monoid m => (a -> m) -> Join p a -> m # foldMap' :: Monoid m => (a -> m) -> Join p a -> m # foldr :: (a -> b -> b) -> b -> Join p a -> b # foldr' :: (a -> b -> b) -> b -> Join p a -> b # foldl :: (b -> a -> b) -> b -> Join p a -> b # foldl' :: (b -> a -> b) -> b -> Join p a -> b # foldr1 :: (a -> a -> a) -> Join p a -> a # foldl1 :: (a -> a -> a) -> Join p a -> a # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # | |
| Bifoldable p => Foldable (Fix p) | |
Defined in Data.Bifunctor.Fix Methods fold :: Monoid m => Fix p m -> m # foldMap :: Monoid m => (a -> m) -> Fix p a -> m # foldMap' :: Monoid m => (a -> m) -> Fix p a -> m # foldr :: (a -> b -> b) -> b -> Fix p a -> b # foldr' :: (a -> b -> b) -> b -> Fix p a -> b # foldl :: (b -> a -> b) -> b -> Fix p a -> b # foldl' :: (b -> a -> b) -> b -> Fix p a -> b # foldr1 :: (a -> a -> a) -> Fix p a -> a # foldl1 :: (a -> a -> a) -> Fix p a -> a # elem :: Eq a => a -> Fix p a -> Bool # maximum :: Ord a => Fix p a -> a # minimum :: Ord a => Fix p a -> a # | |
| Foldable f => Foldable (IdentityT f) | |
Defined in Control.Monad.Trans.Identity Methods fold :: Monoid m => IdentityT f m -> m # foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m # foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m # foldr :: (a -> b -> b) -> b -> IdentityT f a -> b # foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b # foldl :: (b -> a -> b) -> b -> IdentityT f a -> b # foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b # foldr1 :: (a -> a -> a) -> IdentityT f a -> a # foldl1 :: (a -> a -> a) -> IdentityT f a -> a # toList :: IdentityT f a -> [a] # null :: IdentityT f a -> Bool # length :: IdentityT f a -> Int # elem :: Eq a => a -> IdentityT f a -> Bool # maximum :: Ord a => IdentityT f a -> a # minimum :: Ord a => IdentityT f a -> a # | |
| Foldable f => Foldable (ExceptT e f) | |
Defined in Control.Monad.Trans.Except Methods fold :: Monoid m => ExceptT e f m -> m # foldMap :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ExceptT e f a -> m # foldr :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldr' :: (a -> b -> b) -> b -> ExceptT e f a -> b # foldl :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldl' :: (b -> a -> b) -> b -> ExceptT e f a -> b # foldr1 :: (a -> a -> a) -> ExceptT e f a -> a # foldl1 :: (a -> a -> a) -> ExceptT e f a -> a # toList :: ExceptT e f a -> [a] # null :: ExceptT e f a -> Bool # length :: ExceptT e f a -> Int # elem :: Eq a => a -> ExceptT e f a -> Bool # maximum :: Ord a => ExceptT e f a -> a # minimum :: Ord a => ExceptT e f a -> a # | |
| Foldable f => Foldable (FreeF f a) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m => FreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> FreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> FreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> FreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> FreeF f a a0 -> a0 # toList :: FreeF f a a0 -> [a0] # null :: FreeF f a a0 -> Bool # length :: FreeF f a a0 -> Int # elem :: Eq a0 => a0 -> FreeF f a a0 -> Bool # maximum :: Ord a0 => FreeF f a a0 -> a0 # minimum :: Ord a0 => FreeF f a a0 -> a0 # | |
| (Foldable m, Foldable f) => Foldable (FreeT f m) | |
Defined in Control.Monad.Trans.Free Methods fold :: Monoid m0 => FreeT f m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> FreeT f m a -> m0 # foldr :: (a -> b -> b) -> b -> FreeT f m a -> b # foldr' :: (a -> b -> b) -> b -> FreeT f m a -> b # foldl :: (b -> a -> b) -> b -> FreeT f m a -> b # foldl' :: (b -> a -> b) -> b -> FreeT f m a -> b # foldr1 :: (a -> a -> a) -> FreeT f m a -> a # foldl1 :: (a -> a -> a) -> FreeT f m a -> a # toList :: FreeT f m a -> [a] # length :: FreeT f m a -> Int # elem :: Eq a => a -> FreeT f m a -> Bool # maximum :: Ord a => FreeT f m a -> a # minimum :: Ord a => FreeT f m a -> a # | |
| Foldable f => Foldable (CofreeF f a) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeF f a m -> m # foldMap :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> CofreeF f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> CofreeF f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> CofreeF f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> CofreeF f a a0 -> a0 # toList :: CofreeF f a a0 -> [a0] # null :: CofreeF f a a0 -> Bool # length :: CofreeF f a a0 -> Int # elem :: Eq a0 => a0 -> CofreeF f a a0 -> Bool # maximum :: Ord a0 => CofreeF f a a0 -> a0 # minimum :: Ord a0 => CofreeF f a a0 -> a0 # | |
| (Foldable f, Foldable w) => Foldable (CofreeT f w) | |
Defined in Control.Comonad.Trans.Cofree Methods fold :: Monoid m => CofreeT f w m -> m # foldMap :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldMap' :: Monoid m => (a -> m) -> CofreeT f w a -> m # foldr :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldr' :: (a -> b -> b) -> b -> CofreeT f w a -> b # foldl :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldl' :: (b -> a -> b) -> b -> CofreeT f w a -> b # foldr1 :: (a -> a -> a) -> CofreeT f w a -> a # foldl1 :: (a -> a -> a) -> CofreeT f w a -> a # toList :: CofreeT f w a -> [a] # null :: CofreeT f w a -> Bool # length :: CofreeT f w a -> Int # elem :: Eq a => a -> CofreeT f w a -> Bool # maximum :: Ord a => CofreeT f w a -> a # minimum :: Ord a => CofreeT f w a -> a # | |
| Foldable f => Foldable (ErrorT e f) | |
Defined in Control.Monad.Trans.Error Methods fold :: Monoid m => ErrorT e f m -> m # foldMap :: Monoid m => (a -> m) -> ErrorT e f a -> m # foldMap' :: Monoid m => (a -> m) -> ErrorT e f a -> m # foldr :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldr' :: (a -> b -> b) -> b -> ErrorT e f a -> b # foldl :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldl' :: (b -> a -> b) -> b -> ErrorT e f a -> b # foldr1 :: (a -> a -> a) -> ErrorT e f a -> a # foldl1 :: (a -> a -> a) -> ErrorT e f a -> a # toList :: ErrorT e f a -> [a] # null :: ErrorT e f a -> Bool # length :: ErrorT e f a -> Int # elem :: Eq a => a -> ErrorT e f a -> Bool # maximum :: Ord a => ErrorT e f a -> a # minimum :: Ord a => ErrorT e f a -> a # | |
| Foldable (Tagged s) | |
Defined in Data.Tagged Methods fold :: Monoid m => Tagged s m -> m # foldMap :: Monoid m => (a -> m) -> Tagged s a -> m # foldMap' :: Monoid m => (a -> m) -> Tagged s a -> m # foldr :: (a -> b -> b) -> b -> Tagged s a -> b # foldr' :: (a -> b -> b) -> b -> Tagged s a -> b # foldl :: (b -> a -> b) -> b -> Tagged s a -> b # foldl' :: (b -> a -> b) -> b -> Tagged s a -> b # foldr1 :: (a -> a -> a) -> Tagged s a -> a # foldl1 :: (a -> a -> a) -> Tagged s a -> a # elem :: Eq a => a -> Tagged s a -> Bool # maximum :: Ord a => Tagged s a -> a # minimum :: Ord a => Tagged s a -> a # | |
| Foldable (Const a :: Type -> Type) | |
Defined in Data.Vinyl.Functor Methods fold :: Monoid m => Const a m -> m # foldMap :: Monoid m => (a0 -> m) -> Const a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Const a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Const a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Const a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Const a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Const a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Const a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Const a a0 -> a0 # toList :: Const a a0 -> [a0] # elem :: Eq a0 => a0 -> Const a a0 -> Bool # maximum :: Ord a0 => Const a a0 -> a0 # minimum :: Ord a0 => Const a a0 -> a0 # | |
| Foldable (K1 i c :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => K1 i c m -> m # foldMap :: Monoid m => (a -> m) -> K1 i c a -> m # foldMap' :: Monoid m => (a -> m) -> K1 i c a -> m # foldr :: (a -> b -> b) -> b -> K1 i c a -> b # foldr' :: (a -> b -> b) -> b -> K1 i c a -> b # foldl :: (b -> a -> b) -> b -> K1 i c a -> b # foldl' :: (b -> a -> b) -> b -> K1 i c a -> b # foldr1 :: (a -> a -> a) -> K1 i c a -> a # foldl1 :: (a -> a -> a) -> K1 i c a -> a # elem :: Eq a => a -> K1 i c a -> Bool # maximum :: Ord a => K1 i c a -> a # minimum :: Ord a => K1 i c a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :+: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :+: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :+: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :+: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :+: g) a -> b # foldr1 :: (a -> a -> a) -> (f :+: g) a -> a # foldl1 :: (a -> a -> a) -> (f :+: g) a -> a # toList :: (f :+: g) a -> [a] # length :: (f :+: g) a -> Int # elem :: Eq a => a -> (f :+: g) a -> Bool # maximum :: Ord a => (f :+: g) a -> a # minimum :: Ord a => (f :+: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :*: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :*: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :*: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :*: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :*: g) a -> b # foldr1 :: (a -> a -> a) -> (f :*: g) a -> a # foldl1 :: (a -> a -> a) -> (f :*: g) a -> a # toList :: (f :*: g) a -> [a] # length :: (f :*: g) a -> Int # elem :: Eq a => a -> (f :*: g) a -> Bool # maximum :: Ord a => (f :*: g) a -> a # minimum :: Ord a => (f :*: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (Product f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Product Methods fold :: Monoid m => Product f g m -> m # foldMap :: Monoid m => (a -> m) -> Product f g a -> m # foldMap' :: Monoid m => (a -> m) -> Product f g a -> m # foldr :: (a -> b -> b) -> b -> Product f g a -> b # foldr' :: (a -> b -> b) -> b -> Product f g a -> b # foldl :: (b -> a -> b) -> b -> Product f g a -> b # foldl' :: (b -> a -> b) -> b -> Product f g a -> b # foldr1 :: (a -> a -> a) -> Product f g a -> a # foldl1 :: (a -> a -> a) -> Product f g a -> a # toList :: Product f g a -> [a] # null :: Product f g a -> Bool # length :: Product f g a -> Int # elem :: Eq a => a -> Product f g a -> Bool # maximum :: Ord a => Product f g a -> a # minimum :: Ord a => Product f g a -> a # | |
| (Foldable f, Foldable g) => Foldable (Sum f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Sum Methods fold :: Monoid m => Sum f g m -> m # foldMap :: Monoid m => (a -> m) -> Sum f g a -> m # foldMap' :: Monoid m => (a -> m) -> Sum f g a -> m # foldr :: (a -> b -> b) -> b -> Sum f g a -> b # foldr' :: (a -> b -> b) -> b -> Sum f g a -> b # foldl :: (b -> a -> b) -> b -> Sum f g a -> b # foldl' :: (b -> a -> b) -> b -> Sum f g a -> b # foldr1 :: (a -> a -> a) -> Sum f g a -> a # foldl1 :: (a -> a -> a) -> Sum f g a -> a # elem :: Eq a => a -> Sum f g a -> Bool # maximum :: Ord a => Sum f g a -> a # minimum :: Ord a => Sum f g a -> a # | |
| Foldable f => Foldable (M1 i c f) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => M1 i c f m -> m # foldMap :: Monoid m => (a -> m) -> M1 i c f a -> m # foldMap' :: Monoid m => (a -> m) -> M1 i c f a -> m # foldr :: (a -> b -> b) -> b -> M1 i c f a -> b # foldr' :: (a -> b -> b) -> b -> M1 i c f a -> b # foldl :: (b -> a -> b) -> b -> M1 i c f a -> b # foldl' :: (b -> a -> b) -> b -> M1 i c f a -> b # foldr1 :: (a -> a -> a) -> M1 i c f a -> a # foldl1 :: (a -> a -> a) -> M1 i c f a -> a # elem :: Eq a => a -> M1 i c f a -> Bool # maximum :: Ord a => M1 i c f a -> a # minimum :: Ord a => M1 i c f a -> a # | |
| (Foldable f, Foldable g) => Foldable (f :.: g) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldMap' :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| Bifoldable p => Foldable (WrappedBifunctor p a) | |
Defined in Data.Bifunctor.Wrapped Methods fold :: Monoid m => WrappedBifunctor p a m -> m # foldMap :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> WrappedBifunctor p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> WrappedBifunctor p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> WrappedBifunctor p a a0 -> a0 # toList :: WrappedBifunctor p a a0 -> [a0] # null :: WrappedBifunctor p a a0 -> Bool # length :: WrappedBifunctor p a a0 -> Int # elem :: Eq a0 => a0 -> WrappedBifunctor p a a0 -> Bool # maximum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # minimum :: Ord a0 => WrappedBifunctor p a a0 -> a0 # sum :: Num a0 => WrappedBifunctor p a a0 -> a0 # product :: Num a0 => WrappedBifunctor p a a0 -> a0 # | |
| Foldable g => Foldable (Joker g a) | |
Defined in Data.Bifunctor.Joker Methods fold :: Monoid m => Joker g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Joker g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Joker g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Joker g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Joker g a a0 -> a0 # toList :: Joker g a a0 -> [a0] # null :: Joker g a a0 -> Bool # length :: Joker g a a0 -> Int # elem :: Eq a0 => a0 -> Joker g a a0 -> Bool # maximum :: Ord a0 => Joker g a a0 -> a0 # minimum :: Ord a0 => Joker g a a0 -> a0 # | |
| Bifoldable p => Foldable (Flip p a) | |
Defined in Data.Bifunctor.Flip Methods fold :: Monoid m => Flip p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Flip p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Flip p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Flip p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Flip p a a0 -> a0 # toList :: Flip p a a0 -> [a0] # length :: Flip p a a0 -> Int # elem :: Eq a0 => a0 -> Flip p a a0 -> Bool # maximum :: Ord a0 => Flip p a a0 -> a0 # minimum :: Ord a0 => Flip p a a0 -> a0 # | |
| Foldable (Clown f a :: Type -> Type) | |
Defined in Data.Bifunctor.Clown Methods fold :: Monoid m => Clown f a m -> m # foldMap :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Clown f a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Clown f a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Clown f a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Clown f a a0 -> a0 # toList :: Clown f a a0 -> [a0] # null :: Clown f a a0 -> Bool # length :: Clown f a a0 -> Int # elem :: Eq a0 => a0 -> Clown f a a0 -> Bool # maximum :: Ord a0 => Clown f a a0 -> a0 # minimum :: Ord a0 => Clown f a a0 -> a0 # | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | |
Defined in Data.Vinyl.Functor Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| (Foldable f, Bifoldable p) => Foldable (Tannen f p a) | |
Defined in Data.Bifunctor.Tannen Methods fold :: Monoid m => Tannen f p a m -> m # foldMap :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Tannen f p a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Tannen f p a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Tannen f p a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Tannen f p a a0 -> a0 # toList :: Tannen f p a a0 -> [a0] # null :: Tannen f p a a0 -> Bool # length :: Tannen f p a a0 -> Int # elem :: Eq a0 => a0 -> Tannen f p a a0 -> Bool # maximum :: Ord a0 => Tannen f p a a0 -> a0 # minimum :: Ord a0 => Tannen f p a a0 -> a0 # | |
| (Bifoldable p, Foldable g) => Foldable (Biff p f g a) | |
Defined in Data.Bifunctor.Biff Methods fold :: Monoid m => Biff p f g a m -> m # foldMap :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Biff p f g a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Biff p f g a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Biff p f g a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Biff p f g a a0 -> a0 # toList :: Biff p f g a a0 -> [a0] # null :: Biff p f g a a0 -> Bool # length :: Biff p f g a a0 -> Int # elem :: Eq a0 => a0 -> Biff p f g a a0 -> Bool # maximum :: Ord a0 => Biff p f g a a0 -> a0 # minimum :: Ord a0 => Biff p f g a a0 -> a0 # | |
class (Functor t, Foldable t) => Traversable (t :: Type -> Type) where #
Functors representing data structures that can be traversed from left to right.
A definition of traverse must satisfy the following laws:
- Naturality
t .for every applicative transformationtraversef =traverse(t . f)t- Identity
traverseIdentity=Identity- Composition
traverse(Compose.fmapg . f) =Compose.fmap(traverseg) .traversef
A definition of sequenceA must satisfy the following laws:
- Naturality
t .for every applicative transformationsequenceA=sequenceA.fmaptt- Identity
sequenceA.fmapIdentity=Identity- Composition
sequenceA.fmapCompose=Compose.fmapsequenceA.sequenceA
where an applicative transformation is a function
t :: (Applicative f, Applicative g) => f a -> g a
preserving the Applicative operations, i.e.
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.
(The naturality law is implied by parametricity.)
Instances are similar to Functor, e.g. given a data type
data Tree a = Empty | Leaf a | Node (Tree a) a (Tree a)
a suitable instance would be
instance Traversable Tree where traverse f Empty = pure Empty traverse f (Leaf x) = Leaf <$> f x traverse f (Node l k r) = Node <$> traverse f l <*> f k <*> traverse f r
This is suitable even for abstract types, as the laws for <*>
imply a form of associativity.
The superclass instances should satisfy the following:
- In the
Functorinstance,fmapshould be equivalent to traversal with the identity applicative functor (fmapDefault). - In the
Foldableinstance,foldMapshould be equivalent to traversal with a constant applicative functor (foldMapDefault).
Methods
traverse :: Applicative f => (a -> f b) -> t a -> f (t b) #
Map each element of a structure to an action, evaluate these actions
from left to right, and collect the results. For a version that ignores
the results see traverse_.
sequenceA :: Applicative f => t (f a) -> f (t a) #
Evaluate each action in the structure from left to right, and
collect the results. For a version that ignores the results
see sequenceA_.
mapM :: Monad m => (a -> m b) -> t a -> m (t b) #
Map each element of a structure to a monadic action, evaluate
these actions from left to right, and collect the results. For
a version that ignores the results see mapM_.
sequence :: Monad m => t (m a) -> m (t a) #
Evaluate each monadic action in the structure from left to
right, and collect the results. For a version that ignores the
results see sequence_.
Instances
Representable types of kind *.
This class is derivable in GHC with the DeriveGeneric flag on.
A Generic instance must satisfy the following laws:
from.to≡idto.from≡id
Instances
This class gives the integer associated with a type-level natural. There are instances of the class for every concrete literal: 0, 1, 2, etc.
Since: base-4.7.0.0
Minimal complete definition
natSing
class IsLabel (x :: Symbol) a where #
Instances
| (KnownSymbol name, s ~ name) => IsLabel s (Label name) | |
Defined in Util.Label | |
| name ~ name' => IsLabel name' (Name name) | |
Defined in Named.Internal | |
| (p ~ NamedF f a name, InjValue f) => IsLabel name (a -> Param p) | |
Defined in Named.Internal | |
| (name ~ name', a ~ a', InjValue f) => IsLabel name (a -> NamedF f a' name') | |
Defined in Named.Internal | |
The class of semigroups (types with an associative binary operation).
Instances should satisfy the following:
Since: base-4.9.0.0
Minimal complete definition
Methods
Reduce a non-empty list with <>
The default definition should be sufficient, but this can be overridden for efficiency.
stimes :: Integral b => b -> a -> a #
Repeat a value n times.
Given that this works on a Semigroup it is allowed to fail if
you request 0 or fewer repetitions, and the default definition
will do so.
By making this a member of the class, idempotent semigroups
and monoids can upgrade this to execute in O(1) by
picking stimes = or stimesIdempotentstimes =
respectively.stimesIdempotentMonoid
Instances
class Semigroup a => Monoid a where #
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:
- 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
An associative operation
NOTE: This method is redundant and has the default
implementation mappend = (<>)
Fold a list using the monoid.
For most types, the default definition for mconcat will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
Instances
Instances
| Bounded Bool | Since: base-2.1 |
| Enum Bool | Since: base-2.1 |
| Eq Bool | |
| Data Bool | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bool -> c Bool # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Bool # dataTypeOf :: Bool -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Bool) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Bool) # gmapT :: (forall b. Data b => b -> b) -> Bool -> Bool # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bool -> r # gmapQ :: (forall d. Data d => d -> u) -> Bool -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Bool -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bool -> m Bool # | |
| Ord Bool | |
| Read Bool | Since: base-2.1 |
| Show Bool | Since: base-2.1 |
| Generic Bool | Since: base-4.6.0.0 |
| Lift Bool | |
| Hashable Bool | |
Defined in Data.Hashable.Class | |
| SingKind Bool | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep Bool | |
| Storable Bool | Since: base-2.1 |
Defined in Foreign.Storable | |
| Bits Bool | Interpret Since: base-4.7.0.0 |
Defined in Data.Bits Methods (.&.) :: Bool -> Bool -> Bool # (.|.) :: Bool -> Bool -> Bool # complement :: Bool -> Bool # shift :: Bool -> Int -> Bool # rotate :: Bool -> Int -> Bool # setBit :: Bool -> Int -> Bool # clearBit :: Bool -> Int -> Bool # complementBit :: Bool -> Int -> Bool # testBit :: Bool -> Int -> Bool # bitSizeMaybe :: Bool -> Maybe Int # shiftL :: Bool -> Int -> Bool # unsafeShiftL :: Bool -> Int -> Bool # shiftR :: Bool -> Int -> Bool # unsafeShiftR :: Bool -> Int -> Bool # rotateL :: Bool -> Int -> Bool # | |
| FiniteBits Bool | Since: base-4.7.0.0 |
Defined in Data.Bits Methods finiteBitSize :: Bool -> Int # countLeadingZeros :: Bool -> Int # countTrailingZeros :: Bool -> Int # | |
| NFData Bool | |
Defined in Control.DeepSeq | |
| Unbox Bool | |
Defined in Data.Vector.Unboxed.Base | |
| HasAnnotation Bool | |
Defined in Lorentz.Annotation Methods getAnnotation :: Notes (ToT Bool) # | |
| IsoValue Bool | |
| TypeHasDoc Bool | |
Defined in Michelson.Typed.Haskell.Doc Associated Types Methods typeDocName :: Proxy Bool -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy Bool -> WithinParens -> Markdown # typeDocDependencies :: Proxy Bool -> [SomeDocDefinitionItem] # | |
| 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) # sShow_ :: forall (t :: Bool). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Bool]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PEnum Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Bool | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: forall (t :: Bool). Sing t -> Sing (Apply SuccSym0 t) # sPred :: forall (t :: Bool). Sing t -> Sing (Apply PredSym0 t) # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: forall (t :: Bool). Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: forall (t1 :: Bool) (t2 :: Bool) (t3 :: Bool). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Bool | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Bool | |
| SOrd Bool | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Bool) (t2 :: Bool). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Bool | |
| PEq Bool | |
| SingI 'False | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI 'True | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| 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 :: PrimMonad m => Mutable Vector (PrimState m) Bool -> m (Vector Bool) # basicUnsafeThaw :: PrimMonad m => Vector Bool -> m (Mutable Vector (PrimState m) Bool) # basicLength :: Vector Bool -> Int # basicUnsafeSlice :: Int -> Int -> Vector Bool -> Vector Bool # basicUnsafeIndexM :: Monad m => Vector Bool -> Int -> m Bool # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Bool -> Vector Bool -> m () # | |
| UnaryArithOpHs Not Bool | |
Defined in Lorentz.Arith Associated Types type UnaryArithResHs Not Bool # | |
| MVector MVector Bool | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Bool -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Bool -> MVector s Bool # basicOverlaps :: MVector s Bool -> MVector s Bool -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Bool) # basicInitialize :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Bool -> m (MVector (PrimState m) Bool) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m Bool # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Bool -> Int -> Bool -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Bool -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Bool -> Bool -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Bool -> MVector (PrimState m) Bool -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Bool -> Int -> m (MVector (PrimState m) Bool) # | |
| ArithOpHs Or Bool Bool | |
Defined in Lorentz.Arith Associated Types type ArithResHs Or Bool Bool # | |
| ArithOpHs And Bool Bool | |
Defined in Lorentz.Arith Associated Types type ArithResHs And Bool Bool # | |
| ArithOpHs Xor Bool Bool | |
Defined in Lorentz.Arith Associated Types type ArithResHs Xor Bool Bool # | |
| () :=> (Bounded Bool) | |
| () :=> (Enum Bool) | |
| () :=> (Eq Bool) | |
| () :=> (Ord Bool) | |
| () :=> (Read Bool) | |
| () :=> (Show Bool) | |
| () :=> (Bits Bool) | |
| SingI NotSym0 | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal | |
| SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods sing :: Sing ShowParenSym0 # | |
| SingI OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SuppressUnusedWarnings NotSym0 | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680152586Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (||@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (&&@#@$) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679803720Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowParenSym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings OrSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings AndSym0 | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680152573Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680595859Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (<=?@#@$) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI x => SingI ((||@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((&&@#@$$) x :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SingI x => SingI ((<=?@#@$$) x :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods sing :: Sing ((<=?@#@$$) x) # | |
| SAlternative f => SingI (GuardSym0 :: TyFun Bool (f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (WhenSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SApplicative f => SingI (UnlessSym0 :: TyFun Bool (f () ~> f ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing UnlessSym0 # | |
| SingI (ListnullSym0 :: TyFun [a] Bool -> Type) | |
| SEq a => SingI (ListisPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
| SingI (NullSym0 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (IsSuffixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsSuffixOfSym0 # | |
| SEq a => SingI (IsPrefixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsPrefixOfSym0 # | |
| SEq a => SingI (IsInfixOfSym0 :: TyFun [a] ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IsInfixOfSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SEq a => SingI (ListelemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
| SEq a => SingI (NotElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SEq a => SingI (ElemSym0 :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (OrSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AndSym0 :: TyFun (t Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SEq a => SingI ((==@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SEq a => SingI ((/=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI (Bool_Sym0 :: TyFun a (a ~> (Bool ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| SOrd a => SingI ((>@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((>=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SOrd a => SingI ((<=@#@$) :: TyFun a (a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SingI (ListtakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListspanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListpartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
| SingI (ListnubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
| SingI (ListfilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (ListdropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
| SingI (UnionBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnionBySym0 # | |
| SingI (TakeWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing TakeWhileSym0 # | |
| SingI (SpanSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (SelectSym0 :: TyFun (a ~> Bool) (a ~> (([a], [a]) ~> ([a], [a]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (PartitionSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing PartitionSym0 # | |
| SingI (NubBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IntersectBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing IntersectBySym0 # | |
| SingI (GroupBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> [[a]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing GroupBySym0 # | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndicesSym0 :: TyFun (a ~> Bool) ([a] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndicesSym0 # | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SingI (FilterSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FilterSym0 # | |
| SingI (Elem_bySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (DropWhileSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DropWhileSym0 # | |
| SingI (DropWhileEndSym0 :: TyFun (a ~> Bool) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteFirstsBySym0 :: TyFun (a ~> (a ~> Bool)) ([a] ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods | |
| SingI (DeleteBySym0 :: TyFun (a ~> (a ~> Bool)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing DeleteBySym0 # | |
| SingI (BreakSym0 :: TyFun (a ~> Bool) ([a] ~> ([a], [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AnySym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (AllSym0 :: TyFun (a ~> Bool) ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (UntilSym0 :: TyFun (a ~> Bool) ((a ~> a) ~> (a ~> a)) -> Type) | |
Defined in Data.Singletons.Prelude.Base | |
| SuppressUnusedWarnings ((||@#@$$) a6989586621679772157 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((&&@#@$$) a6989586621679771912 :: TyFun Bool Bool -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803720Sym1 a6989586621679803718 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GuardSym0 :: TyFun Bool (f6989586621679962724 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595859Sym1 a6989586621680595856 :: TyFun Bool (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WhenSym0 :: TyFun Bool (f6989586621679962753 () ~> f6989586621679962753 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnlessSym0 :: TyFun Bool (f6989586621681401670 () ~> f6989586621681401670 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnullSym0 :: TyFun [a6989586621680686782] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListisPrefixOfSym0 :: TyFun [a6989586621680686805] ([a6989586621680686805] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun [a6989586621680316437] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym0 :: TyFun [a6989586621680316402] ([a6989586621680316402] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym0 :: TyFun [a6989586621680316403] ([a6989586621680316403] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym0 :: TyFun [a6989586621680316401] ([a6989586621680316401] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679913399) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679913400) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) | |
Defined in Data.Singletons.TypeLits.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym0 :: TyFun a6989586621680686793 ([a6989586621680686793] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680316399 ([a6989586621680316399] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680316400 ([a6989586621680316400] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OrSym0 :: TyFun (t6989586621680742301 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742866Scrutinee_6989586621680742628Sym0 :: TyFun (t6989586621680742381 Bool) All -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742857Scrutinee_6989586621680742630Sym0 :: TyFun (t6989586621680742381 Bool) Any -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734318Scrutinee_6989586621680734256Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734291Scrutinee_6989586621680734254Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AndSym0 :: TyFun (t6989586621680742302 Bool) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym0 :: TyFun k6989586621679774969 (k6989586621679774969 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$) :: TyFun a6989586621679774975 (a6989586621679774975 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$) :: TyFun a6989586621679774975 (a6989586621679774975 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym0 :: TyFun a6989586621679771144 (a6989586621679771144 ~> (Bool ~> a6989586621679771144)) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792578Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792560Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792542Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792524Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792622Scrutinee_6989586621679792413Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792604Scrutinee_6989586621679792411Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792513Scrutinee_6989586621679792401Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792508Scrutinee_6989586621679792399Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680921217Sym0 :: TyFun a6989586621680742398 (Identity a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680921344Sym0 :: TyFun (Identity a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListtakeWhileSym0 :: TyFun (a6989586621680686811 ~> Bool) ([a6989586621680686811] ~> [a6989586621680686811]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListspanSym0 :: TyFun (a6989586621680686809 ~> Bool) ([a6989586621680686809] ~> ([a6989586621680686809], [a6989586621680686809])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListpartitionSym0 :: TyFun (a6989586621680686807 ~> Bool) ([a6989586621680686807] ~> ([a6989586621680686807], [a6989586621680686807])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListnubBySym0 :: TyFun (a6989586621680686799 ~> (a6989586621680686799 ~> Bool)) ([a6989586621680686799] ~> [a6989586621680686799]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListfilterSym0 :: TyFun (a6989586621680686808 ~> Bool) ([a6989586621680686808] ~> [a6989586621680686808]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListdropWhileSym0 :: TyFun (a6989586621680686810 ~> Bool) ([a6989586621680686810] ~> [a6989586621680686810]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnionBySym0 :: TyFun (a6989586621680316316 ~> (a6989586621680316316 ~> Bool)) ([a6989586621680316316] ~> ([a6989586621680316316] ~> [a6989586621680316316])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TakeWhileSym0 :: TyFun (a6989586621680316343 ~> Bool) ([a6989586621680316343] ~> [a6989586621680316343]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SpanSym0 :: TyFun (a6989586621680316340 ~> Bool) ([a6989586621680316340] ~> ([a6989586621680316340], [a6989586621680316340])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SelectSym0 :: TyFun (a6989586621680316326 ~> Bool) (a6989586621680316326 ~> (([a6989586621680316326], [a6989586621680316326]) ~> ([a6989586621680316326], [a6989586621680316326]))) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionSym0 :: TyFun (a6989586621680316327 ~> Bool) ([a6989586621680316327] ~> ([a6989586621680316327], [a6989586621680316327])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NubBySym0 :: TyFun (a6989586621680316318 ~> (a6989586621680316318 ~> Bool)) ([a6989586621680316318] ~> [a6989586621680316318]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320723ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320723YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320723X_6989586621680320724Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320680ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320680YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320680X_6989586621680320681Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IntersectBySym0 :: TyFun (a6989586621680316344 ~> (a6989586621680316344 ~> Bool)) ([a6989586621680316344] ~> ([a6989586621680316344] ~> [a6989586621680316344])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GroupBySym0 :: TyFun (a6989586621680316330 ~> (a6989586621680316330 ~> Bool)) ([a6989586621680316330] ~> [[a6989586621680316330]]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndicesSym0 :: TyFun (a6989586621680316346 ~> Bool) ([a6989586621680316346] ~> [Nat]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterSym0 :: TyFun (a6989586621680316351 ~> Bool) ([a6989586621680316351] ~> [a6989586621680316351]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym0 :: TyFun (a6989586621680316317 ~> (a6989586621680316317 ~> Bool)) (a6989586621680316317 ~> ([a6989586621680316317] ~> Bool)) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileSym0 :: TyFun (a6989586621680316342 ~> Bool) ([a6989586621680316342] ~> [a6989586621680316342]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DropWhileEndSym0 :: TyFun (a6989586621680316341 ~> Bool) ([a6989586621680316341] ~> [a6989586621680316341]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteFirstsBySym0 :: TyFun (a6989586621680316356 ~> (a6989586621680316356 ~> Bool)) ([a6989586621680316356] ~> ([a6989586621680316356] ~> [a6989586621680316356])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DeleteBySym0 :: TyFun (a6989586621680316357 ~> (a6989586621680316357 ~> Bool)) (a6989586621680316357 ~> ([a6989586621680316357] ~> [a6989586621680316357])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (BreakSym0 :: TyFun (a6989586621680316339 ~> Bool) ([a6989586621680316339] ~> ([a6989586621680316339], [a6989586621680316339])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680316420 ~> Bool) ([a6989586621680316420] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680316421 ~> Bool) ([a6989586621680316421] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UntilSym0 :: TyFun (a6989586621679941593 ~> Bool) ((a6989586621679941593 ~> a6989586621679941593) ~> (a6989586621679941593 ~> a6989586621679941593)) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (ListisPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (ListelemSym1 d :: TyFun [a] Bool -> Type) | |
| (SEq a, SingI d) => SingI (NotElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SEq a, SingI d) => SingI (IsSuffixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsSuffixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsPrefixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsPrefixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (IsInfixOfSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (IsInfixOfSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AnySym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (AllSym1 d :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI d => SingI (Elem_bySym1 d :: TyFun a ([a] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| (SFoldable t, SEq a) => SingI (NotElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing NotElemSym0 # | |
| (SFoldable t, SEq a) => SingI (ElemSym0 :: TyFun a (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SEq a, SingI x) => SingI ((==@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| (SEq a, SingI x) => SingI ((/=@#@$$) x :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq | |
| SingI d => SingI (Bool_Sym1 d :: TyFun a (Bool ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SOrd a, SingI d) => SingI ((>@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((>=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| (SOrd a, SingI d) => SingI ((<=@#@$$) d :: TyFun a Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AnySym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SFoldable t => SingI (AllSym0 :: TyFun (a ~> Bool) (t a ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SMonadPlus m => SingI (MfilterSym0 :: TyFun (a ~> Bool) (m a ~> m a) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing MfilterSym0 # | |
| SApplicative m => SingI (FilterMSym0 :: TyFun (a ~> m Bool) ([a] ~> m [a]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods sing :: Sing FilterMSym0 # | |
| SuppressUnusedWarnings (ListisPrefixOfSym1 a6989586621680687765 :: TyFun [a6989586621680686805] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListelemSym1 a6989586621680687700 :: TyFun [a6989586621680686793] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680321269 :: TyFun [a6989586621680316399] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsSuffixOfSym1 a6989586621680321289 :: TyFun [a6989586621680316402] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsPrefixOfSym1 a6989586621680321295 :: TyFun [a6989586621680316403] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsInfixOfSym1 a6989586621680321283 :: TyFun [a6989586621680316401] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 a6989586621680321276 :: TyFun [a6989586621680316400] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680321526 :: TyFun [a6989586621680316420] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680321533 :: TyFun [a6989586621680316421] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680725232 b6989586621680725233) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680725234 b6989586621680725235) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320493Scrutinee_6989586621680317017Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym1 a6989586621680320412 :: TyFun a6989586621680316317 ([a6989586621680316317] ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym0 :: TyFun a6989586621680742292 (t6989586621680742291 a6989586621680742292 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734318Scrutinee_6989586621680734256Sym1 x6989586621680734311 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734291Scrutinee_6989586621680734254Sym1 x6989586621680734284 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680744088Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743921Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743754Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743413Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743293Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DefaultEqSym1 a6989586621679774970 :: TyFun k6989586621679774969 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((==@#@$$) x6989586621679774976 :: TyFun a6989586621679774975 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((/=@#@$$) x6989586621679774978 :: TyFun a6989586621679774975 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Eq Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Bool_Sym1 a6989586621679771150 :: TyFun a6989586621679771144 (Bool ~> a6989586621679771144) -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792578Sym1 a6989586621679792576 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792560Sym1 a6989586621679792558 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792542Sym1 a6989586621679792540 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621679792524Sym1 a6989586621679792522 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792622Scrutinee_6989586621679792413Sym1 x6989586621679792620 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792604Scrutinee_6989586621679792411Sym1 x6989586621679792602 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792513Scrutinee_6989586621679792401Sym1 x6989586621679792506 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792508Scrutinee_6989586621679792399Sym1 x6989586621679792506 :: TyFun k1 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>@#@$$) arg6989586621679792482 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((>=@#@$$) arg6989586621679792486 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<@#@$$) arg6989586621679792474 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((<=@#@$$) arg6989586621679792478 :: TyFun a6989586621679792381 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681108278Sym0 :: TyFun (Arg a6989586621681107123 b6989586621681107124) (Arg a6989586621681107123 b6989586621681107124 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680921217Sym1 a6989586621680921215 :: TyFun (Identity a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320576ZsSym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] [a6989586621680316340] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320576YsSym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] [a6989586621680316340] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320576X_6989586621680320577Sym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] ([a6989586621680316340], [a6989586621680316340]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320428NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680320756Sym0 :: TyFun (a6989586621680316437 ~> Bool) (TyFun k (TyFun a6989586621680316437 (TyFun [a6989586621680316437] [a6989586621680316437] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym0 :: TyFun (a6989586621680742300 ~> Bool) (t6989586621680742299 a6989586621680742300 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym0 :: TyFun (a6989586621680742298 ~> Bool) (t6989586621680742297 a6989586621680742298 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679941729GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Base Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MfilterSym0 :: TyFun (a6989586621681401666 ~> Bool) (m6989586621681401665 a6989586621681401666 ~> m6989586621681401665 a6989586621681401666) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FilterMSym0 :: TyFun (a6989586621681401704 ~> m6989586621681401703 Bool) ([a6989586621681401704] ~> m6989586621681401703 [a6989586621681401704]) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Bool_Sym2 d1 d2 :: TyFun Bool a -> Type) | |
Defined in Data.Singletons.Prelude.Bool | |
| (SingI d1, SingI d2) => SingI (Elem_bySym2 d1 d2 :: TyFun [a] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SFoldable t => SingI (NullSym0 :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SEq a, SingI d) => SingI (NotElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing (NotElemSym1 d t) # | |
| (SFoldable t, SEq a, SingI d) => SingI (ElemSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AnySym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| (SFoldable t, SingI d) => SingI (AllSym1 d t :: TyFun (t a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (Bool_Sym2 a6989586621679771151 a6989586621679771150 :: TyFun Bool a6989586621679771144 -> Type) | |
Defined in Data.Singletons.Prelude.Bool Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_bySym2 a6989586621680320413 a6989586621680320412 :: TyFun [a6989586621680316317] Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320760Scrutinee_6989586621680316995Sym0 :: TyFun k1 (TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320655Scrutinee_6989586621680317001Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320641Scrutinee_6989586621680317003Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320561Scrutinee_6989586621680317013Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320493Scrutinee_6989586621680317017Sym1 n6989586621680320491 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320474Scrutinee_6989586621680317019Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320459Scrutinee_6989586621680317021Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320438Scrutinee_6989586621680317023Sym0 :: 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 :: () # | |
| SuppressUnusedWarnings (Null_6989586621680744215Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680744048Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680743881Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680743732Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680743556Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680743249Sym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NullSym0 :: TyFun (t6989586621680742381 a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (NotElemSym1 a6989586621680742770 t6989586621680742291 :: TyFun (t6989586621680742291 a6989586621680742292) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680743256Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680744088Sym1 a6989586621680744086 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743921Sym1 a6989586621680743919 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743754Sym1 a6989586621680743752 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743413Sym1 a6989586621680743411 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680743293Sym1 a6989586621680743291 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemSym1 arg6989586621680743044 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AnySym1 a6989586621680742841 t6989586621680742299 :: TyFun (t6989586621680742299 a6989586621680742300) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (AllSym1 a6989586621680742828 t6989586621680742297 :: TyFun (t6989586621680742297 a6989586621680742298) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681402162Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681108278Sym1 a6989586621681108276 :: TyFun (Arg a6989586621681107123 b6989586621681107124) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681402159Sym0 :: TyFun (k2 ~> f6989586621679962807 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679962807 [k2]) (f6989586621679962807 [k2]) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681401991Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679962831 k1) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320760Scrutinee_6989586621680316995Sym1 x6989586621680320758 :: TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320655Scrutinee_6989586621680317001Sym1 n6989586621680320652 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320641Scrutinee_6989586621680317003Sym1 n6989586621680320638 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320561Scrutinee_6989586621680317013Sym1 key6989586621680320557 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320474Scrutinee_6989586621680317019Sym1 x6989586621680320471 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320459Scrutinee_6989586621680317021Sym1 x6989586621680320456 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320438Scrutinee_6989586621680317023Sym1 y6989586621680320435 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680743256Sym1 a_69895866216807432516989586621680743255 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129192Scrutinee_6989586621680128958Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681402162Sym1 x6989586621681402161 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320459Scrutinee_6989586621680317021Sym2 xs6989586621680320457 x6989586621680320456 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320438Scrutinee_6989586621680317023Sym2 ys6989586621680320436 y6989586621680320435 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320655Scrutinee_6989586621680317001Sym2 x6989586621680320653 n6989586621680320652 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320641Scrutinee_6989586621680317003Sym2 x6989586621680320639 n6989586621680320638 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320561Scrutinee_6989586621680317013Sym2 x6989586621680320558 key6989586621680320557 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320474Scrutinee_6989586621680317019Sym2 xs6989586621680320472 x6989586621680320471 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680743256Sym2 t6989586621680743263 a_69895866216807432516989586621680743255 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129192Scrutinee_6989586621680128958Sym1 x6989586621680129191 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym0 :: 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 :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym0 :: 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 :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681402162Sym2 p6989586621681402157 x6989586621681402161 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320760Scrutinee_6989586621680316995Sym2 xs6989586621680320759 x6989586621680320758 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680320828Sym0 :: TyFun (b6989586621679962835 ~> (a6989586621680316420 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316420 (TyFun [a6989586621680316420] (TyFun b6989586621679962835 (m6989586621679962831 b6989586621679962835) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621681402162Sym3 a_69895866216814021556989586621681402158 p6989586621681402157 x6989586621681402161 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320760Scrutinee_6989586621680316995Sym3 p6989586621680320754 xs6989586621680320759 x6989586621680320758 :: TyFun k Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320561Scrutinee_6989586621680317013Sym3 y6989586621680320559 x6989586621680320558 key6989586621680320557 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320459Scrutinee_6989586621680317021Sym3 ls6989586621680320458 xs6989586621680320457 x6989586621680320456 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129192Scrutinee_6989586621680128958Sym2 x06989586621680129182 x6989586621680129191 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym1 x16989586621680129110 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym1 x16989586621680129053 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320438Scrutinee_6989586621680317023Sym3 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320438Scrutinee_6989586621680317023Sym4 eq6989586621680320426 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun k3 Bool -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129192Scrutinee_6989586621680128958Sym3 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym2 x26989586621680129111 x16989586621680129110 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym2 x26989586621680129054 x16989586621680129053 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129192Scrutinee_6989586621680128958Sym4 arg_69895866216801289546989586621680129178 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k4 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym3 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym3 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym4 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym4 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129115Scrutinee_6989586621680128972Sym5 arg_69895866216801289686989586621680129106 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680129058Scrutinee_6989586621680128982Sym5 arg_69895866216801289786989586621680129049 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k5 Bool -> Type) | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| type Rep Bool | |
| data Sing (a :: Bool) | |
| type DemoteRep Bool | |
Defined in GHC.Generics | |
| newtype Vector Bool | |
| type ToT Bool | |
Defined in Michelson.Typed.Haskell.Value | |
| type TypeDocFieldDescriptions Bool | |
Defined in Michelson.Typed.Haskell.Doc | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680125214Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680125212Sym0 | |
| type Demote Bool | |
Defined in Data.Singletons.Prelude.Instances | |
| type UnaryArithResHs Not Bool | |
Defined in Lorentz.Arith | |
| type Show_ (arg0 :: Bool) | |
| type FromEnum (a :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg0 :: Bool) | |
| type Succ (arg0 :: Bool) | |
| newtype MVector s Bool | |
| type ArithResHs Or Bool Bool | |
Defined in Lorentz.Arith | |
| type ArithResHs And Bool Bool | |
Defined in Lorentz.Arith | |
| type ArithResHs Xor Bool Bool | |
Defined in Lorentz.Arith | |
| 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 ShowsPrec a1 (a2 :: Bool) a3 | |
| type EnumFromThenTo (arg1 :: Bool) (arg2 :: Bool) (arg3 :: Bool) | |
| type Apply NotSym0 (a6989586621679772458 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply FromEnum_6989586621680152586Sym0 (a6989586621680152585 :: Bool) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply All_Sym0 (a6989586621680229712 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AllSym0 (t6989586621680197047 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Any_Sym0 (a6989586621680229711 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AnySym0 (t6989586621680197060 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ToEnum_6989586621680152573Sym0 (a6989586621680152572 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply GetAllSym0 (a6989586621680197044 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAnySym0 (a6989586621680197057 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply ((||@#@$$) a6989586621679772157 :: TyFun Bool Bool -> Type) (b6989586621679772158 :: Bool) | |
| type Apply ((&&@#@$$) a6989586621679771912 :: TyFun Bool Bool -> Type) (b6989586621679771913 :: Bool) | |
| type Apply (Compare_6989586621679803720Sym1 a6989586621679803718 :: TyFun Bool Ordering -> Type) (a6989586621679803719 :: Bool) | |
| type Apply ((<=?@#@$$) a3530822107858468865 :: TyFun Nat Bool -> Type) (b3530822107858468866 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (Let6989586621680734291Scrutinee_6989586621680734254Sym1 x6989586621680734284 :: TyFun k1 Bool -> Type) (y6989586621680734285 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734318Scrutinee_6989586621680734256Sym1 x6989586621680734311 :: TyFun k1 Bool -> Type) (y6989586621680734312 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply ((==@#@$$) x6989586621679774976 :: TyFun a Bool -> Type) (y6989586621679774977 :: a) | |
| type Apply ((/=@#@$$) x6989586621679774978 :: TyFun a Bool -> Type) (y6989586621679774979 :: a) | |
| type Apply (DefaultEqSym1 a6989586621679774970 :: TyFun k Bool -> Type) (b6989586621679774971 :: k) | |
Defined in Data.Singletons.Prelude.Eq | |
| type Apply (Let6989586621679792508Scrutinee_6989586621679792399Sym1 x6989586621679792506 :: TyFun k1 Bool -> Type) (y6989586621679792507 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679792578Sym1 a6989586621679792576 :: TyFun a Bool -> Type) (a6989586621679792577 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679792560Sym1 a6989586621679792558 :: TyFun a Bool -> Type) (a6989586621679792559 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679792542Sym1 a6989586621679792540 :: TyFun a Bool -> Type) (a6989586621679792541 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (TFHelper_6989586621679792524Sym1 a6989586621679792522 :: TyFun a Bool -> Type) (a6989586621679792523 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<=@#@$$) arg6989586621679792478 :: TyFun a Bool -> Type) (arg6989586621679792479 :: a) | |
| type Apply ((>=@#@$$) arg6989586621679792486 :: TyFun a Bool -> Type) (arg6989586621679792487 :: a) | |
| type Apply ((>@#@$$) arg6989586621679792482 :: TyFun a Bool -> Type) (arg6989586621679792483 :: a) | |
| type Apply (Let6989586621679792622Scrutinee_6989586621679792413Sym1 x6989586621679792620 :: TyFun k1 Bool -> Type) (y6989586621679792621 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792604Scrutinee_6989586621679792411Sym1 x6989586621679792602 :: TyFun k1 Bool -> Type) (y6989586621679792603 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792513Scrutinee_6989586621679792401Sym1 x6989586621679792506 :: TyFun k1 Bool -> Type) (y6989586621679792507 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ((<@#@$$) arg6989586621679792474 :: TyFun a Bool -> Type) (arg6989586621679792475 :: a) | |
| type Apply (Bool_Sym2 a6989586621679771151 a6989586621679771150 :: TyFun Bool a -> Type) (a6989586621679771152 :: Bool) | |
| type Apply (Let6989586621680320493Scrutinee_6989586621680317017Sym1 n6989586621680320491 :: TyFun k Bool -> Type) (x6989586621680320492 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320474Scrutinee_6989586621680317019Sym2 xs6989586621680320472 x6989586621680320471 :: TyFun k3 Bool -> Type) (n6989586621680320473 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320641Scrutinee_6989586621680317003Sym2 x6989586621680320639 n6989586621680320638 :: TyFun k3 Bool -> Type) (xs6989586621680320640 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320655Scrutinee_6989586621680317001Sym2 x6989586621680320653 n6989586621680320652 :: TyFun k3 Bool -> Type) (xs6989586621680320654 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Lambda_6989586621680743256Sym2 t6989586621680743263 a_69895866216807432516989586621680743255 :: TyFun k3 Bool -> Type) (t6989586621680743264 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym3 y6989586621680320559 x6989586621680320558 key6989586621680320557 :: TyFun k3 Bool -> Type) (xys6989586621680320560 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym3 y6989586621680320559 x6989586621680320558 key6989586621680320557 :: TyFun k3 Bool -> Type) (xys6989586621680320560 :: k3) = Let6989586621680320561Scrutinee_6989586621680317013 y6989586621680320559 x6989586621680320558 key6989586621680320557 xys6989586621680320560 | |
| type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym3 ls6989586621680320458 xs6989586621680320457 x6989586621680320456 :: TyFun k3 Bool -> Type) (l6989586621680320449 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym3 ls6989586621680320458 xs6989586621680320457 x6989586621680320456 :: TyFun k3 Bool -> Type) (l6989586621680320449 :: k3) = Let6989586621680320459Scrutinee_6989586621680317021 ls6989586621680320458 xs6989586621680320457 x6989586621680320456 l6989586621680320449 | |
| type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym3 p6989586621680320754 xs6989586621680320759 x6989586621680320758 :: TyFun k Bool -> Type) (a_69895866216803207526989586621680320755 :: k) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym3 p6989586621680320754 xs6989586621680320759 x6989586621680320758 :: TyFun k Bool -> Type) (a_69895866216803207526989586621680320755 :: k) = Let6989586621680320760Scrutinee_6989586621680316995 p6989586621680320754 xs6989586621680320759 x6989586621680320758 a_69895866216803207526989586621680320755 | |
| type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym4 eq6989586621680320426 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun k3 Bool -> Type) (l6989586621680320427 :: k3) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym4 eq6989586621680320426 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun k3 Bool -> Type) (l6989586621680320427 :: k3) = Let6989586621680320438Scrutinee_6989586621680317023 eq6989586621680320426 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 l6989586621680320427 | |
| type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym4 arg_69895866216801289546989586621680129178 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k4 Bool -> Type) (arg_69895866216801289566989586621680129179 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym4 arg_69895866216801289546989586621680129178 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k4 Bool -> Type) (arg_69895866216801289566989586621680129179 :: k4) = Let6989586621680129192Scrutinee_6989586621680128958 arg_69895866216801289546989586621680129178 y6989586621680129183 x06989586621680129182 x6989586621680129191 arg_69895866216801289566989586621680129179 | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym5 arg_69895866216801289786989586621680129049 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k5 Bool -> Type) (arg_69895866216801289806989586621680129050 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym5 arg_69895866216801289786989586621680129049 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k5 Bool -> Type) (arg_69895866216801289806989586621680129050 :: k5) = Let6989586621680129058Scrutinee_6989586621680128982 arg_69895866216801289786989586621680129049 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 arg_69895866216801289806989586621680129050 | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym5 arg_69895866216801289686989586621680129106 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k5 Bool -> Type) (arg_69895866216801289706989586621680129107 :: k5) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym5 arg_69895866216801289686989586621680129106 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k5 Bool -> Type) (arg_69895866216801289706989586621680129107 :: k5) = Let6989586621680129115Scrutinee_6989586621680128972 arg_69895866216801289686989586621680129106 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 arg_69895866216801289706989586621680129107 | |
| type Eval (Not 'False) | |
Defined in Fcf.Data.Bool | |
| type Eval (Not 'True) | |
Defined in Fcf.Data.Bool | |
| type Apply (GuardSym0 :: TyFun Bool (f6989586621679962724 ()) -> Type) (a6989586621679962890 :: Bool) | |
| type Eval (Null (a2 ': as) :: Bool -> Type) | |
| type Eval (Null ('[] :: [a]) :: 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 ('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 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 Apply (||@#@$) (a6989586621679772157 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply (&&@#@$) (a6989586621679771912 :: Bool) | |
Defined in Data.Singletons.Prelude.Bool | |
| type Apply Compare_6989586621679803720Sym0 (a6989586621679803718 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowParenSym0 (a6989586621680577755 :: Bool) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply ShowsPrec_6989586621680595859Sym0 (a6989586621680595856 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (<=?@#@$) (a3530822107858468865 :: Nat) | |
Defined in Data.Singletons.TypeLits.Internal | |
| type Apply (ShowsPrec_6989586621680595859Sym1 a6989586621680595856 :: TyFun Bool (Symbol ~> Symbol) -> Type) (a6989586621680595857 :: Bool) | |
| type Apply (WhenSym0 :: TyFun Bool (f6989586621679962753 () ~> f6989586621679962753 ()) -> Type) (a6989586621679963138 :: Bool) | |
| type Apply (UnlessSym0 :: TyFun Bool (f6989586621681401670 () ~> f6989586621681401670 ()) -> Type) (a6989586621681402022 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (UnlessSym0 :: TyFun Bool (f6989586621681401670 () ~> f6989586621681401670 ()) -> Type) (a6989586621681402022 :: Bool) = UnlessSym1 a6989586621681402022 f6989586621681401670 :: TyFun (f6989586621681401670 ()) (f6989586621681401670 ()) -> Type | |
| type Apply (ListelemSym0 :: TyFun a6989586621680686793 ([a6989586621680686793] ~> Bool) -> Type) (a6989586621680687700 :: a6989586621680686793) | |
| type Apply (NotElemSym0 :: TyFun a6989586621680316399 ([a6989586621680316399] ~> Bool) -> Type) (a6989586621680321269 :: a6989586621680316399) | |
| type Apply (ElemSym0 :: TyFun a6989586621680316400 ([a6989586621680316400] ~> Bool) -> Type) (a6989586621680321276 :: a6989586621680316400) | |
| type Apply (Let6989586621680734291Scrutinee_6989586621680734254Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680734284 :: k1) | |
| type Apply (Let6989586621680734318Scrutinee_6989586621680734256Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621680734311 :: k1) | |
| type Apply ((==@#@$) :: TyFun a6989586621679774975 (a6989586621679774975 ~> Bool) -> Type) (x6989586621679774976 :: a6989586621679774975) | |
| type Apply ((/=@#@$) :: TyFun a6989586621679774975 (a6989586621679774975 ~> Bool) -> Type) (x6989586621679774978 :: a6989586621679774975) | |
| type Apply (DefaultEqSym0 :: TyFun k6989586621679774969 (k6989586621679774969 ~> Bool) -> Type) (a6989586621679774970 :: k6989586621679774969) | |
Defined in Data.Singletons.Prelude.Eq type Apply (DefaultEqSym0 :: TyFun k6989586621679774969 (k6989586621679774969 ~> Bool) -> Type) (a6989586621679774970 :: k6989586621679774969) = DefaultEqSym1 a6989586621679774970 | |
| type Apply (Bool_Sym0 :: TyFun a6989586621679771144 (a6989586621679771144 ~> (Bool ~> a6989586621679771144)) -> Type) (a6989586621679771150 :: a6989586621679771144) | |
| type Apply (Let6989586621679792508Scrutinee_6989586621679792399Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679792506 :: k1) | |
| type Apply (TFHelper_6989586621679792578Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (a6989586621679792576 :: a6989586621679792381) | |
| type Apply (TFHelper_6989586621679792560Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (a6989586621679792558 :: a6989586621679792381) | |
| type Apply (TFHelper_6989586621679792542Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (a6989586621679792540 :: a6989586621679792381) | |
| type Apply (TFHelper_6989586621679792524Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (a6989586621679792522 :: a6989586621679792381) | |
| type Apply ((<=@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (arg6989586621679792478 :: a6989586621679792381) | |
| type Apply ((>=@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (arg6989586621679792486 :: a6989586621679792381) | |
| type Apply ((>@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (arg6989586621679792482 :: a6989586621679792381) | |
| type Apply (Let6989586621679792622Scrutinee_6989586621679792413Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679792620 :: k1) | |
| type Apply (Let6989586621679792604Scrutinee_6989586621679792411Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679792602 :: k1) | |
| type Apply (Let6989586621679792513Scrutinee_6989586621679792401Sym0 :: TyFun k1 (TyFun k1 Bool -> Type) -> Type) (x6989586621679792506 :: k1) | |
| type Apply ((<@#@$) :: TyFun a6989586621679792381 (a6989586621679792381 ~> Bool) -> Type) (arg6989586621679792474 :: a6989586621679792381) | |
| type Apply (Elem_6989586621680921217Sym0 :: TyFun a6989586621680742398 (Identity a6989586621680742398 ~> Bool) -> Type) (a6989586621680921215 :: a6989586621680742398) | |
| type Apply (Let6989586621680320493Scrutinee_6989586621680317017Sym0 :: TyFun k1 (TyFun k Bool -> Type) -> Type) (n6989586621680320491 :: k1) | |
| type Apply (Elem_bySym1 a6989586621680320412 :: TyFun a6989586621680316317 ([a6989586621680316317] ~> Bool) -> Type) (a6989586621680320413 :: a6989586621680316317) | |
| type Apply (Elem_6989586621680743293Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743291 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680743293Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743291 :: a6989586621680742398) = Elem_6989586621680743293Sym1 a6989586621680743291 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type | |
| type Apply (ElemSym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (arg6989586621680743044 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NotElemSym0 :: TyFun a6989586621680742292 (t6989586621680742291 a6989586621680742292 ~> Bool) -> Type) (a6989586621680742770 :: a6989586621680742292) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (NotElemSym0 :: TyFun a6989586621680742292 (t6989586621680742291 a6989586621680742292 ~> Bool) -> Type) (a6989586621680742770 :: a6989586621680742292) = NotElemSym1 a6989586621680742770 t6989586621680742291 :: TyFun (t6989586621680742291 a6989586621680742292) Bool -> Type | |
| type Apply (Elem_6989586621680743413Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743411 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680743413Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743411 :: a6989586621680742398) = Elem_6989586621680743413Sym1 a6989586621680743411 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type | |
| type Apply (Elem_6989586621680743754Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743752 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680743754Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743752 :: a6989586621680742398) = Elem_6989586621680743754Sym1 a6989586621680743752 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type | |
| type Apply (Elem_6989586621680743921Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743919 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680743921Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680743919 :: a6989586621680742398) = Elem_6989586621680743921Sym1 a6989586621680743919 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type | |
| type Apply (Elem_6989586621680744088Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680744086 :: a6989586621680742398) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Elem_6989586621680744088Sym0 :: TyFun a6989586621680742398 (t6989586621680742381 a6989586621680742398 ~> Bool) -> Type) (a6989586621680744086 :: a6989586621680742398) = Elem_6989586621680744088Sym1 a6989586621680744086 t6989586621680742381 :: TyFun (t6989586621680742381 a6989586621680742398) Bool -> Type | |
| type Apply (Bool_Sym1 a6989586621679771150 :: TyFun a6989586621679771144 (Bool ~> a6989586621679771144) -> Type) (a6989586621679771151 :: a6989586621679771144) | |
| type Apply (Let6989586621680320474Scrutinee_6989586621680317019Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680320471 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680320557 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym0 :: TyFun k1 (TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (key6989586621680320557 :: k1) = Let6989586621680320561Scrutinee_6989586621680317013Sym1 key6989586621680320557 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320641Scrutinee_6989586621680317003Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680320638 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320655Scrutinee_6989586621680317001Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (n6989586621680320652 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680320435 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (y6989586621680320435 :: k1) = Let6989586621680320438Scrutinee_6989586621680317023Sym1 y6989586621680320435 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680320456 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym0 :: TyFun k1 (TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680320456 :: k1) = Let6989586621680320459Scrutinee_6989586621680317021Sym1 x6989586621680320456 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym0 :: TyFun k1 (TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680320758 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym0 :: TyFun k1 (TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) -> Type) (x6989586621680320758 :: k1) = Let6989586621680320760Scrutinee_6989586621680316995Sym1 x6989586621680320758 :: TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680743256Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (a_69895866216807432516989586621680743255 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621681402162Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621681402161 :: k1) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681402162Sym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621681402161 :: k1) = Lambda_6989586621681402162Sym1 x6989586621681402161 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320474Scrutinee_6989586621680317019Sym1 x6989586621680320471 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (xs6989586621680320472 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym1 key6989586621680320557 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680320558 :: k1) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym1 key6989586621680320557 :: TyFun k1 (TyFun k2 (TyFun k3 Bool -> Type) -> Type) -> Type) (x6989586621680320558 :: k1) = Let6989586621680320561Scrutinee_6989586621680317013Sym2 key6989586621680320557 x6989586621680320558 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621680320641Scrutinee_6989586621680317003Sym1 n6989586621680320638 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680320639 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320655Scrutinee_6989586621680317001Sym1 n6989586621680320652 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (x6989586621680320653 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym1 y6989586621680320435 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680320436 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym1 y6989586621680320435 :: TyFun k2 (TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) -> Type) (ys6989586621680320436 :: k2) = Let6989586621680320438Scrutinee_6989586621680317023Sym2 y6989586621680320435 ys6989586621680320436 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym1 x6989586621680320456 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680320457 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym1 x6989586621680320456 :: TyFun k2 (TyFun [k1] (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680320457 :: k2) = Let6989586621680320459Scrutinee_6989586621680317021Sym2 x6989586621680320456 xs6989586621680320457 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Lambda_6989586621680743256Sym1 a_69895866216807432516989586621680743255 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (t6989586621680743263 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680129191 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x6989586621680129191 :: k1) = Let6989586621680129192Scrutinee_6989586621680128958Sym1 x6989586621680129191 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621681402162Sym1 x6989586621681402161 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (p6989586621681402157 :: k2) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681402162Sym1 x6989586621681402161 :: TyFun k2 (TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) -> Type) (p6989586621681402157 :: k2) = Lambda_6989586621681402162Sym2 x6989586621681402161 p6989586621681402157 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym2 x6989586621680320558 key6989586621680320557 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680320559 :: k2) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320561Scrutinee_6989586621680317013Sym2 x6989586621680320558 key6989586621680320557 :: TyFun k2 (TyFun k3 Bool -> Type) -> Type) (y6989586621680320559 :: k2) = Let6989586621680320561Scrutinee_6989586621680317013Sym3 x6989586621680320558 key6989586621680320557 y6989586621680320559 :: TyFun k3 Bool -> Type | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680129053 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680129053 :: k1) = Let6989586621680129058Scrutinee_6989586621680128982Sym1 x16989586621680129053 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680129110 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym0 :: TyFun k1 (TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (x16989586621680129110 :: k1) = Let6989586621680129115Scrutinee_6989586621680128972Sym1 x16989586621680129110 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym1 x6989586621680129191 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680129182 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym1 x6989586621680129191 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) -> Type) (x06989586621680129182 :: k2) = Let6989586621680129192Scrutinee_6989586621680128958Sym2 x6989586621680129191 x06989586621680129182 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621681402162Sym2 p6989586621681402157 x6989586621681402161 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216814021556989586621681402158 :: k3) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681402162Sym2 p6989586621681402157 x6989586621681402161 :: TyFun k3 (TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) -> Type) (a_69895866216814021556989586621681402158 :: k3) = Lambda_6989586621681402162Sym3 p6989586621681402157 x6989586621681402161 a_69895866216814021556989586621681402158 | |
| type Apply (Lambda_6989586621681402162Sym3 a_69895866216814021556989586621681402158 p6989586621681402157 x6989586621681402161 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681402168 :: Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681402162Sym3 a_69895866216814021556989586621681402158 p6989586621681402157 x6989586621681402161 :: TyFun Bool (TyFun [k1] [k1] -> Type) -> Type) (t6989586621681402168 :: Bool) = Lambda_6989586621681402162 a_69895866216814021556989586621681402158 p6989586621681402157 x6989586621681402161 t6989586621681402168 | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym1 x16989586621680129053 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680129054 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym1 x16989586621680129053 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680129054 :: k2) = Let6989586621680129058Scrutinee_6989586621680128982Sym2 x16989586621680129053 x26989586621680129054 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym1 x16989586621680129110 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680129111 :: k2) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym1 x16989586621680129110 :: TyFun k2 (TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) -> Type) (x26989586621680129111 :: k2) = Let6989586621680129115Scrutinee_6989586621680128972Sym2 x16989586621680129110 x26989586621680129111 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym2 x06989586621680129182 x6989586621680129191 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680129183 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym2 x06989586621680129182 x6989586621680129191 :: TyFun k1 (TyFun k3 (TyFun k4 Bool -> Type) -> Type) -> Type) (y6989586621680129183 :: k1) = Let6989586621680129192Scrutinee_6989586621680128958Sym3 x06989586621680129182 x6989586621680129191 y6989586621680129183 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym2 x26989586621680129054 x16989586621680129053 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680129055 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym2 x26989586621680129054 x16989586621680129053 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680129055 :: k1) = Let6989586621680129058Scrutinee_6989586621680128982Sym3 x26989586621680129054 x16989586621680129053 y6989586621680129055 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym2 x26989586621680129111 x16989586621680129110 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680129112 :: k1) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym2 x26989586621680129111 x16989586621680129110 :: TyFun k1 (TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) -> Type) (y6989586621680129112 :: k1) = Let6989586621680129115Scrutinee_6989586621680128972Sym3 x26989586621680129111 x16989586621680129110 y6989586621680129112 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym3 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801289546989586621680129178 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129192Scrutinee_6989586621680128958Sym3 y6989586621680129183 x06989586621680129182 x6989586621680129191 :: TyFun k3 (TyFun k4 Bool -> Type) -> Type) (arg_69895866216801289546989586621680129178 :: k3) = Let6989586621680129192Scrutinee_6989586621680128958Sym4 y6989586621680129183 x06989586621680129182 x6989586621680129191 arg_69895866216801289546989586621680129178 :: TyFun k4 Bool -> Type | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym3 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801289766989586621680129048 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym3 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801289766989586621680129048 :: k3) = Let6989586621680129058Scrutinee_6989586621680128982Sym4 y6989586621680129055 x26989586621680129054 x16989586621680129053 arg_69895866216801289766989586621680129048 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym3 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801289666989586621680129105 :: k3) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym3 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k3 (TyFun k4 (TyFun k5 Bool -> Type) -> Type) -> Type) (arg_69895866216801289666989586621680129105 :: k3) = Let6989586621680129115Scrutinee_6989586621680128972Sym4 y6989586621680129112 x26989586621680129111 x16989586621680129110 arg_69895866216801289666989586621680129105 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type | |
| type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym4 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801289786989586621680129049 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129058Scrutinee_6989586621680128982Sym4 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801289786989586621680129049 :: k4) = Let6989586621680129058Scrutinee_6989586621680128982Sym5 arg_69895866216801289766989586621680129048 y6989586621680129055 x26989586621680129054 x16989586621680129053 arg_69895866216801289786989586621680129049 :: TyFun k5 Bool -> Type | |
| type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym4 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801289686989586621680129106 :: k4) | |
Defined in Data.Singletons.Prelude.Enum type Apply (Let6989586621680129115Scrutinee_6989586621680128972Sym4 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 :: TyFun k4 (TyFun k5 Bool -> Type) -> Type) (arg_69895866216801289686989586621680129106 :: k4) = Let6989586621680129115Scrutinee_6989586621680128972Sym5 arg_69895866216801289666989586621680129105 y6989586621680129112 x26989586621680129111 x16989586621680129110 arg_69895866216801289686989586621680129106 :: TyFun k5 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 (TyEqSing a b :: Bool -> Type) | |
| type Eval (Guarded x ((p := y) ': ys) :: a2 -> Type) | |
| type Apply OrSym0 (a6989586621680321540 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply AndSym0 (a6989586621680321544 :: [Bool]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ListnullSym0 :: TyFun [a] Bool -> Type) (a6989586621680687618 :: [a]) | |
| type Apply (NullSym0 :: TyFun [a] Bool -> Type) (a6989586621680321764 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913596 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913598 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (AndSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680742863 :: t Bool) | |
| type Apply (Let6989586621680742866Scrutinee_6989586621680742628Sym0 :: TyFun (t6989586621680742381 Bool) All -> Type) (x6989586621680742865 :: t6989586621680742381 Bool) | |
| type Apply (OrSym0 :: TyFun (t Bool) Bool -> Type) (a6989586621680742854 :: t Bool) | |
| type Apply (Let6989586621680742857Scrutinee_6989586621680742630Sym0 :: TyFun (t6989586621680742381 Bool) Any -> Type) (x6989586621680742856 :: t6989586621680742381 Bool) | |
| type Apply (Null_6989586621680921344Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680921343 :: Identity a) | |
| type Apply (ListelemSym1 a6989586621680687700 :: TyFun [a] Bool -> Type) (a6989586621680687701 :: [a]) | |
| type Apply (ListisPrefixOfSym1 a6989586621680687765 :: TyFun [a] Bool -> Type) (a6989586621680687766 :: [a]) | |
| type Apply (NotElemSym1 a6989586621680321269 :: TyFun [a] Bool -> Type) (a6989586621680321270 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemSym1 a6989586621680321276 :: TyFun [a] Bool -> Type) (a6989586621680321277 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsPrefixOfSym1 a6989586621680321295 :: TyFun [a] Bool -> Type) (a6989586621680321296 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym1 a6989586621680321295 :: TyFun [a] Bool -> Type) (a6989586621680321296 :: [a]) = IsPrefixOf a6989586621680321295 a6989586621680321296 | |
| type Apply (AnySym1 a6989586621680321526 :: TyFun [a] Bool -> Type) (a6989586621680321527 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsInfixOfSym1 a6989586621680321283 :: TyFun [a] Bool -> Type) (a6989586621680321284 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AllSym1 a6989586621680321533 :: TyFun [a] Bool -> Type) (a6989586621680321534 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (IsSuffixOfSym1 a6989586621680321289 :: TyFun [a] Bool -> Type) (a6989586621680321290 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym1 a6989586621680321289 :: TyFun [a] Bool -> Type) (a6989586621680321290 :: [a]) = IsSuffixOf a6989586621680321289 a6989586621680321290 | |
| type Apply (Elem_6989586621680921217Sym1 a6989586621680921215 :: TyFun (Identity a) Bool -> Type) (a6989586621680921216 :: Identity a) | |
| type Apply (Elem_bySym2 a6989586621680320413 a6989586621680320412 :: TyFun [a] Bool -> Type) (a6989586621680320414 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Elem_6989586621680743293Sym1 a6989586621680743291 t :: TyFun (t a) Bool -> Type) (a6989586621680743292 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680743249Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680743248 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (AnySym1 a6989586621680742841 t :: TyFun (t a) Bool -> Type) (a6989586621680742842 :: t a) | |
| type Apply (ElemSym1 arg6989586621680743044 t :: TyFun (t a) Bool -> Type) (arg6989586621680743045 :: t a) | |
| type Apply (NotElemSym1 a6989586621680742770 t :: TyFun (t a) Bool -> Type) (a6989586621680742771 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (NullSym0 :: TyFun (t a) Bool -> Type) (arg6989586621680743040 :: t a) | |
| type Apply (AllSym1 a6989586621680742828 t :: TyFun (t a) Bool -> Type) (a6989586621680742829 :: t a) | |
| type Apply (Elem_6989586621680743413Sym1 a6989586621680743411 t :: TyFun (t a) Bool -> Type) (a6989586621680743412 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680743556Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680743555 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680743732Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680743731 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680743754Sym1 a6989586621680743752 t :: TyFun (t a) Bool -> Type) (a6989586621680743753 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680743881Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680743880 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680743921Sym1 a6989586621680743919 t :: TyFun (t a) Bool -> Type) (a6989586621680743920 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680744048Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680744047 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Elem_6989586621680744088Sym1 a6989586621680744086 t :: TyFun (t a) Bool -> Type) (a6989586621680744087 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Null_6989586621680744215Sym0 :: TyFun (t a) Bool -> Type) (a6989586621680744214 :: t a) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ListisPrefixOfSym0 :: TyFun [a6989586621680686805] ([a6989586621680686805] ~> Bool) -> Type) (a6989586621680687765 :: [a6989586621680686805]) | |
| type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680316403] ([a6989586621680316403] ~> Bool) -> Type) (a6989586621680321295 :: [a6989586621680316403]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsPrefixOfSym0 :: TyFun [a6989586621680316403] ([a6989586621680316403] ~> Bool) -> Type) (a6989586621680321295 :: [a6989586621680316403]) = IsPrefixOfSym1 a6989586621680321295 | |
| type Apply (IsInfixOfSym0 :: TyFun [a6989586621680316401] ([a6989586621680316401] ~> Bool) -> Type) (a6989586621680321283 :: [a6989586621680316401]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsInfixOfSym0 :: TyFun [a6989586621680316401] ([a6989586621680316401] ~> Bool) -> Type) (a6989586621680321283 :: [a6989586621680316401]) = IsInfixOfSym1 a6989586621680321283 | |
| type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680316402] ([a6989586621680316402] ~> Bool) -> Type) (a6989586621680321289 :: [a6989586621680316402]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IsSuffixOfSym0 :: TyFun [a6989586621680316402] ([a6989586621680316402] ~> Bool) -> Type) (a6989586621680321289 :: [a6989586621680316402]) = IsSuffixOfSym1 a6989586621680321289 | |
| type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym1 x6989586621680320758 :: TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680320759 :: [a6989586621680316437]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym1 x6989586621680320758 :: TyFun [a6989586621680316437] (TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) -> Type) (xs6989586621680320759 :: [a6989586621680316437]) = Let6989586621680320760Scrutinee_6989586621680316995Sym2 x6989586621680320758 xs6989586621680320759 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type | |
| type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym2 ys6989586621680320436 y6989586621680320435 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680320437 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym2 ys6989586621680320436 y6989586621680320435 :: TyFun [k1] (TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) -> Type) (xs6989586621680320437 :: [k1]) = Let6989586621680320438Scrutinee_6989586621680317023Sym3 ys6989586621680320436 y6989586621680320435 xs6989586621680320437 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type | |
| type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym2 xs6989586621680320457 x6989586621680320456 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680320458 :: [k1]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320459Scrutinee_6989586621680317021Sym2 xs6989586621680320457 x6989586621680320456 :: TyFun [k1] (TyFun k3 Bool -> Type) -> Type) (ls6989586621680320458 :: [k1]) = Let6989586621680320459Scrutinee_6989586621680317021Sym3 xs6989586621680320457 x6989586621680320456 ls6989586621680320458 :: TyFun k3 Bool -> Type | |
| type Apply (IsRightSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725481 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725483 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (TFHelper_6989586621681108278Sym1 a6989586621681108276 :: TyFun (Arg a b) Bool -> Type) (a6989586621681108277 :: Arg a b) | |
| type Apply (ListnubBySym0 :: TyFun (a6989586621680686799 ~> (a6989586621680686799 ~> Bool)) ([a6989586621680686799] ~> [a6989586621680686799]) -> Type) (a6989586621680687730 :: a6989586621680686799 ~> (a6989586621680686799 ~> Bool)) | |
| type Apply (ListpartitionSym0 :: TyFun (a6989586621680686807 ~> Bool) ([a6989586621680686807] ~> ([a6989586621680686807], [a6989586621680686807])) -> Type) (a6989586621680687785 :: a6989586621680686807 ~> Bool) | |
| type Apply (ListfilterSym0 :: TyFun (a6989586621680686808 ~> Bool) ([a6989586621680686808] ~> [a6989586621680686808]) -> Type) (a6989586621680687795 :: a6989586621680686808 ~> Bool) | |
| type Apply (ListspanSym0 :: TyFun (a6989586621680686809 ~> Bool) ([a6989586621680686809] ~> ([a6989586621680686809], [a6989586621680686809])) -> Type) (a6989586621680687805 :: a6989586621680686809 ~> Bool) | |
| type Apply (ListdropWhileSym0 :: TyFun (a6989586621680686810 ~> Bool) ([a6989586621680686810] ~> [a6989586621680686810]) -> Type) (a6989586621680687815 :: a6989586621680686810 ~> Bool) | |
| type Apply (ListtakeWhileSym0 :: TyFun (a6989586621680686811 ~> Bool) ([a6989586621680686811] ~> [a6989586621680686811]) -> Type) (a6989586621680687825 :: a6989586621680686811 ~> Bool) | |
| type Apply (Elem_bySym0 :: TyFun (a6989586621680316317 ~> (a6989586621680316317 ~> Bool)) (a6989586621680316317 ~> ([a6989586621680316317] ~> Bool)) -> Type) (a6989586621680320412 :: a6989586621680316317 ~> (a6989586621680316317 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (NubBySym0 :: TyFun (a6989586621680316318 ~> (a6989586621680316318 ~> Bool)) ([a6989586621680316318] ~> [a6989586621680316318]) -> Type) (a6989586621680320422 :: a6989586621680316318 ~> (a6989586621680316318 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (SelectSym0 :: TyFun (a6989586621680316326 ~> Bool) (a6989586621680316326 ~> (([a6989586621680316326], [a6989586621680316326]) ~> ([a6989586621680316326], [a6989586621680316326]))) -> Type) (a6989586621680320528 :: a6989586621680316326 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (PartitionSym0 :: TyFun (a6989586621680316327 ~> Bool) ([a6989586621680316327] ~> ([a6989586621680316327], [a6989586621680316327])) -> Type) (a6989586621680320546 :: a6989586621680316327 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (PartitionSym0 :: TyFun (a6989586621680316327 ~> Bool) ([a6989586621680316327] ~> ([a6989586621680316327], [a6989586621680316327])) -> Type) (a6989586621680320546 :: a6989586621680316327 ~> Bool) = PartitionSym1 a6989586621680320546 | |
| type Apply (BreakSym0 :: TyFun (a6989586621680316339 ~> Bool) ([a6989586621680316339] ~> ([a6989586621680316339], [a6989586621680316339])) -> Type) (a6989586621680320662 :: a6989586621680316339 ~> Bool) | |
| type Apply (Let6989586621680320680YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680320667 :: k ~> Bool) | |
| type Apply (Let6989586621680320680ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680320667 :: k ~> Bool) | |
| type Apply (Let6989586621680320680X_6989586621680320681Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680320667 :: k ~> Bool) | |
| type Apply (SpanSym0 :: TyFun (a6989586621680316340 ~> Bool) ([a6989586621680316340] ~> ([a6989586621680316340], [a6989586621680316340])) -> Type) (a6989586621680320705 :: a6989586621680316340 ~> Bool) | |
| type Apply (Let6989586621680320723YsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680320710 :: k ~> Bool) | |
| type Apply (Let6989586621680320723ZsSym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] [k] -> Type) -> Type) -> Type) (p6989586621680320710 :: k ~> Bool) | |
| type Apply (Let6989586621680320723X_6989586621680320724Sym0 :: TyFun (k ~> Bool) (TyFun k (TyFun [k] ([k], [k]) -> Type) -> Type) -> Type) (p6989586621680320710 :: k ~> Bool) | |
| type Apply (GroupBySym0 :: TyFun (a6989586621680316330 ~> (a6989586621680316330 ~> Bool)) ([a6989586621680316330] ~> [[a6989586621680316330]]) -> Type) (a6989586621680320569 :: a6989586621680316330 ~> (a6989586621680316330 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DropWhileSym0 :: TyFun (a6989586621680316342 ~> Bool) ([a6989586621680316342] ~> [a6989586621680316342]) -> Type) (a6989586621680320774 :: a6989586621680316342 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileSym0 :: TyFun (a6989586621680316342 ~> Bool) ([a6989586621680316342] ~> [a6989586621680316342]) -> Type) (a6989586621680320774 :: a6989586621680316342 ~> Bool) = DropWhileSym1 a6989586621680320774 | |
| type Apply (TakeWhileSym0 :: TyFun (a6989586621680316343 ~> Bool) ([a6989586621680316343] ~> [a6989586621680316343]) -> Type) (a6989586621680320792 :: a6989586621680316343 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (TakeWhileSym0 :: TyFun (a6989586621680316343 ~> Bool) ([a6989586621680316343] ~> [a6989586621680316343]) -> Type) (a6989586621680320792 :: a6989586621680316343 ~> Bool) = TakeWhileSym1 a6989586621680320792 | |
| type Apply (FilterSym0 :: TyFun (a6989586621680316351 ~> Bool) ([a6989586621680316351] ~> [a6989586621680316351]) -> Type) (a6989586621680320906 :: a6989586621680316351 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (FilterSym0 :: TyFun (a6989586621680316351 ~> Bool) ([a6989586621680316351] ~> [a6989586621680316351]) -> Type) (a6989586621680320906 :: a6989586621680316351 ~> Bool) = FilterSym1 a6989586621680320906 | |
| type Apply (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) (a6989586621680320898 :: a6989586621680316350 ~> Bool) | |
| type Apply (DeleteBySym0 :: TyFun (a6989586621680316357 ~> (a6989586621680316357 ~> Bool)) (a6989586621680316357 ~> ([a6989586621680316357] ~> [a6989586621680316357])) -> Type) (a6989586621680321026 :: a6989586621680316357 ~> (a6989586621680316357 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680316356 ~> (a6989586621680316356 ~> Bool)) ([a6989586621680316356] ~> ([a6989586621680316356] ~> [a6989586621680316356])) -> Type) (a6989586621680321013 :: a6989586621680316356 ~> (a6989586621680316356 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DeleteFirstsBySym0 :: TyFun (a6989586621680316356 ~> (a6989586621680316356 ~> Bool)) ([a6989586621680316356] ~> ([a6989586621680316356] ~> [a6989586621680316356])) -> Type) (a6989586621680321013 :: a6989586621680316356 ~> (a6989586621680316356 ~> Bool)) = DeleteFirstsBySym1 a6989586621680321013 | |
| type Apply (UnionBySym0 :: TyFun (a6989586621680316316 ~> (a6989586621680316316 ~> Bool)) ([a6989586621680316316] ~> ([a6989586621680316316] ~> [a6989586621680316316])) -> Type) (a6989586621680320403 :: a6989586621680316316 ~> (a6989586621680316316 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndicesSym0 :: TyFun (a6989586621680316346 ~> Bool) ([a6989586621680316346] ~> [Nat]) -> Type) (a6989586621680320848 :: a6989586621680316346 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) (a6989586621680320874 :: a6989586621680316347 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (AnySym0 :: TyFun (a6989586621680316420 ~> Bool) ([a6989586621680316420] ~> Bool) -> Type) (a6989586621680321526 :: a6989586621680316420 ~> Bool) | |
| type Apply (IntersectBySym0 :: TyFun (a6989586621680316344 ~> (a6989586621680316344 ~> Bool)) ([a6989586621680316344] ~> ([a6989586621680316344] ~> [a6989586621680316344])) -> Type) (a6989586621680320806 :: a6989586621680316344 ~> (a6989586621680316344 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (IntersectBySym0 :: TyFun (a6989586621680316344 ~> (a6989586621680316344 ~> Bool)) ([a6989586621680316344] ~> ([a6989586621680316344] ~> [a6989586621680316344])) -> Type) (a6989586621680320806 :: a6989586621680316344 ~> (a6989586621680316344 ~> Bool)) = IntersectBySym1 a6989586621680320806 | |
| type Apply (AllSym0 :: TyFun (a6989586621680316421 ~> Bool) ([a6989586621680316421] ~> Bool) -> Type) (a6989586621680321533 :: a6989586621680316421 ~> Bool) | |
| type Apply (DropWhileEndSym0 :: TyFun (a6989586621680316341 ~> Bool) ([a6989586621680316341] ~> [a6989586621680316341]) -> Type) (a6989586621680320748 :: a6989586621680316341 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (DropWhileEndSym0 :: TyFun (a6989586621680316341 ~> Bool) ([a6989586621680316341] ~> [a6989586621680316341]) -> Type) (a6989586621680320748 :: a6989586621680316341 ~> Bool) = DropWhileEndSym1 a6989586621680320748 | |
| type Apply (UntilSym0 :: TyFun (a6989586621679941593 ~> Bool) ((a6989586621679941593 ~> a6989586621679941593) ~> (a6989586621679941593 ~> a6989586621679941593)) -> Type) (a6989586621679941718 :: a6989586621679941593 ~> Bool) | |
| type Apply (TFHelper_6989586621681108278Sym0 :: TyFun (Arg a6989586621681107123 b6989586621681107124) (Arg a6989586621681107123 b6989586621681107124 ~> Bool) -> Type) (a6989586621681108276 :: Arg a6989586621681107123 b6989586621681107124) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680320428NubBy'Sym0 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k (TyFun [k1] ([k1] ~> [k1]) -> Type) -> Type) -> Type) (eq6989586621680320426 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320576YsSym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] [a6989586621680316340] -> Type) -> Type) -> Type) (eq6989586621680320573 :: k1 ~> (a6989586621680316340 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320576ZsSym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] [a6989586621680316340] -> Type) -> Type) -> Type) (eq6989586621680320573 :: k1 ~> (a6989586621680316340 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Let6989586621680320576X_6989586621680320577Sym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] ([a6989586621680316340], [a6989586621680316340]) -> Type) -> Type) -> Type) (eq6989586621680320573 :: k1 ~> (a6989586621680316340 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320576X_6989586621680320577Sym0 :: TyFun (k1 ~> (a6989586621680316340 ~> Bool)) (TyFun k1 (TyFun [a6989586621680316340] ([a6989586621680316340], [a6989586621680316340]) -> Type) -> Type) -> Type) (eq6989586621680320573 :: k1 ~> (a6989586621680316340 ~> Bool)) = Let6989586621680320576X_6989586621680320577Sym1 eq6989586621680320573 | |
| type Apply (Lambda_6989586621680320756Sym0 :: TyFun (a6989586621680316437 ~> Bool) (TyFun k (TyFun a6989586621680316437 (TyFun [a6989586621680316437] [a6989586621680316437] -> Type) -> Type) -> Type) -> Type) (p6989586621680320754 :: a6989586621680316437 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680320756Sym0 :: TyFun (a6989586621680316437 ~> Bool) (TyFun k (TyFun a6989586621680316437 (TyFun [a6989586621680316437] [a6989586621680316437] -> Type) -> Type) -> Type) -> Type) (p6989586621680320754 :: a6989586621680316437 ~> Bool) = Lambda_6989586621680320756Sym1 p6989586621680320754 :: TyFun k (TyFun a6989586621680316437 (TyFun [a6989586621680316437] [a6989586621680316437] -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) (p6989586621680742747 :: a6989586621679087424 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) (p6989586621680742747 :: a6989586621679087424 ~> Bool) = Lambda_6989586621680742750Sym1 p6989586621680742747 :: TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type | |
| type Apply (AnySym0 :: TyFun (a6989586621680742300 ~> Bool) (t6989586621680742299 a6989586621680742300 ~> Bool) -> Type) (a6989586621680742841 :: a6989586621680742300 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) (p6989586621680742845 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) (p6989586621680742845 :: a6989586621680742384 ~> Bool) = Let6989586621680742847Scrutinee_6989586621680742632Sym1 p6989586621680742845 :: TyFun (t6989586621680742381 a6989586621680742384) Any -> Type | |
| type Apply (AllSym0 :: TyFun (a6989586621680742298 ~> Bool) (t6989586621680742297 a6989586621680742298 ~> Bool) -> Type) (a6989586621680742828 :: a6989586621680742298 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) (p6989586621680742832 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) (p6989586621680742832 :: a6989586621680742384 ~> Bool) = Let6989586621680742834Scrutinee_6989586621680742634Sym1 p6989586621680742832 :: TyFun (t6989586621680742381 a6989586621680742384) All -> Type | |
| type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) = FindSym1 a6989586621680742743 t6989586621680742289 :: TyFun (t6989586621680742289 a6989586621680742290) (Maybe a6989586621680742290) -> Type | |
| type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) (p6989586621680742747 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) (p6989586621680742747 :: a6989586621680742384 ~> Bool) = Let6989586621680742749Scrutinee_6989586621680742640Sym1 p6989586621680742747 :: TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type | |
| type Apply (Let6989586621679941729GoSym0 :: TyFun (k1 ~> Bool) (TyFun (k1 ~> k1) (TyFun k2 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (p6989586621679941726 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Base | |
| type Apply (MfilterSym0 :: TyFun (a6989586621681401666 ~> Bool) (m6989586621681401665 a6989586621681401666 ~> m6989586621681401665 a6989586621681401666) -> Type) (a6989586621681401985 :: a6989586621681401666 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (MfilterSym0 :: TyFun (a6989586621681401666 ~> Bool) (m6989586621681401665 a6989586621681401666 ~> m6989586621681401665 a6989586621681401666) -> Type) (a6989586621681401985 :: a6989586621681401666 ~> Bool) = MfilterSym1 a6989586621681401985 m6989586621681401665 :: TyFun (m6989586621681401665 a6989586621681401666) (m6989586621681401665 a6989586621681401666) -> Type | |
| type Apply (FilterMSym0 :: TyFun (a6989586621681401704 ~> m6989586621681401703 Bool) ([a6989586621681401704] ~> m6989586621681401703 [a6989586621681401704]) -> Type) (a6989586621681402151 :: a6989586621681401704 ~> m6989586621681401703 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (FilterMSym0 :: TyFun (a6989586621681401704 ~> m6989586621681401703 Bool) ([a6989586621681401704] ~> m6989586621681401703 [a6989586621681401704]) -> Type) (a6989586621681402151 :: a6989586621681401704 ~> m6989586621681401703 Bool) = FilterMSym1 a6989586621681402151 | |
| type Apply (Lambda_6989586621681401991Sym0 :: TyFun (k1 ~> Bool) (TyFun k (TyFun k1 (m6989586621679962831 k1) -> Type) -> Type) -> Type) (p6989586621681401989 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.Monad | |
| type Apply (Lambda_6989586621681402159Sym0 :: TyFun (k2 ~> f6989586621679962807 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679962807 [k2]) (f6989586621679962807 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681402157 :: k2 ~> f6989586621679962807 Bool) | |
Defined in Data.Singletons.Prelude.Monad type Apply (Lambda_6989586621681402159Sym0 :: TyFun (k2 ~> f6989586621679962807 Bool) (TyFun k3 (TyFun k2 (TyFun (f6989586621679962807 [k2]) (f6989586621679962807 [k2]) -> Type) -> Type) -> Type) -> Type) (p6989586621681402157 :: k2 ~> f6989586621679962807 Bool) = Lambda_6989586621681402159Sym1 p6989586621681402157 :: TyFun k3 (TyFun k2 (TyFun (f6989586621679962807 [k2]) (f6989586621679962807 [k2]) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680320828Sym0 :: TyFun (b6989586621679962835 ~> (a6989586621680316420 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316420 (TyFun [a6989586621680316420] (TyFun b6989586621679962835 (m6989586621679962831 b6989586621679962835) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680320812 :: b6989586621679962835 ~> (a6989586621680316420 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Lambda_6989586621680320828Sym0 :: TyFun (b6989586621679962835 ~> (a6989586621680316420 ~> Bool)) (TyFun k1 (TyFun k2 (TyFun a6989586621680316420 (TyFun [a6989586621680316420] (TyFun b6989586621679962835 (m6989586621679962831 b6989586621679962835) -> Type) -> Type) -> Type) -> Type) -> Type) -> Type) (eq6989586621680320812 :: b6989586621679962835 ~> (a6989586621680316420 ~> Bool)) = Lambda_6989586621680320828Sym1 eq6989586621680320812 :: TyFun k1 (TyFun k2 (TyFun a6989586621680316420 (TyFun [a6989586621680316420] (TyFun b6989586621679962835 (m6989586621679962831 b6989586621679962835) -> Type) -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym2 xs6989586621680320759 x6989586621680320758 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680320754 :: k1 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320760Scrutinee_6989586621680316995Sym2 xs6989586621680320759 x6989586621680320758 :: TyFun (k1 ~> Bool) (TyFun k Bool -> Type) -> Type) (p6989586621680320754 :: k1 ~> Bool) = Let6989586621680320760Scrutinee_6989586621680316995Sym3 xs6989586621680320759 x6989586621680320758 p6989586621680320754 :: TyFun k Bool -> Type | |
| type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym3 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680320426 :: k1 ~> (k1 ~> Bool)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320438Scrutinee_6989586621680317023Sym3 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 :: TyFun (k1 ~> (k1 ~> Bool)) (TyFun k3 Bool -> Type) -> Type) (eq6989586621680320426 :: k1 ~> (k1 ~> Bool)) = Let6989586621680320438Scrutinee_6989586621680317023Sym4 xs6989586621680320437 ys6989586621680320436 y6989586621680320435 eq6989586621680320426 :: TyFun k3 Bool -> Type | |
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
| Eq Double | Note that due to the presence of
Also note that
|
| Floating Double | Since: base-2.1 |
| Data Double | 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) -> Double -> c Double # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Double # toConstr :: Double -> Constr # dataTypeOf :: Double -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Double) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Double) # gmapT :: (forall b. Data b => b -> b) -> Double -> Double # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Double -> r # gmapQ :: (forall d. Data d => d -> u) -> Double -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Double -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Double -> m Double # | |
| Ord Double | Note that due to the presence of
Also note that, due to the same,
|
| Read Double | Since: base-2.1 |
| RealFloat Double | Since: base-2.1 |
Defined in GHC.Float Methods floatRadix :: Double -> Integer # floatDigits :: Double -> Int # floatRange :: Double -> (Int, Int) # decodeFloat :: Double -> (Integer, Int) # encodeFloat :: Integer -> Int -> Double # significand :: Double -> Double # scaleFloat :: Int -> Double -> Double # isInfinite :: Double -> Bool # isDenormalized :: Double -> Bool # isNegativeZero :: Double -> Bool # | |
| Lift Double | |
| Hashable Double | Note: prior to The Since: hashable-1.3.0.0 |
Defined in Data.Hashable.Class | |
| Storable Double | Since: base-2.1 |
| PrimType Double | |
Defined in Basement.PrimType Methods primSizeInBytes :: Proxy Double -> CountOf Word8 # primShiftToBytes :: Proxy Double -> Int # primBaUIndex :: ByteArray# -> Offset Double -> Double # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> prim Double # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Double -> Double -> prim () # primAddrIndex :: Addr# -> Offset Double -> Double # primAddrRead :: PrimMonad prim => Addr# -> Offset Double -> prim Double # primAddrWrite :: PrimMonad prim => Addr# -> Offset Double -> Double -> prim () # | |
| Subtractive Double | |
Defined in Basement.Numerical.Subtractive Associated Types type Difference Double # | |
| NFData Double | |
Defined in Control.DeepSeq | |
| Default Double | |
Defined in Data.Default.Class | |
| Unbox Double | |
Defined in Data.Vector.Unboxed.Base | |
| Vector Vector Double | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Double -> m (Vector Double) # basicUnsafeThaw :: PrimMonad m => Vector Double -> m (Mutable Vector (PrimState m) Double) # basicLength :: Vector Double -> Int # basicUnsafeSlice :: Int -> Int -> Vector Double -> Vector Double # basicUnsafeIndexM :: Monad m => Vector Double -> Int -> m Double # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Double -> Vector Double -> m () # | |
| MVector MVector Double | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Double -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Double -> MVector s Double # basicOverlaps :: MVector s Double -> MVector s Double -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Double) # basicInitialize :: PrimMonad m => MVector (PrimState m) Double -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Double -> m (MVector (PrimState m) Double) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Double -> Int -> m Double # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Double -> Int -> Double -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Double -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Double -> Double -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Double -> MVector (PrimState m) Double -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Double -> Int -> m (MVector (PrimState m) Double) # | |
| () :=> (Enum Double) | |
| () :=> (Eq Double) | |
| () :=> (Floating Double) | |
| () :=> (Fractional Double) | |
Defined in Data.Constraint Methods ins :: () :- Fractional Double # | |
| () :=> (Num Double) | |
| () :=> (Ord Double) | |
| () :=> (Real Double) | |
| () :=> (RealFloat Double) | |
| () :=> (RealFrac Double) | |
| Generic1 (URec Double :: k -> Type) | Since: base-4.9.0.0 |
| Functor (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
| Foldable (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Double m -> m # foldMap :: Monoid m => (a -> m) -> URec Double a -> m # foldMap' :: Monoid m => (a -> m) -> URec Double a -> m # foldr :: (a -> b -> b) -> b -> URec Double a -> b # foldr' :: (a -> b -> b) -> b -> URec Double a -> b # foldl :: (b -> a -> b) -> b -> URec Double a -> b # foldl' :: (b -> a -> b) -> b -> URec Double a -> b # foldr1 :: (a -> a -> a) -> URec Double a -> a # foldl1 :: (a -> a -> a) -> URec Double a -> a # toList :: URec Double a -> [a] # null :: URec Double a -> Bool # length :: URec Double a -> Int # elem :: Eq a => a -> URec Double a -> Bool # maximum :: Ord a => URec Double a -> a # minimum :: Ord a => URec Double a -> a # | |
| Traversable (URec Double :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Traversable | |
| Eq (URec Double p) | Since: base-4.9.0.0 |
| Ord (URec Double p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec Double p -> URec Double p -> Ordering # (<) :: URec Double p -> URec Double p -> Bool # (<=) :: URec Double p -> URec Double p -> Bool # (>) :: URec Double p -> URec Double p -> Bool # (>=) :: URec Double p -> URec Double p -> Bool # | |
| Show (URec Double p) | Since: base-4.9.0.0 |
| Generic (URec Double p) | Since: base-4.9.0.0 |
| type PrimSize Double | |
Defined in Basement.PrimType | |
| type Difference Double | |
Defined in Basement.Numerical.Subtractive | |
| newtype Vector Double | |
| data URec Double (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 |
| newtype MVector s Double | |
| type Rep1 (URec Double :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Double p) | |
Defined in GHC.Generics | |
Single-precision floating point numbers. It is desirable that this type be at least equal in range and precision to the IEEE single-precision type.
Instances
| Eq Float | Note that due to the presence of
Also note that
|
| Floating Float | Since: base-2.1 |
| Data Float | 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) -> Float -> c Float # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Float # dataTypeOf :: Float -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Float) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Float) # gmapT :: (forall b. Data b => b -> b) -> Float -> Float # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Float -> r # gmapQ :: (forall d. Data d => d -> u) -> Float -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Float -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Float -> m Float # | |
| Ord Float | Note that due to the presence of
Also note that, due to the same,
|
| Read Float | Since: base-2.1 |
| RealFloat Float | Since: base-2.1 |
Defined in GHC.Float Methods floatRadix :: Float -> Integer # floatDigits :: Float -> Int # floatRange :: Float -> (Int, Int) # decodeFloat :: Float -> (Integer, Int) # encodeFloat :: Integer -> Int -> Float # significand :: Float -> Float # scaleFloat :: Int -> Float -> Float # isInfinite :: Float -> Bool # isDenormalized :: Float -> Bool # isNegativeZero :: Float -> Bool # | |
| Lift Float | |
| Hashable Float | Note: prior to The Since: hashable-1.3.0.0 |
Defined in Data.Hashable.Class | |
| Storable Float | Since: base-2.1 |
| PrimType Float | |
Defined in Basement.PrimType Methods primSizeInBytes :: Proxy Float -> CountOf Word8 # primShiftToBytes :: Proxy Float -> Int # primBaUIndex :: ByteArray# -> Offset Float -> Float # primMbaURead :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> prim Float # primMbaUWrite :: PrimMonad prim => MutableByteArray# (PrimState prim) -> Offset Float -> Float -> prim () # primAddrIndex :: Addr# -> Offset Float -> Float # primAddrRead :: PrimMonad prim => Addr# -> Offset Float -> prim Float # primAddrWrite :: PrimMonad prim => Addr# -> Offset Float -> Float -> prim () # | |
| Subtractive Float | |
Defined in Basement.Numerical.Subtractive Associated Types type Difference Float # | |
| NFData Float | |
Defined in Control.DeepSeq | |
| Default Float | |
Defined in Data.Default.Class | |
| Unbox Float | |
Defined in Data.Vector.Unboxed.Base | |
| Vector Vector Float | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Float -> m (Vector Float) # basicUnsafeThaw :: PrimMonad m => Vector Float -> m (Mutable Vector (PrimState m) Float) # basicLength :: Vector Float -> Int # basicUnsafeSlice :: Int -> Int -> Vector Float -> Vector Float # basicUnsafeIndexM :: Monad m => Vector Float -> Int -> m Float # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Float -> Vector Float -> m () # | |
| MVector MVector Float | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Float -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Float -> MVector s Float # basicOverlaps :: MVector s Float -> MVector s Float -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Float) # basicInitialize :: PrimMonad m => MVector (PrimState m) Float -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Float -> m (MVector (PrimState m) Float) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Float -> Int -> m Float # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Float -> Int -> Float -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Float -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Float -> Float -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Float -> MVector (PrimState m) Float -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Float -> Int -> m (MVector (PrimState m) Float) # | |
| () :=> (Enum Float) | |
| () :=> (Eq Float) | |
| () :=> (Floating Float) | |
| () :=> (Fractional Float) | |
Defined in Data.Constraint Methods ins :: () :- Fractional Float # | |
| () :=> (Num Float) | |
| () :=> (Ord Float) | |
| () :=> (Real Float) | |
| () :=> (RealFloat Float) | |
| () :=> (RealFrac Float) | |
| Generic1 (URec Float :: k -> Type) | Since: base-4.9.0.0 |
| Functor (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
| Foldable (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec Float m -> m # foldMap :: Monoid m => (a -> m) -> URec Float a -> m # foldMap' :: Monoid m => (a -> m) -> URec Float a -> m # foldr :: (a -> b -> b) -> b -> URec Float a -> b # foldr' :: (a -> b -> b) -> b -> URec Float a -> b # foldl :: (b -> a -> b) -> b -> URec Float a -> b # foldl' :: (b -> a -> b) -> b -> URec Float a -> b # foldr1 :: (a -> a -> a) -> URec Float a -> a # foldl1 :: (a -> a -> a) -> URec Float a -> a # toList :: URec Float a -> [a] # null :: URec Float a -> Bool # length :: URec Float a -> Int # elem :: Eq a => a -> URec Float a -> Bool # maximum :: Ord a => URec Float a -> a # minimum :: Ord a => URec Float a -> a # | |
| Traversable (URec Float :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Traversable | |
| Eq (URec Float p) | |
| Ord (URec Float p) | |
Defined in GHC.Generics | |
| Show (URec Float p) | |
| Generic (URec Float p) | |
| type PrimSize Float | |
Defined in Basement.PrimType | |
| type Difference Float | |
Defined in Basement.Numerical.Subtractive | |
| newtype Vector Float | |
| data URec Float (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 |
| newtype MVector s Float | |
| type Rep1 (URec Float :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec Float p) | |
Defined in GHC.Generics | |
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
8-bit signed integer type
Instances
16-bit signed integer type
Instances
32-bit signed integer type
Instances
64-bit signed integer type
Instances
Invariant: Jn# and Jp# are used iff value doesn't fit in S#
Useful properties resulting from the invariants:
Instances
Type representing arbitrary-precision non-negative integers.
>>>2^100 :: Natural1267650600228229401496703205376
Operations whose result would be negative throw
(Underflow :: ArithException)
>>>-1 :: Natural*** Exception: arithmetic underflow
Since: base-4.8.0.0
Instances
The Maybe type encapsulates an optional value. A value of type
Maybe aa (represented as Just aNothing). Using Maybe is a good way to
deal with errors or exceptional cases without resorting to drastic
measures such as error.
The Maybe type is also a monad. It is a simple kind of error
monad, where all errors are represented by Nothing. A richer
error monad can be built using the Either type.
Instances
| Monad Maybe | Since: base-2.1 |
| Functor Maybe | Since: base-2.1 |
| MonadFail Maybe | Since: base-4.9.0.0 |
Defined in Control.Monad.Fail | |
| Applicative Maybe | Since: base-2.1 |
| Foldable Maybe | Since: base-2.1 |
Defined in Data.Foldable Methods fold :: Monoid m => Maybe m -> m # foldMap :: Monoid m => (a -> m) -> Maybe a -> m # foldMap' :: Monoid m => (a -> m) -> Maybe a -> m # foldr :: (a -> b -> b) -> b -> Maybe a -> b # foldr' :: (a -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> a -> b) -> b -> Maybe a -> b # foldl' :: (b -> a -> b) -> b -> Maybe a -> b # foldr1 :: (a -> a -> a) -> Maybe a -> a # foldl1 :: (a -> a -> a) -> Maybe a -> a # elem :: Eq a => a -> Maybe a -> Bool # maximum :: Ord a => Maybe a -> a # minimum :: Ord a => Maybe a -> a # | |
| Traversable Maybe | Since: base-2.1 |
| Alternative Maybe | Since: base-2.1 |
| MonadPlus Maybe | Since: base-2.1 |
| MonadFailure Maybe | |
| NFData1 Maybe | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| MonadThrow Maybe | |
Defined in Control.Monad.Catch | |
| Hashable1 Maybe | |
Defined in Data.Hashable.Class | |
| LorentzFunctor Maybe | |
Defined in Lorentz.Instr | |
| KnownNamedFunctor Maybe | |
Defined in Util.Named | |
| InjValue Maybe | |
Defined in Named.Internal | |
| 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) # sSequenceA :: forall (f :: Type -> Type) a (t :: Maybe (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # 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) # sSequence :: forall (m :: Type -> Type) a (t :: Maybe (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable Maybe | |
| SFoldable Maybe | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Maybe m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Maybe a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # 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) # 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) # 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) # 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) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: Maybe a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Maybe a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Maybe a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Maybe a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Maybe a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Maybe a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| PMonadFail Maybe | |
Defined in Data.Singletons.Prelude.Monad.Fail | |
| SMonadFail Maybe | |
| PFunctor Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative Maybe | |
| PMonad Maybe | |
| PAlternative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PMonadPlus Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| SFunctor Maybe | |
| SApplicative Maybe | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Maybe (a ~> b)) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # 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) # (%*>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| 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) # (%>>) :: forall a b (t1 :: Maybe a) (t2 :: Maybe b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| SAlternative Maybe | |
| SMonadPlus Maybe | |
| MonadError () Maybe | Since: mtl-2.2.2 |
Defined in Control.Monad.Error.Class | |
| () :=> (Functor Maybe) | |
| () :=> (Applicative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Applicative Maybe # | |
| () :=> (Alternative Maybe) | |
Defined in Data.Constraint Methods ins :: () :- Alternative Maybe # | |
| () :=> (MonadPlus Maybe) | |
| Eq a => Eq (Maybe a) | Since: base-2.1 |
| Data a => Data (Maybe a) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Maybe a -> c (Maybe a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Maybe a) # toConstr :: Maybe a -> Constr # dataTypeOf :: Maybe a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Maybe a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Maybe a)) # gmapT :: (forall b. Data b => b -> b) -> Maybe a -> Maybe a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Maybe a -> r # gmapQ :: (forall d. Data d => d -> u) -> Maybe a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Maybe a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Maybe a -> m (Maybe a) # | |
| 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 |
| Lift a => Lift (Maybe a) | |
| Hashable a => Hashable (Maybe a) | |
Defined in Data.Hashable.Class | |
| SingKind a => SingKind (Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics Associated Types type DemoteRep (Maybe a) | |
| NFData a => NFData (Maybe a) | |
Defined in Control.DeepSeq | |
| Default (Maybe a) | |
Defined in Data.Default.Class | |
| Ixed (Maybe a) | |
Defined in Control.Lens.At | |
| At (Maybe a) | |
| HasAnnotation a => HasAnnotation (Maybe a) | |
Defined in Lorentz.Annotation Methods getAnnotation :: Notes (ToT (Maybe a)) # | |
| IsoValue a => IsoValue (Maybe a) | |
| PolyTypeHasDocC '[a] => TypeHasDoc (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Maybe a) :: FieldDescriptions # Methods typeDocName :: Proxy (Maybe a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Maybe a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Maybe a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Maybe a) # | |
| (TypeError (DisallowInstance "Maybe") :: Constraint) => Container (Maybe a) | |
Defined in Universum.Container.Class Methods toList :: Maybe a -> [Element (Maybe a)] # foldr :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldl :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # foldl' :: (b -> Element (Maybe a) -> b) -> b -> Maybe a -> b # elem :: Element (Maybe a) -> Maybe a -> Bool # maximum :: Maybe a -> Element (Maybe a) # minimum :: Maybe a -> Element (Maybe a) # foldMap :: Monoid m => (Element (Maybe a) -> m) -> Maybe a -> m # fold :: Maybe a -> Element (Maybe a) # foldr' :: (Element (Maybe a) -> b -> b) -> b -> Maybe a -> b # foldr1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # foldl1 :: (Element (Maybe a) -> Element (Maybe a) -> Element (Maybe a)) -> Maybe a -> Element (Maybe a) # notElem :: Element (Maybe a) -> Maybe a -> Bool # all :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # any :: (Element (Maybe a) -> Bool) -> Maybe a -> Bool # find :: (Element (Maybe a) -> Bool) -> Maybe a -> Maybe (Element (Maybe a)) # | |
| 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) # sShow_ :: forall (t :: Maybe a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Maybe a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup (Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Maybe a) | |
| POrd (Maybe a) | |
| SOrd a => SOrd (Maybe a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Maybe a) (t2 :: Maybe a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Maybe a) | |
| PEq (Maybe a) | |
| Generic1 Maybe | Since: base-4.6.0.0 |
| IsoHKD Maybe (a :: Type) | |
| SingI ('Nothing :: Maybe a) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| 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)) | |
| Each (Maybe a) (Maybe b) a b | |
| CanCastTo a b => CanCastTo (Maybe a :: Type) (Maybe b :: Type) | |
| SingI a2 => SingI ('Just a2 :: Maybe a1) | Since: base-4.9.0.0 |
Defined in GHC.Generics | |
| SingI (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing CatMaybesSym0 # | |
| SingI (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing ListToMaybeSym0 # | |
| SingI (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MaybeToListSym0 # | |
| SingI (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsNothingSym0 # | |
| SingI (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing IsJustSym0 # | |
| SingI (FromJustSym0 :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromJustSym0 # | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 # | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FromMaybeSym0 :: TyFun a (Maybe a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing FromMaybeSym0 # | |
| SEq a => SingI (ElemIndexSym0 :: TyFun a ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing ElemIndexSym0 # | |
| SingI (JustSym0 :: TyFun a (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (FindSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (FindIndexSym0 :: TyFun (a ~> Bool) ([a] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing FindIndexSym0 # | |
| SuppressUnusedWarnings (CatMaybesSym0 :: TyFun [Maybe a6989586621679913394] [a6989586621679913394] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListToMaybeSym0 :: TyFun [a6989586621679913395] (Maybe a6989586621679913395) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (StripPrefixSym0 :: TyFun [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024600Sym0 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884 ~> Maybe a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaybeToListSym0 :: TyFun (Maybe a6989586621679913396) [a6989586621679913396] -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsNothingSym0 :: TyFun (Maybe a6989586621679913399) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsJustSym0 :: TyFun (Maybe a6989586621679913400) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromJustSym0 :: TyFun (Maybe a6989586621679913398) a6989586621679913398 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinInternalSym0 :: TyFun (Maybe a6989586621680733526) (MinInternal a6989586621680733526) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaxInternalSym0 :: TyFun (Maybe a6989586621680732852) (MaxInternal a6989586621680732852) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679060063) (Option a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679087417) (Last a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679087424) (First a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595735Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680024315Sym0 :: TyFun a6989586621679962808 (Maybe a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024608LSym0 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (JustSym0 :: TyFun a3530822107858468865 (Maybe a3530822107858468865) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679060063) (Maybe a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679087424) (Maybe a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679087417) (Maybe a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (FindSym1 d :: TyFun [a] (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI d => SingI (FindIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (FindIndexSym1 d) # | |
| (SEq a, SingI d) => SingI (ElemIndexSym1 d :: TyFun [a] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (ElemIndexSym1 d) # | |
| SingI d => SingI (FromMaybeSym1 d :: TyFun (Maybe a) a -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (FromMaybeSym1 d) # | |
| SingI (Maybe_Sym0 :: TyFun b ((a ~> b) ~> (Maybe a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing Maybe_Sym0 # | |
| SEq a => SingI (LookupSym0 :: TyFun a ([(a, b)] ~> Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing LookupSym0 # | |
| SAlternative f => SingI (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods sing :: Sing OptionalSym0 # | |
| SingI (MapMaybeSym0 :: TyFun (a ~> Maybe b) ([a] ~> [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing MapMaybeSym0 # | |
| SingI (UnfoldrSym0 :: TyFun (b ~> Maybe (a, b)) (b ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing UnfoldrSym0 # | |
| SFoldable t => SingI (FindSym0 :: TyFun (a ~> Bool) (t a ~> Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SuppressUnusedWarnings (StripPrefixSym1 a6989586621680440227 :: TyFun [a6989586621680438531] (Maybe [a6989586621680438531]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680320898 :: TyFun [a6989586621680316350] (Maybe a6989586621680316350) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindIndexSym1 a6989586621680320874 :: TyFun [a6989586621680316347] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ElemIndexSym1 a6989586621680320890 :: TyFun [a6989586621680316349] (Maybe Nat) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595735Sym1 a6989586621680595732 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024600Sym1 a6989586621680024598 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromMaybeSym1 a6989586621679913583 :: TyFun (Maybe a6989586621679913397) a6989586621679913397 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (OptionalSym0 :: TyFun (f6989586621681393521 a6989586621681393522) (f6989586621681393521 (Maybe a6989586621681393522)) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024164Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Maybe a6989586621679962803 ~> Maybe b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| (SEq a, SingI d) => SingI (LookupSym1 d b :: TyFun [(a, b)] (Maybe b) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing (LookupSym1 d b) # | |
| (SFoldable t, SingI d) => SingI (FindSym1 d t :: TyFun (t a) (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable | |
| SingI d => SingI (Maybe_Sym1 d a :: TyFun (a ~> b) (Maybe a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym1 d a) # | |
| SuppressUnusedWarnings (LookupSym1 a6989586621680320552 b6989586621680316329 :: TyFun [(a6989586621680316328, b6989586621680316329)] (Maybe b6989586621680316329) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024510Sym1 a6989586621680024508 b6989586621679962835 :: TyFun (Maybe b6989586621679962835) (Maybe b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024355Sym1 a6989586621680024353 b6989586621679962815 :: TyFun (Maybe b6989586621679962815) (Maybe b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024325Sym1 a6989586621680024323 :: TyFun (Maybe a6989586621679962809) (Maybe b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024177Sym1 a6989586621680024175 b6989586621679962806 :: TyFun (Maybe b6989586621679962806) (Maybe a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024164Sym1 a6989586621680024162 :: TyFun (Maybe a6989586621679962803) (Maybe b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313NSym1 x6989586621680734311 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734313MSym1 x6989586621680734311 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286NSym1 x6989586621680734284 :: TyFun k1 (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680734286MSym1 x6989586621680734284 :: TyFun k (Maybe k1) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FindSym1 a6989586621680742743 t6989586621680742289 :: TyFun (t6989586621680742289 a6989586621680742290) (Maybe a6989586621680742290) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024498Sym1 a6989586621680024496 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Maybe b6989586621679962833) (Maybe b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym0 :: 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 :: () # | |
| (SingI d1, SingI d2) => SingI (Maybe_Sym2 d1 d2 :: TyFun (Maybe a) b -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods sing :: Sing (Maybe_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995058Sym1 a6989586621680995056 :: TyFun (Maybe a6989586621680988964) (f6989586621680988963 (Maybe b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym1 a6989586621680024336 :: TyFun (Maybe a6989586621679962811) (Maybe b6989586621679962812 ~> Maybe c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maybe_Sym2 a6989586621679911979 a6989586621679911978 :: TyFun (Maybe a6989586621679911961) b6989586621679911960 -> Type) | |
Defined in Data.Singletons.Prelude.Maybe Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024339Sym2 a6989586621680024337 a6989586621680024336 :: TyFun (Maybe b6989586621679962812) (Maybe c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym2 xs6989586621680743223 f6989586621680743222 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym2 xs6989586621680743198 f6989586621680743197 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym2 k6989586621680641006 a6989586621680641005 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym2 k6989586621680640918 a6989586621680640917 :: TyFun k1 (Maybe a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743199MfSym3 a6989586621680743200 xs6989586621680743198 f6989586621680743197 :: TyFun (Maybe k3) (Maybe k2) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743224MfSym3 a6989586621680743225 xs6989586621680743223 f6989586621680743222 :: TyFun k3 (Maybe k3) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| Wrappable (NamedF Maybe a name) | |
Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Maybe a name) # | |
| (HasAnnotation (Maybe a), KnownSymbol name) => HasAnnotation (NamedF Maybe a name) | |
Defined in Lorentz.Annotation | |
| IsoValue a => IsoValue (NamedF Maybe a name) | |
| type Failure Maybe | |
Defined in Basement.Monad | |
| type Empty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Product (arg0 :: Maybe a0) | |
| type Sum (arg0 :: Maybe a0) | |
| type Minimum (arg0 :: Maybe a0) | |
| type Maximum (arg0 :: Maybe a0) | |
| type Length (arg0 :: Maybe a0) | |
| type Null (arg0 :: Maybe a0) | |
| type ToList (arg0 :: Maybe a0) | |
| type Fold (arg0 :: Maybe m0) | |
| type Fail a2 | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Maybe (m0 a0)) | |
| type SequenceA (arg0 :: Maybe (f0 a0)) | |
| type Elem (arg1 :: a0) (arg2 :: Maybe a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Maybe a0) | |
| type (a1 :: Maybe a6989586621679962884) <|> (a2 :: Maybe a6989586621679962884) | |
| type Mplus (arg1 :: Maybe a0) (arg2 :: Maybe a0) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Maybe a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Maybe b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Maybe a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: Maybe a0) <* (arg2 :: Maybe b0) | |
| type (a1 :: Maybe a6989586621679962814) *> (a2 :: Maybe b6989586621679962815) | |
| type (a1 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Maybe a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (a1 :: Maybe a6989586621679962834) >> (a2 :: Maybe b6989586621679962835) | |
| type (a1 :: Maybe a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Maybe b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Maybe a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Maybe a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Maybe a6989586621680988964) = Apply (Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Maybe a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Maybe a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Maybe a6989586621679962811) (a3 :: Maybe b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Maybe a6989586621679962811) (a3 :: Maybe b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) a1) a2) a3 | |
| type Apply (Pure_6989586621680024315Sym0 :: TyFun a (Maybe a) -> Type) (a6989586621680024314 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024608LSym0 :: TyFun k1 (Maybe k1) -> Type) (wild_69895866216800235866989586621680024607 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (JustSym0 :: TyFun a (Maybe a) -> Type) (t6989586621679707039 :: a) | |
| type Apply (Let6989586621680734286NSym1 x6989586621680734284 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734285 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734286MSym1 x6989586621680734284 :: TyFun k (Maybe k1) -> Type) (y6989586621680734285 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734313NSym1 x6989586621680734311 :: TyFun k1 (Maybe k1) -> Type) (y6989586621680734312 :: k1) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Let6989586621680734313MSym1 x6989586621680734311 :: TyFun k (Maybe k1) -> Type) (y6989586621680734312 :: k) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680640919Sym2 k6989586621680640918 a6989586621680640917 :: TyFun k1 (Maybe a) -> Type) (t6989586621680640930 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680641007Sym2 k6989586621680641006 a6989586621680641005 :: TyFun k1 (Maybe a) -> Type) (t6989586621680641018 :: k1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680743224MfSym3 a6989586621680743225 xs6989586621680743223 f6989586621680743222 :: TyFun k3 (Maybe k3) -> Type) (a6989586621680743226 :: k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ShowsPrec_6989586621680595735Sym0 :: TyFun Nat (Maybe a3530822107858468865 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595732 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) (a6989586621679913583 :: a6989586621679913397) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (FromMaybeSym0 :: TyFun a6989586621679913397 (Maybe a6989586621679913397 ~> a6989586621679913397) -> Type) (a6989586621679913583 :: a6989586621679913397) = FromMaybeSym1 a6989586621679913583 | |
| type Apply (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) (a6989586621680320890 :: a6989586621680316349) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (ElemIndexSym0 :: TyFun a6989586621680316349 ([a6989586621680316349] ~> Maybe Nat) -> Type) (a6989586621680320890 :: a6989586621680316349) = ElemIndexSym1 a6989586621680320890 | |
| type Apply (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) (a6989586621680024175 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024177Sym0 :: TyFun a6989586621679962805 (Maybe b6989586621679962806 ~> Maybe a6989586621679962805) -> Type) (a6989586621680024175 :: a6989586621679962805) = TFHelper_6989586621680024177Sym1 a6989586621680024175 b6989586621679962806 :: TyFun (Maybe b6989586621679962806) (Maybe a6989586621679962805) -> Type | |
| type Apply (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) (a6989586621679911978 :: b6989586621679911960) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym0 :: TyFun b6989586621679911960 ((a6989586621679911961 ~> b6989586621679911960) ~> (Maybe a6989586621679911961 ~> b6989586621679911960)) -> Type) (a6989586621679911978 :: b6989586621679911960) = Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type | |
| type Apply (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) (a6989586621680320552 :: a6989586621680316328) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (LookupSym0 :: TyFun a6989586621680316328 ([(a6989586621680316328, b6989586621680316329)] ~> Maybe b6989586621680316329) -> Type) (a6989586621680320552 :: a6989586621680316328) = LookupSym1 a6989586621680320552 b6989586621680316329 :: TyFun [(a6989586621680316328, b6989586621680316329)] (Maybe b6989586621680316329) -> Type | |
| type Apply (Let6989586621680734286NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734284 :: k) | |
| type Apply (Let6989586621680734286MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734284 :: k1) | |
| type Apply (Let6989586621680734313NSym0 :: TyFun k (TyFun k1 (Maybe k1) -> Type) -> Type) (x6989586621680734311 :: k) | |
| type Apply (Let6989586621680734313MSym0 :: TyFun k1 (TyFun k (Maybe k1) -> Type) -> Type) (x6989586621680734311 :: k1) | |
| type Apply (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680640917 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680641005 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) (xs6989586621680743198 :: k) | |
| type Apply (Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) (xs6989586621680743223 :: k) | |
| type Apply (Let6989586621680743199MfSym2 xs6989586621680743198 f6989586621680743197 :: TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) (a6989586621680743200 :: k2) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Rep (Maybe a) | |
Defined in GHC.Generics | |
| data Sing (b :: Maybe a) | |
| type DemoteRep (Maybe a) | |
Defined in GHC.Generics | |
| type Index (Maybe a) | |
Defined in Control.Lens.At | |
| type IxValue (Maybe a) | |
Defined in Control.Lens.At | |
| type ToT (Maybe a) | |
Defined in Michelson.Typed.Haskell.Value | |
| type TypeDocFieldDescriptions (Maybe a) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Element (Maybe a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Demote (Maybe a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Rep1 Maybe | |
| type Mconcat (arg0 :: [Maybe a]) | |
| type Show_ (arg0 :: Maybe a) | |
| type Sconcat (arg0 :: NonEmpty (Maybe a)) | |
| type Mappend (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type ShowList (arg1 :: [Maybe a]) arg2 | |
| type (a2 :: Maybe a1) <> (a3 :: Maybe a1) | |
| type Min (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type Max (arg1 :: Maybe a) (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) >= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) > (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) <= (arg2 :: Maybe a) | |
| type (arg1 :: Maybe a) < (arg2 :: Maybe a) | |
| type Compare (a2 :: Maybe a1) (a3 :: Maybe a1) | |
| type (x :: Maybe a) /= (y :: Maybe a) | |
| type (a2 :: Maybe a1) == (b :: Maybe a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type HKD Maybe (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Maybe a1) a4 | |
| type Apply (FromJustSym0 :: TyFun (Maybe a) a -> Type) (a6989586621679913593 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsNothingSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913596 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (IsJustSym0 :: TyFun (Maybe a) Bool -> Type) (a6989586621679913598 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (FromMaybeSym1 a6989586621679913583 :: TyFun (Maybe a) a -> Type) (a6989586621679913584 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679803206 :: Maybe a) | |
| type Apply (Maybe_Sym2 a6989586621679911979 a6989586621679911978 :: TyFun (Maybe a) b -> Type) (a6989586621679911980 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (CatMaybesSym0 :: TyFun [Maybe a] [a] -> Type) (a6989586621679913572 :: [Maybe a]) | |
Defined in Data.Singletons.Prelude.Maybe | |
| type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913577 :: [a]) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (ListToMaybeSym0 :: TyFun [a] (Maybe a) -> Type) (a6989586621679913577 :: [a]) = ListToMaybe a6989586621679913577 | |
| type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913580 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MaybeToListSym0 :: TyFun (Maybe a) [a] -> Type) (a6989586621679913580 :: Maybe a) = MaybeToList a6989586621679913580 | |
| type Apply (MaxInternalSym0 :: TyFun (Maybe a) (MaxInternal a) -> Type) (t6989586621680733515 :: Maybe a) | |
| type Apply (MinInternalSym0 :: TyFun (Maybe a) (MinInternal a) -> Type) (t6989586621680733713 :: Maybe a) | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680197015 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680634737 :: Maybe a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680634760 :: Maybe a) | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680197012 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680634734 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680634757 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (FindSym1 a6989586621680320898 :: TyFun [a] (Maybe a) -> Type) (a6989586621680320899 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (FindIndexSym1 a6989586621680320874 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320875 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (ElemIndexSym1 a6989586621680320890 :: TyFun [a] (Maybe Nat) -> Type) (a6989586621680320891 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (StripPrefixSym1 a6989586621680440227 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440228 :: [a]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym1 a6989586621680440227 :: TyFun [a] (Maybe [a]) -> Type) (a6989586621680440228 :: [a]) = StripPrefix a6989586621680440227 a6989586621680440228 | |
| type Apply (TFHelper_6989586621680024600Sym1 a6989586621680024598 :: TyFun (Maybe a) (Maybe a) -> Type) (a6989586621680024599 :: Maybe a) | |
| type Apply (OptionalSym0 :: TyFun (f a) (f (Maybe a)) -> Type) (a6989586621681393559 :: f a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (LookupSym1 a6989586621680320552 b :: TyFun [(a, b)] (Maybe b) -> Type) (a6989586621680320553 :: [(a, b)]) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Fmap_6989586621680024164Sym1 a6989586621680024162 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024163 :: Maybe a) | |
| type Apply (TFHelper_6989586621680024177Sym1 a6989586621680024175 b :: TyFun (Maybe b) (Maybe a) -> Type) (a6989586621680024176 :: Maybe b) | |
| type Apply (TFHelper_6989586621680024325Sym1 a6989586621680024323 :: TyFun (Maybe a) (Maybe b) -> Type) (a6989586621680024324 :: Maybe a) | |
| type Apply (TFHelper_6989586621680024355Sym1 a6989586621680024353 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024354 :: Maybe b) | |
| type Apply (TFHelper_6989586621680024510Sym1 a6989586621680024508 b :: TyFun (Maybe b) (Maybe b) -> Type) (a6989586621680024509 :: Maybe b) | |
| type Apply (FindSym1 a6989586621680742743 t :: TyFun (t a) (Maybe a) -> Type) (a6989586621680742744 :: t a) | |
| type Apply (Traverse_6989586621680995058Sym1 a6989586621680995056 :: TyFun (Maybe a) (f (Maybe b)) -> Type) (a6989586621680995057 :: Maybe a) | |
| type Apply (LiftA2_6989586621680024339Sym2 a6989586621680024337 a6989586621680024336 :: TyFun (Maybe b) (Maybe c) -> Type) (a6989586621680024338 :: Maybe b) | |
| type Apply (Let6989586621680743199MfSym3 a6989586621680743200 xs6989586621680743198 f6989586621680743197 :: TyFun (Maybe k3) (Maybe k2) -> Type) (a6989586621680743201 :: Maybe k3) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Eval (Init (a2 ': (b ': as)) :: Maybe [a1] -> Type) | |
| 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 (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 [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) (a6989586621680440227 :: [a6989586621680438531]) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (StripPrefixSym0 :: TyFun [a6989586621680438531] ([a6989586621680438531] ~> Maybe [a6989586621680438531]) -> Type) (a6989586621680440227 :: [a6989586621680438531]) = StripPrefixSym1 a6989586621680440227 | |
| type Apply (TFHelper_6989586621680024600Sym0 :: TyFun (Maybe a6989586621679962884) (Maybe a6989586621679962884 ~> Maybe a6989586621679962884) -> Type) (a6989586621680024598 :: Maybe a6989586621679962884) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679803205 :: Maybe a3530822107858468865) | |
| type Apply (ShowsPrec_6989586621680595735Sym1 a6989586621680595732 a3530822107858468865 :: TyFun (Maybe a3530822107858468865) (Symbol ~> Symbol) -> Type) (a6989586621680595733 :: Maybe a3530822107858468865) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) (a6989586621680024353 :: Maybe a6989586621679962814) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024355Sym0 :: TyFun (Maybe a6989586621679962814) (Maybe b6989586621679962815 ~> Maybe b6989586621679962815) -> Type) (a6989586621680024353 :: Maybe a6989586621679962814) = TFHelper_6989586621680024355Sym1 a6989586621680024353 b6989586621679962815 :: TyFun (Maybe b6989586621679962815) (Maybe b6989586621679962815) -> Type | |
| type Apply (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) (a6989586621680024496 :: Maybe a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024498Sym0 :: TyFun (Maybe a6989586621679962832) ((a6989586621679962832 ~> Maybe b6989586621679962833) ~> Maybe b6989586621679962833) -> Type) (a6989586621680024496 :: Maybe a6989586621679962832) = TFHelper_6989586621680024498Sym1 a6989586621680024496 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Maybe b6989586621679962833) (Maybe b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) (a6989586621680024508 :: Maybe a6989586621679962834) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024510Sym0 :: TyFun (Maybe a6989586621679962834) (Maybe b6989586621679962835 ~> Maybe b6989586621679962835) -> Type) (a6989586621680024508 :: Maybe a6989586621679962834) = TFHelper_6989586621680024510Sym1 a6989586621680024508 b6989586621679962835 :: TyFun (Maybe b6989586621679962835) (Maybe b6989586621679962835) -> Type | |
| type Apply (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) (a6989586621680024323 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024325Sym0 :: TyFun (Maybe (a6989586621679962809 ~> b6989586621679962810)) (Maybe a6989586621679962809 ~> Maybe b6989586621679962810) -> Type) (a6989586621680024323 :: Maybe (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680024325Sym1 a6989586621680024323 | |
| type Apply (LiftA2_6989586621680024339Sym1 a6989586621680024336 :: TyFun (Maybe a6989586621679962811) (Maybe b6989586621679962812 ~> Maybe c6989586621679962813) -> Type) (a6989586621680024337 :: Maybe a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680743224MfSym2 xs6989586621680743223 f6989586621680743222 :: TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) (a6989586621680743225 :: 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 Eval ('Just x <|> _1 :: Maybe a -> Type) | |
| type Eval (('Nothing :: Maybe a) <|> m :: Maybe a -> Type) | |
| type Apply (TFHelper_6989586621680024498Sym1 a6989586621680024496 b :: TyFun (a ~> Maybe b) (Maybe b) -> Type) (a6989586621680024497 :: a ~> Maybe b) | |
| type Apply (FindSym0 :: TyFun (a6989586621680316350 ~> Bool) ([a6989586621680316350] ~> Maybe a6989586621680316350) -> Type) (a6989586621680320898 :: a6989586621680316350 ~> Bool) | |
| type Apply (FindIndexSym0 :: TyFun (a6989586621680316347 ~> Bool) ([a6989586621680316347] ~> Maybe Nat) -> Type) (a6989586621680320874 :: a6989586621680316347 ~> Bool) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Fmap_6989586621680024164Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Maybe a6989586621679962803 ~> Maybe b6989586621679962804) -> Type) (a6989586621680024162 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) (a6989586621679913553 :: a6989586621679913392 ~> Maybe b6989586621679913393) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (MapMaybeSym0 :: TyFun (a6989586621679913392 ~> Maybe b6989586621679913393) ([a6989586621679913392] ~> [b6989586621679913393]) -> Type) (a6989586621679913553 :: a6989586621679913392 ~> Maybe b6989586621679913393) = MapMaybeSym1 a6989586621679913553 | |
| type Apply (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) (a6989586621680321318 :: b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (UnfoldrSym0 :: TyFun (b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) (b6989586621680316406 ~> [a6989586621680316407]) -> Type) (a6989586621680321318 :: b6989586621680316406 ~> Maybe (a6989586621680316407, b6989586621680316406)) = UnfoldrSym1 a6989586621680321318 | |
| type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (FindSym0 :: TyFun (a6989586621680742290 ~> Bool) (t6989586621680742289 a6989586621680742290 ~> Maybe a6989586621680742290) -> Type) (a6989586621680742743 :: a6989586621680742290 ~> Bool) = FindSym1 a6989586621680742743 t6989586621680742289 :: TyFun (t6989586621680742289 a6989586621680742290) (Maybe a6989586621680742290) -> Type | |
| type Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) (a6989586621680995056 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995058Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Maybe a6989586621680988964 ~> f6989586621680988963 (Maybe b6989586621680988965)) -> Type) (a6989586621680995056 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995058Sym1 a6989586621680995056 | |
| type Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) (a6989586621680024336 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680024339Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Maybe a6989586621679962811 ~> (Maybe b6989586621679962812 ~> Maybe c6989586621679962813)) -> Type) (a6989586621680024336 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621680024339Sym1 a6989586621680024336 | |
| type Apply (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) (a6989586621679911979 :: a6989586621679911961 ~> b6989586621679911960) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Maybe_Sym1 a6989586621679911978 a6989586621679911961 :: TyFun (a6989586621679911961 ~> b6989586621679911960) (Maybe a6989586621679911961 ~> b6989586621679911960) -> Type) (a6989586621679911979 :: a6989586621679911961 ~> b6989586621679911960) = Maybe_Sym2 a6989586621679911978 a6989586621679911979 | |
| type Apply (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) (f6989586621679913557 :: a6989586621679913392 ~> Maybe k1) | |
Defined in Data.Singletons.Prelude.Maybe type Apply (Let6989586621679913560RsSym0 :: TyFun (a6989586621679913392 ~> Maybe k1) (TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type) -> Type) (f6989586621679913557 :: a6989586621679913392 ~> Maybe k1) = Let6989586621679913560RsSym1 f6989586621679913557 :: TyFun k (TyFun [a6989586621679913392] [k1] -> Type) -> Type | |
| type Apply (Let6989586621680743199MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743197 :: k2 ~> (k3 ~> k2)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743199MfSym0 :: TyFun (k2 ~> (k3 ~> k2)) (TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type) -> Type) (f6989586621680743197 :: k2 ~> (k3 ~> k2)) = Let6989586621680743199MfSym1 f6989586621680743197 :: TyFun k (TyFun k2 (TyFun (Maybe k3) (Maybe k2) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743222 :: k2 ~> (k3 ~> k3)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743224MfSym0 :: TyFun (k2 ~> (k3 ~> k3)) (TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type) -> Type) (f6989586621680743222 :: k2 ~> (k3 ~> k3)) = Let6989586621680743224MfSym1 f6989586621680743222 :: TyFun k (TyFun (Maybe k2) (TyFun k3 (Maybe k3) -> Type) -> Type) -> Type | |
| type Apply (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680640918 :: k1 ~> First a) | |
| type Apply (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680641006 :: k1 ~> Last a) | |
| type Unwrappable (NamedF Maybe a name) | |
Defined in Lorentz.Wrappable | |
| type ToT (NamedF Maybe a name) | |
Instances
| Bounded Ordering | Since: base-2.1 |
| Enum Ordering | Since: base-2.1 |
| Eq Ordering | |
| Data Ordering | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ordering -> c Ordering # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Ordering # toConstr :: Ordering -> Constr # dataTypeOf :: Ordering -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Ordering) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Ordering) # gmapT :: (forall b. Data b => b -> b) -> Ordering -> Ordering # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ordering -> r # gmapQ :: (forall d. Data d => d -> u) -> Ordering -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ordering -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ordering -> m Ordering # | |
| Ord Ordering | |
Defined in GHC.Classes | |
| Read Ordering | Since: base-2.1 |
| Show Ordering | Since: base-2.1 |
| Generic Ordering | Since: base-4.6.0.0 |
| Semigroup Ordering | Since: base-4.9.0.0 |
| Monoid Ordering | Since: base-2.1 |
| Hashable Ordering | |
Defined in Data.Hashable.Class | |
| NFData Ordering | |
Defined in Control.DeepSeq | |
| Default Ordering | |
Defined in Data.Default.Class | |
| 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) # sShow_ :: forall (t :: Ordering). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Ordering]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup Ordering | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup Ordering | |
| PEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SEnum Ordering | |
Defined in Data.Singletons.Prelude.Enum Methods sSucc :: forall (t :: Ordering). Sing t -> Sing (Apply SuccSym0 t) # sPred :: forall (t :: Ordering). Sing t -> Sing (Apply PredSym0 t) # sToEnum :: forall (t :: Nat). Sing t -> Sing (Apply ToEnumSym0 t) # sFromEnum :: forall (t :: Ordering). Sing t -> Sing (Apply FromEnumSym0 t) # sEnumFromTo :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply EnumFromToSym0 t1) t2) # sEnumFromThenTo :: forall (t1 :: Ordering) (t2 :: Ordering) (t3 :: Ordering). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply EnumFromThenToSym0 t1) t2) t3) # | |
| PBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded Ordering | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd Ordering | |
| SOrd Ordering | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Ordering) (t2 :: Ordering). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Ordering | |
| PEq Ordering | |
| 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) | |
| SingI ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ThenCmpSym0 # | |
| SuppressUnusedWarnings Compare_6989586621679803720Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings FromEnum_6989586621680152610Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ThenCmpSym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679803730Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ToEnum_6989586621680152594Sym0 | |
Defined in Data.Singletons.Prelude.Enum Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621680595883Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679803740Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679803332Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680206622Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680206640Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (ThenCmpSym1 d :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ThenCmpSym1 d) # | |
| SOrd a => SingI (CompareSym0 :: TyFun a (a ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing CompareSym0 # | |
| SingI (ListsortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
| SingI (SortBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> [a]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing SortBySym0 # | |
| SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) ([a] ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| SingI (InsertBySym0 :: TyFun (a ~> (a ~> Ordering)) (a ~> ([a] ~> [a])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods sing :: Sing InsertBySym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679803720Sym1 a6989586621679803718 :: TyFun Bool Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803239Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ThenCmpSym1 a6989586621679802827 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803730Sym1 a6989586621679803728 :: TyFun Ordering Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595883Sym1 a6989586621680595880 :: TyFun Ordering (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803740Sym1 a6989586621679803738 :: TyFun () Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792586Scrutinee_6989586621679792409Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792568Scrutinee_6989586621679792407Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792550Scrutinee_6989586621679792405Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792532Scrutinee_6989586621679792403Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679792500Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803332Sym1 a6989586621679803330 :: TyFun Void Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206703Sym0 :: TyFun (Min a6989586621679060068) (Min a6989586621679060068 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206724Sym0 :: TyFun (Max a6989586621679060073) (Max a6989586621679060073 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206745Sym0 :: TyFun (First a6989586621679060083) (First a6989586621679060083 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206766Sym0 :: TyFun (Last a6989586621679060078) (Last a6989586621679060078 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206583Sym0 :: TyFun (Option a6989586621679060063) (Option a6989586621679060063 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803706Sym0 :: TyFun (Identity a6989586621679087410) (Identity a6989586621679087410 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636482Sym0 :: TyFun (First a6989586621679087424) (First a6989586621679087424 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636503Sym0 :: TyFun (Last a6989586621679087417) (Last a6989586621679087417 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206604Sym0 :: TyFun (Dual a6989586621679087483) (Dual a6989586621679087483 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206622Sym1 a6989586621680206620 :: TyFun All Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206640Sym1 a6989586621680206638 :: TyFun Any Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206661Sym0 :: TyFun (Sum a6989586621679087460) (Sum a6989586621679087460 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206682Sym0 :: TyFun (Product a6989586621679087468) (Product a6989586621679087468 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679801934Sym0 :: TyFun (Down a6989586621679801914) (Down a6989586621679801914 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803314Sym0 :: TyFun (NonEmpty a6989586621679060149) (NonEmpty a6989586621679060149 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ListsortBySym0 :: TyFun (a6989586621680686806 ~> (a6989586621680686806 ~> Ordering)) ([a6989586621680686806] ~> [a6989586621680686806]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal.Disambiguation Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SortBySym0 :: TyFun (a6989586621680316355 ~> (a6989586621680316355 ~> Ordering)) ([a6989586621680316355] ~> [a6989586621680316355]) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680316352 ~> (a6989586621680316352 ~> Ordering)) ([a6989586621680316352] ~> a6989586621680316352) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680316353 ~> (a6989586621680316353 ~> Ordering)) ([a6989586621680316353] ~> a6989586621680316353) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (InsertBySym0 :: TyFun (a6989586621680316354 ~> (a6989586621680316354 ~> Ordering)) (a6989586621680316354 ~> ([a6989586621680316354] ~> [a6989586621680316354])) -> Type) | |
Defined in Data.Singletons.Prelude.List.Internal Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (CompareSym1 d :: TyFun a Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (CompareSym1 d) # | |
| SFoldable t => SingI (MinimumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MinimumBySym0 # | |
| SFoldable t => SingI (MaximumBySym0 :: TyFun (a ~> (a ~> Ordering)) (t a ~> a) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods sing :: Sing MaximumBySym0 # | |
| SOrd a => SingI (ComparingSym0 :: TyFun (b ~> a) (b ~> (b ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing ComparingSym0 # | |
| SuppressUnusedWarnings (Compare_6989586621679803239Sym1 a6989586621679803237 :: TyFun [a3530822107858468865] Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a3530822107858468865) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803356Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792586Scrutinee_6989586621679792409Sym1 x6989586621679792584 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792568Scrutinee_6989586621679792407Sym1 x6989586621679792566 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792550Scrutinee_6989586621679792405Sym1 x6989586621679792548 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621679792532Scrutinee_6989586621679792403Sym1 x6989586621679792530 :: TyFun k1 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679792500Sym1 a6989586621679792498 :: TyFun a6989586621679792381 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (CompareSym1 arg6989586621679792470 :: TyFun a6989586621679792381 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206703Sym1 a6989586621680206701 :: TyFun (Min a6989586621679060068) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206724Sym1 a6989586621680206722 :: TyFun (Max a6989586621679060073) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681108340Sym0 :: TyFun (Arg a6989586621681107128 b6989586621681107129) (Arg a6989586621681107128 b6989586621681107129 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206745Sym1 a6989586621680206743 :: TyFun (First a6989586621679060083) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206766Sym1 a6989586621680206764 :: TyFun (Last a6989586621679060078) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m6989586621679090730) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206583Sym1 a6989586621680206581 :: TyFun (Option a6989586621679060063) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803706Sym1 a6989586621679803704 :: TyFun (Identity a6989586621679087410) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636482Sym1 a6989586621680636480 :: TyFun (First a6989586621679087424) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636503Sym1 a6989586621680636501 :: TyFun (Last a6989586621679087417) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206604Sym1 a6989586621680206602 :: TyFun (Dual a6989586621679087483) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206661Sym1 a6989586621680206659 :: TyFun (Sum a6989586621679087460) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206682Sym1 a6989586621680206680 :: TyFun (Product a6989586621679087468) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679801934Sym1 a6989586621679801932 :: TyFun (Down a6989586621679801914) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803314Sym1 a6989586621679803312 :: TyFun (NonEmpty a6989586621679060149) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MinimumBySym0 :: TyFun (a6989586621680742294 ~> (a6989586621680742294 ~> Ordering)) (t6989586621680742293 a6989586621680742294 ~> a6989586621680742294) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (MaximumBySym0 :: TyFun (a6989586621680742296 ~> (a6989586621680742296 ~> Ordering)) (t6989586621680742295 a6989586621680742296 ~> a6989586621680742296) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742811Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742786Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym0 :: TyFun (b6989586621679792371 ~> a6989586621679792370) (b6989586621679792371 ~> (b6989586621679792371 ~> Ordering)) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| (SOrd a, SingI d) => SingI (ComparingSym1 d :: TyFun b (b ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym1 d) # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a6989586621679091038 b6989586621679091039) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803356Sym1 a6989586621679803354 :: TyFun (a3530822107858468865, b3530822107858468866) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803395Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym1 a6989586621679792461 :: TyFun b6989586621679792371 (b6989586621679792371 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621681108340Sym1 a6989586621681108338 :: TyFun (Arg a6989586621681107128 b6989586621681107129) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680320962MaxBySym0 :: 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 :: () # | |
| SuppressUnusedWarnings (Let6989586621680320932MinBySym0 :: 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 :: () # | |
| (SOrd a, SingI d1, SingI d2) => SingI (ComparingSym2 d1 d2 :: TyFun b Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods sing :: Sing (ComparingSym2 d1 d2) # | |
| SuppressUnusedWarnings (Compare_6989586621679803395Sym1 a6989586621679803393 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803445Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ComparingSym2 a6989586621679792462 a6989586621679792461 :: TyFun b6989586621679792371 Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680953507Sym1 a6989586621680953505 :: TyFun (Const a6989586621680952767 b6989586621680952768) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803445Sym1 a6989586621679803443 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803506Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803506Sym1 a6989586621679803504 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803578Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803578Sym1 a6989586621679803576 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803661Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803661Sym1 a6989586621679803659 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| type Rep Ordering | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum type MaxBound = MaxBound_6989586621680125218Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum type MinBound = MinBound_6989586621680125216Sym0 | |
| type Demote Ordering | |
Defined in Data.Singletons.Prelude.Instances | |
| type Mconcat (arg0 :: [Ordering]) | |
| type Show_ (arg0 :: Ordering) | |
| type Sconcat (arg0 :: NonEmpty Ordering) | |
| type FromEnum (a :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type ToEnum a | |
Defined in Data.Singletons.Prelude.Enum | |
| type Pred (arg0 :: Ordering) | |
| type Succ (arg0 :: Ordering) | |
| 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_6989586621680152610Sym0 (a6989586621680152609 :: Ordering) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply ToEnum_6989586621680152594Sym0 (a6989586621680152593 :: Nat) | |
Defined in Data.Singletons.Prelude.Enum | |
| type Apply (Compare_6989586621679803720Sym1 a6989586621679803718 :: TyFun Bool Ordering -> Type) (a6989586621679803719 :: Bool) | |
| type Apply (ThenCmpSym1 a6989586621679802827 :: TyFun Ordering Ordering -> Type) (a6989586621679802828 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803730Sym1 a6989586621679803728 :: TyFun Ordering Ordering -> Type) (a6989586621679803729 :: Ordering) | |
| type Apply (Compare_6989586621679803740Sym1 a6989586621679803738 :: TyFun () Ordering -> Type) (a6989586621679803739 :: ()) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803332Sym1 a6989586621679803330 :: TyFun Void Ordering -> Type) (a6989586621679803331 :: Void) | |
| type Apply (Compare_6989586621680206622Sym1 a6989586621680206620 :: TyFun All Ordering -> Type) (a6989586621680206621 :: All) | |
| type Apply (Compare_6989586621680206640Sym1 a6989586621680206638 :: TyFun Any Ordering -> Type) (a6989586621680206639 :: Any) | |
| type Apply (Compare_6989586621679792500Sym1 a6989586621679792498 :: TyFun a Ordering -> Type) (a6989586621679792499 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (CompareSym1 arg6989586621679792470 :: TyFun a Ordering -> Type) (arg6989586621679792471 :: a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792586Scrutinee_6989586621679792409Sym1 x6989586621679792584 :: TyFun k1 Ordering -> Type) (y6989586621679792585 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792568Scrutinee_6989586621679792407Sym1 x6989586621679792566 :: TyFun k1 Ordering -> Type) (y6989586621679792567 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792550Scrutinee_6989586621679792405Sym1 x6989586621679792548 :: TyFun k1 Ordering -> Type) (y6989586621679792549 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Let6989586621679792532Scrutinee_6989586621679792403Sym1 x6989586621679792530 :: TyFun k1 Ordering -> Type) (y6989586621679792531 :: k1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (ComparingSym2 a6989586621679792462 a6989586621679792461 :: TyFun b Ordering -> Type) (a6989586621679792463 :: b) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679803720Sym0 (a6989586621679803718 :: Bool) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ThenCmpSym0 (a6989586621679802827 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621679803730Sym0 (a6989586621679803728 :: Ordering) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply ShowsPrec_6989586621680595883Sym0 (a6989586621680595880 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply Compare_6989586621679803740Sym0 (a6989586621679803738 :: ()) | |
Defined in Data.Singletons.Prelude.Ord type Apply Compare_6989586621679803740Sym0 (a6989586621679803738 :: ()) = Compare_6989586621679803740Sym1 a6989586621679803738 | |
| type Apply Compare_6989586621679803332Sym0 (a6989586621679803330 :: Void) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply Compare_6989586621680206622Sym0 (a6989586621680206620 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply Compare_6989586621680206640Sym0 (a6989586621680206638 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621680595883Sym1 a6989586621680595880 :: TyFun Ordering (Symbol ~> Symbol) -> Type) (a6989586621680595881 :: Ordering) | |
| type Apply (Compare_6989586621679792500Sym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Ordering) -> Type) (a6989586621679792498 :: a6989586621679792381) | |
| type Apply (CompareSym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Ordering) -> Type) (arg6989586621679792470 :: a6989586621679792381) | |
Defined in Data.Singletons.Prelude.Ord type Apply (CompareSym0 :: TyFun a6989586621679792381 (a6989586621679792381 ~> Ordering) -> Type) (arg6989586621679792470 :: a6989586621679792381) = CompareSym1 arg6989586621679792470 | |
| type Apply (Let6989586621679792586Scrutinee_6989586621679792409Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679792584 :: k1) | |
| type Apply (Let6989586621679792568Scrutinee_6989586621679792407Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679792566 :: k1) | |
| type Apply (Let6989586621679792550Scrutinee_6989586621679792405Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679792548 :: k1) | |
| type Apply (Let6989586621679792532Scrutinee_6989586621679792403Sym0 :: TyFun k1 (TyFun k1 Ordering -> Type) -> Type) (x6989586621679792530 :: k1) | |
| type Apply (ComparingSym1 a6989586621679792461 :: TyFun b6989586621679792371 (b6989586621679792371 ~> Ordering) -> Type) (a6989586621679792462 :: b6989586621679792371) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym1 a6989586621679792461 :: TyFun b6989586621679792371 (b6989586621679792371 ~> Ordering) -> Type) (a6989586621679792462 :: b6989586621679792371) = ComparingSym2 a6989586621679792461 a6989586621679792462 | |
| type Apply (Compare_6989586621679803239Sym1 a6989586621679803237 :: TyFun [a] Ordering -> Type) (a6989586621679803238 :: [a]) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803207Sym1 a6989586621679803205 :: TyFun (Maybe a) Ordering -> Type) (a6989586621679803206 :: Maybe a) | |
| type Apply (Compare_6989586621680206703Sym1 a6989586621680206701 :: TyFun (Min a) Ordering -> Type) (a6989586621680206702 :: Min a) | |
| type Apply (Compare_6989586621680206724Sym1 a6989586621680206722 :: TyFun (Max a) Ordering -> Type) (a6989586621680206723 :: Max a) | |
| type Apply (Compare_6989586621680206745Sym1 a6989586621680206743 :: TyFun (First a) Ordering -> Type) (a6989586621680206744 :: First a) | |
| type Apply (Compare_6989586621680206766Sym1 a6989586621680206764 :: TyFun (Last a) Ordering -> Type) (a6989586621680206765 :: Last a) | |
| type Apply (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680206786 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680206786 :: WrappedMonoid m) = Compare_6989586621680206787 a6989586621680206785 a6989586621680206786 | |
| type Apply (Compare_6989586621680206583Sym1 a6989586621680206581 :: TyFun (Option a) Ordering -> Type) (a6989586621680206582 :: Option a) | |
| type Apply (Compare_6989586621679803706Sym1 a6989586621679803704 :: TyFun (Identity a) Ordering -> Type) (a6989586621679803705 :: Identity a) | |
| type Apply (Compare_6989586621680636482Sym1 a6989586621680636480 :: TyFun (First a) Ordering -> Type) (a6989586621680636481 :: First a) | |
| type Apply (Compare_6989586621680636503Sym1 a6989586621680636501 :: TyFun (Last a) Ordering -> Type) (a6989586621680636502 :: Last a) | |
| type Apply (Compare_6989586621680206604Sym1 a6989586621680206602 :: TyFun (Dual a) Ordering -> Type) (a6989586621680206603 :: Dual a) | |
| type Apply (Compare_6989586621680206661Sym1 a6989586621680206659 :: TyFun (Sum a) Ordering -> Type) (a6989586621680206660 :: Sum a) | |
| type Apply (Compare_6989586621680206682Sym1 a6989586621680206680 :: TyFun (Product a) Ordering -> Type) (a6989586621680206681 :: Product a) | |
| type Apply (Compare_6989586621679801934Sym1 a6989586621679801932 :: TyFun (Down a) Ordering -> Type) (a6989586621679801933 :: Down a) | |
| type Apply (Compare_6989586621679803314Sym1 a6989586621679803312 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679803313 :: NonEmpty a) | |
| type Apply (Compare_6989586621679803239Sym0 :: TyFun [a3530822107858468865] ([a3530822107858468865] ~> Ordering) -> Type) (a6989586621679803237 :: [a3530822107858468865]) | |
| type Apply (Compare_6989586621679803207Sym0 :: TyFun (Maybe a3530822107858468865) (Maybe a3530822107858468865 ~> Ordering) -> Type) (a6989586621679803205 :: Maybe a3530822107858468865) | |
| type Apply (Compare_6989586621680206703Sym0 :: TyFun (Min a6989586621679060068) (Min a6989586621679060068 ~> Ordering) -> Type) (a6989586621680206701 :: Min a6989586621679060068) | |
| type Apply (Compare_6989586621680206724Sym0 :: TyFun (Max a6989586621679060073) (Max a6989586621679060073 ~> Ordering) -> Type) (a6989586621680206722 :: Max a6989586621679060073) | |
| type Apply (Compare_6989586621680206745Sym0 :: TyFun (First a6989586621679060083) (First a6989586621679060083 ~> Ordering) -> Type) (a6989586621680206743 :: First a6989586621679060083) | |
| type Apply (Compare_6989586621680206766Sym0 :: TyFun (Last a6989586621679060078) (Last a6989586621679060078 ~> Ordering) -> Type) (a6989586621680206764 :: Last a6989586621679060078) | |
| type Apply (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) (a6989586621680206785 :: WrappedMonoid m6989586621679090730) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) (a6989586621680206785 :: WrappedMonoid m6989586621679090730) = Compare_6989586621680206787Sym1 a6989586621680206785 | |
| type Apply (Compare_6989586621680206583Sym0 :: TyFun (Option a6989586621679060063) (Option a6989586621679060063 ~> Ordering) -> Type) (a6989586621680206581 :: Option a6989586621679060063) | |
| type Apply (Compare_6989586621679803706Sym0 :: TyFun (Identity a6989586621679087410) (Identity a6989586621679087410 ~> Ordering) -> Type) (a6989586621679803704 :: Identity a6989586621679087410) | |
| type Apply (Compare_6989586621680636482Sym0 :: TyFun (First a6989586621679087424) (First a6989586621679087424 ~> Ordering) -> Type) (a6989586621680636480 :: First a6989586621679087424) | |
| type Apply (Compare_6989586621680636503Sym0 :: TyFun (Last a6989586621679087417) (Last a6989586621679087417 ~> Ordering) -> Type) (a6989586621680636501 :: Last a6989586621679087417) | |
| type Apply (Compare_6989586621680206604Sym0 :: TyFun (Dual a6989586621679087483) (Dual a6989586621679087483 ~> Ordering) -> Type) (a6989586621680206602 :: Dual a6989586621679087483) | |
| type Apply (Compare_6989586621680206661Sym0 :: TyFun (Sum a6989586621679087460) (Sum a6989586621679087460 ~> Ordering) -> Type) (a6989586621680206659 :: Sum a6989586621679087460) | |
| type Apply (Compare_6989586621680206682Sym0 :: TyFun (Product a6989586621679087468) (Product a6989586621679087468 ~> Ordering) -> Type) (a6989586621680206680 :: Product a6989586621679087468) | |
| type Apply (Compare_6989586621679801934Sym0 :: TyFun (Down a6989586621679801914) (Down a6989586621679801914 ~> Ordering) -> Type) (a6989586621679801932 :: Down a6989586621679801914) | |
| type Apply (Compare_6989586621679803314Sym0 :: TyFun (NonEmpty a6989586621679060149) (NonEmpty a6989586621679060149 ~> Ordering) -> Type) (a6989586621679803312 :: NonEmpty a6989586621679060149) | |
| type Apply (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a b) Ordering -> Type) (a6989586621679803284 :: Either a b) | |
| type Apply (Compare_6989586621679803356Sym1 a6989586621679803354 :: TyFun (a, b) Ordering -> Type) (a6989586621679803355 :: (a, b)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681108340Sym1 a6989586621681108338 :: TyFun (Arg a b) Ordering -> Type) (a6989586621681108339 :: Arg a b) | |
| type Apply (ListsortBySym0 :: TyFun (a6989586621680686806 ~> (a6989586621680686806 ~> Ordering)) ([a6989586621680686806] ~> [a6989586621680686806]) -> Type) (a6989586621680687775 :: a6989586621680686806 ~> (a6989586621680686806 ~> Ordering)) | |
| type Apply (InsertBySym0 :: TyFun (a6989586621680316354 ~> (a6989586621680316354 ~> Ordering)) (a6989586621680316354 ~> ([a6989586621680316354] ~> [a6989586621680316354])) -> Type) (a6989586621680320981 :: a6989586621680316354 ~> (a6989586621680316354 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (InsertBySym0 :: TyFun (a6989586621680316354 ~> (a6989586621680316354 ~> Ordering)) (a6989586621680316354 ~> ([a6989586621680316354] ~> [a6989586621680316354])) -> Type) (a6989586621680320981 :: a6989586621680316354 ~> (a6989586621680316354 ~> Ordering)) = InsertBySym1 a6989586621680320981 | |
| type Apply (SortBySym0 :: TyFun (a6989586621680316355 ~> (a6989586621680316355 ~> Ordering)) ([a6989586621680316355] ~> [a6989586621680316355]) -> Type) (a6989586621680321005 :: a6989586621680316355 ~> (a6989586621680316355 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680316353 ~> (a6989586621680316353 ~> Ordering)) ([a6989586621680316353] ~> a6989586621680316353) -> Type) (a6989586621680320951 :: a6989586621680316353 ~> (a6989586621680316353 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680316352 ~> (a6989586621680316352 ~> Ordering)) ([a6989586621680316352] ~> a6989586621680316352) -> Type) (a6989586621680320921 :: a6989586621680316352 ~> (a6989586621680316352 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal | |
| type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) = Compare_6989586621679803285Sym1 a6989586621679803283 | |
| type Apply (Compare_6989586621679803356Sym0 :: TyFun (a3530822107858468865, b3530822107858468866) ((a3530822107858468865, b3530822107858468866) ~> Ordering) -> Type) (a6989586621679803354 :: (a3530822107858468865, b3530822107858468866)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621681108340Sym0 :: TyFun (Arg a6989586621681107128 b6989586621681107129) (Arg a6989586621681107128 b6989586621681107129 ~> Ordering) -> Type) (a6989586621681108338 :: Arg a6989586621681107128 b6989586621681107129) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Let6989586621680742786Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680742784 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742786Min'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680742784 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680742786Min'Sym1 cmp6989586621680742784 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680742811Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680742809 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742811Max'Sym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) (cmp6989586621680742809 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680742811Max'Sym1 cmp6989586621680742809 :: TyFun k2 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type | |
| type Apply (MaximumBySym0 :: TyFun (a6989586621680742296 ~> (a6989586621680742296 ~> Ordering)) (t6989586621680742295 a6989586621680742296 ~> a6989586621680742296) -> Type) (a6989586621680742803 :: a6989586621680742296 ~> (a6989586621680742296 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MaximumBySym0 :: TyFun (a6989586621680742296 ~> (a6989586621680742296 ~> Ordering)) (t6989586621680742295 a6989586621680742296 ~> a6989586621680742296) -> Type) (a6989586621680742803 :: a6989586621680742296 ~> (a6989586621680742296 ~> Ordering)) = MaximumBySym1 a6989586621680742803 t6989586621680742295 :: TyFun (t6989586621680742295 a6989586621680742296) a6989586621680742296 -> Type | |
| type Apply (MinimumBySym0 :: TyFun (a6989586621680742294 ~> (a6989586621680742294 ~> Ordering)) (t6989586621680742293 a6989586621680742294 ~> a6989586621680742294) -> Type) (a6989586621680742778 :: a6989586621680742294 ~> (a6989586621680742294 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (MinimumBySym0 :: TyFun (a6989586621680742294 ~> (a6989586621680742294 ~> Ordering)) (t6989586621680742293 a6989586621680742294 ~> a6989586621680742294) -> Type) (a6989586621680742778 :: a6989586621680742294 ~> (a6989586621680742294 ~> Ordering)) = MinimumBySym1 a6989586621680742778 t6989586621680742293 :: TyFun (t6989586621680742293 a6989586621680742294) a6989586621680742294 -> Type | |
| type Apply (ComparingSym0 :: TyFun (b6989586621679792371 ~> a6989586621679792370) (b6989586621679792371 ~> (b6989586621679792371 ~> Ordering)) -> Type) (a6989586621679792461 :: b6989586621679792371 ~> a6989586621679792370) | |
Defined in Data.Singletons.Prelude.Ord type Apply (ComparingSym0 :: TyFun (b6989586621679792371 ~> a6989586621679792370) (b6989586621679792371 ~> (b6989586621679792371 ~> Ordering)) -> Type) (a6989586621679792461 :: b6989586621679792371 ~> a6989586621679792370) = ComparingSym1 a6989586621679792461 | |
| type Apply (Let6989586621680320932MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680320925 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320932MinBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680320925 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680320932MinBySym1 cmp6989586621680320925 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Let6989586621680320962MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680320955 :: k1 ~> (k1 ~> Ordering)) | |
Defined in Data.Singletons.Prelude.List.Internal type Apply (Let6989586621680320962MaxBySym0 :: TyFun (k1 ~> (k1 ~> Ordering)) (TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type) -> Type) (cmp6989586621680320955 :: k1 ~> (k1 ~> Ordering)) = Let6989586621680320962MaxBySym1 cmp6989586621680320955 :: TyFun k2 (TyFun k3 (TyFun k1 (TyFun k1 k1 -> Type) -> Type) -> Type) -> Type | |
| type Apply (Compare_6989586621679803395Sym1 a6989586621679803393 :: TyFun (a, b, c) Ordering -> Type) (a6989586621679803394 :: (a, b, c)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621680953507Sym1 a6989586621680953505 :: TyFun (Const a b) Ordering -> Type) (a6989586621680953506 :: Const a b) | |
| type Apply (Compare_6989586621679803395Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679803393 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803395Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867) ((a3530822107858468865, b3530822107858468866, c3530822107858468867) ~> Ordering) -> Type) (a6989586621679803393 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867)) = Compare_6989586621679803395Sym1 a6989586621679803393 | |
| type Apply (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) (a6989586621680953505 :: Const a6989586621680952767 b6989586621680952768) | |
Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) (a6989586621680953505 :: Const a6989586621680952767 b6989586621680952768) = Compare_6989586621680953507Sym1 a6989586621680953505 | |
| type Apply (Compare_6989586621679803445Sym1 a6989586621679803443 :: TyFun (a, b, c, d) Ordering -> Type) (a6989586621679803444 :: (a, b, c, d)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803445Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679803443 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803445Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868) ~> Ordering) -> Type) (a6989586621679803443 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868)) = Compare_6989586621679803445Sym1 a6989586621679803443 | |
| type Apply (Compare_6989586621679803506Sym1 a6989586621679803504 :: TyFun (a, b, c, d, e) Ordering -> Type) (a6989586621679803505 :: (a, b, c, d, e)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803506Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679803504 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803506Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869) ~> Ordering) -> Type) (a6989586621679803504 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869)) = Compare_6989586621679803506Sym1 a6989586621679803504 | |
| type Apply (Compare_6989586621679803578Sym1 a6989586621679803576 :: TyFun (a, b, c, d, e, f) Ordering -> Type) (a6989586621679803577 :: (a, b, c, d, e, f)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803578Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679803576 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803578Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870) ~> Ordering) -> Type) (a6989586621679803576 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870)) = Compare_6989586621679803578Sym1 a6989586621679803576 | |
| type Apply (Compare_6989586621679803661Sym1 a6989586621679803659 :: TyFun (a, b, c, d, e, f, g) Ordering -> Type) (a6989586621679803660 :: (a, b, c, d, e, f, g)) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679803661Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679803659 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803661Sym0 :: TyFun (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ((a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871) ~> Ordering) -> Type) (a6989586621679803659 :: (a3530822107858468865, b3530822107858468866, c3530822107858468867, d3530822107858468868, e3530822107858468869, f3530822107858468870, g3530822107858468871)) = Compare_6989586621679803661Sym1 a6989586621679803659 | |
Rational numbers, with numerator and denominator of some Integral type.
Note that Ratio's instances inherit the deficiencies from the type
parameter's. For example, Ratio Natural's Num instance has similar
problems to Natural's.
Constructors
| !a :% !a |
Instances
| NFData1 Ratio | Available on Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Integral a => Enum (Ratio a) | Since: base-2.0.1 |
| Eq a => Eq (Ratio a) | Since: base-2.1 |
| Integral a => Fractional (Ratio a) | Since: base-2.0.1 |
| (Data a, Integral a) => Data (Ratio 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) -> Ratio a -> c (Ratio a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Ratio a) # toConstr :: Ratio a -> Constr # dataTypeOf :: Ratio a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Ratio a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Ratio a)) # gmapT :: (forall b. Data b => b -> b) -> Ratio a -> Ratio a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ratio a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ratio a -> r # gmapQ :: (forall d. Data d => d -> u) -> Ratio a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ratio a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ratio a -> m (Ratio a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ratio a -> m (Ratio a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ratio a -> m (Ratio a) # | |
| Integral a => Num (Ratio a) | Since: base-2.0.1 |
| Integral a => Ord (Ratio a) | Since: base-2.0.1 |
| (Integral a, Read a) => Read (Ratio a) | Since: base-2.1 |
| Integral a => Real (Ratio a) | Since: base-2.0.1 |
Defined in GHC.Real Methods toRational :: Ratio a -> Rational # | |
| Integral a => RealFrac (Ratio a) | Since: base-2.0.1 |
| Show a => Show (Ratio a) | Since: base-2.0.1 |
| Integral a => Lift (Ratio a) | |
| Hashable a => Hashable (Ratio a) | |
Defined in Data.Hashable.Class | |
| (Storable a, Integral a) => Storable (Ratio a) | Since: base-4.8.0.0 |
| NFData a => NFData (Ratio a) | |
Defined in Control.DeepSeq | |
| Integral a => Default (Ratio a) | |
Defined in Data.Default.Class | |
| (Eq a) :=> (Eq (Ratio a)) | |
| (Integral a) :=> (RealFrac (Ratio a)) | |
| (Integral a) :=> (Real (Ratio a)) | |
| (Integral a) :=> (Ord (Ratio a)) | |
| (Integral a) :=> (Num (Ratio a)) | |
| (Integral a) :=> (Fractional (Ratio a)) | |
Defined in Data.Constraint | |
| (Integral a) :=> (Enum (Ratio a)) | |
| (Integral a, Show a) :=> (Show (Ratio a)) | |
| (Integral a, Read a) :=> (Read (Ratio a)) | |
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
8-bit unsigned integer type
Instances
16-bit unsigned integer type
Instances
32-bit unsigned integer type
Instances
64-bit unsigned integer type
Instances
A value of type Ptr aa.
The type a will often be an instance of class
Storable which provides the marshalling operations.
However this is not essential, and you can provide your own operations
to access the pointer. For example you might write small foreign
functions to get or set the fields of a C struct.
Instances
| NFData1 Ptr | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Generic1 (URec (Ptr ()) :: k -> Type) | Since: base-4.9.0.0 |
| Eq (Ptr a) | Since: base-2.1 |
| Data a => Data (Ptr a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Ptr a -> c (Ptr a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Ptr a) # dataTypeOf :: Ptr a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Ptr a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Ptr a)) # gmapT :: (forall b. Data b => b -> b) -> Ptr a -> Ptr a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Ptr a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Ptr a -> r # gmapQ :: (forall d. Data d => d -> u) -> Ptr a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Ptr a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Ptr a -> m (Ptr a) # | |
| Ord (Ptr a) | Since: base-2.1 |
| Show (Ptr a) | Since: base-2.1 |
| Hashable (Ptr a) | |
Defined in Data.Hashable.Class | |
| Storable (Ptr a) | Since: base-2.1 |
| NFData (Ptr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Functor (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
| Foldable (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => URec (Ptr ()) m -> m # foldMap :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldMap' :: Monoid m => (a -> m) -> URec (Ptr ()) a -> m # foldr :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldr' :: (a -> b -> b) -> b -> URec (Ptr ()) a -> b # foldl :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldl' :: (b -> a -> b) -> b -> URec (Ptr ()) a -> b # foldr1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # foldl1 :: (a -> a -> a) -> URec (Ptr ()) a -> a # toList :: URec (Ptr ()) a -> [a] # null :: URec (Ptr ()) a -> Bool # length :: URec (Ptr ()) a -> Int # elem :: Eq a => a -> URec (Ptr ()) a -> Bool # maximum :: Ord a => URec (Ptr ()) a -> a # minimum :: Ord a => URec (Ptr ()) a -> a # | |
| Traversable (URec (Ptr ()) :: Type -> Type) | Since: base-4.9.0.0 |
Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> URec (Ptr ()) a -> f (URec (Ptr ()) b) # sequenceA :: Applicative f => URec (Ptr ()) (f a) -> f (URec (Ptr ()) a) # mapM :: Monad m => (a -> m b) -> URec (Ptr ()) a -> m (URec (Ptr ()) b) # sequence :: Monad m => URec (Ptr ()) (m a) -> m (URec (Ptr ()) a) # | |
| Eq (URec (Ptr ()) p) | Since: base-4.9.0.0 |
| Ord (URec (Ptr ()) p) | Since: base-4.9.0.0 |
Defined in GHC.Generics Methods compare :: URec (Ptr ()) p -> URec (Ptr ()) p -> Ordering # (<) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (<=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # (>=) :: URec (Ptr ()) p -> URec (Ptr ()) p -> Bool # max :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # min :: URec (Ptr ()) p -> URec (Ptr ()) p -> URec (Ptr ()) p # | |
| Generic (URec (Ptr ()) p) | Since: base-4.9.0.0 |
| data URec (Ptr ()) (p :: k) | Used for marking occurrences of Since: base-4.9.0.0 |
| type Rep1 (URec (Ptr ()) :: k -> Type) | |
Defined in GHC.Generics | |
| type Rep (URec (Ptr ()) p) | |
Defined in GHC.Generics | |
A value of type FunPtr aa will normally be a foreign type,
a function type with zero or more arguments where
- the argument types are marshallable foreign types,
i.e.
Char,Int,Double,Float,Bool,Int8,Int16,Int32,Int64,Word8,Word16,Word32,Word64,PtraFunPtraStablePtranewtype. - the return type is either a marshallable foreign type or has the form
IOttis a marshallable foreign type or().
A value of type FunPtr a
foreign import ccall "stdlib.h &free" p_free :: FunPtr (Ptr a -> IO ())
or a pointer to a Haskell function created using a wrapper stub
declared to produce a FunPtr of the correct type. For example:
type Compare = Int -> Int -> Bool foreign import ccall "wrapper" mkCompare :: Compare -> IO (FunPtr Compare)
Calls to wrapper stubs like mkCompare allocate storage, which
should be released with freeHaskellFunPtr when no
longer required.
To convert FunPtr values to corresponding Haskell functions, one
can define a dynamic stub for the specific foreign type, e.g.
type IntFunction = CInt -> IO () foreign import ccall "dynamic" mkFun :: FunPtr IntFunction -> IntFunction
Instances
| NFData1 FunPtr | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq (FunPtr a) | |
| Ord (FunPtr a) | |
Defined in GHC.Ptr | |
| Show (FunPtr a) | Since: base-2.1 |
| Hashable (FunPtr a) | |
Defined in Data.Hashable.Class | |
| Storable (FunPtr a) | Since: base-2.1 |
Defined in Foreign.Storable | |
| NFData (FunPtr a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
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
| Bifunctor Either | Since: base-4.8.0.0 |
| NFData2 Either | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 Either | |
Defined in Data.Hashable.Class | |
| () :=> (Monad (Either a)) | |
| () :=> (Functor (Either a)) | |
| () :=> (Applicative (Either a)) | |
Defined in Data.Constraint Methods ins :: () :- Applicative (Either a) # | |
| MonadError e (Either e) | |
Defined in Control.Monad.Error.Class | |
| Monad (Either e) | Since: base-4.4.0.0 |
| Functor (Either a) | Since: base-3.0 |
| Applicative (Either e) | Since: base-3.0 |
| Foldable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Either a m -> m # foldMap :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldMap' :: Monoid m => (a0 -> m) -> Either a a0 -> m # foldr :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> Either a a0 -> b # foldl :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> Either a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> Either a a0 -> a0 # toList :: Either a a0 -> [a0] # length :: Either a a0 -> Int # elem :: Eq a0 => a0 -> Either a a0 -> Bool # maximum :: Ord a0 => Either a a0 -> a0 # minimum :: Ord a0 => Either a a0 -> a0 # | |
| Traversable (Either a) | Since: base-4.7.0.0 |
Defined in Data.Traversable | |
| MonadFailure (Either a) | |
| NFData a => NFData1 (Either a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| e ~ SomeException => MonadThrow (Either e) | |
Defined in Control.Monad.Catch | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| 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) # sSequenceA :: forall (f :: Type -> Type) a0 (t :: Either a (f a0)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # 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) # sSequence :: forall (m :: Type -> Type) a0 (t :: Either a (m a0)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable (Either a) | |
| SFoldable (Either a) | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Either a m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a0 m (t1 :: a0 ~> m) (t2 :: Either a a0). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # 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) # 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) # 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) # 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) # sFoldr1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a0 (t1 :: a0 ~> (a0 ~> a0)) (t2 :: Either a a0). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a0 (t :: Either a a0). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a0 (t1 :: a0) (t2 :: Either a a0). SEq a0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a0 (t :: Either a a0). SOrd a0 => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a0 (t :: Either a a0). SNum a0 => Sing t -> Sing (Apply ProductSym0 t) # | |
| PFunctor (Either a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative (Either e) | |
| PMonad (Either e) | |
| SFunctor (Either a) | |
| SApplicative (Either e) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: Either e (a ~> b)) (t2 :: Either e a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # 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) # (%*>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| 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) # (%>>) :: forall a b (t1 :: Either e a) (t2 :: Either e b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| Generic1 (Either a :: Type -> Type) | Since: base-4.6.0.0 |
| IsoHKD (Either a :: Type -> Type) (b :: Type) | |
| (CanCastTo l1 l2, CanCastTo r1 r2) => CanCastTo (Either l1 r1 :: Type) (Either l2 r2 :: Type) | |
| (Eq a, Eq b) => Eq (Either a b) | Since: base-2.1 |
| (Data a, Data b) => Data (Either a b) | Since: base-4.0.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Either a b -> c (Either a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Either a b) # toConstr :: Either a b -> Constr # dataTypeOf :: Either a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Either a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Either a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Either a b -> Either a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Either a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Either a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Either a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Either a b -> m (Either a b) # | |
| (Ord a, Ord b) => Ord (Either a b) | Since: base-2.1 |
| (Read a, Read b) => Read (Either a b) | Since: base-3.0 |
| (Show a, Show b) => Show (Either a b) | Since: base-3.0 |
| Generic (Either a b) | Since: base-4.6.0.0 |
| Semigroup (Either a b) | Since: base-4.9.0.0 |
| (Lift a, Lift b) => Lift (Either a b) | |
| (Hashable a, Hashable b) => Hashable (Either a b) | |
Defined in Data.Hashable.Class | |
| (NFData a, NFData b) => NFData (Either a b) | |
Defined in Control.DeepSeq | |
| (IsoValue l, IsoValue r) => IsoValue (Either l r) | |
| PolyTypeHasDocC '[l, r] => TypeHasDoc (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Either l r) :: FieldDescriptions # Methods typeDocName :: Proxy (Either l r) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Either l r) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Either l r) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Either l r) # typeDocMichelsonRep :: TypeDocMichelsonRep (Either l r) # | |
| (TypeError (DisallowInstance "Either") :: Constraint) => Container (Either a b) | |
Defined in Universum.Container.Class Methods toList :: Either a b -> [Element (Either a b)] # foldr :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldl :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # foldl' :: (b0 -> Element (Either a b) -> b0) -> b0 -> Either a b -> b0 # elem :: Element (Either a b) -> Either a b -> Bool # maximum :: Either a b -> Element (Either a b) # minimum :: Either a b -> Element (Either a b) # foldMap :: Monoid m => (Element (Either a b) -> m) -> Either a b -> m # fold :: Either a b -> Element (Either a b) # foldr' :: (Element (Either a b) -> b0 -> b0) -> b0 -> Either a b -> b0 # foldr1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # foldl1 :: (Element (Either a b) -> Element (Either a b) -> Element (Either a b)) -> Either a b -> Element (Either a b) # notElem :: Element (Either a b) -> Either a b -> Bool # all :: (Element (Either a b) -> Bool) -> Either a b -> Bool # any :: (Element (Either a b) -> Bool) -> Either a b -> Bool # find :: (Element (Either a b) -> Bool) -> Either a b -> Maybe (Element (Either a b)) # | |
| 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) # sShow_ :: forall (t :: Either a b). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Either a b]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup (Either a b) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup (Either a b) | |
| POrd (Either a b) | |
| (SOrd a, SOrd b) => SOrd (Either a b) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Either a b) (t2 :: Either a b). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq b) => SEq (Either a b) | |
| PEq (Either a b) | |
| (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 | |
| SingI (RightsSym0 :: TyFun [Either a b] [b] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing RightsSym0 # | |
| SingI (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (LeftsSym0 :: TyFun [Either a b] [a] -> Type) | |
Defined in Data.Singletons.Prelude.Either | |
| SingI (IsRightSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsRightSym0 # | |
| SingI (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing IsLeftSym0 # | |
| SingI (RightSym0 :: TyFun b (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SingI (LeftSym0 :: TyFun a (Either a b) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SuppressUnusedWarnings (RightsSym0 :: TyFun [Either a6989586621680725238 b6989586621680725239] [b6989586621680725239] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (PartitionEithersSym0 :: TyFun [Either a6989586621680725236 b6989586621680725237] ([a6989586621680725236], [b6989586621680725237]) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftsSym0 :: TyFun [Either a6989586621680725240 b6989586621680725241] [a6989586621680725240] -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsRightSym0 :: TyFun (Either a6989586621680725232 b6989586621680725233) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IsLeftSym0 :: TyFun (Either a6989586621680725234 b6989586621680725235) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680024475Sym0 :: TyFun a6989586621679962808 (Either e6989586621680023557 a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RightSym0 :: TyFun b6989586621679091039 (Either a6989586621679091038 b6989586621679091039) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LeftSym0 :: TyFun a6989586621679091038 (Either a6989586621679091038 b6989586621679091039) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680187944ASym0 :: TyFun k1 (Either a6989586621679091038 k1) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| (a ~ a', b ~ b') => Each (Either a a') (Either b b') a b | Since: microlens-0.4.11 |
| SingI (Either_Sym0 :: TyFun (a ~> c) ((b ~> c) ~> (Either a b ~> c)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing Either_Sym0 # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a6989586621679091038 b6989586621679091039) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Either_Sym1 d b :: TyFun (b ~> c) (Either a b ~> c) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym1 d b) # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024485Sym1 a6989586621680024483 :: TyFun (Either e6989586621680023557 a6989586621679962809) (Either e6989586621680023557 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024288Sym1 a6989586621680024286 a6989586621680023545 b6989586621679962806 :: TyFun (Either a6989586621680023545 b6989586621679962806) (Either a6989586621680023545 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024267Sym1 a6989586621680024265 a6989586621680023545 :: TyFun (Either a6989586621680023545 a6989586621679962803) (Either a6989586621680023545 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024585Sym1 a6989586621680024583 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) (Either e6989586621680023574 b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Either_Sym2 d1 d2 :: TyFun (Either a b) c -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods sing :: Sing (Either_Sym2 d1 d2) # | |
| SuppressUnusedWarnings (Traverse_6989586621680995098Sym1 a6989586621680995096 a6989586621680994521 :: TyFun (Either a6989586621680994521 a6989586621680988964) (f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Either_Sym2 a6989586621680723795 a6989586621680723794 :: TyFun (Either a6989586621680723758 b6989586621680723760) c6989586621680723759 -> Type) | |
Defined in Data.Singletons.Prelude.Either Methods suppressUnusedWarnings :: () # | |
| (Functor f, Functor g) => Functor (Lift Either f g) | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Either a a0) | |
| type Traverse (a2 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a3 :: Either a1 a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a2 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a3 :: Either a1 a6989586621680988964) = Apply (Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a1 a6989586621680988964 ~> f6989586621680988963 (Either a1 b6989586621680988965)) -> Type) a2) a3 | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Either e a0) (arg3 :: Either e b0) | |
| type FoldMap (a2 :: a6989586621680742384 ~> k2) (a3 :: Either a1 a6989586621680742384) | |
| type Fmap (a2 :: a6989586621679962803 ~> b6989586621679962804) (a3 :: Either a1 a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
| type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Either a a0) | |
| type Foldr (a2 :: a6989586621680742385 ~> (k2 ~> k2)) (a3 :: k2) (a4 :: Either a1 a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Elem (arg1 :: a0) (arg2 :: Either a a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Either a a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Either a a0) | |
| type (a2 :: k1) <$ (a3 :: Either a1 b6989586621679962806) | |
| type Apply (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595788 :: Nat) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595791Sym0 :: TyFun Nat (Either a6989586621679091038 b6989586621679091039 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595788 :: Nat) = ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type | |
| type Apply (Pure_6989586621680024475Sym0 :: TyFun a (Either e6989586621680023557 a) -> Type) (a6989586621680024474 :: a) | |
| type Apply (LeftSym0 :: TyFun a (Either a b6989586621679091039) -> Type) (t6989586621679707106 :: a) | |
| type Apply (RightSym0 :: TyFun b (Either a6989586621679091038 b) -> Type) (t6989586621679707108 :: b) | |
| type Apply (Let6989586621680187944ASym0 :: TyFun k1 (Either a6989586621679091038 k1) -> Type) (wild_69895866216801875286989586621680187943 :: k1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) (a6989586621680024286 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024288Sym0 :: TyFun a6989586621679962805 (Either a6989586621680023545 b6989586621679962806 ~> Either a6989586621680023545 a6989586621679962805) -> Type) (a6989586621680024286 :: a6989586621679962805) = TFHelper_6989586621680024288Sym1 a6989586621680024286 a6989586621680023545 b6989586621679962806 :: TyFun (Either a6989586621680023545 b6989586621679962806) (Either a6989586621680023545 a6989586621679962805) -> Type | |
| type Failure (Either a) | |
Defined in Basement.Monad | |
| type Product (arg0 :: Either a a0) | |
| type Sum (arg0 :: Either a a0) | |
| type Minimum (arg0 :: Either a a0) | |
| type Maximum (arg0 :: Either a a0) | |
| type Length (a2 :: Either a1 a6989586621680742397) | |
| type Null (a2 :: Either a1 a6989586621680742396) | |
| type ToList (arg0 :: Either a a0) | |
| type Fold (arg0 :: Either a m0) | |
| type Sequence (arg0 :: Either a (m0 a0)) | |
| type SequenceA (arg0 :: Either a (f0 a0)) | |
| type (arg1 :: Either e a0) <* (arg2 :: Either e b0) | |
| type (arg1 :: Either e a0) *> (arg2 :: Either e b0) | |
| type (a1 :: Either e (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Either e a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Either e a6989586621679962809) = Apply (Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e (a6989586621679962809 ~> b6989586621679962810)) (Either e a6989586621679962809 ~> Either e b6989586621679962810) -> Type) a1) a2 | |
| type (arg1 :: Either e a0) >> (arg2 :: Either e b0) | |
| type (a1 :: Either e a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Either e b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: Either e a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Either e b6989586621679962833) = Apply (Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e a6989586621679962832) ((a6989586621679962832 ~> Either e b6989586621679962833) ~> Either e b6989586621679962833) -> Type) a1) a2 | |
| 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 HKD (Either a :: Type -> Type) (b :: Type) | |
| type Apply (RightsSym0 :: TyFun [Either a b] [b] -> Type) (a6989586621680725507 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (LeftsSym0 :: TyFun [Either a b] [a] -> Type) (a6989586621680725512 :: [Either a b]) | |
| type Apply (PartitionEithersSym0 :: TyFun [Either a b] ([a], [b]) -> Type) (a6989586621680725487 :: [Either a b]) | |
Defined in Data.Singletons.Prelude.Either | |
| 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 ToT (Either l r) | |
Defined in Michelson.Typed.Haskell.Value | |
| type TypeDocFieldDescriptions (Either l r) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Element (Either a b) | |
Defined in Universum.Container.Class | |
| type Demote (Either a b) | |
| type Show_ (arg0 :: Either a b) | |
| type Sconcat (arg0 :: 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) (a6989586621680725481 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (IsLeftSym0 :: TyFun (Either a b) Bool -> Type) (a6989586621680725483 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Compare_6989586621679803285Sym1 a6989586621679803283 :: TyFun (Either a b) Ordering -> Type) (a6989586621679803284 :: Either a b) | |
| type Apply (Either_Sym2 a6989586621680723795 a6989586621680723794 :: TyFun (Either a b) c -> Type) (a6989586621680723796 :: Either a b) | |
Defined in Data.Singletons.Prelude.Either | |
| type Apply (Traverse_6989586621680995098Sym1 a6989586621680995096 a2 :: TyFun (Either a2 a1) (f (Either a2 b)) -> Type) (a6989586621680995097 :: Either a2 a1) | |
| type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) | |
Defined in Data.Singletons.Prelude.Ord type Apply (Compare_6989586621679803285Sym0 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Either a6989586621679091038 b6989586621679091039 ~> Ordering) -> Type) (a6989586621679803283 :: Either a6989586621679091038 b6989586621679091039) = Compare_6989586621679803285Sym1 a6989586621679803283 | |
| type Apply (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) (a6989586621680595789 :: Either a6989586621679091038 b6989586621679091039) | |
Defined in Data.Singletons.Prelude.Show type Apply (ShowsPrec_6989586621680595791Sym1 a6989586621680595788 a6989586621679091038 b6989586621679091039 :: TyFun (Either a6989586621679091038 b6989586621679091039) (Symbol ~> Symbol) -> Type) (a6989586621680595789 :: Either a6989586621679091038 b6989586621679091039) = ShowsPrec_6989586621680595791Sym2 a6989586621680595788 a6989586621680595789 | |
| type Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) (a6989586621680024483 :: Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024485Sym0 :: TyFun (Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) (Either e6989586621680023557 a6989586621679962809 ~> Either e6989586621680023557 b6989586621679962810) -> Type) (a6989586621680024483 :: Either e6989586621680023557 (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680024485Sym1 a6989586621680024483 | |
| type Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) (a6989586621680024583 :: Either e6989586621680023574 a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024585Sym0 :: TyFun (Either e6989586621680023574 a6989586621679962832) ((a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) ~> Either e6989586621680023574 b6989586621679962833) -> Type) (a6989586621680024583 :: Either e6989586621680023574 a6989586621679962832) = TFHelper_6989586621680024585Sym1 a6989586621680024583 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Either e6989586621680023574 b6989586621679962833) (Either e6989586621680023574 b6989586621679962833) -> Type | |
| type Apply (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) (a6989586621680024265 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Fmap_6989586621680024267Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Either a6989586621680023545 a6989586621679962803 ~> Either a6989586621680023545 b6989586621679962804) -> Type) (a6989586621680024265 :: a6989586621679962803 ~> b6989586621679962804) = Fmap_6989586621680024267Sym1 a6989586621680024265 a6989586621680023545 :: TyFun (Either a6989586621680023545 a6989586621679962803) (Either a6989586621680023545 b6989586621679962804) -> Type | |
| type Apply (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) (a6989586621680723794 :: a6989586621680723758 ~> c6989586621680723759) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym0 :: TyFun (a6989586621680723758 ~> c6989586621680723759) ((b6989586621680723760 ~> c6989586621680723759) ~> (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759)) -> Type) (a6989586621680723794 :: a6989586621680723758 ~> c6989586621680723759) = Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type | |
| type Apply (Fmap_6989586621680024267Sym1 a6989586621680024265 a2 :: TyFun (Either a2 a1) (Either a2 b) -> Type) (a6989586621680024266 :: Either a2 a1) | |
| type Apply (TFHelper_6989586621680024288Sym1 a6989586621680024286 a2 b :: TyFun (Either a2 b) (Either a2 a1) -> Type) (a6989586621680024287 :: Either a2 b) | |
| type Apply (TFHelper_6989586621680024485Sym1 a6989586621680024483 :: TyFun (Either e a) (Either e b) -> Type) (a6989586621680024484 :: Either e a) | |
| type Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) (a6989586621680995096 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995098Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Either a6989586621680994521 a6989586621680988964 ~> f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type) (a6989586621680995096 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995098Sym1 a6989586621680995096 a6989586621680994521 :: TyFun (Either a6989586621680994521 a6989586621680988964) (f6989586621680988963 (Either a6989586621680994521 b6989586621680988965)) -> Type | |
| type Apply (TFHelper_6989586621680024585Sym1 a6989586621680024583 b :: TyFun (a ~> Either e b) (Either e b) -> Type) (a6989586621680024584 :: a ~> Either e b) | |
| type Apply (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) (a6989586621680723795 :: b6989586621680723760 ~> c6989586621680723759) | |
Defined in Data.Singletons.Prelude.Either type Apply (Either_Sym1 a6989586621680723794 b6989586621680723760 :: TyFun (b6989586621680723760 ~> c6989586621680723759) (Either a6989586621680723758 b6989586621680723760 ~> c6989586621680723759) -> Type) (a6989586621680723795 :: b6989586621680723760 ~> c6989586621680723759) = Either_Sym2 a6989586621680723794 a6989586621680723795 | |
| 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) | |
data Constraint #
The kind of constraints, like Show a
type family CmpNat (a :: Nat) (b :: Nat) :: Ordering where ... #
Comparison of type-level naturals, as a function.
Since: base-4.7.0.0
class a ~R# b => Coercible (a :: k) (b :: k) #
Coercible is a two-parameter class that has instances for types a and b if
the compiler can infer that they have the same representation. This class
does not have regular instances; instead they are created on-the-fly during
type-checking. Trying to manually declare an instance of Coercible
is an error.
Nevertheless one can pretend that the following three kinds of instances exist. First, as a trivial base-case:
instance Coercible a a
Furthermore, for every type constructor there is
an instance that allows to coerce under the type constructor. For
example, let D be a prototypical type constructor (data or
newtype) with three type arguments, which have roles nominal,
representational resp. phantom. Then there is an instance of
the form
instance Coercible b b' => Coercible (D a b c) (D a b' c')
Note that the nominal type arguments are equal, the
representational type arguments can differ, but need to have a
Coercible instance themself, and the phantom type arguments can be
changed arbitrarily.
The third kind of instance exists for every newtype NT = MkNT T and
comes in two variants, namely
instance Coercible a T => Coercible a NT
instance Coercible T b => Coercible NT b
This instance is only usable if the constructor MkNT is in scope.
If, as a library author of a type constructor like Set a, you
want to prevent a user of your module to write
coerce :: Set T -> Set NT,
you need to set the role of Set's type parameter to nominal,
by writing
type role Set nominal
For more details about this feature, please refer to Safe Coercions by Joachim Breitner, Richard A. Eisenberg, Simon Peyton Jones and Stephanie Weirich.
Since: ghc-prim-4.7.0.0
CallStacks are a lightweight method of obtaining a
partial call-stack at any point in the program.
A function can request its call-site with the HasCallStack constraint.
For example, we can define
putStrLnWithCallStack :: HasCallStack => String -> IO ()
as a variant of putStrLn that will get its call-site and print it,
along with the string given as argument. We can access the
call-stack inside putStrLnWithCallStack with callStack.
putStrLnWithCallStack :: HasCallStack => String -> IO () putStrLnWithCallStack msg = do putStrLn msg putStrLn (prettyCallStack callStack)
Thus, if we call putStrLnWithCallStack we will get a formatted call-stack
alongside our string.
>>>putStrLnWithCallStack "hello"hello CallStack (from HasCallStack): putStrLnWithCallStack, called at <interactive>:2:1 in interactive:Ghci1
GHC solves HasCallStack constraints in three steps:
- If there is a
CallStackin scope -- i.e. the enclosing function has aHasCallStackconstraint -- GHC will append the new call-site to the existingCallStack. - If there is no
CallStackin scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer aHasCallStackconstraint for the enclosing definition (subject to the monomorphism restriction). - If there is no
CallStackin scope and the enclosing definition has an explicit type signature, GHC will solve theHasCallStackconstraint for the singletonCallStackcontaining just the current call-site.
CallStacks do not interact with the RTS and do not require compilation
with -prof. On the other hand, as they are built up explicitly via the
HasCallStack constraints, they will generally not contain as much
information as the simulated call-stacks maintained by the RTS.
A CallStack is a [(String, SrcLoc)]. The String is the name of
function that was called, the SrcLoc is the call-site. The list is
ordered with the most recently called function at the head.
NOTE: The intrepid user may notice that HasCallStack is just an
alias for an implicit parameter ?callStack :: CallStack. This is an
implementation detail and should not be considered part of the
CallStack API, we may decide to change the implementation in the
future.
Since: base-4.8.1.0
either :: (a -> c) -> (b -> c) -> Either a b -> c #
Case analysis for the Either type.
If the value is Left aa;
if it is Right bb.
Examples
We create two values of type Either String IntLeft constructor and another using the Right constructor. Then
we apply "either" the length function (if we have a String)
or the "times-two" function (if we have an Int):
>>>let s = Left "foo" :: Either String Int>>>let n = Right 3 :: Either String Int>>>either length (*2) s3>>>either length (*2) n6
class Monad m => MonadReader r (m :: Type -> Type) | m -> r where #
See examples in Control.Monad.Reader.
Note, the partially applied function type (->) r is a simple reader monad.
See the instance declaration below.
Methods
Retrieves the monad environment.
Arguments
| :: (r -> r) | The function to modify the environment. |
| -> m a |
|
| -> m a |
Executes a computation in a modified environment.
Arguments
| :: (r -> a) | The selector function to apply to the environment. |
| -> m a |
Retrieves a function of the current environment.
Instances
class Monad m => MonadState s (m :: Type -> Type) | m -> s where #
Minimal definition is either both of get and put or just state
Methods
Replace the state inside the monad.
state :: (s -> (a, s)) -> m a #
Embed a simple state action into the monad.
Instances
| (Functor m, MonadState s m) => MonadState s (Free m) | |
| MonadState s m => MonadState s (MaybeT m) | |
| MonadState s m => MonadState s (ListT m) | |
| Monad m => MonadState s (StateT s m) | |
| (Functor f, MonadState s m) => MonadState s (FreeT f m) | |
| (Monoid w, MonadState s m) => MonadState s (WriterT w m) | |
| (Monoid w, MonadState s m) => MonadState s (WriterT w m) | |
| Monad m => MonadState s (StateT s m) | |
| MonadState s m => MonadState s (ReaderT r m) | |
| MonadState s m => MonadState s (IdentityT m) | |
| MonadState s m => MonadState s (ExceptT e m) | Since: mtl-2.2 |
| (Error e, MonadState s m) => MonadState s (ErrorT e m) | |
| MonadState s m => MonadState s (ContT r m) | |
| (Monad m, Monoid w) => MonadState s (RWST r w s m) | |
| (Monad m, Monoid w) => MonadState s (RWST r w s m) | |
data ByteString #
A space-efficient representation of a Word8 vector, supporting many
efficient operations.
A ByteString contains 8-bit bytes, or by using the operations from
Data.ByteString.Char8 it can be interpreted as containing 8-bit
characters.
Instances
(<$>) :: Functor f => (a -> b) -> f a -> f b infixl 4 #
An infix synonym for fmap.
The name of this operator is an allusion to $.
Note the similarities between their types:
($) :: (a -> b) -> a -> b (<$>) :: Functor f => (a -> b) -> f a -> f b
Whereas $ is function application, <$> is function
application lifted over a Functor.
Examples
Convert from a Maybe IntMaybe
Stringshow:
>>>show <$> NothingNothing>>>show <$> Just 3Just "3"
Convert from an Either Int IntEither IntString using show:
>>>show <$> Left 17Left 17>>>show <$> Right 17Right "17"
Double each element of a list:
>>>(*2) <$> [1,2,3][2,4,6]
Apply even to the second element of a pair:
>>>even <$> (2,2)(2,True)
The class of types that can be converted to a hash value.
Minimal implementation: hashWithSalt.
Minimal complete definition
Nothing
Methods
hashWithSalt :: Int -> a -> Int infixl 0 #
Return a hash value for the argument, using the given salt.
The general contract of hashWithSalt is:
- If two values are equal according to the
==method, then applying thehashWithSaltmethod on each of the two values must produce the same integer result if the same salt is used in each case. - It is not required that if two values are unequal
according to the
==method, then applying thehashWithSaltmethod on each of the two values must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal values may improve the performance of hashing-based data structures. - This method can be used to compute different hash values for
the same input by providing a different salt in each
application of the method. This implies that any instance
that defines
hashWithSaltmust make use of the salt in its implementation.
Instances
A space efficient, packed, unboxed Unicode text type.
Instances
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]
A map from keys to values. A map cannot contain duplicate keys; each key can map to at most one value.
Instances
| Eq2 HashMap | |
| Ord2 HashMap | |
Defined in Data.HashMap.Base | |
| Show2 HashMap | |
| Hashable2 HashMap | |
Defined in Data.HashMap.Base | |
| Functor (HashMap k) | |
| Foldable (HashMap k) | |
Defined in Data.HashMap.Base Methods fold :: Monoid m => HashMap k m -> m # foldMap :: Monoid m => (a -> m) -> HashMap k a -> m # foldMap' :: Monoid m => (a -> m) -> HashMap k a -> m # foldr :: (a -> b -> b) -> b -> HashMap k a -> b # foldr' :: (a -> b -> b) -> b -> HashMap k a -> b # foldl :: (b -> a -> b) -> b -> HashMap k a -> b # foldl' :: (b -> a -> b) -> b -> HashMap k a -> b # foldr1 :: (a -> a -> a) -> HashMap k a -> a # foldl1 :: (a -> a -> a) -> HashMap k a -> a # toList :: HashMap k a -> [a] # length :: HashMap k a -> Int # elem :: Eq a => a -> HashMap k a -> Bool # maximum :: Ord a => HashMap k a -> a # minimum :: Ord a => HashMap k a -> a # | |
| Traversable (HashMap k) | |
Defined in Data.HashMap.Base | |
| Eq k => Eq1 (HashMap k) | |
| Ord k => Ord1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k, Read k) => Read1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| Show k => Show1 (HashMap k) | |
| Hashable k => Hashable1 (HashMap k) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k) => IsList (HashMap k v) | |
| (Eq k, Eq v) => Eq (HashMap k v) | |
| (Data k, Data v, Eq k, Hashable k) => Data (HashMap k v) | |
Defined in Data.HashMap.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashMap k v -> c (HashMap k v) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashMap k v) # toConstr :: HashMap k v -> Constr # dataTypeOf :: HashMap k v -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashMap k v)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashMap k v)) # gmapT :: (forall b. Data b => b -> b) -> HashMap k v -> HashMap k v # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashMap k v -> r # gmapQ :: (forall d. Data d => d -> u) -> HashMap k v -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashMap k v -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashMap k v -> m (HashMap k v) # | |
| (Ord k, Ord v) => Ord (HashMap k v) | The order is total. Note: Because the hash is not guaranteed to be stable across library
versions, OSes, or architectures, neither is an actual order of elements in
|
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k, Read k, Read e) => Read (HashMap k e) | |
| (Show k, Show v) => Show (HashMap k v) | |
| (Eq k, Hashable k) => Semigroup (HashMap k v) | |
| (Eq k, Hashable k) => Monoid (HashMap k v) | |
| (Hashable k, Hashable v) => Hashable (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (NFData k, NFData v) => NFData (HashMap k v) | |
Defined in Data.HashMap.Base | |
| (Eq k, Hashable k) => Ixed (HashMap k a) | |
Defined in Control.Lens.At | |
| (Eq k, Hashable k) => At (HashMap k a) | |
| (Hashable k, Eq k) => Wrapped (HashMap k a) | |
| Hashable k => One (HashMap k v) | |
| Container (HashMap k v) | |
Defined in Universum.Container.Class Methods toList :: HashMap k v -> [Element (HashMap k v)] # foldr :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b # foldl :: (b -> Element (HashMap k v) -> b) -> b -> HashMap k v -> b # foldl' :: (b -> Element (HashMap k v) -> b) -> b -> HashMap k v -> b # length :: HashMap k v -> Int # elem :: Element (HashMap k v) -> HashMap k v -> Bool # maximum :: HashMap k v -> Element (HashMap k v) # minimum :: HashMap k v -> Element (HashMap k v) # foldMap :: Monoid m => (Element (HashMap k v) -> m) -> HashMap k v -> m # fold :: HashMap k v -> Element (HashMap k v) # foldr' :: (Element (HashMap k v) -> b -> b) -> b -> HashMap k v -> b # foldr1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # foldl1 :: (Element (HashMap k v) -> Element (HashMap k v) -> Element (HashMap k v)) -> HashMap k v -> Element (HashMap k v) # notElem :: Element (HashMap k v) -> HashMap k v -> Bool # all :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # any :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Bool # find :: (Element (HashMap k v) -> Bool) -> HashMap k v -> Maybe (Element (HashMap k v)) # | |
| ToPairs (HashMap k v) | |
| (t ~ HashMap k' a', Hashable k, Eq k) => Rewrapped (HashMap k a) t | Use |
Defined in Control.Lens.Wrapped | |
| type Item (HashMap k v) | |
Defined in Data.HashMap.Base | |
| type Index (HashMap k a) | |
Defined in Control.Lens.At | |
| type IxValue (HashMap k a) | |
Defined in Control.Lens.At | |
| type Unwrapped (HashMap k a) | |
Defined in Control.Lens.Wrapped | |
| type OneItem (HashMap k v) | |
Defined in Universum.Container.Class | |
| type Element (HashMap k v) | |
Defined in Universum.Container.Class | |
| type Val (HashMap k v) | |
Defined in Universum.Container.Class | |
| type Key (HashMap k v) | |
Defined in Universum.Container.Class | |
A Map from keys k to values a.
The Semigroup operation for Map is union, which prefers
values from the left operand. If m1 maps a key k to a value
a1, and m2 maps the same key to a different value a2, then
their union m1 <> m2 maps k to a1.
Instances
| Eq2 Map | Since: containers-0.5.9 |
| Ord2 Map | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
| Show2 Map | Since: containers-0.5.9 |
| MapInstrs Map | |
Defined in Lorentz.Macro Methods mapUpdate :: forall k v (s :: [Type]). NiceComparable k => (k ': (Maybe v ': (Map k v ': s))) :-> (Map k v ': s) mapInsert :: forall k v (s :: [Type]). NiceComparable k => (k ': (v ': (Map k v ': s))) :-> (Map k v ': s) # mapInsertNew :: forall k e v (s :: [Type]). (NiceComparable k, KnownValue e) => (forall (s0 :: [Type]). (k ': s0) :-> (e ': s0)) -> (k ': (v ': (Map k v ': s))) :-> (Map k v ': s) # deleteMap :: forall k v (s :: [Type]). (NiceComparable k, KnownValue v) => (k ': (Map k v ': s)) :-> (Map k v ': s) # | |
| Functor (Map k) | |
| Foldable (Map k) | Folds in order of increasing key. |
Defined in Data.Map.Internal Methods fold :: Monoid m => Map k m -> m # foldMap :: Monoid m => (a -> m) -> Map k a -> m # foldMap' :: Monoid m => (a -> m) -> Map k a -> m # foldr :: (a -> b -> b) -> b -> Map k a -> b # foldr' :: (a -> b -> b) -> b -> Map k a -> b # foldl :: (b -> a -> b) -> b -> Map k a -> b # foldl' :: (b -> a -> b) -> b -> Map k a -> b # foldr1 :: (a -> a -> a) -> Map k a -> a # foldl1 :: (a -> a -> a) -> Map k a -> a # elem :: Eq a => a -> Map k a -> Bool # maximum :: Ord a => Map k a -> a # minimum :: Ord a => Map k a -> a # | |
| Traversable (Map k) | Traverses in order of increasing key. |
| Eq k => Eq1 (Map k) | Since: containers-0.5.9 |
| Ord k => Ord1 (Map k) | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
| (Ord k, Read k) => Read1 (Map k) | Since: containers-0.5.9 |
Defined in Data.Map.Internal | |
| Show k => Show1 (Map k) | Since: containers-0.5.9 |
| (CanCastTo k1 k2, CanCastTo v1 v2) => CanCastTo (Map k1 v1 :: Type) (Map k2 v2 :: Type) | |
| Ord k => IsList (Map k v) | Since: containers-0.5.6.2 |
| (Eq k, Eq a) => Eq (Map k a) | |
| (Data k, Data a, Ord k) => Data (Map k a) | |
Defined in Data.Map.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Map k a -> c (Map k a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Map k a) # toConstr :: Map k a -> Constr # dataTypeOf :: Map k a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Map k a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Map k a)) # gmapT :: (forall b. Data b => b -> b) -> Map k a -> Map k a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Map k a -> r # gmapQ :: (forall d. Data d => d -> u) -> Map k a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Map k a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Map k a -> m (Map k a) # | |
| (Ord k, Ord v) => Ord (Map k v) | |
| (Ord k, Read k, Read e) => Read (Map k e) | |
| (Show k, Show a) => Show (Map k a) | |
| Ord k => Semigroup (Map k v) | |
| Ord k => Monoid (Map k v) | |
| (NFData k, NFData a) => NFData (Map k a) | |
Defined in Data.Map.Internal | |
| Ord k => Ixed (Map k a) | |
Defined in Control.Lens.At | |
| Ord k => At (Map k a) | |
| Ord k => Wrapped (Map k a) | |
| NiceComparable k => MemOpHs (Map k v) | |
Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Map k v) # | |
| NiceComparable k => MapOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => IterOpHs (Map k v) | |
Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Map k v) # | |
| SizeOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => UpdOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable k => GetOpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| (HasAnnotation k, HasAnnotation v) => HasAnnotation (Map k v) | |
Defined in Lorentz.Annotation Methods getAnnotation :: Notes (ToT (Map k v)) # | |
| (Comparable (ToT k), Ord k, IsoValue k, IsoValue v) => IsoValue (Map k v) | |
| (PolyCTypeHasDocC '[k], PolyTypeHasDocC '[v], Ord k) => TypeHasDoc (Map k v) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Map k v) :: FieldDescriptions # Methods typeDocName :: Proxy (Map k v) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Map k v) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Map k v) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Map k v) # typeDocMichelsonRep :: TypeDocMichelsonRep (Map k v) # | |
| One (Map k v) | |
| Container (Map k v) | |
Defined in Universum.Container.Class Methods toList :: Map k v -> [Element (Map k v)] # foldr :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldl :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # foldl' :: (b -> Element (Map k v) -> b) -> b -> Map k v -> b # elem :: Element (Map k v) -> Map k v -> Bool # maximum :: Map k v -> Element (Map k v) # minimum :: Map k v -> Element (Map k v) # foldMap :: Monoid m => (Element (Map k v) -> m) -> Map k v -> m # fold :: Map k v -> Element (Map k v) # foldr' :: (Element (Map k v) -> b -> b) -> b -> Map k v -> b # foldr1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # foldl1 :: (Element (Map k v) -> Element (Map k v) -> Element (Map k v)) -> Map k v -> Element (Map k v) # notElem :: Element (Map k v) -> Map k v -> Bool # all :: (Element (Map k v) -> Bool) -> Map k v -> Bool # any :: (Element (Map k v) -> Bool) -> Map k v -> Bool # find :: (Element (Map k v) -> Bool) -> Map k v -> Maybe (Element (Map k v)) # | |
| ToPairs (Map k v) | |
| (t ~ Map k' a', Ord k) => Rewrapped (Map k a) t | Use |
Defined in Control.Lens.Wrapped | |
| (key ~ key', value ~ value', NiceComparable key) => StoreHasSubmap (Map key' value') name key value |
|
Defined in Lorentz.StoreClass Methods storeSubmapOps :: StoreSubmapOps (Map key' value') name key value # | |
| type Item (Map k v) | |
Defined in Data.Map.Internal | |
| type Index (Map k a) | |
Defined in Control.Lens.At | |
| type IxValue (Map k a) | |
Defined in Control.Lens.At | |
| type Unwrapped (Map k a) | |
Defined in Control.Lens.Wrapped | |
| type MemOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type MapOpResHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type MapOpInpHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type IterOpElHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpParamsHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type GetOpValHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type GetOpKeyHs (Map k v) | |
Defined in Lorentz.Polymorphic | |
| type ToT (Map k v) | |
| type TypeDocFieldDescriptions (Map k v) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type OneItem (Map k v) | |
Defined in Universum.Container.Class | |
| type Element (Map k v) | |
Defined in Universum.Container.Class | |
| type Val (Map k v) | |
Defined in Universum.Container.Class | |
| type Key (Map k v) | |
Defined in Universum.Container.Class | |
Haskell defines operations to read and write characters from and to files,
represented by values of type Handle. Each value of this type is a
handle: a record used by the Haskell run-time system to manage I/O
with file system objects. A handle has at least the following properties:
- whether it manages input or output or both;
- whether it is open, closed or semi-closed;
- whether the object is seekable;
- whether buffering is disabled, or enabled on a line or block basis;
- a buffer (whose length may be zero).
Most handles will also have a current I/O position indicating where the next
input or output operation will occur. A handle is readable if it
manages only input or both input and output; likewise, it is writable if
it manages only output or both input and output. A handle is open when
first allocated.
Once it is closed it can no longer be used for either input or output,
though an implementation cannot re-use its storage while references
remain to it. Handles are in the Show and Eq classes. The string
produced by showing a handle is system dependent; it should include
enough information to identify the handle for debugging. A handle is
equal according to == only to itself; no attempt
is made to compare the internal state of different handles for equality.
Instances
class Applicative f => Alternative (f :: Type -> Type) where #
A monoid on applicative functors.
If defined, some and many should be the least solutions
of the equations:
Instances
class (Alternative m, Monad m) => MonadPlus (m :: Type -> Type) where #
Monads that also support choice and failure.
Minimal complete definition
Nothing
Methods
The identity of mplus. It should also satisfy the equations
mzero >>= f = mzero v >> mzero = mzero
The default definition is
mzero = empty
An associative operation. The default definition is
mplus = (<|>)
Instances
newtype Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) infixr 9 #
Right-to-left composition of functors. The composition of applicative functors is always applicative, but the composition of monads is not always a monad.
Constructors
| Compose infixr 9 | |
Fields
| |
Instances
| Functor f => Generic1 (Compose f g :: k -> Type) | Since: base-4.9.0.0 |
| Unbox (f (g a)) => Vector Vector (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Compose f g a) -> m (Vector (Compose f g a)) # basicUnsafeThaw :: PrimMonad m => Vector (Compose f g a) -> m (Mutable Vector (PrimState m) (Compose f g a)) # basicLength :: Vector (Compose f g a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Compose f g a) -> Vector (Compose f g a) # basicUnsafeIndexM :: Monad m => Vector (Compose f g a) -> Int -> m (Compose f g a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Compose f g a) -> Vector (Compose f g a) -> m () # elemseq :: Vector (Compose f g a) -> Compose f g a -> b -> b # | |
| Unbox (f (g a)) => MVector MVector (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Compose f g a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Compose f g a) -> MVector s (Compose f g a) # basicOverlaps :: MVector s (Compose f g a) -> MVector s (Compose f g a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Compose f g a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Compose f g a -> m (MVector (PrimState m) (Compose f g a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> Int -> m (Compose f g a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> Int -> Compose f g a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> Compose f g a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> MVector (PrimState m) (Compose f g a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> MVector (PrimState m) (Compose f g a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Compose f g a) -> Int -> m (MVector (PrimState m) (Compose f g a)) # | |
| Sieve (ReifiedIndexedFold i) (Compose [] ((,) i)) | |
Defined in Control.Lens.Reified Methods sieve :: ReifiedIndexedFold i a b -> a -> Compose [] ((,) i) b # | |
| (Sieve p f, Sieve q g) => Sieve (Procompose p q) (Compose g f) | |
Defined in Data.Profunctor.Composition Methods sieve :: Procompose p q a b -> a -> Compose g f b # | |
| (Cosieve p f, Cosieve q g) => Cosieve (Procompose p q) (Compose f g) | |
Defined in Data.Profunctor.Composition Methods cosieve :: Procompose p q a b -> Compose f g a -> b # | |
| (Functor f, Functor g) => Functor (Compose f g) | Since: base-4.9.0.0 |
| (Applicative f, Applicative g) => Applicative (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Foldable f, Foldable g) => Foldable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |
| (Traversable f, Traversable g) => Traversable (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Representable f, Representable g) => Representable (Compose f g) | |
| (Alternative f, Applicative g) => Alternative (Compose f g) | Since: base-4.9.0.0 |
| (Eq1 f, Eq1 g) => Eq1 (Compose f g) | Since: base-4.9.0.0 |
| (Ord1 f, Ord1 g) => Ord1 (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose | |
| (Read1 f, Read1 g) => Read1 (Compose f g) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Compose f g a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Compose f g a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Compose f g a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Compose f g a] # | |
| (Show1 f, Show1 g) => Show1 (Compose f g) | Since: base-4.9.0.0 |
| (NFData1 f, NFData1 g) => NFData1 (Compose f g) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| (Hashable1 f, Hashable1 g) => Hashable1 (Compose f g) | |
Defined in Data.Hashable.Class | |
| (Eq1 f, Eq1 g, Eq a) => Eq (Compose f g a) | Since: base-4.9.0.0 |
| (Typeable a, Typeable f, Typeable g, Typeable k1, Typeable k2, Data (f (g a))) => Data (Compose f g a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> Compose f g a -> c (Compose f g a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Compose f g a) # toConstr :: Compose f g a -> Constr # dataTypeOf :: Compose f g a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Compose f g a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Compose f g a)) # gmapT :: (forall b. Data b => b -> b) -> Compose f g a -> Compose f g a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r # gmapQ :: (forall d. Data d => d -> u) -> Compose f g a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Compose f g a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) # | |
| (Ord1 f, Ord1 g, Ord a) => Ord (Compose f g a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |
| (Read1 f, Read1 g, Read a) => Read (Compose f g a) | Since: base-4.9.0.0 |
| (Show1 f, Show1 g, Show a) => Show (Compose f g a) | Since: base-4.9.0.0 |
| Generic (Compose f g a) | Since: base-4.9.0.0 |
| (Hashable1 f, Hashable1 g, Hashable a) => Hashable (Compose f g a) | In general, |
Defined in Data.Hashable.Class | |
| (NFData1 f, NFData1 g, NFData a) => NFData (Compose f g a) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Unbox (f (g a)) => Unbox (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Compose f g a) | |
| t ~ Compose f' g' a' => Rewrapped (Compose f g a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep1 (Compose f g :: k -> Type) | |
Defined in Data.Functor.Compose | |
| newtype MVector s (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep (Compose f g) | |
Defined in Data.Functor.Rep | |
| type Rep (Compose f g a) | |
Defined in Data.Functor.Compose | |
| newtype Vector (Compose f g a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Compose f g a) | |
Defined in Control.Lens.Wrapped | |
Since Void values logically don't exist, this witnesses the
logical reasoning tool of "ex falso quodlibet".
>>>let x :: Either Void Int; x = Right 5>>>:{case x of Right r -> r Left l -> absurd l :} 5
Since: base-4.8.0.0
Uninhabited data type
Since: base-4.8.0.0
Instances
| Eq Void | Since: base-4.8.0.0 |
| Data Void | Since: base-4.8.0.0 |
Defined in Data.Void Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Void -> c Void # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Void # dataTypeOf :: Void -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Void) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Void) # gmapT :: (forall b. Data b => b -> b) -> Void -> Void # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Void -> r # gmapQ :: (forall d. Data d => d -> u) -> Void -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Void -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Void -> m Void # | |
| Ord Void | Since: base-4.8.0.0 |
| Read Void | Reading a Since: base-4.8.0.0 |
| Show Void | Since: base-4.8.0.0 |
| Ix Void | Since: base-4.8.0.0 |
| Generic Void | Since: base-4.8.0.0 |
| Semigroup Void | Since: base-4.9.0.0 |
| Lift Void | Since: template-haskell-2.15.0.0 |
| Hashable Void | |
Defined in Data.Hashable.Class | |
| Exception Void | Since: base-4.8.0.0 |
Defined in Data.Void Methods toException :: Void -> SomeException # fromException :: SomeException -> Maybe Void # displayException :: Void -> String # | |
| NFData Void | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| ShowErrorComponent Void | |
Defined in Text.Megaparsec.Error | |
| PShow Void | |
| SShow Void | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: Void) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: Void). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [Void]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup Void | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup Void | |
| POrd Void | |
| SOrd Void | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Void) (t2 :: Void). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq Void | |
| PEq Void | |
| TestCoercion SVoid | |
Defined in Data.Singletons.Prelude.Instances | |
| TestEquality SVoid | |
Defined in Data.Singletons.Prelude.Instances | |
| SuppressUnusedWarnings ShowsPrec_6989586621680595913Sym0 | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621679803332Sym0 | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803332Sym1 a6989586621679803330 :: TyFun Void Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595913Sym1 a6989586621680595910 :: TyFun Void (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| type Rep Void | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Demote Void | |
Defined in Data.Singletons.Prelude.Instances | |
| type Show_ (arg0 :: Void) | |
| type Sconcat (arg0 :: NonEmpty Void) | |
| type ShowList (arg1 :: [Void]) arg2 | |
| type (a1 :: Void) <> (a2 :: Void) | |
| type Min (arg1 :: Void) (arg2 :: Void) | |
| type Max (arg1 :: Void) (arg2 :: Void) | |
| type (arg1 :: Void) >= (arg2 :: Void) | |
| type (arg1 :: Void) > (arg2 :: Void) | |
| type (arg1 :: Void) <= (arg2 :: Void) | |
| type (arg1 :: Void) < (arg2 :: Void) | |
| type Compare (a1 :: Void) (a2 :: Void) | |
| type (x :: Void) /= (y :: Void) | |
| type (a :: Void) == (b :: Void) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a1 (a2 :: Void) a3 | |
| type Apply (Compare_6989586621679803332Sym1 a6989586621679803330 :: TyFun Void Ordering -> Type) (a6989586621679803331 :: Void) | |
| type Apply ShowsPrec_6989586621680595913Sym0 (a6989586621680595910 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply Compare_6989586621679803332Sym0 (a6989586621679803330 :: Void) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (ShowsPrec_6989586621680595913Sym1 a6989586621680595910 :: TyFun Void (Symbol ~> Symbol) -> Type) (a6989586621680595911 :: Void) | |
mtimesDefault :: (Integral b, Monoid a) => b -> a -> a #
data WrappedMonoid m #
Provide a Semigroup for an arbitrary Monoid.
NOTE: This is not needed anymore since Semigroup became a superclass of
Monoid in base-4.11 and this newtype be deprecated at some point in the future.
Instances
| NFData1 WrappedMonoid | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> WrappedMonoid a -> () # | |
| Unbox a => Vector Vector (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (WrappedMonoid a) -> m (Vector (WrappedMonoid a)) # basicUnsafeThaw :: PrimMonad m => Vector (WrappedMonoid a) -> m (Mutable Vector (PrimState m) (WrappedMonoid a)) # basicLength :: Vector (WrappedMonoid a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (WrappedMonoid a) -> Vector (WrappedMonoid a) # basicUnsafeIndexM :: Monad m => Vector (WrappedMonoid a) -> Int -> m (WrappedMonoid a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (WrappedMonoid a) -> Vector (WrappedMonoid a) -> m () # elemseq :: Vector (WrappedMonoid a) -> WrappedMonoid a -> b -> b # | |
| Unbox a => MVector MVector (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (WrappedMonoid a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (WrappedMonoid a) -> MVector s (WrappedMonoid a) # basicOverlaps :: MVector s (WrappedMonoid a) -> MVector s (WrappedMonoid a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (WrappedMonoid a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> WrappedMonoid a -> m (MVector (PrimState m) (WrappedMonoid a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> Int -> m (WrappedMonoid a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> Int -> WrappedMonoid a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> WrappedMonoid a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> MVector (PrimState m) (WrappedMonoid a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> MVector (PrimState m) (WrappedMonoid a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (WrappedMonoid a) -> Int -> m (MVector (PrimState m) (WrappedMonoid a)) # | |
| Bounded m => Bounded (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Enum a => Enum (WrappedMonoid a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods succ :: WrappedMonoid a -> WrappedMonoid a # pred :: WrappedMonoid a -> WrappedMonoid a # toEnum :: Int -> WrappedMonoid a # fromEnum :: WrappedMonoid a -> Int # enumFrom :: WrappedMonoid a -> [WrappedMonoid a] # enumFromThen :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromTo :: WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # enumFromThenTo :: WrappedMonoid a -> WrappedMonoid a -> WrappedMonoid a -> [WrappedMonoid a] # | |
| Eq m => Eq (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (==) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (/=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # | |
| Data m => Data (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> WrappedMonoid m -> c (WrappedMonoid m) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (WrappedMonoid m) # toConstr :: WrappedMonoid m -> Constr # dataTypeOf :: WrappedMonoid m -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (WrappedMonoid m)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (WrappedMonoid m)) # gmapT :: (forall b. Data b => b -> b) -> WrappedMonoid m -> WrappedMonoid m # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> WrappedMonoid m -> r # gmapQ :: (forall d. Data d => d -> u) -> WrappedMonoid m -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> WrappedMonoid m -> u # gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> WrappedMonoid m -> m0 (WrappedMonoid m) # | |
| Ord m => Ord (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods compare :: WrappedMonoid m -> WrappedMonoid m -> Ordering # (<) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (<=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>) :: WrappedMonoid m -> WrappedMonoid m -> Bool # (>=) :: WrappedMonoid m -> WrappedMonoid m -> Bool # max :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # min :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # | |
| Read m => Read (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods readsPrec :: Int -> ReadS (WrappedMonoid m) # readList :: ReadS [WrappedMonoid m] # readPrec :: ReadPrec (WrappedMonoid m) # readListPrec :: ReadPrec [WrappedMonoid m] # | |
| Show m => Show (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods showsPrec :: Int -> WrappedMonoid m -> ShowS # show :: WrappedMonoid m -> String # showList :: [WrappedMonoid m] -> ShowS # | |
| Generic (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Associated Types type Rep (WrappedMonoid m) :: Type -> Type # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) x # to :: Rep (WrappedMonoid m) x -> WrappedMonoid m # | |
| Monoid m => Semigroup (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods (<>) :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # sconcat :: NonEmpty (WrappedMonoid m) -> WrappedMonoid m # stimes :: Integral b => b -> WrappedMonoid m -> WrappedMonoid m # | |
| Monoid m => Monoid (WrappedMonoid m) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods mempty :: WrappedMonoid m # mappend :: WrappedMonoid m -> WrappedMonoid m -> WrappedMonoid m # mconcat :: [WrappedMonoid m] -> WrappedMonoid m # | |
| Hashable a => Hashable (WrappedMonoid a) | |
Defined in Data.Hashable.Class | |
| NFData m => NFData (WrappedMonoid m) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq Methods rnf :: WrappedMonoid m -> () # | |
| Unbox a => Unbox (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (WrappedMonoid a) | |
Defined in Control.Lens.Wrapped Associated Types type Unwrapped (WrappedMonoid a) # Methods _Wrapped' :: Iso' (WrappedMonoid a) (Unwrapped (WrappedMonoid a)) # | |
| Generic1 WrappedMonoid | Since: base-4.9.0.0 |
Defined in Data.Semigroup Associated Types type Rep1 WrappedMonoid :: k -> Type # Methods from1 :: forall (a :: k). WrappedMonoid a -> Rep1 WrappedMonoid a # to1 :: forall (a :: k). Rep1 WrappedMonoid a -> WrappedMonoid a # | |
| t ~ WrappedMonoid b => Rewrapped (WrappedMonoid a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide m => TestCoercion (SWrappedMonoid :: WrappedMonoid m -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods testCoercion :: forall (a :: k) (b :: k). SWrappedMonoid a -> SWrappedMonoid b -> Maybe (Coercion a b) # | |
| SDecide m => TestEquality (SWrappedMonoid :: WrappedMonoid m -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods testEquality :: forall (a :: k) (b :: k). SWrappedMonoid a -> SWrappedMonoid b -> Maybe (a :~: b) # | |
| SingI (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing WrapMonoidSym0 # | |
| SuppressUnusedWarnings (ToEnum_6989586621681108989Sym0 :: TyFun Nat (WrappedMonoid a6989586621681107190) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091494Sym0 :: TyFun Nat (WrappedMonoid m6989586621679090730 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (WrapMonoidSym0 :: TyFun m6989586621679090730 (WrappedMonoid m6989586621679090730) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m6989586621679090730) m6989586621679090730 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681108962Sym0 :: TyFun (WrappedMonoid m6989586621681107186) (WrappedMonoid m6989586621681107186 ~> WrappedMonoid m6989586621681107186) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621681108975Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621681108982Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621681108998Sym0 :: TyFun (WrappedMonoid a6989586621681107190) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621681109006Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681109019Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190])) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m6989586621679090730) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681108962Sym1 a6989586621681108960 :: TyFun (WrappedMonoid m6989586621681107186) (WrappedMonoid m6989586621681107186) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091494Sym1 a6989586621681091491 m6989586621679090730 :: TyFun (WrappedMonoid m6989586621679090730) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621681109006Sym1 a6989586621681109004 :: TyFun (WrappedMonoid a6989586621681107190) [WrappedMonoid a6989586621681107190] -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681109019Sym1 a6989586621681109016 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621681109019Sym2 a6989586621681109017 a6989586621681109016 :: TyFun (WrappedMonoid a6989586621681107190) [WrappedMonoid a6989586621681107190] -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| newtype MVector s (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (ToEnum_6989586621681108989Sym0 :: TyFun Nat (WrappedMonoid a6989586621681107190) -> Type) (a6989586621681108988 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ToEnum_6989586621681108989Sym0 :: TyFun Nat (WrappedMonoid a6989586621681107190) -> Type) (a6989586621681108988 :: Nat) = ToEnum_6989586621681108989 a6989586621681108988 :: WrappedMonoid a6989586621681107190 | |
| type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680197193 :: m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (WrapMonoidSym0 :: TyFun m (WrappedMonoid m) -> Type) (t6989586621680197193 :: m) = 'WrapMonoid t6989586621680197193 | |
| type Apply (ShowsPrec_6989586621681091494Sym0 :: TyFun Nat (WrappedMonoid m6989586621679090730 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091491 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681091494Sym0 :: TyFun Nat (WrappedMonoid m6989586621679090730 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091491 :: Nat) = ShowsPrec_6989586621681091494Sym1 a6989586621681091491 m6989586621679090730 :: TyFun (WrappedMonoid m6989586621679090730) (Symbol ~> Symbol) -> Type | |
| type Rep (WrappedMonoid m) | |
Defined in Data.Semigroup type Rep (WrappedMonoid m) = D1 ('MetaData "WrappedMonoid" "Data.Semigroup" "base" 'True) (C1 ('MetaCons "WrapMonoid" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonoid") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 m))) | |
| newtype Vector (WrappedMonoid a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (WrappedMonoid a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Demote (WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Rep1 WrappedMonoid | |
Defined in Data.Semigroup type Rep1 WrappedMonoid = D1 ('MetaData "WrappedMonoid" "Data.Semigroup" "base" 'True) (C1 ('MetaCons "WrapMonoid" 'PrefixI 'True) (S1 ('MetaSel ('Just "unwrapMonoid") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1)) | |
| type Mconcat (arg0 :: [WrappedMonoid m]) | |
Defined in Data.Singletons.Prelude.Semigroup type Mconcat (arg0 :: [WrappedMonoid m]) = Apply (Mconcat_6989586621680631303Sym0 :: TyFun [WrappedMonoid m] (WrappedMonoid m) -> Type) arg0 | |
| type Show_ (arg0 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Show_ (arg0 :: WrappedMonoid m) = Apply (Show__6989586621680577846Sym0 :: TyFun (WrappedMonoid m) Symbol -> Type) arg0 | |
| type Sconcat (arg0 :: NonEmpty (WrappedMonoid m)) | |
Defined in Data.Singletons.Prelude.Semigroup type Sconcat (arg0 :: NonEmpty (WrappedMonoid m)) = Apply (Sconcat_6989586621680187691Sym0 :: TyFun (NonEmpty (WrappedMonoid m)) (WrappedMonoid m) -> Type) arg0 | |
| type FromEnum (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type FromEnum (a2 :: WrappedMonoid a1) = Apply (FromEnum_6989586621681108998Sym0 :: TyFun (WrappedMonoid a1) Nat -> Type) a2 | |
| type ToEnum a2 | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Pred (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type Pred (a2 :: WrappedMonoid a1) = Apply (Pred_6989586621681108982Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type Succ (a2 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type Succ (a2 :: WrappedMonoid a1) = Apply (Succ_6989586621681108975Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1) -> Type) a2 | |
| type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Mappend (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Mappend_6989586621680631288Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type ShowList (arg1 :: [WrappedMonoid m]) arg2 | |
Defined in Data.Singletons.Prelude.Semigroup type ShowList (arg1 :: [WrappedMonoid m]) arg2 = Apply (Apply (ShowList_6989586621680577854Sym0 :: TyFun [WrappedMonoid m] (Symbol ~> Symbol) -> Type) arg1) arg2 | |
| type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type (a1 :: WrappedMonoid m) <> (a2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621681108962Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) a1) a2 | |
| type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type EnumFromTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) = Apply (Apply (EnumFromTo_6989586621681109006Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> [WrappedMonoid a1]) -> Type) a2) a3 | |
| type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Min (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Min_6989586621679792614Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Max (arg1 :: WrappedMonoid m) (arg2 :: WrappedMonoid m) = Apply (Apply (Max_6989586621679792596Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> WrappedMonoid m) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) >= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679792578Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) > (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679792560Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) <= (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679792542Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (arg1 :: WrappedMonoid m) < (arg2 :: WrappedMonoid m) = Apply (Apply (TFHelper_6989586621679792524Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Bool) -> Type) arg1) arg2 | |
| type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Compare (a1 :: WrappedMonoid m) (a2 :: WrappedMonoid m) = Apply (Apply (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m) (WrappedMonoid m ~> Ordering) -> Type) a1) a2 | |
| type (x :: WrappedMonoid m) /= (y :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (a :: WrappedMonoid m) == (b :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a1 (a2 :: WrappedMonoid m) a3 | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) | |
Defined in Data.Singletons.Prelude.Semigroup type EnumFromThenTo (a2 :: WrappedMonoid a1) (a3 :: WrappedMonoid a1) (a4 :: WrappedMonoid a1) = Apply (Apply (Apply (EnumFromThenTo_6989586621681109019Sym0 :: TyFun (WrappedMonoid a1) (WrappedMonoid a1 ~> (WrappedMonoid a1 ~> [WrappedMonoid a1])) -> Type) a2) a3) a4 | |
| type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680197190 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (UnwrapMonoidSym0 :: TyFun (WrappedMonoid m) m -> Type) (a6989586621680197190 :: WrappedMonoid m) = UnwrapMonoid a6989586621680197190 | |
| type Apply (FromEnum_6989586621681108998Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681108997 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (FromEnum_6989586621681108998Sym0 :: TyFun (WrappedMonoid a) Nat -> Type) (a6989586621681108997 :: WrappedMonoid a) = FromEnum_6989586621681108998 a6989586621681108997 | |
| type Apply (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680206786 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680206787Sym1 a6989586621680206785 :: TyFun (WrappedMonoid m) Ordering -> Type) (a6989586621680206786 :: WrappedMonoid m) = Compare_6989586621680206787 a6989586621680206785 a6989586621680206786 | |
| type Apply (Succ_6989586621681108975Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681108974 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Succ_6989586621681108975Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681108974 :: WrappedMonoid a) = Succ_6989586621681108975 a6989586621681108974 | |
| type Apply (Pred_6989586621681108982Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681108981 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Pred_6989586621681108982Sym0 :: TyFun (WrappedMonoid a) (WrappedMonoid a) -> Type) (a6989586621681108981 :: WrappedMonoid a) = Pred_6989586621681108982 a6989586621681108981 | |
| type Apply (TFHelper_6989586621681108962Sym1 a6989586621681108960 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681108961 :: WrappedMonoid m) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681108962Sym1 a6989586621681108960 :: TyFun (WrappedMonoid m) (WrappedMonoid m) -> Type) (a6989586621681108961 :: WrappedMonoid m) = TFHelper_6989586621681108962 a6989586621681108960 a6989586621681108961 | |
| type Apply (EnumFromTo_6989586621681109006Sym1 a6989586621681109004 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681109005 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681109006Sym1 a6989586621681109004 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681109005 :: WrappedMonoid a) = EnumFromTo_6989586621681109006 a6989586621681109004 a6989586621681109005 | |
| type Apply (EnumFromThenTo_6989586621681109019Sym2 a6989586621681109017 a6989586621681109016 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681109018 :: WrappedMonoid a) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681109019Sym2 a6989586621681109017 a6989586621681109016 :: TyFun (WrappedMonoid a) [WrappedMonoid a] -> Type) (a6989586621681109018 :: WrappedMonoid a) = EnumFromThenTo_6989586621681109019 a6989586621681109017 a6989586621681109016 a6989586621681109018 | |
| type Apply (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) (a6989586621680206785 :: WrappedMonoid m6989586621679090730) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (Compare_6989586621680206787Sym0 :: TyFun (WrappedMonoid m6989586621679090730) (WrappedMonoid m6989586621679090730 ~> Ordering) -> Type) (a6989586621680206785 :: WrappedMonoid m6989586621679090730) = Compare_6989586621680206787Sym1 a6989586621680206785 | |
| type Apply (TFHelper_6989586621681108962Sym0 :: TyFun (WrappedMonoid m6989586621681107186) (WrappedMonoid m6989586621681107186 ~> WrappedMonoid m6989586621681107186) -> Type) (a6989586621681108960 :: WrappedMonoid m6989586621681107186) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681108962Sym0 :: TyFun (WrappedMonoid m6989586621681107186) (WrappedMonoid m6989586621681107186 ~> WrappedMonoid m6989586621681107186) -> Type) (a6989586621681108960 :: WrappedMonoid m6989586621681107186) = TFHelper_6989586621681108962Sym1 a6989586621681108960 | |
| type Apply (EnumFromTo_6989586621681109006Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) (a6989586621681109004 :: WrappedMonoid a6989586621681107190) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromTo_6989586621681109006Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) (a6989586621681109004 :: WrappedMonoid a6989586621681107190) = EnumFromTo_6989586621681109006Sym1 a6989586621681109004 | |
| type Apply (EnumFromThenTo_6989586621681109019Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190])) -> Type) (a6989586621681109016 :: WrappedMonoid a6989586621681107190) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681109019Sym0 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190])) -> Type) (a6989586621681109016 :: WrappedMonoid a6989586621681107190) = EnumFromThenTo_6989586621681109019Sym1 a6989586621681109016 | |
| type Apply (ShowsPrec_6989586621681091494Sym1 a6989586621681091491 m6989586621679090730 :: TyFun (WrappedMonoid m6989586621679090730) (Symbol ~> Symbol) -> Type) (a6989586621681091492 :: WrappedMonoid m6989586621679090730) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (ShowsPrec_6989586621681091494Sym1 a6989586621681091491 m6989586621679090730 :: TyFun (WrappedMonoid m6989586621679090730) (Symbol ~> Symbol) -> Type) (a6989586621681091492 :: WrappedMonoid m6989586621679090730) = ShowsPrec_6989586621681091494Sym2 a6989586621681091491 a6989586621681091492 | |
| type Apply (EnumFromThenTo_6989586621681109019Sym1 a6989586621681109016 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) (a6989586621681109017 :: WrappedMonoid a6989586621681107190) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (EnumFromThenTo_6989586621681109019Sym1 a6989586621681109016 :: TyFun (WrappedMonoid a6989586621681107190) (WrappedMonoid a6989586621681107190 ~> [WrappedMonoid a6989586621681107190]) -> Type) (a6989586621681109017 :: WrappedMonoid a6989586621681107190) = EnumFromThenTo_6989586621681109019Sym2 a6989586621681109016 a6989586621681109017 | |
Option is effectively Maybe with a better instance of
Monoid, built off of an underlying Semigroup instead of an
underlying Monoid.
Ideally, this type would not exist at all and we would just fix the
Monoid instance of Maybe.
In GHC 8.4 and higher, the Monoid instance for Maybe has been
corrected to lift a Semigroup instance instead of a Monoid
instance. Consequently, this type is no longer useful. It will be
marked deprecated in GHC 8.8 and removed in GHC 8.10.
Instances
| Monad Option | Since: base-4.9.0.0 |
| Functor Option | Since: base-4.9.0.0 |
| MonadFix Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Applicative Option | Since: base-4.9.0.0 |
| Foldable Option | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods fold :: Monoid m => Option m -> m # foldMap :: Monoid m => (a -> m) -> Option a -> m # foldMap' :: Monoid m => (a -> m) -> Option a -> m # foldr :: (a -> b -> b) -> b -> Option a -> b # foldr' :: (a -> b -> b) -> b -> Option a -> b # foldl :: (b -> a -> b) -> b -> Option a -> b # foldl' :: (b -> a -> b) -> b -> Option a -> b # foldr1 :: (a -> a -> a) -> Option a -> a # foldl1 :: (a -> a -> a) -> Option a -> a # elem :: Eq a => a -> Option a -> Bool # maximum :: Ord a => Option a -> a # minimum :: Ord a => Option a -> a # | |
| Traversable Option | Since: base-4.9.0.0 |
| Alternative Option | Since: base-4.9.0.0 |
| MonadPlus Option | Since: base-4.9.0.0 |
| NFData1 Option | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (Option a) | Since: base-4.9.0.0 |
| Data a => Data (Option a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Option a -> c (Option a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Option a) # toConstr :: Option a -> Constr # dataTypeOf :: Option a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Option a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Option a)) # gmapT :: (forall b. Data b => b -> b) -> Option a -> Option a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Option a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Option a -> r # gmapQ :: (forall d. Data d => d -> u) -> Option a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Option a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Option a -> m (Option a) # | |
| Ord a => Ord (Option a) | Since: base-4.9.0.0 |
Defined in Data.Semigroup | |
| Read a => Read (Option a) | Since: base-4.9.0.0 |
| Show a => Show (Option a) | Since: base-4.9.0.0 |
| Generic (Option a) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Option a) | Since: base-4.9.0.0 |
| Semigroup a => Monoid (Option a) | Since: base-4.9.0.0 |
| Hashable a => Hashable (Option a) | |
Defined in Data.Hashable.Class | |
| NFData a => NFData (Option a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Wrapped (Option a) | |
| Generic1 Option | Since: base-4.9.0.0 |
| t ~ Option b => Rewrapped (Option a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide (Maybe a) => TestCoercion (SOption :: Option a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide (Maybe a) => TestEquality (SOption :: Option a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing OptionSym0 # | |
| SuppressUnusedWarnings (OptionSym0 :: TyFun (Maybe a6989586621679060063) (Option a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091190Sym0 :: TyFun Nat (Option a6989586621679060063 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621681109050Sym0 :: TyFun a6989586621679962808 (Option a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621681109045ASym0 :: TyFun a6989586621679060063 (Option a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetOptionSym0 :: TyFun (Option a6989586621679060063) (Maybe a6989586621679060063) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206583Sym0 :: TyFun (Option a6989586621679060063) (Option a6989586621679060063 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109150Sym0 :: TyFun (Option a6989586621681107210) (Option a6989586621681107210 ~> Option a6989586621681107210) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109037Sym0 :: TyFun (Option a6989586621679962884) (Option a6989586621679962884 ~> Option a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SingI (Option_Sym0 :: TyFun b ((a ~> b) ~> (Option a ~> b)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| SuppressUnusedWarnings (TFHelper_6989586621681109110Sym0 :: TyFun a6989586621679962805 (Option b6989586621679962806 ~> Option a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Option_Sym0 :: TyFun b6989586621681175290 ((a6989586621681175291 ~> b6989586621681175290) ~> (Option a6989586621681175291 ~> b6989586621681175290)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206583Sym1 a6989586621680206581 :: TyFun (Option a6989586621679060063) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109150Sym1 a6989586621681109148 :: TyFun (Option a6989586621681107210) (Option a6989586621681107210) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109134Sym0 :: TyFun (Option a6989586621679962834) (Option b6989586621679962835 ~> Option b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109122Sym0 :: TyFun (Option a6989586621679962832) ((a6989586621679962832 ~> Option b6989586621679962833) ~> Option b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109087Sym0 :: TyFun (Option a6989586621679962814) (Option b6989586621679962815 ~> Option b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109037Sym1 a6989586621681109035 :: TyFun (Option a6989586621679962884) (Option a6989586621679962884) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091190Sym1 a6989586621681091187 a6989586621679060063 :: TyFun (Option a6989586621679060063) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109058Sym0 :: TyFun (Option (a6989586621679962809 ~> b6989586621679962810)) (Option a6989586621679962809 ~> Option b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621681109164Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Option a6989586621680742384 ~> m6989586621680742383) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621681109098Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Option a6989586621679962803 ~> Option b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI (Option_Sym1 d a :: TyFun (a ~> b) (Option a ~> b) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| SuppressUnusedWarnings (TFHelper_6989586621681109134Sym1 a6989586621681109132 b6989586621679962835 :: TyFun (Option b6989586621679962835) (Option b6989586621679962835) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109110Sym1 a6989586621681109108 b6989586621679962806 :: TyFun (Option b6989586621679962806) (Option a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109087Sym1 a6989586621681109085 b6989586621679962815 :: TyFun (Option b6989586621679962815) (Option b6989586621679962815) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109058Sym1 a6989586621681109056 :: TyFun (Option a6989586621679962809) (Option b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621681109164Sym1 a6989586621681109162 :: TyFun (Option a6989586621680742384) m6989586621680742383 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621681109098Sym1 a6989586621681109096 :: TyFun (Option a6989586621679962803) (Option b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621681109176Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Option a6989586621680988964 ~> f6989586621680988963 (Option b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681109122Sym1 a6989586621681109120 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Option b6989586621679962833) (Option b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Option_Sym1 a6989586621681175302 a6989586621681175291 :: TyFun (a6989586621681175291 ~> b6989586621681175290) (Option a6989586621681175291 ~> b6989586621681175290) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621681109071Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Option a6989586621679962811 ~> (Option b6989586621679962812 ~> Option c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| (SingI d1, SingI d2) => SingI (Option_Sym2 d1 d2 :: TyFun (Option a) b -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| SuppressUnusedWarnings (Traverse_6989586621681109176Sym1 a6989586621681109174 :: TyFun (Option a6989586621680988964) (f6989586621680988963 (Option b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Option_Sym2 a6989586621681175303 a6989586621681175302 :: TyFun (Option a6989586621681175291) b6989586621681175290 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621681109071Sym1 a6989586621681109068 :: TyFun (Option a6989586621679962811) (Option b6989586621679962812 ~> Option c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621681109071Sym2 a6989586621681109069 a6989586621681109068 :: TyFun (Option b6989586621679962812) (Option c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| type Empty | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Mzero | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Product (arg0 :: Option a0) | |
| type Sum (arg0 :: Option a0) | |
| type Minimum (arg0 :: Option a0) | |
| type Maximum (arg0 :: Option a0) | |
| type Length (arg0 :: Option a0) | |
| type Null (arg0 :: Option a0) | |
| type ToList (arg0 :: Option a0) | |
| type Fold (arg0 :: Option m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Option (m0 a0)) | |
| type SequenceA (arg0 :: Option (f0 a0)) | |
| type Elem (arg1 :: a0) (arg2 :: Option a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Option a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Option a0) | |
| type (a1 :: Option a6989586621679962884) <|> (a2 :: Option a6989586621679962884) | |
| type Mplus (arg1 :: Option a0) (arg2 :: Option a0) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Option a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Option b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Option a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type (arg1 :: Option a0) <* (arg2 :: Option b0) | |
| type (a1 :: Option a6989586621679962814) *> (a2 :: Option b6989586621679962815) | |
| type (a1 :: Option (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Option a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type (a1 :: Option a6989586621679962834) >> (a2 :: Option b6989586621679962835) | |
| type (a1 :: Option a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Option b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Option a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Option a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Semigroup type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Option a6989586621680988964) = Apply (Apply (Traverse_6989586621681109176Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Option a6989586621680988964 ~> f6989586621680988963 (Option b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Option a0) | |
| type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Option a0) | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Option a0) | |
| type Foldr (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Option a0) | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Option a6989586621679962811) (a3 :: Option b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Semigroup type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Option a6989586621679962811) (a3 :: Option b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621681109071Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Option a6989586621679962811 ~> (Option b6989586621679962812 ~> Option c6989586621679962813)) -> Type) a1) a2) a3 | |
| type Apply (Let6989586621681109045ASym0 :: TyFun a6989586621679060063 (Option a6989586621679060063) -> Type) (wild_69895866216811072446989586621681109044 :: a6989586621679060063) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (Pure_6989586621681109050Sym0 :: TyFun a (Option a) -> Type) (a6989586621681109049 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (ShowsPrec_6989586621681091190Sym0 :: TyFun Nat (Option a6989586621679060063 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091187 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621681109110Sym0 :: TyFun a6989586621679962805 (Option b6989586621679962806 ~> Option a6989586621679962805) -> Type) (a6989586621681109108 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681109110Sym0 :: TyFun a6989586621679962805 (Option b6989586621679962806 ~> Option a6989586621679962805) -> Type) (a6989586621681109108 :: a6989586621679962805) = TFHelper_6989586621681109110Sym1 a6989586621681109108 b6989586621679962806 :: TyFun (Option b6989586621679962806) (Option a6989586621679962805) -> Type | |
| type Apply (Option_Sym0 :: TyFun b6989586621681175290 ((a6989586621681175291 ~> b6989586621681175290) ~> (Option a6989586621681175291 ~> b6989586621681175290)) -> Type) (a6989586621681175302 :: b6989586621681175290) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Option_Sym0 :: TyFun b6989586621681175290 ((a6989586621681175291 ~> b6989586621681175290) ~> (Option a6989586621681175291 ~> b6989586621681175290)) -> Type) (a6989586621681175302 :: b6989586621681175290) = Option_Sym1 a6989586621681175302 a6989586621681175291 :: TyFun (a6989586621681175291 ~> b6989586621681175290) (Option a6989586621681175291 ~> b6989586621681175290) -> Type | |
| type Rep (Option a) | |
Defined in Data.Semigroup | |
| type Unwrapped (Option a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Demote (Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Rep1 Option | |
Defined in Data.Semigroup | |
| type Mconcat (arg0 :: [Option a]) | |
| type Show_ (arg0 :: Option a) | |
| type Sconcat (arg0 :: NonEmpty (Option a)) | |
| type Mappend (arg1 :: Option a) (arg2 :: Option a) | |
| type ShowList (arg1 :: [Option a]) arg2 | |
| type (a2 :: Option a1) <> (a3 :: Option a1) | |
| type Min (arg1 :: Option a) (arg2 :: Option a) | |
| type Max (arg1 :: Option a) (arg2 :: Option a) | |
| type (arg1 :: Option a) >= (arg2 :: Option a) | |
| type (arg1 :: Option a) > (arg2 :: Option a) | |
| type (arg1 :: Option a) <= (arg2 :: Option a) | |
| type (arg1 :: Option a) < (arg2 :: Option a) | |
| type Compare (a2 :: Option a1) (a3 :: Option a1) | |
| type (x :: Option a) /= (y :: Option a) | |
| type (a2 :: Option a1) == (b :: Option a1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a2 (a3 :: Option a1) a4 | |
| type Apply (Compare_6989586621680206583Sym1 a6989586621680206581 :: TyFun (Option a) Ordering -> Type) (a6989586621680206582 :: Option a) | |
| type Apply (FoldMap_6989586621681109164Sym1 a6989586621681109162 :: TyFun (Option a) m -> Type) (a6989586621681109163 :: Option a) | |
| type Apply (Option_Sym2 a6989586621681175303 a6989586621681175302 :: TyFun (Option a) b -> Type) (a6989586621681175304 :: Option a) | |
| type Apply (OptionSym0 :: TyFun (Maybe a) (Option a) -> Type) (t6989586621680197015 :: Maybe a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (GetOptionSym0 :: TyFun (Option a) (Maybe a) -> Type) (a6989586621680197012 :: Option a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621681109037Sym1 a6989586621681109035 :: TyFun (Option a) (Option a) -> Type) (a6989586621681109036 :: Option a) | |
| type Apply (TFHelper_6989586621681109150Sym1 a6989586621681109148 :: TyFun (Option a) (Option a) -> Type) (a6989586621681109149 :: Option a) | |
| type Apply (TFHelper_6989586621681109058Sym1 a6989586621681109056 :: TyFun (Option a) (Option b) -> Type) (a6989586621681109057 :: Option a) | |
| type Apply (TFHelper_6989586621681109087Sym1 a6989586621681109085 b :: TyFun (Option b) (Option b) -> Type) (a6989586621681109086 :: Option b) | |
| type Apply (Fmap_6989586621681109098Sym1 a6989586621681109096 :: TyFun (Option a) (Option b) -> Type) (a6989586621681109097 :: Option a) | |
| type Apply (TFHelper_6989586621681109110Sym1 a6989586621681109108 b :: TyFun (Option b) (Option a) -> Type) (a6989586621681109109 :: Option b) | |
| type Apply (TFHelper_6989586621681109134Sym1 a6989586621681109132 b :: TyFun (Option b) (Option b) -> Type) (a6989586621681109133 :: Option b) | |
| type Apply (Traverse_6989586621681109176Sym1 a6989586621681109174 :: TyFun (Option a) (f (Option b)) -> Type) (a6989586621681109175 :: Option a) | |
| type Apply (LiftA2_6989586621681109071Sym2 a6989586621681109069 a6989586621681109068 :: TyFun (Option b) (Option c) -> Type) (a6989586621681109070 :: Option b) | |
| type Apply (Compare_6989586621680206583Sym0 :: TyFun (Option a6989586621679060063) (Option a6989586621679060063 ~> Ordering) -> Type) (a6989586621680206581 :: Option a6989586621679060063) | |
| type Apply (TFHelper_6989586621681109037Sym0 :: TyFun (Option a6989586621679962884) (Option a6989586621679962884 ~> Option a6989586621679962884) -> Type) (a6989586621681109035 :: Option a6989586621679962884) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621681109150Sym0 :: TyFun (Option a6989586621681107210) (Option a6989586621681107210 ~> Option a6989586621681107210) -> Type) (a6989586621681109148 :: Option a6989586621681107210) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (ShowsPrec_6989586621681091190Sym1 a6989586621681091187 a6989586621679060063 :: TyFun (Option a6989586621679060063) (Symbol ~> Symbol) -> Type) (a6989586621681091188 :: Option a6989586621679060063) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621681109087Sym0 :: TyFun (Option a6989586621679962814) (Option b6989586621679962815 ~> Option b6989586621679962815) -> Type) (a6989586621681109085 :: Option a6989586621679962814) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681109087Sym0 :: TyFun (Option a6989586621679962814) (Option b6989586621679962815 ~> Option b6989586621679962815) -> Type) (a6989586621681109085 :: Option a6989586621679962814) = TFHelper_6989586621681109087Sym1 a6989586621681109085 b6989586621679962815 :: TyFun (Option b6989586621679962815) (Option b6989586621679962815) -> Type | |
| type Apply (TFHelper_6989586621681109122Sym0 :: TyFun (Option a6989586621679962832) ((a6989586621679962832 ~> Option b6989586621679962833) ~> Option b6989586621679962833) -> Type) (a6989586621681109120 :: Option a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681109122Sym0 :: TyFun (Option a6989586621679962832) ((a6989586621679962832 ~> Option b6989586621679962833) ~> Option b6989586621679962833) -> Type) (a6989586621681109120 :: Option a6989586621679962832) = TFHelper_6989586621681109122Sym1 a6989586621681109120 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Option b6989586621679962833) (Option b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621681109134Sym0 :: TyFun (Option a6989586621679962834) (Option b6989586621679962835 ~> Option b6989586621679962835) -> Type) (a6989586621681109132 :: Option a6989586621679962834) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681109134Sym0 :: TyFun (Option a6989586621679962834) (Option b6989586621679962835 ~> Option b6989586621679962835) -> Type) (a6989586621681109132 :: Option a6989586621679962834) = TFHelper_6989586621681109134Sym1 a6989586621681109132 b6989586621679962835 :: TyFun (Option b6989586621679962835) (Option b6989586621679962835) -> Type | |
| type Apply (TFHelper_6989586621681109058Sym0 :: TyFun (Option (a6989586621679962809 ~> b6989586621679962810)) (Option a6989586621679962809 ~> Option b6989586621679962810) -> Type) (a6989586621681109056 :: Option (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (TFHelper_6989586621681109058Sym0 :: TyFun (Option (a6989586621679962809 ~> b6989586621679962810)) (Option a6989586621679962809 ~> Option b6989586621679962810) -> Type) (a6989586621681109056 :: Option (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621681109058Sym1 a6989586621681109056 | |
| type Apply (LiftA2_6989586621681109071Sym1 a6989586621681109068 :: TyFun (Option a6989586621679962811) (Option b6989586621679962812 ~> Option c6989586621679962813) -> Type) (a6989586621681109069 :: Option a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (LiftA2_6989586621681109071Sym1 a6989586621681109068 :: TyFun (Option a6989586621679962811) (Option b6989586621679962812 ~> Option c6989586621679962813) -> Type) (a6989586621681109069 :: Option a6989586621679962811) = LiftA2_6989586621681109071Sym2 a6989586621681109068 a6989586621681109069 | |
| type Apply (TFHelper_6989586621681109122Sym1 a6989586621681109120 b :: TyFun (a ~> Option b) (Option b) -> Type) (a6989586621681109121 :: a ~> Option b) | |
| type Apply (Fmap_6989586621681109098Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Option a6989586621679962803 ~> Option b6989586621679962804) -> Type) (a6989586621681109096 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (FoldMap_6989586621681109164Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Option a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621681109162 :: a6989586621680742384 ~> m6989586621680742383) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (LiftA2_6989586621681109071Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Option a6989586621679962811 ~> (Option b6989586621679962812 ~> Option c6989586621679962813)) -> Type) (a6989586621681109068 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (LiftA2_6989586621681109071Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Option a6989586621679962811 ~> (Option b6989586621679962812 ~> Option c6989586621679962813)) -> Type) (a6989586621681109068 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621681109071Sym1 a6989586621681109068 | |
| type Apply (Traverse_6989586621681109176Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Option a6989586621680988964 ~> f6989586621680988963 (Option b6989586621680988965)) -> Type) (a6989586621681109174 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Traverse_6989586621681109176Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Option a6989586621680988964 ~> f6989586621680988963 (Option b6989586621680988965)) -> Type) (a6989586621681109174 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621681109176Sym1 a6989586621681109174 | |
| type Apply (Option_Sym1 a6989586621681175302 a6989586621681175291 :: TyFun (a6989586621681175291 ~> b6989586621681175290) (Option a6989586621681175291 ~> b6989586621681175290) -> Type) (a6989586621681175303 :: a6989586621681175291 ~> b6989586621681175290) | |
Defined in Data.Singletons.Prelude.Semigroup type Apply (Option_Sym1 a6989586621681175302 a6989586621681175291 :: TyFun (a6989586621681175291 ~> b6989586621681175290) (Option a6989586621681175291 ~> b6989586621681175290) -> Type) (a6989586621681175303 :: a6989586621681175291 ~> b6989586621681175290) = Option_Sym2 a6989586621681175302 a6989586621681175303 | |
sortWith :: Ord b => (a -> b) -> [a] -> [a] #
The sortWith function sorts a list of elements using the
user supplied function to project something out of each element
class Bifunctor (p :: Type -> Type -> Type) where #
A bifunctor is a type constructor that takes
two type arguments and is a functor in both arguments. That
is, unlike with Functor, a type constructor such as Either
does not need to be partially applied for a Bifunctor
instance, and the methods in this class permit mapping
functions over the Left value or the Right value,
or both at the same time.
Formally, the class Bifunctor represents a bifunctor
from Hask -> Hask.
Intuitively it is a bifunctor where both the first and second arguments are covariant.
You can define a Bifunctor by either defining bimap or by
defining both first and second.
If you supply bimap, you should ensure that:
bimapidid≡id
If you supply first and second, ensure:
firstid≡idsecondid≡id
If you supply both, you should also ensure:
bimapf g ≡firstf.secondg
These ensure by parametricity:
bimap(f.g) (h.i) ≡bimapf h.bimapg ifirst(f.g) ≡firstf.firstgsecond(f.g) ≡secondf.secondg
Since: base-4.8.0.0
Methods
bimap :: (a -> b) -> (c -> d) -> p a c -> p b d #
Map over both arguments at the same time.
bimapf g ≡firstf.secondg
Examples
>>>bimap toUpper (+1) ('j', 3)('J',4)
>>>bimap toUpper (+1) (Left 'j')Left 'J'
>>>bimap toUpper (+1) (Right 3)Right 4
Instances
showStackTrace :: IO (Maybe String) #
Get a string representation of the current execution stack state.
getStackTrace :: IO (Maybe [Location]) #
Get a trace of the current execution stack state.
Returns Nothing if stack trace support isn't available on host machine.
class Monad m => MonadIO (m :: Type -> Type) where #
Monads in which IO computations may be embedded.
Any monad built by applying a sequence of monad transformers to the
IO monad will be an instance of this class.
Instances should satisfy the following laws, which state that liftIO
is a transformer of monads:
Instances
| MonadIO IO | Since: base-4.9.0.0 |
Defined in Control.Monad.IO.Class | |
| MonadIO Q | |
Defined in Language.Haskell.TH.Syntax | |
| MonadIO m => MonadIO (MaybeT m) | |
Defined in Control.Monad.Trans.Maybe | |
| MonadIO m => MonadIO (IdentityT m) | |
Defined in Control.Monad.Trans.Identity | |
| MonadIO m => MonadIO (ExceptT e m) | |
Defined in Control.Monad.Trans.Except | |
| (Functor f, MonadIO m) => MonadIO (FreeT f m) | |
Defined in Control.Monad.Trans.Free | |
| (Error e, MonadIO m) => MonadIO (ErrorT e m) | |
Defined in Control.Monad.Trans.Error | |
| MonadIO m => MonadIO (StateT s m) | |
Defined in Control.Monad.Trans.State.Strict | |
| MonadIO m => MonadIO (ReaderT r m) | |
Defined in Control.Monad.Trans.Reader | |
replicateM_ :: Applicative m => Int -> m a -> m () #
Like replicateM, but discards the result.
replicateM :: Applicative m => Int -> m a -> m [a] #
replicateM n actn times,
gathering the results.
foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m () #
Like foldM, but discards the result.
foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b #
The foldM function is analogous to foldl, except that its result is
encapsulated in a monad. Note that foldM works from left-to-right over
the list arguments. This could be an issue where ( and the `folded
function' are not commutative.>>)
foldM f a1 [x1, x2, ..., xm] == do a2 <- f a1 x1 a3 <- f a2 x2 ... f am xm
If right-to-left evaluation is required, the input list should be reversed.
zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m () #
zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c] #
mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c]) #
The mapAndUnzipM function maps its first argument over a list, returning
the result as a pair of lists. This function is mainly used with complicated
data structures or a state monad.
forever :: Applicative f => f a -> f b #
Repeat an action indefinitely.
Examples
A common use of forever is to process input from network sockets,
Handles, and channels
(e.g. MVar and
Chan).
For example, here is how we might implement an echo
server, using
forever both to listen for client connections on a network socket
and to echo client input on client connection handles:
echoServer :: Socket -> IO () echoServer socket =forever$ do client <- accept socketforkFinally(echo client) (\_ -> hClose client) where echo :: Handle -> IO () echo client =forever$ hGetLine client >>= hPutStrLn client
(>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c infixr 1 #
Left-to-right composition of Kleisli arrows.
filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a] #
This generalizes the list-based filter function.
foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m #
fmapDefault :: Traversable t => (a -> b) -> t a -> t b #
This function may be used as a value for fmap in a Functor
instance, provided that traverse is defined. (Using
fmapDefault with a Traversable instance defined only by
sequenceA will result in infinite recursion.)
fmapDefaultf ≡runIdentity.traverse(Identity. f)
mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c) #
mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c) #
forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m (t b) #
optional :: Alternative f => f a -> f (Maybe a) #
One or none.
Lists, but with an Applicative functor based on zipping.
Constructors
| ZipList | |
Fields
| |
Instances
| Functor ZipList | Since: base-2.1 |
| 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 |
| Foldable ZipList | Since: base-4.9.0.0 |
Defined in Control.Applicative Methods fold :: Monoid m => ZipList m -> m # foldMap :: Monoid m => (a -> m) -> ZipList a -> m # foldMap' :: Monoid m => (a -> m) -> ZipList a -> m # foldr :: (a -> b -> b) -> b -> ZipList a -> b # foldr' :: (a -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> a -> b) -> b -> ZipList a -> b # foldl' :: (b -> a -> b) -> b -> ZipList a -> b # foldr1 :: (a -> a -> a) -> ZipList a -> a # foldl1 :: (a -> a -> a) -> ZipList a -> a # elem :: Eq a => a -> ZipList a -> Bool # maximum :: Ord a => ZipList a -> a # minimum :: Ord a => ZipList a -> a # | |
| Traversable ZipList | Since: base-4.9.0.0 |
| Alternative ZipList | Since: base-4.11.0.0 |
| NFData1 ZipList | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq a => Eq (ZipList a) | Since: base-4.7.0.0 |
| Ord a => Ord (ZipList a) | Since: base-4.7.0.0 |
| Read a => Read (ZipList a) | Since: base-4.7.0.0 |
| Show a => Show (ZipList a) | Since: base-4.7.0.0 |
| Generic (ZipList a) | Since: base-4.7.0.0 |
| NFData a => NFData (ZipList a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Wrapped (ZipList a) | |
| Container (ZipList a) | |
Defined in Universum.Container.Class Methods toList :: ZipList a -> [Element (ZipList a)] # foldr :: (Element (ZipList a) -> b -> b) -> b -> ZipList a -> b # foldl :: (b -> Element (ZipList a) -> b) -> b -> ZipList a -> b # foldl' :: (b -> Element (ZipList a) -> b) -> b -> ZipList a -> b # elem :: Element (ZipList a) -> ZipList a -> Bool # maximum :: ZipList a -> Element (ZipList a) # minimum :: ZipList a -> Element (ZipList a) # foldMap :: Monoid m => (Element (ZipList a) -> m) -> ZipList a -> m # fold :: ZipList a -> Element (ZipList a) # foldr' :: (Element (ZipList a) -> b -> b) -> b -> ZipList a -> b # foldr1 :: (Element (ZipList a) -> Element (ZipList a) -> Element (ZipList a)) -> ZipList a -> Element (ZipList a) # foldl1 :: (Element (ZipList a) -> Element (ZipList a) -> Element (ZipList a)) -> ZipList a -> Element (ZipList a) # notElem :: Element (ZipList a) -> ZipList a -> Bool # all :: (Element (ZipList a) -> Bool) -> ZipList a -> Bool # any :: (Element (ZipList a) -> Bool) -> ZipList a -> Bool # find :: (Element (ZipList a) -> Bool) -> ZipList a -> Maybe (Element (ZipList a)) # | |
| Generic1 ZipList | Since: base-4.7.0.0 |
| t ~ ZipList b => Rewrapped (ZipList a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep (ZipList a) | |
Defined in Control.Applicative | |
| type Item (ZipList a) | |
Defined in Data.Orphans | |
| type Unwrapped (ZipList a) | |
Defined in Control.Lens.Wrapped | |
| type Element (ZipList a) | |
Defined in Universum.Container.Class | |
| type Rep1 ZipList | |
Defined in Control.Applicative | |
(&&&) :: Arrow a => a b c -> a b c' -> a b (c, c') infixr 3 #
Fanout: send the input to both argument arrows and combine their output.
The default definition may be overridden with a more efficient version if desired.
Identity functor and monad. (a non-strict monad)
Since: base-4.8.0.0
Constructors
| Identity | |
Fields
| |
Instances
| Monad Identity | Since: base-4.8.0.0 |
| Functor Identity | Since: base-4.8.0.0 |
| MonadFix Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Applicative Identity | Since: base-4.8.0.0 |
| Foldable Identity | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity Methods fold :: Monoid m => Identity m -> m # foldMap :: Monoid m => (a -> m) -> Identity a -> m # foldMap' :: Monoid m => (a -> m) -> Identity a -> m # foldr :: (a -> b -> b) -> b -> Identity a -> b # foldr' :: (a -> b -> b) -> b -> Identity a -> b # foldl :: (b -> a -> b) -> b -> Identity a -> b # foldl' :: (b -> a -> b) -> b -> Identity a -> b # foldr1 :: (a -> a -> a) -> Identity a -> a # foldl1 :: (a -> a -> a) -> Identity a -> a # elem :: Eq a => a -> Identity a -> Bool # maximum :: Ord a => Identity a -> a # minimum :: Ord a => Identity a -> a # | |
| Traversable Identity | Since: base-4.9.0.0 |
| Representable Identity | |
| NFData1 Identity | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 Identity | |
Defined in Data.Hashable.Class | |
| KnownNamedFunctor Identity | |
Defined in Util.Named | |
| InjValue Identity | |
Defined in Named.Internal | |
| PTraversable Identity | |
| STraversable Identity | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Identity a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Identity (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Identity a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: Identity (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| Sieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods sieve :: ReifiedGetter a b -> a -> Identity b # | |
| Cosieve ReifiedGetter Identity | |
Defined in Control.Lens.Reified Methods cosieve :: ReifiedGetter a b -> Identity a -> b # | |
| () :=> (Monad Identity) | |
| () :=> (Functor Identity) | |
| Unbox a => Vector Vector (Identity a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> m (Vector (Identity a)) # basicUnsafeThaw :: PrimMonad m => Vector (Identity a) -> m (Mutable Vector (PrimState m) (Identity a)) # basicLength :: Vector (Identity a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Identity a) -> Vector (Identity a) # basicUnsafeIndexM :: Monad m => Vector (Identity a) -> Int -> m (Identity a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Identity a) -> Vector (Identity a) -> m () # | |
| Unbox a => MVector MVector (Identity a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Identity a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Identity a) -> MVector s (Identity a) # basicOverlaps :: MVector s (Identity a) -> MVector s (Identity a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Identity a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Identity a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Identity a -> m (MVector (PrimState m) (Identity a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (Identity a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> Identity a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Identity a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Identity a) -> Identity a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Identity a) -> MVector (PrimState m) (Identity a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Identity a) -> Int -> m (MVector (PrimState m) (Identity a)) # | |
| Bounded a => Bounded (Identity a) | Since: base-4.9.0.0 |
| Enum a => Enum (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods succ :: Identity a -> Identity a # pred :: Identity a -> Identity a # fromEnum :: Identity a -> Int # enumFrom :: Identity a -> [Identity a] # enumFromThen :: Identity a -> Identity a -> [Identity a] # enumFromTo :: Identity a -> Identity a -> [Identity a] # enumFromThenTo :: Identity a -> Identity a -> Identity a -> [Identity a] # | |
| Eq a => Eq (Identity a) | Since: base-4.8.0.0 |
| Floating a => Floating (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods exp :: Identity a -> Identity a # log :: Identity a -> Identity a # sqrt :: Identity a -> Identity a # (**) :: Identity a -> Identity a -> Identity a # logBase :: Identity a -> Identity a -> Identity a # sin :: Identity a -> Identity a # cos :: Identity a -> Identity a # tan :: Identity a -> Identity a # asin :: Identity a -> Identity a # acos :: Identity a -> Identity a # atan :: Identity a -> Identity a # sinh :: Identity a -> Identity a # cosh :: Identity a -> Identity a # tanh :: Identity a -> Identity a # asinh :: Identity a -> Identity a # acosh :: Identity a -> Identity a # atanh :: Identity a -> Identity a # log1p :: Identity a -> Identity a # expm1 :: Identity a -> Identity a # | |
| Fractional a => Fractional (Identity a) | Since: base-4.9.0.0 |
| Integral a => Integral (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods quot :: Identity a -> Identity a -> Identity a # rem :: Identity a -> Identity a -> Identity a # div :: Identity a -> Identity a -> Identity a # mod :: Identity a -> Identity a -> Identity a # quotRem :: Identity a -> Identity a -> (Identity a, Identity a) # divMod :: Identity a -> Identity a -> (Identity a, Identity a) # | |
| Data a => Data (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Identity a -> c (Identity a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Identity a) # toConstr :: Identity a -> Constr # dataTypeOf :: Identity a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Identity a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Identity a)) # gmapT :: (forall b. Data b => b -> b) -> Identity a -> Identity a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Identity a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Identity a -> r # gmapQ :: (forall d. Data d => d -> u) -> Identity a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Identity a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Identity a -> m (Identity a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Identity a -> m (Identity a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Identity a -> m (Identity a) # | |
| Num a => Num (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity | |
| Ord a => Ord (Identity a) | Since: base-4.8.0.0 |
Defined in Data.Functor.Identity | |
| Read a => Read (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Real a => Real (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods toRational :: Identity a -> Rational # | |
| RealFloat a => RealFloat (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods floatRadix :: Identity a -> Integer # floatDigits :: Identity a -> Int # floatRange :: Identity a -> (Int, Int) # decodeFloat :: Identity a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Identity a # exponent :: Identity a -> Int # significand :: Identity a -> Identity a # scaleFloat :: Int -> Identity a -> Identity a # isInfinite :: Identity a -> Bool # isDenormalized :: Identity a -> Bool # isNegativeZero :: Identity a -> Bool # | |
| RealFrac a => RealFrac (Identity a) | Since: base-4.9.0.0 |
| Show a => Show (Identity a) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Ix a => Ix (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods range :: (Identity a, Identity a) -> [Identity a] # index :: (Identity a, Identity a) -> Identity a -> Int # unsafeIndex :: (Identity a, Identity a) -> Identity a -> Int # inRange :: (Identity a, Identity a) -> Identity a -> Bool # rangeSize :: (Identity a, Identity a) -> Int # unsafeRangeSize :: (Identity a, Identity a) -> Int # | |
| IsString a => IsString (Identity a) | Since: base-4.9.0.0 |
Defined in Data.String Methods fromString :: String -> Identity a # | |
| Generic (Identity a) | Since: base-4.8.0.0 |
| Semigroup a => Semigroup (Identity a) | Since: base-4.9.0.0 |
| Monoid a => Monoid (Identity a) | Since: base-4.9.0.0 |
| Hashable a => Hashable (Identity a) | |
Defined in Data.Hashable.Class | |
| Storable a => Storable (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods alignment :: Identity a -> Int # peekElemOff :: Ptr (Identity a) -> Int -> IO (Identity a) # pokeElemOff :: Ptr (Identity a) -> Int -> Identity a -> IO () # peekByteOff :: Ptr b -> Int -> IO (Identity a) # pokeByteOff :: Ptr b -> Int -> Identity a -> IO () # | |
| Bits a => Bits (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods (.&.) :: Identity a -> Identity a -> Identity a # (.|.) :: Identity a -> Identity a -> Identity a # xor :: Identity a -> Identity a -> Identity a # complement :: Identity a -> Identity a # shift :: Identity a -> Int -> Identity a # rotate :: Identity a -> Int -> Identity a # setBit :: Identity a -> Int -> Identity a # clearBit :: Identity a -> Int -> Identity a # complementBit :: Identity a -> Int -> Identity a # testBit :: Identity a -> Int -> Bool # bitSizeMaybe :: Identity a -> Maybe Int # bitSize :: Identity a -> Int # isSigned :: Identity a -> Bool # shiftL :: Identity a -> Int -> Identity a # unsafeShiftL :: Identity a -> Int -> Identity a # shiftR :: Identity a -> Int -> Identity a # unsafeShiftR :: Identity a -> Int -> Identity a # rotateL :: Identity a -> Int -> Identity a # | |
| FiniteBits a => FiniteBits (Identity a) | Since: base-4.9.0.0 |
Defined in Data.Functor.Identity Methods finiteBitSize :: Identity a -> Int # countLeadingZeros :: Identity a -> Int # countTrailingZeros :: Identity a -> Int # | |
| NFData a => NFData (Identity a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Unbox a => Unbox (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| Ixed (Identity a) | |
Defined in Control.Lens.At | |
| Wrapped (Identity a) | |
| IsoValue a => IsoValue (Identity a) | |
| (TypeError (DisallowInstance "Identity") :: Constraint) => Container (Identity a) | |
Defined in Universum.Container.Class Methods toList :: Identity a -> [Element (Identity a)] # foldr :: (Element (Identity a) -> b -> b) -> b -> Identity a -> b # foldl :: (b -> Element (Identity a) -> b) -> b -> Identity a -> b # foldl' :: (b -> Element (Identity a) -> b) -> b -> Identity a -> b # elem :: Element (Identity a) -> Identity a -> Bool # maximum :: Identity a -> Element (Identity a) # minimum :: Identity a -> Element (Identity a) # foldMap :: Monoid m => (Element (Identity a) -> m) -> Identity a -> m # fold :: Identity a -> Element (Identity a) # foldr' :: (Element (Identity a) -> b -> b) -> b -> Identity a -> b # foldr1 :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # foldl1 :: (Element (Identity a) -> Element (Identity a) -> Element (Identity a)) -> Identity a -> Element (Identity a) # notElem :: Element (Identity a) -> Identity a -> Bool # all :: (Element (Identity a) -> Bool) -> Identity a -> Bool # any :: (Element (Identity a) -> Bool) -> Identity a -> Bool # find :: (Element (Identity a) -> Bool) -> Identity a -> Maybe (Element (Identity a)) # | |
| PIsString (Identity a) | |
Defined in Data.Singletons.Prelude.IsString Associated Types type FromString arg0 :: a0 # | |
| SIsString a => SIsString (Identity a) | |
Defined in Data.Singletons.Prelude.IsString Methods sFromString :: forall (t :: Symbol). Sing t -> Sing (Apply FromStringSym0 t) # | |
| PBounded (Identity a) | |
Defined in Data.Singletons.Prelude.Enum | |
| SBounded a => SBounded (Identity a) | |
Defined in Data.Singletons.Prelude.Enum | |
| POrd (Identity a) | |
| SOrd a => SOrd (Identity a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Identity a) (t2 :: Identity a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| SEq a => SEq (Identity a) | |
| PEq (Identity a) | |
| Generic1 Identity | Since: base-4.8.0.0 |
| t ~ Identity b => Rewrapped (Identity a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SIdentity :: Identity a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SDecide a => TestEquality (SIdentity :: Identity a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (Bounded a) :=> (Bounded (Identity a)) | |
| (Enum a) :=> (Enum (Identity a)) | |
| (Eq a) :=> (Eq (Identity a)) | |
| (Floating a) :=> (Floating (Identity a)) | |
| (Fractional a) :=> (Fractional (Identity a)) | |
Defined in Data.Constraint Methods ins :: Fractional a :- Fractional (Identity a) # | |
| (Integral a) :=> (Integral (Identity a)) | |
| (Num a) :=> (Num (Identity a)) | |
| (Ord a) :=> (Ord (Identity a)) | |
| (Read a) :=> (Read (Identity a)) | |
| (Real a) :=> (Real (Identity a)) | |
| (RealFloat a) :=> (RealFloat (Identity a)) | |
| (RealFrac a) :=> (RealFrac (Identity a)) | |
| (Show a) :=> (Show (Identity a)) | |
| (Semigroup a) :=> (Semigroup (Identity a)) | |
| (Monoid a) :=> (Monoid (Identity a)) | |
| (Bits a) :=> (Bits (Identity a)) | |
| Field1 (Identity a) (Identity b) a b | |
| SingI (IdentitySym0 :: TyFun a (Identity a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods sing :: Sing IdentitySym0 # | |
| SuppressUnusedWarnings (ToEnum_6989586621680921033Sym0 :: TyFun Nat (Identity a6989586621680920912) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621680921135Sym0 :: TyFun Nat (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680921156Sym0 :: TyFun Nat (Identity a6989586621680920937 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromString_6989586621681391379Sym0 :: TyFun Symbol (Identity a6989586621681391348) -> Type) | |
Defined in Data.Singletons.Prelude.IsString Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (IdentitySym0 :: TyFun a6989586621679087410 (Identity a6989586621679087410) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680921371Sym0 :: TyFun a6989586621679962808 (Identity a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680921217Sym0 :: TyFun a6989586621680742398 (Identity a6989586621680742398 ~> Bool) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (RunIdentitySym0 :: TyFun (Identity a6989586621679087410) a6989586621679087410 -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803706Sym0 :: TyFun (Identity a6989586621679087410) (Identity a6989586621679087410 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ToList_6989586621680921364Sym0 :: TyFun (Identity a6989586621680742395) [a6989586621680742395] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921143Sym0 :: TyFun (Identity a6989586621680920934) (Identity a6989586621680920934 ~> Identity a6989586621680920934) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921103Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921091Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921079Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_6989586621680921357Sym0 :: TyFun (Identity a6989586621680742401) a6989586621680742401 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680921019Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680921128Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_6989586621680921350Sym0 :: TyFun (Identity a6989586621680742402) a6989586621680742402 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680921026Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Null_6989586621680921344Sym0 :: TyFun (Identity a6989586621680742396) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680921114Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Minimum_6989586621680921337Sym0 :: TyFun (Identity a6989586621680742400) a6989586621680742400 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Maximum_6989586621680921330Sym0 :: TyFun (Identity a6989586621680742399) a6989586621680742399 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Length_6989586621680921324Sym0 :: TyFun (Identity a6989586621680742397) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680921040Sym0 :: TyFun (Identity a6989586621680920912) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680921048Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> [Identity a6989586621680920912]) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680921061Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> (Identity a6989586621680920912 ~> [Identity a6989586621680920912])) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680921121Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680921314Sym0 :: TyFun (a6989586621680742393 ~> (a6989586621680742393 ~> a6989586621680742393)) (Identity a6989586621680742393 ~> a6989586621680742393) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680921263Sym0 :: TyFun (a6989586621680742394 ~> (a6989586621680742394 ~> a6989586621680742394)) (Identity a6989586621680742394 ~> a6989586621680742394) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921186Sym0 :: TyFun a6989586621679962805 (Identity b6989586621679962806 ~> Identity a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803706Sym1 a6989586621679803704 :: TyFun (Identity a6989586621679087410) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921410Sym0 :: TyFun (Identity a6989586621679962832) ((a6989586621679962832 ~> Identity b6989586621679962833) ~> Identity b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921143Sym1 a6989586621680921141 :: TyFun (Identity a6989586621680920934) (Identity a6989586621680920934) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921103Sym1 a6989586621680921101 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921091Sym1 a6989586621680921089 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921079Sym1 a6989586621680921077 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680921156Sym1 a6989586621680921153 a6989586621680920937 :: TyFun (Identity a6989586621680920937) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr1_6989586621680921314Sym1 a6989586621680921312 :: TyFun (Identity a6989586621680742393) a6989586621680742393 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl1_6989586621680921263Sym1 a6989586621680921261 :: TyFun (Identity a6989586621680742394) a6989586621680742394 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680921048Sym1 a6989586621680921046 :: TyFun (Identity a6989586621680920912) [Identity a6989586621680920912] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680921061Sym1 a6989586621680921058 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> [Identity a6989586621680920912]) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Elem_6989586621680921217Sym1 a6989586621680921215 :: TyFun (Identity a6989586621680742398) Bool -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921381Sym0 :: TyFun (Identity (a6989586621679962809 ~> b6989586621679962810)) (Identity a6989586621679962809 ~> Identity b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680921275Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Identity a6989586621680742385 ~> b6989586621680742386)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680921292Sym0 :: TyFun (a6989586621680742387 ~> (b6989586621680742388 ~> b6989586621680742388)) (b6989586621680742388 ~> (Identity a6989586621680742387 ~> b6989586621680742388)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680921230Sym0 :: TyFun (b6989586621680742389 ~> (a6989586621680742390 ~> b6989586621680742389)) (b6989586621680742389 ~> (Identity a6989586621680742390 ~> b6989586621680742389)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680921247Sym0 :: TyFun (b6989586621680742391 ~> (a6989586621680742392 ~> b6989586621680742391)) (b6989586621680742391 ~> (Identity a6989586621680742392 ~> b6989586621680742391)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680921205Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Identity a6989586621680742384 ~> m6989586621680742383) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680921174Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Identity a6989586621679962803 ~> Identity b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680921275Sym1 a6989586621680921272 :: TyFun b6989586621680742386 (Identity a6989586621680742385 ~> b6989586621680742386) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680921292Sym1 a6989586621680921289 :: TyFun b6989586621680742388 (Identity a6989586621680742387 ~> b6989586621680742388) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680921230Sym1 a6989586621680921227 :: TyFun b6989586621680742389 (Identity a6989586621680742390 ~> b6989586621680742389) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680921247Sym1 a6989586621680921244 :: TyFun b6989586621680742391 (Identity a6989586621680742392 ~> b6989586621680742391) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921381Sym1 a6989586621680921379 :: TyFun (Identity a6989586621679962809) (Identity b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921186Sym1 a6989586621680921184 b6989586621679962806 :: TyFun (Identity b6989586621679962806) (Identity a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680921205Sym1 a6989586621680921203 :: TyFun (Identity a6989586621680742384) m6989586621680742383 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680921174Sym1 a6989586621680921172 :: TyFun (Identity a6989586621679962803) (Identity b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680921061Sym2 a6989586621680921059 a6989586621680921058 :: TyFun (Identity a6989586621680920912) [Identity a6989586621680920912] -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995197Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Identity a6989586621680988964 ~> f6989586621680988963 (Identity b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994995Scrutinee_6989586621680994595Sym0 :: TyFun (a6989586621680988964 ~> b6989586621680988965) (TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680921410Sym1 a6989586621680921408 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Identity b6989586621679962833) (Identity b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680921394Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Identity a6989586621679962811 ~> (Identity b6989586621679962812 ~> Identity c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994995Scrutinee_6989586621680994595Sym1 f6989586621680994993 :: TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995197Sym1 a6989586621680995195 :: TyFun (Identity a6989586621680988964) (f6989586621680988963 (Identity b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680921394Sym1 a6989586621680921391 :: TyFun (Identity a6989586621679962811) (Identity b6989586621679962812 ~> Identity c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680921275Sym2 a6989586621680921273 a6989586621680921272 :: TyFun (Identity a6989586621680742385) b6989586621680742386 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr'_6989586621680921292Sym2 a6989586621680921290 a6989586621680921289 :: TyFun (Identity a6989586621680742387) b6989586621680742388 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl_6989586621680921230Sym2 a6989586621680921228 a6989586621680921227 :: TyFun (Identity a6989586621680742390) b6989586621680742389 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldl'_6989586621680921247Sym2 a6989586621680921245 a6989586621680921244 :: TyFun (Identity a6989586621680742392) b6989586621680742391 -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680921394Sym2 a6989586621680921392 a6989586621680921391 :: TyFun (Identity b6989586621679962812) (Identity c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Identity Methods suppressUnusedWarnings :: () # | |
| Wrappable (NamedF Identity a name) | |
Defined in Lorentz.Wrappable Associated Types type Unwrappable (NamedF Identity a name) # | |
| (HasAnnotation a, KnownSymbol name) => HasAnnotation (NamedF Identity a name) | |
Defined in Lorentz.Annotation | |
| IsoValue a => IsoValue (NamedF Identity a name) | |
| type Rep Identity | |
Defined in Data.Functor.Rep | |
| type Product (a :: Identity k2) | |
| type Sum (a :: Identity k2) | |
| type Minimum (a :: Identity k2) | |
| type Maximum (a :: Identity k2) | |
| type Length (a :: Identity a6989586621680742397) | |
| type Null (a :: Identity a6989586621680742396) | |
| type ToList (a :: Identity a6989586621680742395) | |
| type Fold (arg0 :: Identity m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Identity (m0 a0)) | |
| type SequenceA (arg0 :: Identity (f0 a0)) | |
| type Elem (a1 :: k1) (a2 :: Identity k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Identity k2) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Identity a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Identity b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Identity a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Identity | |
| type (arg1 :: Identity a0) <* (arg2 :: Identity b0) | |
| type (arg1 :: Identity a0) *> (arg2 :: Identity b0) | |
| type (a1 :: Identity (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Identity a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Identity a6989586621679962809) = Apply (Apply (TFHelper_6989586621680921381Sym0 :: TyFun (Identity (a6989586621679962809 ~> b6989586621679962810)) (Identity a6989586621679962809 ~> Identity b6989586621679962810) -> Type) a1) a2 | |
| type (arg1 :: Identity a0) >> (arg2 :: Identity b0) | |
| type (a1 :: Identity a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Identity b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Identity type (a1 :: Identity a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Identity b6989586621679962833) = Apply (Apply (TFHelper_6989586621680921410Sym0 :: TyFun (Identity a6989586621679962832) ((a6989586621679962832 ~> Identity b6989586621679962833) ~> Identity b6989586621679962833) -> Type) a1) a2 | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Identity a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Identity a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Identity a6989586621680988964) = Apply (Apply (Traverse_6989586621680995197Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Identity a6989586621680988964 ~> f6989586621680988963 (Identity b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (a1 :: k2 ~> (a6989586621680742392 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680742392) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldr' (a1 :: a6989586621680742387 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680742387) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Identity a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Identity | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Identity a6989586621679962811) (a3 :: Identity b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Identity type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Identity a6989586621679962811) (a3 :: Identity b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621680921394Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Identity a6989586621679962811 ~> (Identity b6989586621679962812 ~> Identity c6989586621679962813)) -> Type) a1) a2) a3 | |
| newtype MVector s (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (ToEnum_6989586621680921033Sym0 :: TyFun Nat (Identity a6989586621680920912) -> Type) (a6989586621680921032 :: Nat) | |
| type Apply (FromInteger_6989586621680921135Sym0 :: TyFun Nat (Identity a6989586621680920923) -> Type) (a6989586621680921134 :: Nat) | |
| type Apply (FromString_6989586621681391379Sym0 :: TyFun Symbol (Identity a6989586621681391348) -> Type) (a6989586621681391378 :: Symbol) | |
| type Apply (IdentitySym0 :: TyFun a (Identity a) -> Type) (t6989586621679707550 :: a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Apply (Pure_6989586621680921371Sym0 :: TyFun a (Identity a) -> Type) (a6989586621680921370 :: a) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (ShowsPrec_6989586621680921156Sym0 :: TyFun Nat (Identity a6989586621680920937 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680921153 :: Nat) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Elem_6989586621680921217Sym0 :: TyFun a6989586621680742398 (Identity a6989586621680742398 ~> Bool) -> Type) (a6989586621680921215 :: a6989586621680742398) | |
| type Apply (TFHelper_6989586621680921186Sym0 :: TyFun a6989586621679962805 (Identity b6989586621679962806 ~> Identity a6989586621679962805) -> Type) (a6989586621680921184 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680921186Sym0 :: TyFun a6989586621679962805 (Identity b6989586621679962806 ~> Identity a6989586621679962805) -> Type) (a6989586621680921184 :: a6989586621679962805) = TFHelper_6989586621680921186Sym1 a6989586621680921184 b6989586621679962806 :: TyFun (Identity b6989586621679962806) (Identity a6989586621679962805) -> Type | |
| type Apply (Foldl_6989586621680921230Sym1 a6989586621680921227 :: TyFun b6989586621680742389 (Identity a6989586621680742390 ~> b6989586621680742389) -> Type) (a6989586621680921228 :: b6989586621680742389) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldl'_6989586621680921247Sym1 a6989586621680921244 :: TyFun b6989586621680742391 (Identity a6989586621680742392 ~> b6989586621680742391) -> Type) (a6989586621680921245 :: b6989586621680742391) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldr_6989586621680921275Sym1 a6989586621680921272 :: TyFun b6989586621680742386 (Identity a6989586621680742385 ~> b6989586621680742386) -> Type) (a6989586621680921273 :: b6989586621680742386) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldr'_6989586621680921292Sym1 a6989586621680921289 :: TyFun b6989586621680742388 (Identity a6989586621680742387 ~> b6989586621680742388) -> Type) (a6989586621680921290 :: b6989586621680742388) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Rep (Identity a) | |
Defined in Data.Functor.Identity | |
| newtype Vector (Identity a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Index (Identity a) | |
Defined in Control.Lens.At | |
| type IxValue (Identity a) | |
Defined in Control.Lens.At | |
| type Unwrapped (Identity a) | |
Defined in Control.Lens.Wrapped | |
| type ToT (Identity a) | |
Defined in Michelson.Typed.Haskell.Value | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type Element (Identity a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Identity | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Enum | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Enum | |
| type Demote (Identity a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Rep1 Identity | |
Defined in Data.Functor.Identity | |
| type FromString a2 | |
Defined in Data.Singletons.Prelude.IsString | |
| type Mconcat (arg0 :: [Identity a]) | |
| type Show_ (arg0 :: Identity a) | |
| type Sconcat (arg0 :: NonEmpty (Identity a)) | |
| type FromEnum (a2 :: Identity a1) | |
| type ToEnum a2 | |
| type Pred (a2 :: Identity a1) | |
| type Succ (a2 :: Identity a1) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Identity | |
| type Signum (a2 :: Identity a1) | |
| type Abs (a2 :: Identity a1) | |
| type Negate (a2 :: Identity a1) | |
| type Mappend (arg1 :: Identity a) (arg2 :: Identity a) | |
| type ShowList (arg1 :: [Identity a]) arg2 | |
| type (a2 :: Identity a1) <> (a3 :: Identity a1) | |
| type EnumFromTo (a2 :: Identity a1) (a3 :: Identity a1) | |
| type (a2 :: Identity a1) * (a3 :: Identity a1) | |
| type (a2 :: Identity a1) - (a3 :: Identity a1) | |
| type (a2 :: Identity a1) + (a3 :: Identity a1) | |
| type Min (arg1 :: Identity a) (arg2 :: Identity a) | |
| type Max (arg1 :: Identity a) (arg2 :: Identity a) | |
| type (arg1 :: Identity a) >= (arg2 :: Identity a) | |
| type (arg1 :: Identity a) > (arg2 :: Identity a) | |
| type (arg1 :: Identity a) <= (arg2 :: Identity a) | |
| type (arg1 :: Identity a) < (arg2 :: Identity a) | |
| type Compare (a2 :: Identity a1) (a3 :: Identity a1) | |
| type (x :: Identity a) /= (y :: Identity a) | |
| type (a2 :: Identity a1) == (b :: Identity a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: Identity a1) a4 | |
| type EnumFromThenTo (a2 :: Identity a1) (a3 :: Identity a1) (a4 :: Identity a1) | |
| type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679707547 :: Identity a) | |
Defined in Data.Singletons.Prelude.Instances type Apply (RunIdentitySym0 :: TyFun (Identity a) a -> Type) (a6989586621679707547 :: Identity a) = RunIdentity a6989586621679707547 | |
| type Apply (FromEnum_6989586621680921040Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680921039 :: Identity a) | |
| type Apply (Length_6989586621680921324Sym0 :: TyFun (Identity a) Nat -> Type) (a6989586621680921323 :: Identity a) | |
| type Apply (Maximum_6989586621680921330Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680921329 :: Identity a) | |
| type Apply (Minimum_6989586621680921337Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680921336 :: Identity a) | |
| type Apply (Null_6989586621680921344Sym0 :: TyFun (Identity a) Bool -> Type) (a6989586621680921343 :: Identity a) | |
| type Apply (Product_6989586621680921350Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680921349 :: Identity a) | |
| type Apply (Sum_6989586621680921357Sym0 :: TyFun (Identity a) a -> Type) (a6989586621680921356 :: Identity a) | |
| type Apply (Compare_6989586621679803706Sym1 a6989586621679803704 :: TyFun (Identity a) Ordering -> Type) (a6989586621679803705 :: Identity a) | |
| type Apply (Elem_6989586621680921217Sym1 a6989586621680921215 :: TyFun (Identity a) Bool -> Type) (a6989586621680921216 :: Identity a) | |
| type Apply (Foldl1_6989586621680921263Sym1 a6989586621680921261 :: TyFun (Identity a) a -> Type) (a6989586621680921262 :: Identity a) | |
| type Apply (Foldr1_6989586621680921314Sym1 a6989586621680921312 :: TyFun (Identity a) a -> Type) (a6989586621680921313 :: Identity a) | |
| type Apply (FoldMap_6989586621680921205Sym1 a6989586621680921203 :: TyFun (Identity a) m -> Type) (a6989586621680921204 :: Identity a) | |
| type Apply (Foldl_6989586621680921230Sym2 a6989586621680921228 a6989586621680921227 :: TyFun (Identity a) b -> Type) (a6989586621680921229 :: Identity a) | |
| type Apply (Foldl'_6989586621680921247Sym2 a6989586621680921245 a6989586621680921244 :: TyFun (Identity a) b -> Type) (a6989586621680921246 :: Identity a) | |
| type Apply (Foldr_6989586621680921275Sym2 a6989586621680921273 a6989586621680921272 :: TyFun (Identity a) b -> Type) (a6989586621680921274 :: Identity a) | |
| type Apply (Foldr'_6989586621680921292Sym2 a6989586621680921290 a6989586621680921289 :: TyFun (Identity a) b -> Type) (a6989586621680921291 :: Identity a) | |
| type Apply (Succ_6989586621680921019Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921018 :: Identity a) | |
| type Apply (Pred_6989586621680921026Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921025 :: Identity a) | |
| type Apply (Negate_6989586621680921114Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921113 :: Identity a) | |
| type Apply (Abs_6989586621680921121Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921120 :: Identity a) | |
| type Apply (Signum_6989586621680921128Sym0 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921127 :: Identity a) | |
| type Apply (ToList_6989586621680921364Sym0 :: TyFun (Identity a) [a] -> Type) (a6989586621680921363 :: Identity a) | |
| type Apply (EnumFromTo_6989586621680921048Sym1 a6989586621680921046 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680921047 :: Identity a) | |
| type Apply (TFHelper_6989586621680921079Sym1 a6989586621680921077 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921078 :: Identity a) | |
| type Apply (TFHelper_6989586621680921091Sym1 a6989586621680921089 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921090 :: Identity a) | |
| type Apply (TFHelper_6989586621680921103Sym1 a6989586621680921101 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921102 :: Identity a) | |
| type Apply (TFHelper_6989586621680921143Sym1 a6989586621680921141 :: TyFun (Identity a) (Identity a) -> Type) (a6989586621680921142 :: Identity a) | |
| type Apply (EnumFromThenTo_6989586621680921061Sym2 a6989586621680921059 a6989586621680921058 :: TyFun (Identity a) [Identity a] -> Type) (a6989586621680921060 :: Identity a) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Fmap_6989586621680921174Sym1 a6989586621680921172 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680921173 :: Identity a) | |
| type Apply (TFHelper_6989586621680921186Sym1 a6989586621680921184 b :: TyFun (Identity b) (Identity a) -> Type) (a6989586621680921185 :: Identity b) | |
| type Apply (TFHelper_6989586621680921381Sym1 a6989586621680921379 :: TyFun (Identity a) (Identity b) -> Type) (a6989586621680921380 :: Identity a) | |
| type Apply (Let6989586621680994995Scrutinee_6989586621680994595Sym1 f6989586621680994993 :: TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) (x6989586621680994994 :: t6989586621680988962 a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994995Scrutinee_6989586621680994595Sym1 f6989586621680994993 :: TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) (x6989586621680994994 :: t6989586621680988962 a6989586621680988964) = Let6989586621680994995Scrutinee_6989586621680994595 f6989586621680994993 x6989586621680994994 | |
| type Apply (Traverse_6989586621680995197Sym1 a6989586621680995195 :: TyFun (Identity a) (f (Identity b)) -> Type) (a6989586621680995196 :: Identity a) | |
| type Apply (LiftA2_6989586621680921394Sym2 a6989586621680921392 a6989586621680921391 :: TyFun (Identity b) (Identity c) -> Type) (a6989586621680921393 :: Identity b) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Compare_6989586621679803706Sym0 :: TyFun (Identity a6989586621679087410) (Identity a6989586621679087410 ~> Ordering) -> Type) (a6989586621679803704 :: Identity a6989586621679087410) | |
| type Apply (EnumFromTo_6989586621680921048Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> [Identity a6989586621680920912]) -> Type) (a6989586621680921046 :: Identity a6989586621680920912) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (EnumFromThenTo_6989586621680921061Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> (Identity a6989586621680920912 ~> [Identity a6989586621680920912])) -> Type) (a6989586621680921058 :: Identity a6989586621680920912) | |
Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680921061Sym0 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> (Identity a6989586621680920912 ~> [Identity a6989586621680920912])) -> Type) (a6989586621680921058 :: Identity a6989586621680920912) = EnumFromThenTo_6989586621680921061Sym1 a6989586621680921058 | |
| type Apply (TFHelper_6989586621680921079Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) (a6989586621680921077 :: Identity a6989586621680920923) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680921091Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) (a6989586621680921089 :: Identity a6989586621680920923) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680921103Sym0 :: TyFun (Identity a6989586621680920923) (Identity a6989586621680920923 ~> Identity a6989586621680920923) -> Type) (a6989586621680921101 :: Identity a6989586621680920923) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680921143Sym0 :: TyFun (Identity a6989586621680920934) (Identity a6989586621680920934 ~> Identity a6989586621680920934) -> Type) (a6989586621680921141 :: Identity a6989586621680920934) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (EnumFromThenTo_6989586621680921061Sym1 a6989586621680921058 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> [Identity a6989586621680920912]) -> Type) (a6989586621680921059 :: Identity a6989586621680920912) | |
Defined in Data.Singletons.Prelude.Identity type Apply (EnumFromThenTo_6989586621680921061Sym1 a6989586621680921058 :: TyFun (Identity a6989586621680920912) (Identity a6989586621680920912 ~> [Identity a6989586621680920912]) -> Type) (a6989586621680921059 :: Identity a6989586621680920912) = EnumFromThenTo_6989586621680921061Sym2 a6989586621680921058 a6989586621680921059 | |
| type Apply (ShowsPrec_6989586621680921156Sym1 a6989586621680921153 a6989586621680920937 :: TyFun (Identity a6989586621680920937) (Symbol ~> Symbol) -> Type) (a6989586621680921154 :: Identity a6989586621680920937) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (TFHelper_6989586621680921410Sym0 :: TyFun (Identity a6989586621679962832) ((a6989586621679962832 ~> Identity b6989586621679962833) ~> Identity b6989586621679962833) -> Type) (a6989586621680921408 :: Identity a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680921410Sym0 :: TyFun (Identity a6989586621679962832) ((a6989586621679962832 ~> Identity b6989586621679962833) ~> Identity b6989586621679962833) -> Type) (a6989586621680921408 :: Identity a6989586621679962832) = TFHelper_6989586621680921410Sym1 a6989586621680921408 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Identity b6989586621679962833) (Identity b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680921381Sym0 :: TyFun (Identity (a6989586621679962809 ~> b6989586621679962810)) (Identity a6989586621679962809 ~> Identity b6989586621679962810) -> Type) (a6989586621680921379 :: Identity (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (TFHelper_6989586621680921381Sym0 :: TyFun (Identity (a6989586621679962809 ~> b6989586621679962810)) (Identity a6989586621679962809 ~> Identity b6989586621679962810) -> Type) (a6989586621680921379 :: Identity (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680921381Sym1 a6989586621680921379 | |
| type Apply (LiftA2_6989586621680921394Sym1 a6989586621680921391 :: TyFun (Identity a6989586621679962811) (Identity b6989586621679962812 ~> Identity c6989586621679962813) -> Type) (a6989586621680921392 :: Identity a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680921394Sym1 a6989586621680921391 :: TyFun (Identity a6989586621679962811) (Identity b6989586621679962812 ~> Identity c6989586621679962813) -> Type) (a6989586621680921392 :: Identity a6989586621679962811) = LiftA2_6989586621680921394Sym2 a6989586621680921391 a6989586621680921392 | |
| type Apply (TFHelper_6989586621680921410Sym1 a6989586621680921408 b :: TyFun (a ~> Identity b) (Identity b) -> Type) (a6989586621680921409 :: a ~> Identity b) | |
| type Apply (Foldl1_6989586621680921263Sym0 :: TyFun (a6989586621680742394 ~> (a6989586621680742394 ~> a6989586621680742394)) (Identity a6989586621680742394 ~> a6989586621680742394) -> Type) (a6989586621680921261 :: a6989586621680742394 ~> (a6989586621680742394 ~> a6989586621680742394)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl1_6989586621680921263Sym0 :: TyFun (a6989586621680742394 ~> (a6989586621680742394 ~> a6989586621680742394)) (Identity a6989586621680742394 ~> a6989586621680742394) -> Type) (a6989586621680921261 :: a6989586621680742394 ~> (a6989586621680742394 ~> a6989586621680742394)) = Foldl1_6989586621680921263Sym1 a6989586621680921261 | |
| type Apply (Foldr1_6989586621680921314Sym0 :: TyFun (a6989586621680742393 ~> (a6989586621680742393 ~> a6989586621680742393)) (Identity a6989586621680742393 ~> a6989586621680742393) -> Type) (a6989586621680921312 :: a6989586621680742393 ~> (a6989586621680742393 ~> a6989586621680742393)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr1_6989586621680921314Sym0 :: TyFun (a6989586621680742393 ~> (a6989586621680742393 ~> a6989586621680742393)) (Identity a6989586621680742393 ~> a6989586621680742393) -> Type) (a6989586621680921312 :: a6989586621680742393 ~> (a6989586621680742393 ~> a6989586621680742393)) = Foldr1_6989586621680921314Sym1 a6989586621680921312 | |
| type Apply (Fmap_6989586621680921174Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Identity a6989586621679962803 ~> Identity b6989586621679962804) -> Type) (a6989586621680921172 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (FoldMap_6989586621680921205Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Identity a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621680921203 :: a6989586621680742384 ~> m6989586621680742383) | |
Defined in Data.Singletons.Prelude.Identity | |
| type Apply (Foldl_6989586621680921230Sym0 :: TyFun (b6989586621680742389 ~> (a6989586621680742390 ~> b6989586621680742389)) (b6989586621680742389 ~> (Identity a6989586621680742390 ~> b6989586621680742389)) -> Type) (a6989586621680921227 :: b6989586621680742389 ~> (a6989586621680742390 ~> b6989586621680742389)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl_6989586621680921230Sym0 :: TyFun (b6989586621680742389 ~> (a6989586621680742390 ~> b6989586621680742389)) (b6989586621680742389 ~> (Identity a6989586621680742390 ~> b6989586621680742389)) -> Type) (a6989586621680921227 :: b6989586621680742389 ~> (a6989586621680742390 ~> b6989586621680742389)) = Foldl_6989586621680921230Sym1 a6989586621680921227 | |
| type Apply (Foldl'_6989586621680921247Sym0 :: TyFun (b6989586621680742391 ~> (a6989586621680742392 ~> b6989586621680742391)) (b6989586621680742391 ~> (Identity a6989586621680742392 ~> b6989586621680742391)) -> Type) (a6989586621680921244 :: b6989586621680742391 ~> (a6989586621680742392 ~> b6989586621680742391)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldl'_6989586621680921247Sym0 :: TyFun (b6989586621680742391 ~> (a6989586621680742392 ~> b6989586621680742391)) (b6989586621680742391 ~> (Identity a6989586621680742392 ~> b6989586621680742391)) -> Type) (a6989586621680921244 :: b6989586621680742391 ~> (a6989586621680742392 ~> b6989586621680742391)) = Foldl'_6989586621680921247Sym1 a6989586621680921244 | |
| type Apply (Foldr_6989586621680921275Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Identity a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680921272 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr_6989586621680921275Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Identity a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680921272 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) = Foldr_6989586621680921275Sym1 a6989586621680921272 | |
| type Apply (Foldr'_6989586621680921292Sym0 :: TyFun (a6989586621680742387 ~> (b6989586621680742388 ~> b6989586621680742388)) (b6989586621680742388 ~> (Identity a6989586621680742387 ~> b6989586621680742388)) -> Type) (a6989586621680921289 :: a6989586621680742387 ~> (b6989586621680742388 ~> b6989586621680742388)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (Foldr'_6989586621680921292Sym0 :: TyFun (a6989586621680742387 ~> (b6989586621680742388 ~> b6989586621680742388)) (b6989586621680742388 ~> (Identity a6989586621680742387 ~> b6989586621680742388)) -> Type) (a6989586621680921289 :: a6989586621680742387 ~> (b6989586621680742388 ~> b6989586621680742388)) = Foldr'_6989586621680921292Sym1 a6989586621680921289 | |
| type Apply (Let6989586621680994995Scrutinee_6989586621680994595Sym0 :: TyFun (a6989586621680988964 ~> b6989586621680988965) (TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) -> Type) (f6989586621680994993 :: a6989586621680988964 ~> b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994995Scrutinee_6989586621680994595Sym0 :: TyFun (a6989586621680988964 ~> b6989586621680988965) (TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type) -> Type) (f6989586621680994993 :: a6989586621680988964 ~> b6989586621680988965) = Let6989586621680994995Scrutinee_6989586621680994595Sym1 f6989586621680994993 :: TyFun (t6989586621680988962 a6989586621680988964) (Identity (t6989586621680988962 b6989586621680988965)) -> Type | |
| type Apply (Traverse_6989586621680995197Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Identity a6989586621680988964 ~> f6989586621680988963 (Identity b6989586621680988965)) -> Type) (a6989586621680995195 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995197Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Identity a6989586621680988964 ~> f6989586621680988963 (Identity b6989586621680988965)) -> Type) (a6989586621680995195 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995197Sym1 a6989586621680995195 | |
| type Apply (LiftA2_6989586621680921394Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Identity a6989586621679962811 ~> (Identity b6989586621679962812 ~> Identity c6989586621679962813)) -> Type) (a6989586621680921391 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Identity type Apply (LiftA2_6989586621680921394Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Identity a6989586621679962811 ~> (Identity b6989586621679962812 ~> Identity c6989586621679962813)) -> Type) (a6989586621680921391 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621680921394Sym1 a6989586621680921391 | |
| type Unwrappable (NamedF Identity a name) | |
Defined in Lorentz.Wrappable | |
| type ToT (NamedF Identity a name) | |
withFrozenCallStack :: HasCallStack => (HasCallStack => a) -> a #
Perform some computation without adding new entries to the CallStack.
Since: base-4.9.0.0
callStack :: HasCallStack => CallStack #
A monad supporting atomic memory transactions.
Instances
| Monad STM | Since: base-4.3.0.0 |
| Functor STM | Since: base-4.3.0.0 |
| Applicative STM | Since: base-4.8.0.0 |
| Alternative STM | Since: base-4.8.0.0 |
| MonadPlus STM | Since: base-4.3.0.0 |
| MonadThrow STM | |
Defined in Control.Monad.Catch | |
| MonadCatch STM | |
Shared memory locations that support atomic memory transactions.
A mutable variable in the IO monad
Instances
| NFData1 IORef | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq (IORef a) | Pointer equality. Since: base-4.0.0.0 |
| NFData (IORef a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
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.
prettyCallStack :: CallStack -> String #
Pretty print a CallStack.
Since: base-4.9.0.0
prettySrcLoc :: SrcLoc -> String #
Pretty print a SrcLoc.
Since: base-4.9.0.0
class (Typeable e, Show e) => Exception e where #
Any type that you wish to throw or catch as an exception must be an
instance of the Exception class. The simplest case is a new exception
type directly below the root:
data MyException = ThisException | ThatException
deriving Show
instance Exception MyExceptionThe default method definitions in the Exception class do what we need
in this case. You can now throw and catch ThisException and
ThatException as exceptions:
*Main> throw ThisException `catch` \e -> putStrLn ("Caught " ++ show (e :: MyException))
Caught ThisException
In more complicated examples, you may wish to define a whole hierarchy of exceptions:
---------------------------------------------------------------------
-- Make the root exception type for all the exceptions in a compiler
data SomeCompilerException = forall e . Exception e => SomeCompilerException e
instance Show SomeCompilerException where
show (SomeCompilerException e) = show e
instance Exception SomeCompilerException
compilerExceptionToException :: Exception e => e -> SomeException
compilerExceptionToException = toException . SomeCompilerException
compilerExceptionFromException :: Exception e => SomeException -> Maybe e
compilerExceptionFromException x = do
SomeCompilerException a <- fromException x
cast a
---------------------------------------------------------------------
-- Make a subhierarchy for exceptions in the frontend of the compiler
data SomeFrontendException = forall e . Exception e => SomeFrontendException e
instance Show SomeFrontendException where
show (SomeFrontendException e) = show e
instance Exception SomeFrontendException where
toException = compilerExceptionToException
fromException = compilerExceptionFromException
frontendExceptionToException :: Exception e => e -> SomeException
frontendExceptionToException = toException . SomeFrontendException
frontendExceptionFromException :: Exception e => SomeException -> Maybe e
frontendExceptionFromException x = do
SomeFrontendException a <- fromException x
cast a
---------------------------------------------------------------------
-- Make an exception type for a particular frontend compiler exception
data MismatchedParentheses = MismatchedParentheses
deriving Show
instance Exception MismatchedParentheses where
toException = frontendExceptionToException
fromException = frontendExceptionFromExceptionWe can now catch a MismatchedParentheses exception as
MismatchedParentheses, SomeFrontendException or
SomeCompilerException, but not other types, e.g. IOException:
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: MismatchedParentheses))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeFrontendException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: SomeCompilerException))
Caught MismatchedParentheses
*Main> throw MismatchedParentheses `catch` \e -> putStrLn ("Caught " ++ show (e :: IOException))
*** Exception: MismatchedParentheses
Minimal complete definition
Nothing
Methods
toException :: e -> SomeException #
fromException :: SomeException -> Maybe e #
displayException :: e -> String #
Render this exception value in a human-friendly manner.
Default implementation: show
Since: base-4.8.0.0
Instances
The Const functor.
Instances
| () :=> (Functor (Const a :: Type -> Type)) | |
| Generic1 (Const a :: k -> Type) | Since: base-4.9.0.0 |
| Unbox a => Vector Vector (Const a b) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Const a b) -> m (Vector (Const a b)) # basicUnsafeThaw :: PrimMonad m => Vector (Const a b) -> m (Mutable Vector (PrimState m) (Const a b)) # basicLength :: Vector (Const a b) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Const a b) -> Vector (Const a b) # basicUnsafeIndexM :: Monad m => Vector (Const a b) -> Int -> m (Const a b) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Const a b) -> Vector (Const a b) -> m () # | |
| Unbox a => MVector MVector (Const a b) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Const a b) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Const a b) -> MVector s (Const a b) # basicOverlaps :: MVector s (Const a b) -> MVector s (Const a b) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Const a b)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Const a b) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Const a b -> m (MVector (PrimState m) (Const a b)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Const a b) -> Int -> m (Const a b) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Const a b) -> Int -> Const a b -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Const a b) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Const a b) -> Const a b -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Const a b) -> MVector (PrimState m) (Const a b) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Const a b) -> MVector (PrimState m) (Const a b) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Const a b) -> Int -> m (MVector (PrimState m) (Const a b)) # | |
| Bifunctor (Const :: Type -> Type -> Type) | Since: base-4.8.0.0 |
| NFData2 (Const :: Type -> Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable2 (Const :: Type -> Type -> Type) | |
Defined in Data.Hashable.Class | |
| (Bounded a) :=> (Bounded (Const a b)) | |
| (Enum a) :=> (Enum (Const a b)) | |
| (Eq a) :=> (Eq (Const a b)) | |
| (Floating a) :=> (Floating (Const a b)) | |
| (Fractional a) :=> (Fractional (Const a b)) | |
Defined in Data.Constraint Methods ins :: Fractional a :- Fractional (Const a b) # | |
| (Integral a) :=> (Integral (Const a b)) | |
| (Num a) :=> (Num (Const a b)) | |
| (Ord a) :=> (Ord (Const a b)) | |
| (Read a) :=> (Read (Const a b)) | |
| (Real a) :=> (Real (Const a b)) | |
| (RealFloat a) :=> (RealFloat (Const a b)) | |
| (RealFrac a) :=> (RealFrac (Const a b)) | |
| (Show a) :=> (Show (Const a b)) | |
| (Semigroup a) :=> (Semigroup (Const a b)) | |
| (Monoid a) :=> (Monoid (Const a b)) | |
| (Monoid a) :=> (Applicative (Const a :: Type -> Type)) | |
Defined in Data.Constraint | |
| (Bits a) :=> (Bits (Const a b)) | |
| Functor (Const m :: Type -> Type) | Since: base-2.1 |
| Monoid m => Applicative (Const m :: Type -> Type) | Since: base-2.0.1 |
| Foldable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Functor.Const Methods fold :: Monoid m0 => Const m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> Const m a -> m0 # foldr :: (a -> b -> b) -> b -> Const m a -> b # foldr' :: (a -> b -> b) -> b -> Const m a -> b # foldl :: (b -> a -> b) -> b -> Const m a -> b # foldl' :: (b -> a -> b) -> b -> Const m a -> b # foldr1 :: (a -> a -> a) -> Const m a -> a # foldl1 :: (a -> a -> a) -> Const m a -> a # elem :: Eq a => a -> Const m a -> Bool # maximum :: Ord a => Const m a -> a # minimum :: Ord a => Const m a -> a # | |
| Traversable (Const m :: Type -> Type) | Since: base-4.7.0.0 |
| NFData a => NFData1 (Const a :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable a => Hashable1 (Const a :: Type -> Type) | |
Defined in Data.Hashable.Class | |
| PTraversable (Const m :: Type -> Type) | |
| STraversable (Const m :: Type -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Const m a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Const m (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m0 :: Type -> Type) b (t1 :: a ~> m0 b) (t2 :: Const m a). SMonad m0 => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m0 :: Type -> Type) a (t :: Const m (m0 a)). SMonad m0 => Sing t -> Sing (Apply SequenceSym0 t) # | |
| SuppressUnusedWarnings (Pure_6989586621680953757Sym0 :: TyFun a6989586621679962808 (Const m6989586621680952804 a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SingI (ConstSym0 :: TyFun a6989586621679095645 (Const a6989586621679095645 b6989586621679095646) -> Type) | |
Defined in Data.Singletons.Prelude.Const | |
| SuppressUnusedWarnings (ToEnum_6989586621680953532Sym0 :: TyFun Nat (Const a6989586621680952769 b6989586621680952770) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromInteger_6989586621680953634Sym0 :: TyFun Nat (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680953655Sym0 :: TyFun Nat (Const a6989586621680952798 b6989586621680952799 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromString_6989586621681391372Sym0 :: TyFun Symbol (Const a6989586621681391345 b6989586621681391346) -> Type) | |
Defined in Data.Singletons.Prelude.IsString Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994974MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ConstSym0 :: TyFun a6989586621679095645 (Const a6989586621679095645 b6989586621679095646) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953780Sym0 :: TyFun (Const m6989586621680952804 (a6989586621679962809 ~> b6989586621679962810)) (Const m6989586621680952804 a6989586621679962809 ~> Const m6989586621680952804 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953642Sym0 :: TyFun (Const a6989586621680952794 b6989586621680952795) (Const a6989586621680952794 b6989586621680952795 ~> Const a6989586621680952794 b6989586621680952795) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953602Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953590Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953578Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Succ_6989586621680953518Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680953627Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pred_6989586621680953525Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680953613Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetConstSym0 :: TyFun (Const a6989586621680951409 b6989586621680951410) a6989586621680951409 -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FromEnum_6989586621680953539Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) Nat -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680953547Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680953560Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770])) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680953620Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994982Scrutinee_6989586621680994598Sym0 :: TyFun (a6989586621680988964 ~> b6989586621679941602) (TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680953731Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386)) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680953711Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Const m6989586621680952803 a6989586621680742384 ~> m6989586621680742383) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680953673Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Const m6989586621680952802 a6989586621679962803 ~> Const m6989586621680952802 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994982Scrutinee_6989586621680994598Sym1 f6989586621680994972 :: TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994974MkConstSym1 f6989586621680994972 :: TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953692Sym0 :: TyFun a6989586621679962805 (Const m6989586621680952802 b6989586621679962806 ~> Const m6989586621680952802 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680953731Sym1 a6989586621680953728 m6989586621680952803 :: TyFun b6989586621680742386 (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953780Sym1 a6989586621680953778 :: TyFun (Const m6989586621680952804 a6989586621679962809) (Const m6989586621680952804 b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680953711Sym1 a6989586621680953709 m6989586621680952803 :: TyFun (Const m6989586621680952803 a6989586621680742384) m6989586621680742383 -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680953673Sym1 a6989586621680953671 m6989586621680952802 :: TyFun (Const m6989586621680952802 a6989586621679962803) (Const m6989586621680952802 b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953642Sym1 a6989586621680953640 :: TyFun (Const a6989586621680952794 b6989586621680952795) (Const a6989586621680952794 b6989586621680952795) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953602Sym1 a6989586621680953600 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953590Sym1 a6989586621680953588 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953578Sym1 a6989586621680953576 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680953655Sym1 a6989586621680953652 a6989586621680952798 b6989586621680952799 :: TyFun (Const a6989586621680952798 b6989586621680952799) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromTo_6989586621680953547Sym1 a6989586621680953545 :: TyFun (Const a6989586621680952769 b6989586621680952770) [Const a6989586621680952769 b6989586621680952770] -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680953560Sym1 a6989586621680953557 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680953507Sym1 a6989586621680953505 :: TyFun (Const a6989586621680952767 b6989586621680952768) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995125Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Const m6989586621680994523 a6989586621680988964 ~> f6989586621680988963 (Const m6989586621680994523 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680953765Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Const m6989586621680952804 a6989586621679962811 ~> (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680994974MkConstSym2 x6989586621680994973 f6989586621680994972 m6989586621680994494 :: TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995125Sym1 a6989586621680995123 m6989586621680994523 :: TyFun (Const m6989586621680994523 a6989586621680988964) (f6989586621680988963 (Const m6989586621680994523 b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680953765Sym1 a6989586621680953762 m6989586621680952804 :: TyFun (Const m6989586621680952804 a6989586621679962811) (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680953731Sym2 a6989586621680953729 a6989586621680953728 m6989586621680952803 :: TyFun (Const m6989586621680952803 a6989586621680742385) b6989586621680742386 -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680953692Sym1 a6989586621680953690 m6989586621680952802 b6989586621679962806 :: TyFun (Const m6989586621680952802 b6989586621679962806) (Const m6989586621680952802 a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (EnumFromThenTo_6989586621680953560Sym2 a6989586621680953558 a6989586621680953557 :: TyFun (Const a6989586621680952769 b6989586621680952770) [Const a6989586621680952769 b6989586621680952770] -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680953765Sym2 a6989586621680953763 a6989586621680953762 :: TyFun (Const m6989586621680952804 b6989586621679962812) (Const m6989586621680952804 c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Const Methods suppressUnusedWarnings :: () # | |
| Bounded a => Bounded (Const a b) | Since: base-4.9.0.0 |
| Enum a => Enum (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods succ :: Const a b -> Const a b # pred :: Const a b -> Const a b # fromEnum :: Const a b -> Int # enumFrom :: Const a b -> [Const a b] # enumFromThen :: Const a b -> Const a b -> [Const a b] # enumFromTo :: Const a b -> Const a b -> [Const a b] # enumFromThenTo :: Const a b -> Const a b -> Const a b -> [Const a b] # | |
| Eq a => Eq (Const a b) | Since: base-4.9.0.0 |
| Floating a => Floating (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods exp :: Const a b -> Const a b # log :: Const a b -> Const a b # sqrt :: Const a b -> Const a b # (**) :: Const a b -> Const a b -> Const a b # logBase :: Const a b -> Const a b -> Const a b # sin :: Const a b -> Const a b # cos :: Const a b -> Const a b # tan :: Const a b -> Const a b # asin :: Const a b -> Const a b # acos :: Const a b -> Const a b # atan :: Const a b -> Const a b # sinh :: Const a b -> Const a b # cosh :: Const a b -> Const a b # tanh :: Const a b -> Const a b # asinh :: Const a b -> Const a b # acosh :: Const a b -> Const a b # atanh :: Const a b -> Const a b # log1p :: Const a b -> Const a b # expm1 :: Const a b -> Const a b # | |
| Fractional a => Fractional (Const a b) | Since: base-4.9.0.0 |
| Integral a => Integral (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods quot :: Const a b -> Const a b -> Const a b # rem :: Const a b -> Const a b -> Const a b # div :: Const a b -> Const a b -> Const a b # mod :: Const a b -> Const a b -> Const a b # quotRem :: Const a b -> Const a b -> (Const a b, Const a b) # divMod :: Const a b -> Const a b -> (Const a b, Const a b) # | |
| (Typeable k, Data a, Typeable b) => Data (Const a b) | Since: base-4.10.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b0. Data d => c (d -> b0) -> d -> c b0) -> (forall g. g -> c g) -> Const a b -> c (Const a b) # gunfold :: (forall b0 r. Data b0 => c (b0 -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Const a b) # toConstr :: Const a b -> Constr # dataTypeOf :: Const a b -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Const a b)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Const a b)) # gmapT :: (forall b0. Data b0 => b0 -> b0) -> Const a b -> Const a b # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Const a b -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Const a b -> r # gmapQ :: (forall d. Data d => d -> u) -> Const a b -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Const a b -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Const a b -> m (Const a b) # | |
| Num a => Num (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| Ord a => Ord (Const a b) | Since: base-4.9.0.0 |
| Read a => Read (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Real a => Real (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods toRational :: Const a b -> Rational # | |
| RealFloat a => RealFloat (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods floatRadix :: Const a b -> Integer # floatDigits :: Const a b -> Int # floatRange :: Const a b -> (Int, Int) # decodeFloat :: Const a b -> (Integer, Int) # encodeFloat :: Integer -> Int -> Const a b # exponent :: Const a b -> Int # significand :: Const a b -> Const a b # scaleFloat :: Int -> Const a b -> Const a b # isInfinite :: Const a b -> Bool # isDenormalized :: Const a b -> Bool # isNegativeZero :: Const a b -> Bool # | |
| RealFrac a => RealFrac (Const a b) | Since: base-4.9.0.0 |
| Show a => Show (Const a b) | This instance would be equivalent to the derived instances of the
Since: base-4.8.0.0 |
| Ix a => Ix (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods range :: (Const a b, Const a b) -> [Const a b] # index :: (Const a b, Const a b) -> Const a b -> Int # unsafeIndex :: (Const a b, Const a b) -> Const a b -> Int # inRange :: (Const a b, Const a b) -> Const a b -> Bool # rangeSize :: (Const a b, Const a b) -> Int # unsafeRangeSize :: (Const a b, Const a b) -> Int # | |
| IsString a => IsString (Const a b) | Since: base-4.9.0.0 |
Defined in Data.String Methods fromString :: String -> Const a b # | |
| Generic (Const a b) | Since: base-4.9.0.0 |
| Semigroup a => Semigroup (Const a b) | Since: base-4.9.0.0 |
| Monoid a => Monoid (Const a b) | Since: base-4.9.0.0 |
| Hashable a => Hashable (Const a b) | |
Defined in Data.Hashable.Class | |
| Storable a => Storable (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const | |
| Bits a => Bits (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods (.&.) :: Const a b -> Const a b -> Const a b # (.|.) :: Const a b -> Const a b -> Const a b # xor :: Const a b -> Const a b -> Const a b # complement :: Const a b -> Const a b # shift :: Const a b -> Int -> Const a b # rotate :: Const a b -> Int -> Const a b # setBit :: Const a b -> Int -> Const a b # clearBit :: Const a b -> Int -> Const a b # complementBit :: Const a b -> Int -> Const a b # testBit :: Const a b -> Int -> Bool # bitSizeMaybe :: Const a b -> Maybe Int # isSigned :: Const a b -> Bool # shiftL :: Const a b -> Int -> Const a b # unsafeShiftL :: Const a b -> Int -> Const a b # shiftR :: Const a b -> Int -> Const a b # unsafeShiftR :: Const a b -> Int -> Const a b # rotateL :: Const a b -> Int -> Const a b # | |
| FiniteBits a => FiniteBits (Const a b) | Since: base-4.9.0.0 |
Defined in Data.Functor.Const Methods finiteBitSize :: Const a b -> Int # countLeadingZeros :: Const a b -> Int # countTrailingZeros :: Const a b -> Int # | |
| NFData a => NFData (Const a b) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Unbox a => Unbox (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Const a x) | |
| Container (Const a b) | |
Defined in Universum.Container.Class Methods toList :: Const a b -> [Element (Const a b)] # foldr :: (Element (Const a b) -> b0 -> b0) -> b0 -> Const a b -> b0 # foldl :: (b0 -> Element (Const a b) -> b0) -> b0 -> Const a b -> b0 # foldl' :: (b0 -> Element (Const a b) -> b0) -> b0 -> Const a b -> b0 # elem :: Element (Const a b) -> Const a b -> Bool # maximum :: Const a b -> Element (Const a b) # minimum :: Const a b -> Element (Const a b) # foldMap :: Monoid m => (Element (Const a b) -> m) -> Const a b -> m # fold :: Const a b -> Element (Const a b) # foldr' :: (Element (Const a b) -> b0 -> b0) -> b0 -> Const a b -> b0 # foldr1 :: (Element (Const a b) -> Element (Const a b) -> Element (Const a b)) -> Const a b -> Element (Const a b) # foldl1 :: (Element (Const a b) -> Element (Const a b) -> Element (Const a b)) -> Const a b -> Element (Const a b) # notElem :: Element (Const a b) -> Const a b -> Bool # all :: (Element (Const a b) -> Bool) -> Const a b -> Bool # any :: (Element (Const a b) -> Bool) -> Const a b -> Bool # find :: (Element (Const a b) -> Bool) -> Const a b -> Maybe (Element (Const a b)) # | |
| PIsString (Const a b) | |
Defined in Data.Singletons.Prelude.IsString Associated Types type FromString arg0 :: a0 # | |
| SIsString a => SIsString (Const a b) | |
Defined in Data.Singletons.Prelude.IsString Methods sFromString :: forall (t :: Symbol). Sing t -> Sing (Apply FromStringSym0 t) # | |
| t ~ Const a' x' => Rewrapped (Const a x) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SConst :: Const a b -> Type) | |
Defined in Data.Singletons.Prelude.Const | |
| SDecide a => TestEquality (SConst :: Const a b -> Type) | |
Defined in Data.Singletons.Prelude.Const | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Const m a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Const m a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Const m a6989586621680988964) = Apply (Apply (Traverse_6989586621680995125Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Const m a6989586621680988964 ~> f6989586621680988963 (Const m b6989586621680988965)) -> Type) a1) a2 | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Const m a6989586621679962811) (a3 :: Const m b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Const type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: Const m a6989586621679962811) (a3 :: Const m b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621680953765Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Const m a6989586621679962811 ~> (Const m b6989586621679962812 ~> Const m c6989586621679962813)) -> Type) a1) a2) a3 | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Const m a6989586621680742384) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Const m a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Const | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Const m a0) | |
| type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Const m a0) | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Const m a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Const m a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Const | |
| type Rep1 (Const a :: k -> Type) | |
Defined in Data.Functor.Const | |
| type Pure (a :: k1) | |
| type Elem (arg1 :: a0) (arg2 :: Const m a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Const m a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Const m a0) | |
| type (a1 :: k1) <$ (a2 :: Const m b6989586621679962806) | |
| type Apply (ShowsPrec_6989586621680953655Sym0 :: TyFun Nat (Const a6989586621680952798 b6989586621680952799 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680953652 :: Nat) | |
Defined in Data.Singletons.Prelude.Const type Apply (ShowsPrec_6989586621680953655Sym0 :: TyFun Nat (Const a6989586621680952798 b6989586621680952799 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680953652 :: Nat) = ShowsPrec_6989586621680953655Sym1 a6989586621680953652 a6989586621680952798 b6989586621680952799 :: TyFun (Const a6989586621680952798 b6989586621680952799) (Symbol ~> Symbol) -> Type | |
| type Apply (Let6989586621680994974MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) -> Type) (f6989586621680994972 :: k1) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994974MkConstSym0 :: TyFun k1 (TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) -> Type) (f6989586621680994972 :: k1) = Let6989586621680994974MkConstSym1 f6989586621680994972 :: TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type | |
| type Apply (Let6989586621680994974MkConstSym1 f6989586621680994972 :: TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) (x6989586621680994973 :: k2) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994974MkConstSym1 f6989586621680994972 :: TyFun k2 (TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type) -> Type) (x6989586621680994973 :: k2) = Let6989586621680994974MkConstSym2 f6989586621680994972 x6989586621680994973 m6989586621680994494 :: TyFun m6989586621680994494 (Const m6989586621680994494 ()) -> Type | |
| type Apply (TFHelper_6989586621680953692Sym0 :: TyFun a6989586621679962805 (Const m6989586621680952802 b6989586621679962806 ~> Const m6989586621680952802 a6989586621679962805) -> Type) (a6989586621680953690 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953692Sym0 :: TyFun a6989586621679962805 (Const m6989586621680952802 b6989586621679962806 ~> Const m6989586621680952802 a6989586621679962805) -> Type) (a6989586621680953690 :: a6989586621679962805) = TFHelper_6989586621680953692Sym1 a6989586621680953690 m6989586621680952802 b6989586621679962806 :: TyFun (Const m6989586621680952802 b6989586621679962806) (Const m6989586621680952802 a6989586621679962805) -> Type | |
| type Apply (Foldr_6989586621680953731Sym1 a6989586621680953728 m6989586621680952803 :: TyFun b6989586621680742386 (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386) -> Type) (a6989586621680953729 :: b6989586621680742386) | |
Defined in Data.Singletons.Prelude.Const type Apply (Foldr_6989586621680953731Sym1 a6989586621680953728 m6989586621680952803 :: TyFun b6989586621680742386 (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386) -> Type) (a6989586621680953729 :: b6989586621680742386) = Foldr_6989586621680953731Sym2 a6989586621680953728 a6989586621680953729 m6989586621680952803 :: TyFun (Const m6989586621680952803 a6989586621680742385) b6989586621680742386 -> Type | |
| newtype MVector s (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (Pure_6989586621680953757Sym0 :: TyFun a (Const m6989586621680952804 a) -> Type) (a6989586621680953756 :: a) | |
| type Apply (ToEnum_6989586621680953532Sym0 :: TyFun Nat (Const a6989586621680952769 b6989586621680952770) -> Type) (a6989586621680953531 :: Nat) | |
| type Apply (FromInteger_6989586621680953634Sym0 :: TyFun Nat (Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953633 :: Nat) | |
| type Apply (FromString_6989586621681391372Sym0 :: TyFun Symbol (Const a6989586621681391345 b6989586621681391346) -> Type) (a6989586621681391371 :: Symbol) | |
Defined in Data.Singletons.Prelude.IsString | |
| type Apply (ConstSym0 :: TyFun a (Const a b6989586621679095646) -> Type) (t6989586621680951129 :: a) | |
| type Apply (Let6989586621680994974MkConstSym2 x6989586621680994973 f6989586621680994972 m :: TyFun m (Const m ()) -> Type) (a6989586621680994977 :: m) | |
Defined in Data.Singletons.Prelude.Traversable | |
| type Apply (Let6989586621680994982Scrutinee_6989586621680994598Sym1 f6989586621680994972 :: TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) (x6989586621680994973 :: t6989586621680988962 a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994982Scrutinee_6989586621680994598Sym1 f6989586621680994972 :: TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) (x6989586621680994973 :: t6989586621680988962 a6989586621680988964) = Let6989586621680994982Scrutinee_6989586621680994598 f6989586621680994972 x6989586621680994973 | |
| type Product (arg0 :: Const m a0) | |
| type Sum (arg0 :: Const m a0) | |
| type Minimum (arg0 :: Const m a0) | |
| type Maximum (arg0 :: Const m a0) | |
| type Length (arg0 :: Const m a0) | |
| type Null (arg0 :: Const m a0) | |
| type ToList (arg0 :: Const m a0) | |
| type Fold (arg0 :: Const m m0) | |
| type Sequence (arg0 :: Const m (m0 a0)) | |
| type SequenceA (arg0 :: Const m (f0 a0)) | |
| type (arg1 :: Const m a0) <* (arg2 :: Const m b0) | |
| type (arg1 :: Const m a0) *> (arg2 :: Const m b0) | |
| type (a1 :: Const m (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Const m a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Const type (a1 :: Const m (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Const m a6989586621679962809) = Apply (Apply (TFHelper_6989586621680953780Sym0 :: TyFun (Const m (a6989586621679962809 ~> b6989586621679962810)) (Const m a6989586621679962809 ~> Const m b6989586621679962810) -> Type) a1) a2 | |
| type Apply (Let6989586621680994982Scrutinee_6989586621680994598Sym0 :: TyFun (a6989586621680988964 ~> b6989586621679941602) (TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) -> Type) (f6989586621680994972 :: a6989586621680988964 ~> b6989586621679941602) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Let6989586621680994982Scrutinee_6989586621680994598Sym0 :: TyFun (a6989586621680988964 ~> b6989586621679941602) (TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type) -> Type) (f6989586621680994972 :: a6989586621680988964 ~> b6989586621679941602) = Let6989586621680994982Scrutinee_6989586621680994598Sym1 f6989586621680994972 :: TyFun (t6989586621680988962 a6989586621680988964) (Const b6989586621679941602 (t6989586621680988962 ())) -> Type | |
| type Apply (Fmap_6989586621680953673Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Const m6989586621680952802 a6989586621679962803 ~> Const m6989586621680952802 b6989586621679962804) -> Type) (a6989586621680953671 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Const type Apply (Fmap_6989586621680953673Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Const m6989586621680952802 a6989586621679962803 ~> Const m6989586621680952802 b6989586621679962804) -> Type) (a6989586621680953671 :: a6989586621679962803 ~> b6989586621679962804) = Fmap_6989586621680953673Sym1 a6989586621680953671 m6989586621680952802 :: TyFun (Const m6989586621680952802 a6989586621679962803) (Const m6989586621680952802 b6989586621679962804) -> Type | |
| type Apply (FoldMap_6989586621680953711Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Const m6989586621680952803 a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621680953709 :: a6989586621680742384 ~> m6989586621680742383) | |
Defined in Data.Singletons.Prelude.Const type Apply (FoldMap_6989586621680953711Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Const m6989586621680952803 a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621680953709 :: a6989586621680742384 ~> m6989586621680742383) = FoldMap_6989586621680953711Sym1 a6989586621680953709 m6989586621680952803 :: TyFun (Const m6989586621680952803 a6989586621680742384) m6989586621680742383 -> Type | |
| type Apply (Foldr_6989586621680953731Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680953728 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) | |
Defined in Data.Singletons.Prelude.Const type Apply (Foldr_6989586621680953731Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680953728 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) = Foldr_6989586621680953731Sym1 a6989586621680953728 m6989586621680952803 :: TyFun b6989586621680742386 (Const m6989586621680952803 a6989586621680742385 ~> b6989586621680742386) -> Type | |
| type Apply (Traverse_6989586621680995125Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Const m6989586621680994523 a6989586621680988964 ~> f6989586621680988963 (Const m6989586621680994523 b6989586621680988965)) -> Type) (a6989586621680995123 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995125Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Const m6989586621680994523 a6989586621680988964 ~> f6989586621680988963 (Const m6989586621680994523 b6989586621680988965)) -> Type) (a6989586621680995123 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995125Sym1 a6989586621680995123 m6989586621680994523 :: TyFun (Const m6989586621680994523 a6989586621680988964) (f6989586621680988963 (Const m6989586621680994523 b6989586621680988965)) -> Type | |
| type Apply (LiftA2_6989586621680953765Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Const m6989586621680952804 a6989586621679962811 ~> (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813)) -> Type) (a6989586621680953762 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Const type Apply (LiftA2_6989586621680953765Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (Const m6989586621680952804 a6989586621679962811 ~> (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813)) -> Type) (a6989586621680953762 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621680953765Sym1 a6989586621680953762 m6989586621680952804 :: TyFun (Const m6989586621680952804 a6989586621679962811) (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813) -> Type | |
| type Rep (Const a b) | |
Defined in Data.Functor.Const | |
| newtype Vector (Const a b) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Const a x) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Const | |
| type Element (Const a b) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Const | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Const | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Const | |
| type Demote (Const a b) | |
Defined in Data.Singletons.Prelude.Const | |
| type FromString a2 | |
Defined in Data.Singletons.Prelude.IsString | |
| type Mconcat (arg0 :: [Const a b]) | |
| type Show_ (arg0 :: Const a b) | |
| type Sconcat (arg0 :: NonEmpty (Const a b)) | |
| type FromEnum (a2 :: Const a1 b) | |
| type ToEnum a2 | |
| type Pred (a2 :: Const a1 b) | |
| type Succ (a2 :: Const a1 b) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Const | |
| type Signum (a2 :: Const a1 b) | |
| type Abs (a2 :: Const a1 b) | |
| type Negate (a2 :: Const a1 b) | |
| type Mappend (arg1 :: Const a b) (arg2 :: Const a b) | |
| type ShowList (arg1 :: [Const a b]) arg2 | |
| type (a2 :: Const a1 b) <> (a3 :: Const a1 b) | |
| type EnumFromTo (a2 :: Const a1 b) (a3 :: Const a1 b) | |
| type (a2 :: Const a1 b) * (a3 :: Const a1 b) | |
| type (a2 :: Const a1 b) - (a3 :: Const a1 b) | |
| type (a2 :: Const a1 b) + (a3 :: Const a1 b) | |
| type Min (arg1 :: Const a b) (arg2 :: Const a b) | |
| type Max (arg1 :: Const a b) (arg2 :: Const a b) | |
| type (arg1 :: Const a b) >= (arg2 :: Const a b) | |
| type (arg1 :: Const a b) > (arg2 :: Const a b) | |
| type (arg1 :: Const a b) <= (arg2 :: Const a b) | |
| type (arg1 :: Const a b) < (arg2 :: Const a b) | |
| type Compare (a2 :: Const a1 b) (a3 :: Const a1 b) | |
| type (x :: Const a b) /= (y :: Const a b) | |
| type (a2 :: Const a1 b1) == (b2 :: Const a1 b1) | |
Defined in Data.Singletons.Prelude.Const | |
| type ShowsPrec a2 (a3 :: Const a1 b) a4 | |
| type EnumFromThenTo (a2 :: Const a1 b) (a3 :: Const a1 b) (a4 :: Const a1 b) | |
| type Apply (GetConstSym0 :: TyFun (Const a b) a -> Type) (x6989586621680951411 :: Const a b) | |
Defined in Data.Singletons.Prelude.Const | |
| type Apply (FromEnum_6989586621680953539Sym0 :: TyFun (Const a b) Nat -> Type) (a6989586621680953538 :: Const a b) | |
| type Apply (FoldMap_6989586621680953711Sym1 a6989586621680953709 m2 :: TyFun (Const m2 a) m1 -> Type) (a6989586621680953710 :: Const m2 a) | |
| type Apply (Compare_6989586621680953507Sym1 a6989586621680953505 :: TyFun (Const a b) Ordering -> Type) (a6989586621680953506 :: Const a b) | |
| type Apply (Foldr_6989586621680953731Sym2 a6989586621680953729 a6989586621680953728 m :: TyFun (Const m a) b -> Type) (a6989586621680953730 :: Const m a) | |
| type Apply (EnumFromTo_6989586621680953547Sym1 a6989586621680953545 :: TyFun (Const a b) [Const a b] -> Type) (a6989586621680953546 :: Const a b) | |
| type Apply (Traverse_6989586621680995125Sym1 a6989586621680995123 m :: TyFun (Const m a) (f (Const m b)) -> Type) (a6989586621680995124 :: Const m a) | |
| type Apply (EnumFromThenTo_6989586621680953560Sym2 a6989586621680953558 a6989586621680953557 :: TyFun (Const a b) [Const a b] -> Type) (a6989586621680953559 :: Const a b) | |
Defined in Data.Singletons.Prelude.Const | |
| type Apply (TFHelper_6989586621680953780Sym0 :: TyFun (Const m6989586621680952804 (a6989586621679962809 ~> b6989586621679962810)) (Const m6989586621680952804 a6989586621679962809 ~> Const m6989586621680952804 b6989586621679962810) -> Type) (a6989586621680953778 :: Const m6989586621680952804 (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953780Sym0 :: TyFun (Const m6989586621680952804 (a6989586621679962809 ~> b6989586621679962810)) (Const m6989586621680952804 a6989586621679962809 ~> Const m6989586621680952804 b6989586621679962810) -> Type) (a6989586621680953778 :: Const m6989586621680952804 (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680953780Sym1 a6989586621680953778 | |
| type Apply (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) (a6989586621680953505 :: Const a6989586621680952767 b6989586621680952768) | |
Defined in Data.Singletons.Prelude.Const type Apply (Compare_6989586621680953507Sym0 :: TyFun (Const a6989586621680952767 b6989586621680952768) (Const a6989586621680952767 b6989586621680952768 ~> Ordering) -> Type) (a6989586621680953505 :: Const a6989586621680952767 b6989586621680952768) = Compare_6989586621680953507Sym1 a6989586621680953505 | |
| type Apply (EnumFromTo_6989586621680953547Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) (a6989586621680953545 :: Const a6989586621680952769 b6989586621680952770) | |
Defined in Data.Singletons.Prelude.Const type Apply (EnumFromTo_6989586621680953547Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) (a6989586621680953545 :: Const a6989586621680952769 b6989586621680952770) = EnumFromTo_6989586621680953547Sym1 a6989586621680953545 | |
| type Apply (EnumFromThenTo_6989586621680953560Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770])) -> Type) (a6989586621680953557 :: Const a6989586621680952769 b6989586621680952770) | |
Defined in Data.Singletons.Prelude.Const type Apply (EnumFromThenTo_6989586621680953560Sym0 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770])) -> Type) (a6989586621680953557 :: Const a6989586621680952769 b6989586621680952770) = EnumFromThenTo_6989586621680953560Sym1 a6989586621680953557 | |
| type Apply (TFHelper_6989586621680953578Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953576 :: Const a6989586621680952782 b6989586621680952783) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953578Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953576 :: Const a6989586621680952782 b6989586621680952783) = TFHelper_6989586621680953578Sym1 a6989586621680953576 | |
| type Apply (TFHelper_6989586621680953590Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953588 :: Const a6989586621680952782 b6989586621680952783) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953590Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953588 :: Const a6989586621680952782 b6989586621680952783) = TFHelper_6989586621680953590Sym1 a6989586621680953588 | |
| type Apply (TFHelper_6989586621680953602Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953600 :: Const a6989586621680952782 b6989586621680952783) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953602Sym0 :: TyFun (Const a6989586621680952782 b6989586621680952783) (Const a6989586621680952782 b6989586621680952783 ~> Const a6989586621680952782 b6989586621680952783) -> Type) (a6989586621680953600 :: Const a6989586621680952782 b6989586621680952783) = TFHelper_6989586621680953602Sym1 a6989586621680953600 | |
| type Apply (TFHelper_6989586621680953642Sym0 :: TyFun (Const a6989586621680952794 b6989586621680952795) (Const a6989586621680952794 b6989586621680952795 ~> Const a6989586621680952794 b6989586621680952795) -> Type) (a6989586621680953640 :: Const a6989586621680952794 b6989586621680952795) | |
Defined in Data.Singletons.Prelude.Const type Apply (TFHelper_6989586621680953642Sym0 :: TyFun (Const a6989586621680952794 b6989586621680952795) (Const a6989586621680952794 b6989586621680952795 ~> Const a6989586621680952794 b6989586621680952795) -> Type) (a6989586621680953640 :: Const a6989586621680952794 b6989586621680952795) = TFHelper_6989586621680953642Sym1 a6989586621680953640 | |
| type Apply (EnumFromThenTo_6989586621680953560Sym1 a6989586621680953557 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) (a6989586621680953558 :: Const a6989586621680952769 b6989586621680952770) | |
Defined in Data.Singletons.Prelude.Const type Apply (EnumFromThenTo_6989586621680953560Sym1 a6989586621680953557 :: TyFun (Const a6989586621680952769 b6989586621680952770) (Const a6989586621680952769 b6989586621680952770 ~> [Const a6989586621680952769 b6989586621680952770]) -> Type) (a6989586621680953558 :: Const a6989586621680952769 b6989586621680952770) = EnumFromThenTo_6989586621680953560Sym2 a6989586621680953557 a6989586621680953558 | |
| type Apply (ShowsPrec_6989586621680953655Sym1 a6989586621680953652 a6989586621680952798 b6989586621680952799 :: TyFun (Const a6989586621680952798 b6989586621680952799) (Symbol ~> Symbol) -> Type) (a6989586621680953653 :: Const a6989586621680952798 b6989586621680952799) | |
Defined in Data.Singletons.Prelude.Const type Apply (ShowsPrec_6989586621680953655Sym1 a6989586621680953652 a6989586621680952798 b6989586621680952799 :: TyFun (Const a6989586621680952798 b6989586621680952799) (Symbol ~> Symbol) -> Type) (a6989586621680953653 :: Const a6989586621680952798 b6989586621680952799) = ShowsPrec_6989586621680953655Sym2 a6989586621680953652 a6989586621680953653 | |
| type Apply (LiftA2_6989586621680953765Sym1 a6989586621680953762 m6989586621680952804 :: TyFun (Const m6989586621680952804 a6989586621679962811) (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813) -> Type) (a6989586621680953763 :: Const m6989586621680952804 a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Const type Apply (LiftA2_6989586621680953765Sym1 a6989586621680953762 m6989586621680952804 :: TyFun (Const m6989586621680952804 a6989586621679962811) (Const m6989586621680952804 b6989586621679962812 ~> Const m6989586621680952804 c6989586621679962813) -> Type) (a6989586621680953763 :: Const m6989586621680952804 a6989586621679962811) = LiftA2_6989586621680953765Sym2 a6989586621680953762 a6989586621680953763 | |
| type Apply (Succ_6989586621680953518Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953517 :: Const a b) | |
| type Apply (Pred_6989586621680953525Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953524 :: Const a b) | |
| type Apply (Negate_6989586621680953613Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953612 :: Const a b) | |
| type Apply (Abs_6989586621680953620Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953619 :: Const a b) | |
| type Apply (Signum_6989586621680953627Sym0 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953626 :: Const a b) | |
| type Apply (Fmap_6989586621680953673Sym1 a6989586621680953671 m :: TyFun (Const m a) (Const m b) -> Type) (a6989586621680953672 :: Const m a) | |
| type Apply (TFHelper_6989586621680953780Sym1 a6989586621680953778 :: TyFun (Const m a) (Const m b) -> Type) (a6989586621680953779 :: Const m a) | |
| type Apply (TFHelper_6989586621680953578Sym1 a6989586621680953576 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953577 :: Const a b) | |
| type Apply (TFHelper_6989586621680953590Sym1 a6989586621680953588 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953589 :: Const a b) | |
| type Apply (TFHelper_6989586621680953602Sym1 a6989586621680953600 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953601 :: Const a b) | |
| type Apply (TFHelper_6989586621680953642Sym1 a6989586621680953640 :: TyFun (Const a b) (Const a b) -> Type) (a6989586621680953641 :: Const a b) | |
| type Apply (TFHelper_6989586621680953692Sym1 a6989586621680953690 m b :: TyFun (Const m b) (Const m a) -> Type) (a6989586621680953691 :: Const m b) | |
| type Apply (LiftA2_6989586621680953765Sym2 a6989586621680953763 a6989586621680953762 :: TyFun (Const m b) (Const m c) -> Type) (a6989586621680953764 :: Const m b) | |
minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a #
The least element of a non-empty structure with respect to the given comparison function.
maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a #
The largest element of a non-empty structure with respect to the given comparison function.
concatMap :: Foldable t => (a -> [b]) -> t a -> [b] #
Map a function over all the elements of a container and concatenate the resulting lists.
foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b #
Monadic fold over the elements of a structure, associating to the left, i.e. from left to right.
foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b #
Monadic fold over the elements of a structure, associating to the right, i.e. from right to left.
Maybe monoid returning the leftmost non-Nothing value.
First aAlt Maybe a
>>>getFirst (First (Just "hello") <> First Nothing <> First (Just "world"))Just "hello"
Use of this type is discouraged. Note the following equivalence:
Data.Monoid.First x === Maybe (Data.Semigroup.First x)
In addition to being equivalent in the structural sense, the two
also have Monoid instances that behave the same. This type will
be marked deprecated in GHC 8.8, and removed in GHC 8.10.
Users are advised to use the variant from Data.Semigroup and wrap
it in Maybe.
Instances
| Monad First | Since: base-4.8.0.0 |
| Functor First | Since: base-4.8.0.0 |
| Applicative First | Since: base-4.8.0.0 |
| Foldable First | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => First m -> m # foldMap :: Monoid m => (a -> m) -> First a -> m # foldMap' :: Monoid m => (a -> m) -> First a -> m # foldr :: (a -> b -> b) -> b -> First a -> b # foldr' :: (a -> b -> b) -> b -> First a -> b # foldl :: (b -> a -> b) -> b -> First a -> b # foldl' :: (b -> a -> b) -> b -> First a -> b # foldr1 :: (a -> a -> a) -> First a -> a # foldl1 :: (a -> a -> a) -> First a -> a # elem :: Eq a => a -> First a -> Bool # maximum :: Ord a => First a -> a # minimum :: Ord a => First a -> a # | |
| Traversable First | Since: base-4.8.0.0 |
| NFData1 First | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable First | |
| STraversable First | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: First a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: First (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: First a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: First (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable First | |
| SFoldable First | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: First m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: First a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: First a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: First a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: First a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: First a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: First a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: First a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: First a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: First a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| Eq a => Eq (First a) | Since: base-2.1 |
| Data a => Data (First a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> First a -> c (First a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (First a) # toConstr :: First a -> Constr # dataTypeOf :: First a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (First a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (First a)) # gmapT :: (forall b. Data b => b -> b) -> First a -> First a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> First a -> r # gmapQ :: (forall d. Data d => d -> u) -> First a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> First a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> First a -> m (First a) # | |
| Ord a => Ord (First a) | Since: base-2.1 |
| Read a => Read (First a) | Since: base-2.1 |
| Show a => Show (First a) | Since: base-2.1 |
| Generic (First a) | Since: base-4.7.0.0 |
| Semigroup (First a) | Since: base-4.9.0.0 |
| Monoid (First a) | Since: base-2.1 |
| NFData a => NFData (First a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Default (First a) | |
Defined in Data.Default.Class | |
| Wrapped (First a) | |
| Container (First a) | |
Defined in Universum.Container.Class Methods toList :: First a -> [Element (First a)] # foldr :: (Element (First a) -> b -> b) -> b -> First a -> b # foldl :: (b -> Element (First a) -> b) -> b -> First a -> b # foldl' :: (b -> Element (First a) -> b) -> b -> First a -> b # elem :: Element (First a) -> First a -> Bool # maximum :: First a -> Element (First a) # minimum :: First a -> Element (First a) # foldMap :: Monoid m => (Element (First a) -> m) -> First a -> m # fold :: First a -> Element (First a) # foldr' :: (Element (First a) -> b -> b) -> b -> First a -> b # foldr1 :: (Element (First a) -> Element (First a) -> Element (First a)) -> First a -> Element (First a) # foldl1 :: (Element (First a) -> Element (First a) -> Element (First a)) -> First a -> Element (First a) # notElem :: Element (First a) -> First a -> Bool # all :: (Element (First a) -> Bool) -> First a -> Bool # any :: (Element (First a) -> Bool) -> First a -> Bool # find :: (Element (First a) -> Bool) -> First a -> Maybe (Element (First a)) # | |
| PMonoid (First a) | |
| SMonoid (First a) | |
| Generic1 First | Since: base-4.7.0.0 |
| t ~ First b => Rewrapped (First a) t | |
Defined in Control.Lens.Wrapped | |
| IsoHKD First (a :: Type) | |
| SDecide (Maybe a) => TestCoercion (SFirst :: First a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SDecide (Maybe a) => TestEquality (SFirst :: First a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SuppressUnusedWarnings (FirstSym0 :: TyFun (Maybe a6989586621679087424) (First a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680637780Sym0 :: TyFun Nat (First a6989586621679087424 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680640865Sym0 :: TyFun a6989586621679962808 (First a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680640946ASym0 :: TyFun a6989586621679087424 (First a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640938Sym0 :: TyFun (First a6989586621680640712) (First a6989586621680640712 ~> First a6989586621680640712) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetFirstSym0 :: TyFun (First a6989586621679087424) (Maybe a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636482Sym0 :: TyFun (First a6989586621679087424) (First a6989586621679087424 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640899Sym0 :: TyFun a6989586621679962805 (First b6989586621679962806 ~> First a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640938Sym1 a6989586621680640936 :: TyFun (First a6989586621680640712) (First a6989586621680640712) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640911Sym0 :: TyFun (First a6989586621679962832) ((a6989586621679962832 ~> First b6989586621679962833) ~> First b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680637780Sym1 a6989586621680637777 a6989586621679087424 :: TyFun (First a6989586621679087424) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636482Sym1 a6989586621680636480 :: TyFun (First a6989586621679087424) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640875Sym0 :: TyFun (First (a6989586621679962809 ~> b6989586621679962810)) (First a6989586621679962809 ~> First b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824160Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (First a6989586621680742385 ~> b6989586621680742386)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680824147Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (First a6989586621680742384 ~> m6989586621680742383) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680640887Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (First a6989586621679962803 ~> First b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742749Scrutinee_6989586621680742640Sym1 p6989586621680742747 :: TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680742750Sym1 p6989586621680742747 :: TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824160Sym1 a6989586621680824157 :: TyFun b6989586621680742386 (First a6989586621680742385 ~> b6989586621680742386) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680824147Sym1 a6989586621680824145 :: TyFun (First a6989586621680742384) m6989586621680742383 -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640899Sym1 a6989586621680640897 b6989586621679962806 :: TyFun (First b6989586621679962806) (First a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640875Sym1 a6989586621680640873 :: TyFun (First a6989586621679962809) (First b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680640887Sym1 a6989586621680640885 :: TyFun (First a6989586621679962803) (First b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995173Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (First a6989586621680988964 ~> f6989586621680988963 (First b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640911Sym1 a6989586621680640909 b6989586621679962833 :: TyFun (a6989586621679962832 ~> First b6989586621679962833) (First b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680742750Sym2 y6989586621680742748 p6989586621680742747 :: TyFun a6989586621679087424 (First a6989586621679087424) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995173Sym1 a6989586621680995171 :: TyFun (First a6989586621680988964) (f6989586621680988963 (First b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824160Sym2 a6989586621680824158 a6989586621680824157 :: TyFun (First a6989586621680742385) b6989586621680742386 -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| type Product (arg0 :: First a0) | |
| type Sum (arg0 :: First a0) | |
| type Minimum (arg0 :: First a0) | |
| type Maximum (arg0 :: First a0) | |
| type Length (arg0 :: First a0) | |
| type Null (arg0 :: First a0) | |
| type ToList (arg0 :: First a0) | |
| type Fold (arg0 :: First m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: First (m0 a0)) | |
| type SequenceA (arg0 :: First (f0 a0)) | |
| type Elem (arg1 :: a0) (arg2 :: First a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: First a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: First a0) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: First a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: First b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: First a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type (arg1 :: First a0) <* (arg2 :: First b0) | |
| type (arg1 :: First a0) *> (arg2 :: First b0) | |
| type (a1 :: First (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: First a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type (arg1 :: First a0) >> (arg2 :: First b0) | |
| type (a1 :: First a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> First b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: First a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: First a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: First a6989586621680988964) = Apply (Apply (Traverse_6989586621680995173Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (First a6989586621680988964 ~> f6989586621680988963 (First b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: First a0) | |
| type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: First a0) | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: First a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: First a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: First a0) (arg3 :: First b0) | |
| type Apply (Pure_6989586621680640865Sym0 :: TyFun a (First a) -> Type) (a6989586621680640864 :: a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680640946ASym0 :: TyFun a6989586621679087424 (First a6989586621679087424) -> Type) (wild_69895866216806407316989586621680640945 :: a6989586621679087424) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Lambda_6989586621680742750Sym2 y6989586621680742748 p6989586621680742747 :: TyFun a6989586621679087424 (First a6989586621679087424) -> Type) (t6989586621680742760 :: a6989586621679087424) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (ShowsPrec_6989586621680637780Sym0 :: TyFun Nat (First a6989586621679087424 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680637777 :: Nat) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680640899Sym0 :: TyFun a6989586621679962805 (First b6989586621679962806 ~> First a6989586621679962805) -> Type) (a6989586621680640897 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640899Sym0 :: TyFun a6989586621679962805 (First b6989586621679962806 ~> First a6989586621679962805) -> Type) (a6989586621680640897 :: a6989586621679962805) = TFHelper_6989586621680640899Sym1 a6989586621680640897 b6989586621679962806 :: TyFun (First b6989586621679962806) (First a6989586621679962805) -> Type | |
| type Apply (Lambda_6989586621680742750Sym1 p6989586621680742747 :: TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) (y6989586621680742748 :: k) | |
| type Apply (Foldr_6989586621680824160Sym1 a6989586621680824157 :: TyFun b6989586621680742386 (First a6989586621680742385 ~> b6989586621680742386) -> Type) (a6989586621680824158 :: b6989586621680742386) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680640919Sym0 :: TyFun k (TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680640917 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Rep (First a) | |
Defined in Data.Monoid | |
| type Unwrapped (First a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Element (First a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Demote (First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Rep1 First | |
Defined in Data.Monoid | |
| type Mconcat (arg0 :: [First a]) | |
| type Show_ (arg0 :: First a) | |
| type Sconcat (arg0 :: NonEmpty (First a)) | |
| type Mappend (arg1 :: First a) (arg2 :: First a) | |
| type ShowList (arg1 :: [First a]) arg2 | |
| type (a2 :: First a1) <> (a3 :: First a1) | |
| type Min (arg1 :: First a) (arg2 :: First a) | |
| type Max (arg1 :: First a) (arg2 :: First a) | |
| type (arg1 :: First a) >= (arg2 :: First a) | |
| type (arg1 :: First a) > (arg2 :: First a) | |
| type (arg1 :: First a) <= (arg2 :: First a) | |
| type (arg1 :: First a) < (arg2 :: First a) | |
| type Compare (a2 :: First a1) (a3 :: First a1) | |
| type (x :: First a) /= (y :: First a) | |
| type (a2 :: First a1) == (b :: First a1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type HKD First (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: First a1) a4 | |
| type Apply (Compare_6989586621680636482Sym1 a6989586621680636480 :: TyFun (First a) Ordering -> Type) (a6989586621680636481 :: First a) | |
| type Apply (FoldMap_6989586621680824147Sym1 a6989586621680824145 :: TyFun (First a) m -> Type) (a6989586621680824146 :: First a) | |
| type Apply (Foldr_6989586621680824160Sym2 a6989586621680824158 a6989586621680824157 :: TyFun (First a) b -> Type) (a6989586621680824159 :: First a) | |
| type Apply (FirstSym0 :: TyFun (Maybe a) (First a) -> Type) (t6989586621680634737 :: Maybe a) | |
| type Apply (GetFirstSym0 :: TyFun (First a) (Maybe a) -> Type) (a6989586621680634734 :: First a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680640938Sym1 a6989586621680640936 :: TyFun (First a) (First a) -> Type) (a6989586621680640937 :: First a) | |
| type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym1 p6989586621680742747 :: TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) (y6989586621680742748 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym1 p6989586621680742747 :: TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) (y6989586621680742748 :: t6989586621680742381 a6989586621680742384) = Let6989586621680742749Scrutinee_6989586621680742640 p6989586621680742747 y6989586621680742748 | |
| type Apply (TFHelper_6989586621680640875Sym1 a6989586621680640873 :: TyFun (First a) (First b) -> Type) (a6989586621680640874 :: First a) | |
| type Apply (Fmap_6989586621680640887Sym1 a6989586621680640885 :: TyFun (First a) (First b) -> Type) (a6989586621680640886 :: First a) | |
| type Apply (TFHelper_6989586621680640899Sym1 a6989586621680640897 b :: TyFun (First b) (First a) -> Type) (a6989586621680640898 :: First b) | |
| type Apply (Traverse_6989586621680995173Sym1 a6989586621680995171 :: TyFun (First a) (f (First b)) -> Type) (a6989586621680995172 :: First a) | |
| type Apply (Compare_6989586621680636482Sym0 :: TyFun (First a6989586621679087424) (First a6989586621679087424 ~> Ordering) -> Type) (a6989586621680636480 :: First a6989586621679087424) | |
| type Apply (TFHelper_6989586621680640938Sym0 :: TyFun (First a6989586621680640712) (First a6989586621680640712 ~> First a6989586621680640712) -> Type) (a6989586621680640936 :: First a6989586621680640712) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (ShowsPrec_6989586621680637780Sym1 a6989586621680637777 a6989586621679087424 :: TyFun (First a6989586621679087424) (Symbol ~> Symbol) -> Type) (a6989586621680637778 :: First a6989586621679087424) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680640911Sym0 :: TyFun (First a6989586621679962832) ((a6989586621679962832 ~> First b6989586621679962833) ~> First b6989586621679962833) -> Type) (a6989586621680640909 :: First a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640911Sym0 :: TyFun (First a6989586621679962832) ((a6989586621679962832 ~> First b6989586621679962833) ~> First b6989586621679962833) -> Type) (a6989586621680640909 :: First a6989586621679962832) = TFHelper_6989586621680640911Sym1 a6989586621680640909 b6989586621679962833 :: TyFun (a6989586621679962832 ~> First b6989586621679962833) (First b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680640875Sym0 :: TyFun (First (a6989586621679962809 ~> b6989586621679962810)) (First a6989586621679962809 ~> First b6989586621679962810) -> Type) (a6989586621680640873 :: First (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640875Sym0 :: TyFun (First (a6989586621679962809 ~> b6989586621679962810)) (First a6989586621679962809 ~> First b6989586621679962810) -> Type) (a6989586621680640873 :: First (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680640875Sym1 a6989586621680640873 | |
| type Apply (TFHelper_6989586621680640911Sym1 a6989586621680640909 b :: TyFun (a ~> First b) (First b) -> Type) (a6989586621680640910 :: a ~> First b) | |
| type Apply (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) (p6989586621680742747 :: a6989586621679087424 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Lambda_6989586621680742750Sym0 :: TyFun (a6989586621679087424 ~> Bool) (TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type) -> Type) (p6989586621680742747 :: a6989586621679087424 ~> Bool) = Lambda_6989586621680742750Sym1 p6989586621680742747 :: TyFun k (TyFun a6989586621679087424 (First a6989586621679087424) -> Type) -> Type | |
| type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) (p6989586621680742747 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742749Scrutinee_6989586621680742640Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type) -> Type) (p6989586621680742747 :: a6989586621680742384 ~> Bool) = Let6989586621680742749Scrutinee_6989586621680742640Sym1 p6989586621680742747 :: TyFun (t6989586621680742381 a6989586621680742384) (First a6989586621680742384) -> Type | |
| type Apply (FoldMap_6989586621680824147Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (First a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621680824145 :: a6989586621680742384 ~> m6989586621680742383) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Foldr_6989586621680824160Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (First a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680824157 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680824160Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (First a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680824157 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) = Foldr_6989586621680824160Sym1 a6989586621680824157 | |
| type Apply (Fmap_6989586621680640887Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (First a6989586621679962803 ~> First b6989586621679962804) -> Type) (a6989586621680640885 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Traverse_6989586621680995173Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (First a6989586621680988964 ~> f6989586621680988963 (First b6989586621680988965)) -> Type) (a6989586621680995171 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995173Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (First a6989586621680988964 ~> f6989586621680988963 (First b6989586621680988965)) -> Type) (a6989586621680995171 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995173Sym1 a6989586621680995171 | |
| type Apply (Lambda_6989586621680640919Sym1 a6989586621680640917 :: TyFun (k1 ~> First a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680640918 :: k1 ~> First a) | |
Maybe monoid returning the rightmost non-Nothing value.
Last aDual (First a)Dual (Alt Maybe a)
>>>getLast (Last (Just "hello") <> Last Nothing <> Last (Just "world"))Just "world"
Use of this type is discouraged. Note the following equivalence:
Data.Monoid.Last x === Maybe (Data.Semigroup.Last x)
In addition to being equivalent in the structural sense, the two
also have Monoid instances that behave the same. This type will
be marked deprecated in GHC 8.8, and removed in GHC 8.10.
Users are advised to use the variant from Data.Semigroup and wrap
it in Maybe.
Instances
| Monad Last | Since: base-4.8.0.0 |
| Functor Last | Since: base-4.8.0.0 |
| Applicative Last | Since: base-4.8.0.0 |
| Foldable Last | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Last m -> m # foldMap :: Monoid m => (a -> m) -> Last a -> m # foldMap' :: Monoid m => (a -> m) -> Last a -> m # foldr :: (a -> b -> b) -> b -> Last a -> b # foldr' :: (a -> b -> b) -> b -> Last a -> b # foldl :: (b -> a -> b) -> b -> Last a -> b # foldl' :: (b -> a -> b) -> b -> Last a -> b # foldr1 :: (a -> a -> a) -> Last a -> a # foldl1 :: (a -> a -> a) -> Last a -> a # elem :: Eq a => a -> Last a -> Bool # maximum :: Ord a => Last a -> a # | |
| Traversable Last | Since: base-4.8.0.0 |
| NFData1 Last | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable Last | |
| STraversable Last | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Last a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Last (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Last a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: Last (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable Last | |
| SFoldable Last | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Last m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Last a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Last a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Last a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: Last a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Last a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Last a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Last a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Last a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Last a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| Eq a => Eq (Last a) | Since: base-2.1 |
| Data a => Data (Last a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Last a -> c (Last a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Last a) # toConstr :: Last a -> Constr # dataTypeOf :: Last a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Last a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Last a)) # gmapT :: (forall b. Data b => b -> b) -> Last a -> Last a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Last a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Last a -> r # gmapQ :: (forall d. Data d => d -> u) -> Last a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Last a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Last a -> m (Last a) # | |
| Ord a => Ord (Last a) | Since: base-2.1 |
| Read a => Read (Last a) | Since: base-2.1 |
| Show a => Show (Last a) | Since: base-2.1 |
| Generic (Last a) | Since: base-4.7.0.0 |
| Semigroup (Last a) | Since: base-4.9.0.0 |
| Monoid (Last a) | Since: base-2.1 |
| NFData a => NFData (Last a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Default (Last a) | |
Defined in Data.Default.Class | |
| Wrapped (Last a) | |
| Container (Last a) | |
Defined in Universum.Container.Class Methods toList :: Last a -> [Element (Last a)] # foldr :: (Element (Last a) -> b -> b) -> b -> Last a -> b # foldl :: (b -> Element (Last a) -> b) -> b -> Last a -> b # foldl' :: (b -> Element (Last a) -> b) -> b -> Last a -> b # elem :: Element (Last a) -> Last a -> Bool # maximum :: Last a -> Element (Last a) # minimum :: Last a -> Element (Last a) # foldMap :: Monoid m => (Element (Last a) -> m) -> Last a -> m # fold :: Last a -> Element (Last a) # foldr' :: (Element (Last a) -> b -> b) -> b -> Last a -> b # foldr1 :: (Element (Last a) -> Element (Last a) -> Element (Last a)) -> Last a -> Element (Last a) # foldl1 :: (Element (Last a) -> Element (Last a) -> Element (Last a)) -> Last a -> Element (Last a) # notElem :: Element (Last a) -> Last a -> Bool # all :: (Element (Last a) -> Bool) -> Last a -> Bool # any :: (Element (Last a) -> Bool) -> Last a -> Bool # find :: (Element (Last a) -> Bool) -> Last a -> Maybe (Element (Last a)) # | |
| PMonoid (Last a) | |
| SMonoid (Last a) | |
| Generic1 Last | Since: base-4.7.0.0 |
| t ~ Last b => Rewrapped (Last a) t | |
Defined in Control.Lens.Wrapped | |
| IsoHKD Last (a :: Type) | |
| SDecide (Maybe a) => TestCoercion (SLast :: Last a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SDecide (Maybe a) => TestEquality (SLast :: Last a -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SingI (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid | |
| SuppressUnusedWarnings (LastSym0 :: TyFun (Maybe a6989586621679087417) (Last a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680637811Sym0 :: TyFun Nat (Last a6989586621679087417 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680640953Sym0 :: TyFun a6989586621679962808 (Last a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680641034BSym0 :: TyFun a6989586621679087417 (Last a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680641026Sym0 :: TyFun (Last a6989586621680640722) (Last a6989586621680640722 ~> Last a6989586621680640722) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetLastSym0 :: TyFun (Last a6989586621679087417) (Maybe a6989586621679087417) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636503Sym0 :: TyFun (Last a6989586621679087417) (Last a6989586621679087417 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640987Sym0 :: TyFun a6989586621679962805 (Last b6989586621679962806 ~> Last a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680641026Sym1 a6989586621680641024 :: TyFun (Last a6989586621680640722) (Last a6989586621680640722) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640999Sym0 :: TyFun (Last a6989586621679962832) ((a6989586621679962832 ~> Last b6989586621679962833) ~> Last b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680637811Sym1 a6989586621680637808 a6989586621679087417 :: TyFun (Last a6989586621679087417) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680636503Sym1 a6989586621680636501 :: TyFun (Last a6989586621679087417) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640963Sym0 :: TyFun (Last (a6989586621679962809 ~> b6989586621679962810)) (Last a6989586621679962809 ~> Last b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824200Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Last a6989586621680742385 ~> b6989586621680742386)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680824187Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Last a6989586621680742384 ~> m6989586621680742383) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680640975Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Last a6989586621679962803 ~> Last b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824200Sym1 a6989586621680824197 :: TyFun b6989586621680742386 (Last a6989586621680742385 ~> b6989586621680742386) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (FoldMap_6989586621680824187Sym1 a6989586621680824185 :: TyFun (Last a6989586621680742384) m6989586621680742383 -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640987Sym1 a6989586621680640985 b6989586621679962806 :: TyFun (Last b6989586621679962806) (Last a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640963Sym1 a6989586621680640961 :: TyFun (Last a6989586621679962809) (Last b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680640975Sym1 a6989586621680640973 :: TyFun (Last a6989586621679962803) (Last b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995185Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Last a6989586621680988964 ~> f6989586621680988963 (Last b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680640999Sym1 a6989586621680640997 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Last b6989586621679962833) (Last b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995185Sym1 a6989586621680995183 :: TyFun (Last a6989586621680988964) (f6989586621680988963 (Last b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Foldr_6989586621680824200Sym2 a6989586621680824198 a6989586621680824197 :: TyFun (Last a6989586621680742385) b6989586621680742386 -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monoid Methods suppressUnusedWarnings :: () # | |
| type Product (arg0 :: Last a0) | |
| type Sum (arg0 :: Last a0) | |
| type Minimum (arg0 :: Last a0) | |
| type Maximum (arg0 :: Last a0) | |
| type Length (arg0 :: Last a0) | |
| type Null (arg0 :: Last a0) | |
| type ToList (arg0 :: Last a0) | |
| type Fold (arg0 :: Last m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Last (m0 a0)) | |
| type SequenceA (arg0 :: Last (f0 a0)) | |
| type Elem (arg1 :: a0) (arg2 :: Last a0) | |
| type Foldl1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Last a0) | |
| type Foldr1 (arg1 :: a0 ~> (a0 ~> a0)) (arg2 :: Last a0) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Last a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Last b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Last a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type (arg1 :: Last a0) <* (arg2 :: Last b0) | |
| type (arg1 :: Last a0) *> (arg2 :: Last b0) | |
| type (a1 :: Last (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Last a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type (arg1 :: Last a0) >> (arg2 :: Last b0) | |
| type (a1 :: Last a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Last b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Last a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Last a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Last a6989586621680988964) = Apply (Apply (Traverse_6989586621680995185Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Last a6989586621680988964 ~> f6989586621680988963 (Last b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Last a0) | |
| type Foldl (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: Last a0) | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: Last a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Last a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Last a0) (arg3 :: Last b0) | |
| type Apply (Pure_6989586621680640953Sym0 :: TyFun a (Last a) -> Type) (a6989586621680640952 :: a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Let6989586621680641034BSym0 :: TyFun a6989586621679087417 (Last a6989586621679087417) -> Type) (wild_69895866216806407386989586621680641033 :: a6989586621679087417) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (ShowsPrec_6989586621680637811Sym0 :: TyFun Nat (Last a6989586621679087417 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680637808 :: Nat) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680640987Sym0 :: TyFun a6989586621679962805 (Last b6989586621679962806 ~> Last a6989586621679962805) -> Type) (a6989586621680640985 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640987Sym0 :: TyFun a6989586621679962805 (Last b6989586621679962806 ~> Last a6989586621679962805) -> Type) (a6989586621680640985 :: a6989586621679962805) = TFHelper_6989586621680640987Sym1 a6989586621680640985 b6989586621679962806 :: TyFun (Last b6989586621679962806) (Last a6989586621679962805) -> Type | |
| type Apply (Foldr_6989586621680824200Sym1 a6989586621680824197 :: TyFun b6989586621680742386 (Last a6989586621680742385 ~> b6989586621680742386) -> Type) (a6989586621680824198 :: b6989586621680742386) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Lambda_6989586621680641007Sym0 :: TyFun k (TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) -> Type) (a6989586621680641005 :: k) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Rep (Last a) | |
Defined in Data.Monoid | |
| type Unwrapped (Last a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Element (Last a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Demote (Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Rep1 Last | |
Defined in Data.Monoid | |
| type Mconcat (arg0 :: [Last a]) | |
| type Show_ (arg0 :: Last a) | |
| type Sconcat (arg0 :: NonEmpty (Last a)) | |
| type Mappend (arg1 :: Last a) (arg2 :: Last a) | |
| type ShowList (arg1 :: [Last a]) arg2 | |
| type (a2 :: Last a1) <> (a3 :: Last a1) | |
| type Min (arg1 :: Last a) (arg2 :: Last a) | |
| type Max (arg1 :: Last a) (arg2 :: Last a) | |
| type (arg1 :: Last a) >= (arg2 :: Last a) | |
| type (arg1 :: Last a) > (arg2 :: Last a) | |
| type (arg1 :: Last a) <= (arg2 :: Last a) | |
| type (arg1 :: Last a) < (arg2 :: Last a) | |
| type Compare (a2 :: Last a1) (a3 :: Last a1) | |
| type (x :: Last a) /= (y :: Last a) | |
| type (a2 :: Last a1) == (b :: Last a1) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type HKD Last (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Last a1) a4 | |
| type Apply (Compare_6989586621680636503Sym1 a6989586621680636501 :: TyFun (Last a) Ordering -> Type) (a6989586621680636502 :: Last a) | |
| type Apply (FoldMap_6989586621680824187Sym1 a6989586621680824185 :: TyFun (Last a) m -> Type) (a6989586621680824186 :: Last a) | |
| type Apply (Foldr_6989586621680824200Sym2 a6989586621680824198 a6989586621680824197 :: TyFun (Last a) b -> Type) (a6989586621680824199 :: Last a) | |
| type Apply (LastSym0 :: TyFun (Maybe a) (Last a) -> Type) (t6989586621680634760 :: Maybe a) | |
| type Apply (GetLastSym0 :: TyFun (Last a) (Maybe a) -> Type) (a6989586621680634757 :: Last a) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680641026Sym1 a6989586621680641024 :: TyFun (Last a) (Last a) -> Type) (a6989586621680641025 :: Last a) | |
| type Apply (TFHelper_6989586621680640963Sym1 a6989586621680640961 :: TyFun (Last a) (Last b) -> Type) (a6989586621680640962 :: Last a) | |
| type Apply (Fmap_6989586621680640975Sym1 a6989586621680640973 :: TyFun (Last a) (Last b) -> Type) (a6989586621680640974 :: Last a) | |
| type Apply (TFHelper_6989586621680640987Sym1 a6989586621680640985 b :: TyFun (Last b) (Last a) -> Type) (a6989586621680640986 :: Last b) | |
| type Apply (Traverse_6989586621680995185Sym1 a6989586621680995183 :: TyFun (Last a) (f (Last b)) -> Type) (a6989586621680995184 :: Last a) | |
| type Apply (Compare_6989586621680636503Sym0 :: TyFun (Last a6989586621679087417) (Last a6989586621679087417 ~> Ordering) -> Type) (a6989586621680636501 :: Last a6989586621679087417) | |
| type Apply (TFHelper_6989586621680641026Sym0 :: TyFun (Last a6989586621680640722) (Last a6989586621680640722 ~> Last a6989586621680640722) -> Type) (a6989586621680641024 :: Last a6989586621680640722) | |
| type Apply (ShowsPrec_6989586621680637811Sym1 a6989586621680637808 a6989586621679087417 :: TyFun (Last a6989586621679087417) (Symbol ~> Symbol) -> Type) (a6989586621680637809 :: Last a6989586621679087417) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (TFHelper_6989586621680640999Sym0 :: TyFun (Last a6989586621679962832) ((a6989586621679962832 ~> Last b6989586621679962833) ~> Last b6989586621679962833) -> Type) (a6989586621680640997 :: Last a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640999Sym0 :: TyFun (Last a6989586621679962832) ((a6989586621679962832 ~> Last b6989586621679962833) ~> Last b6989586621679962833) -> Type) (a6989586621680640997 :: Last a6989586621679962832) = TFHelper_6989586621680640999Sym1 a6989586621680640997 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Last b6989586621679962833) (Last b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680640963Sym0 :: TyFun (Last (a6989586621679962809 ~> b6989586621679962810)) (Last a6989586621679962809 ~> Last b6989586621679962810) -> Type) (a6989586621680640961 :: Last (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monoid type Apply (TFHelper_6989586621680640963Sym0 :: TyFun (Last (a6989586621679962809 ~> b6989586621679962810)) (Last a6989586621679962809 ~> Last b6989586621679962810) -> Type) (a6989586621680640961 :: Last (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680640963Sym1 a6989586621680640961 | |
| type Apply (TFHelper_6989586621680640999Sym1 a6989586621680640997 b :: TyFun (a ~> Last b) (Last b) -> Type) (a6989586621680640998 :: a ~> Last b) | |
| type Apply (FoldMap_6989586621680824187Sym0 :: TyFun (a6989586621680742384 ~> m6989586621680742383) (Last a6989586621680742384 ~> m6989586621680742383) -> Type) (a6989586621680824185 :: a6989586621680742384 ~> m6989586621680742383) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (Foldr_6989586621680824200Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Last a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680824197 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Foldr_6989586621680824200Sym0 :: TyFun (a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) (b6989586621680742386 ~> (Last a6989586621680742385 ~> b6989586621680742386)) -> Type) (a6989586621680824197 :: a6989586621680742385 ~> (b6989586621680742386 ~> b6989586621680742386)) = Foldr_6989586621680824200Sym1 a6989586621680824197 | |
| type Apply (Fmap_6989586621680640975Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Last a6989586621679962803 ~> Last b6989586621679962804) -> Type) (a6989586621680640973 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Apply (Traverse_6989586621680995185Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Last a6989586621680988964 ~> f6989586621680988963 (Last b6989586621680988965)) -> Type) (a6989586621680995183 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995185Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Last a6989586621680988964 ~> f6989586621680988963 (Last b6989586621680988965)) -> Type) (a6989586621680995183 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995185Sym1 a6989586621680995183 | |
| type Apply (Lambda_6989586621680641007Sym1 a6989586621680641005 :: TyFun (k1 ~> Last a) (TyFun k1 (Maybe a) -> Type) -> Type) (k6989586621680641006 :: k1 ~> Last a) | |
stimesMonoid :: (Integral b, Monoid a) => b -> a -> a #
stimesIdempotent :: Integral b => b -> a -> a #
The dual of a Monoid, obtained by swapping the arguments of mappend.
>>>getDual (mappend (Dual "Hello") (Dual "World"))"WorldHello"
Instances
| Monad Dual | Since: base-4.8.0.0 |
| Functor Dual | Since: base-4.8.0.0 |
| Applicative Dual | Since: base-4.8.0.0 |
| Foldable Dual | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Dual m -> m # foldMap :: Monoid m => (a -> m) -> Dual a -> m # foldMap' :: Monoid m => (a -> m) -> Dual a -> m # foldr :: (a -> b -> b) -> b -> Dual a -> b # foldr' :: (a -> b -> b) -> b -> Dual a -> b # foldl :: (b -> a -> b) -> b -> Dual a -> b # foldl' :: (b -> a -> b) -> b -> Dual a -> b # foldr1 :: (a -> a -> a) -> Dual a -> a # foldl1 :: (a -> a -> a) -> Dual a -> a # elem :: Eq a => a -> Dual a -> Bool # maximum :: Ord a => Dual a -> a # | |
| Traversable Dual | Since: base-4.8.0.0 |
| Representable Dual | |
| NFData1 Dual | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable Dual | |
| STraversable Dual | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Dual a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Dual (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Dual a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: Dual (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable Dual | |
| SFoldable Dual | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Dual m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Dual a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Dual a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Dual a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: Dual a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Dual a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Dual a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Dual a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Dual a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Dual a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Dual a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Dual a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| Unbox a => Vector Vector (Dual a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Dual a) -> m (Vector (Dual a)) # basicUnsafeThaw :: PrimMonad m => Vector (Dual a) -> m (Mutable Vector (PrimState m) (Dual a)) # basicLength :: Vector (Dual a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Dual a) -> Vector (Dual a) # basicUnsafeIndexM :: Monad m => Vector (Dual a) -> Int -> m (Dual a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Dual a) -> Vector (Dual a) -> m () # | |
| Unbox a => MVector MVector (Dual a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Dual a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Dual a) -> MVector s (Dual a) # basicOverlaps :: MVector s (Dual a) -> MVector s (Dual a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Dual a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Dual a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Dual a -> m (MVector (PrimState m) (Dual a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> m (Dual a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> Dual a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Dual a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Dual a) -> Dual a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Dual a) -> MVector (PrimState m) (Dual a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Dual a) -> MVector (PrimState m) (Dual a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Dual a) -> Int -> m (MVector (PrimState m) (Dual a)) # | |
| Bounded a => Bounded (Dual a) | Since: base-2.1 |
| Eq a => Eq (Dual a) | Since: base-2.1 |
| Data a => Data (Dual a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Dual a -> c (Dual a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Dual a) # toConstr :: Dual a -> Constr # dataTypeOf :: Dual a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Dual a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Dual a)) # gmapT :: (forall b. Data b => b -> b) -> Dual a -> Dual a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Dual a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Dual a -> r # gmapQ :: (forall d. Data d => d -> u) -> Dual a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Dual a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Dual a -> m (Dual a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Dual a -> m (Dual a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Dual a -> m (Dual a) # | |
| Ord a => Ord (Dual a) | Since: base-2.1 |
| Read a => Read (Dual a) | Since: base-2.1 |
| Show a => Show (Dual a) | Since: base-2.1 |
| Generic (Dual a) | Since: base-4.7.0.0 |
| Semigroup a => Semigroup (Dual a) | Since: base-4.9.0.0 |
| Monoid a => Monoid (Dual a) | Since: base-2.1 |
| NFData a => NFData (Dual a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Default a => Default (Dual a) | |
Defined in Data.Default.Class | |
| Unbox a => Unbox (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Dual a) | |
| Container (Dual a) | |
Defined in Universum.Container.Class Methods toList :: Dual a -> [Element (Dual a)] # foldr :: (Element (Dual a) -> b -> b) -> b -> Dual a -> b # foldl :: (b -> Element (Dual a) -> b) -> b -> Dual a -> b # foldl' :: (b -> Element (Dual a) -> b) -> b -> Dual a -> b # elem :: Element (Dual a) -> Dual a -> Bool # maximum :: Dual a -> Element (Dual a) # minimum :: Dual a -> Element (Dual a) # foldMap :: Monoid m => (Element (Dual a) -> m) -> Dual a -> m # fold :: Dual a -> Element (Dual a) # foldr' :: (Element (Dual a) -> b -> b) -> b -> Dual a -> b # foldr1 :: (Element (Dual a) -> Element (Dual a) -> Element (Dual a)) -> Dual a -> Element (Dual a) # foldl1 :: (Element (Dual a) -> Element (Dual a) -> Element (Dual a)) -> Dual a -> Element (Dual a) # notElem :: Element (Dual a) -> Dual a -> Bool # all :: (Element (Dual a) -> Bool) -> Dual a -> Bool # any :: (Element (Dual a) -> Bool) -> Dual a -> Bool # find :: (Element (Dual a) -> Bool) -> Dual a -> Maybe (Element (Dual a)) # | |
| PMonoid (Dual a) | |
| SMonoid a => SMonoid (Dual a) | |
| PSemigroup (Dual a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Dual a) | |
| Generic1 Dual | Since: base-4.7.0.0 |
| t ~ Dual b => Rewrapped (Dual a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SDual :: Dual a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide a => TestEquality (SDual :: Dual a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI (DualSym0 :: TyFun a (Dual a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091221Sym0 :: TyFun Nat (Dual a6989586621679087483 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680215011Sym0 :: TyFun a6989586621679962808 (Dual a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (DualSym0 :: TyFun a6989586621679087483 (Dual a6989586621679087483) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215076Sym0 :: TyFun (Dual a6989586621680214881) (Dual a6989586621680214881 ~> Dual a6989586621680214881) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetDualSym0 :: TyFun (Dual a6989586621679087483) a6989586621679087483 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206604Sym0 :: TyFun (Dual a6989586621679087483) (Dual a6989586621679087483 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215045Sym0 :: TyFun a6989586621679962805 (Dual b6989586621679962806 ~> Dual a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215076Sym1 a6989586621680215074 :: TyFun (Dual a6989586621680214881) (Dual a6989586621680214881) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215064Sym0 :: TyFun (Dual a6989586621679962832) ((a6989586621679962832 ~> Dual b6989586621679962833) ~> Dual b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206604Sym1 a6989586621680206602 :: TyFun (Dual a6989586621679087483) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091221Sym1 a6989586621681091218 a6989586621679087483 :: TyFun (Dual a6989586621679087483) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215021Sym0 :: TyFun (Dual (a6989586621679962809 ~> b6989586621679962810)) (Dual a6989586621679962809 ~> Dual b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215033Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Dual a6989586621679962803 ~> Dual b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215045Sym1 a6989586621680215043 b6989586621679962806 :: TyFun (Dual b6989586621679962806) (Dual a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215021Sym1 a6989586621680215019 :: TyFun (Dual a6989586621679962809) (Dual b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215033Sym1 a6989586621680215031 :: TyFun (Dual a6989586621679962803) (Dual b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995137Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Dual a6989586621680988964 ~> f6989586621680988963 (Dual b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215064Sym1 a6989586621680215062 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Dual b6989586621679962833) (Dual b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995137Sym1 a6989586621680995135 :: TyFun (Dual a6989586621680988964) (f6989586621680988963 (Dual b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743148Scrutinee_6989586621680742596Sym0 :: TyFun (a ~> (a6989586621680742384 ~> a)) (TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743148Scrutinee_6989586621680742596Sym1 f6989586621680743145 :: TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743148Scrutinee_6989586621680742596Sym2 z6989586621680743146 f6989586621680743145 :: TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| type Rep Dual | |
Defined in Data.Functor.Rep | |
| type Product (a :: Dual k2) | |
| type Sum (a :: Dual k2) | |
| type Minimum (a :: Dual k2) | |
| type Maximum (a :: Dual k2) | |
| type Length (a :: Dual a6989586621680742397) | |
| type Null (a :: Dual a6989586621680742396) | |
| type ToList (a :: Dual a6989586621680742395) | |
| type Fold (arg0 :: Dual m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Dual (m0 a0)) | |
| type SequenceA (arg0 :: Dual (f0 a0)) | |
| type Elem (a1 :: k1) (a2 :: Dual k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Dual k2) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Dual a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Dual b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Dual a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (arg1 :: Dual a0) <* (arg2 :: Dual b0) | |
| type (arg1 :: Dual a0) *> (arg2 :: Dual b0) | |
| type (a1 :: Dual (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Dual a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (arg1 :: Dual a0) >> (arg2 :: Dual b0) | |
| type (a1 :: Dual a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Dual b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Dual a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Dual a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Dual a6989586621680988964) = Apply (Apply (Traverse_6989586621680995137Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Dual a6989586621680988964 ~> f6989586621680988963 (Dual b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (a1 :: k2 ~> (a6989586621680742392 ~> k2)) (a2 :: k2) (a3 :: Dual a6989586621680742392) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Dual a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (a1 :: a6989586621680742387 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Dual a6989586621680742387) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Dual a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Dual a0) (arg3 :: Dual b0) | |
| newtype MVector s (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (DualSym0 :: TyFun a (Dual a) -> Type) (t6989586621680197034 :: a) | |
| type Apply (Pure_6989586621680215011Sym0 :: TyFun a (Dual a) -> Type) (a6989586621680215010 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621681091221Sym0 :: TyFun Nat (Dual a6989586621679087483 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091218 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215045Sym0 :: TyFun a6989586621679962805 (Dual b6989586621679962806 ~> Dual a6989586621679962805) -> Type) (a6989586621680215043 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215045Sym0 :: TyFun a6989586621679962805 (Dual b6989586621679962806 ~> Dual a6989586621679962805) -> Type) (a6989586621680215043 :: a6989586621679962805) = TFHelper_6989586621680215045Sym1 a6989586621680215043 b6989586621679962806 :: TyFun (Dual b6989586621679962806) (Dual a6989586621679962805) -> Type | |
| type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym1 f6989586621680743145 :: TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) (z6989586621680743146 :: k) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym1 f6989586621680743145 :: TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) (z6989586621680743146 :: k) = Let6989586621680743148Scrutinee_6989586621680742596Sym2 f6989586621680743145 z6989586621680743146 :: TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type | |
| type Rep (Dual a) | |
Defined in Data.Semigroup.Internal | |
| newtype Vector (Dual a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Dual a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Element (Dual a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Demote (Dual a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Rep1 Dual | |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg0 :: [Dual a]) | |
| type Show_ (arg0 :: Dual a) | |
| type Sconcat (arg0 :: NonEmpty (Dual a)) | |
| type Mappend (arg1 :: Dual a) (arg2 :: Dual a) | |
| type ShowList (arg1 :: [Dual a]) arg2 | |
| type (a2 :: Dual a1) <> (a3 :: Dual a1) | |
| type Min (arg1 :: Dual a) (arg2 :: Dual a) | |
| type Max (arg1 :: Dual a) (arg2 :: Dual a) | |
| type (arg1 :: Dual a) >= (arg2 :: Dual a) | |
| type (arg1 :: Dual a) > (arg2 :: Dual a) | |
| type (arg1 :: Dual a) <= (arg2 :: Dual a) | |
| type (arg1 :: Dual a) < (arg2 :: Dual a) | |
| type Compare (a2 :: Dual a1) (a3 :: Dual a1) | |
| type (x :: Dual a) /= (y :: Dual a) | |
| type (a2 :: Dual a1) == (b :: Dual a1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a2 (a3 :: Dual a1) a4 | |
| type Apply (GetDualSym0 :: TyFun (Dual a) a -> Type) (a6989586621680197031 :: Dual a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Compare_6989586621680206604Sym1 a6989586621680206602 :: TyFun (Dual a) Ordering -> Type) (a6989586621680206603 :: Dual a) | |
| type Apply (TFHelper_6989586621680215076Sym1 a6989586621680215074 :: TyFun (Dual a) (Dual a) -> Type) (a6989586621680215075 :: Dual a) | |
| type Apply (TFHelper_6989586621680215021Sym1 a6989586621680215019 :: TyFun (Dual a) (Dual b) -> Type) (a6989586621680215020 :: Dual a) | |
| type Apply (Fmap_6989586621680215033Sym1 a6989586621680215031 :: TyFun (Dual a) (Dual b) -> Type) (a6989586621680215032 :: Dual a) | |
| type Apply (TFHelper_6989586621680215045Sym1 a6989586621680215043 b :: TyFun (Dual b) (Dual a) -> Type) (a6989586621680215044 :: Dual b) | |
| type Apply (Traverse_6989586621680995137Sym1 a6989586621680995135 :: TyFun (Dual a) (f (Dual b)) -> Type) (a6989586621680995136 :: Dual a) | |
| type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym2 z6989586621680743146 f6989586621680743145 :: TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) (t6989586621680743147 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym2 z6989586621680743146 f6989586621680743145 :: TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) (t6989586621680743147 :: t6989586621680742381 a6989586621680742384) = Let6989586621680743148Scrutinee_6989586621680742596 z6989586621680743146 f6989586621680743145 t6989586621680743147 | |
| type Apply (Compare_6989586621680206604Sym0 :: TyFun (Dual a6989586621679087483) (Dual a6989586621679087483 ~> Ordering) -> Type) (a6989586621680206602 :: Dual a6989586621679087483) | |
| type Apply (TFHelper_6989586621680215076Sym0 :: TyFun (Dual a6989586621680214881) (Dual a6989586621680214881 ~> Dual a6989586621680214881) -> Type) (a6989586621680215074 :: Dual a6989586621680214881) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215064Sym0 :: TyFun (Dual a6989586621679962832) ((a6989586621679962832 ~> Dual b6989586621679962833) ~> Dual b6989586621679962833) -> Type) (a6989586621680215062 :: Dual a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215064Sym0 :: TyFun (Dual a6989586621679962832) ((a6989586621679962832 ~> Dual b6989586621679962833) ~> Dual b6989586621679962833) -> Type) (a6989586621680215062 :: Dual a6989586621679962832) = TFHelper_6989586621680215064Sym1 a6989586621680215062 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Dual b6989586621679962833) (Dual b6989586621679962833) -> Type | |
| type Apply (ShowsPrec_6989586621681091221Sym1 a6989586621681091218 a6989586621679087483 :: TyFun (Dual a6989586621679087483) (Symbol ~> Symbol) -> Type) (a6989586621681091219 :: Dual a6989586621679087483) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215021Sym0 :: TyFun (Dual (a6989586621679962809 ~> b6989586621679962810)) (Dual a6989586621679962809 ~> Dual b6989586621679962810) -> Type) (a6989586621680215019 :: Dual (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215021Sym0 :: TyFun (Dual (a6989586621679962809 ~> b6989586621679962810)) (Dual a6989586621679962809 ~> Dual b6989586621679962810) -> Type) (a6989586621680215019 :: Dual (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680215021Sym1 a6989586621680215019 | |
| type Apply (TFHelper_6989586621680215064Sym1 a6989586621680215062 b :: TyFun (a ~> Dual b) (Dual b) -> Type) (a6989586621680215063 :: a ~> Dual b) | |
| type Apply (Fmap_6989586621680215033Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Dual a6989586621679962803 ~> Dual b6989586621679962804) -> Type) (a6989586621680215031 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Traverse_6989586621680995137Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Dual a6989586621680988964 ~> f6989586621680988963 (Dual b6989586621680988965)) -> Type) (a6989586621680995135 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995137Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Dual a6989586621680988964 ~> f6989586621680988963 (Dual b6989586621680988965)) -> Type) (a6989586621680995135 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995137Sym1 a6989586621680995135 | |
| type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym0 :: TyFun (a ~> (a6989586621680742384 ~> a)) (TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) -> Type) (f6989586621680743145 :: a ~> (a6989586621680742384 ~> a)) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743148Scrutinee_6989586621680742596Sym0 :: TyFun (a ~> (a6989586621680742384 ~> a)) (TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type) -> Type) (f6989586621680743145 :: a ~> (a6989586621680742384 ~> a)) = Let6989586621680743148Scrutinee_6989586621680742596Sym1 f6989586621680743145 :: TyFun k (TyFun (t6989586621680742381 a6989586621680742384) (Dual (Endo a)) -> Type) -> Type | |
The monoid of endomorphisms under composition.
>>>let computation = Endo ("Hello, " ++) <> Endo (++ "!")>>>appEndo computation "Haskell""Hello, Haskell!"
Instances
| Generic (Endo a) | Since: base-4.7.0.0 |
| Semigroup (Endo a) | Since: base-4.9.0.0 |
| Monoid (Endo a) | Since: base-2.1 |
| Default (Endo a) | |
Defined in Data.Default.Class | |
| Wrapped (Endo a) | |
| t ~ Endo b => Rewrapped (Endo a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep (Endo a) | |
Defined in Data.Semigroup.Internal | |
| type Unwrapped (Endo a) | |
Defined in Control.Lens.Wrapped | |
Boolean monoid under conjunction (&&).
>>>getAll (All True <> mempty <> All False)False
>>>getAll (mconcat (map (\x -> All (even x)) [2,4,6,7,8]))False
Instances
| Bounded All | Since: base-2.1 |
| Eq All | Since: base-2.1 |
| Data All | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> All -> c All # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c All # dataTypeOf :: All -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c All) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c All) # gmapT :: (forall b. Data b => b -> b) -> All -> All # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> All -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> All -> r # gmapQ :: (forall d. Data d => d -> u) -> All -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> All -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> All -> m All # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> All -> m All # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> All -> m All # | |
| Ord All | Since: base-2.1 |
| Read All | Since: base-2.1 |
| Show All | Since: base-2.1 |
| Generic All | Since: base-4.7.0.0 |
| Semigroup All | Since: base-4.9.0.0 |
| Monoid All | Since: base-2.1 |
| NFData All | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Default All | |
Defined in Data.Default.Class | |
| Unbox All | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped All | |
| PMonoid All | |
| SMonoid All | |
| PSemigroup All | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup All | |
| SDecide Bool => TestCoercion SAll | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide Bool => TestEquality SAll | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| Vector Vector All | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) All -> m (Vector All) # basicUnsafeThaw :: PrimMonad m => Vector All -> m (Mutable Vector (PrimState m) All) # basicLength :: Vector All -> Int # basicUnsafeSlice :: Int -> Int -> Vector All -> Vector All # basicUnsafeIndexM :: Monad m => Vector All -> Int -> m All # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) All -> Vector All -> m () # | |
| t ~ All => Rewrapped All t | |
Defined in Control.Lens.Wrapped | |
| MVector MVector All | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s All -> Int # basicUnsafeSlice :: Int -> Int -> MVector s All -> MVector s All # basicOverlaps :: MVector s All -> MVector s All -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) All) # basicInitialize :: PrimMonad m => MVector (PrimState m) All -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> All -> m (MVector (PrimState m) All) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) All -> Int -> m All # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) All -> Int -> All -> m () # basicClear :: PrimMonad m => MVector (PrimState m) All -> m () # basicSet :: PrimMonad m => MVector (PrimState m) All -> All -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) All -> MVector (PrimState m) All -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) All -> MVector (PrimState m) All -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) All -> Int -> m (MVector (PrimState m) All) # | |
| SingI AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SuppressUnusedWarnings AllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings All_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621681091249Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAllSym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680206622Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621680215088Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742866Scrutinee_6989586621680742628Sym0 :: TyFun (t6989586621680742381 Bool) All -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206622Sym1 a6989586621680206620 :: TyFun All Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215088Sym1 a6989586621680215086 :: TyFun All All -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091249Sym1 a6989586621681091246 :: TyFun All (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742834Scrutinee_6989586621680742634Sym1 p6989586621680742832 :: TyFun (t6989586621680742381 a6989586621680742384) All -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| type Rep All | |
Defined in Data.Semigroup.Internal | |
| newtype Vector All | |
| type Unwrapped All | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid type Mempty = Mempty_6989586621680640854Sym0 | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type MaxBound = MaxBound_6989586621680201866Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type MinBound = MinBound_6989586621680201864Sym0 | |
| type Demote All | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mconcat (arg0 :: [All]) | |
| type Show_ (arg0 :: All) | |
| type Sconcat (arg0 :: NonEmpty All) | |
| newtype MVector s All | |
| type Mappend (arg1 :: All) (arg2 :: All) | |
| type ShowList (arg1 :: [All]) arg2 | |
| type (a1 :: All) <> (a2 :: All) | |
| type Min (arg1 :: All) (arg2 :: All) | |
| type Max (arg1 :: All) (arg2 :: All) | |
| type (arg1 :: All) >= (arg2 :: All) | |
| type (arg1 :: All) > (arg2 :: All) | |
| type (arg1 :: All) <= (arg2 :: All) | |
| type (arg1 :: All) < (arg2 :: All) | |
| type Compare (a1 :: All) (a2 :: All) | |
| type (x :: All) /= (y :: All) | |
| type (a :: All) == (b :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a1 (a2 :: All) a3 | |
| type Apply All_Sym0 (a6989586621680229712 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AllSym0 (t6989586621680197047 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAllSym0 (a6989586621680197044 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Compare_6989586621680206622Sym1 a6989586621680206620 :: TyFun All Ordering -> Type) (a6989586621680206621 :: All) | |
| type Apply (TFHelper_6989586621680215088Sym1 a6989586621680215086 :: TyFun All All -> Type) (a6989586621680215087 :: All) | |
| type Apply ShowsPrec_6989586621681091249Sym0 (a6989586621681091246 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply Compare_6989586621680206622Sym0 (a6989586621680206620 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply TFHelper_6989586621680215088Sym0 (a6989586621680215086 :: All) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621681091249Sym1 a6989586621681091246 :: TyFun All (Symbol ~> Symbol) -> Type) (a6989586621681091247 :: All) | |
| type Apply (Let6989586621680742866Scrutinee_6989586621680742628Sym0 :: TyFun (t6989586621680742381 Bool) All -> Type) (x6989586621680742865 :: t6989586621680742381 Bool) | |
| type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym1 p6989586621680742832 :: TyFun (t6989586621680742381 a6989586621680742384) All -> Type) (x6989586621680742833 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym1 p6989586621680742832 :: TyFun (t6989586621680742381 a6989586621680742384) All -> Type) (x6989586621680742833 :: t6989586621680742381 a6989586621680742384) = Let6989586621680742834Scrutinee_6989586621680742634 p6989586621680742832 x6989586621680742833 | |
| type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) (p6989586621680742832 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742834Scrutinee_6989586621680742634Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) All -> Type) -> Type) (p6989586621680742832 :: a6989586621680742384 ~> Bool) = Let6989586621680742834Scrutinee_6989586621680742634Sym1 p6989586621680742832 :: TyFun (t6989586621680742381 a6989586621680742384) All -> Type | |
Boolean monoid under disjunction (||).
>>>getAny (Any True <> mempty <> Any False)True
>>>getAny (mconcat (map (\x -> Any (even x)) [2,4,6,7,8]))True
Instances
| Bounded Any | Since: base-2.1 |
| Eq Any | Since: base-2.1 |
| Data Any | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Any -> c Any # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Any # dataTypeOf :: Any -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Any) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Any) # gmapT :: (forall b. Data b => b -> b) -> Any -> Any # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Any -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Any -> r # gmapQ :: (forall d. Data d => d -> u) -> Any -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Any -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Any -> m Any # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Any -> m Any # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Any -> m Any # | |
| Ord Any | Since: base-2.1 |
| Read Any | Since: base-2.1 |
| Show Any | Since: base-2.1 |
| Generic Any | Since: base-4.7.0.0 |
| Semigroup Any | Since: base-4.9.0.0 |
| Monoid Any | Since: base-2.1 |
| NFData Any | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Default Any | |
Defined in Data.Default.Class | |
| Unbox Any | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped Any | |
| PMonoid Any | |
| SMonoid Any | |
| PSemigroup Any | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup Any | |
| SDecide Bool => TestCoercion SAny | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide Bool => TestEquality SAny | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| Vector Vector Any | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) Any -> m (Vector Any) # basicUnsafeThaw :: PrimMonad m => Vector Any -> m (Mutable Vector (PrimState m) Any) # basicLength :: Vector Any -> Int # basicUnsafeSlice :: Int -> Int -> Vector Any -> Vector Any # basicUnsafeIndexM :: Monad m => Vector Any -> Int -> m Any # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) Any -> Vector Any -> m () # | |
| t ~ Any => Rewrapped Any t | |
Defined in Control.Lens.Wrapped | |
| MVector MVector Any | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s Any -> Int # basicUnsafeSlice :: Int -> Int -> MVector s Any -> MVector s Any # basicOverlaps :: MVector s Any -> MVector s Any -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) Any) # basicInitialize :: PrimMonad m => MVector (PrimState m) Any -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Any -> m (MVector (PrimState m) Any) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) Any -> Int -> m Any # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) Any -> Int -> Any -> m () # basicClear :: PrimMonad m => MVector (PrimState m) Any -> m () # basicSet :: PrimMonad m => MVector (PrimState m) Any -> Any -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) Any -> MVector (PrimState m) Any -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) Any -> MVector (PrimState m) Any -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) Any -> Int -> m (MVector (PrimState m) Any) # | |
| SingI AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SuppressUnusedWarnings AnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Any_Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ShowsPrec_6989586621681091277Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings GetAnySym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings Compare_6989586621680206640Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings TFHelper_6989586621680215100Sym0 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742857Scrutinee_6989586621680742630Sym0 :: TyFun (t6989586621680742381 Bool) Any -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206640Sym1 a6989586621680206638 :: TyFun Any Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215100Sym1 a6989586621680215098 :: TyFun Any Any -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091277Sym1 a6989586621681091274 :: TyFun Any (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680742847Scrutinee_6989586621680742632Sym1 p6989586621680742845 :: TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| type Rep Any | |
Defined in Data.Semigroup.Internal | |
| newtype Vector Any | |
| type Unwrapped Any | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid type Mempty = Mempty_6989586621680640856Sym0 | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type MaxBound = MaxBound_6989586621680201870Sym0 | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type MinBound = MinBound_6989586621680201868Sym0 | |
| type Demote Any | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Mconcat (arg0 :: [Any]) | |
| type Show_ (arg0 :: Any) | |
| type Sconcat (arg0 :: NonEmpty Any) | |
| newtype MVector s Any | |
| type Mappend (arg1 :: Any) (arg2 :: Any) | |
| type ShowList (arg1 :: [Any]) arg2 | |
| type (a1 :: Any) <> (a2 :: Any) | |
| type Min (arg1 :: Any) (arg2 :: Any) | |
| type Max (arg1 :: Any) (arg2 :: Any) | |
| type (arg1 :: Any) >= (arg2 :: Any) | |
| type (arg1 :: Any) > (arg2 :: Any) | |
| type (arg1 :: Any) <= (arg2 :: Any) | |
| type (arg1 :: Any) < (arg2 :: Any) | |
| type Compare (a1 :: Any) (a2 :: Any) | |
| type (x :: Any) /= (y :: Any) | |
| type (a :: Any) == (b :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type ShowsPrec a1 (a2 :: Any) a3 | |
| type Apply Any_Sym0 (a6989586621680229711 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply AnySym0 (t6989586621680197060 :: Bool) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply GetAnySym0 (a6989586621680197057 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Compare_6989586621680206640Sym1 a6989586621680206638 :: TyFun Any Ordering -> Type) (a6989586621680206639 :: Any) | |
| type Apply (TFHelper_6989586621680215100Sym1 a6989586621680215098 :: TyFun Any Any -> Type) (a6989586621680215099 :: Any) | |
| type Apply ShowsPrec_6989586621681091277Sym0 (a6989586621681091274 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply Compare_6989586621680206640Sym0 (a6989586621680206638 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply TFHelper_6989586621680215100Sym0 (a6989586621680215098 :: Any) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621681091277Sym1 a6989586621681091274 :: TyFun Any (Symbol ~> Symbol) -> Type) (a6989586621681091275 :: Any) | |
| type Apply (Let6989586621680742857Scrutinee_6989586621680742630Sym0 :: TyFun (t6989586621680742381 Bool) Any -> Type) (x6989586621680742856 :: t6989586621680742381 Bool) | |
| type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym1 p6989586621680742845 :: TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) (x6989586621680742846 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym1 p6989586621680742845 :: TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) (x6989586621680742846 :: t6989586621680742381 a6989586621680742384) = Let6989586621680742847Scrutinee_6989586621680742632 p6989586621680742845 x6989586621680742846 | |
| type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) (p6989586621680742845 :: a6989586621680742384 ~> Bool) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680742847Scrutinee_6989586621680742632Sym0 :: TyFun (a6989586621680742384 ~> Bool) (TyFun (t6989586621680742381 a6989586621680742384) Any -> Type) -> Type) (p6989586621680742845 :: a6989586621680742384 ~> Bool) = Let6989586621680742847Scrutinee_6989586621680742632Sym1 p6989586621680742845 :: TyFun (t6989586621680742381 a6989586621680742384) Any -> Type | |
Monoid under addition.
>>>getSum (Sum 1 <> Sum 2 <> mempty)3
Instances
| Monad Sum | Since: base-4.8.0.0 |
| Functor Sum | Since: base-4.8.0.0 |
| Applicative Sum | Since: base-4.8.0.0 |
| Foldable Sum | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Sum m -> m # foldMap :: Monoid m => (a -> m) -> Sum a -> m # foldMap' :: Monoid m => (a -> m) -> Sum a -> m # foldr :: (a -> b -> b) -> b -> Sum a -> b # foldr' :: (a -> b -> b) -> b -> Sum a -> b # foldl :: (b -> a -> b) -> b -> Sum a -> b # foldl' :: (b -> a -> b) -> b -> Sum a -> b # foldr1 :: (a -> a -> a) -> Sum a -> a # foldl1 :: (a -> a -> a) -> Sum a -> a # elem :: Eq a => a -> Sum a -> Bool # maximum :: Ord a => Sum a -> a # | |
| Traversable Sum | Since: base-4.8.0.0 |
| Representable Sum | |
| NFData1 Sum | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable Sum | |
| STraversable Sum | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Sum a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Sum (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Sum a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: Sum (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable Sum | |
| SFoldable Sum | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Sum m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Sum a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Sum a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Sum a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: Sum a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Sum a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Sum a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Sum a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Sum a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Sum a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Sum a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Sum a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| Unbox a => Vector Vector (Sum a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Sum a) -> m (Vector (Sum a)) # basicUnsafeThaw :: PrimMonad m => Vector (Sum a) -> m (Mutable Vector (PrimState m) (Sum a)) # basicLength :: Vector (Sum a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Sum a) -> Vector (Sum a) # basicUnsafeIndexM :: Monad m => Vector (Sum a) -> Int -> m (Sum a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Sum a) -> Vector (Sum a) -> m () # | |
| Unbox a => MVector MVector (Sum a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Sum a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Sum a) -> MVector s (Sum a) # basicOverlaps :: MVector s (Sum a) -> MVector s (Sum a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Sum a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Sum a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Sum a -> m (MVector (PrimState m) (Sum a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> m (Sum a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> Sum a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Sum a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Sum a) -> Sum a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Sum a) -> MVector (PrimState m) (Sum a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Sum a) -> MVector (PrimState m) (Sum a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Sum a) -> Int -> m (MVector (PrimState m) (Sum a)) # | |
| Bounded a => Bounded (Sum a) | Since: base-2.1 |
| Eq a => Eq (Sum a) | Since: base-2.1 |
| Data a => Data (Sum a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Sum a -> c (Sum a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Sum a) # dataTypeOf :: Sum a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Sum a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Sum a)) # gmapT :: (forall b. Data b => b -> b) -> Sum a -> Sum a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Sum a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Sum a -> r # gmapQ :: (forall d. Data d => d -> u) -> Sum a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Sum a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Sum a -> m (Sum a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum a -> m (Sum a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Sum a -> m (Sum a) # | |
| Num a => Num (Sum a) | Since: base-4.7.0.0 |
| Ord a => Ord (Sum a) | Since: base-2.1 |
| Read a => Read (Sum a) | Since: base-2.1 |
| Show a => Show (Sum a) | Since: base-2.1 |
| Generic (Sum a) | Since: base-4.7.0.0 |
| Num a => Semigroup (Sum a) | Since: base-4.9.0.0 |
| Num a => Monoid (Sum a) | Since: base-2.1 |
| NFData a => NFData (Sum a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Num a => Default (Sum a) | |
Defined in Data.Default.Class | |
| Unbox a => Unbox (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Sum a) | |
| Container (Sum a) | |
Defined in Universum.Container.Class Methods toList :: Sum a -> [Element (Sum a)] # foldr :: (Element (Sum a) -> b -> b) -> b -> Sum a -> b # foldl :: (b -> Element (Sum a) -> b) -> b -> Sum a -> b # foldl' :: (b -> Element (Sum a) -> b) -> b -> Sum a -> b # elem :: Element (Sum a) -> Sum a -> Bool # maximum :: Sum a -> Element (Sum a) # minimum :: Sum a -> Element (Sum a) # foldMap :: Monoid m => (Element (Sum a) -> m) -> Sum a -> m # fold :: Sum a -> Element (Sum a) # foldr' :: (Element (Sum a) -> b -> b) -> b -> Sum a -> b # foldr1 :: (Element (Sum a) -> Element (Sum a) -> Element (Sum a)) -> Sum a -> Element (Sum a) # foldl1 :: (Element (Sum a) -> Element (Sum a) -> Element (Sum a)) -> Sum a -> Element (Sum a) # notElem :: Element (Sum a) -> Sum a -> Bool # all :: (Element (Sum a) -> Bool) -> Sum a -> Bool # any :: (Element (Sum a) -> Bool) -> Sum a -> Bool # find :: (Element (Sum a) -> Bool) -> Sum a -> Maybe (Element (Sum a)) # | |
| PMonoid (Sum a) | |
| SNum a => SMonoid (Sum a) | |
| PSemigroup (Sum a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SNum a => SSemigroup (Sum a) | |
| Generic1 Sum | Since: base-4.7.0.0 |
| t ~ Sum b => Rewrapped (Sum a) t | |
Defined in Control.Lens.Wrapped | |
| IsoHKD Sum (a :: Type) | Work with values of type |
| SDecide a => TestCoercion (SSum :: Sum a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide a => TestEquality (SSum :: Sum a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI (SumSym0 :: TyFun a (Sum a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SuppressUnusedWarnings (FromInteger_6989586621680215244Sym0 :: TyFun Nat (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091308Sym0 :: TyFun Nat (Sum a6989586621679087460 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sum_Sym0 :: TyFun a6989586621680230075 (Sum a6989586621680230075) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SumSym0 :: TyFun a6989586621679087460 (Sum a6989586621679087460) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680215111Sym0 :: TyFun a6989586621679962808 (Sum a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215212Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215200Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215188Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215176Sym0 :: TyFun (Sum a6989586621680214892) (Sum a6989586621680214892 ~> Sum a6989586621680214892) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680215237Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680215223Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetSumSym0 :: TyFun (Sum a6989586621679087460) a6989586621679087460 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206661Sym0 :: TyFun (Sum a6989586621679087460) (Sum a6989586621679087460 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680215230Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743339Scrutinee_6989586621680742622Sym0 :: TyFun (t6989586621680742381 a6989586621680742384) (Sum a6989586621680742384) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215145Sym0 :: TyFun a6989586621679962805 (Sum b6989586621679962806 ~> Sum a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215212Sym1 a6989586621680215210 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215200Sym1 a6989586621680215198 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215188Sym1 a6989586621680215186 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215176Sym1 a6989586621680215174 :: TyFun (Sum a6989586621680214892) (Sum a6989586621680214892) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215164Sym0 :: TyFun (Sum a6989586621679962832) ((a6989586621679962832 ~> Sum b6989586621679962833) ~> Sum b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206661Sym1 a6989586621680206659 :: TyFun (Sum a6989586621679087460) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091308Sym1 a6989586621681091305 a6989586621679087460 :: TyFun (Sum a6989586621679087460) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215121Sym0 :: TyFun (Sum (a6989586621679962809 ~> b6989586621679962810)) (Sum a6989586621679962809 ~> Sum b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215133Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Sum a6989586621679962803 ~> Sum b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215145Sym1 a6989586621680215143 b6989586621679962806 :: TyFun (Sum b6989586621679962806) (Sum a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215121Sym1 a6989586621680215119 :: TyFun (Sum a6989586621679962809) (Sum b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215133Sym1 a6989586621680215131 :: TyFun (Sum a6989586621679962803) (Sum b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995149Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Sum a6989586621680988964 ~> f6989586621680988963 (Sum b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215164Sym1 a6989586621680215162 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Sum b6989586621679962833) (Sum b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995149Sym1 a6989586621680995147 :: TyFun (Sum a6989586621680988964) (f6989586621680988963 (Sum b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| type Rep Sum | |
Defined in Data.Functor.Rep | |
| type Product (a :: Sum k2) | |
| type Sum (a :: Sum k2) | |
| type Minimum (a :: Sum k2) | |
| type Maximum (a :: Sum k2) | |
| type Length (a :: Sum a6989586621680742397) | |
| type Null (a :: Sum a6989586621680742396) | |
| type ToList (a :: Sum a6989586621680742395) | |
| type Fold (arg0 :: Sum m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Sum (m0 a0)) | |
| type SequenceA (arg0 :: Sum (f0 a0)) | |
| type Elem (a1 :: k1) (a2 :: Sum k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Sum k2) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Sum a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Sum b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Sum a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (arg1 :: Sum a0) <* (arg2 :: Sum b0) | |
| type (arg1 :: Sum a0) *> (arg2 :: Sum b0) | |
| type (a1 :: Sum (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Sum a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (arg1 :: Sum a0) >> (arg2 :: Sum b0) | |
| type (a1 :: Sum a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Sum b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Sum a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Sum a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Sum a6989586621680988964) = Apply (Apply (Traverse_6989586621680995149Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Sum a6989586621680988964 ~> f6989586621680988963 (Sum b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (a1 :: k2 ~> (a6989586621680742392 ~> k2)) (a2 :: k2) (a3 :: Sum a6989586621680742392) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Sum a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (a1 :: a6989586621680742387 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Sum a6989586621680742387) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Sum a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Sum a0) (arg3 :: Sum b0) | |
| newtype MVector s (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621680215244Sym0 :: TyFun Nat (Sum a6989586621680214895) -> Type) (a6989586621680215243 :: Nat) | |
| type Apply (SumSym0 :: TyFun a (Sum a) -> Type) (t6989586621680197079 :: a) | |
| type Apply (Pure_6989586621680215111Sym0 :: TyFun a (Sum a) -> Type) (a6989586621680215110 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Sum_Sym0 :: TyFun a (Sum a) -> Type) (a6989586621680229710 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621681091308Sym0 :: TyFun Nat (Sum a6989586621679087460 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091305 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215145Sym0 :: TyFun a6989586621679962805 (Sum b6989586621679962806 ~> Sum a6989586621679962805) -> Type) (a6989586621680215143 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215145Sym0 :: TyFun a6989586621679962805 (Sum b6989586621679962806 ~> Sum a6989586621679962805) -> Type) (a6989586621680215143 :: a6989586621679962805) = TFHelper_6989586621680215145Sym1 a6989586621680215143 b6989586621679962806 :: TyFun (Sum b6989586621679962806) (Sum a6989586621679962805) -> Type | |
| type Rep (Sum a) | |
Defined in Data.Semigroup.Internal | |
| newtype Vector (Sum a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Sum a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Element (Sum a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Demote (Sum a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Rep1 Sum | |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg0 :: [Sum a]) | |
| type Show_ (arg0 :: Sum a) | |
| type Sconcat (arg0 :: NonEmpty (Sum a)) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Signum (a2 :: Sum a1) | |
| type Abs (a2 :: Sum a1) | |
| type Negate (a2 :: Sum a1) | |
| type Mappend (arg1 :: Sum a) (arg2 :: Sum a) | |
| type ShowList (arg1 :: [Sum a]) arg2 | |
| type (a2 :: Sum a1) <> (a3 :: Sum a1) | |
| type (a2 :: Sum a1) * (a3 :: Sum a1) | |
| type (a2 :: Sum a1) - (a3 :: Sum a1) | |
| type (a2 :: Sum a1) + (a3 :: Sum a1) | |
| type Min (arg1 :: Sum a) (arg2 :: Sum a) | |
| type Max (arg1 :: Sum a) (arg2 :: Sum a) | |
| type (arg1 :: Sum a) >= (arg2 :: Sum a) | |
| type (arg1 :: Sum a) > (arg2 :: Sum a) | |
| type (arg1 :: Sum a) <= (arg2 :: Sum a) | |
| type (arg1 :: Sum a) < (arg2 :: Sum a) | |
| type Compare (a2 :: Sum a1) (a3 :: Sum a1) | |
| type (x :: Sum a) /= (y :: Sum a) | |
| type (a2 :: Sum a1) == (b :: Sum a1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type HKD Sum (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Sum a1) a4 | |
| type Apply (GetSumSym0 :: TyFun (Sum a) a -> Type) (a6989586621680197076 :: Sum a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Compare_6989586621680206661Sym1 a6989586621680206659 :: TyFun (Sum a) Ordering -> Type) (a6989586621680206660 :: Sum a) | |
| type Apply (Negate_6989586621680215223Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215222 :: Sum a) | |
| type Apply (Abs_6989586621680215230Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215229 :: Sum a) | |
| type Apply (Signum_6989586621680215237Sym0 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215236 :: Sum a) | |
| type Apply (Let6989586621680743339Scrutinee_6989586621680742622Sym0 :: TyFun (t6989586621680742381 a6989586621680742384) (Sum a6989586621680742384) -> Type) (x6989586621680743338 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Apply (TFHelper_6989586621680215176Sym1 a6989586621680215174 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215175 :: Sum a) | |
| type Apply (TFHelper_6989586621680215188Sym1 a6989586621680215186 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215187 :: Sum a) | |
| type Apply (TFHelper_6989586621680215200Sym1 a6989586621680215198 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215199 :: Sum a) | |
| type Apply (TFHelper_6989586621680215212Sym1 a6989586621680215210 :: TyFun (Sum a) (Sum a) -> Type) (a6989586621680215211 :: Sum a) | |
| type Apply (TFHelper_6989586621680215121Sym1 a6989586621680215119 :: TyFun (Sum a) (Sum b) -> Type) (a6989586621680215120 :: Sum a) | |
| type Apply (Fmap_6989586621680215133Sym1 a6989586621680215131 :: TyFun (Sum a) (Sum b) -> Type) (a6989586621680215132 :: Sum a) | |
| type Apply (TFHelper_6989586621680215145Sym1 a6989586621680215143 b :: TyFun (Sum b) (Sum a) -> Type) (a6989586621680215144 :: Sum b) | |
| type Apply (Traverse_6989586621680995149Sym1 a6989586621680995147 :: TyFun (Sum a) (f (Sum b)) -> Type) (a6989586621680995148 :: Sum a) | |
| type Apply (Compare_6989586621680206661Sym0 :: TyFun (Sum a6989586621679087460) (Sum a6989586621679087460 ~> Ordering) -> Type) (a6989586621680206659 :: Sum a6989586621679087460) | |
| type Apply (TFHelper_6989586621680215176Sym0 :: TyFun (Sum a6989586621680214892) (Sum a6989586621680214892 ~> Sum a6989586621680214892) -> Type) (a6989586621680215174 :: Sum a6989586621680214892) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215188Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) (a6989586621680215186 :: Sum a6989586621680214895) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215200Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) (a6989586621680215198 :: Sum a6989586621680214895) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215212Sym0 :: TyFun (Sum a6989586621680214895) (Sum a6989586621680214895 ~> Sum a6989586621680214895) -> Type) (a6989586621680215210 :: Sum a6989586621680214895) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215164Sym0 :: TyFun (Sum a6989586621679962832) ((a6989586621679962832 ~> Sum b6989586621679962833) ~> Sum b6989586621679962833) -> Type) (a6989586621680215162 :: Sum a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215164Sym0 :: TyFun (Sum a6989586621679962832) ((a6989586621679962832 ~> Sum b6989586621679962833) ~> Sum b6989586621679962833) -> Type) (a6989586621680215162 :: Sum a6989586621679962832) = TFHelper_6989586621680215164Sym1 a6989586621680215162 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Sum b6989586621679962833) (Sum b6989586621679962833) -> Type | |
| type Apply (ShowsPrec_6989586621681091308Sym1 a6989586621681091305 a6989586621679087460 :: TyFun (Sum a6989586621679087460) (Symbol ~> Symbol) -> Type) (a6989586621681091306 :: Sum a6989586621679087460) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215121Sym0 :: TyFun (Sum (a6989586621679962809 ~> b6989586621679962810)) (Sum a6989586621679962809 ~> Sum b6989586621679962810) -> Type) (a6989586621680215119 :: Sum (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215121Sym0 :: TyFun (Sum (a6989586621679962809 ~> b6989586621679962810)) (Sum a6989586621679962809 ~> Sum b6989586621679962810) -> Type) (a6989586621680215119 :: Sum (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680215121Sym1 a6989586621680215119 | |
| type Apply (TFHelper_6989586621680215164Sym1 a6989586621680215162 b :: TyFun (a ~> Sum b) (Sum b) -> Type) (a6989586621680215163 :: a ~> Sum b) | |
| type Apply (Fmap_6989586621680215133Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Sum a6989586621679962803 ~> Sum b6989586621679962804) -> Type) (a6989586621680215131 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Traverse_6989586621680995149Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Sum a6989586621680988964 ~> f6989586621680988963 (Sum b6989586621680988965)) -> Type) (a6989586621680995147 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995149Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Sum a6989586621680988964 ~> f6989586621680988963 (Sum b6989586621680988965)) -> Type) (a6989586621680995147 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995149Sym1 a6989586621680995147 | |
Monoid under multiplication.
>>>getProduct (Product 3 <> Product 4 <> mempty)12
Constructors
| Product | |
Fields
| |
Instances
| Monad Product | Since: base-4.8.0.0 |
| Functor Product | Since: base-4.8.0.0 |
| Applicative Product | Since: base-4.8.0.0 |
| Foldable Product | Since: base-4.8.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Product m -> m # foldMap :: Monoid m => (a -> m) -> Product a -> m # foldMap' :: Monoid m => (a -> m) -> Product a -> m # foldr :: (a -> b -> b) -> b -> Product a -> b # foldr' :: (a -> b -> b) -> b -> Product a -> b # foldl :: (b -> a -> b) -> b -> Product a -> b # foldl' :: (b -> a -> b) -> b -> Product a -> b # foldr1 :: (a -> a -> a) -> Product a -> a # foldl1 :: (a -> a -> a) -> Product a -> a # elem :: Eq a => a -> Product a -> Bool # maximum :: Ord a => Product a -> a # minimum :: Ord a => Product a -> a # | |
| Traversable Product | Since: base-4.8.0.0 |
| Representable Product | |
| NFData1 Product | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable Product | |
| STraversable Product | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: Product a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: Product (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: Product a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: Product (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable Product | |
| SFoldable Product | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: Product m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: Product a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: Product a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: Product a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: Product a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: Product a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: Product a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: Product a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: Product a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: Product a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: Product a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: Product a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| Unbox a => Vector Vector (Product a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Product a) -> m (Vector (Product a)) # basicUnsafeThaw :: PrimMonad m => Vector (Product a) -> m (Mutable Vector (PrimState m) (Product a)) # basicLength :: Vector (Product a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Product a) -> Vector (Product a) # basicUnsafeIndexM :: Monad m => Vector (Product a) -> Int -> m (Product a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Product a) -> Vector (Product a) -> m () # | |
| Unbox a => MVector MVector (Product a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Product a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Product a) -> MVector s (Product a) # basicOverlaps :: MVector s (Product a) -> MVector s (Product a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Product a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Product a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Product a -> m (MVector (PrimState m) (Product a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> m (Product a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> Product a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Product a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Product a) -> Product a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Product a) -> MVector (PrimState m) (Product a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Product a) -> MVector (PrimState m) (Product a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Product a) -> Int -> m (MVector (PrimState m) (Product a)) # | |
| Bounded a => Bounded (Product a) | Since: base-2.1 |
| Eq a => Eq (Product a) | Since: base-2.1 |
| Data a => Data (Product a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Product a -> c (Product a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Product a) # toConstr :: Product a -> Constr # dataTypeOf :: Product a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Product a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Product a)) # gmapT :: (forall b. Data b => b -> b) -> Product a -> Product a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Product a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Product a -> r # gmapQ :: (forall d. Data d => d -> u) -> Product a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Product a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Product a -> m (Product a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Product a -> m (Product a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Product a -> m (Product a) # | |
| Num a => Num (Product a) | Since: base-4.7.0.0 |
Defined in Data.Semigroup.Internal | |
| Ord a => Ord (Product a) | Since: base-2.1 |
| Read a => Read (Product a) | Since: base-2.1 |
| Show a => Show (Product a) | Since: base-2.1 |
| Generic (Product a) | Since: base-4.7.0.0 |
| Num a => Semigroup (Product a) | Since: base-4.9.0.0 |
| Num a => Monoid (Product a) | Since: base-2.1 |
| NFData a => NFData (Product a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Num a => Default (Product a) | |
Defined in Data.Default.Class | |
| Unbox a => Unbox (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Product a) | |
| Container (Product a) | |
Defined in Universum.Container.Class Methods toList :: Product a -> [Element (Product a)] # foldr :: (Element (Product a) -> b -> b) -> b -> Product a -> b # foldl :: (b -> Element (Product a) -> b) -> b -> Product a -> b # foldl' :: (b -> Element (Product a) -> b) -> b -> Product a -> b # elem :: Element (Product a) -> Product a -> Bool # maximum :: Product a -> Element (Product a) # minimum :: Product a -> Element (Product a) # foldMap :: Monoid m => (Element (Product a) -> m) -> Product a -> m # fold :: Product a -> Element (Product a) # foldr' :: (Element (Product a) -> b -> b) -> b -> Product a -> b # foldr1 :: (Element (Product a) -> Element (Product a) -> Element (Product a)) -> Product a -> Element (Product a) # foldl1 :: (Element (Product a) -> Element (Product a) -> Element (Product a)) -> Product a -> Element (Product a) # notElem :: Element (Product a) -> Product a -> Bool # all :: (Element (Product a) -> Bool) -> Product a -> Bool # any :: (Element (Product a) -> Bool) -> Product a -> Bool # find :: (Element (Product a) -> Bool) -> Product a -> Maybe (Element (Product a)) # | |
| PMonoid (Product a) | |
| SNum a => SMonoid (Product a) | |
| PSemigroup (Product a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SNum a => SSemigroup (Product a) | |
| Generic1 Product | Since: base-4.7.0.0 |
| t ~ Product b => Rewrapped (Product a) t | |
Defined in Control.Lens.Wrapped | |
| IsoHKD Product (a :: Type) | Work with values of type |
| SDecide a => TestCoercion (SProduct :: Product a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SDecide a => TestEquality (SProduct :: Product a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SingI (ProductSym0 :: TyFun a (Product a) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing ProductSym0 # | |
| SuppressUnusedWarnings (FromInteger_6989586621680215384Sym0 :: TyFun Nat (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091339Sym0 :: TyFun Nat (Product a6989586621679087468 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680215251Sym0 :: TyFun a6989586621679962808 (Product a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Product_Sym0 :: TyFun a6989586621680230083 (Product a6989586621680230083) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ProductSym0 :: TyFun a6989586621679087468 (Product a6989586621679087468) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215352Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215340Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215328Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215316Sym0 :: TyFun (Product a6989586621680214910) (Product a6989586621680214910 ~> Product a6989586621680214910) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Signum_6989586621680215377Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Negate_6989586621680215363Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (GetProductSym0 :: TyFun (Product a6989586621679087468) a6989586621679087468 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206682Sym0 :: TyFun (Product a6989586621679087468) (Product a6989586621679087468 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Abs_6989586621680215370Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680743352Scrutinee_6989586621680742625Sym0 :: TyFun (t6989586621680742381 a6989586621680742384) (Product a6989586621680742384) -> Type) | |
Defined in Data.Singletons.Prelude.Foldable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215285Sym0 :: TyFun a6989586621679962805 (Product b6989586621679962806 ~> Product a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215352Sym1 a6989586621680215350 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215340Sym1 a6989586621680215338 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215328Sym1 a6989586621680215326 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215316Sym1 a6989586621680215314 :: TyFun (Product a6989586621680214910) (Product a6989586621680214910) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215304Sym0 :: TyFun (Product a6989586621679962832) ((a6989586621679962832 ~> Product b6989586621679962833) ~> Product b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621680206682Sym1 a6989586621680206680 :: TyFun (Product a6989586621679087468) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621681091339Sym1 a6989586621681091336 a6989586621679087468 :: TyFun (Product a6989586621679087468) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215261Sym0 :: TyFun (Product (a6989586621679962809 ~> b6989586621679962810)) (Product a6989586621679962809 ~> Product b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215273Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Product a6989586621679962803 ~> Product b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215285Sym1 a6989586621680215283 b6989586621679962806 :: TyFun (Product b6989586621679962806) (Product a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215261Sym1 a6989586621680215259 :: TyFun (Product a6989586621679962809) (Product b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680215273Sym1 a6989586621680215271 :: TyFun (Product a6989586621679962803) (Product b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995161Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Product a6989586621680988964 ~> f6989586621680988963 (Product b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680215304Sym1 a6989586621680215302 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Product b6989586621679962833) (Product b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995161Sym1 a6989586621680995159 :: TyFun (Product a6989586621680988964) (f6989586621680988963 (Product b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| type Rep Product | |
Defined in Data.Functor.Rep | |
| type Product (a :: Product k2) | |
| type Sum (a :: Product k2) | |
| type Minimum (a :: Product k2) | |
| type Maximum (a :: Product k2) | |
| type Length (a :: Product a6989586621680742397) | |
| type Null (a :: Product a6989586621680742396) | |
| type ToList (a :: Product a6989586621680742395) | |
| type Fold (arg0 :: Product m0) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: Product (m0 a0)) | |
| type SequenceA (arg0 :: Product (f0 a0)) | |
| type Elem (a1 :: k1) (a2 :: Product k1) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: Product k2) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: Product a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: Product b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Product a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type (arg1 :: Product a0) <* (arg2 :: Product b0) | |
| type (arg1 :: Product a0) *> (arg2 :: Product b0) | |
| type (a1 :: Product (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Product a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (a1 :: Product (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Product a6989586621679962809) = Apply (Apply (TFHelper_6989586621680215261Sym0 :: TyFun (Product (a6989586621679962809 ~> b6989586621679962810)) (Product a6989586621679962809 ~> Product b6989586621679962810) -> Type) a1) a2 | |
| type (arg1 :: Product a0) >> (arg2 :: Product b0) | |
| type (a1 :: Product a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Product b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type (a1 :: Product a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Product b6989586621679962833) = Apply (Apply (TFHelper_6989586621680215304Sym0 :: TyFun (Product a6989586621679962832) ((a6989586621679962832 ~> Product b6989586621679962833) ~> Product b6989586621679962833) -> Type) a1) a2 | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: Product a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Product a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: Product a6989586621680988964) = Apply (Apply (Traverse_6989586621680995161Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Product a6989586621680988964 ~> f6989586621680988963 (Product b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (a1 :: k2 ~> (a6989586621680742392 ~> k2)) (a2 :: k2) (a3 :: Product a6989586621680742392) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: Product a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (a1 :: a6989586621680742387 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Product a6989586621680742387) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: Product a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Product a0) (arg3 :: Product b0) | |
| newtype MVector s (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (FromInteger_6989586621680215384Sym0 :: TyFun Nat (Product a6989586621680214913) -> Type) (a6989586621680215383 :: Nat) | |
| type Apply (ProductSym0 :: TyFun a (Product a) -> Type) (t6989586621680197098 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Pure_6989586621680215251Sym0 :: TyFun a (Product a) -> Type) (a6989586621680215250 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Product_Sym0 :: TyFun a (Product a) -> Type) (a6989586621680229709 :: a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (ShowsPrec_6989586621681091339Sym0 :: TyFun Nat (Product a6989586621679087468 ~> (Symbol ~> Symbol)) -> Type) (a6989586621681091336 :: Nat) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215285Sym0 :: TyFun a6989586621679962805 (Product b6989586621679962806 ~> Product a6989586621679962805) -> Type) (a6989586621680215283 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215285Sym0 :: TyFun a6989586621679962805 (Product b6989586621679962806 ~> Product a6989586621679962805) -> Type) (a6989586621680215283 :: a6989586621679962805) = TFHelper_6989586621680215285Sym1 a6989586621680215283 b6989586621679962806 :: TyFun (Product b6989586621679962806) (Product a6989586621679962805) -> Type | |
| type Rep (Product a) | |
Defined in Data.Semigroup.Internal | |
| newtype Vector (Product a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Product a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Element (Product a) | |
Defined in Universum.Container.Class | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type MaxBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type MinBound | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Demote (Product a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Rep1 Product | |
Defined in Data.Semigroup.Internal | |
| type Mconcat (arg0 :: [Product a]) | |
| type Show_ (arg0 :: Product a) | |
| type Sconcat (arg0 :: NonEmpty (Product a)) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Signum (a2 :: Product a1) | |
| type Abs (a2 :: Product a1) | |
| type Negate (a2 :: Product a1) | |
| type Mappend (arg1 :: Product a) (arg2 :: Product a) | |
| type ShowList (arg1 :: [Product a]) arg2 | |
| type (a2 :: Product a1) <> (a3 :: Product a1) | |
| type (a2 :: Product a1) * (a3 :: Product a1) | |
| type (a2 :: Product a1) - (a3 :: Product a1) | |
| type (a2 :: Product a1) + (a3 :: Product a1) | |
| type Min (arg1 :: Product a) (arg2 :: Product a) | |
| type Max (arg1 :: Product a) (arg2 :: Product a) | |
| type (arg1 :: Product a) >= (arg2 :: Product a) | |
| type (arg1 :: Product a) > (arg2 :: Product a) | |
| type (arg1 :: Product a) <= (arg2 :: Product a) | |
| type (arg1 :: Product a) < (arg2 :: Product a) | |
| type Compare (a2 :: Product a1) (a3 :: Product a1) | |
| type (x :: Product a) /= (y :: Product a) | |
| type (a2 :: Product a1) == (b :: Product a1) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type HKD Product (a :: Type) | |
Defined in Data.Vinyl.XRec | |
| type ShowsPrec a2 (a3 :: Product a1) a4 | |
| type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621680197095 :: Product a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (GetProductSym0 :: TyFun (Product a) a -> Type) (a6989586621680197095 :: Product a) = GetProduct a6989586621680197095 | |
| type Apply (Compare_6989586621680206682Sym1 a6989586621680206680 :: TyFun (Product a) Ordering -> Type) (a6989586621680206681 :: Product a) | |
| type Apply (Negate_6989586621680215363Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215362 :: Product a) | |
| type Apply (Abs_6989586621680215370Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215369 :: Product a) | |
| type Apply (Signum_6989586621680215377Sym0 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215376 :: Product a) | |
| type Apply (Let6989586621680743352Scrutinee_6989586621680742625Sym0 :: TyFun (t6989586621680742381 a6989586621680742384) (Product a6989586621680742384) -> Type) (x6989586621680743351 :: t6989586621680742381 a6989586621680742384) | |
Defined in Data.Singletons.Prelude.Foldable type Apply (Let6989586621680743352Scrutinee_6989586621680742625Sym0 :: TyFun (t6989586621680742381 a6989586621680742384) (Product a6989586621680742384) -> Type) (x6989586621680743351 :: t6989586621680742381 a6989586621680742384) = Let6989586621680743352Scrutinee_6989586621680742625 x6989586621680743351 | |
| type Apply (TFHelper_6989586621680215316Sym1 a6989586621680215314 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215315 :: Product a) | |
| type Apply (TFHelper_6989586621680215328Sym1 a6989586621680215326 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215327 :: Product a) | |
| type Apply (TFHelper_6989586621680215340Sym1 a6989586621680215338 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215339 :: Product a) | |
| type Apply (TFHelper_6989586621680215352Sym1 a6989586621680215350 :: TyFun (Product a) (Product a) -> Type) (a6989586621680215351 :: Product a) | |
| type Apply (TFHelper_6989586621680215261Sym1 a6989586621680215259 :: TyFun (Product a) (Product b) -> Type) (a6989586621680215260 :: Product a) | |
| type Apply (Fmap_6989586621680215273Sym1 a6989586621680215271 :: TyFun (Product a) (Product b) -> Type) (a6989586621680215272 :: Product a) | |
| type Apply (TFHelper_6989586621680215285Sym1 a6989586621680215283 b :: TyFun (Product b) (Product a) -> Type) (a6989586621680215284 :: Product b) | |
| type Apply (Traverse_6989586621680995161Sym1 a6989586621680995159 :: TyFun (Product a) (f (Product b)) -> Type) (a6989586621680995160 :: Product a) | |
| type Apply (Compare_6989586621680206682Sym0 :: TyFun (Product a6989586621679087468) (Product a6989586621679087468 ~> Ordering) -> Type) (a6989586621680206680 :: Product a6989586621679087468) | |
| type Apply (TFHelper_6989586621680215316Sym0 :: TyFun (Product a6989586621680214910) (Product a6989586621680214910 ~> Product a6989586621680214910) -> Type) (a6989586621680215314 :: Product a6989586621680214910) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215328Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) (a6989586621680215326 :: Product a6989586621680214913) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215340Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) (a6989586621680215338 :: Product a6989586621680214913) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215352Sym0 :: TyFun (Product a6989586621680214913) (Product a6989586621680214913 ~> Product a6989586621680214913) -> Type) (a6989586621680215350 :: Product a6989586621680214913) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (TFHelper_6989586621680215304Sym0 :: TyFun (Product a6989586621679962832) ((a6989586621679962832 ~> Product b6989586621679962833) ~> Product b6989586621679962833) -> Type) (a6989586621680215302 :: Product a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215304Sym0 :: TyFun (Product a6989586621679962832) ((a6989586621679962832 ~> Product b6989586621679962833) ~> Product b6989586621679962833) -> Type) (a6989586621680215302 :: Product a6989586621679962832) = TFHelper_6989586621680215304Sym1 a6989586621680215302 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Product b6989586621679962833) (Product b6989586621679962833) -> Type | |
| type Apply (ShowsPrec_6989586621681091339Sym1 a6989586621681091336 a6989586621679087468 :: TyFun (Product a6989586621679087468) (Symbol ~> Symbol) -> Type) (a6989586621681091337 :: Product a6989586621679087468) | |
Defined in Data.Singletons.Prelude.Semigroup | |
| type Apply (TFHelper_6989586621680215261Sym0 :: TyFun (Product (a6989586621679962809 ~> b6989586621679962810)) (Product a6989586621679962809 ~> Product b6989586621679962810) -> Type) (a6989586621680215259 :: Product (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal type Apply (TFHelper_6989586621680215261Sym0 :: TyFun (Product (a6989586621679962809 ~> b6989586621679962810)) (Product a6989586621679962809 ~> Product b6989586621679962810) -> Type) (a6989586621680215259 :: Product (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680215261Sym1 a6989586621680215259 | |
| type Apply (TFHelper_6989586621680215304Sym1 a6989586621680215302 b :: TyFun (a ~> Product b) (Product b) -> Type) (a6989586621680215303 :: a ~> Product b) | |
| type Apply (Fmap_6989586621680215273Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Product a6989586621679962803 ~> Product b6989586621679962804) -> Type) (a6989586621680215271 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Traverse_6989586621680995161Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Product a6989586621680988964 ~> f6989586621680988963 (Product b6989586621680988965)) -> Type) (a6989586621680995159 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995161Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (Product a6989586621680988964 ~> f6989586621680988963 (Product b6989586621680988965)) -> Type) (a6989586621680995159 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995161Sym1 a6989586621680995159 | |
newtype Alt (f :: k -> Type) (a :: k) #
Monoid under <|>.
Since: base-4.8.0.0
Instances
| Generic1 (Alt f :: k -> Type) | Since: base-4.8.0.0 |
| Unbox (f a) => Vector Vector (Alt f a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Alt f a) -> m (Vector (Alt f a)) # basicUnsafeThaw :: PrimMonad m => Vector (Alt f a) -> m (Mutable Vector (PrimState m) (Alt f a)) # basicLength :: Vector (Alt f a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Alt f a) -> Vector (Alt f a) # basicUnsafeIndexM :: Monad m => Vector (Alt f a) -> Int -> m (Alt f a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Alt f a) -> Vector (Alt f a) -> m () # | |
| Unbox (f a) => MVector MVector (Alt f a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Alt f a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Alt f a) -> MVector s (Alt f a) # basicOverlaps :: MVector s (Alt f a) -> MVector s (Alt f a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Alt f a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Alt f a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Alt f a -> m (MVector (PrimState m) (Alt f a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> m (Alt f a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> Alt f a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Alt f a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Alt f a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Alt f a) -> MVector (PrimState m) (Alt f a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Alt f a) -> MVector (PrimState m) (Alt f a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Alt f a) -> Int -> m (MVector (PrimState m) (Alt f a)) # | |
| Monad f => Monad (Alt f) | Since: base-4.8.0.0 |
| Functor f => Functor (Alt f) | Since: base-4.8.0.0 |
| Applicative f => Applicative (Alt f) | Since: base-4.8.0.0 |
| Foldable f => Foldable (Alt f) | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Alt f m -> m # foldMap :: Monoid m => (a -> m) -> Alt f a -> m # foldMap' :: Monoid m => (a -> m) -> Alt f a -> m # foldr :: (a -> b -> b) -> b -> Alt f a -> b # foldr' :: (a -> b -> b) -> b -> Alt f a -> b # foldl :: (b -> a -> b) -> b -> Alt f a -> b # foldl' :: (b -> a -> b) -> b -> Alt f a -> b # foldr1 :: (a -> a -> a) -> Alt f a -> a # foldl1 :: (a -> a -> a) -> Alt f a -> a # elem :: Eq a => a -> Alt f a -> Bool # maximum :: Ord a => Alt f a -> a # minimum :: Ord a => Alt f a -> a # | |
| Traversable f => Traversable (Alt f) | Since: base-4.12.0.0 |
| Alternative f => Alternative (Alt f) | Since: base-4.8.0.0 |
| MonadPlus f => MonadPlus (Alt f) | Since: base-4.8.0.0 |
| Enum (f a) => Enum (Alt f a) | Since: base-4.8.0.0 |
| Eq (f a) => Eq (Alt f a) | Since: base-4.8.0.0 |
| (Data (f a), Data a, Typeable f) => Data (Alt f a) | Since: base-4.8.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Alt f a -> c (Alt f a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Alt f a) # toConstr :: Alt f a -> Constr # dataTypeOf :: Alt f a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Alt f a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Alt f a)) # gmapT :: (forall b. Data b => b -> b) -> Alt f a -> Alt f a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Alt f a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Alt f a -> r # gmapQ :: (forall d. Data d => d -> u) -> Alt f a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Alt f a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Alt f a -> m (Alt f a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt f a -> m (Alt f a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Alt f a -> m (Alt f a) # | |
| Num (f a) => Num (Alt f a) | Since: base-4.8.0.0 |
| Ord (f a) => Ord (Alt f a) | Since: base-4.8.0.0 |
Defined in Data.Semigroup.Internal | |
| Read (f a) => Read (Alt f a) | Since: base-4.8.0.0 |
| Show (f a) => Show (Alt f a) | Since: base-4.8.0.0 |
| Generic (Alt f a) | Since: base-4.8.0.0 |
| Alternative f => Semigroup (Alt f a) | Since: base-4.9.0.0 |
| Alternative f => Monoid (Alt f a) | Since: base-4.8.0.0 |
| Unbox (f a) => Unbox (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Alt f a) | |
| t ~ Alt g b => Rewrapped (Alt f a) t | |
Defined in Control.Lens.Wrapped | |
| type Rep1 (Alt f :: k -> Type) | |
Defined in Data.Semigroup.Internal | |
| newtype MVector s (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Rep (Alt f a) | |
Defined in Data.Semigroup.Internal | |
| newtype Vector (Alt f a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Alt f a) | |
Defined in Control.Lens.Wrapped | |
someNatVal :: Natural -> SomeNat #
Convert an integer into an unknown type-level natural.
Since: base-4.10.0.0
This type represents unknown type-level natural numbers.
Since: base-4.10.0.0
unfoldr :: (b -> Maybe (a, b)) -> b -> [a] #
The unfoldr function is a `dual' to foldr: while foldr
reduces a list to a summary value, unfoldr builds a list from
a seed value. The function takes the element and returns Nothing
if it is done producing the list or returns Just (a,b), in which
case, a is a prepended to the list and b is used as the next
element in a recursive call. For example,
iterate f == unfoldr (\x -> Just (x, f x))
In some cases, unfoldr can undo a foldr operation:
unfoldr f' (foldr f z xs) == xs
if the following holds:
f' (f x y) = Just (x,y) f' z = Nothing
A simple use of unfoldr:
>>>unfoldr (\b -> if b == 0 then Nothing else Just (b, b-1)) 10[10,9,8,7,6,5,4,3,2,1]
sortOn :: Ord b => (a -> b) -> [a] -> [a] #
Sort a list by comparing the results of a key function applied to each
element. sortOn f is equivalent to sortBy (comparing f), but has the
performance advantage of only evaluating f once for each element in the
input list. This is called the decorate-sort-undecorate paradigm, or
Schwartzian transform.
Elements are arranged from from lowest to highest, keeping duplicates in the order they appeared in the input.
>>>sortOn fst [(2, "world"), (4, "!"), (1, "Hello")][(1,"Hello"),(2,"world"),(4,"!")]
Since: base-4.8.0.0
The sort function implements a stable sorting algorithm.
It is a special case of sortBy, which allows the programmer to supply
their own comparison function.
Elements are arranged from from lowest to highest, keeping duplicates in the order they appeared in the input.
>>>sort [1,6,4,3,2,5][1,2,3,4,5,6]
permutations :: [a] -> [[a]] #
The permutations function returns the list of all permutations of the argument.
>>>permutations "abc"["abc","bac","cba","bca","cab","acb"]
subsequences :: [a] -> [[a]] #
The subsequences function returns the list of all subsequences of the argument.
>>>subsequences "abc"["","a","b","ab","c","ac","bc","abc"]
group :: Eq a => [a] -> [[a]] #
The group function takes a list and returns a list of lists such
that the concatenation of the result is equal to the argument. Moreover,
each sublist in the result contains only equal elements. For example,
>>>group "Mississippi"["M","i","ss","i","ss","i","pp","i"]
It is a special case of groupBy, which allows the programmer to supply
their own equality test.
genericReplicate :: Integral i => i -> a -> [a] #
The genericReplicate function is an overloaded version of replicate,
which accepts any Integral value as the number of repetitions to make.
genericSplitAt :: Integral i => i -> [a] -> ([a], [a]) #
The genericSplitAt function is an overloaded version of splitAt, which
accepts any Integral value as the position at which to split.
genericDrop :: Integral i => i -> [a] -> [a] #
The genericDrop function is an overloaded version of drop, which
accepts any Integral value as the number of elements to drop.
genericTake :: Integral i => i -> [a] -> [a] #
The genericTake function is an overloaded version of take, which
accepts any Integral value as the number of elements to take.
genericLength :: Num i => [a] -> i #
O(n). The genericLength function is an overloaded version of length.
In particular, instead of returning an Int, it returns any type which is an
instance of Num. It is, however, less efficient than length.
>>>genericLength [1, 2, 3] :: Int3>>>genericLength [1, 2, 3] :: Float3.0
The transpose function transposes the rows and columns of its argument.
For example,
>>>transpose [[1,2,3],[4,5,6]][[1,4],[2,5],[3,6]]
If some of the rows are shorter than the following rows, their elements are skipped:
>>>transpose [[10,11],[20],[],[30,31,32]][[10,20,30],[11,31],[32]]
intercalate :: [a] -> [[a]] -> [a] #
intercalate xs xss is equivalent to (.
It inserts the list concat (intersperse xs xss))xs in between the lists in xss and concatenates the
result.
>>>intercalate ", " ["Lorem", "ipsum", "dolor"]"Lorem, ipsum, dolor"
intersperse :: a -> [a] -> [a] #
O(n). The intersperse function takes an element and a list and
`intersperses' that element between the elements of the list.
For example,
>>>intersperse ',' "abcde""a,b,c,d,e"
isPrefixOf :: Eq a => [a] -> [a] -> Bool #
O(min(m,n)). The isPrefixOf function takes two lists and returns True
iff the first list is a prefix of the second.
>>>"Hello" `isPrefixOf` "Hello World!"True
>>>"Hello" `isPrefixOf` "Wello Horld!"False
readMaybe :: Read a => String -> Maybe a #
Parse a string using the Read instance.
Succeeds if there is exactly one valid result.
>>>readMaybe "123" :: Maybe IntJust 123
>>>readMaybe "hello" :: Maybe IntNothing
Since: base-4.6.0.0
isRight :: Either a b -> Bool #
Return True if the given value is a Right-value, False otherwise.
Examples
Basic usage:
>>>isRight (Left "foo")False>>>isRight (Right 3)True
Assuming a Left value signifies some sort of error, we can use
isRight to write a very simple reporting function that only
outputs "SUCCESS" when a computation has succeeded.
This example shows how isRight might be used to avoid pattern
matching when one does not care about the value contained in the
constructor:
>>>import Control.Monad ( when )>>>let report e = when (isRight e) $ putStrLn "SUCCESS">>>report (Left "parse error")>>>report (Right 1)SUCCESS
Since: base-4.7.0.0
isLeft :: Either a b -> Bool #
Return True if the given value is a Left-value, False otherwise.
Examples
Basic usage:
>>>isLeft (Left "foo")True>>>isLeft (Right 3)False
Assuming a Left value signifies some sort of error, we can use
isLeft to write a very simple error-reporting function that does
absolutely nothing in the case of success, and outputs "ERROR" if
any error occurred.
This example shows how isLeft might be used to avoid pattern
matching when one does not care about the value contained in the
constructor:
>>>import Control.Monad ( when )>>>let report e = when (isLeft e) $ putStrLn "ERROR">>>report (Right 1)>>>report (Left "parse error")ERROR
Since: base-4.7.0.0
partitionEithers :: [Either a b] -> ([a], [b]) #
Partitions a list of Either into two lists.
All the Left elements are extracted, in order, to the first
component of the output. Similarly the Right elements are extracted
to the second component of the output.
Examples
Basic usage:
>>>let list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]>>>partitionEithers list(["foo","bar","baz"],[3,7])
The pair returned by partitionEithers x(:lefts x, rights x)
>>>let list = [ Left "foo", Right 3, Left "bar", Right 7, Left "baz" ]>>>partitionEithers list == (lefts list, rights list)True
comparing :: Ord a => (b -> a) -> b -> b -> Ordering #
comparing p x y = compare (p x) (p y)
Useful combinator for use in conjunction with the xxxBy family
of functions from Data.List, for example:
... sortBy (comparing fst) ...
The Down type allows you to reverse sort order conveniently. A value of type
Down aa (represented as Down aa has an Ordthen sortWith by Down x
Since: base-4.6.0.0
Constructors
| Down a |
Instances
| Monad Down | Since: base-4.11.0.0 |
| Functor Down | Since: base-4.11.0.0 |
| Applicative Down | Since: base-4.11.0.0 |
| Foldable Down | Since: base-4.12.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Down m -> m # foldMap :: Monoid m => (a -> m) -> Down a -> m # foldMap' :: Monoid m => (a -> m) -> Down a -> m # foldr :: (a -> b -> b) -> b -> Down a -> b # foldr' :: (a -> b -> b) -> b -> Down a -> b # foldl :: (b -> a -> b) -> b -> Down a -> b # foldl' :: (b -> a -> b) -> b -> Down a -> b # foldr1 :: (a -> a -> a) -> Down a -> a # foldl1 :: (a -> a -> a) -> Down a -> a # elem :: Eq a => a -> Down a -> Bool # maximum :: Ord a => Down a -> a # | |
| Traversable Down | Since: base-4.12.0.0 |
| NFData1 Down | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Unbox a => Vector Vector (Down a) | |
Defined in Data.Vector.Unboxed.Base Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) (Down a) -> m (Vector (Down a)) # basicUnsafeThaw :: PrimMonad m => Vector (Down a) -> m (Mutable Vector (PrimState m) (Down a)) # basicLength :: Vector (Down a) -> Int # basicUnsafeSlice :: Int -> Int -> Vector (Down a) -> Vector (Down a) # basicUnsafeIndexM :: Monad m => Vector (Down a) -> Int -> m (Down a) # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) (Down a) -> Vector (Down a) -> m () # | |
| Unbox a => MVector MVector (Down a) | |
Defined in Data.Vector.Unboxed.Base Methods basicLength :: MVector s (Down a) -> Int # basicUnsafeSlice :: Int -> Int -> MVector s (Down a) -> MVector s (Down a) # basicOverlaps :: MVector s (Down a) -> MVector s (Down a) -> Bool # basicUnsafeNew :: PrimMonad m => Int -> m (MVector (PrimState m) (Down a)) # basicInitialize :: PrimMonad m => MVector (PrimState m) (Down a) -> m () # basicUnsafeReplicate :: PrimMonad m => Int -> Down a -> m (MVector (PrimState m) (Down a)) # basicUnsafeRead :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> m (Down a) # basicUnsafeWrite :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> Down a -> m () # basicClear :: PrimMonad m => MVector (PrimState m) (Down a) -> m () # basicSet :: PrimMonad m => MVector (PrimState m) (Down a) -> Down a -> m () # basicUnsafeCopy :: PrimMonad m => MVector (PrimState m) (Down a) -> MVector (PrimState m) (Down a) -> m () # basicUnsafeMove :: PrimMonad m => MVector (PrimState m) (Down a) -> MVector (PrimState m) (Down a) -> m () # basicUnsafeGrow :: PrimMonad m => MVector (PrimState m) (Down a) -> Int -> m (MVector (PrimState m) (Down a)) # | |
| Eq a => Eq (Down a) | Since: base-4.6.0.0 |
| Data a => Data (Down a) | Since: base-4.12.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Down a -> c (Down a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Down a) # toConstr :: Down a -> Constr # dataTypeOf :: Down a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Down a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Down a)) # gmapT :: (forall b. Data b => b -> b) -> Down a -> Down a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Down a -> r # gmapQ :: (forall d. Data d => d -> u) -> Down a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Down a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Down a -> m (Down a) # | |
| Num a => Num (Down a) | Since: base-4.11.0.0 |
| Ord a => Ord (Down a) | Since: base-4.6.0.0 |
| Read a => Read (Down a) | Since: base-4.7.0.0 |
| Show a => Show (Down a) | Since: base-4.7.0.0 |
| Generic (Down a) | Since: base-4.12.0.0 |
| Semigroup a => Semigroup (Down a) | Since: base-4.11.0.0 |
| Monoid a => Monoid (Down a) | Since: base-4.11.0.0 |
| NFData a => NFData (Down a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| Unbox a => Unbox (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| Wrapped (Down a) | |
| PMonoid (Down a) | |
| SMonoid a => SMonoid (Down a) | |
| PSemigroup (Down a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup a => SSemigroup (Down a) | |
| PNum (Down a) | |
| SNum a => SNum (Down a) | |
Defined in Data.Singletons.Prelude.Num Methods (%+) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (+@#@$) t1) t2) # (%-) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (-@#@$) t1) t2) # (%*) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*@#@$) t1) t2) # sNegate :: forall (t :: Down a). Sing t -> Sing (Apply NegateSym0 t) # sAbs :: forall (t :: Down a). Sing t -> Sing (Apply AbsSym0 t) # sSignum :: forall (t :: Down a). Sing t -> Sing (Apply SignumSym0 t) # sFromInteger :: forall (t :: Nat). Sing t -> Sing (Apply FromIntegerSym0 t) # | |
| POrd (Down a) | |
| SOrd a => SOrd (Down a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: Down a) (t2 :: Down a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| Generic1 Down | Since: base-4.12.0.0 |
| t ~ Down b => Rewrapped (Down a) t | |
Defined in Control.Lens.Wrapped | |
| SDecide a => TestCoercion (SDown :: Down a -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SDecide a => TestEquality (SDown :: Down a -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SingI (DownSym0 :: TyFun a (Down a) -> Type) | |
Defined in Data.Singletons.Prelude.Ord | |
| SuppressUnusedWarnings (DownSym0 :: TyFun a6989586621679095422 (Down a6989586621679095422) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621681393603Sym0 :: TyFun a6989586621679962808 (Down a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679801934Sym0 :: TyFun (Down a6989586621679801914) (Down a6989586621679801914 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680106830Sym0 :: TyFun a6989586621679962805 (Down b6989586621679962806 ~> Down a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679801934Sym1 a6989586621679801932 :: TyFun (Down a6989586621679801914) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681402201Sym0 :: TyFun (Down a6989586621679962832) ((a6989586621679962832 ~> Down b6989586621679962833) ~> Down b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681393613Sym0 :: TyFun (Down (a6989586621679962809 ~> b6989586621679962810)) (Down a6989586621679962809 ~> Down b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680106818Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Down a6989586621679962803 ~> Down b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680106830Sym1 a6989586621680106828 b6989586621679962806 :: TyFun (Down b6989586621679962806) (Down a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680106818Sym1 a6989586621680106816 :: TyFun (Down a6989586621679962803) (Down b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Functor Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681393613Sym1 a6989586621681393611 :: TyFun (Down a6989586621679962809) (Down b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Applicative Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621681402201Sym1 a6989586621681402199 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Down b6989586621679962833) (Down b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad Methods suppressUnusedWarnings :: () # | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type (a1 :: k1) <$ (a2 :: Down b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: Down a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Functor | |
| type (arg1 :: Down a0) <* (arg2 :: Down b0) | |
| type (arg1 :: Down a0) *> (arg2 :: Down b0) | |
| type (a1 :: Down (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: Down a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type (arg1 :: Down a0) >> (arg2 :: Down b0) | |
| type (a1 :: Down a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> Down b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad | |
| type LiftA2 (arg1 :: a0 ~> (b0 ~> c0)) (arg2 :: Down a0) (arg3 :: Down b0) | |
| newtype MVector s (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Apply (DownSym0 :: TyFun a (Down a) -> Type) (t6989586621679801484 :: a) | |
| type Apply (Pure_6989586621681393603Sym0 :: TyFun a (Down a) -> Type) (a6989586621681393602 :: a) | |
Defined in Data.Singletons.Prelude.Applicative | |
| type Apply (TFHelper_6989586621680106830Sym0 :: TyFun a6989586621679962805 (Down b6989586621679962806 ~> Down a6989586621679962805) -> Type) (a6989586621680106828 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Functor type Apply (TFHelper_6989586621680106830Sym0 :: TyFun a6989586621679962805 (Down b6989586621679962806 ~> Down a6989586621679962805) -> Type) (a6989586621680106828 :: a6989586621679962805) = TFHelper_6989586621680106830Sym1 a6989586621680106828 b6989586621679962806 :: TyFun (Down b6989586621679962806) (Down a6989586621679962805) -> Type | |
| type Rep (Down a) | |
Defined in GHC.Generics | |
| newtype Vector (Down a) | |
Defined in Data.Vector.Unboxed.Base | |
| type Unwrapped (Down a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Ord | |
| type Mempty | |
Defined in Data.Singletons.Prelude.Monoid | |
| type Demote (Down a) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Rep1 Down | |
Defined in GHC.Generics | |
| type Mconcat (arg0 :: [Down a]) | |
| type Sconcat (arg0 :: NonEmpty (Down a)) | |
| type FromInteger a2 | |
Defined in Data.Singletons.Prelude.Num | |
| type Signum (a2 :: Down a1) | |
| type Abs (a2 :: Down a1) | |
| type Negate (a2 :: Down a1) | |
| type Mappend (arg1 :: Down a) (arg2 :: Down a) | |
| type (a2 :: Down a1) <> (a3 :: Down a1) | |
| type (a2 :: Down a1) * (a3 :: Down a1) | |
| type (a2 :: Down a1) - (a3 :: Down a1) | |
| type (a2 :: Down a1) + (a3 :: Down a1) | |
| type Min (arg1 :: Down a) (arg2 :: Down a) | |
| type Max (arg1 :: Down a) (arg2 :: Down a) | |
| type (arg1 :: Down a) >= (arg2 :: Down a) | |
| type (arg1 :: Down a) > (arg2 :: Down a) | |
| type (arg1 :: Down a) <= (arg2 :: Down a) | |
| type (arg1 :: Down a) < (arg2 :: Down a) | |
| type Compare (a2 :: Down a1) (a3 :: Down a1) | |
| type (x :: Down a) /= (y :: Down a) | |
| type (a2 :: Down a1) == (b :: Down a1) | |
Defined in Data.Singletons.Prelude.Ord | |
| type Apply (Compare_6989586621679801934Sym1 a6989586621679801932 :: TyFun (Down a) Ordering -> Type) (a6989586621679801933 :: Down a) | |
| type Apply (Fmap_6989586621680106818Sym1 a6989586621680106816 :: TyFun (Down a) (Down b) -> Type) (a6989586621680106817 :: Down a) | |
| type Apply (TFHelper_6989586621680106830Sym1 a6989586621680106828 b :: TyFun (Down b) (Down a) -> Type) (a6989586621680106829 :: Down b) | |
| type Apply (TFHelper_6989586621681393613Sym1 a6989586621681393611 :: TyFun (Down a) (Down b) -> Type) (a6989586621681393612 :: Down a) | |
| type Apply (Compare_6989586621679801934Sym0 :: TyFun (Down a6989586621679801914) (Down a6989586621679801914 ~> Ordering) -> Type) (a6989586621679801932 :: Down a6989586621679801914) | |
| type Apply (TFHelper_6989586621681402201Sym0 :: TyFun (Down a6989586621679962832) ((a6989586621679962832 ~> Down b6989586621679962833) ~> Down b6989586621679962833) -> Type) (a6989586621681402199 :: Down a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad type Apply (TFHelper_6989586621681402201Sym0 :: TyFun (Down a6989586621679962832) ((a6989586621679962832 ~> Down b6989586621679962833) ~> Down b6989586621679962833) -> Type) (a6989586621681402199 :: Down a6989586621679962832) = TFHelper_6989586621681402201Sym1 a6989586621681402199 b6989586621679962833 :: TyFun (a6989586621679962832 ~> Down b6989586621679962833) (Down b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621681393613Sym0 :: TyFun (Down (a6989586621679962809 ~> b6989586621679962810)) (Down a6989586621679962809 ~> Down b6989586621679962810) -> Type) (a6989586621681393611 :: Down (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Applicative type Apply (TFHelper_6989586621681393613Sym0 :: TyFun (Down (a6989586621679962809 ~> b6989586621679962810)) (Down a6989586621679962809 ~> Down b6989586621679962810) -> Type) (a6989586621681393611 :: Down (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621681393613Sym1 a6989586621681393611 | |
| type Apply (TFHelper_6989586621681402201Sym1 a6989586621681402199 b :: TyFun (a ~> Down b) (Down b) -> Type) (a6989586621681402200 :: a ~> Down b) | |
| type Apply (Fmap_6989586621680106818Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (Down a6989586621679962803 ~> Down b6989586621679962804) -> Type) (a6989586621680106816 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Functor | |
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy aundefined :: a
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| Proxy |
Instances
| Generic1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldMap' :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Representable (Proxy :: Type -> Type) | |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| NFData1 (Proxy :: Type -> Type) | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Hashable1 (Proxy :: Type -> Type) | |
Defined in Data.Hashable.Class | |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Generic (Proxy t) | Since: base-4.6.0.0 |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| Hashable (Proxy a) | |
Defined in Data.Hashable.Class | |
| NFData (Proxy a) | Since: deepseq-1.4.0.0 |
Defined in Control.DeepSeq | |
| type Rep1 (Proxy :: k -> Type) | |
| type Rep (Proxy :: Type -> Type) | |
| type Rep (Proxy t) | |
See openFile
Constructors
| ReadMode | |
| WriteMode | |
| AppendMode | |
| ReadWriteMode |
byteSwap64 :: Word64 -> Word64 #
Reverse order of bytes in Word64.
Since: base-4.7.0.0
byteSwap32 :: Word32 -> Word32 #
Reverse order of bytes in Word32.
Since: base-4.7.0.0
byteSwap16 :: Word16 -> Word16 #
Swap bytes in Word16.
Since: base-4.7.0.0
integralEnumFromThenTo :: Integral a => a -> a -> a -> [a] #
integralEnumFromTo :: Integral a => a -> a -> [a] #
integralEnumFromThen :: (Integral a, Bounded a) => a -> a -> [a] #
integralEnumFrom :: (Integral a, Bounded a) => a -> [a] #
lcm :: Integral a => a -> a -> a #
lcm x yx and y divide.
gcd :: Integral a => a -> a -> a #
gcd x yx and y of which
every common factor of x and y is also a factor; for example
gcd 4 2 = 2gcd (-4) 6 = 2gcd 0 44. gcd 0 00.
(That is, the common divisor that is "greatest" in the divisibility
preordering.)
Note: Since for signed fixed-width integer types, abs minBound < 0minBound0 or minBound
(^^) :: (Fractional a, Integral b) => a -> b -> a infixr 8 #
raise a number to an integral power
numericEnumFromThenTo :: (Ord a, Fractional a) => a -> a -> a -> [a] #
numericEnumFromTo :: (Ord a, Fractional a) => a -> a -> [a] #
numericEnumFromThen :: Fractional a => a -> a -> [a] #
numericEnumFrom :: Fractional a => a -> [a] #
denominator :: Ratio a -> a #
Extract the denominator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.
Extract the numerator of the ratio in reduced form: the numerator and denominator have no common factor and the denominator is positive.
reduce :: Integral a => a -> a -> Ratio a #
reduce is a subsidiary function used only in this module.
It normalises a ratio by dividing both numerator and denominator by
their greatest common divisor.
notANumber :: Rational #
ratioPrec1 :: Int #
underflowError :: a #
overflowError :: a #
divZeroError :: a #
boundedEnumFromThen :: (Enum a, Bounded a) => a -> a -> [a] #
boundedEnumFrom :: (Enum a, Bounded a) => a -> [a] #
unzip :: [(a, b)] -> ([a], [b]) #
unzip transforms a list of pairs into a list of first components
and a list of second components.
zipWith :: (a -> b -> c) -> [a] -> [b] -> [c] #
O(min(m,n)). zipWith generalises zip by zipping with the function
given as the first argument, instead of a tupling function. For example,
zipWith (+)
>>>zipWith (+) [1, 2, 3] [4, 5, 6][5,7,9]
zipWith is right-lazy:
zipWith f [] _|_ = []
zipWith is capable of list fusion, but it is restricted to its
first list argument and its resulting list.
break :: (a -> Bool) -> [a] -> ([a], [a]) #
break, applied to a predicate p and a list xs, returns a tuple where
first element is longest prefix (possibly empty) of xs of elements that
do not satisfy p and second element is the remainder of the list:
break (> 3) [1,2,3,4,1,2,3,4] == ([1,2,3],[4,1,2,3,4]) break (< 9) [1,2,3] == ([],[1,2,3]) break (> 9) [1,2,3] == ([1,2,3],[])
splitAt :: Int -> [a] -> ([a], [a]) #
splitAt n xs returns a tuple where first element is xs prefix of
length n and second element is the remainder of the list:
splitAt 6 "Hello World!" == ("Hello ","World!")
splitAt 3 [1,2,3,4,5] == ([1,2,3],[4,5])
splitAt 1 [1,2,3] == ([1],[2,3])
splitAt 3 [1,2,3] == ([1,2,3],[])
splitAt 4 [1,2,3] == ([1,2,3],[])
splitAt 0 [1,2,3] == ([],[1,2,3])
splitAt (-1) [1,2,3] == ([],[1,2,3])It is equivalent to ( when take n xs, drop n xs)n is not _|_
(splitAt _|_ xs = _|_).
splitAt is an instance of the more general genericSplitAt,
in which n may be of any integral type.
drop n xs returns the suffix of xs
after the first n elements, or [] if n > :length xs
drop 6 "Hello World!" == "World!" drop 3 [1,2,3,4,5] == [4,5] drop 3 [1,2] == [] drop 3 [] == [] drop (-1) [1,2] == [1,2] drop 0 [1,2] == [1,2]
It is an instance of the more general genericDrop,
in which n may be of any integral type.
take n, applied to a list xs, returns the prefix of xs
of length n, or xs itself if n > :length xs
take 5 "Hello World!" == "Hello" take 3 [1,2,3,4,5] == [1,2,3] take 3 [1,2] == [1,2] take 3 [] == [] take (-1) [1,2] == [] take 0 [1,2] == []
It is an instance of the more general genericTake,
in which n may be of any integral type.
takeWhile :: (a -> Bool) -> [a] -> [a] #
takeWhile, applied to a predicate p and a list xs, returns the
longest prefix (possibly empty) of xs of elements that satisfy p:
takeWhile (< 3) [1,2,3,4,1,2,3,4] == [1,2] takeWhile (< 9) [1,2,3] == [1,2,3] takeWhile (< 0) [1,2,3] == []
cycle ties a finite list into a circular one, or equivalently,
the infinite repetition of the original list. It is the identity
on infinite lists.
replicate :: Int -> a -> [a] #
replicate n x is a list of length n with x the value of
every element.
It is an instance of the more general genericReplicate,
in which n may be of any integral type.
mapMaybe :: (a -> Maybe b) -> [a] -> [b] #
The mapMaybe function is a version of map which can throw
out elements. In particular, the functional argument returns
something of type Maybe bNothing, no element
is added on to the result list. If it is Just bb is
included in the result list.
Examples
Using mapMaybe f xcatMaybes $ map f x
>>>import Text.Read ( readMaybe )>>>let readMaybeInt = readMaybe :: String -> Maybe Int>>>mapMaybe readMaybeInt ["1", "Foo", "3"][1,3]>>>catMaybes $ map readMaybeInt ["1", "Foo", "3"][1,3]
If we map the Just constructor, the entire list should be returned:
>>>mapMaybe Just [1,2,3][1,2,3]
catMaybes :: [Maybe a] -> [a] #
The catMaybes function takes a list of Maybes and returns
a list of all the Just values.
Examples
Basic usage:
>>>catMaybes [Just 1, Nothing, Just 3][1,3]
When constructing a list of Maybe values, catMaybes can be used
to return all of the "success" results (if the list is the result
of a map, then mapMaybe would be more appropriate):
>>>import Text.Read ( readMaybe )>>>[readMaybe x :: Maybe Int | x <- ["1", "Foo", "3"] ][Just 1,Nothing,Just 3]>>>catMaybes $ [readMaybe x :: Maybe Int | x <- ["1", "Foo", "3"] ][1,3]
listToMaybe :: [a] -> Maybe a #
The listToMaybe function returns Nothing on an empty list
or Just aa is the first element of the list.
Examples
Basic usage:
>>>listToMaybe []Nothing
>>>listToMaybe [9]Just 9
>>>listToMaybe [1,2,3]Just 1
Composing maybeToList with listToMaybe should be the identity
on singleton/empty lists:
>>>maybeToList $ listToMaybe [5][5]>>>maybeToList $ listToMaybe [][]
But not on lists with more than one element:
>>>maybeToList $ listToMaybe [1,2,3][1]
maybeToList :: Maybe a -> [a] #
The maybeToList function returns an empty list when given
Nothing or a singleton list when given Just.
Examples
Basic usage:
>>>maybeToList (Just 7)[7]
>>>maybeToList Nothing[]
One can use maybeToList to avoid pattern matching when combined
with a function that (safely) works on lists:
>>>import Text.Read ( readMaybe )>>>sum $ maybeToList (readMaybe "3")3>>>sum $ maybeToList (readMaybe "")0
fromMaybe :: a -> Maybe a -> a #
The fromMaybe function takes a default value and and Maybe
value. If the Maybe is Nothing, it returns the default values;
otherwise, it returns the value contained in the Maybe.
Examples
Basic usage:
>>>fromMaybe "" (Just "Hello, World!")"Hello, World!"
>>>fromMaybe "" Nothing""
Read an integer from a string using readMaybe. If we fail to
parse an integer, we want to return 0 by default:
>>>import Text.Read ( readMaybe )>>>fromMaybe 0 (readMaybe "5")5>>>fromMaybe 0 (readMaybe "")0
maybe :: b -> (a -> b) -> Maybe a -> b #
The maybe function takes a default value, a function, and a Maybe
value. If the Maybe value is Nothing, the function returns the
default value. Otherwise, it applies the function to the value inside
the Just and returns the result.
Examples
Basic usage:
>>>maybe False odd (Just 3)True
>>>maybe False odd NothingFalse
Read an integer from a string using readMaybe. If we succeed,
return twice the integer; that is, apply (*2) to it. If instead
we fail to parse an integer, return 0 by default:
>>>import Text.Read ( readMaybe )>>>maybe 0 (*2) (readMaybe "5")10>>>maybe 0 (*2) (readMaybe "")0
Apply show to a Maybe Int. If we have Just n, we want to show
the underlying Int n. But if we have Nothing, we return the
empty string instead of (for example) "Nothing":
>>>maybe "" show (Just 5)"5">>>maybe "" show Nothing""
Case analysis for the Bool type. bool x y px
when p is False, and evaluates to y when p is True.
This is equivalent to if p then y else x; that is, one can
think of it as an if-then-else construct with its arguments
reordered.
Examples
Basic usage:
>>>bool "foo" "bar" True"bar">>>bool "foo" "bar" False"foo"
Confirm that bool x y pif p then y else x are
equivalent:
>>>let p = True; x = "bar"; y = "foo">>>bool x y p == if p then y else xTrue>>>let p = False>>>bool x y p == if p then y else xTrue
Since: base-4.7.0.0
fix ff,
i.e. the least defined x such that f x = x.
For example, we can write the factorial function using direct recursion as
>>>let fac n = if n <= 1 then 1 else n * fac (n-1) in fac 5120
This uses the fact that Haskell’s let introduces recursive bindings. We can
rewrite this definition using fix,
>>>fix (\rec n -> if n <= 1 then 1 else n * rec (n-1)) 5120
Instead of making a recursive call, we introduce a dummy parameter rec;
when used within fix, this parameter then refers to fix argument, hence
the recursion is reintroduced.
void :: Functor f => f a -> f () #
void valueIO action.
Examples
Replace the contents of a Maybe Int
>>>void NothingNothing>>>void (Just 3)Just ()
Replace the contents of an Either Int IntEither Int ()
>>>void (Left 8675309)Left 8675309>>>void (Right 8675309)Right ()
Replace every element of a list with unit:
>>>void [1,2,3][(),(),()]
Replace the second element of a pair with unit:
>>>void (1,2)(1,())
Discard the result of an IO action:
>>>mapM print [1,2]1 2 [(),()]>>>void $ mapM print [1,2]1 2
($>) :: Functor f => f a -> b -> f b infixl 4 #
Flipped version of <$.
Examples
Replace the contents of a Maybe IntString:
>>>Nothing $> "foo"Nothing>>>Just 90210 $> "foo"Just "foo"
Replace the contents of an Either Int IntString, resulting in an Either
Int String
>>>Left 8675309 $> "foo"Left 8675309>>>Right 8675309 $> "foo"Right "foo"
Replace each element of a list with a constant String:
>>>[1,2,3] $> "foo"["foo","foo","foo"]
Replace the second element of a pair with a constant String:
>>>(1,2) $> "foo"(1,"foo")
Since: base-4.7.0.0
uncurry :: (a -> b -> c) -> (a, b) -> c #
uncurry converts a curried function to a function on pairs.
Examples
>>>uncurry (+) (1,2)3
>>>uncurry ($) (show, 1)"1"
>>>map (uncurry max) [(1,2), (3,4), (6,8)][2,4,8]
An MVar (pronounced "em-var") is a synchronising variable, used
for communication between concurrent threads. It can be thought of
as a box, which may be empty or full.
Instances
| NFData1 MVar | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| Eq (MVar a) | Since: base-4.1.0.0 |
| NFData (MVar a) | NOTE: Only strict in the reference and not the referenced value. Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
currentCallStack :: IO [String] #
Returns a [String] representing the current call stack. This
can be useful for debugging.
The implementation uses the call-stack simulation maintained by the
profiler, so it only works if the program was compiled with -prof
and contains suitable SCC annotations (e.g. by using -fprof-auto).
Otherwise, the list returned is likely to be empty or
uninformative.
Since: base-4.5.0.0
flip :: (a -> b -> c) -> b -> a -> c #
flip ff.
>>>flip (++) "hello" "world""worldhello"
liftM5 :: Monad m => (a1 -> a2 -> a3 -> a4 -> a5 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m a5 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftM4 :: Monad m => (a1 -> a2 -> a3 -> a4 -> r) -> m a1 -> m a2 -> m a3 -> m a4 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftM3 :: Monad m => (a1 -> a2 -> a3 -> r) -> m a1 -> m a2 -> m a3 -> m r #
Promote a function to a monad, scanning the monadic arguments from
left to right (cf. liftM2).
liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r #
Promote a function to a monad, scanning the monadic arguments from left to right. For example,
liftM2 (+) [0,1] [0,2] = [0,2,1,3] liftM2 (+) (Just 1) Nothing = Nothing
(=<<) :: Monad m => (a -> m b) -> m a -> m b infixr 1 #
Same as >>=, but with the arguments interchanged.
liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d #
Lift a ternary function to actions.
(<**>) :: Applicative f => f a -> f (a -> b) -> f b infixl 4 #
A variant of <*> with the arguments reversed.
Non-empty (and non-strict) list type.
Since: base-4.9.0.0
Constructors
| a :| [a] infixr 5 |
Instances
| Monad NonEmpty | Since: base-4.9.0.0 |
| Functor NonEmpty | Since: base-4.9.0.0 |
| Applicative NonEmpty | Since: base-4.9.0.0 |
| Foldable NonEmpty | Since: base-4.9.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => NonEmpty m -> m # foldMap :: Monoid m => (a -> m) -> NonEmpty a -> m # foldMap' :: Monoid m => (a -> m) -> NonEmpty a -> m # foldr :: (a -> b -> b) -> b -> NonEmpty a -> b # foldr' :: (a -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> a -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> a -> b) -> b -> NonEmpty a -> b # foldr1 :: (a -> a -> a) -> NonEmpty a -> a # foldl1 :: (a -> a -> a) -> NonEmpty a -> a # elem :: Eq a => a -> NonEmpty a -> Bool # maximum :: Ord a => NonEmpty a -> a # minimum :: Ord a => NonEmpty a -> a # | |
| Traversable NonEmpty | Since: base-4.9.0.0 |
| NFData1 NonEmpty | Since: deepseq-1.4.3.0 |
Defined in Control.DeepSeq | |
| PTraversable NonEmpty | |
| STraversable NonEmpty | |
Defined in Data.Singletons.Prelude.Traversable Methods sTraverse :: forall a (f :: Type -> Type) b (t1 :: a ~> f b) (t2 :: NonEmpty a). SApplicative f => Sing t1 -> Sing t2 -> Sing (Apply (Apply TraverseSym0 t1) t2) # sSequenceA :: forall (f :: Type -> Type) a (t :: NonEmpty (f a)). SApplicative f => Sing t -> Sing (Apply SequenceASym0 t) # sMapM :: forall a (m :: Type -> Type) b (t1 :: a ~> m b) (t2 :: NonEmpty a). SMonad m => Sing t1 -> Sing t2 -> Sing (Apply (Apply MapMSym0 t1) t2) # sSequence :: forall (m :: Type -> Type) a (t :: NonEmpty (m a)). SMonad m => Sing t -> Sing (Apply SequenceSym0 t) # | |
| PFoldable NonEmpty | |
| SFoldable NonEmpty | |
Defined in Data.Singletons.Prelude.Foldable Methods sFold :: forall m (t :: NonEmpty m). SMonoid m => Sing t -> Sing (Apply FoldSym0 t) # sFoldMap :: forall a m (t1 :: a ~> m) (t2 :: NonEmpty a). SMonoid m => Sing t1 -> Sing t2 -> Sing (Apply (Apply FoldMapSym0 t1) t2) # sFoldr :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldrSym0 t1) t2) t3) # sFoldr' :: forall a b (t1 :: a ~> (b ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldr'Sym0 t1) t2) t3) # sFoldl :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply FoldlSym0 t1) t2) t3) # sFoldl' :: forall b a (t1 :: b ~> (a ~> b)) (t2 :: b) (t3 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply Foldl'Sym0 t1) t2) t3) # sFoldr1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldr1Sym0 t1) t2) # sFoldl1 :: forall a (t1 :: a ~> (a ~> a)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply Foldl1Sym0 t1) t2) # sToList :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply ToListSym0 t) # sNull :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply NullSym0 t) # sLength :: forall a (t :: NonEmpty a). Sing t -> Sing (Apply LengthSym0 t) # sElem :: forall a (t1 :: a) (t2 :: NonEmpty a). SEq a => Sing t1 -> Sing t2 -> Sing (Apply (Apply ElemSym0 t1) t2) # sMaximum :: forall a (t :: NonEmpty a). SOrd a => Sing t -> Sing (Apply MaximumSym0 t) # sMinimum :: forall a (t :: NonEmpty a). SOrd a => Sing t -> Sing (Apply MinimumSym0 t) # sSum :: forall a (t :: NonEmpty a). SNum a => Sing t -> Sing (Apply SumSym0 t) # sProduct :: forall a (t :: NonEmpty a). SNum a => Sing t -> Sing (Apply ProductSym0 t) # | |
| PFunctor NonEmpty | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| PApplicative NonEmpty | |
| PMonad NonEmpty | |
| SFunctor NonEmpty | |
| SApplicative NonEmpty | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods sPure :: forall a (t :: a). Sing t -> Sing (Apply PureSym0 t) # (%<*>) :: forall a b (t1 :: NonEmpty (a ~> b)) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*>@#@$) t1) t2) # sLiftA2 :: forall a b c (t1 :: a ~> (b ~> c)) (t2 :: NonEmpty a) (t3 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply LiftA2Sym0 t1) t2) t3) # (%*>) :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (*>@#@$) t1) t2) # (%<*) :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<*@#@$) t1) t2) # | |
| SMonad NonEmpty | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods (%>>=) :: forall a b (t1 :: NonEmpty a) (t2 :: a ~> NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>=@#@$) t1) t2) # (%>>) :: forall a b (t1 :: NonEmpty a) (t2 :: NonEmpty b). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>>@#@$) t1) t2) # sReturn :: forall a (t :: a). Sing t -> Sing (Apply ReturnSym0 t) # | |
| IsList (NonEmpty a) | Since: base-4.9.0.0 |
| Eq a => Eq (NonEmpty a) | Since: base-4.9.0.0 |
| Data a => Data (NonEmpty a) | Since: base-4.9.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NonEmpty a -> c (NonEmpty a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (NonEmpty a) # toConstr :: NonEmpty a -> Constr # dataTypeOf :: NonEmpty a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (NonEmpty a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (NonEmpty a)) # gmapT :: (forall b. Data b => b -> b) -> NonEmpty a -> NonEmpty a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NonEmpty a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NonEmpty a -> r # gmapQ :: (forall d. Data d => d -> u) -> NonEmpty a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> NonEmpty a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NonEmpty a -> m (NonEmpty a) # | |
| Ord a => Ord (NonEmpty a) | Since: base-4.9.0.0 |
| Read a => Read (NonEmpty a) | Since: base-4.11.0.0 |
| Show a => Show (NonEmpty a) | Since: base-4.11.0.0 |
| Generic (NonEmpty a) | Since: base-4.6.0.0 |
| Semigroup (NonEmpty a) | Since: base-4.9.0.0 |
| Lift a => Lift (NonEmpty a) | Since: template-haskell-2.15.0.0 |
| Hashable a => Hashable (NonEmpty a) | |
Defined in Data.Hashable.Class | |
| NFData a => NFData (NonEmpty a) | Since: deepseq-1.4.2.0 |
Defined in Control.DeepSeq | |
| Ixed (NonEmpty a) | |
Defined in Control.Lens.At | |
| Wrapped (NonEmpty a) | |
| One (NonEmpty a) | |
| Container (NonEmpty a) | |
Defined in Universum.Container.Class Methods toList :: NonEmpty a -> [Element (NonEmpty a)] # foldr :: (Element (NonEmpty a) -> b -> b) -> b -> NonEmpty a -> b # foldl :: (b -> Element (NonEmpty a) -> b) -> b -> NonEmpty a -> b # foldl' :: (b -> Element (NonEmpty a) -> b) -> b -> NonEmpty a -> b # elem :: Element (NonEmpty a) -> NonEmpty a -> Bool # maximum :: NonEmpty a -> Element (NonEmpty a) # minimum :: NonEmpty a -> Element (NonEmpty a) # foldMap :: Monoid m => (Element (NonEmpty a) -> m) -> NonEmpty a -> m # fold :: NonEmpty a -> Element (NonEmpty a) # foldr' :: (Element (NonEmpty a) -> b -> b) -> b -> NonEmpty a -> b # foldr1 :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # foldl1 :: (Element (NonEmpty a) -> Element (NonEmpty a) -> Element (NonEmpty a)) -> NonEmpty a -> Element (NonEmpty a) # notElem :: Element (NonEmpty a) -> NonEmpty a -> Bool # all :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # any :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Bool # find :: (Element (NonEmpty a) -> Bool) -> NonEmpty a -> Maybe (Element (NonEmpty a)) # | |
| PShow (NonEmpty a) | |
| (SShow a, SShow [a]) => SShow (NonEmpty a) | |
Defined in Data.Singletons.Prelude.Show Methods sShowsPrec :: forall (t1 :: Nat) (t2 :: NonEmpty a) (t3 :: Symbol). Sing t1 -> Sing t2 -> Sing t3 -> Sing (Apply (Apply (Apply ShowsPrecSym0 t1) t2) t3) # sShow_ :: forall (t :: NonEmpty a). Sing t -> Sing (Apply Show_Sym0 t) # sShowList :: forall (t1 :: [NonEmpty a]) (t2 :: Symbol). Sing t1 -> Sing t2 -> Sing (Apply (Apply ShowListSym0 t1) t2) # | |
| PSemigroup (NonEmpty a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| SSemigroup (NonEmpty a) | |
| POrd (NonEmpty a) | |
| (SOrd a, SOrd [a]) => SOrd (NonEmpty a) | |
Defined in Data.Singletons.Prelude.Ord Methods sCompare :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply CompareSym0 t1) t2) # (%<) :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<@#@$) t1) t2) # (%<=) :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (<=@#@$) t1) t2) # (%>) :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>@#@$) t1) t2) # (%>=) :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply (>=@#@$) t1) t2) # sMax :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MaxSym0 t1) t2) # sMin :: forall (t1 :: NonEmpty a) (t2 :: NonEmpty a). Sing t1 -> Sing t2 -> Sing (Apply (Apply MinSym0 t1) t2) # | |
| (SEq a, SEq [a]) => SEq (NonEmpty a) | |
| PEq (NonEmpty a) | |
| Generic1 NonEmpty | Since: base-4.6.0.0 |
| t ~ NonEmpty b => Rewrapped (NonEmpty a) t | |
Defined in Control.Lens.Wrapped | |
| (SDecide a, SDecide [a]) => TestCoercion (SNonEmpty :: NonEmpty a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| (SDecide a, SDecide [a]) => TestEquality (SNonEmpty :: NonEmpty a -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| Each (NonEmpty a) (NonEmpty b) a b | |
| SingI ((:|@#@$) :: TyFun a ([a] ~> NonEmpty a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SSemigroup a => SingI (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods sing :: Sing SconcatSym0 # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595833Sym0 :: TyFun Nat (NonEmpty a6989586621679060149 ~> (Symbol ~> Symbol)) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Pure_6989586621680024367Sym0 :: TyFun a6989586621679962808 (NonEmpty a6989586621679962808) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings ((:|@#@$) :: TyFun a6989586621679060149 ([a6989586621679060149] ~> NonEmpty a6989586621679060149) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803314Sym0 :: TyFun (NonEmpty a6989586621679060149) (NonEmpty a6989586621679060149 ~> Ordering) -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sconcat_6989586621680187836Sym0 :: TyFun (NonEmpty a6989586621680187449) a6989586621680187449 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Sconcat_6989586621680187691Sym0 :: TyFun (NonEmpty a6989586621680187449) a6989586621680187449 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (SconcatSym0 :: TyFun (NonEmpty a6989586621680187449) a6989586621680187449 -> Type) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal Methods suppressUnusedWarnings :: () # | |
| SingI d => SingI ((:|@#@$$) d :: TyFun [a] (NonEmpty a) -> Type) | |
Defined in Data.Singletons.Prelude.Instances | |
| SuppressUnusedWarnings ((:|@#@$$) t6989586621679707129 :: TyFun [a6989586621679060149] (NonEmpty a6989586621679060149) -> Type) | |
Defined in Data.Singletons.Prelude.Instances Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024210Sym0 :: TyFun a6989586621679962805 (NonEmpty b6989586621679962806 ~> NonEmpty a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (ShowsPrec_6989586621680595833Sym1 a6989586621680595830 a6989586621679060149 :: TyFun (NonEmpty a6989586621679060149) (Symbol ~> Symbol) -> Type) | |
Defined in Data.Singletons.Prelude.Show Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024526Sym0 :: TyFun (NonEmpty a6989586621679962832) ((a6989586621679962832 ~> NonEmpty b6989586621679962833) ~> NonEmpty b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Compare_6989586621679803314Sym1 a6989586621679803312 :: TyFun (NonEmpty a6989586621679060149) Ordering -> Type) | |
Defined in Data.Singletons.Prelude.Ord Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024375Sym0 :: TyFun (NonEmpty (a6989586621679962809 ~> b6989586621679962810)) (NonEmpty a6989586621679962809 ~> NonEmpty b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024197Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (NonEmpty a6989586621679962803 ~> NonEmpty b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BsSym0 :: TyFun k1 (TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535Bs'Sym0 :: TyFun k (TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BSym0 :: TyFun k1 (TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024375Sym1 a6989586621680024373 :: TyFun (NonEmpty a6989586621679962809) (NonEmpty b6989586621679962810) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024210Sym1 a6989586621680024208 b6989586621679962806 :: TyFun (NonEmpty b6989586621679962806) (NonEmpty a6989586621679962805) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Fmap_6989586621680024197Sym1 a6989586621680024195 :: TyFun (NonEmpty a6989586621679962803) (NonEmpty b6989586621679962804) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995085Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (NonEmpty a6989586621680988964 ~> f6989586621680988963 (NonEmpty b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (TFHelper_6989586621680024526Sym1 a6989586621680024524 b6989586621679962833 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) (NonEmpty b6989586621679962833) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024392Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (NonEmpty a6989586621679962811 ~> (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813)) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535Bs'Sym1 a6989586621680024532 :: TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535ToListSym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BsSym1 a6989586621680024532 :: TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BSym1 a6989586621680024532 :: TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Traverse_6989586621680995085Sym1 a6989586621680995083 :: TyFun (NonEmpty a6989586621680988964) (f6989586621680988963 (NonEmpty b6989586621680988965)) -> Type) | |
Defined in Data.Singletons.Prelude.Traversable Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024392Sym1 a6989586621680024389 :: TyFun (NonEmpty a6989586621679962811) (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535ToListSym1 a6989586621680024532 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (LiftA2_6989586621680024392Sym2 a6989586621680024390 a6989586621680024389 :: TyFun (NonEmpty b6989586621679962812) (NonEmpty c6989586621679962813) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BsSym2 as6989586621680024533 a6989586621680024532 :: TyFun (k1 ~> NonEmpty a) [a] -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535Bs'Sym2 as6989586621680024533 a6989586621680024532 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535BSym2 as6989586621680024533 a6989586621680024532 :: TyFun (k1 ~> NonEmpty k3) k3 -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535ToListSym2 as6989586621680024533 a6989586621680024532 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| SuppressUnusedWarnings (Let6989586621680024535ToListSym3 f6989586621680024534 as6989586621680024533 a6989586621680024532 :: TyFun (NonEmpty k4) [k4] -> Type) | |
Defined in Data.Singletons.Prelude.Monad.Internal Methods suppressUnusedWarnings :: () # | |
| type Product (arg0 :: NonEmpty a0) | |
| type Sum (arg0 :: NonEmpty a0) | |
| type Minimum (arg0 :: NonEmpty a0) | |
| type Maximum (arg0 :: NonEmpty a0) | |
| type Length (arg0 :: NonEmpty a0) | |
| type Null (arg0 :: NonEmpty a0) | |
| type ToList (a :: NonEmpty a6989586621680742395) | |
| type Fold (a :: NonEmpty k2) | |
| type Pure (a :: k1) | |
| type Return (arg0 :: a0) | |
| type Sequence (arg0 :: NonEmpty (m0 a0)) | |
| type SequenceA (arg0 :: NonEmpty (f0 a0)) | |
| type Elem (arg1 :: a0) (arg2 :: NonEmpty a0) | |
| type Foldl1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2) | |
| type Foldr1 (a1 :: k2 ~> (k2 ~> k2)) (a2 :: NonEmpty k2) | |
| type FoldMap (a1 :: a6989586621680742384 ~> k2) (a2 :: NonEmpty a6989586621680742384) | |
| type (a1 :: k1) <$ (a2 :: NonEmpty b6989586621679962806) | |
| type Fmap (a1 :: a6989586621679962803 ~> b6989586621679962804) (a2 :: NonEmpty a6989586621679962803) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type (arg1 :: NonEmpty a0) <* (arg2 :: NonEmpty b0) | |
| type (arg1 :: NonEmpty a0) *> (arg2 :: NonEmpty b0) | |
| type (a1 :: NonEmpty (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: NonEmpty a6989586621679962809) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: NonEmpty (a6989586621679962809 ~> b6989586621679962810)) <*> (a2 :: NonEmpty a6989586621679962809) = Apply (Apply (TFHelper_6989586621680024375Sym0 :: TyFun (NonEmpty (a6989586621679962809 ~> b6989586621679962810)) (NonEmpty a6989586621679962809 ~> NonEmpty b6989586621679962810) -> Type) a1) a2 | |
| type (arg1 :: NonEmpty a0) >> (arg2 :: NonEmpty b0) | |
| type (a1 :: NonEmpty a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> NonEmpty b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal type (a1 :: NonEmpty a6989586621679962832) >>= (a2 :: a6989586621679962832 ~> NonEmpty b6989586621679962833) = Apply (Apply (TFHelper_6989586621680024526Sym0 :: TyFun (NonEmpty a6989586621679962832) ((a6989586621679962832 ~> NonEmpty b6989586621679962833) ~> NonEmpty b6989586621679962833) -> Type) a1) a2 | |
| type MapM (arg1 :: a0 ~> m0 b0) (arg2 :: NonEmpty a0) | |
| type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: NonEmpty a6989586621680988964) | |
Defined in Data.Singletons.Prelude.Traversable type Traverse (a1 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (a2 :: NonEmpty a6989586621680988964) = Apply (Apply (Traverse_6989586621680995085Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (NonEmpty a6989586621680988964 ~> f6989586621680988963 (NonEmpty b6989586621680988965)) -> Type) a1) a2 | |
| type Foldl' (arg1 :: b0 ~> (a0 ~> b0)) (arg2 :: b0) (arg3 :: NonEmpty a0) | |
| type Foldl (a1 :: k2 ~> (a6989586621680742390 ~> k2)) (a2 :: k2) (a3 :: NonEmpty a6989586621680742390) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type Foldr' (arg1 :: a0 ~> (b0 ~> b0)) (arg2 :: b0) (arg3 :: NonEmpty a0) | |
| type Foldr (a1 :: a6989586621680742385 ~> (k2 ~> k2)) (a2 :: k2) (a3 :: NonEmpty a6989586621680742385) | |
Defined in Data.Singletons.Prelude.Foldable | |
| type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: NonEmpty a6989586621679962811) (a3 :: NonEmpty b6989586621679962812) | |
Defined in Data.Singletons.Prelude.Monad.Internal type LiftA2 (a1 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (a2 :: NonEmpty a6989586621679962811) (a3 :: NonEmpty b6989586621679962812) = Apply (Apply (Apply (LiftA2_6989586621680024392Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (NonEmpty a6989586621679962811 ~> (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813)) -> Type) a1) a2) a3 | |
| type Apply (Pure_6989586621680024367Sym0 :: TyFun a (NonEmpty a) -> Type) (a6989586621680024366 :: a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (ShowsPrec_6989586621680595833Sym0 :: TyFun Nat (NonEmpty a6989586621679060149 ~> (Symbol ~> Symbol)) -> Type) (a6989586621680595830 :: Nat) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply ((:|@#@$) :: TyFun a6989586621679060149 ([a6989586621679060149] ~> NonEmpty a6989586621679060149) -> Type) (t6989586621679707129 :: a6989586621679060149) | |
| type Apply (TFHelper_6989586621680024210Sym0 :: TyFun a6989586621679962805 (NonEmpty b6989586621679962806 ~> NonEmpty a6989586621679962805) -> Type) (a6989586621680024208 :: a6989586621679962805) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024210Sym0 :: TyFun a6989586621679962805 (NonEmpty b6989586621679962806 ~> NonEmpty a6989586621679962805) -> Type) (a6989586621680024208 :: a6989586621679962805) = TFHelper_6989586621680024210Sym1 a6989586621680024208 b6989586621679962806 :: TyFun (NonEmpty b6989586621679962806) (NonEmpty a6989586621679962805) -> Type | |
| type Apply (Let6989586621680024535Bs'Sym0 :: TyFun k (TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) -> Type) (a6989586621680024532 :: k) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680024535Bs'Sym0 :: TyFun k (TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) -> Type) (a6989586621680024532 :: k) = Let6989586621680024535Bs'Sym1 a6989586621680024532 :: TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type | |
| type Apply (Let6989586621680024535BSym0 :: TyFun k1 (TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) -> Type) (a6989586621680024532 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535BsSym0 :: TyFun k1 (TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) -> Type) (a6989586621680024532 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535ToListSym0 :: TyFun k1 (TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) -> Type) (a6989586621680024532 :: k1) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535BSym1 a6989586621680024532 :: TyFun k2 (TyFun (k1 ~> NonEmpty k3) k3 -> Type) -> Type) (as6989586621680024533 :: k2) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535BsSym1 a6989586621680024532 :: TyFun k (TyFun (k1 ~> NonEmpty a) [a] -> Type) -> Type) (as6989586621680024533 :: k) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535ToListSym1 a6989586621680024532 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) (as6989586621680024533 :: k2) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680024535ToListSym1 a6989586621680024532 :: TyFun k2 (TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) -> Type) (as6989586621680024533 :: k2) = Let6989586621680024535ToListSym2 a6989586621680024532 as6989586621680024533 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type | |
| type Apply (Let6989586621680024535ToListSym2 as6989586621680024533 a6989586621680024532 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) (f6989586621680024534 :: k3) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680024535ToListSym2 as6989586621680024533 a6989586621680024532 :: TyFun k3 (TyFun (NonEmpty k4) [k4] -> Type) -> Type) (f6989586621680024534 :: k3) = Let6989586621680024535ToListSym3 as6989586621680024533 a6989586621680024532 f6989586621680024534 :: TyFun (NonEmpty k4) [k4] -> Type | |
| type Rep (NonEmpty a) | |
Defined in GHC.Generics type Rep (NonEmpty a) = D1 ('MetaData "NonEmpty" "GHC.Base" "base" 'False) (C1 ('MetaCons ":|" ('InfixI 'LeftAssociative 9) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 [a]))) | |
| type Item (NonEmpty a) | |
| type Index (NonEmpty a) | |
Defined in Control.Lens.At | |
| type IxValue (NonEmpty a) | |
Defined in Control.Lens.At | |
| type Unwrapped (NonEmpty a) | |
Defined in Control.Lens.Wrapped | |
| type Sing | |
Defined in Data.Singletons.Prelude.Instances | |
| type OneItem (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type Element (NonEmpty a) | |
Defined in Universum.Container.Class | |
| type Demote (NonEmpty a) | |
Defined in Data.Singletons.Prelude.Instances | |
| type Rep1 NonEmpty | |
Defined in GHC.Generics type Rep1 NonEmpty = D1 ('MetaData "NonEmpty" "GHC.Base" "base" 'False) (C1 ('MetaCons ":|" ('InfixI 'LeftAssociative 9) 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) Par1 :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 []))) | |
| type Show_ (arg0 :: NonEmpty a) | |
| type Sconcat (arg0 :: NonEmpty (NonEmpty a)) | |
| type ShowList (arg1 :: [NonEmpty a]) arg2 | |
| type (a2 :: NonEmpty a1) <> (a3 :: NonEmpty a1) | |
| type Min (arg1 :: NonEmpty a) (arg2 :: NonEmpty a) | |
| type Max (arg1 :: NonEmpty a) (arg2 :: NonEmpty a) | |
| type (arg1 :: NonEmpty a) >= (arg2 :: NonEmpty a) | |
| type (arg1 :: NonEmpty a) > (arg2 :: NonEmpty a) | |
| type (arg1 :: NonEmpty a) <= (arg2 :: NonEmpty a) | |
| type (arg1 :: NonEmpty a) < (arg2 :: NonEmpty a) | |
| type Compare (a2 :: NonEmpty a1) (a3 :: NonEmpty a1) | |
| type (x :: NonEmpty a) /= (y :: NonEmpty a) | |
| type (a2 :: NonEmpty a1) == (b :: NonEmpty a1) | |
Defined in Data.Singletons.Prelude.Eq | |
| type ShowsPrec a2 (a3 :: NonEmpty a1) a4 | |
| type Apply (Sconcat_6989586621680187691Sym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621680187690 :: NonEmpty a) | |
| type Apply (SconcatSym0 :: TyFun (NonEmpty a) a -> Type) (arg6989586621680187688 :: NonEmpty a) | |
Defined in Data.Singletons.Prelude.Semigroup.Internal | |
| type Apply (Sconcat_6989586621680187836Sym0 :: TyFun (NonEmpty a) a -> Type) (a6989586621680187835 :: NonEmpty a) | |
| type Apply (Compare_6989586621679803314Sym1 a6989586621679803312 :: TyFun (NonEmpty a) Ordering -> Type) (a6989586621679803313 :: NonEmpty a) | |
| type Apply ((:|@#@$$) t6989586621679707129 :: TyFun [a] (NonEmpty a) -> Type) (t6989586621679707130 :: [a]) | |
| type Apply (Fmap_6989586621680024197Sym1 a6989586621680024195 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) (a6989586621680024196 :: NonEmpty a) | |
| type Apply (TFHelper_6989586621680024210Sym1 a6989586621680024208 b :: TyFun (NonEmpty b) (NonEmpty a) -> Type) (a6989586621680024209 :: NonEmpty b) | |
| type Apply (TFHelper_6989586621680024375Sym1 a6989586621680024373 :: TyFun (NonEmpty a) (NonEmpty b) -> Type) (a6989586621680024374 :: NonEmpty a) | |
| type Apply (Traverse_6989586621680995085Sym1 a6989586621680995083 :: TyFun (NonEmpty a) (f (NonEmpty b)) -> Type) (a6989586621680995084 :: NonEmpty a) | |
| type Apply (LiftA2_6989586621680024392Sym2 a6989586621680024390 a6989586621680024389 :: TyFun (NonEmpty b) (NonEmpty c) -> Type) (a6989586621680024391 :: NonEmpty b) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Let6989586621680024535ToListSym3 f6989586621680024534 as6989586621680024533 a6989586621680024532 :: TyFun (NonEmpty k4) [k4] -> Type) (a6989586621680024542 :: NonEmpty k4) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Compare_6989586621679803314Sym0 :: TyFun (NonEmpty a6989586621679060149) (NonEmpty a6989586621679060149 ~> Ordering) -> Type) (a6989586621679803312 :: NonEmpty a6989586621679060149) | |
| type Apply (ShowsPrec_6989586621680595833Sym1 a6989586621680595830 a6989586621679060149 :: TyFun (NonEmpty a6989586621679060149) (Symbol ~> Symbol) -> Type) (a6989586621680595831 :: NonEmpty a6989586621679060149) | |
Defined in Data.Singletons.Prelude.Show | |
| type Apply (TFHelper_6989586621680024526Sym0 :: TyFun (NonEmpty a6989586621679962832) ((a6989586621679962832 ~> NonEmpty b6989586621679962833) ~> NonEmpty b6989586621679962833) -> Type) (a6989586621680024524 :: NonEmpty a6989586621679962832) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024526Sym0 :: TyFun (NonEmpty a6989586621679962832) ((a6989586621679962832 ~> NonEmpty b6989586621679962833) ~> NonEmpty b6989586621679962833) -> Type) (a6989586621680024524 :: NonEmpty a6989586621679962832) = TFHelper_6989586621680024526Sym1 a6989586621680024524 b6989586621679962833 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) (NonEmpty b6989586621679962833) -> Type | |
| type Apply (TFHelper_6989586621680024375Sym0 :: TyFun (NonEmpty (a6989586621679962809 ~> b6989586621679962810)) (NonEmpty a6989586621679962809 ~> NonEmpty b6989586621679962810) -> Type) (a6989586621680024373 :: NonEmpty (a6989586621679962809 ~> b6989586621679962810)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (TFHelper_6989586621680024375Sym0 :: TyFun (NonEmpty (a6989586621679962809 ~> b6989586621679962810)) (NonEmpty a6989586621679962809 ~> NonEmpty b6989586621679962810) -> Type) (a6989586621680024373 :: NonEmpty (a6989586621679962809 ~> b6989586621679962810)) = TFHelper_6989586621680024375Sym1 a6989586621680024373 | |
| type Apply (Let6989586621680024535Bs'Sym1 a6989586621680024532 :: TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) (as6989586621680024533 :: [a6989586621679962832]) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680024535Bs'Sym1 a6989586621680024532 :: TyFun [a6989586621679962832] (TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) -> Type) (as6989586621680024533 :: [a6989586621679962832]) = Let6989586621680024535Bs'Sym2 a6989586621680024532 as6989586621680024533 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type | |
| type Apply (LiftA2_6989586621680024392Sym1 a6989586621680024389 :: TyFun (NonEmpty a6989586621679962811) (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813) -> Type) (a6989586621680024390 :: NonEmpty a6989586621679962811) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680024392Sym1 a6989586621680024389 :: TyFun (NonEmpty a6989586621679962811) (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813) -> Type) (a6989586621680024390 :: NonEmpty a6989586621679962811) = LiftA2_6989586621680024392Sym2 a6989586621680024389 a6989586621680024390 | |
| type Apply (Let6989586621680024535BSym2 as6989586621680024533 a6989586621680024532 :: TyFun (k1 ~> NonEmpty k3) k3 -> Type) (f6989586621680024534 :: k1 ~> NonEmpty k3) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (TFHelper_6989586621680024526Sym1 a6989586621680024524 b :: TyFun (a ~> NonEmpty b) (NonEmpty b) -> Type) (a6989586621680024525 :: a ~> NonEmpty b) | |
| type Apply (Let6989586621680024535Bs'Sym2 as6989586621680024533 a6989586621680024532 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) (f6989586621680024534 :: a6989586621679962832 ~> NonEmpty b6989586621679962833) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (Let6989586621680024535Bs'Sym2 as6989586621680024533 a6989586621680024532 :: TyFun (a6989586621679962832 ~> NonEmpty b6989586621679962833) [b6989586621679962833] -> Type) (f6989586621680024534 :: a6989586621679962832 ~> NonEmpty b6989586621679962833) = Let6989586621680024535Bs' as6989586621680024533 a6989586621680024532 f6989586621680024534 | |
| type Apply (Let6989586621680024535BsSym2 as6989586621680024533 a6989586621680024532 :: TyFun (k1 ~> NonEmpty a) [a] -> Type) (f6989586621680024534 :: k1 ~> NonEmpty a) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Fmap_6989586621680024197Sym0 :: TyFun (a6989586621679962803 ~> b6989586621679962804) (NonEmpty a6989586621679962803 ~> NonEmpty b6989586621679962804) -> Type) (a6989586621680024195 :: a6989586621679962803 ~> b6989586621679962804) | |
Defined in Data.Singletons.Prelude.Monad.Internal | |
| type Apply (Traverse_6989586621680995085Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (NonEmpty a6989586621680988964 ~> f6989586621680988963 (NonEmpty b6989586621680988965)) -> Type) (a6989586621680995083 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) | |
Defined in Data.Singletons.Prelude.Traversable type Apply (Traverse_6989586621680995085Sym0 :: TyFun (a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) (NonEmpty a6989586621680988964 ~> f6989586621680988963 (NonEmpty b6989586621680988965)) -> Type) (a6989586621680995083 :: a6989586621680988964 ~> f6989586621680988963 b6989586621680988965) = Traverse_6989586621680995085Sym1 a6989586621680995083 | |
| type Apply (LiftA2_6989586621680024392Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (NonEmpty a6989586621679962811 ~> (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813)) -> Type) (a6989586621680024389 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) | |
Defined in Data.Singletons.Prelude.Monad.Internal type Apply (LiftA2_6989586621680024392Sym0 :: TyFun (a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) (NonEmpty a6989586621679962811 ~> (NonEmpty b6989586621679962812 ~> NonEmpty c6989586621679962813)) -> Type) (a6989586621680024389 :: a6989586621679962811 ~> (b6989586621679962812 ~> c6989586621679962813)) = LiftA2_6989586621680024392Sym1 a6989586621680024389 | |
getCallStack :: CallStack -> [([Char], SrcLoc)] #
Extract a list of call-sites from the CallStack.
The list is ordered by most recent call.
Since: base-4.8.1.0
type HasCallStack = ?callStack :: CallStack #
Request a CallStack.
NOTE: The implicit parameter ?callStack :: CallStack is an
implementation detail and should not be considered part of the
CallStack API, we may decide to change the implementation in the
future.
Since: base-4.9.0.0
stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a #
data SomeException #
The SomeException type is the root of the exception type hierarchy.
When an exception of type e is thrown, behind the scenes it is
encapsulated in a SomeException.
Constructors
| Exception e => SomeException e |
Instances
| Show SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods showsPrec :: Int -> SomeException -> ShowS # show :: SomeException -> String # showList :: [SomeException] -> ShowS # | |
| Exception SomeException | Since: base-3.0 |
Defined in GHC.Exception.Type Methods toException :: SomeException -> SomeException # fromException :: SomeException -> Maybe SomeException # displayException :: SomeException -> String # | |
data IdentityT (f :: k -> Type) (a :: k) #
The trivial monad transformer, which maps a monad to an equivalent monad.
Instances
A map of integers to values a.
Instances
| Functor IntMap | |
| Foldable IntMap | Folds in order of increasing key. |
Defined in Data.IntMap.Internal Methods fold :: Monoid m => IntMap m -> m # foldMap :: Monoid m => (a -> m) -> IntMap a -> m # foldMap' :: Monoid m => (a -> m) -> IntMap a -> m # foldr :: (a -> b -> b) -> b -> IntMap a -> b # foldr' :: (a -> b -> b) -> b -> IntMap a -> b # foldl :: (b -> a -> b) -> b -> IntMap a -> b # foldl' :: (b -> a -> b) -> b -> IntMap a -> b # foldr1 :: (a -> a -> a) -> IntMap a -> a # foldl1 :: (a -> a -> a) -> IntMap a -> a # elem :: Eq a => a -> IntMap a -> Bool # maximum :: Ord a => IntMap a -> a # minimum :: Ord a => IntMap a -> a # | |
| Traversable IntMap | Traverses in order of increasing key. |
| Eq1 IntMap | Since: containers-0.5.9 |
| Ord1 IntMap | Since: containers-0.5.9 |
Defined in Data.IntMap.Internal | |
| Read1 IntMap | Since: containers-0.5.9 |
Defined in Data.IntMap.Internal | |
| Show1 IntMap | Since: containers-0.5.9 |
| IsList (IntMap a) | Since: containers-0.5.6.2 |
| Eq a => Eq (IntMap a) | |
| Data a => Data (IntMap a) | |
Defined in Data.IntMap.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IntMap a -> c (IntMap a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (IntMap a) # toConstr :: IntMap a -> Constr # dataTypeOf :: IntMap a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (IntMap a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (IntMap a)) # gmapT :: (forall b. Data b => b -> b) -> IntMap a -> IntMap a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IntMap a -> r # gmapQ :: (forall d. Data d => d -> u) -> IntMap a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> IntMap a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IntMap a -> m (IntMap a) # | |
| Ord a => Ord (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Read e => Read (IntMap e) | |
| Show a => Show (IntMap a) | |
| Semigroup (IntMap a) | Since: containers-0.5.7 |
| Monoid (IntMap a) | |
| NFData a => NFData (IntMap a) | |
Defined in Data.IntMap.Internal | |
| Ixed (IntMap a) | |
Defined in Control.Lens.At | |
| At (IntMap a) | |
| Wrapped (IntMap a) | |
| One (IntMap v) | |
| Container (IntMap v) | |
Defined in Universum.Container.Class Methods toList :: IntMap v -> [Element (IntMap v)] # foldr :: (Element (IntMap v) -> b -> b) -> b -> IntMap v -> b # foldl :: (b -> Element (IntMap v) -> b) -> b -> IntMap v -> b # foldl' :: (b -> Element (IntMap v) -> b) -> b -> IntMap v -> b # elem :: Element (IntMap v) -> IntMap v -> Bool # maximum :: IntMap v -> Element (IntMap v) # minimum :: IntMap v -> Element (IntMap v) # foldMap :: Monoid m => (Element (IntMap v) -> m) -> IntMap v -> m # fold :: IntMap v -> Element (IntMap v) # foldr' :: (Element (IntMap v) -> b -> b) -> b -> IntMap v -> b # foldr1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Element (IntMap v) # foldl1 :: (Element (IntMap v) -> Element (IntMap v) -> Element (IntMap v)) -> IntMap v -> Element (IntMap v) # notElem :: Element (IntMap v) -> IntMap v -> Bool # all :: (Element (IntMap v) -> Bool) -> IntMap v -> Bool # any :: (Element (IntMap v) -> Bool) -> IntMap v -> Bool # find :: (Element (IntMap v) -> Bool) -> IntMap v -> Maybe (Element (IntMap v)) # | |
| ToPairs (IntMap v) | |
| t ~ IntMap a' => Rewrapped (IntMap a) t | Use |
Defined in Control.Lens.Wrapped | |
| type Item (IntMap a) | |
Defined in Data.IntMap.Internal | |
| type Index (IntMap a) | |
Defined in Control.Lens.At | |
| type IxValue (IntMap a) | |
Defined in Control.Lens.At | |
| type Unwrapped (IntMap a) | |
Defined in Control.Lens.Wrapped | |
| type OneItem (IntMap v) | |
Defined in Universum.Container.Class | |
| type Element (IntMap v) | |
Defined in Universum.Container.Class | |
| type Val (IntMap v) | |
Defined in Universum.Container.Class | |
| type Key (IntMap v) | |
Defined in Universum.Container.Class | |
A set of integers.
Instances
General-purpose finite sequences.
Instances
| Monad Seq | |
| Functor Seq | |
| MonadFix Seq | Since: containers-0.5.11 |
Defined in Data.Sequence.Internal | |
| Applicative Seq | Since: containers-0.5.4 |
| Foldable Seq | |
Defined in Data.Sequence.Internal Methods fold :: Monoid m => Seq m -> m # foldMap :: Monoid m => (a -> m) -> Seq a -> m # foldMap' :: Monoid m => (a -> m) -> Seq a -> m # foldr :: (a -> b -> b) -> b -> Seq a -> b # foldr' :: (a -> b -> b) -> b -> Seq a -> b # foldl :: (b -> a -> b) -> b -> Seq a -> b # foldl' :: (b -> a -> b) -> b -> Seq a -> b # foldr1 :: (a -> a -> a) -> Seq a -> a # foldl1 :: (a -> a -> a) -> Seq a -> a # elem :: Eq a => a -> Seq a -> Bool # maximum :: Ord a => Seq a -> a # | |
| Traversable Seq | |
| Alternative Seq | Since: containers-0.5.4 |
| MonadPlus Seq | |
| Eq1 Seq | Since: containers-0.5.9 |
| Ord1 Seq | Since: containers-0.5.9 |
Defined in Data.Sequence.Internal | |
| Read1 Seq | Since: containers-0.5.9 |
Defined in Data.Sequence.Internal | |
| Show1 Seq | Since: containers-0.5.9 |
| MonadZip Seq |
|
| UnzipWith Seq | |
Defined in Data.Sequence.Internal Methods unzipWith' :: (x -> (a, b)) -> Seq x -> (Seq a, Seq b) | |
| IsList (Seq a) | |
| Eq a => Eq (Seq a) | |
| Data a => Data (Seq a) | |
Defined in Data.Sequence.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Seq a -> c (Seq a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Seq a) # dataTypeOf :: Seq a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Seq a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Seq a)) # gmapT :: (forall b. Data b => b -> b) -> Seq a -> Seq a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Seq a -> r # gmapQ :: (forall d. Data d => d -> u) -> Seq a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Seq a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Seq a -> m (Seq a) # | |
| Ord a => Ord (Seq a) | |
| Read a => Read (Seq a) | |
| Show a => Show (Seq a) | |
| a ~ Char => IsString (Seq a) | Since: containers-0.5.7 |
Defined in Data.Sequence.Internal Methods fromString :: String -> Seq a # | |
| Semigroup (Seq a) | Since: containers-0.5.7 |
| Monoid (Seq a) | |
| NFData a => NFData (Seq a) | |
Defined in Data.Sequence.Internal | |
| Ixed (Seq a) | |
Defined in Control.Lens.At | |
| Wrapped (Seq a) | |
| One (Seq a) | |
| Container (Seq a) | |
Defined in Universum.Container.Class Methods toList :: Seq a -> [Element (Seq a)] # foldr :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b # foldl :: (b -> Element (Seq a) -> b) -> b -> Seq a -> b # foldl' :: (b -> Element (Seq a) -> b) -> b -> Seq a -> b # elem :: Element (Seq a) -> Seq a -> Bool # maximum :: Seq a -> Element (Seq a) # minimum :: Seq a -> Element (Seq a) # foldMap :: Monoid m => (Element (Seq a) -> m) -> Seq a -> m # fold :: Seq a -> Element (Seq a) # foldr' :: (Element (Seq a) -> b -> b) -> b -> Seq a -> b # foldr1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # foldl1 :: (Element (Seq a) -> Element (Seq a) -> Element (Seq a)) -> Seq a -> Element (Seq a) # notElem :: Element (Seq a) -> Seq a -> Bool # all :: (Element (Seq a) -> Bool) -> Seq a -> Bool # any :: (Element (Seq a) -> Bool) -> Seq a -> Bool # find :: (Element (Seq a) -> Bool) -> Seq a -> Maybe (Element (Seq a)) # | |
| t ~ Seq a' => Rewrapped (Seq a) t | |
Defined in Control.Lens.Wrapped | |
| type Item (Seq a) | |
Defined in Data.Sequence.Internal | |
| type Index (Seq a) | |
Defined in Control.Lens.At | |
| type IxValue (Seq a) | |
Defined in Control.Lens.At | |
| type Unwrapped (Seq a) | |
Defined in Control.Lens.Wrapped | |
| type OneItem (Seq a) | |
Defined in Universum.Container.Class | |
| type Element (Seq a) | |
Defined in Universum.Container.Class | |
A set of values a.
Instances
| Foldable Set | Folds in order of increasing key. |
Defined in Data.Set.Internal Methods fold :: Monoid m => Set m -> m # foldMap :: Monoid m => (a -> m) -> Set a -> m # foldMap' :: Monoid m => (a -> m) -> Set a -> m # foldr :: (a -> b -> b) -> b -> Set a -> b # foldr' :: (a -> b -> b) -> b -> Set a -> b # foldl :: (b -> a -> b) -> b -> Set a -> b # foldl' :: (b -> a -> b) -> b -> Set a -> b # foldr1 :: (a -> a -> a) -> Set a -> a # foldl1 :: (a -> a -> a) -> Set a -> a # elem :: Eq a => a -> Set a -> Bool # maximum :: Ord a => Set a -> a # | |
| Eq1 Set | Since: containers-0.5.9 |
| Ord1 Set | Since: containers-0.5.9 |
Defined in Data.Set.Internal | |
| Show1 Set | Since: containers-0.5.9 |
| Ord a => IsList (Set a) | Since: containers-0.5.6.2 |
| Eq a => Eq (Set a) | |
| (Data a, Ord a) => Data (Set a) | |
Defined in Data.Set.Internal Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Set a -> c (Set a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Set a) # dataTypeOf :: Set a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Set a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Set a)) # gmapT :: (forall b. Data b => b -> b) -> Set a -> Set a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Set a -> r # gmapQ :: (forall d. Data d => d -> u) -> Set a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Set a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Set a -> m (Set a) # | |
| Ord a => Ord (Set a) | |
| (Read a, Ord a) => Read (Set a) | |
| Show a => Show (Set a) | |
| Ord a => Semigroup (Set a) | Since: containers-0.5.7 |
| Ord a => Monoid (Set a) | |
| NFData a => NFData (Set a) | |
Defined in Data.Set.Internal | |
| Ord a => Contains (Set a) | |
| Ord k => Ixed (Set k) | |
Defined in Control.Lens.At | |
| Ord k => At (Set k) | |
| Ord a => Wrapped (Set a) | |
| NiceComparable e => MemOpHs (Set e) | |
Defined in Lorentz.Polymorphic Associated Types type MemOpKeyHs (Set e) # | |
| NiceComparable e => IterOpHs (Set e) | |
Defined in Lorentz.Polymorphic Associated Types type IterOpElHs (Set e) # | |
| SizeOpHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| NiceComparable a => UpdOpHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| KnownIsoT v => HasAnnotation (Set v) | |
Defined in Lorentz.Annotation Methods getAnnotation :: Notes (ToT (Set v)) # | |
| (Comparable (ToT c), Ord c, IsoValue c) => IsoValue (Set c) | |
| PolyCTypeHasDocC '[a] => TypeHasDoc (Set a) | |
Defined in Michelson.Typed.Haskell.Doc Associated Types type TypeDocFieldDescriptions (Set a) :: FieldDescriptions # Methods typeDocName :: Proxy (Set a) -> Text # typeDocMdDescription :: Markdown # typeDocMdReference :: Proxy (Set a) -> WithinParens -> Markdown # typeDocDependencies :: Proxy (Set a) -> [SomeDocDefinitionItem] # typeDocHaskellRep :: TypeDocHaskellRep (Set a) # | |
| One (Set v) | |
| Ord v => Container (Set v) | |
Defined in Universum.Container.Class Methods toList :: Set v -> [Element (Set v)] # foldr :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldl :: (b -> Element (Set v) -> b) -> b -> Set v -> b # foldl' :: (b -> Element (Set v) -> b) -> b -> Set v -> b # elem :: Element (Set v) -> Set v -> Bool # maximum :: Set v -> Element (Set v) # minimum :: Set v -> Element (Set v) # foldMap :: Monoid m => (Element (Set v) -> m) -> Set v -> m # fold :: Set v -> Element (Set v) # foldr' :: (Element (Set v) -> b -> b) -> b -> Set v -> b # foldr1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # foldl1 :: (Element (Set v) -> Element (Set v) -> Element (Set v)) -> Set v -> Element (Set v) # notElem :: Element (Set v) -> Set v -> Bool # all :: (Element (Set v) -> Bool) -> Set v -> Bool # any :: (Element (Set v) -> Bool) -> Set v -> Bool # find :: (Element (Set v) -> Bool) -> Set v -> Maybe (Element (Set v)) # | |
| (t ~ Set a', Ord a) => Rewrapped (Set a) t | Use |
Defined in Control.Lens.Wrapped | |
| CanCastTo k1 k2 => CanCastTo (Set k1 :: Type) (Set k2 :: Type) | |
| type Item (Set a) | |
Defined in Data.Set.Internal | |
| type Index (Set a) | |
Defined in Control.Lens.At | |
| type IxValue (Set k) | |
Defined in Control.Lens.At | |
| type Unwrapped (Set a) | |
Defined in Control.Lens.Wrapped | |
| type MemOpKeyHs (Set e) | |
Defined in Lorentz.Polymorphic | |
| type IterOpElHs (Set e) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpParamsHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| type UpdOpKeyHs (Set a) | |
Defined in Lorentz.Polymorphic | |
| type ToT (Set c) | |
Defined in Michelson.Typed.Haskell.Value | |
| type TypeDocFieldDescriptions (Set a) | |
Defined in Michelson.Typed.Haskell.Doc | |
| type OneItem (Set v) | |
Defined in Universum.Container.Class | |
| type Element (Set v) | |
Defined in Universum.Container.Class | |
A class of types that can be fully evaluated.
Since: deepseq-1.1.0.0
Minimal complete definition
Nothing
Methods
rnf should reduce its argument to normal form (that is, fully
evaluate all sub-components), and then return ().
Generic NFData deriving
Starting with GHC 7.2, you can automatically derive instances
for types possessing a Generic instance.
Note: Generic1 can be auto-derived starting with GHC 7.4
{-# LANGUAGE DeriveGeneric #-}
import GHC.Generics (Generic, Generic1)
import Control.DeepSeq
data Foo a = Foo a String
deriving (Eq, Generic, Generic1)
instance NFData a => NFData (Foo a)
instance NFData1 Foo
data Colour = Red | Green | Blue
deriving Generic
instance NFData ColourStarting with GHC 7.10, the example above can be written more
concisely by enabling the new DeriveAnyClass extension:
{-# LANGUAGE DeriveGeneric, DeriveAnyClass #-}
import GHC.Generics (Generic)
import Control.DeepSeq
data Foo a = Foo a String
deriving (Eq, Generic, Generic1, NFData, NFData1)
data Colour = Red | Green | Blue
deriving (Generic, NFData)
Compatibility with previous deepseq versions
Prior to version 1.4.0.0, the default implementation of the rnf
method was defined as
rnfa =seqa ()
However, starting with deepseq-1.4.0.0, the default
implementation is based on DefaultSignatures allowing for
more accurate auto-derived NFData instances. If you need the
previously used exact default rnf method implementation
semantics, use
instance NFData Colour where rnf x = seq x ()
or alternatively
instance NFData Colour where rnf = rwhnf
or
{-# LANGUAGE BangPatterns #-}
instance NFData Colour where rnf !_ = ()Instances
a variant of deepseq that is useful in some circumstances:
force x = x `deepseq` x
force x fully evaluates x, and then returns it. Note that
force x only performs evaluation when the value of force x
itself is demanded, so essentially it turns shallow evaluation into
deep evaluation.
force can be conveniently used in combination with ViewPatterns:
{-# LANGUAGE BangPatterns, ViewPatterns #-}
import Control.DeepSeq
someFun :: ComplexData -> SomeResult
someFun (force -> !arg) = {- 'arg' will be fully evaluated -}Another useful application is to combine force with
evaluate in order to force deep evaluation
relative to other IO operations:
import Control.Exception (evaluate)
import Control.DeepSeq
main = do
result <- evaluate $ force $ pureComputation
{- 'result' will be fully evaluated at this point -}
return ()Finally, here's an exception safe variant of the readFile' example:
readFile' :: FilePath -> IO String
readFile' fn = bracket (openFile fn ReadMode) hClose $ \h ->
evaluate . force =<< hGetContents hSince: deepseq-1.2.0.0
($!!) :: NFData a => (a -> b) -> a -> b infixr 0 #
the deep analogue of $!. In the expression f $!! x, x is
fully evaluated before the function f is applied to it.
Since: deepseq-1.2.0.0
deepseq :: NFData a => a -> b -> b #
deepseq: fully evaluates the first argument, before returning the
second.
The name deepseq is used to illustrate the relationship to seq:
where seq is shallow in the sense that it only evaluates the top
level of its argument, deepseq traverses the entire data structure
evaluating it completely.
deepseq can be useful for forcing pending exceptions,
eradicating space leaks, or forcing lazy I/O to happen. It is
also useful in conjunction with parallel Strategies (see the
parallel package).
There is no guarantee about the ordering of evaluation. The
implementation may evaluate the components of the structure in
any order or in parallel. To impose an actual order on
evaluation, use pseq from Control.Parallel in the
parallel package.
Since: deepseq-1.1.0.0
newtype MaybeT (m :: Type -> Type) a #
The parameterizable maybe monad, obtained by composing an arbitrary
monad with the Maybe monad.
Computations are actions that may produce a value or exit.
The return function yields a computation that produces that
value, while >>= sequences two subcomputations, exiting if either
computation does.
Instances
newtype ExceptT e (m :: Type -> Type) a #
A monad transformer that adds exceptions to other monads.
ExceptT constructs a monad parameterized over two things:
- e - The exception type.
- m - The inner monad.
The return function yields a computation that produces the given
value, while >>= sequences two subcomputations, exiting on the
first exception.
Instances
class Monad m => MonadThrow (m :: Type -> Type) #
A class for monads in which exceptions may be thrown.
Instances should obey the following law:
throwM e >> x = throwM e
In other words, throwing an exception short-circuits the rest of the monadic computation.
Minimal complete definition
Instances
class MonadThrow m => MonadCatch (m :: Type -> Type) #
A class for monads which allow exceptions to be caught, in particular
exceptions which were thrown by throwM.
Instances should obey the following law:
catch (throwM e) f = f e
Note that the ability to catch an exception does not guarantee that we can
deal with all possible exit points from a computation. Some monads, such as
continuation-based stacks, allow for more than just a success/failure
strategy, and therefore catch cannot be used by those monads to properly
implement a function such as finally. For more information, see
MonadMask.
Minimal complete definition
Instances
| MonadCatch IO | |
| MonadCatch STM | |
| e ~ SomeException => MonadCatch (Either e) | Since: exceptions-0.8.3 |
| MonadCatch m => MonadCatch (MaybeT m) | Catches exceptions from the base monad. |
| MonadCatch m => MonadCatch (ListT m) | |
| MonadCatch m => MonadCatch (IdentityT m) | |
| MonadCatch m => MonadCatch (ExceptT e m) | Catches exceptions from the base monad. |
| (Functor f, MonadCatch m) => MonadCatch (FreeT f m) | |
| (Error e, MonadCatch m) => MonadCatch (ErrorT e m) | Catches exceptions from the base monad. |
| MonadCatch m => MonadCatch (StateT s m) | |
| MonadCatch m => MonadCatch (StateT s m) | |
| MonadCatch m => MonadCatch (ReaderT r m) | |
| (MonadCatch m, Monoid w) => MonadCatch (WriterT w m) | |
| (MonadCatch m, Monoid w) => MonadCatch (WriterT w m) | |
| (MonadCatch m, Monoid w) => MonadCatch (RWST r w s m) | |
| (MonadCatch m, Monoid w) => MonadCatch (RWST r w s m) | |
class MonadCatch m => MonadMask (m :: Type -> Type) where #
A class for monads which provide for the ability to account for all possible exit points from a computation, and to mask asynchronous exceptions. Continuation-based monads are invalid instances of this class.
Instances should ensure that, in the following code:
fg = f `finally` g
The action g is called regardless of what occurs within f, including
async exceptions. Some monads allow f to abort the computation via other
effects than throwing an exception. For simplicity, we will consider aborting
and throwing an exception to be two forms of "throwing an error".
If f and g both throw an error, the error thrown by fg depends on which
errors we're talking about. In a monad transformer stack, the deeper layers
override the effects of the inner layers; for example, ExceptT e1 (Except
e2) a represents a value of type Either e2 (Either e1 a), so throwing both
an e1 and an e2 will result in Left e2. If f and g both throw an
error from the same layer, instances should ensure that the error from g
wins.
Effects other than throwing an error are also overriden by the deeper layers.
For example, StateT s Maybe a represents a value of type s -> Maybe (a,
s), so if an error thrown from f causes this function to return Nothing,
any changes to the state which f also performed will be erased. As a
result, g will see the state as it was before f. Once g completes,
f's error will be rethrown, so g' state changes will be erased as well.
This is the normal interaction between effects in a monad transformer stack.
By contrast, lifted-base's
version of finally always discards all of g's non-IO effects, and g
never sees any of f's non-IO effects, regardless of the layer ordering and
regardless of whether f throws an error. This is not the result of
interacting effects, but a consequence of MonadBaseControl's approach.
Methods
mask :: ((forall a. m a -> m a) -> m b) -> m b #
Runs an action with asynchronous exceptions disabled. The action is
provided a method for restoring the async. environment to what it was
at the mask call. See Control.Exception's mask.
uninterruptibleMask :: ((forall a. m a -> m a) -> m b) -> m b #
Like mask, but the masked computation is not interruptible (see
Control.Exception's uninterruptibleMask. WARNING:
Only use if you need to mask exceptions around an interruptible operation
AND you can guarantee the interruptible operation will only block for a
short period of time. Otherwise you render the program/thread unresponsive
and/or unkillable.
Arguments
| :: m a | acquire some resource |
| -> (a -> ExitCase b -> m c) | release the resource, observing the outcome of the inner action |
| -> (a -> m b) | inner action to perform with the resource |
| -> m (b, c) |
A generalized version of bracket which uses ExitCase to distinguish
the different exit cases, and returns the values of both the use and
release actions. In practice, this extra information is rarely needed,
so it is often more convenient to use one of the simpler functions which
are defined in terms of this one, such as bracket, finally, onError,
and bracketOnError.
This function exists because in order to thread their effects through the
execution of bracket, monad transformers need values to be threaded from
use to release and from release to the output value.
NOTE This method was added in version 0.9.0 of this
library. Previously, implementation of functions like bracket
and finally in this module were based on the mask and
uninterruptibleMask functions only, disallowing some classes of
tranformers from having MonadMask instances (notably
multi-exit-point transformers like ExceptT). If you are a
library author, you'll now need to provide an implementation for
this method. The StateT implementation demonstrates most of the
subtleties:
generalBracket acquire release use = StateT $ s0 -> do
((b, _s2), (c, s3)) <- generalBracket
(runStateT acquire s0)
((resource, s1) exitCase -> case exitCase of
ExitCaseSuccess (b, s2) -> runStateT (release resource (ExitCaseSuccess b)) s2
-- In the two other cases, the base monad overrides use's state
-- changes and the state reverts to s1.
ExitCaseException e -> runStateT (release resource (ExitCaseException e)) s1
ExitCaseAbort -> runStateT (release resource ExitCaseAbort) s1
)
((resource, s1) -> runStateT (use resource) s1)
return ((b, c), s3)
The StateT s m implementation of generalBracket delegates to the m
implementation of generalBracket. The acquire, use, and release
arguments given to StateT's implementation produce actions of type
StateT s m a, StateT s m b, and StateT s m c. In order to run those
actions in the base monad, we need to call runStateT, from which we
obtain actions of type m (a, s), m (b, s), and m (c, s). Since each
action produces the next state, it is important to feed the state produced
by the previous action to the next action.
In the ExitCaseSuccess case, the state starts at s0, flows through
acquire to become s1, flows through use to become s2, and finally
flows through release to become s3. In the other two cases, release
does not receive the value s2, so its action cannot see the state changes
performed by use. This is fine, because in those two cases, an error was
thrown in the base monad, so as per the usual interaction between effects
in a monad transformer stack, those state changes get reverted. So we start
from s1 instead.
Finally, the m implementation of generalBracket returns the pairs
(b, s) and (c, s). For monad transformers other than StateT, this
will be some other type representing the effects and values performed and
returned by the use and release actions. The effect part of the use
result, in this case _s2, usually needs to be discarded, since those
effects have already been incorporated in the release action.
The only effect which is intentionally not incorporated in the release
action is the effect of throwing an error. In that case, the error must be
re-thrown. One subtlety which is easy to miss is that in the case in which
use and release both throw an error, the error from release should
take priority. Here is an implementation for ExceptT which demonstrates
how to do this.
generalBracket acquire release use = ExceptT $ do
(eb, ec) <- generalBracket
(runExceptT acquire)
(eresource exitCase -> case eresource of
Left e -> return (Left e) -- nothing to release, acquire didn't succeed
Right resource -> case exitCase of
ExitCaseSuccess (Right b) -> runExceptT (release resource (ExitCaseSuccess b))
ExitCaseException e -> runExceptT (release resource (ExitCaseException e))
_ -> runExceptT (release resource ExitCaseAbort))
(either (return . Left) (runExceptT . use))
return $ do
-- The order in which we perform those two Either effects determines
-- which error will win if they are both Lefts. We want the error from
-- release to win.
c <- ec
b <- eb
return (b, c)
Since: exceptions-0.9.0
Instances
| MonadMask IO | |
| e ~ SomeException => MonadMask (Either e) | Since: exceptions-0.8.3 |
Defined in Control.Monad.Catch | |
| MonadMask m => MonadMask (MaybeT m) | Since: exceptions-0.10.0 |
Defined in Control.Monad.Catch | |
| MonadMask m => MonadMask (IdentityT m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. IdentityT m a -> IdentityT m a) -> IdentityT m b) -> IdentityT m b # uninterruptibleMask :: ((forall a. IdentityT m a -> IdentityT m a) -> IdentityT m b) -> IdentityT m b # generalBracket :: IdentityT m a -> (a -> ExitCase b -> IdentityT m c) -> (a -> IdentityT m b) -> IdentityT m (b, c) # | |
| MonadMask m => MonadMask (ExceptT e m) | Since: exceptions-0.9.0 |
Defined in Control.Monad.Catch Methods mask :: ((forall a. ExceptT e m a -> ExceptT e m a) -> ExceptT e m b) -> ExceptT e m b # uninterruptibleMask :: ((forall a. ExceptT e m a -> ExceptT e m a) -> ExceptT e m b) -> ExceptT e m b # generalBracket :: ExceptT e m a -> (a -> ExitCase b -> ExceptT e m c) -> (a -> ExceptT e m b) -> ExceptT e m (b, c) # | |
| (Error e, MonadMask m) => MonadMask (ErrorT e m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. ErrorT e m a -> ErrorT e m a) -> ErrorT e m b) -> ErrorT e m b # uninterruptibleMask :: ((forall a. ErrorT e m a -> ErrorT e m a) -> ErrorT e m b) -> ErrorT e m b # generalBracket :: ErrorT e m a -> (a -> ExitCase b -> ErrorT e m c) -> (a -> ErrorT e m b) -> ErrorT e m (b, c) # | |
| MonadMask m => MonadMask (StateT s m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # uninterruptibleMask :: ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # generalBracket :: StateT s m a -> (a -> ExitCase b -> StateT s m c) -> (a -> StateT s m b) -> StateT s m (b, c) # | |
| MonadMask m => MonadMask (StateT s m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # uninterruptibleMask :: ((forall a. StateT s m a -> StateT s m a) -> StateT s m b) -> StateT s m b # generalBracket :: StateT s m a -> (a -> ExitCase b -> StateT s m c) -> (a -> StateT s m b) -> StateT s m (b, c) # | |
| MonadMask m => MonadMask (ReaderT r m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # uninterruptibleMask :: ((forall a. ReaderT r m a -> ReaderT r m a) -> ReaderT r m b) -> ReaderT r m b # generalBracket :: ReaderT r m a -> (a -> ExitCase b -> ReaderT r m c) -> (a -> ReaderT r m b) -> ReaderT r m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (WriterT w m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # uninterruptibleMask :: ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # generalBracket :: WriterT w m a -> (a -> ExitCase b -> WriterT w m c) -> (a -> WriterT w m b) -> WriterT w m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (WriterT w m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # uninterruptibleMask :: ((forall a. WriterT w m a -> WriterT w m a) -> WriterT w m b) -> WriterT w m b # generalBracket :: WriterT w m a -> (a -> ExitCase b -> WriterT w m c) -> (a -> WriterT w m b) -> WriterT w m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (RWST r w s m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # uninterruptibleMask :: ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # generalBracket :: RWST r w s m a -> (a -> ExitCase b -> RWST r w s m c) -> (a -> RWST r w s m b) -> RWST r w s m (b, c) # | |
| (MonadMask m, Monoid w) => MonadMask (RWST r w s m) | |
Defined in Control.Monad.Catch Methods mask :: ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # uninterruptibleMask :: ((forall a. RWST r w s m a -> RWST r w s m a) -> RWST r w s m b) -> RWST r w s m b # generalBracket :: RWST r w s m a -> (a -> ExitCase b -> RWST r w s m c) -> (a -> RWST r w s m b) -> RWST r w s m (b, c) # | |
A set of values. A set cannot contain duplicate values.
Instances
| Foldable HashSet | |
Defined in Data.HashSet.Base Methods fold :: Monoid m => HashSet m -> m # foldMap :: Monoid m => (a -> m) -> HashSet a -> m # foldMap' :: Monoid m => (a -> m) -> HashSet a -> m # foldr :: (a -> b -> b) -> b -> HashSet a -> b # foldr' :: (a -> b -> b) -> b -> HashSet a -> b # foldl :: (b -> a -> b) -> b -> HashSet a -> b # foldl' :: (b -> a -> b) -> b -> HashSet a -> b # foldr1 :: (a -> a -> a) -> HashSet a -> a # foldl1 :: (a -> a -> a) -> HashSet a -> a # elem :: Eq a => a -> HashSet a -> Bool # maximum :: Ord a => HashSet a -> a # minimum :: Ord a => HashSet a -> a # | |
| Eq1 HashSet | |
| Ord1 HashSet | |
Defined in Data.HashSet.Base | |
| Show1 HashSet | |
| Hashable1 HashSet | |
Defined in Data.HashSet.Base | |
| (Eq a, Hashable a) => IsList (HashSet a) | |
| Eq a => Eq (HashSet a) | |
| (Data a, Eq a, Hashable a) => Data (HashSet a) | |
Defined in Data.HashSet.Base Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HashSet a -> c (HashSet a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HashSet a) # toConstr :: HashSet a -> Constr # dataTypeOf :: HashSet a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HashSet a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HashSet a)) # gmapT :: (forall b. Data b => b -> b) -> HashSet a -> HashSet a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HashSet a -> r # gmapQ :: (forall d. Data d => d -> u) -> HashSet a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> HashSet a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HashSet a -> m (HashSet a) # | |
| Ord a => Ord (HashSet a) | |
| (Eq a, Hashable a, Read a) => Read (HashSet a) | |
| Show a => Show (HashSet a) | |
| (Hashable a, Eq a) => Semigroup (HashSet a) | |
| (Hashable a, Eq a) => Monoid (HashSet a) | |
| Hashable a => Hashable (HashSet a) | |
Defined in Data.HashSet.Base | |
| NFData a => NFData (HashSet a) | |
Defined in Data.HashSet.Base | |
| (Eq a, Hashable a) => Contains (HashSet a) | |
| (Eq k, Hashable k) => Ixed (HashSet k) | |
Defined in Control.Lens.At | |
| (Eq k, Hashable k) => At (HashSet k) | |
| (Hashable a, Eq a) => Wrapped (HashSet a) | |
| Hashable v => One (HashSet v) | |
| (Eq v, Hashable v) => Container (HashSet v) | |
Defined in Universum.Container.Class Methods toList :: HashSet v -> [Element (HashSet v)] # foldr :: (Element (HashSet v) -> b -> b) -> b -> HashSet v -> b # foldl :: (b -> Element (HashSet v) -> b) -> b -> HashSet v -> b # foldl' :: (b -> Element (HashSet v) -> b) -> b -> HashSet v -> b # elem :: Element (HashSet v) -> HashSet v -> Bool # maximum :: HashSet v -> Element (HashSet v) # minimum :: HashSet v -> Element (HashSet v) # foldMap :: Monoid m => (Element (HashSet v) -> m) -> HashSet v -> m # fold :: HashSet v -> Element (HashSet v) # foldr' :: (Element (HashSet v) -> b -> b) -> b -> HashSet v -> b # foldr1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Element (HashSet v) # foldl1 :: (Element (HashSet v) -> Element (HashSet v) -> Element (HashSet v)) -> HashSet v -> Element (HashSet v) # notElem :: Element (HashSet v) -> HashSet v -> Bool # all :: (Element (HashSet v) -> Bool) -> HashSet v -> Bool # any :: (Element (HashSet v) -> Bool) -> HashSet v -> Bool # find :: (Element (HashSet v) -> Bool) -> HashSet v -> Maybe (Element (HashSet v)) # | |
| (t ~ HashSet a', Hashable a, Eq a) => Rewrapped (HashSet a) t | Use |
Defined in Control.Lens.Wrapped | |
| type Item (HashSet a) | |
Defined in Data.HashSet.Base | |
| type Index (HashSet a) | |
Defined in Control.Lens.At | |
| type IxValue (HashSet k) | |
Defined in Control.Lens.At | |
| type Unwrapped (HashSet a) | |
Defined in Control.Lens.Wrapped | |
| type OneItem (HashSet v) | |
Defined in Universum.Container.Class | |
| type Element (HashSet v) | |
Defined in Universum.Container.Class | |
newtype StateT s (m :: Type -> Type) a #
A state transformer monad parameterized by:
s- The state.m- The inner monad.
The return function leaves the state unchanged, while >>= uses
the final state of the first computation as the initial state of
the second.
Instances
type State s = StateT s Identity #
A state monad parameterized by the type s of the state to carry.
The return function leaves the state unchanged, while >>= uses
the final state of the first computation as the initial state of
the second.
Boxed vectors, supporting efficient slicing.
Instances
| Monad Vector | |
| Functor Vector | |
| MonadFail Vector | Since: vector-0.12.1.0 |
Defined in Data.Vector | |
| Applicative Vector | |
| Foldable Vector | |
Defined in Data.Vector Methods fold :: Monoid m => Vector m -> m # foldMap :: Monoid m => (a -> m) -> Vector a -> m # foldMap' :: Monoid m => (a -> m) -> Vector a -> m # foldr :: (a -> b -> b) -> b -> Vector a -> b # foldr' :: (a -> b -> b) -> b -> Vector a -> b # foldl :: (b -> a -> b) -> b -> Vector a -> b # foldl' :: (b -> a -> b) -> b -> Vector a -> b # foldr1 :: (a -> a -> a) -> Vector a -> a # foldl1 :: (a -> a -> a) -> Vector a -> a # elem :: Eq a => a -> Vector a -> Bool # maximum :: Ord a => Vector a -> a # minimum :: Ord a => Vector a -> a # | |
| Traversable Vector | |
| Alternative Vector | |
| MonadPlus Vector | |
| Eq1 Vector | |
| Ord1 Vector | |
Defined in Data.Vector | |
| Read1 Vector | |
Defined in Data.Vector | |
| Show1 Vector | |
| MonadZip Vector | |
| NFData1 Vector | Since: vector-0.12.1.0 |
Defined in Data.Vector | |
| Vector Vector a | |
Defined in Data.Vector Methods basicUnsafeFreeze :: PrimMonad m => Mutable Vector (PrimState m) a -> m (Vector a) # basicUnsafeThaw :: PrimMonad m => Vector a -> m (Mutable Vector (PrimState m) a) # basicLength :: Vector a -> Int # basicUnsafeSlice :: Int -> Int -> Vector a -> Vector a # basicUnsafeIndexM :: Monad m => Vector a -> Int -> m a # basicUnsafeCopy :: PrimMonad m => Mutable Vector (PrimState m) a -> Vector a -> m () # | |
| IsList (Vector a) | |
| Eq a => Eq (Vector a) | |
| Data a => Data (Vector a) | |
Defined in Data.Vector Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Vector a -> c (Vector a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Vector a) # toConstr :: Vector a -> Constr # dataTypeOf :: Vector a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Vector a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Vector a)) # gmapT :: (forall b. Data b => b -> b) -> Vector a -> Vector a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Vector a -> r # gmapQ :: (forall d. Data d => d -> u) -> Vector a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Vector a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Vector a -> m (Vector a) # | |
| Ord a => Ord (Vector a) | |
Defined in Data.Vector | |
| Read a => Read (Vector a) | |
| Show a => Show (Vector a) | |
| Semigroup (Vector a) | |
| Monoid (Vector a) | |
| NFData a => NFData (Vector a) | |
Defined in Data.Vector | |
| Ixed (Vector a) | |
Defined in Control.Lens.At | |
| Wrapped (Vector a) | |
| One (Vector a) | |
| Container (Vector a) | |
Defined in Universum.Container.Class Methods toList :: Vector a -> [Element (Vector a)] # foldr :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # foldl :: (b -> Element (Vector a) -> b) -> b -> Vector a -> b # foldl' :: (b -> Element (Vector a) -> b) -> b -> Vector a -> b # elem :: Element (Vector a) -> Vector a -> Bool # maximum :: Vector a -> Element (Vector a) # minimum :: Vector a -> Element (Vector a) # foldMap :: Monoid m => (Element (Vector a) -> m) -> Vector a -> m # fold :: Vector a -> Element (Vector a) # foldr' :: (Element (Vector a) -> b -> b) -> b -> Vector a -> b # foldr1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # foldl1 :: (Element (Vector a) -> Element (Vector a) -> Element (Vector a)) -> Vector a -> Element (Vector a) # notElem :: Element (Vector a) -> Vector a -> Bool # all :: (Element (Vector a) -> Bool) -> Vector a -> Bool # any :: (Element (Vector a) -> Bool) -> Vector a -> Bool # find :: (Element (Vector a) -> Bool) -> Vector a -> Maybe (Element (Vector a)) # | |
| t ~ Vector a' => Rewrapped (Vector a) t | |
Defined in Control.Lens.Wrapped | |
| type Mutable Vector | |
Defined in Data.Vector | |
| type Item (Vector a) | |
Defined in Data.Vector | |
| type Index (Vector a) | |
Defined in Control.Lens.At | |
| type IxValue (Vector a) | |
Defined in Control.Lens.At | |
| type Unwrapped (Vector a) | |
Defined in Control.Lens.Wrapped | |
| type OneItem (Vector a) | |
Defined in Universum.Container.Class | |
| type Element (Vector a) | |
Defined in Universum.Container.Class | |
type Reader r = ReaderT r Identity #
The parameterizable reader monad.
Computations are functions of a shared environment.
The return function ignores the environment, while >>= passes
the inherited environment to both subcomputations.
gets :: MonadState s m => (s -> a) -> m a #
Gets specific component of the state, using a projection function supplied.
type ($) (f :: k1 -> k) (a :: k1) = f a infixr 2 #
Infix application.
f :: Either String $ Maybe Int = f :: Either String (Maybe Int)
undefined :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => a #
undefined that leaves a warning in code on every usage.
error :: forall (r :: RuntimeRep) (a :: TYPE r). HasCallStack => Text -> a #
(^..) :: s -> Getting (Endo [a]) s a -> [a] infixl 8 #
s ^.. t returns the list of all values that t gets from s.
A Maybe contains either 0 or 1 values:
>>>Just 3 ^.. _Just[3]
Gathering all values in a list of tuples:
>>>[(1,2),(3,4)] ^.. each.each[1,2,3,4]
over :: ASetter s t a b -> (a -> b) -> s -> t #
Getting fmap in a roundabout way:
overmapped::Functorf => (a -> b) -> f a -> f bovermapped=fmap
Applying a function to both components of a pair:
overboth:: (a -> b) -> (a, a) -> (b, b)overboth= \f t -> (f (fst t), f (snd t))
Using over _2second:
>>>over _2 show (10,20)(10,"20")
_1 :: Field1 s t a b => Lens s t a b #
Gives access to the 1st field of a tuple (up to 5-tuples).
Getting the 1st component:
>>>(1,2,3,4,5) ^. _11
Setting the 1st component:
>>>(1,2,3) & _1 .~ 10(10,2,3)
Note that this lens is lazy, and can set fields even of undefined:
>>>set _1 10 undefined :: (Int, Int)(10,*** Exception: Prelude.undefined
This is done to avoid violating a lens law stating that you can get back what you put:
>>>view _1 . set _1 10 $ (undefined :: (Int, Int))10
The implementation (for 2-tuples) is:
_1f t = (,)<$>f (fstt)<*>pure(sndt)
or, alternatively,
_1f ~(a,b) = (\a' -> (a',b))<$>f a
(where ~ means a lazy pattern).
type Lens s t a b = forall (f :: Type -> Type). Functor f => (a -> f b) -> s -> f t #
Lens s t a b is the lowest common denominator of a setter and a getter, something that has the power of both; it has a Functor constraint, and since both Const and Identity are functors, it can be used whenever a getter or a setter is needed.
ais the type of the value inside of structurebis the type of the replaced valuesis the type of the whole structuretis the type of the structure after replacingain it withb
type Lens' s a = Lens s s a a #
This is a type alias for monomorphic lenses which don't change the type of the container (or of the value inside).
type Traversal s t a b = forall (f :: Type -> Type). Applicative f => (a -> f b) -> s -> f t #
Traversal s t a b is a generalisation of Lens which allows many targets (possibly 0). It's achieved by changing the constraint to Applicative instead of Functor – indeed, the point of Applicative is that you can combine effects, which is just what we need to have many targets.
Ultimately, traversals should follow 2 laws:
t pure ≡ pure fmap (t f) . t g ≡ getCompose . t (Compose . fmap f . g)
The 1st law states that you can't change the shape of the structure or do anything funny with elements (traverse elements which aren't in the structure, create new elements out of thin air, etc.). The 2nd law states that you should be able to fuse 2 identical traversals into one. For a more detailed explanation of the laws, see this blog post (if you prefer rambling blog posts), or The Essence Of The Iterator Pattern (if you prefer papers).
Traversing any value twice is a violation of traversal laws. You can, however, traverse values in any order.
type Traversal' s a = Traversal s s a a #
This is a type alias for monomorphic traversals which don't change the type of the container (or of the values inside).
modify :: MonadState s m => (s -> s) -> m () #
Monadic state transformer.
Maps an old state to a new state inside a state monad. The old state is thrown away.
Main> :t modify ((+1) :: Int -> Int)
modify (...) :: (MonadState Int a) => a ()This says that modify (+1) acts over any
Monad that is a member of the MonadState class,
with an Int state.
Arguments
| :: MonadReader r m | |
| => (r -> a) | The selector function to apply to the environment. |
| -> m a |
Retrieves a function of the current environment.
newtype ReaderT r (m :: Type -> Type) a #
The reader monad transformer, which adds a read-only environment to the given monad.
The return function ignores the environment, while >>= passes
the inherited environment to both subcomputations.
Constructors
| ReaderT | |
Fields
| |
Instances
use :: MonadState s m => Getting a s a -> m a #
use is (^.) (or view) which implicitly operates on the state; for instance, if your state is a record containing a field foo, you can write
x <- use foo
to extract foo from the state. In other words, use is the same as gets, but for getters instead of functions.
The implementation of use is straightforward:
usel =gets(viewl)
If you need to extract something with a fold or traversal, you need preuse.
preview :: MonadReader s m => Getting (First a) s a -> m (Maybe a) #
preview is a synonym for (^?), generalised for MonadReader (just like view, which is a synonym for (^.)).
>>>preview each [1..5]Just 1
view :: MonadReader s m => Getting a s a -> m a #
view is a synonym for (^.), generalised for MonadReader (we are able to use it instead of (^.) since functions are instances of the MonadReader class):
>>>view _1 (1, 2)1
When you're using Reader for config and your config type has lenses generated for it, most of the time you'll be using view instead of asks:
doSomething :: (MonadReaderConfig m) => m Int doSomething = do thingy <-viewsetting1 -- same as “asks(^.setting1)” anotherThingy <-viewsetting2 ...
type family Each (c :: [k -> Constraint]) (as :: [k]) where ... #
Map several constraints over several variables.
f :: Each [Show, Read] [a, b] => a -> b -> String = f :: (Show a, Show b, Read a, Read b) => a -> b -> String
To specify list with single constraint / variable, don't forget to prefix
it with ':
f :: Each '[Show] [a, b] => a -> b -> String
Equations
| Each (c :: [k -> Constraint]) ('[] :: [k]) = () | |
| Each (c :: [k -> Constraint]) (h ': t :: [k]) = (c <+> h, Each c t) |
pass :: Applicative f => f () #
Shorter alias for pure ().
>>>pass :: Maybe ()Just ()
($!) :: (a -> b) -> a -> b infixr 0 #
Stricter version of $ operator.
Default Prelude defines this at the toplevel module, so we do as well.
>>>const 3 $ Prelude.undefined3>>>const 3 $! Prelude.undefined*** Exception: Prelude.undefined ...
(<<$>>) :: (Functor f, Functor g) => (a -> b) -> f (g a) -> f (g b) infixl 4 #
Alias for fmap . fmap. Convenient to work with two nested Functors.
>>>negate <<$>> Just [1,2,3]Just [-1,-2,-3]
newEmptyMVar :: MonadIO m => m (MVar a) #
Lifted to MonadIO version of newEmptyMVar.
tryPutMVar :: MonadIO m => MVar a -> a -> m Bool #
Lifted to MonadIO version of tryPutMVar.
tryReadMVar :: MonadIO m => MVar a -> m (Maybe a) #
Lifted to MonadIO version of tryReadMVar.
tryTakeMVar :: MonadIO m => MVar a -> m (Maybe a) #
Lifted to MonadIO version of tryTakeMVar.
atomically :: MonadIO m => STM a -> m a #
Lifted to MonadIO version of atomically.
readTVarIO :: MonadIO m => TVar a -> m a #
Lifted to MonadIO version of readTVarIO.
exitFailure :: MonadIO m => m a #
Lifted version of exitFailure.
exitSuccess :: MonadIO m => m a #
Lifted version of exitSuccess.
appendFile :: MonadIO m => FilePath -> Text -> m () #
Lifted version of appendFile.
withFile :: (MonadIO m, MonadMask m) => FilePath -> IOMode -> (Handle -> m a) -> m a #
Opens a file, manipulates it with the provided function and closes the
handle before returning. The Handle can be written to using the
hPutStr and hPutStrLn functions.
withFile is essentially the bracket pattern, specialized to files. This
should be preferred over openFile + hClose as it properly deals with
(asynchronous) exceptions. In cases where withFile is insufficient, for
instance because the it is not statically known when manipulating the
Handle has finished, one should consider other safe paradigms for resource
usage, such as the ResourceT transformer from the resourcet package,
before resorting to openFile and hClose.
writeIORef :: MonadIO m => IORef a -> a -> m () #
Lifted version of writeIORef.
modifyIORef :: MonadIO m => IORef a -> (a -> a) -> m () #
Lifted version of modifyIORef.
modifyIORef' :: MonadIO m => IORef a -> (a -> a) -> m () #
Lifted version of modifyIORef'.
atomicModifyIORef :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
Lifted version of atomicModifyIORef.
atomicModifyIORef' :: MonadIO m => IORef a -> (a -> (a, b)) -> m b #
Lifted version of atomicModifyIORef'.
atomicWriteIORef :: MonadIO m => IORef a -> a -> m () #
Lifted version of atomicWriteIORef.
whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f () #
Specialized version of for_ for Maybe. It's used for code readability.
Also helps to avoid space leaks:
Foldable.mapM_ space leak.
>>>whenJust Nothing $ \b -> print (not b)>>>whenJust (Just True) $ \b -> print (not b)False
whenNothing :: Applicative f => Maybe a -> f a -> f a #
Performs default Applicative action if Nothing is given.
Otherwise returns content of Just pured to Applicative.
>>>whenNothing Nothing [True, False][True,False]>>>whenNothing (Just True) [True, False][True]
whenNothing_ :: Applicative f => Maybe a -> f () -> f () #
Performs default Applicative action if Nothing is given.
Do nothing for Just. Convenient for discarding Just content.
>>>whenNothing_ Nothing $ putTextLn "Nothing!"Nothing!>>>whenNothing_ (Just True) $ putTextLn "Nothing!"
whenNothingM :: Monad m => m (Maybe a) -> m a -> m a #
Monadic version of whenNothing.
whenNothingM_ :: Monad m => m (Maybe a) -> m () -> m () #
Monadic version of whenNothingM_.
fromLeft :: a -> Either a b -> a #
Extracts value from Left or return given default value.
>>>fromLeft 0 (Left 3)3>>>fromLeft 0 (Right 5)0
fromRight :: b -> Either a b -> b #
Extracts value from Right or return given default value.
>>>fromRight 0 (Left 3)0>>>fromRight 0 (Right 5)5
leftToMaybe :: Either l r -> Maybe l #
rightToMaybe :: Either l r -> Maybe r #
maybeToRight :: l -> Maybe r -> Either l r #
maybeToLeft :: r -> Maybe l -> Either l r #
whenRightM :: Monad m => m (Either l r) -> (r -> m ()) -> m () #
Monadic version of whenRight.
usingReaderT :: r -> ReaderT r m a -> m a #
Shorter and more readable alias for flip runReaderT.
usingReader :: r -> Reader r a -> a #
Shorter and more readable alias for flip runReader.
usingStateT :: s -> StateT s m a -> m (a, s) #
Shorter and more readable alias for flip runStateT.
usingState :: s -> State s a -> (a, s) #
Shorter and more readable alias for flip runState.
evaluatingStateT :: Functor f => s -> StateT s f a -> f a #
Alias for flip evalStateT. It's not shorter but sometimes
more readable. Done by analogy with using* functions family.
evaluatingState :: s -> State s a -> a #
Alias for flip evalState. It's not shorter but sometimes
more readable. Done by analogy with using* functions family.
executingStateT :: Functor f => s -> StateT s f a -> f s #
Alias for flip execStateT. It's not shorter but sometimes
more readable. Done by analogy with using* functions family.
executingState :: s -> State s a -> s #
Alias for flip execState. It's not shorter but sometimes
more readable. Done by analogy with using* functions family.
maybeToMonoid :: Monoid m => Maybe m -> m #
Type class for types that can be created from one element. singleton
is lone name for this function. Also constructions of different type differ:
:[] for lists, two arguments for Maps. Also some data types are monomorphic.
>>>one True :: [Bool][True]>>>one 'a' :: Text"a">>>one (3, "hello") :: HashMap Int StringfromList [(3,"hello")]
Instances
| One ByteString | |
Defined in Universum.Container.Class Associated Types type OneItem ByteString # Methods one :: OneItem ByteString -> ByteString # | |
| One ByteString | |
Defined in Universum.Container.Class Associated Types type OneItem ByteString # Methods one :: OneItem ByteString -> ByteString # | |
| One Text | |
| One Text | |
| One IntSet | |
| One [a] | |
| One (NonEmpty a) | |
| One (IntMap v) | |
| One (Seq a) | |
| One (Set v) | |
| Prim a => One (Vector a) | |
| Storable a => One (Vector a) | |
| Unbox a => One (Vector a) | |
| Hashable v => One (HashSet v) | |
| One (Vector a) | |
| Hashable k => One (HashMap k v) | |
| One (Map k v) | |
Instances
Very similar to Foldable but also allows instances for monomorphic types
like Text but forbids instances for Maybe and similar. This class is used as
a replacement for Foldable type class. It solves the following problems:
length,foldrand other functions work on more types for which it makes sense.- You can't accidentally use
lengthon polymorphicFoldable(like list), replace list withMaybeand then debug error for two days. - More efficient implementaions of functions for polymorphic types (like
elemforSet).
The drawbacks:
- Type signatures of polymorphic functions look more scary.
- Orphan instances are involved if you want to use
foldr(and similar) on types from libraries.
Minimal complete definition
Nothing
Associated Types
Type of element for some container. Implemented as an asscociated type family because
some containers are monomorphic over element type (like Text, IntSet, etc.)
so we can't implement nice interface using old higher-kinded types
approach. Implementing this as an associated type family instead of
top-level family gives you more control over element types.
Methods
Convert container to list of elements.
>>>toList @Text "aba""aba">>>:t toList @Text "aba"toList @Text "aba" :: [Char]
Checks whether container is empty.
>>>null @Text ""True>>>null @Text "aba"False
foldr :: (Element t -> b -> b) -> b -> t -> b #
foldl :: (b -> Element t -> b) -> b -> t -> b #
foldl' :: (b -> Element t -> b) -> b -> t -> b #
elem :: Element t -> t -> Bool #
foldMap :: Monoid m => (Element t -> m) -> t -> m #
foldr' :: (Element t -> b -> b) -> b -> t -> b #
foldr1 :: (Element t -> Element t -> Element t) -> t -> Element t #
foldl1 :: (Element t -> Element t -> Element t) -> t -> Element t #
notElem :: Element t -> t -> Bool #
all :: (Element t -> Bool) -> t -> Bool #
any :: (Element t -> Bool) -> t -> Bool #
Instances
Type of element for some container. Implemented as an asscociated type family because
some containers are monomorphic over element type (like Text, IntSet, etc.)
so we can't implement nice interface using old higher-kinded types
approach. Implementing this as an associated type family instead of
top-level family gives you more control over element types.
Instances
Type class for data types that can be converted to List of Pairs.
You can define ToPairs by just defining toPairs function.
But the following laws should be met:
toPairsm ≡zip(keysm) (elemsm)keys≡mapfst.toPairselems≡mapsnd.toPairs
Minimal complete definition
Methods
toPairs :: t -> [(Key t, Val t)] #
Converts the structure to the list of the key-value pairs.
>>> toPairs (HashMap.fromList [(a, "xxx"), (b, "yyy")])
[(a,"xxx"),(b,"yyy")]
Converts the structure to the list of the keys.
>>>keys (HashMap.fromList [('a', "xxx"), ('b', "yyy")])"ab"
Converts the structure to the list of the values.
>>>elems (HashMap.fromList [('a', "xxx"), ('b', "yyy")])["xxx","yyy"]
flipfoldl' :: (Container t, Element t ~ a) => (a -> b -> b) -> b -> t -> b #
Similar to foldl' but takes a function with its arguments flipped.
>>>flipfoldl' (/) 5 [2,3] :: Rational15 % 2
sum :: (Container t, Num (Element t)) => t -> Element t #
Stricter version of sum.
>>>sum [1..10]55>>>sum (Just 3)... • Do not use 'Foldable' methods on Maybe Suggestions: Instead of for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f () use whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f () whenRight :: Applicative f => Either l r -> (r -> f ()) -> f () ... Instead of fold :: (Foldable t, Monoid m) => t m -> m use maybeToMonoid :: Monoid m => Maybe m -> m ...
product :: (Container t, Num (Element t)) => t -> Element t #
Stricter version of product.
>>>product [1..10]3628800>>>product (Right 3)... • Do not use 'Foldable' methods on Either Suggestions: Instead of for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f () use whenJust :: Applicative f => Maybe a -> (a -> f ()) -> f () whenRight :: Applicative f => Either l r -> (r -> f ()) -> f () ... Instead of fold :: (Foldable t, Monoid m) => t m -> m use maybeToMonoid :: Monoid m => Maybe m -> m ...
traverse_ :: (Container t, Applicative f) => (Element t -> f b) -> t -> f () #
for_ :: (Container t, Applicative f) => t -> (Element t -> f b) -> f () #
sequenceA_ :: (Container t, Applicative f, Element t ~ f a) => t -> f () #
Constrained to Container version of sequenceA_.
>>>sequenceA_ [putTextLn "foo", print True]foo True
asum :: (Container t, Alternative f, Element t ~ f a) => t -> f a #
concatMapM :: (Applicative f, Monoid m, Container (l m), Element (l m) ~ m, Traversable l) => (a -> f m) -> l a -> f m #
Lifting bind into a monad. Generalized version of concatMap
that works with a monadic predicate. Old and simpler specialized to list
version had next type:
concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]
Side note: previously it had type
concatMapM :: (Applicative q, Monad m, Traversable m)
=> (a -> q (m b)) -> m a -> q (m b)
Such signature didn't allow to use this function when traversed container type and type of returned by function-argument differed. Now you can use it like e.g.
concatMapM readFile files >>= putTextLn
concatForM :: (Applicative f, Monoid m, Container (l m), Element (l m) ~ m, Traversable l) => l a -> (a -> f m) -> f m #
Like concatMapM, but has its arguments flipped, so can be used
instead of the common fmap concat $ forM pattern.
andM :: (Container f, Element f ~ m Bool, Monad m) => f -> m Bool #
Monadic and constrained to Container version of and.
>>>andM [Just True, Just False]Just False>>>andM [Just True]Just True>>>andM [Just True, Just False, Nothing]Just False>>>andM [Just True, Nothing]Nothing>>>andM [putTextLn "1" >> pure True, putTextLn "2" >> pure False, putTextLn "3" >> pure True]1 2 False
uncons :: [a] -> Maybe (a, [a]) #
Destructuring list into its head and tail if possible. This function is total.
>>>uncons []Nothing>>>uncons [1..5]Just (1,[2,3,4,5])>>>uncons (5 : [1..5]) >>= \(f, l) -> pure $ f == length lJust True
whenNotNull :: Applicative f => [a] -> (NonEmpty a -> f ()) -> f () #
Performs given action over NonEmpty list if given list is non empty.
>>>whenNotNull [] $ \(b :| _) -> print (not b)>>>whenNotNull [False,True] $ \(b :| _) -> print (not b)True
whenNotNullM :: Monad m => m [a] -> (NonEmpty a -> m ()) -> m () #
Monadic version of whenNotNull.
Type that represents exceptions used in cases when a particular codepath is not meant to be ever executed, but happens to be executed anyway.
Constructors
| Bug SomeException CallStack |
Instances
| Show Bug | |
| Exception Bug | |
Defined in Universum.Exception Methods toException :: Bug -> SomeException # fromException :: SomeException -> Maybe Bug # displayException :: Bug -> String # | |
pattern Exc :: Exception e => e -> SomeException #
Pattern synonym to easy pattern matching on exceptions. So intead of writing something like this:
isNonCriticalExc e
| Just (_ :: NodeAttackedError) <- fromException e = True
| Just DialogUnexpected{} <- fromException e = True
| otherwise = False
you can use Exc pattern synonym:
isNonCriticalExc = case
Exc (_ :: NodeAttackedError) -> True -- matching all exceptions of type NodeAttackedError
Exc DialogUnexpected{} -> True
_ -> False
This pattern is bidirectional. You can use Exc e instead of toException e.
bug :: (HasCallStack, Exception e) => e -> a #
Generate a pure value which, when forced, will synchronously
throw the exception wrapped into Bug data type.
note :: MonadError e m => e -> Maybe a -> m a #
Throws error for Maybe if Nothing is given.
Operates over MonadError.
evaluateWHNF :: MonadIO m => a -> m a #
Lifted alias for evaluate with clearer name.
evaluateWHNF_ :: MonadIO m => a -> m () #
Like evaluateWNHF but discards value.
evaluateNF :: (NFData a, MonadIO m) => a -> m a #
Alias for evaluateWHNF . force with clearer name.
evaluateNF_ :: (NFData a, MonadIO m) => a -> m () #
Alias for evaluateWHNF . rnf. Similar to evaluateNF
but discards resulting value.
whenM :: Monad m => m Bool -> m () -> m () #
Monadic version of when.
>>>whenM (pure False) $ putTextLn "No text :(">>>whenM (pure True) $ putTextLn "Yes text :)"Yes text :)>>>whenM (Just True) (pure ())Just ()>>>whenM (Just False) (pure ())Just ()>>>whenM Nothing (pure ())Nothing
unlessM :: Monad m => m Bool -> m () -> m () #
Monadic version of unless.
>>>unlessM (pure False) $ putTextLn "No text :("No text :(>>>unlessM (pure True) $ putTextLn "Yes text :)"
ifM :: Monad m => m Bool -> m a -> m a -> m a #
Monadic version of if-then-else.
>>>ifM (pure True) (putTextLn "True text") (putTextLn "False text")True text
guardM :: MonadPlus m => m Bool -> m () #
Monadic version of guard. Occasionally useful.
Here some complex but real-life example:
findSomePath :: IO (Maybe FilePath)
somePath :: MaybeT IO FilePath
somePath = do
path <- MaybeT findSomePath
guardM $ liftIO $ doesDirectoryExist path
return path
sortNub :: Ord a => [a] -> [a] #
Like ordNub but also sorts a list.
>>>sortNub [3, 3, 3, 2, 2, -1, 1][-1,1,2,3]
unstableNub :: (Eq a, Hashable a) => [a] -> [a] #
Like hashNub but has better performance and also doesn't save the order.
>>>unstableNub [3, 3, 3, 2, 2, -1, 1][1,2,3,-1]
Support class to overload writing of string like values.
Instances
| Print ByteString | |
Defined in Universum.Print.Internal | |
| Print ByteString | |
Defined in Universum.Print.Internal | |
| Print Text | |
| Print Text | |
| Print [Char] | |
hPutStr :: (Print a, MonadIO m) => Handle -> a -> m () #
Write a string like value a to a supplied Handle.
hPutStrLn :: (Print a, MonadIO m) => Handle -> a -> m () #
Write a string like value a to a supplied Handle, appending a
newline character.
putStrLn :: (Print a, MonadIO m) => a -> m () #
Write a string like value to stdout appending a newline character.
putLTextLn :: MonadIO m => Text -> m () #
Similar to undefined but data type.
Constructors
| Undefined |
Instances
| Bounded Undefined | |
| Enum Undefined | |
Defined in Universum.Debug Methods succ :: Undefined -> Undefined # pred :: Undefined -> Undefined # fromEnum :: Undefined -> Int # enumFrom :: Undefined -> [Undefined] # enumFromThen :: Undefined -> Undefined -> [Undefined] # enumFromTo :: Undefined -> Undefined -> [Undefined] # enumFromThenTo :: Undefined -> Undefined -> Undefined -> [Undefined] # | |
| Eq Undefined | |
| Data Undefined | |
Defined in Universum.Debug Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Undefined -> c Undefined # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Undefined # toConstr :: Undefined -> Constr # dataTypeOf :: Undefined -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Undefined) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Undefined) # gmapT :: (forall b. Data b => b -> b) -> Undefined -> Undefined # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Undefined -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Undefined -> r # gmapQ :: (forall d. Data d => d -> u) -> Undefined -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Undefined -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Undefined -> m Undefined # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Undefined -> m Undefined # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Undefined -> m Undefined # | |
| Ord Undefined | |
| Read Undefined | |
| Show Undefined | |
| Generic Undefined | |
| type Rep Undefined | |
traceShowId :: Show a => a -> a #
Version of traceShowId that leaves a warning.
traceIdWith :: (a -> Text) -> a -> a #
Version of traceId that leaves a warning.
Useful to tag printed data, for instance:
traceIdWith (x -> "My data: " <> show x) (veryLargeExpression)
This is especially useful with custom formatters:
traceIdWith (x -> "My data: " <> pretty x) (veryLargeExpression)
traceShowIdWith :: Show s => (a -> s) -> a -> a #
Version of traceShowId that leaves a warning.
Useful to tag printed data, for instance:
traceShowIdWith ("My data: ", ) (veryLargeExpression)
traceShowM :: (Show a, Monad m) => a -> m () #
Version of traceShowM that leaves a warning.
Type class for converting other strings to String.
Type class for converting other strings to Text.
Type class for converting other strings to Text.
Instances
| ToText String | |
Defined in Universum.String.Conversion | |
| ToText Text | |
Defined in Universum.String.Conversion | |
| ToText Text | |
Defined in Universum.String.Conversion | |
| ToText MText | |
Defined in Michelson.Text | |
class ConvertUtf8 a b where #
Type class for conversion to utf8 representation of text.
Methods
encodeUtf8 :: a -> b #
Encode as utf8 string (usually ByteString).
>>>encodeUtf8 @Text @ByteString "патак""\208\191\208\176\209\130\208\176\208\186"
decodeUtf8 :: b -> a #
Decode from utf8 string.
>>>decodeUtf8 @Text @ByteString "\208\191\208\176\209\130\208\176\208\186""\1087\1072\1090\1072\1082">>>putStrLn $ decodeUtf8 @Text @ByteString "\208\191\208\176\209\130\208\176\208\186"патак
decodeUtf8Strict :: b -> Either UnicodeException a #
Decode as utf8 string but returning execption if byte sequence is malformed.
>>>decodeUtf8 @Text @ByteString "\208\208\176\209\130\208\176\208\186""\65533\1072\1090\1072\1082"
>>>decodeUtf8Strict @Text @ByteString "\208\208\176\209\130\208\176\208\186"Left Cannot decode byte '\xd0': Data.Text.Internal.Encoding.decodeUtf8: Invalid UTF-8 stream
Instances
type LByteString = ByteString #
Type synonym for ByteString.
readEither :: (ToString a, Read b) => a -> Either Text b #
Polymorhpic version of readEither.
>>>readEither @Text @Int "123"Right 123>>>readEither @Text @Int "aa"Left "Prelude.read: no parse"
type With (a :: [k -> Constraint]) (b :: k) = a <+> b #
Map several constraints over a single variable.
Note, that With a b ≡ Each a '[b]
a :: With [Show, Read] a => a -> a = a :: (Show a, Read a) => a -> a
class SuperComposition a b c | a b -> c where #
This type class allows to implement variadic composition operator.
Methods
(...) :: a -> b -> c infixl 8 #
Allows to apply function to result of another function with multiple arguments.
>>>(show ... (+)) 1 2"3">>>show ... 5"5">>>(null ... zip5) [1] [2] [3] [] [5]True
Inspired by http://stackoverflow.com/questions/9656797/variadic-compose-function.
Performance
To check the performance there was done a bunch of benchmarks. Benchmarks were made on
examples given above and also on the functions of many arguments.
The results are showing that the operator (...) performs as fast as
plain applications of the operator (.) on almost all the tests, but (...)
leads to the performance draw-down if ghc fails to inline it.
Slow behavior was noticed on functions without type specifications.
That's why keep in mind that providing explicit type declarations for functions is very
important when using (...).
Relying on type inference will lead to the situation when all optimizations
disappear due to very general inferred type. However, functions without type
specification but with applied INLINE pragma are fast again.
Instances
| (a ~ c, r ~ b) => SuperComposition (a -> b) c r | |
Defined in Universum.VarArg | |
| (SuperComposition (a -> b) d r1, r ~ (c -> r1)) => SuperComposition (a -> b) (c -> d) r | |
Defined in Universum.VarArg | |
data UnicodeException #
An exception type for representing Unicode encoding errors.
Instances
| Eq UnicodeException | |
Defined in Data.Text.Encoding.Error Methods (==) :: UnicodeException -> UnicodeException -> Bool # (/=) :: UnicodeException -> UnicodeException -> Bool # | |
| Show UnicodeException | |
Defined in Data.Text.Encoding.Error Methods showsPrec :: Int -> UnicodeException -> ShowS # show :: UnicodeException -> String # showList :: [UnicodeException] -> ShowS # | |
| Exception UnicodeException | |
Defined in Data.Text.Encoding.Error Methods toException :: UnicodeException -> SomeException # | |
| NFData UnicodeException | |
Defined in Data.Text.Encoding.Error Methods rnf :: UnicodeException -> () # | |
type OnDecodeError = OnError Word8 Char #
A handler for a decoding error.
type OnError a b = String -> Maybe a -> Maybe b #
Function type for handling a coding error. It is supplied with two inputs:
- A
Stringthat describes the error. - The input value that caused the error. If the error arose
because the end of input was reached or could not be identified
precisely, this value will be
Nothing.
If the handler returns a value wrapped with Just, that value will
be used in the output as the replacement for the invalid input. If
it returns Nothing, no value will be used in the output.
Should the handler need to abort processing, it should use error
or throw an exception (preferably a UnicodeException). It may
use the description provided to construct a more helpful error
report.
strictDecode :: OnDecodeError #
Throw a UnicodeException if decoding fails.
lenientDecode :: OnDecodeError #
Replace an invalid input byte with the Unicode replacement character U+FFFD.
decodeUtf8With :: OnDecodeError -> ByteString -> Text #
Decode a ByteString containing UTF-8 encoded text.
NOTE: The replacement character returned by OnDecodeError
MUST be within the BMP plane; surrogate code points will
automatically be remapped to the replacement char U+FFFD
(since 0.11.3.0), whereas code points beyond the BMP will throw an
error (since 1.2.3.1); For earlier versions of text using
those unsupported code points would result in undefined behavior.
decodeUtf8' :: ByteString -> Either UnicodeException Text #
Decode a ByteString containing UTF-8 encoded text.
If the input contains any invalid UTF-8 data, the relevant exception will be returned, otherwise the decoded text.
modifyTVar' :: TVar a -> (a -> a) -> STM () #
Strict version of modifyTVar.
Since: stm-2.3
throwM :: (MonadThrow m, Exception e) => e -> m a #
Synonym for throw
Since: safe-exceptions-0.1.0.0
catch :: (MonadCatch m, Exception e) => m a -> (e -> m a) -> m a #
Same as upstream catch, but will not catch asynchronous
exceptions
Since: safe-exceptions-0.1.0.0
catchAny :: MonadCatch m => m a -> (SomeException -> m a) -> m a #
catch specialized to catch all synchronous exception
Since: safe-exceptions-0.1.0.0
handleAny :: MonadCatch m => (SomeException -> m a) -> m a -> m a #
Flipped version of catchAny
Since: safe-exceptions-0.1.0.0
try :: (MonadCatch m, Exception e) => m a -> m (Either e a) #
Same as upstream try, but will not catch asynchronous
exceptions
Since: safe-exceptions-0.1.0.0
tryAny :: MonadCatch m => m a -> m (Either SomeException a) #
try specialized to catch all synchronous exceptions
Since: safe-exceptions-0.1.0.0
onException :: MonadMask m => m a -> m b -> m a #
Async safe version of onException
Since: safe-exceptions-0.1.0.0
bracket :: MonadMask m => m a -> (a -> m b) -> (a -> m c) -> m c #
Async safe version of bracket
Since: safe-exceptions-0.1.7.0
bracket_ :: MonadMask m => m a -> m b -> m c -> m c #
Async safe version of bracket_
Since: safe-exceptions-0.1.0.0
finally :: MonadMask m => m a -> m b -> m a #
Async safe version of finally
Since: safe-exceptions-0.1.0.0
bracketOnError :: MonadMask m => m a -> (a -> m b) -> (a -> m c) -> m c #
Async safe version of bracketOnError
Since: safe-exceptions-0.1.0.0
execStateT :: Monad m => StateT s m a -> s -> m s #
Evaluate a state computation with the given initial state and return the final state, discarding the final value.
execStateTm s =liftMsnd(runStateTm s)
evalStateT :: Monad m => StateT s m a -> s -> m a #
Evaluate a state computation with the given initial state and return the final value, discarding the final state.
evalStateTm s =liftMfst(runStateTm s)
Arguments
| :: State s a | state-passing computation to execute |
| -> s | initial value |
| -> s | final state |
Arguments
| :: State s a | state-passing computation to execute |
| -> s | initial value |
| -> a | return value of the state computation |
Arguments
| :: State s a | state-passing computation to execute |
| -> s | initial state |
| -> (a, s) | return value and final state |
Unwrap a state monad computation as a function.
(The inverse of state.)
Arguments
| :: Reader r a | A |
| -> r | An initial environment. |
| -> a |
Runs a Reader and extracts the final value from it.
(The inverse of reader.)
runExceptT :: ExceptT e m a -> m (Either e a) #
The inverse of ExceptT.
modify' :: MonadState s m => (s -> s) -> m () #
A variant of modify in which the computation is strict in the
new state.
Since: mtl-2.2
class MonadTrans (t :: (Type -> Type) -> Type -> Type) where #
The class of monad transformers. Instances should satisfy the
following laws, which state that lift is a monad transformation:
Methods
lift :: Monad m => m a -> t m a #
Lift a computation from the argument monad to the constructed monad.
Instances
| MonadTrans MaybeT | |
Defined in Control.Monad.Trans.Maybe | |
| MonadTrans Free | This is not a true monad transformer. It is only a monad transformer "up to |
Defined in Control.Monad.Free | |
| MonadTrans Yoneda | |
Defined in Data.Functor.Yoneda | |
| MonadTrans (IdentityT :: (Type -> Type) -> Type -> Type) | |
Defined in Control.Monad.Trans.Identity | |
| MonadTrans (ExceptT e) | |
Defined in Control.Monad.Trans.Except | |
| MonadTrans (FreeT f) | |
Defined in Control.Monad.Trans.Free | |
| Alternative f => MonadTrans (CofreeT f) | |
Defined in Control.Comonad.Trans.Cofree | |
| MonadTrans (ErrorT e) | |
Defined in Control.Monad.Trans.Error | |
| MonadTrans (StateT s) | |
Defined in Control.Monad.Trans.State.Strict | |
| MonadTrans (ReaderT r) | |
Defined in Control.Monad.Trans.Reader | |